Skip to content

Commit e25b378

Browse files
committed
Remove trailing whitespace
1 parent a7d6494 commit e25b378

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

src/hole.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@ impl HoleList {
4343
/// Searches the list for a big enough hole. A hole is big enough if it can hold an allocation
4444
/// of `size` bytes with the given `align`. If such a hole is found in the list, a block of the
4545
/// required size is allocated from it. Then the start address of that block is returned.
46-
/// This function uses the “first fit” strategy, so it uses the first hole that is big enough.
46+
/// This function uses the “first fit” strategy, so it uses the first hole that is big enough.
4747
/// Thus the runtime is in O(n) but it should be reasonably fast for small allocations.
4848
pub fn allocate_first_fit(&mut self, size: usize, align: usize) -> Option<*mut u8> {
4949
assert!(size >= Self::min_size());
@@ -202,7 +202,7 @@ fn allocate_first_fit(previous: &mut Hole, size: usize, align: usize) -> Option<
202202
}
203203

204204
/// Frees the allocation given by `(addr, size)`. It starts at the given hole and walks the list to
205-
/// find the correct place (the list is sorted by address).
205+
/// find the correct place (the list is sorted by address).
206206
fn deallocate(hole: &mut Hole, addr: usize, size: usize) {
207207
assert!(size >= HoleList::min_size());
208208

0 commit comments

Comments
 (0)