| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graphalgo.rst | 9 Dijkstra's algorithm for shortest paths.
11 Find shortest paths from the start node to all nodes nearer
18 vertex is reached), but will correctly compute shortest paths even for some graphs with negative
24 Find a single shortest path from the given start node to the given end node.
26 of the nodes in order along the shortest path.
|
| index.rst | 10 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /build/kati/testcase/ |
| implicit_pattern_rule_prefix.mk | 7 # GNU make 3 does not prioritize the rule with a shortest stem.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| README.txt | 2 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| README.chromium | 9 constructing graphs, BFS and DFS traversals, topological sort, shortest paths,
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| Timer.java | 97 // Once we get to within 1/4 of the timingPeriod, we change to adding 33%, plus 1. We also remember the shortest duration from this point on.
98 // We return the shortest of the durations.
105 long shortest = Long.MAX_VALUE; local
113 return Math.min(duration, shortest);
116 shortest = Math.min(duration, shortest);
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| Timer.java | 96 // Once we get to within 1/4 of the timingPeriod, we change to adding 33%, plus 1. We also remember the shortest duration from this point on.
97 // We return the shortest of the durations.
104 long shortest = Long.MAX_VALUE; local
112 return Math.min(duration, shortest);
115 shortest = Math.min(duration, shortest);
|
| /external/v8/src/ |
| dtoa.h | 14 // Return the shortest correct representation.
35 // - SHORTEST: produce the least amount of digits for which the internal
49 // shortest representation of the input.
56 // and a terminating null-character. In SHORTEST-mode it expects a buffer of
|
| bignum-dtoa.h | 14 // Return the shortest correct representation.
33 // - SHORTEST: produce the least amount of digits for which the internal
|
| fast-dtoa.h | 14 // Computes the shortest representation of the given input. The returned
40 // The digits in the buffer are the shortest representation possible. E.g.
|
| /prebuilts/go/darwin-x86/src/strconv/ |
| ftoa.go | 108 shortest := prec < 0
109 if shortest {
119 // Precision for shortest representation mode.
151 return formatDigits(dst, shortest, neg, digs, prec, fmt)
160 shortest := prec < 0
161 if shortest {
164 // Precision for shortest representation mode.
188 return formatDigits(dst, shortest, neg, digs, prec, fmt)
191 func formatDigits(dst []byte, shortest bool, neg bool, digs decimalSlice, prec int, fmt byte) []byte {
205 // if precision was the shortest possible, use precision 6 for this decision
[all...] |
| /prebuilts/go/linux-x86/src/strconv/ |
| ftoa.go | 108 shortest := prec < 0
109 if shortest {
119 // Precision for shortest representation mode.
151 return formatDigits(dst, shortest, neg, digs, prec, fmt)
160 shortest := prec < 0
161 if shortest {
164 // Precision for shortest representation mode.
188 return formatDigits(dst, shortest, neg, digs, prec, fmt)
191 func formatDigits(dst []byte, shortest bool, neg bool, digs decimalSlice, prec int, fmt byte) []byte {
205 // if precision was the shortest possible, use precision 6 for this decision
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/email/ |
| charset.py | 25 SHORTEST = 3 # the shorter of QP and base64, but only for headers
62 'utf-8': (SHORTEST, BASE64, 'utf-8'),
118 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
119 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
134 if body_enc == SHORTEST:
135 raise ValueError('SHORTEST not allowed for body_enc')
182 base64 encoding), or Charset.SHORTEST for the shortest of
187 header encoding. Charset.SHORTEST is not allowed fo
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/email/ |
| charset.py | 25 SHORTEST = 3 # the shorter of QP and base64, but only for headers
62 'utf-8': (SHORTEST, BASE64, 'utf-8'),
118 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
119 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
134 if body_enc == SHORTEST:
135 raise ValueError('SHORTEST not allowed for body_enc')
182 base64 encoding), or Charset.SHORTEST for the shortest of
187 header encoding. Charset.SHORTEST is not allowed fo
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/email/ |
| charset.py | 25 SHORTEST = 3 # the shorter of QP and base64, but only for headers
62 'utf-8': (SHORTEST, BASE64, 'utf-8'),
118 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
119 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
134 if body_enc == SHORTEST:
135 raise ValueError('SHORTEST not allowed for body_enc')
182 base64 encoding), or Charset.SHORTEST for the shortest of
187 header encoding. Charset.SHORTEST is not allowed fo
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/email/ |
| charset.py | 25 SHORTEST = 3 # the shorter of QP and base64, but only for headers
62 'utf-8': (SHORTEST, BASE64, 'utf-8'),
118 quoted-printable, Charset.BASE64 for base64 encoding, Charset.SHORTEST for
119 the shortest of qp or base64 encoding, or None for no encoding. SHORTEST
134 if body_enc == SHORTEST:
135 raise ValueError('SHORTEST not allowed for body_enc')
182 base64 encoding), or Charset.SHORTEST for the shortest of
187 header encoding. Charset.SHORTEST is not allowed fo
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| GraphAlgo.py | 9 Dijkstra's algorithm for shortest paths
15 Find shortest paths from the start node to all nodes nearer than or equal to the end node.
19 vertex is reached), but will correctly compute shortest paths even for some graphs with negative
48 Find a single shortest path from the given start node to the given end node.
50 in order along the shortest path.
|
| /external/strace/ |
| count.c | 48 static struct timeval shortest = { 1000000, 0 }; variable in typeref:struct:timeval
94 if (tv_cmp(&shortest, &one_tick) < 0)
95 tv = &shortest;
100 if (tv_cmp(tv, &shortest) < 0)
101 shortest = *tv;
174 tv_mul(&overhead, &shortest, 8);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 19 soon as the shortest argument is exhausted.
83 "now truncates to the shortest sequence")
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 19 soon as the shortest argument is exhausted.
83 "now truncates to the shortest sequence")
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 19 soon as the shortest argument is exhausted.
83 "now truncates to the shortest sequence")
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 19 soon as the shortest argument is exhausted.
83 "now truncates to the shortest sequence")
|
| /external/autotest/server/site_tests/network_WiFi_SimpleConnect/ |
| control.wifi_checkSSIDLimits | 17 longest and shortest possible SSIDs.
|
| /external/fonttools/Lib/fontTools/misc/ |
| fixedTools.py | 14 that has the shortest decimal reprentation. Eg. to convert a
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Bresenham2.java | 81 int shortest = Math.abs(h);
local
82 if (longest <= shortest) {
84 shortest = Math.abs(w);
95 numerator += shortest;
|
