/external/pigweed/pw_multisink/public/pw_multisink/ |
D | multisink.h | 23 class Drain; variable 69 Status AttachDrain(Drain& drain); 77 Status DetachDrain(Drain& drain); 84 friend Drain; 97 static Result<ConstByteSpan> GetEntry(Drain& drain,
|
D | drain.h | 25 class Drain { 27 constexpr Drain() : last_handled_sequence_id_(0), multisink_(nullptr) {} in Drain() function
|
/external/rust/crates/rayon/src/ |
D | string.rs | 11 type Iter = Drain<'a>; 15 Drain { in par_drain() 25 pub struct Drain<'a> { struct 30 impl<'a> ParallelIterator for Drain<'a> { implementation 43 impl<'a> Drop for Drain<'a> { implementation
|
D | vec.rs | 69 type Iter = Drain<'data, T>; 73 Drain { in par_drain() 83 pub struct Drain<'data, T: Send> { struct 89 impl<'data, T: Send> ParallelIterator for Drain<'data, T> { argument 104 impl<'data, T: Send> IndexedParallelIterator for Drain<'data, T> { implementation 135 impl<'data, T: Send> Drop for Drain<'data, T> { implementation
|
/external/rust/crates/futures-util/src/sink/ |
D | drain.rs | 11 pub struct Drain<T> { struct 29 pub fn drain<T>() -> Drain<T> { in drain() argument 30 assert_sink::<T, Never, _>(Drain { marker: PhantomData }) in drain() 33 impl<T> Unpin for Drain<T> {} implementation 35 impl<T> Sink<T> for Drain<T> { implementation
|
/external/scapy/scapy/ |
D | scapypipes.py | 9 from scapy.pipetool import Source,Drain,Sink 117 class UDPDrain(Drain): 126 Drain.__init__(self) 240 class TriggeredMessage(Drain): 249 Drain.__init__(self, name=name) 256 class TriggerDrain(Drain): 265 Drain.__init__(self, name=name) 278 class TriggeredValve(Drain): 287 Drain.__init__(self, name=name) 299 class TriggeredQueueingValve(Drain): [all …]
|
D | pipetool.py | 87 if isinstance(pipe, Drain): 338 class Drain(Pipe): class 600 class TransformDrain(Drain): 609 Drain.__init__(self, name=name) 616 class UpDrain(Drain): 629 class DownDrain(Drain):
|
/external/rust/crates/rayon/src/collections/ |
D | binary_heap.rs | 63 pub struct Drain<'a, T: Ord + Send> { struct 68 type Iter = Drain<'a, T>; argument 72 Drain { heap: self } in par_drain() 76 impl<'a, T: Ord + Send> ParallelIterator for Drain<'a, T> { implementation 91 impl<'a, T: Ord + Send> IndexedParallelIterator for Drain<'a, T> { implementation 113 impl<'a, T: Ord + Send> Drop for Drain<'a, T> { implementation
|
D | vec_deque.rs | 94 pub struct Drain<'a, T: Send> { struct 101 type Iter = Drain<'a, T>; argument 105 Drain { in par_drain() 113 impl<'a, T: Send> ParallelIterator for Drain<'a, T> { implementation 128 impl<'a, T: Send> IndexedParallelIterator for Drain<'a, T> { implementation 151 impl<'a, T: Send> Drop for Drain<'a, T> { implementation
|
D | hash_set.rs | 59 pub struct Drain<'a, T: Hash + Eq + Send> { struct 65 type Iter = Drain<'a, T>; argument 70 Drain { in par_drain() 78 Drain<'_, T> => T,
|
D | hash_map.rs | 73 pub struct Drain<'a, K: Hash + Eq + Send, V: Send> { struct 81 type Iter = Drain<'a, K, V>; argument 86 Drain { in par_drain() 94 Drain<'_, K, V> => (K, V),
|
/external/llvm-project/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_allocator_local_cache.h | 28 Drain(allocator); in Destroy() 56 Drain(c, allocator, class_id, c->max_count / 2); in Deallocate() 64 void Drain(SizeClassAllocator *allocator) { in Drain() function 68 Drain(c, allocator, i, c->count); in Drain() 109 NOINLINE void Drain(PerClass *c, SizeClassAllocator *allocator, uptr class_id, in Drain() function 147 Drain(allocator); in Destroy() 175 Drain(c, allocator, class_id); in Deallocate() 180 void Drain(SizeClassAllocator *allocator) { in Drain() function 184 Drain(c, allocator, i); in Drain() 247 NOINLINE void Drain(PerClass *c, SizeClassAllocator *allocator, in Drain() function
|
/external/pigweed/pw_multisink/ |
D | multisink.cc | 26 Result<ConstByteSpan> MultiSink::GetEntry(Drain& drain, in GetEntry() 48 Status MultiSink::AttachDrain(Drain& drain) { in AttachDrain() 55 Status MultiSink::DetachDrain(Drain& drain) { in DetachDrain()
|
D | multisink_test.cc | 32 void ExpectMessageAndDropCount(Drain& drain, in ExpectMessageAndDropCount() 51 Drain drains_[kMaxDrains];
|
D | drain.cc | 21 Result<ConstByteSpan> Drain::GetEntry(ByteSpan entry, in GetEntry()
|
/external/rust/crates/weak-table/src/ |
D | weak_hash_set.rs | 184 pub struct Drain<'a, T: 'a>(base::Drain<'a, T, ()>); struct 186 impl<'a, T: WeakElement> Iterator for Drain<'a, T> { implementation 205 pub fn drain(&mut self) -> Drain<T> { in drain() 206 Drain(self.0.drain()) in drain()
|
D | ptr_weak_hash_set.rs | 157 pub struct Drain<'a, T: 'a>(base::Drain<'a, ByPtr<T>, ()>); struct 159 impl<'a, T: WeakElement> Iterator for Drain<'a, T> { implementation 180 pub fn drain(&mut self) -> Drain<T> { in drain() 181 Drain(self.0.drain()) in drain()
|
/external/rust/crates/slab/src/ |
D | lib.rs | 175 pub struct Drain<'a, T: 'a>(vec::Drain<'a, Entry<T>>); struct 776 pub fn drain(&mut self) -> Drain<T> { in drain() 779 Drain(self.entries.drain(..)) in drain() 859 impl<'a, T: 'a> fmt::Debug for Drain<'a, T> { implementation 965 impl<'a, T> Iterator for Drain<'a, T> { implementation
|
/external/scapy/test/ |
D | pipetool.uts | 10 d1 = Drain(name="d1") 44 d1 = Drain(name="d1") 59 d1 = Drain(name="d1") 138 d1 = Drain(name="d1") 157 d1 = Drain(name="d1") 227 d1 = Drain(name="d1") 272 d1 = Drain(name="d1") 310 d1 = Drain(name="d1") 557 d = Drain()
|
/external/compiler-rt/lib/tsan/rtl/ |
D | tsan_dense_alloc.h | 70 Drain(c); in Free() 125 void Drain(Cache *c) { in Drain() function
|
/external/rust/crates/hashlink/src/ |
D | linked_hash_set.rs | 57 pub fn drain(&mut self) -> Drain<T> { in drain() 58 Drain { in drain() 453 pub struct Drain<'a, K: 'a> { struct 454 iter: linked_hash_map::Drain<'a, K, ()>, argument 558 impl<'a, K> Iterator for Drain<'a, K> { implementation 572 impl<'a, K> DoubleEndedIterator for Drain<'a, K> { implementation 579 impl<'a, K> ExactSizeIterator for Drain<'a, K> {} implementation
|
/external/llvm-project/compiler-rt/lib/tsan/rtl/ |
D | tsan_dense_alloc.h | 70 Drain(c); in Free() 129 void Drain(Cache *c) { in Drain() function
|
/external/rust/crates/hashlink/ |
D | CHANGELOG.md | 47 - Add `linked_hash_map` `IntoIter` iterator that is different from `Drain` iterator 48 - Make `Drain` iterator recycle freed linked list nodes
|
/external/rust/crates/smallvec/src/ |
D | lib.rs | 277 pub struct Drain<'a, T: 'a + Array> { struct 284 impl<'a, T: 'a + Array> fmt::Debug for Drain<'a, T> argument 293 unsafe impl<'a, T: Sync + Array> Sync for Drain<'a, T> {} implementation 294 unsafe impl<'a, T: Send + Array> Send for Drain<'a, T> {} implementation 296 impl<'a, T: 'a + Array> Iterator for Drain<'a, T> { implementation 312 impl<'a, T: 'a + Array> DoubleEndedIterator for Drain<'a, T> { implementation 321 impl<'a, T: Array> ExactSizeIterator for Drain<'a, T> { implementation 328 impl<'a, T: Array> FusedIterator for Drain<'a, T> {} implementation 330 impl<'a, T: 'a + Array> Drop for Drain<'a, T> { implementation 719 pub fn drain<R>(&mut self, range: R) -> Drain<'_, A> in drain() [all …]
|
/external/rust/crates/uuid/benches/slog_support/ |
D | parse_str.rs | 9 slog::Logger::root(::slog::Drain::fuse(::slog::Discard), slog::o!()); in bench_log_discard_kv()
|