Home
last modified time | relevance | path

Searched refs:remove_entry (Results 1 - 7 of 7) sorted by relevance

/third_party/pulseaudio/src/pulsecore/
H A Dhashmap.c79 static void remove_entry(pa_hashmap *h, struct hashmap_entry *e) { in remove_entry() function
203 remove_entry(h, e); in pa_hashmap_remove()
227 remove_entry(h, h->iterate_list_head); in pa_hashmap_remove_all()
327 remove_entry(h, h->iterate_list_head); in pa_hashmap_steal_first()
H A Didxset.c98 static void remove_entry(pa_idxset *s, struct idxset_entry *e) { in remove_entry() function
274 remove_entry(s, e); in pa_idxset_remove_by_index()
296 remove_entry(s, e); in pa_idxset_remove_by_data()
307 remove_entry(s, s->iterate_list_head); in pa_idxset_remove_all()
383 remove_entry(s, s->iterate_list_head); in pa_idxset_steal_first()
/third_party/eudev/src/shared/
H A Dhashmap.c601 #define remove_entry(h, idx) base_remove_entry(HASHMAP_BASE(h), idx) macro
1386 remove_entry(h, idx); in internal_hashmap_remove()
1415 remove_entry(h, idx); in hashmap_remove2()
1437 remove_entry(h, idx); in hashmap_remove_and_put()
1464 remove_entry(s, idx); in set_remove_and_put()
1492 remove_entry(h, idx_new); in hashmap_remove_and_replace()
1499 remove_entry(h, idx_old); in hashmap_remove_and_replace()
1525 remove_entry(h, idx); in hashmap_remove_value()
1572 remove_entry(h, idx); in internal_hashmap_steal_first()
1588 remove_entry( in internal_hashmap_steal_first_key()
[all...]
/third_party/rust/crates/clap/src/util/
H A Dflat_map.rs60 self.remove_entry(key).map(|(_, v)| v) in remove()
63 pub fn remove_entry<Q: ?Sized>(&mut self, key: &Q) -> Option<(K, V)> in remove_entry() functions
/third_party/mesa3d/src/util/tests/
H A Dcache_test.cpp49 remove_entry(const char *path, in remove_entry() function
76 return nftw(path, remove_entry, 64, FTW_DEPTH | FTW_PHYS); in rmrf_local()
/third_party/rust/crates/clap/src/parser/matches/
H A Darg_matches.rs1257 let (id, matched) = match self.args.remove_entry(arg) { in try_remove_arg_t()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs30447 self.first_entry().map(|entry| entry.remove_entry()) in pop_first()
30530 self.last_entry().map(|entry| entry.remove_entry()) in pop_last()
30691 self.remove_entry(key).map(|(_, v)| v) in remove()
30709 /// assert_eq!(map.remove_entry(&1), Some((1, "a")));
30710 /// assert_eq!(map.remove_entry(&1), None);
30713 pub fn remove_entry<Q: ?Sized>(&mut self, key: &Q) -> Option<(K, V)> in remove_entry() functions
30722 Some(OccupiedEntry { handle, dormant_map, _marker: PhantomData }.remove_entry()) in remove_entry()
35419 pub fn remove_entry(self) -> (K, V) { remove_entry() functions
36833 fn remove_entry<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) { test_borrow() functions
[all...]

Completed in 56 milliseconds