Lines Matching refs:remove
1321 map.remove(&k);
1343 map.remove(&i);
1643 let v = map.remove(&elt);
1656 let v = map.remove(&i);
1714 let v = map.remove(&elt);
1727 let v = map.remove(&i);
1785 let v = map.remove(&elt);
1798 let v = map.remove(&i);
1911 let ok = set.remove(&elt);
1924 let ok = set.remove(&i);
1982 let ok = set.remove(&elt);
1995 let ok = set.remove(&i);
2202 v.remove(rng.gen::<usize>() % l);
5967 fn remove() {
5969 assert_eq!(s.remove(0), 'ศ');
5972 assert_eq!(s.remove(17), 'ệ');
5979 "ศ".to_string().remove(1);
8217 v.remove(1);
9889 assert_eq!(a.remove(2), 3);
9892 assert_eq!(a.remove(2), 4);
9895 assert_eq!(a.remove(0), 1);
9898 assert_eq!(a.remove(0), 2);
9906 let _ = a.remove(0);
9907 let _ = a.remove(0);
17355 /// assert_eq!(s.remove(0), 'f');
17356 /// assert_eq!(s.remove(1), 'o');
17357 /// assert_eq!(s.remove(0), 'o');
17361 pub fn remove(&mut self, idx: usize) -> char {
17364 None => panic!("cannot remove a char from the end of a string"),
17434 /// In other words, remove all characters `c` such that `f(c)` returns `false`.
18443 // to try to remove it.
18711 /// Start of part to remove
18713 /// End of part to remove
18715 /// Current remaining range to remove
20097 // the strong count, and then remove the implicit "strong weak"
20915 // remove the implicit "strong weak" pointer now that we've
22163 // .take(slots.len()) is necessary for LLVM to remove bounds checks
23082 runs.remove(r + 1);
27853 /// assert_eq!(d.remove(1), 2);
27854 /// assert_eq!(d.remove(0), 3);
27855 /// assert_eq!(d.remove(0), 1);
27858 pub fn remove(&mut self, at: usize) -> T {
27860 assert!(at < len, "Cannot remove at an index outside of the list bounds");
27887 /// whether you choose to keep or remove it.
28988 v.remove(0);
29884 /// movie_reviews.remove("The Blues Brothers");
30681 /// assert_eq!(map.remove(&1), Some("a"));
30682 /// assert_eq!(map.remove(&1), None);
30686 pub fn remove<Q: ?Sized>(&mut self, key: &Q) -> Option<V>
30730 /// In other words, remove all pairs `(k, v)` such that `f(&k, &mut v)` returns `false`.
30979 /// closure, regardless of whether you choose to keep or remove it.
32221 /// books.remove("The Odyssey");
32976 /// assert_eq!(set.remove(&2), true);
32977 /// assert_eq!(set.remove(&2), false);
32981 pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool
32986 self.map.remove(value).is_some()
33015 /// In other words, remove all elements `e` such that `f(&e)` returns `false`.
34271 mod remove;
35534 /// assert_eq!(o.remove(), 12);
35540 pub fn remove(self) -> V {
35790 assert_eq!(map.remove(&(i * 2)), Some(i * 200));
35800 assert_eq!(map.remove(&(2 * i)), None);
35801 assert_eq!(map.remove(&(2 * i + 1)), Some(i * 200 + 100));
35811 assert_eq!(map.remove(&1), None);
35857 assert_eq!(map.remove(&1), Some(2));
35871 assert_eq!(map.remove(&2), Some(4));
35888 assert_eq!(map.remove(&1), None);
36828 fn remove<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) {
36829 v.remove(t);
36876 assert_eq!(view.remove(), 30);
37030 assert_eq!(map.remove(&(i * 2)), Some(i * 200));
37037 assert_eq!(map.remove(&(2 * i)), None);
37038 assert_eq!(map.remove(&(2 * i + 1)), Some(i * 200 + 100));
37470 assert_eq!(a.remove(&($len - 1)), Some(2 * ($len - 1)));
37713 map.remove(&(0xFF - i));
37728 map.remove(&Governed(0xFF - i, &gov));
37757 let (old_kv, mut pos) = self.remove();
37810 // the element we were asked to remove. Prefer the left adjacent KV,
39017 pub fn remove(
40423 /// the queue, and [`pop_front`] to remove from the queue. [`extend`] and [`append`]
41547 // Drain will ptr::read out the values to remove.
42140 /// assert_eq!(buf.remove(1), Some(2));
42144 pub fn remove(&mut self, index: usize) -> Option<T> {
42179 // contiguous, remove closer to tail:
42194 // contiguous, remove closer to head:
42209 // discontiguous, remove closer to tail, tail section:
42224 // discontiguous, remove closer to head, head section:
42239 // discontiguous, remove closer to head, tail section:
42248 // or quasi-discontiguous, remove next to head, tail section:
42274 // discontiguous, remove closer to tail, head section:
42396 /// In other words, remove all elements `e` such that `f(&e)` returns false.
43732 tester.remove(to_remove);
45033 /// In other words, remove all elements `e` such that `f(&e)` returns
46312 /// Current remaining range to remove
48155 /// assert_eq!(v.remove(1), 2);
48159 pub fn remove(&mut self, index: usize) -> T {
48190 /// In other words, remove all elements `e` such that `f(&e)` returns `false`.
48546 // Drain will ptr::read out the values to remove.
49378 /// let val = vec.remove(i);
49392 /// regardless of whether you choose to keep or remove it.