From 65f35781489ccaa66585b91f215308f3091bf404 Mon Sep 17 00:00:00 2001 From: David Manescu Date: Sat, 1 Feb 2014 00:03:20 +1100 Subject: Rename reserve to reserve_exact and reserve_at_least to reserve Changes in std::{str,vec,hashmap} and extra::{priority_queue,ringbuf}. Fixes #11949 --- src/libstd/vec.rs | 28 ++++++++++++++-------------- 1 file changed, 14 insertions(+), 14 deletions(-) (limited to 'src/libstd/vec.rs') diff --git a/src/libstd/vec.rs b/src/libstd/vec.rs index 15cd5ce3343..f9a90150ad4 100644 --- a/src/libstd/vec.rs +++ b/src/libstd/vec.rs @@ -1335,7 +1335,7 @@ pub trait OwnedVector { * This method always succeeds in reserving space for `n` elements, or it does * not return. */ - fn reserve(&mut self, n: uint); + fn reserve_exact(&mut self, n: uint); /** * Reserves capacity for at least `n` elements in the given vector. * @@ -1350,7 +1350,7 @@ pub trait OwnedVector { * * * n - The number of elements to reserve space for */ - fn reserve_at_least(&mut self, n: uint); + fn reserve(&mut self, n: uint); /** * Reserves capacity for at least `n` additional elements in the given vector. * @@ -1468,7 +1468,7 @@ impl OwnedVector for ~[T] { self.move_iter().rev() } - fn reserve(&mut self, n: uint) { + fn reserve_exact(&mut self, n: uint) { // Only make the (slow) call into the runtime if we have to if self.capacity() < n { unsafe { @@ -1486,8 +1486,8 @@ impl OwnedVector for ~[T] { } #[inline] - fn reserve_at_least(&mut self, n: uint) { - self.reserve(checked_next_power_of_two(n).unwrap_or(n)); + fn reserve(&mut self, n: uint) { + self.reserve_exact(checked_next_power_of_two(n).unwrap_or(n)); } #[inline] @@ -1495,7 +1495,7 @@ impl OwnedVector for ~[T] { if self.capacity() - self.len() < n { match self.len().checked_add(&n) { None => fail!("vec::reserve_additional: `uint` overflow"), - Some(new_cap) => self.reserve_at_least(new_cap) + Some(new_cap) => self.reserve(new_cap) } } } @@ -1678,7 +1678,7 @@ impl OwnedVector for ~[T] { } fn grow_fn(&mut self, n: uint, op: |uint| -> T) { let new_len = self.len() + n; - self.reserve_at_least(new_len); + self.reserve(new_len); let mut i: uint = 0u; while i < n { self.push(op(i)); @@ -1737,7 +1737,7 @@ impl OwnedCloneableVector for ~[T] { #[inline] fn push_all(&mut self, rhs: &[T]) { let new_len = self.len() + rhs.len(); - self.reserve(new_len); + self.reserve_exact(new_len); for elt in rhs.iter() { self.push((*elt).clone()) @@ -1745,7 +1745,7 @@ impl OwnedCloneableVector for ~[T] { } fn grow(&mut self, n: uint, initval: &T) { let new_len = self.len() + n; - self.reserve_at_least(new_len); + self.reserve(new_len); let mut i: uint = 0u; while i < n { @@ -2900,7 +2900,7 @@ impl Extendable for ~[A] { fn extend>(&mut self, iterator: &mut T) { let (lower, _) = iterator.size_hint(); let len = self.len(); - self.reserve(len + lower); + self.reserve_exact(len + lower); for x in *iterator { self.push(x); } @@ -3630,10 +3630,10 @@ mod tests { #[test] fn test_capacity() { let mut v = ~[0u64]; - v.reserve(10u); + v.reserve_exact(10u); assert_eq!(v.capacity(), 10u); let mut v = ~[0u32]; - v.reserve(10u); + v.reserve_exact(10u); assert_eq!(v.capacity(), 10u); } @@ -4070,7 +4070,7 @@ mod tests { #[should_fail] fn test_overflow_does_not_cause_segfault() { let mut v = ~[]; - v.reserve(-1); + v.reserve_exact(-1); v.push(1); v.push(2); } @@ -4080,7 +4080,7 @@ mod tests { fn test_overflow_does_not_cause_segfault_managed() { use rc::Rc; let mut v = ~[Rc::new(1)]; - v.reserve(-1); + v.reserve_exact(-1); v.push(Rc::new(2)); } -- cgit 1.4.1-3-g733a5