Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remove redundant std:: prefix from type names #369

Merged
merged 1 commit into from
Dec 15, 2024
Merged

Remove redundant std:: prefix from type names #369

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/archive.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -82,7 +82,7 @@

async fn auth(
State(state): State<ArchiveState>,
bearer: std::result::Result<TypedHeader<Authorization<Bearer>>, TypedHeaderRejection>,
bearer: Result<TypedHeader<Authorization<Bearer>>, TypedHeaderRejection>,

Check warning on line 85 in src/archive.rs

View check run for this annotation

Codecov / codecov/patch

src/archive.rs#L85 

Added line #L85 was not covered by tests
req: Request<Body>,
next: Next,
) -> Result<Response, Error> {
Expand Down
14 changes: 5 additions & 9 deletions src/graphql.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -339,14 +339,10 @@ fn process_load_edges<'a, T, I, R>(
first: Option<usize>,
last: Option<usize>,
prefix: Option<&[u8]>,
) -> (
std::vec::Vec<std::result::Result<R, anyhow::Error>>,
bool,
bool,
)
) -> (Vec<anyhow::Result<R>>, bool, bool)
where
T: database::Iterable<'a, I>,
I: std::iter::Iterator<Item = anyhow::Result<R>>,
I: Iterator<Item = anyhow::Result<R>>,
R: database::UniqueKey,
{
let after = after.map(|cursor| cursor.0);
Expand Down Expand Up @@ -377,7 +373,7 @@ fn load_edges_interim<'a, T, I, R>(
) -> Result<(Vec<R>, bool, bool)>
where
T: database::Iterable<'a, I>,
I: std::iter::Iterator<Item = anyhow::Result<R>>,
I: Iterator<Item = anyhow::Result<R>>,
R: database::UniqueKey,
{
let (nodes, has_previous, has_next) =
Expand All @@ -401,7 +397,7 @@ fn load_edges<'a, T, I, R, N, A, NodesField>(
) -> Result<Connection<OpaqueCursor<Vec<u8>>, N, A, EmptyFields, NodesField>>
where
T: database::Iterable<'a, I>,
I: std::iter::Iterator<Item = anyhow::Result<R>>,
I: Iterator<Item = anyhow::Result<R>>,
R: database::UniqueKey,
N: From<R> + OutputType,
A: ObjectType,
Expand Down Expand Up @@ -436,7 +432,7 @@ fn collect_edges<'a, T, I, R>(
) -> (Vec<anyhow::Result<R>>, bool)
where
T: database::Iterable<'a, I>,
I: std::iter::Iterator<Item = anyhow::Result<R>>,
I: Iterator<Item = anyhow::Result<R>>,
R: database::UniqueKey,
{
let edges: Box<dyn Iterator<Item = _>> = if let Some(cursor) = from {
Expand Down
Loading