| /external/double-conversion/test/cctest/ |
| D | test-dtoa.cc | 35 #include "gay-shortest.h"
36 #include "gay-shortest-single.h"
44 SHORTEST, enumerator
53 DoubleToStringConverter::DtoaMode mode = DoubleToStringConverter::SHORTEST; in DoubleToAscii()
55 case SHORTEST: mode = DoubleToStringConverter::SHORTEST; break; in DoubleToAscii()
88 DoubleToAscii(0.0, SHORTEST, 0, buffer, &sign, &length, &point); in TEST()
106 DoubleToAscii(1.0, SHORTEST, 0, buffer, &sign, &length, &point); in TEST()
126 DoubleToAscii(1.5, SHORTEST, 0, buffer, &sign, &length, &point); in TEST()
147 DoubleToAscii(min_double, SHORTEST, 0, buffer, &sign, &length, &point); in TEST()
169 DoubleToAscii(max_double, SHORTEST, 0, buffer, &sign, &length, &point); in TEST()
[all …]
|
| /external/python/cpython2/Lib/email/ |
| D | charset.py | 24 SHORTEST = 3 # the shorter of QP and base64, but only for headers variable
60 'utf-8': (SHORTEST, BASE64, 'utf-8'),
115 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
116 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
131 if body_enc == SHORTEST:
132 raise ValueError('SHORTEST not allowed for body_enc')
178 base64 encoding), or Charset.SHORTEST for the shortest of
183 header encoding. Charset.SHORTEST is not allowed for
224 (SHORTEST, BASE64, None))
262 assert self.body_encoding != SHORTEST
[all …]
|
| /external/tensorflow/tensorflow/python/kernel_tests/strings_ops/ |
| D | as_string_op_test.py | 38 output = string_ops.as_string(input_, shortest=True)
59 output = string_ops.as_string(input_, width=3, fill="0", shortest=True)
68 input_, precision=10, width=3, fill="0", shortest=True)
73 output = string_ops.as_string(input_, scientific=True, shortest=True)
108 with self.assertRaisesOpError("scientific and shortest"):
112 with self.assertRaisesOpError("scientific and shortest"):
113 output = string_ops.as_string(input_, shortest=True)
180 output = string_ops.as_string(input_, shortest=True)
204 output = string_ops.as_string(input_, width=3, fill="0", shortest=True)
217 input_, precision=10, width=3, fill="0", shortest=True)
[all …]
|
| /external/flac/src/test_libFLAC/ |
| D | format.c | 110 { 2, (const FLAC__byte*)"\xc0\x85" , false }, /* non-shortest form */
111 { 2, (const FLAC__byte*)"\xc1\x85" , false }, /* non-shortest form */
119 { 3, (const FLAC__byte*)"\xe0\x85\x80", false }, /* non-shortest form */
120 { 3, (const FLAC__byte*)"\xe0\x95\x80", false }, /* non-shortest form */
141 { (const FLAC__byte*)"\xc0\x85" , false }, /* non-shortest form */
142 { (const FLAC__byte*)"\xc1\x85" , false }, /* non-shortest form */
150 { (const FLAC__byte*)"\xe0\x85\x80", false }, /* non-shortest form */
151 { (const FLAC__byte*)"\xe0\x95\x80", false }, /* non-shortest form */
181 { 4, (const FLAC__byte*)"a=\xc0\x85" , false }, /* non-shortest form */
182 { 4, (const FLAC__byte*)"a=\xc1\x85" , false }, /* non-shortest form */
[all …]
|
| /external/python/cpython3/Lib/email/ |
| D | charset.py | 25 SHORTEST = 3 # the shorter of QP and base64, but only for headers variable
63 'utf-8': (SHORTEST, BASE64, 'utf-8'),
116 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
117 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
132 if body_enc == SHORTEST:
133 raise ValueError('SHORTEST not allowed for body_enc')
189 base64 encoding), or Charset.SHORTEST for the shortest of
194 header encoding. Charset.SHORTEST is not allowed for
230 (SHORTEST, BASE64, None))
263 assert self.body_encoding != SHORTEST
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| D | Timer.java | 101 …the timingPeriod, we change to adding 33%, plus 1. We also remember the shortest duration from thi… in timeIterations()
102 // We return the shortest of the durations. in timeIterations()
109 long shortest = Long.MAX_VALUE; in timeIterations() local
117 return Math.min(duration, shortest); in timeIterations()
120 shortest = Math.min(duration, shortest); in timeIterations()
|
| /external/icu/icu4j/main/framework/src/test/java/com/ibm/icu/dev/util/ |
| D | Timer.java | 98 …the timingPeriod, we change to adding 33%, plus 1. We also remember the shortest duration from thi… in timeIterations()
99 // We return the shortest of the durations. in timeIterations()
106 long shortest = Long.MAX_VALUE; in timeIterations() local
114 return Math.min(duration, shortest); in timeIterations()
117 shortest = Math.min(duration, shortest); in timeIterations()
|
| /external/icu/icu4c/source/i18n/ |
| D | double-conversion-double-to-string.h | 68 // A higher precision can be achieved by using more digits, but the shortest
76 // A higher precision can be achieved by using more digits, but the shortest
119 // trailing decimal point is appended to the significand in shortest mode
132 // When converting to the shortest representation the converter will
160 // form in shortest mode or in precision mode with one requested digit, the
217 // Computes the shortest string of digits that correctly represent the input
256 return ToShortestIeeeNumber(value, result_builder, SHORTEST);
306 // If requested_digits equals -1, then the shortest exponential representation
381 // Produce the shortest correct representation.
384 SHORTEST, enumerator
[all …]
|
| /external/icu/libicu/cts_headers/ |
| D | double-conversion-double-to-string.h | 68 // A higher precision can be achieved by using more digits, but the shortest
76 // A higher precision can be achieved by using more digits, but the shortest
119 // trailing decimal point is appended to the significand in shortest mode
132 // When converting to the shortest representation the converter will
160 // form in shortest mode or in precision mode with one requested digit, the
217 // Computes the shortest string of digits that correctly represent the input
256 return ToShortestIeeeNumber(value, result_builder, SHORTEST);
306 // If requested_digits equals -1, then the shortest exponential representation
381 // Produce the shortest correct representation.
384 SHORTEST, enumerator
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | as_string_op.cc | 39 bool shortest; in AsStringOp() local
46 OP_REQUIRES_OK(ctx, ctx->GetAttr("shortest", &shortest)); in AsStringOp()
58 OP_REQUIRES(ctx, !(scientific || shortest), in AsStringOp()
59 errors::InvalidArgument("scientific and shortest format " in AsStringOp()
70 OP_REQUIRES(ctx, !(scientific && shortest), in AsStringOp()
72 "Cannot select both scientific and shortest notation")); in AsStringOp()
120 if (shortest) { in AsStringOp()
|
| D | as_string_op_test.cc | 35 bool shortest = false) { in Init() argument
41 .Attr("shortest", shortest) in Init()
93 /*scientific=*/false, /*shortest=*/true)); in TEST_F()
183 /*scientific=*/true, /*shortest=*/true); in TEST_F()
187 "Cannot select both scientific and shortest notation")); in TEST_F()
192 /*scientific=*/false, /*shortest=*/true); in TEST_F()
196 "scientific and shortest format not supported for datatype")); in TEST_F()
205 "scientific and shortest format not supported for datatype")); in TEST_F()
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v2/ |
| D | AsString.pbtxt | 41 name: "shortest"
103 name: "shortest"
166 name: "shortest"
230 name: "shortest"
300 name: "shortest"
|
| /external/cldr/tools/cldr-code/src/main/java/org/unicode/cldr/draft/ |
| D | ShortestCanonicalForm.java | 96 String shortest = getShortest(trial, nfc);
97 if (!shortest.equals(nfc)) {
108 "\tShort: " + Utility.hex(shortest) + "\t" + shortest);
249 String shortest = scf.normalize(nfc); in main() local
250 if (!shortest.equals(nfc)) { in main()
251 System.out.println("NFC not shortest: " + shortest + ", " + nfc); in main()
|
| /external/cronet/base/third_party/double_conversion/double-conversion/ |
| D | double-to-string.h | 54 // A higher precision can be achieved by using more digits, but the shortest
62 // A higher precision can be achieved by using more digits, but the shortest
108 // When converting to the shortest representation the converter will
177 // Computes the shortest string of digits that correctly represent the input
216 return ToShortestIeeeNumber(value, result_builder, SHORTEST); in ToShortest()
266 // If requested_digits equals -1, then the shortest exponential representation
340 // Produce the shortest correct representation.
343 SHORTEST, enumerator
344 // Same as SHORTEST, but for single-precision floats.
367 // - SHORTEST: produce the least amount of digits for which the internal
[all …]
|
| /external/double-conversion/double-conversion/ |
| D | double-to-string.h | 54 // A higher precision can be achieved by using more digits, but the shortest
62 // A higher precision can be achieved by using more digits, but the shortest
108 // When converting to the shortest representation the converter will
177 // Computes the shortest string of digits that correctly represent the input
216 return ToShortestIeeeNumber(value, result_builder, SHORTEST); in ToShortest()
266 // If requested_digits equals -1, then the shortest exponential representation
340 // Produce the shortest correct representation.
343 SHORTEST, enumerator
344 // Same as SHORTEST, but for single-precision floats.
367 // - SHORTEST: produce the least amount of digits for which the internal
[all …]
|
| /external/cronet/third_party/icu/source/i18n/ |
| D | double-conversion-double-to-string.h | 68 // A higher precision can be achieved by using more digits, but the shortest
76 // A higher precision can be achieved by using more digits, but the shortest
123 // When converting to the shortest representation the converter will
192 // Computes the shortest string of digits that correctly represent the input
231 return ToShortestIeeeNumber(value, result_builder, SHORTEST);
281 // If requested_digits equals -1, then the shortest exponential representation
356 // Produce the shortest correct representation.
359 SHORTEST, enumerator
360 // Same as SHORTEST, but for single-precision floats.
383 // - SHORTEST: produce the least amount of digits for which the internal
[all …]
|
| /external/harfbuzz_ng/docs/ |
| D | repacker.md | 90 * Sorting by shortest distance
92 Kahn's algorithm is approximately twice as fast as the shortest distance sort so that is attempted
93 first (only on the first topological sort). If it fails to eliminate overflows then shortest distan…
96 ## Shortest Distance Sort
104 The distance of a node is the sum of all weights along the shortest path from the root to that node
109 The shortest distance to each node is determined using
112 based on the shortest distance to each node.
139 If a graph contains multiple 32 bit offsets then the shortest distance sorting will be likely be
141 to a subgraph which are not connected to each other. The shortest distance sort will interleave the
154 Where the links from a to b and a to c are 32 bit offsets, the shortest distance sort would be:
|
| /external/double-conversion/ |
| D | BUILD | 51 "test/cctest/gay-shortest.cc",
52 "test/cctest/gay-shortest.h",
53 "test/cctest/gay-shortest-single.cc",
54 "test/cctest/gay-shortest-single.h",
|
| /external/python/cpython3/Doc/library/ |
| D | email.charset.rst | 63 ``Charset.SHORTEST`` for the shortest of QP or BASE64 encoding. Otherwise,
71 ``Charset.SHORTEST`` is not allowed for *body_encoding*.
180 ``Charset.SHORTEST`` for the shortest of quoted-printable or base64 encoding,
181 or ``None`` for no encoding. ``SHORTEST`` is only valid for
|
| /external/freetype/src/sdf/ |
| D | ftsdf.c | 67 * (3) In order to generate SDF, our task is to find shortest signed
82 * // get shortest distance from point (x, y) to the edge
95 * the shortest distance from each point to the outline of the shape.
103 * Also, to see how we compute the shortest distance from a point to
127 * the shortest distance from a point to a conic curve.
130 * roots of a cubic polynomial to find the shortest distance. However,
140 * the shortest distance.
150 * for each division to get the shortest distance.
396 * Cross product of the shortest distance vector (i.e., the vector
1732 * Suppose `x` is the point whose shortest distance from an arbitrary
[all …]
|
| /external/dagger2/java/dagger/internal/codegen/extension/ |
| D | DaggerGraphs.java | 35 * Returns a shortest path from {@code nodeU} to {@code nodeV} in {@code graph} as a list of the
37 * be many possible shortest paths.)
55 Map<N, N> visitedNodeToPathPredecessor = new HashMap<>(); // encodes shortest path tree in shortestPath()
68 continue; // we already have a shortest path to nextNode in shortestPath()
|
| /external/double-conversion/msvc/run_tests/ |
| D | run_tests.vcxproj.filters | 27 <ClCompile Include="..\..\test\cctest\gay-shortest.cc">
30 <ClCompile Include="..\..\test\cctest\gay-shortest-single.cc">
74 <ClInclude Include="..\..\test\cctest\gay-shortest.h">
77 <ClInclude Include="..\..\test\cctest\gay-shortest-single.h">
|
| /external/python/cpython2/Doc/library/ |
| D | email.charset.rst | 58 ``Charset.SHORTEST`` for the shortest of QP or BASE64 encoding. Otherwise,
66 ``Charset.SHORTEST`` is not allowed for *body_encoding*.
219 ``Charset.SHORTEST`` for the shortest of quoted-printable or base64 encoding,
220 or ``None`` for no encoding. ``SHORTEST`` is only valid for
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | AsString.pbtxt | 41 name: "shortest"
103 name: "shortest"
166 name: "shortest"
|
| /external/tensorflow/tensorflow/python/checkpoint/ |
| D | graph_view.py | 127 """Find shortest paths to all dependencies of self.root."""
133 Non-slot variables are keyed based on a shortest path from the root saveable
137 Slot variables are keyed based on a shortest path to the variable being
138 slotted for, a shortest path to their optimizer, and the slot name.
|