Showing the changes to git-pack/src/data (6 of 58 files). Show all
Unified · Split
| @@ -135,7 +135,7 @@ impl File { · 134 unmodified lines | ||
| 135 | 135 | /// a base object, instead of an in-pack offset. |
| 136 | 136 | /// |
| 137 | 137 | /// `delta_cache` is a mechanism to avoid looking up base objects multiple times when decompressing multiple objects in a row. |
| 138 | − /// Use a [Noop-Cache][cache::Never] to disable caching alltogether at the cost of repeating work. | |
| 138 | + /// Use a [Noop-Cache][cache::Never] to disable caching all together at the cost of repeating work. | |
| 139 | 139 | pub fn decode_entry( |
| 140 | 140 | &self, |
| 141 | 141 | entry: crate::data::Entry, |
| @@ -165,7 +165,7 @@ impl File { · 23 unmodified lines | ||
| 165 | 165 | } |
| 166 | 166 | } |
| 167 | 167 | |
| 168 | − /// resolve: technically, this shoudln't ever be required as stored local packs don't refer to objects by id | |
| 168 | + /// resolve: technically, this shouldn't ever be required as stored local packs don't refer to objects by id | |
| 169 | 169 | /// that are outside of the pack. Unless, of course, the ref refers to an object within this pack, which means |
| 170 | 170 | /// it's very, very large as 20bytes are smaller than the corresponding MSB encoded number |
| 171 | 171 | fn resolve_deltas( |
| @@ -298,7 +298,7 @@ impl File { · 126 unmodified lines | ||
| 298 | 298 | let end = first_buffer_size + second_buffer_size; |
| 299 | 299 | if delta_range.start < end { |
| 300 | 300 | // …this means that the delta size is even larger than two uncompressed worst-case |
| 301 | − // intermediate results combined. It would already be undesireable to have it bigger | |
| 301 | + // intermediate results combined. It would already be undesirable to have it bigger | |
| 302 | 302 | // then the target size (as you could just store the object in whole). |
| 303 | 303 | // However, this just means that it reuses existing deltas smartly, which as we rightfully |
| 304 | 304 | // remember stand for an object each. However, this means a lot of data is read to restore |
| @@ -21,7 +21,7 @@ pub struct EntriesToBytesIter<I: Iterator, W> { · 20 unmodified lines | ||
| 21 | 21 | data_version: crate::data::Version, |
| 22 | 22 | /// The amount of entries seen so far |
| 23 | 23 | num_entries: u32, |
| 24 | − /// If we are done, no additional writes will occour | |
| 24 | + /// If we are done, no additional writes will occur | |
| 25 | 25 | is_done: bool, |
| 26 | 26 | /// The kind of hash to use for the digest |
| 27 | 27 | object_hash: git_hash::Kind, |
| @@ -33,7 +33,7 @@ where · 5 unmodified lines | ||
| 33 | 33 | W: std::io::Read + std::io::Write + std::io::Seek, |
| 34 | 34 | { |
| 35 | 35 | /// Create a new instance reading [entries][input::Entry] from an `input` iterator and write pack data bytes to |
| 36 | − /// `output` writer, resembling a pack of `version`. The amonut of entries will be dynaimcally determined and | |
| 36 | + /// `output` writer, resembling a pack of `version`. The amount of entries will be dynaimcally determined and | |
| 37 | 37 | /// the pack is completed once the last entry was written. |
| 38 | 38 | /// `object_hash` is the kind of hash to use for the pack checksum and maybe other places, depending on the version. |
| 39 | 39 | /// |
| @@ -37,7 +37,7 @@ pub struct FromEntriesIter<I, W> { · 36 unmodified lines | ||
| 37 | 37 | /// It stores the pack offsets at which objects begin. |
| 38 | 38 | /// Additionally we store if an object was invalid, and if so we will not write it nor will we allow delta objects to it. |
| 39 | 39 | pack_offsets_and_validity: Vec<(u64, bool)>, |
| 40 | − /// If we are done, no additional writes will occour | |
| 40 | + /// If we are done, no additional writes will occur | |
| 41 | 41 | is_done: bool, |
| 42 | 42 | } |
| 43 | 43 | |
| @@ -8,7 +8,7 @@ use crate::data::output::Count; · 7 unmodified lines | ||
| 8 | 8 | pub enum PackLocation { |
| 9 | 9 | /// We did not lookup this object |
| 10 | 10 | NotLookedUp, |
| 11 | − /// The object was looked up and there may be a location in a pack, along with enty information | |
| 11 | + /// The object was looked up and there may be a location in a pack, along with entry information | |
| 12 | 12 | LookedUp(Option<crate::data::entry::Location>), |
| 13 | 13 | } |
| 14 | 14 | |
| @@ -58,7 +58,7 @@ impl Default for ObjectExpansion { · 57 unmodified lines | ||
| 58 | 58 | } |
| 59 | 59 | } |
| 60 | 60 | |
| 61 | −/// Configuration options for the pack generation functions provied in [this module][crate::data::output]. | |
| 61 | +/// Configuration options for the pack generation functions provided in [this module][crate::data::output]. | |
| 62 | 62 | #[derive(PartialEq, Eq, Debug, Hash, Ord, PartialOrd, Clone, Copy)] |
| 63 | 63 | #[cfg_attr(feature = "serde1", derive(serde::Serialize, serde::Deserialize))] |
| 64 | 64 | pub struct Options { |
| @@ -351,7 +351,7 @@ mod types { · 350 unmodified lines | ||
| 351 | 351 | PackCopyAndBaseObjects, |
| 352 | 352 | } |
| 353 | 353 | |
| 354 | − /// Configuration options for the pack generation functions provied in [this module][crate::data::output]. | |
| 354 | + /// Configuration options for the pack generation functions provided in [this module][crate::data::output]. | |
| 355 | 355 | #[derive(PartialEq, Eq, Debug, Hash, Ord, PartialOrd, Clone, Copy)] |
| 356 | 356 | #[cfg_attr(feature = "serde1", derive(serde::Serialize, serde::Deserialize))] |
| 357 | 357 | pub struct Options { |