}
impl Container for BitvSet {
+ #[inline]
fn len(&self) -> uint { self.size }
- fn is_empty(&self) -> bool { self.size == 0 }
}
impl Mutable for BitvSet {
impl<T:Ord> Container for PriorityQueue<T> {
/// Returns the length of the queue
fn len(&self) -> uint { self.data.len() }
-
- /// Returns true if a queue contains no elements
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl<T:Ord> Mutable for PriorityQueue<T> {
impl<T> Container for RingBuf<T> {
/// Return the number of elements in the RingBuf
fn len(&self) -> uint { self.nelts }
-
- /// Return true if the RingBufcontains no elements
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl<T> Mutable for RingBuf<T> {
}
sz
}
-
- /// Return true if the map contains no elements
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl<V> Mutable for SmallIntMap<V> {
find_mut(&mut self.root, key)
}
- /// Insert a key-value pair into the map. An existing value for a
- /// key is replaced by the new value. Return true if the key did
- /// not already exist in the map.
- fn insert(&mut self, key: K, value: V) -> bool {
- self.swap(key, value).is_none()
- }
-
- /// Remove a key-value pair from the map. Return true if the key
- /// was present in the map, otherwise false.
- fn remove(&mut self, key: &K) -> bool {
- self.pop(key).is_some()
- }
-
/// Insert a key-value pair from the map. If the key already had a value
/// present in the map, that value is returned. Otherwise None is returned.
fn swap(&mut self, key: K, value: V) -> Option<V> {
fn len(&self) -> uint;
/// Return true if the container contains no elements
- fn is_empty(&self) -> bool;
+ #[inline]
+ fn is_empty(&self) -> bool {
+ self.len() == 0
+ }
}
/// A trait to represent mutable containers
/// Insert a key-value pair into the map. An existing value for a
/// key is replaced by the new value. Return true if the key did
/// not already exist in the map.
- fn insert(&mut self, key: K, value: V) -> bool;
+ #[inline]
+ fn insert(&mut self, key: K, value: V) -> bool {
+ self.swap(key, value).is_none()
+ }
/// Remove a key-value pair from the map. Return true if the key
/// was present in the map, otherwise false.
- fn remove(&mut self, key: &K) -> bool;
+ #[inline]
+ fn remove(&mut self, key: &K) -> bool {
+ self.pop(key).is_some()
+ }
/// Insert a key-value pair from the map. If the key already had a value
/// present in the map, that value is returned. Otherwise None is returned.
impl<K:Hash + Eq,V> Container for HashMap<K, V> {
/// Return the number of elements in the map
fn len(&self) -> uint { self.size }
-
- /// Return true if the map contains no elements
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl<K:Hash + Eq,V> Mutable for HashMap<K, V> {
Some(self.mut_value_for_bucket(idx))
}
- /// Insert a key-value pair into the map. An existing value for a
- /// key is replaced by the new value. Return true if the key did
- /// not already exist in the map.
- fn insert(&mut self, k: K, v: V) -> bool {
- self.swap(k, v).is_none()
- }
-
- /// Remove a key-value pair from the map. Return true if the key
- /// was present in the map, otherwise false.
- fn remove(&mut self, k: &K) -> bool {
- self.pop(k).is_some()
- }
-
/// Insert a key-value pair from the map. If the key already had a value
/// present in the map, that value is returned. Otherwise None is returned.
fn swap(&mut self, k: K, v: V) -> Option<V> {
impl<T:Hash + Eq> Container for HashSet<T> {
/// Return the number of elements in the set
fn len(&self) -> uint { self.map.len() }
-
- /// Return true if the set contains no elements
- fn is_empty(&self) -> bool { self.map.is_empty() }
}
impl<T:Hash + Eq> Mutable for HashSet<T> {
fn len(&self) -> uint {
do self.as_imm_buf |_p, n| { n - 1u }
}
- #[inline]
- fn is_empty(&self) -> bool {
- self.len() == 0
- }
}
impl Container for ~str {
#[inline]
fn len(&self) -> uint { self.as_slice().len() }
- #[inline]
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl Container for @str {
#[inline]
fn len(&self) -> uint { self.as_slice().len() }
- #[inline]
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl Mutable for ~str {
/// Return the number of elements in the map
#[inline]
fn len(&self) -> uint { self.length }
-
- /// Return true if the map contains no elements
- #[inline]
- fn is_empty(&self) -> bool { self.len() == 0 }
}
impl<T> Mutable for TrieMap<T> {
find_mut(&mut self.root.children[chunk(*key, 0)], *key, 1)
}
- /// Insert a key-value pair into the map. An existing value for a
- /// key is replaced by the new value. Return true if the key did
- /// not already exist in the map.
- #[inline]
- fn insert(&mut self, key: uint, value: T) -> bool {
- self.swap(key, value).is_none()
- }
-
- /// Remove a key-value pair from the map. Return true if the key
- /// was present in the map, otherwise false.
- #[inline]
- fn remove(&mut self, key: &uint) -> bool {
- self.pop(key).is_some()
- }
-
/// Insert a key-value pair from the map. If the key already had a value
/// present in the map, that value is returned. Otherwise None is returned.
fn swap(&mut self, key: uint, value: T) -> Option<T> {
/// Return the number of elements in the set
#[inline]
fn len(&self) -> uint { self.map.len() }
-
- /// Return true if the set contains no elements
- #[inline]
- fn is_empty(&self) -> bool { self.map.is_empty() }
}
impl Mutable for TrieSet {