| /external/rust/crates/rayon/src/iter/ |
| D | repeat.rs | 6 /// Iterator adaptor for [the `repeat()` function](fn.repeat.html).
8 pub struct Repeat<T: Clone + Send> { struct
9 element: T, field
22 /// use rayon::iter::repeat;
23 /// let x: Vec<(i32, i32)> = repeat(22).zip(0..3).collect();
26 pub fn repeat<T: Clone + Send>(elt: T) -> Repeat<T> { in repeat() function
27 Repeat { element: elt } in repeat()
30 impl<T> Repeat<T> impl
34 /// Takes only `n` repeats of the element, similar to the general
38 /// more functionality than `Repeat` alone.
[all …]
|
| /external/apache-xml/test/tests/contrib/xsltc/mk/ |
| D | mk056.xsl | 1 <?xml version="1.0" encoding="ISO-8859-1" ?>
9 exclude-result-prefixes="e"
12 <!-- Test FileName: mk056.xsl -->
13 <!-- Source Document: XSLT Programmer's Reference by Michael Kay -->
14 <!-- Example: REC-xslt-19991116.xml, spec.dtd, xslt.xsl -->
15 <!-- Chapter/Page: 9-588 -->
16 <!-- Purpose: Formatting the XSLT Specification -->
20 <xsl:strip-space elements="e:*"/>
23 <xsl:text>p.element-syntax { border: solid thin }</xsl:text>
24 <xsl:apply-imports/>
[all …]
|
| /external/python/cpython2/Doc/library/ |
| D | itertools.rst | 2 :mod:`itertools` --- Functions creating iterators for efficient looping
30 These tools and their built-in counterparts also work well with the high-speed
32 operator can be mapped across two vectors to form an efficient dot-product:
41 …tart, start+step, start+2*step, ... ``count(10) --> 10 11 12 13 14 ...``
42 …1, ... plast, p0, p1, ... ``cycle('ABCD') --> A B C D A B C D ...…
43 :func:`repeat` elem [,n] elem, elem, elem, ... endlessly or up to n times …
51 … p0, p1, ... plast, q0, q1, ... ``chain('ABC', 'DEF') --> A B C D E F``
52 …[0] if s[0]), (d[1] if s[1]), ... ``compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F``
53 …n], seq[n+1], starting when pred fails ``dropwhile(lambda x: x<5, [1,4,6,4,1]) --> 6 4 1``
54 :func:`groupby` iterable[, keyfunc] sub-iterators grouped by value of keyfunc(v)
[all …]
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/ |
| D | map_and_batch_test.py | 7 # http://www.apache.org/licenses/LICENSE-2.0
54 # The pipeline is TensorSliceDataset ->
55 # RepeatDataset(count) -> MapAndBatchDataset(square_3, batch_size).
64 dataset = dataset_ops.Dataset.from_tensor_slices(components).repeat(
95 # We expect (num_batches - 1) full-sized batches.
97 for i in range(num_batches - 1):
107 self.assertAllEqual(component[((num_batches - 1) * 8 + j) % 7]**2,
160 get_next = iterator._next_internal # pylint: disable=protected-access
170 got = self.evaluate([element() for element in elements])
177 self.evaluate([element() for element in elements])
[all …]
|
| /external/tensorflow/tensorflow/core/data/service/ |
| D | task_runner_test.cc | 5 http://www.apache.org/licenses/LICENSE-2.0
60 explicit RangeIterator(const int64_t range, const bool repeat) in RangeIterator() argument
61 : range_(range), repeat_(repeat) {} in RangeIterator()
63 Status GetNext(std::vector<Tensor>& element, bool& end_of_sequence) override { in GetNext() argument
68 element = {Tensor{next_++}}; in GetNext()
89 Status GetNext(std::vector<Tensor>& element, bool& end_of_sequence) override { in GetNext() argument
90 element = {Tensor{next_++}}; in GetNext()
106 Status GetNext(std::vector<Tensor>& element, bool& end_of_sequence) override { in GetNext() argument
113 element = {Tensor{*next_element}}; in GetNext()
202 std::make_unique<RangeIterator>(range, /*repeat=*/false)); in TEST()
[all …]
|
| /external/apache-xml/test/tests/conf/numbering/ |
| D | numbering89.xsl | 4 <!-- CaseName: numbering89 -->
5 <!-- Creator: David Marston -->
6 <!-- Purpose: Show discrepancies between number and position. -->
7 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[2]/item[1]/p[…
8 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[2]/item[3]/p[…
9 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[1]/item[2]/p[…
10 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[1]/item[3]/p[…
11 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(convert)/p[2]/text()[3]" -->
12 <!-- Scenario: operation="standard-XML" -->
13 <!-- Elaboration: While xsl:number always shows the number of the chapter among all chapters,
[all …]
|
| D | numbering88.xsl | 4 <!-- CaseName: numbering88 -->
5 <!-- Creator: David Marston -->
6 <!-- Purpose: Show discrepancies between number and position. -->
7 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[2]/item[1]/p[…
8 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[2]/item[3]/p[…
9 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[1]/item[2]/p[…
10 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(number)/ulist[1]/item[3]/p[…
11 …<!-- SpecCitation: Rec="XSLT" Version="1.0" type="OASISptr1" place="id(convert)/p[2]/text()[3]" -->
12 <!-- Scenario: operation="standard-XML" -->
13 <!-- Elaboration: While xsl:number always shows the number of the chapter among all chapters,
[all …]
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/service/ |
| D | cross_trainer_cache_test.py | 7 # http://www.apache.org/licenses/LICENSE-2.0
31 """Tests for sharing datasets across jobs using a cross-trainer cache."""
36 """Tests cross-trainer cache with `distribute`."""
38 dataset = dataset_ops.Dataset.range(10000000).repeat()
47 # The second client reads the same data from the cross-trainer cache.
59 """Tests cross-trainer cache with `register_dataset`/`from_dataset_id`."""
61 dataset = dataset_ops.Dataset.range(10000000).repeat()
90 dataset = dataset_ops.Dataset.range(10000000).repeat()
103 # Fetching an element from the dataset will trigger prefetches of more
107 # the element just read thus negating the use of the cache as other
[all …]
|
| /external/gson/gson/src/test/java/com/google/gson/ |
| D | JsonParserTest.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
49 JsonElement element = JsonParser.parseString("[a,b,c]"); in testParseUnquotedStringArrayFails() local
50 assertEquals("a", element.getAsJsonArray().get(0).getAsString()); in testParseUnquotedStringArrayFails()
51 assertEquals("b", element.getAsJsonArray().get(1).getAsString()); in testParseUnquotedStringArrayFails()
52 assertEquals("c", element.getAsJsonArray().get(2).getAsString()); in testParseUnquotedStringArrayFails()
53 assertEquals(3, element.getAsJsonArray().size()); in testParseUnquotedStringArrayFails()
104 private static String repeat(String s, int times) { in repeat() method in JsonParserTest
117 String json = repeat("[", times) + repeat("]", times); in testParseDeeplyNestedArrays()
137 String json = repeat("{\"a\":", times) + "null" + repeat("}", times); in testParseDeeplyNestedObjects()
|
| /external/sdv/vsomeip/third_party/boost/spirit/doc/karma/ |
| D | directive.qbk | 2 Copyright (C) 2001-2011 Hartmut Kaiser
3 Copyright (C) 2001-2011 Joel de Guzman
13 (`repeat[]`), directives controlling automatic delimiting (`verbatim[]`,
197 [``a: A --> left_align[a]: A
198 a: Unused --> left_align[a]: Unused``]]
200 [``a: A --> left_align(width)[a]: A
201 a: Unused --> left_align(width)[a]: Unused``]]
203 [``a: A, pad: Pad --> left_align(pad)[a]: A
204 a: Unused, pad: Pad --> left_align(pad)[a]: Unused``]]
206 [``a: A, pad: Pad --> left_align(pad, width)[a]: A
[all …]
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/kotlin/benchmarks/ |
| D | ChannelProducerConsumerBenchmark.kt | 2 …* Copyright 2016-2021 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen… in <lambda>()
19 …* Benchmark to measure channel algorithm performance in terms of average time per `send-receive` p… in <lambda>()
66 val producers = max(1, _4_parallelism - 1) in <lambda>()
75 val consumers = max(1, _4_parallelism - 1) in <lambda>()
90 repeat(producers) { in <lambda>()
93 repeat(n / producers) { in <lambda>()
100 repeat(consumers) { in <lambda>()
103 repeat(n / consumers) { in <lambda>()
113 private suspend fun produce(element: Int, dummy: Channel<Int>?) { in <lambda>()
116 channel.onSend(element) {} in <lambda>()
[all …]
|
| /external/python/cpython3/Doc/library/ |
| D | itertools.rst | 1 :mod:`itertools` --- Functions creating iterators for efficient looping
18 --------------
33 These tools and their built-in counterparts also work well with the high-speed
35 operator can be mapped across two vectors to form an efficient dot-product:
44 …tart, start+step, start+2*step, ... ``count(10) --> 10 11 12 13 14 ...``
45 …1, ... plast, p0, p1, ... ``cycle('ABCD') --> A B C D A B C D ...…
46 :func:`repeat` elem [,n] elem, elem, elem, ... endlessly or up to n times …
54 … p0, p0+p1, p0+p1+p2, ... ``accumulate([1,2,3,4,5]) --> 1 3 6 10 15``
55 … p0, p1, ... plast, q0, q1, ... ``chain('ABC', 'DEF') --> A B C D E F``
56 …... plast, q0, q1, ... ``chain.from_iterable(['ABC', 'DEF']) --> A B C D E F``
[all …]
|
| /external/tensorflow/tensorflow/python/data/kernel_tests/ |
| D | interleave_test.py | 7 # http://www.apache.org/licenses/LICENSE-2.0
51 # `all_iterators` acts as a queue of iterators over each element of `lists`.
92 num_open -= 1
100 values: for each element `x` the result contains `[x] * x`
101 count: determines how many times to repeat `[x] * x` in the result
191 dataset = dataset_ops.Dataset.from_tensor_slices(input_values).repeat(
193 lambda x: dataset_ops.Dataset.from_tensors(x).repeat(x),
196 element for element in _interleave(
240 indices=[[0, 0], [1, 1]], values=(i * [1, -1]), dense_shape=[2, 2])
251 expected = [i, 0] if j % 2 == 0 else [0, -i]
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/channels/ |
| D | ChannelSelectStressTest.kt | 2 …* Copyright 2016-2019 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen…
32 repeat(pairedCoroutines) { launchSender() } in <lambda>()
33 repeat(pairedCoroutines) { launchReceiver() } in <lambda>()
53 val element = sent.getAndIncrement() in CoroutineScope() constant
54 if (element >= elementsToSend) break in CoroutineScope()
55 select<Unit> { channel.onSend(element) {} } in CoroutineScope()
64 val element = select<Int> { channel.onReceive { it } } in launchReceiver() constant
66 val index = (element / Long.SIZE_BITS) in launchReceiver()
67 val mask = 1L shl (element % Long.SIZE_BITS.toLong()).toInt() in launchReceiver()
|
| /external/tensorflow/tensorflow/python/data/experimental/ops/ |
| D | shuffle_ops.py | 7 # http://www.apache.org/licenses/LICENSE-2.0
27 """A `Dataset` that fuses `shuffle` and `repeat`."""
34 self._count = constant_op.constant(-1, dtype=dtypes.int64, name="count")
40 self._input_dataset._variant_tensor, # pylint: disable=protected-access
53 "`tf.data.Dataset.repeat(count)`. Static tf.data optimizations will take "
73 buffer_size, seed=seed, reshuffle_each_iteration=True).repeat(count)
82 set to 1,000, then `shuffle` will initially select a random element from
83 only the first 1,000 elements in the buffer. Once an element is selected,
84 its space in the buffer is replaced by the next (i.e. 1,001-st) element,
85 maintaining the 1,000 element buffer.
[all …]
|
| /external/deqp/external/openglcts/modules/glesext/draw_elements_base_vertex/ |
| D | esextcDrawElementsBaseVertexTests.hpp | 3 /*-------------------------------------------------------------------------
5 * -----------------------------
7 * Copyright (c) 2014-2016 The Khronos Group Inc.
13 * http://www.apache.org/licenses/LICENSE-2.0
24 */ /*-------------------------------------------------------------------*/
32 */ /*-------------------------------------------------------------------*/
102 …glw::GLuint regular_draw_call_offset; /* offset to be used for non-basevertex draw calls …
104 … * be added to test_case.index_offset for non-basevertex
106 …glw::GLuint *regular_draw_call_offset2; /* offset to be used for non-basevertex draw calls …
108 … * NOT be added to test_case.index_offset for non-basevertex
[all …]
|
| /external/python/setuptools/setuptools/_vendor/more_itertools/ |
| D | recipes.py | 5 Some backward-compatible usability improvements have been made.
19 repeat,
86 >>> iterator = tabulate(square, -3)
138 # feed the entire iterator into a zero-length deque
188 Useful for emulating the behavior of the built-in :func:`map` function.
193 return chain(iterable, repeat(None))
206 return chain.from_iterable(repeat(tuple(iterable), n))
254 return starmap(func, repeat(args))
255 return starmap(func, repeat(args, times))
285 """Collect data into fixed-length chunks or blocks.
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_itertools.py | 14 minsize = -maxsize-1
25 'Non-restartable source sequence'
61 for element in it:
62 yield element
82 self.assertRaises(ValueError, combinations, 'abc', -2) # r is negative
97 if indices[i] != i + n - r:
103 indices[j] = indices[j-1] + 1
123 values = [5*x-12 for x in range(n)]
126 …self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of com…
130 self.assertEqual(len(c), r) # r-length combinations
[all …]
|
| /external/cldr/tools/cldr-code/src/main/java/org/unicode/cldr/util/ |
| D | XPathParts.java | 3 * Copyright (C) 2004-2013, International Business Machines Corporation and *
34 * //ldml/characters/exemplarCharacters[@type="auxiliary"] and a list of Element objects that depend
35 * on xPath. Each Element object has an "element" string such as "ldml", "characters", or
44 private List<Element> elements = new ArrayList<>();
59 /** See if the xpath contains an element */
60 public boolean containsElement(String element) { in containsElement() argument
62 if (elements.get(i).getElement().equals(element)) { in containsElement()
109 for (int i = lastFullXPath.size() - 2; i >= limit; --i) { in writeDifference()
110 pw.print(Utility.repeat("\t", i)); in writeDifference()
118 for (int i = limit; i < size() - 1; ++i) { in writeDifference()
[all …]
|
| /external/python/setuptools/pkg_resources/_vendor/more_itertools/ |
| D | recipes.py | 5 Some backward-compatible usability improvements have been made.
19 repeat,
89 >>> iterator = tabulate(square, -3)
141 # feed the entire iterator into a zero-length deque
191 Useful for emulating the behavior of the built-in :func:`map` function.
196 return chain(iterable, repeat(None))
209 return chain.from_iterable(repeat(tuple(iterable), n))
257 return starmap(func, repeat(args))
258 return starmap(func, repeat(args, times))
288 """Collect data into fixed-length chunks or blocks.
[all …]
|
| /external/kotlinx.coroutines/docs/topics/ |
| D | channels.md | 1 <!--- TEST_NAME ChannelsGuideTest -->
22 … // this might be heavy CPU-consuming computation or async logic, we'll just send five squares
26 repeat(5) { println(channel.receive()) }
31 {kotlin-runnable="true" kotlin-min-compiler-version="1.3"}
33 > You can get the full code [here](../../kotlinx-coroutines-core/jvm/test/guide/example-channel-01.…
48 <!--- TEST -->
77 {kotlin-runnable="true" kotlin-min-compiler-version="1.3"}
79 > You can get the full code [here](../../kotlinx-coroutines-core/jvm/test/guide/example-channel-02.…
83 <!--- TEST
90 -->
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/ |
| D | ThreadLocalStressTest.kt | 2 …* Copyright 2016-2018 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen…
21 repeat (100 * stressTestMultiplierSqrt) { in <lambda>()
23 repeat(100) { in <lambda>()
34 repeat (100 * stressTestMultiplierSqrt) { in <lambda>()
36 repeat(100) { in <lambda>()
49 * Here we are using very specific code-path to trigger the execution we want to. in doStress()
52 * 1) We use _undispatched_ withContext with thread element in doStress()
85 repeat(100) { in testNonDispatcheableLeak()
95 repeat(100) { in testNonDispatcheableLeakWithInitial()
103 repeat(100) { in testNonDispatcheableLeakWithContextSwitch()
[all …]
|
| /external/deqp/external/openglcts/modules/gles31/ |
| D | es31cArrayOfArraysTests.hpp | 3 /*-------------------------------------------------------------------------
5 * -----------------------------
7 * Copyright (c) 2014-2016 The Khronos Group Inc.
13 * http://www.apache.org/licenses/LICENSE-2.0
24 */ /*-------------------------------------------------------------------*/
444 " Verify that an 8-dimensional array of floats can be declared with\n" in SizedDeclarationsTypenameStyle1()
472 " having between two and eight dimensions. Repeat these tests for\n" in SizedDeclarationsTypenameStyle2()
522 " Verify that an 8-dimensional array of floats can be declared with\n" in SizedDeclarationsTypenameStyle4()
602 " which any combination of dimensions are declared with zero-size\n" in sized_declarations_invalid_sizes1()
626 " which any combination of dimensions are declared with size -1\n" in sized_declarations_invalid_sizes2()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/spirit/doc/advanced/ |
| D | customization_points.qbk | 2 Copyright (C) 2001-2011 Hartmut Kaiser
3 Copyright (C) 2001-2011 Joel de Guzman
73 whereas others are specialized to be applied for one of the sub-libraries only.
86 The template `is_container` is a template meta-function used as an attribute
179 a: A --> Op(a): vector<A>
191 …stomize_push_back_container__] [Qi: __qi_list__, __qi_kleene__, __qi_plus__, [qi_repeat Repeat].]]
192 …[Karma: __karma_list__, [karma_kleene Kleene (unary `*`)], __karma_plus__, [karma_repeat Repeat].]]
193 …[Karma: __karma_list__, [karma_kleene Kleene (unary `*`)], __karma_plus__, [karma_repeat Repeat].]]
194 …[Karma: __karma_list__, [karma_kleene Kleene (unary `*`)], __karma_plus__, [karma_repeat Repeat].]]
195 …[Karma: __karma_list__, [karma_kleene Kleene (unary `*`)], __karma_plus__, [karma_repeat Repeat].]]
[all …]
|
| /external/mesa3d/docs/ |
| D | isaspec.rst | 1 ISASPEC - XML Based ISA Specification
6 to describe the instruction set more formally than hand-coded assembler
11 Benefits of a formal ISA description, compared to hand-coded assemblers
20 to ir3), although there are currently a couple limitations due to short-
38 -------
40 The fundamental concept of matching a bit-pattern to an instruction
43 bits describe the instruction (and sub-encoding, and so on), and other
52 .. code-block:: c
54 m = (val & bitsets[n]->mask) & ~bitsets[n]->dontcare;
56 if (m == bitsets[n]->match) {
[all …]
|