Home
last modified time | relevance | path

Searched refs:take (Results 1 - 25 of 142) sorted by relevance

123456

/third_party/rust/crates/regex/bench/src/
H A Dmisc.rs19 repeat("a?").take(100).collect::<String>(),
20 repeat("a").take(100).collect::<String>()
23 repeat("a").take(100).collect()
27 format!("{}y", repeat("x").take(50).collect::<String>())
31 format!("{}y", repeat("x").take(50).collect::<String>())
35 format!("{}w", repeat("xxxx").take(20).collect::<String>())
39 format!("{}c", repeat("bbbb").take(20).collect::<String>())
45 format!("{}a", repeat("☃5☃5").take(20).collect::<String>())
53 repeat("abcdefghijklmnopqrstuvwxyz").take(15).collect::<String>()
61 repeat("abcdefghijklmnopqrstuvwxyz").take(1
[all...]
/third_party/rust/crates/nom/src/combinator/
H A Dtests.rs2 use crate::bytes::complete::take;
120 flat_map(u8, take)(input), in test_flat_map()
142 map_parser(take(4usize), take(2usize))(input), in test_map_parser()
151 all_consuming(take(2usize))(input), in test_all_consuming()
155 all_consuming(take(3usize))(input), in test_all_consuming()
163 use crate::bytes::complete::take; in test_verify_ref()
165 let mut parser1 = verify(take(3u8), |s: &[u8]| s == &b"abc"[..]); in test_verify_ref()
181 use crate::bytes::complete::take; in test_verify_alloc()
182 let mut parser1 = verify(map(take( in test_verify_alloc()
[all...]
/third_party/rust/crates/nom/src/bits/
H A Dmod.rs19 /// use nom::bits::{bits, streaming::take};
25 /// bits::<_, _, Error<(&[u8], usize)>, _, _>(tuple((take(4usize), take(8usize))))(input)
30 /// let output = parse(input).expect("We take 1.5 bytes and the input is longer than 2 bytes");
68 /// use nom::bits::{bits, bytes, streaming::take};
76 /// take(4usize),
77 /// take(8usize),
116 use crate::bits::streaming::take;
128 bits::<_, _, Error<(&[u8], usize)>, _, _>(tuple((take(4usize), take( in test_complete_byte_consumption_bits()
[all...]
H A Dcomplete.rs13 /// # use nom::bits::complete::take;
18 /// take(count)(input)
33 pub fn take<I, O, C, E: ParseError<(I, usize)>>( in take() functions
58 for byte in input.iter_elements().take(cnt + 1) { in take()
98 take(count)(input).and_then(|(i, o)| { in tag()
127 let (res, bit): (_, u32) = take(1usize)(input)?; in bool()
142 let result: crate::IResult<(&[u8], usize), usize> = take(count)((input, offset)); in test_take_0()
151 let result: crate::IResult<(&[u8], usize), usize> = take(1usize)((input, 8)); in test_take_eof()
166 let result: crate::IResult<(&[u8], usize), usize> = take(24usize)((input, 4)); in test_take_span_over_multiple_bytes()
H A Dstreaming.rs10 pub fn take<I, O, C, E: ParseError<(I, usize)>>( in take() functions
32 for byte in input.iter_elements().take(cnt + 1) { in take()
72 take(count)(input).and_then(|(i, o)| { in tag()
101 let (res, bit): (_, u32) = take(1usize)(input)?; in bool()
116 let result: crate::IResult<(&[u8], usize), usize> = take(count)((input, offset)); in test_take_0()
/third_party/rust/crates/rust-openssl/openssl/src/
H A Dsign.rs728 iter::repeat(0x0b_u8).take(16).collect(), in hmac_md5()
738 iter::repeat(0xaa_u8).take(16).collect(), in hmac_md5()
739 iter::repeat(0xdd_u8).take(50).collect(), in hmac_md5()
744 iter::repeat(0xcd_u8).take(50).collect(), in hmac_md5()
748 iter::repeat(0x0c_u8).take(16).collect(), in hmac_md5()
753 iter::repeat(0xaa_u8).take(80).collect(), in hmac_md5()
758 iter::repeat(0xaa_u8).take(80).collect(), in hmac_md5()
775 iter::repeat(0x0b_u8).take(20).collect(), in hmac_sha1()
785 iter::repeat(0xaa_u8).take(20).collect(), in hmac_sha1()
786 iter::repeat(0xdd_u8).take(5 in hmac_sha1()
[all...]
/third_party/python/Lib/test/
H A Dtest_itertools.py60 def take(n, seq): function
86 def pickletest(self, protocol, it, stop=4, take=1, compare=None):
114 for i in range(take):
118 pass #in case there is less data than 'take'
174 self.assertEqual(take(4, c('abc', 'def')), list('abcd'))
181 self.assertEqual(take(4, chain.from_iterable(['abc', 'def'])), list('abcd'))
192 self.assertEqual(take(4, oper(chain('abc', 'def'))), list('abcd'))
532 self.assertEqual(take(2, lzip('abc',count(3))), [('a', 3), ('b', 4)])
533 self.assertEqual(take(2, zip('abc',count(-1))), [('a', -1), ('b', 0)])
534 self.assertEqual(take(
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/
H A Dticket.h28 // Tickets are obtained from a Ticket::Queue, using the Ticket::Queue::take()
50 // auto ticket = queue.take();
70 // take() returns a single ticket from the queue.
71 MARL_NO_EXPORT inline Ticket take();
73 // take() retrieves count tickets from the queue, calling f() with each
77 MARL_NO_EXPORT inline void take(size_t count, const F& f);
173 Ticket Ticket::Queue::take() { in take() function in marl::Ticket::Queue
175 take(1, [&](Ticket&& ticket) { out = std::move(ticket); }); in take()
180 void Ticket::Queue::take(size_t n, const F& f) { in take() function in marl::Ticket::Queue
/third_party/skia/third_party/externals/swiftshader/third_party/marl/src/
H A Dticket_bench.cpp29 auto ticket = queue.take(); in BENCHMARK_DEFINE_F()
35 queue.take().wait(); in BENCHMARK_DEFINE_F()
H A Dticket_test.cpp27 auto ticket = queue.take(); in TEST_P()
35 queue.take().wait(); in TEST_P()
H A Dtrace.cpp63 auto event = take(); in Trace()
78 while (take()->type() != Event::Type::Shutdown) { in Trace()
177 std::unique_ptr<Trace::Event> Trace::take() { in take() function in marl::Trace
H A Dscheduler.cpp307 Scheduler::Fiber* Scheduler::WaitingFibers::take(const TimePoint& timeout) { in take() function in marl::Scheduler::WaitingFibers
319 MARL_ASSERT(deleted, "WaitingFibers::take() maps out of sync"); in take()
489 auto to = containers::take(work.fibers); in suspend()
494 auto to = containers::take(idleFibers); in suspend()
569 out = containers::take(work.tasks); in steal()
620 while (auto fiber = work.waiting.take(now)) { in enqueueFiberTimeouts()
680 // Note: we cannot take and store on the stack more than a single fiber in runUntilIdle()
686 auto fiber = containers::take(work.fibers); in runUntilIdle()
703 auto task = containers::take(work.tasks); in runUntilIdle()
/third_party/rust/crates/once_cell/src/
H A Dlib.rs618 /// assert_eq!(cell.take(), None);
622 /// assert_eq!(cell.take(), Some("hello".to_string()));
637 pub fn take(&mut self) -> Option<T> { in take() functions
723 init.take().unwrap_or_else(|| panic!("Lazy instance has previously been poisoned")) in into_value()
744 this.cell.get_or_init(|| match this.init.take() { in force()
1047 let res = self.get_or_init(|| unsafe { unwrap_unchecked(value.take()) }); in try_insert()
1143 /// assert_eq!(cell.take(), None);
1147 /// assert_eq!(cell.take(), Some("hello".to_string()));
1162 pub fn take(&mut self) -> Option<T> { in take() functions
1254 init.take() in into_value()
[all...]
/third_party/rust/crates/nom/tests/
H A Dissues.rs140 fn take(i: &[u8]) -> IResult<&[u8], &[u8]> { in issue_848_overflow_incomplete_bits_to_bytes() functions
141 use nom::bytes::streaming::take; in issue_848_overflow_incomplete_bits_to_bytes()
142 take(0x2000000000000000_usize)(i) in issue_848_overflow_incomplete_bits_to_bytes()
147 bits(bytes(take))(i) in issue_848_overflow_incomplete_bits_to_bytes()
201 use nom::bits::{bits, complete::take}; in issue_1231_bits_expect_fn_closure()
205 bits::<_, _, Error<_>, _, _>(tuple((take(1usize), take(1usize))))(input) in issue_1231_bits_expect_fn_closure()
H A Doverflow.rs4 use nom::bytes::streaming::take;
16 tuple((take(1_usize), take(18446744073709551615_usize)))(i) in parser02()
H A Dmp4.rs5 bytes::streaming::{tag, take},
106 let (i, _) = take(10_usize)(i)?; in mvhd32()
158 let (i, _) = take(10_usize)(i)?; in mvhd64()
247 map_res(take(4_usize), str::from_utf8)(input) in brand_name()
252 let (i, version) = take(4_usize)(i)?;
/third_party/rust/crates/unicode-width/src/
H A Dtests.rs23 let string = iter::repeat('a').take(4096).collect::<String>(); in cargo()
36 let string = iter::repeat('a').take(4096).collect::<String>(); in stdlib()
48 let string = iter::repeat('a').take(4096).collect::<String>(); in simple_if()
60 let string = iter::repeat('a').take(4096).collect::<String>(); in simple_match()
/third_party/skia/third_party/externals/swiftshader/third_party/marl/examples/
H A Dprimes.cpp59 auto ticket = queue.take(); in main()
87 // take a ticket and wait on it to ensure that all the primes have been in main()
89 queue.take().wait(); in main()
/third_party/rust/crates/nix/test/sys/
H A Dtest_uio.rs24 .take(128) in test_writev()
46 let mut read_buf: Vec<u8> = iter::repeat(0u8).take(128 * 16).collect(); in test_writev()
68 .take(128) in test_readv()
80 let v: Vec<u8> = iter::repeat(0u8).take(vec_len).collect(); in test_readv()
/third_party/cups-filters/filter/pdftopdf/
H A Dqpdf_pdftopdf_processor.h38 virtual bool loadFile(FILE *f,ArgOwnership take=WillStayAlive,int flatten_forms=1);
58 virtual void emitFile(FILE *dst,ArgOwnership take=WillStayAlive);
/third_party/skia/third_party/externals/swiftshader/src/System/
H A DSynchronization.hpp114 // take returns the next item in the chan, blocking until an item is
116 T take();
143 T Chan<T>::take() in take() function in sw::Chan
/third_party/rust/crates/rust-openssl/openssl/src/ssl/
H A Dbio.rs57 state.error.take() in take_error()
62 state.panic.take() in take_panic()
/third_party/rust/crates/nom/src/number/
H A Dstreaming.rs69 for byte in input.iter_elements().take(bound) { in be_u16()
102 for byte in input.iter_elements().take(bound) { in be_u24()
135 for byte in input.iter_elements().take(bound) { in be_u32()
168 for byte in input.iter_elements().take(bound) { in be_u64()
200 for byte in input.iter_elements().take(bound) { in be_u128()
390 for (index, byte) in input.iter_indices().take(bound) { in le_u16()
423 for (index, byte) in input.iter_indices().take(bound) { in le_u24()
456 for (index, byte) in input.iter_indices().take(bound) { in le_u32()
489 for (index, byte) in input.iter_indices().take(bound) { in le_u64()
522 for (index, byte) in input.iter_indices().take(boun in le_u128()
[all...]
H A Dcomplete.rs71 for byte in input.iter_elements().take(bound) { in be_u16()
104 for byte in input.iter_elements().take(bound) { in be_u24()
137 for byte in input.iter_elements().take(bound) { in be_u32()
170 for byte in input.iter_elements().take(bound) { in be_u64()
203 for byte in input.iter_elements().take(bound) { in be_u128()
413 for (index, byte) in input.iter_indices().take(bound) { in le_u16()
446 for (index, byte) in input.iter_indices().take(bound) { in le_u24()
479 for (index, byte) in input.iter_indices().take(bound) { in le_u32()
512 for (index, byte) in input.iter_indices().take(bound) { in le_u64()
545 for (index, byte) in input.iter_indices().take(boun in le_u128()
[all...]
/third_party/node/lib/internal/streams/
H A Doperators.js411 function take(number, options = undefined) { function
420 return async function* take() {
446 take,

Completed in 13 milliseconds

123456