Typo fixes
Unified · Split
| @@ -131,7 +131,7 @@ pub fn create(path: impl AsRef<std::path::Path>) -> anyhow::Result<rusqlite::Con · 130 unmodified lines | ||
| 131 | 131 | task integer, |
| 132 | 132 | gitoxide_version integer, |
| 133 | 133 | insertion_time integer NOT NULL, -- in seconds since UNIX epoch |
| 134 | − duration real, -- in seconds or NULL if not yet finished (either successfull or with failure) | |
| 134 | + duration real, -- in seconds or NULL if not yet finished (either successful or with failure) | |
| 135 | 135 | error text, -- or NULL if there was no error |
| 136 | 136 | spans_json text, -- all spans collecteted while performing the run |
| 137 | 137 | FOREIGN KEY (repository) REFERENCES repository (id), |
| @@ -27,7 +27,7 @@ pub(crate) mod function { · 26 unmodified lines | ||
| 27 | 27 | let commits = id |
| 28 | 28 | .object()? |
| 29 | 29 | .peel_to_kind(gix::object::Kind::Commit) |
| 30 | − .context("Need commitish as starting point")? | |
| 30 | + .context("Need committish as starting point")? | |
| 31 | 31 | .id() |
| 32 | 32 | .ancestors() |
| 33 | 33 | .sorting(Sorting::ByCommitTimeNewestFirst) |
| @@ -14,7 +14,7 @@ pub fn function(mut repo: gix::Repository, spec: Option<String>, mut out: impl s · 13 unmodified lines | ||
| 14 | 14 | let commits: gix::revision::Walk<'_> = id |
| 15 | 15 | .object()? |
| 16 | 16 | .peel_to_kind(gix::object::Kind::Commit) |
| 17 | − .context("Need commitish as starting point")? | |
| 17 | + .context("Need committish as starting point")? | |
| 18 | 18 | .id() |
| 19 | 19 | .ancestors() |
| 20 | 20 | .all()?; |
| @@ -49,7 +49,7 @@ pub(crate) mod function { · 48 unmodified lines | ||
| 49 | 49 | let commits = id |
| 50 | 50 | .object()? |
| 51 | 51 | .peel_to_kind(gix::object::Kind::Commit) |
| 52 | − .context("Need commitish as starting point")? | |
| 52 | + .context("Need committish as starting point")? | |
| 53 | 53 | .id() |
| 54 | 54 | .ancestors() |
| 55 | 55 | .sorting(Sorting::ByCommitTimeNewestFirst) |
| @@ -86,7 +86,7 @@ mod prepare { · 85 unmodified lines | ||
| 86 | 86 | |
| 87 | 87 | /// Builder |
| 88 | 88 | impl Prepare { |
| 89 | − /// If called, the command will not be executed directly, but with `sh`, but ony if the | |
| 89 | + /// If called, the command will not be executed directly, but with `sh`, but only if the | |
| 90 | 90 | /// command passed to [`prepare`](super::prepare()) requires this. |
| 91 | 91 | /// |
| 92 | 92 | /// This also allows to pass shell scripts as command, or use commands that contain arguments which are subsequently |
| @@ -16,7 +16,7 @@ impl File { · 15 unmodified lines | ||
| 16 | 16 | self.base_graph_count |
| 17 | 17 | } |
| 18 | 18 | |
| 19 | − /// Returns the commit data for the commit located at the given lexigraphical position. | |
| 19 | + /// Returns the commit data for the commit located at the given lexicographical position. | |
| 20 | 20 | /// |
| 21 | 21 | /// `pos` must range from 0 to `self.num_commits()`. |
| 22 | 22 | /// |
| @@ -40,7 +40,7 @@ impl File { · 17 unmodified lines | ||
| 40 | 40 | pub fn id_at(&self, pos: file::Position) -> &gix_hash::oid { |
| 41 | 41 | assert!( |
| 42 | 42 | pos.0 < self.num_commits(), |
| 43 | − "expected lexigraphical position less than {}, got {}", | |
| 43 | + "expected lexicographical position less than {}, got {}", | |
| 44 | 44 | self.num_commits(), |
| 45 | 45 | pos.0 |
| 46 | 46 | ); |
| @@ -115,7 +115,7 @@ impl File { · 68 unmodified lines | ||
| 115 | 115 | pub(crate) fn commit_data_bytes(&self, pos: file::Position) -> &[u8] { |
| 116 | 116 | assert!( |
| 117 | 117 | pos.0 < self.num_commits(), |
| 118 | − "expected lexigraphical position less than {}, got {}", | |
| 118 | + "expected lexicographical position less than {}, got {}", | |
| 119 | 119 | self.num_commits(), |
| 120 | 120 | pos.0 |
| 121 | 121 | ); |
| @@ -47,7 +47,7 @@ fn fuzz(ctx: Ctx) -> Result<()> { · 46 unmodified lines | ||
| 47 | 47 | |
| 48 | 48 | fuzz_target!(|ctx: Ctx| { |
| 49 | 49 | if let Err(e) = fuzz(ctx) { |
| 50 | − // Excersize display/debug fmt code. | |
| 50 | + // Exercise display/debug fmt code. | |
| 51 | 51 | _ = black_box(format!("{e} {e:?}")); |
| 52 | 52 | } |
| 53 | 53 | }); |
| @@ -193,7 +193,7 @@ pub mod prepare_diff { · 192 unmodified lines | ||
| 193 | 193 | /// is `false`. |
| 194 | 194 | /// |
| 195 | 195 | /// Use [`Outcome::interned_input()`] to easily obtain an interner for use with [`imara_diff::diff()`], or maintain one yourself |
| 196 | − /// for greater re-use. | |
| 196 | + /// for greater reuse. | |
| 197 | 197 | InternalDiff { |
| 198 | 198 | /// The algorithm we determined should be used, which is one of (in order, first set one wins): |
| 199 | 199 | /// |
| @@ -349,7 +349,7 @@ impl Platform { · 149 unmodified lines | ||
| 349 | 349 | /// |
| 350 | 350 | /// ### Important |
| 351 | 351 | /// |
| 352 | − /// If an error occours, the previous resource of `kind` will be cleared, preventing further diffs | |
| 352 | + /// If an error occurs, the previous resource of `kind` will be cleared, preventing further diffs | |
| 353 | 353 | /// unless another attempt succeeds. |
| 354 | 354 | pub fn set_resource( |
| 355 | 355 | &mut self, |
Binary file not shown.
| @@ -89,7 +89,7 @@ where · 88 unmodified lines | ||
| 89 | 89 | } |
| 90 | 90 | } |
| 91 | 91 | |
| 92 | −/// A wrapper for implementors of [`std::io::Read`] or [`std::io::BufRead`] with interrupt support. | |
| 92 | +/// A wrapper for implementers of [`std::io::Read`] or [`std::io::BufRead`] with interrupt support. | |
| 93 | 93 | /// |
| 94 | 94 | /// It fails a [read][std::io::Read::read] while an interrupt was requested. |
| 95 | 95 | pub struct Read<'a, R> { |
| @@ -124,7 +124,7 @@ where · 28 unmodified lines | ||
| 124 | 124 | } |
| 125 | 125 | } |
| 126 | 126 | |
| 127 | −/// A wrapper for implementors of [`std::io::Write`] with interrupt checks on each write call. | |
| 127 | +/// A wrapper for implementers of [`std::io::Write`] with interrupt checks on each write call. | |
| 128 | 128 | /// |
| 129 | 129 | /// It fails a [write][std::io::Write::write] while an interrupt was requested. |
| 130 | 130 | pub struct Write<'a, W> { |
| @@ -14,7 +14,7 @@ pub enum Mode { · 13 unmodified lines | ||
| 14 | 14 | |
| 15 | 15 | /// Lifecycle |
| 16 | 16 | impl State { |
| 17 | − /// Handle long-running processes according to `mode`. If an error occours, all remaining processes will be ignored automatically. | |
| 17 | + /// Handle long-running processes according to `mode`. If an error occurs, all remaining processes will be ignored automatically. | |
| 18 | 18 | /// Return a list of `(process, Option<status>)` |
| 19 | 19 | pub fn shutdown(self, mode: Mode) -> Result<Vec<(BString, Option<std::process::ExitStatus>)>, std::io::Error> { |
| 20 | 20 | let mut out = Vec::with_capacity(self.running.len()); |
| @@ -242,7 +242,7 @@ pub enum ToGitOutcome<'pipeline, R> { · 241 unmodified lines | ||
| 242 | 242 | /// |
| 243 | 243 | /// ### Panics |
| 244 | 244 | /// |
| 245 | −/// If `std::io::Read` is used on it and the output is delayed, a panic will occour. The caller is responsible for either disallowing delayed | |
| 245 | +/// If `std::io::Read` is used on it and the output is delayed, a panic will occur. The caller is responsible for either disallowing delayed | |
| 246 | 246 | /// results or if allowed, handle them. Use [`is_delayed()][Self::is_delayed()]. |
| 247 | 247 | pub enum ToWorktreeOutcome<'input, 'pipeline> { |
| 248 | 248 | /// The original input wasn't changed and the original buffer is present |
| @@ -103,7 +103,7 @@ impl Pipeline { · 102 unmodified lines | ||
| 103 | 103 | &mut self.options |
| 104 | 104 | } |
| 105 | 105 | |
| 106 | − /// Return our double-buffers for re-use by the caller. | |
| 106 | + /// Return our double-buffers for reuse by the caller. | |
| 107 | 107 | pub fn buffers_mut(&mut self) -> &mut gix_utils::Buffers { |
| 108 | 108 | &mut self.bufs |
| 109 | 109 | } |
| @@ -101,7 +101,7 @@ fn crlf_in_index_prevents_conversion_to_lf() -> crate::Result { · 100 unmodified lines | ||
| 101 | 101 | let mut buf = Vec::new(); |
| 102 | 102 | let mut called = false; |
| 103 | 103 | let changed = eol::convert_to_git( |
| 104 | − b"elligible\n", | |
| 104 | + b"eligible\n", | |
| 105 | 105 | AttributesDigest::TextAutoInput, |
| 106 | 106 | &mut buf, |
| 107 | 107 | &mut |buf| { |
| @@ -16,7 +16,7 @@ pub struct Iter<'a> { · 15 unmodified lines | ||
| 16 | 16 | |
| 17 | 17 | /// A structure to associate object ids of a tree with sections in the index entries list. |
| 18 | 18 | /// |
| 19 | −/// It allows to more quickly build trees by avoiding as it can quickly re-use portions of the index and its associated tree ids | |
| 19 | +/// It allows to more quickly build trees by avoiding as it can quickly reuse portions of the index and its associated tree ids | |
| 20 | 20 | /// if there was no change to them. Portions of this tree are invalidated as the index is changed. |
| 21 | 21 | #[derive(PartialEq, Eq, Clone, Debug)] |
| 22 | 22 | pub struct Tree { |
| @@ -73,7 +73,7 @@ impl Metadata { · 72 unmodified lines | ||
| 73 | 73 | |
| 74 | 74 | /// Return the time at which the underlying file was created. |
| 75 | 75 | /// |
| 76 | − /// Note that this differes from [`std::fs::Metadata::created()`] which would return | |
| 76 | + /// Note that this differs from [`std::fs::Metadata::created()`] which would return | |
| 77 | 77 | /// the inode birth time, which is notably different to what `git` does. |
| 78 | 78 | pub fn created(&self) -> Option<SystemTime> { |
| 79 | 79 | #[cfg(not(windows))] |
| @@ -5,7 +5,7 @@ use crate::{entry, extension, write::util::CountBytes, State, Version}; · 4 unmodified lines | ||
| 5 | 5 | /// A way to specify which of the optional extensions to write. |
| 6 | 6 | #[derive(Default, Debug, Copy, Clone)] |
| 7 | 7 | pub enum Extensions { |
| 8 | − /// Writes all available optional extensions to avoid loosing any information. | |
| 8 | + /// Writes all available optional extensions to avoid losing any information. | |
| 9 | 9 | #[default] |
| 10 | 10 | All, |
| 11 | 11 | /// Only write the given optional extensions, with each extension being marked by a boolean flag. |
| @@ -66,7 +66,7 @@ pub mod integrity { · 65 unmodified lines | ||
| 66 | 66 | #[derive(Debug, PartialEq, Eq, Hash, Ord, PartialOrd, Clone)] |
| 67 | 67 | #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] |
| 68 | 68 | pub struct IndexStatistics { |
| 69 | − /// The path to the index or multi-pack index for which statics were gathered. | |
| 69 | + /// The path to the index or multi-pack index for which statistics were gathered. | |
| 70 | 70 | pub path: PathBuf, |
| 71 | 71 | /// The actual statistics for the index at `path`. |
| 72 | 72 | pub statistics: SingleOrMultiStatistics, |
| @@ -1,4 +1,4 @@ | ||
| 1 | −//! This module is a bit 'misplaced' if spelled out like '`gix_pack::cache::object::`*' but is best placed here for code re-use and | |
| 1 | +//! This module is a bit 'misplaced' if spelled out like '`gix_pack::cache::object::`*' but is best placed here for code reuse and | |
| 2 | 2 | //! general usefulness. |
| 3 | 3 | use crate::cache; |
| 4 | 4 | |
| @@ -31,7 +31,7 @@ impl Search { · 30 unmodified lines | ||
| 31 | 31 | /// there is none. It doesn't have to end at a directory boundary though, nor does it denote a directory. |
| 32 | 32 | /// |
| 33 | 33 | /// Note that the common_prefix is always matched case-sensitively, and it is useful to skip large portions of input. |
| 34 | − /// Further, excluded pathspecs don't participate which makes this common prefix inclusive. To work correclty though, | |
| 34 | + /// Further, excluded pathspecs don't participate which makes this common prefix inclusive. To work correctly though, | |
| 35 | 35 | /// one will have to additionally match paths that have the common prefix with that pathspec itself to assure it is |
| 36 | 36 | /// not excluded. |
| 37 | 37 | pub fn common_prefix(&self) -> &BStr { |
| @@ -133,7 +133,7 @@ mod impl_ { · 132 unmodified lines | ||
| 133 | 133 | // Admin-group owned folders are considered owned by the current user, if they are in the admin group |
| 134 | 134 | if !is_owned && IsWellKnownSid(token_owner, WinBuiltinAdministratorsSid).as_bool() { |
| 135 | 135 | let mut is_member = BOOL::default(); |
| 136 | − // TODO: re-use the handle | |
| 136 | + // TODO: reuse the handle | |
| 137 | 137 | match CheckTokenMembership(HANDLE::default(), token_owner, &mut is_member) { |
| 138 | 138 | Err(e) => { |
| 139 | 139 | err_msg = Some(format!("Couldn't check if user is an administrator: {}", e)) |
| @@ -19,7 +19,7 @@ pub trait Pathspec { · 18 unmodified lines | ||
| 19 | 19 | /// there is none. It doesn't have to end at a directory boundary though, nor does it denote a directory. |
| 20 | 20 | /// |
| 21 | 21 | /// Note that the common_prefix is always matched case-sensitively, and it is useful to skip large portions of input. |
| 22 | − /// Further, excluded pathspecs don't participate which makes this common prefix inclusive. To work correclty though, | |
| 22 | + /// Further, excluded pathspecs don't participate which makes this common prefix inclusive. To work correctly though, | |
| 23 | 23 | /// one will have to additionally match paths that have the common prefix with that pathspec itself to assure it is |
| 24 | 24 | /// not excluded. |
| 25 | 25 | fn common_prefix(&self) -> &BStr; |
| @@ -68,7 +68,7 @@ fn fixture_filtered_detailed( · 67 unmodified lines | ||
| 68 | 68 | mut prepare_index: impl FnMut(&mut gix_index::State), |
| 69 | 69 | submodule_dirty: bool, |
| 70 | 70 | ) -> Outcome { |
| 71 | − // This can easily happen in some fixtures, which can cause flakyness. It's time-dependent after all. | |
| 71 | + // This can easily happen in some fixtures, which can cause flakiness. It's time-dependent after all. | |
| 72 | 72 | fn ignore_racyclean(mut out: Outcome) -> Outcome { |
| 73 | 73 | out.racy_clean = 0; |
| 74 | 74 | out |
| @@ -116,7 +116,7 @@ fn fixture_filtered_detailed( · 41 unmodified lines | ||
| 116 | 116 | ignore_racyclean(ignore_updated(ignore_worktree_stats(outcome))) |
| 117 | 117 | } |
| 118 | 118 | |
| 119 | −/// Note that we also reset certain information to assure there is no flakyness - everything regarding race-detection otherwise can cause failures. | |
| 119 | +/// Note that we also reset certain information to assure there is no flakiness - everything regarding race-detection otherwise can cause failures. | |
| 120 | 120 | fn records_to_tuple<'index>(records: impl IntoIterator<Item = Record<'index, (), ()>>) -> Vec<Expectation<'index>> { |
| 121 | 121 | records |
| 122 | 122 | .into_iter() |
| @@ -264,7 +264,7 @@ macro_rules! fieldset { · 263 unmodified lines | ||
| 264 | 264 | $crate::fieldset!(@ { $($out),*, $k } $($rest)*) |
| 265 | 265 | }; |
| 266 | 266 | |
| 267 | − // Remainder is unparseable, but exists --- must be format args! | |
| 267 | + // Remainder is unparsable, but exists --- must be format args! | |
| 268 | 268 | (@ { $(,)* $($out:expr),* } $($rest:tt)+) => { |
| 269 | 269 | $crate::fieldset!(@ { "message", $($out),*, }) |
| 270 | 270 | }; |
| @@ -1,4 +1,4 @@ | ||
| 1 | −//! A crate providing macros for creating spans in various detail levels. `coarse!` shoudl be used for top-level operations, whereas | |
| 1 | +//! A crate providing macros for creating spans in various detail levels. `coarse!` should be used for top-level operations, whereas | |
| 2 | 2 | //! `detail!` should be used in plumbing crates unless their operations are likely to cost a lot of time. |
| 3 | 3 | //! |
| 4 | 4 | //! The application is supposed to explicitly turn on tracing via `gix-features`. |
| @@ -47,7 +47,7 @@ pub mod visit { · 46 unmodified lines | ||
| 47 | 47 | pub enum Action { |
| 48 | 48 | /// Continue the traversal of entries. |
| 49 | 49 | Continue, |
| 50 | − /// Stop the traversal of entries, making this te last call to [`visit_(tree|nontree)(…)`][super::Visit::visit_nontree()]. | |
| 50 | + /// Stop the traversal of entries, making this the last call to [`visit_(tree|nontree)(…)`][super::Visit::visit_nontree()]. | |
| 51 | 51 | Cancel, |
| 52 | 52 | /// Don't dive into the entry, skipping children effectively. Only useful in [`visit_tree(…)`][super::Visit::visit_tree()]. |
| 53 | 53 | Skip, |
| @@ -50,7 +50,7 @@ fn run() { · 49 unmodified lines | ||
| 50 | 50 | |
| 51 | 51 | assert_ne!(test_count, 0, "the baseline is never empty"); |
| 52 | 52 | if failures.is_empty() { |
| 53 | − todo!("The baseline is currently meddling with hooks, thats not needed anymore since the failure rate is 0: move this into a module of the normal tests"); | |
| 53 | + todo!("The baseline is currently meddling with hooks, that's not needed anymore since the failure rate is 0: move this into a module of the normal tests"); | |
| 54 | 54 | } |
| 55 | 55 | |
| 56 | 56 | let failure_count = failures.len(); |
| @@ -102,7 +102,7 @@ fn no_relative_paths_if_protocol() -> crate::Result { · 101 unmodified lines | ||
| 102 | 102 | assert_matches::assert_matches!( |
| 103 | 103 | gix_url::parse("file://.\\".into()), |
| 104 | 104 | Err(gix_url::parse::Error::MissingRepositoryPath { .. }), |
| 105 | − "DEVIATION: on windows, this parses with git into something nonesensical Diag: url=file://./ Diag: protocol=file Diag: hostandport=./ Diag: path=//./" | |
| 105 | + "DEVIATION: on windows, this parses with git into something nonsensical Diag: url=file://./ Diag: protocol=file Diag: hostandport=./ Diag: path=//./" | |
| 106 | 106 | ); |
| 107 | 107 | } |
| 108 | 108 | Ok(()) |
| @@ -26,7 +26,7 @@ default = ["max-performance-safe", "comfort", "basic", "extras"] · 25 unmodified lines | ||
| 26 | 26 | #! enabled as long as it doesn't sacrifice compatibility. Most users will be fine with that but will pay with higher compile times than necessary as they |
| 27 | 27 | #! probably don't use all of these features. |
| 28 | 28 | #! |
| 29 | −#! **Thus it's recommended to take a moment and optimize build times by chosing only those 'Components' that you require.** *'Performance' relevant features should | |
| 29 | +#! **Thus it's recommended to take a moment and optimize build times by choosing only those 'Components' that you require.** *'Performance' relevant features should | |
| 30 | 30 | #! be chosen next to maximize efficiency.* |
| 31 | 31 | #! |
| 32 | 32 | #! #### Application Developers |
| @@ -121,11 +121,11 @@ async-network-client = ["gix-protocol/async-client", "gix-pack/streaming-input", · 88 unmodified lines | ||
| 121 | 121 | async-network-client-async-std = ["async-std", "async-network-client", "gix-transport/async-std"] |
| 122 | 122 | ## Make `gix-protocol` available along with a blocking client, providing access to the `file://`, git://` and `ssh://` transports. |
| 123 | 123 | blocking-network-client = ["gix-protocol/blocking-client", "gix-pack/streaming-input", "attributes", "credentials"] |
| 124 | −## Stacks with `blocking-network-client` to provide support for HTTP/S using **curl**, and implies blocking networking as a whole, making the `https://` transport avaialble. | |
| 124 | +## Stacks with `blocking-network-client` to provide support for HTTP/S using **curl**, and implies blocking networking as a whole, making the `https://` transport available. | |
| 125 | 125 | blocking-http-transport-curl = ["blocking-network-client", "gix-transport/http-client-curl"] |
| 126 | 126 | ## Stacks with `blocking-http-transport-curl` and also enables the `rustls` backend to avoid `openssl`. |
| 127 | 127 | blocking-http-transport-curl-rustls = ["blocking-http-transport-curl", "dep:curl-for-configuration-only", "curl-for-configuration-only?/rustls"] |
| 128 | −## Stacks with `blocking-network-client` to provide support for HTTP/S using **reqwest**, and implies blocking networking as a whole, making the `https://` transport avaialble. | |
| 128 | +## Stacks with `blocking-network-client` to provide support for HTTP/S using **reqwest**, and implies blocking networking as a whole, making the `https://` transport available. | |
| 129 | 129 | blocking-http-transport-reqwest = ["blocking-network-client", "gix-transport/http-client-reqwest"] |
| 130 | 130 | ## Stacks with `blocking-http-transport-reqwest` and enables `https://` via the `rustls` crate. |
| 131 | 131 | blocking-http-transport-reqwest-rust-tls = ["blocking-http-transport-reqwest", "reqwest-for-configuration-only/rustls-tls" ] |
| @@ -139,7 +139,7 @@ blocking-http-transport-reqwest-native-tls = ["blocking-http-transport-reqwest", · 7 unmodified lines | ||
| 139 | 139 | #! #### Performance |
| 140 | 140 | #! |
| 141 | 141 | #! The reason these features exist is to allow optimization for compile time and optimize for compatibility by default. This means that some performance options around |
| 142 | −#! SHA1 and ZIP might not compile on all platforms, so it depeneds on the end-user who compiles the application to chose these based on their needs. | |
| 142 | +#! SHA1 and ZIP might not compile on all platforms, so it depends on the end-user who compiles the application to chose these based on their needs. | |
| 143 | 143 | |
| 144 | 144 | ## Activate features that maximize performance, like usage of threads, `zlib-ng` and access to caching in object databases, skipping the ones known to cause compile failures |
| 145 | 145 | ## on some platforms. |
| @@ -1,4 +1,4 @@ | ||
| 1 | −# Thise file contains repository-wide exclude patterns that git will ignore. | |
| 1 | +# This file contains repository-wide exclude patterns that git will ignore. | |
| 2 | 2 | # They are local and will not be shared when pushing or pulling. |
| 3 | 3 | # When using Rust the following would be typical exclude patterns. |
| 4 | 4 | # Remove the '# ' prefix to let them take effect. |
| @@ -144,7 +144,7 @@ pub mod diff { · 143 unmodified lines | ||
| 144 | 144 | #[derive(Debug, thiserror::Error)] |
| 145 | 145 | #[error("Failed to parse value of 'diff.{name}.{attribute}'")] |
| 146 | 146 | pub struct Error { |
| 147 | − /// The name fo the driver. | |
| 147 | + /// The name of the driver. | |
| 148 | 148 | pub name: BString, |
| 149 | 149 | /// The name of the attribute we tried to parse. |
| 150 | 150 | pub attribute: &'static str, |
| @@ -604,7 +604,7 @@ pub(crate) struct Cache { · 453 unmodified lines | ||
| 604 | 604 | // TODO: make core.precomposeUnicode available as well. |
| 605 | 605 | } |
| 606 | 606 | |
| 607 | −/// Utillities shared privately across the crate, for lack of a better place. | |
| 607 | +/// Utilities shared privately across the crate, for lack of a better place. | |
| 608 | 608 | pub(crate) mod shared { |
| 609 | 609 | use crate::{ |
| 610 | 610 | config, |
| @@ -193,7 +193,7 @@ where · 192 unmodified lines | ||
| 193 | 193 | } |
| 194 | 194 | } |
| 195 | 195 | |
| 196 | −/// A wrapper for implementors of [`std::io::Read`] or [`std::io::BufRead`] with interrupt support. | |
| 196 | +/// A wrapper for implementers of [`std::io::Read`] or [`std::io::BufRead`] with interrupt support. | |
| 197 | 197 | /// |
| 198 | 198 | /// It fails a [read][`std::io::Read::read`] while an interrupt was requested. |
| 199 | 199 | pub struct Read<R> { |
| @@ -47,7 +47,7 @@ impl<'repo> Tree<'repo> { · 46 unmodified lines | ||
| 47 | 47 | /// # Performance Notes |
| 48 | 48 | /// |
| 49 | 49 | /// Searching tree entries is currently done in sequence, which allows to the search to be allocation free. It would be possible |
| 50 | − /// to re-use a vector and use a binary search instead, which might be able to improve performance over all. | |
| 50 | + /// to reuse a vector and use a binary search instead, which might be able to improve performance over all. | |
| 51 | 51 | /// However, a benchmark should be created first to have some data and see which trade-off to choose here. |
| 52 | 52 | /// |
| 53 | 53 | pub fn lookup_entry<I, P>(&self, path: I, buf: &mut Vec<u8>) -> Result<Option<Entry<'repo>>, find::existing::Error> |
| @@ -91,7 +91,7 @@ impl<'repo> Tree<'repo> { · 37 unmodified lines | ||
| 91 | 91 | /// # Performance Notes |
| 92 | 92 | /// |
| 93 | 93 | /// Searching tree entries is currently done in sequence, which allows to the search to be allocation free. It would be possible |
| 94 | − /// to re-use a vector and use a binary search instead, which might be able to improve performance over all. | |
| 94 | + /// to reuse a vector and use a binary search instead, which might be able to improve performance over all. | |
| 95 | 95 | /// However, a benchmark should be created first to have some data and see which trade-off to choose here. |
| 96 | 96 | /// |
| 97 | 97 | pub fn peel_to_entry<I, P>(&mut self, path: I) -> Result<Option<Entry<'repo>>, find::existing::Error> |
| @@ -99,7 +99,7 @@ impl crate::Repository { · 98 unmodified lines | ||
| 99 | 99 | /// which would then lead to `refs/remotes/origin/other` to be returned instead. |
| 100 | 100 | /// |
| 101 | 101 | /// Note that if there is an ambiguity, that is if `name` maps to multiple tracking branches, the first matching mapping |
| 102 | − /// is returned, according to the order in which the fetch or push refspecs occour in the configuration file. | |
| 102 | + /// is returned, according to the order in which the fetch or push refspecs occur in the configuration file. | |
| 103 | 103 | /// |
| 104 | 104 | /// See also [`Reference::remote_tracking_ref_name()`](crate::Reference::remote_tracking_ref_name()). |
| 105 | 105 | #[doc(alias = "branch_upstream_name", alias = "git2")] |
| @@ -150,7 +150,7 @@ pub struct Repository { · 149 unmodified lines | ||
| 150 | 150 | pub(crate) work_tree: Option<PathBuf>, |
| 151 | 151 | /// The path to the resolved common directory if this is a linked worktree repository or it is otherwise set. |
| 152 | 152 | pub(crate) common_dir: Option<PathBuf>, |
| 153 | − /// A free-list of re-usable object backing buffers | |
| 153 | + /// A free-list of reusable object backing buffers | |
| 154 | 154 | pub(crate) bufs: RefCell<Vec<Vec<u8>>>, |
| 155 | 155 | /// A pre-assembled selection of often-accessed configuration values for quick access. |
| 156 | 156 | pub(crate) config: crate::config::Cache, |
| @@ -345,7 +345,7 @@ mod blocking_and_async_io { · 344 unmodified lines | ||
| 345 | 345 | for (shallow_args, expected) in [(None, [1, 7, 7]), (Some("--depth=2"), [1, 2, 2])] { |
| 346 | 346 | if version == gix::protocol::transport::Protocol::V1 && shallow_args.is_some() { |
| 347 | 347 | // TODO: We cannot yet handle shallow mode for V1 as it will send shallow-info as part of the handshake :/. |
| 348 | − // It's probaby not the most important thing to be able to clone from a shallow remote anyway. | |
| 348 | + // It's probably not the most important thing to be able to clone from a shallow remote anyway. | |
| 349 | 349 | continue; |
| 350 | 350 | } |
| 351 | 351 | for (fetch_tags, expected_ref_count) in [fetch::Tags::None, fetch::Tags::Included, fetch::Tags::All] |
| @@ -301,7 +301,7 @@ mod branch_remote { · 300 unmodified lines | ||
| 301 | 301 | .expect("exists")? |
| 302 | 302 | .shorten(), |
| 303 | 303 | "origin/other", |
| 304 | − "as above, but we covert it to the tracking branch" | |
| 304 | + "as above, but we convert it to the tracking branch" | |
| 305 | 305 | ); |
| 306 | 306 | |
| 307 | 307 | repo.config_snapshot_mut().set_value(&Push::DEFAULT, "simple")?; |
| @@ -24,5 +24,5 @@ · 23 unmodified lines | ||
| 24 | 24 | #![allow(missing_docs)] |
| 25 | 25 | #![forbid(unsafe_code)] |
| 26 | 26 | |
| 27 | −/// everything in common beteween the `gix` and `ein` binaries. | |
| 27 | +/// everything in common between the `gix` and `ein` binaries. | |
| 28 | 28 | pub mod shared; |
| @@ -78,7 +78,7 @@ pub struct Args { · 77 unmodified lines | ||
| 78 | 78 | |
| 79 | 79 | #[derive(Debug, clap::Subcommand)] |
| 80 | 80 | pub enum Subcommands { |
| 81 | − /// Subcommands for creating worktree archivs | |
| 81 | + /// Subcommands for creating worktree archives | |
| 82 | 82 | #[cfg(feature = "gitoxide-core-tools-archive")] |
| 83 | 83 | Archive(archive::Platform), |
| 84 | 84 | /// Subcommands for interacting with commit-graphs |