| /external/icu4c/common/unicode/ |
| normlzr.h | 40 * provides iteration over its normalized form
85 * function's iteration semantics (post-increment or pre-decrement).
103 * With multiple iteration calls, this is repeated until the next piece
107 * iteration index into that buffer are not exposed on the API.
113 * (with careful consideration of the iteration semantics),
133 * If DONE is returned from an iteration function that returns a code point,
446 // Iteration API
512 * Set the iteration position in the input text that is being normalized,
530 * Retrieve the current iteration position in the input text that is
613 * until the iteration is able to re-sync at the next base character
[all...] |
| /external/chromium_org/third_party/lcov/bin/ |
| genpng | 253 my $line; # Current line during iteration
254 my $row = 0; # Current row number during iteration
255 my $column; # Current column number during iteration
256 my $color_text; # Current text color during iteration
257 my $color_back; # Current background color during iteration
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| lmpar.h | 56 /* initialize the iteration counter. */
105 /* beginning of an iteration. */
152 /* end of an iteration. */
202 /* initialize the iteration counter. */
241 /* beginning of an iteration. */
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
| FluidSimHeightMap.java | 52 private float timeStep = 0.033f; // constant time-step between each iteration
79 * the constant time-step between each iteration
173 // copying data every iteration.
279 * Sets the time-speed between each iteration of the fluid
283 * the time-step between each iteration
|
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
17 // * Depth-first iteration on the 'inverse' graph.
20 // * Normal depth-first iteration - visit a node and then all of its children.
26 // * Depth-first iteration on the 'inverse' graph.
180 // nodes that a depth first iteration did not find: ie unreachable nodes.
|
| /system/extras/tests/sdcard/ |
| plot_sdcard.py | 24 -i x axis is iteration
57 self.iteration = int(res.group(3))
184 """Plot the duration of the ops against iteration.
310 'itp', ['iteration', 'time', 'profile'])
316 if flag in ('-i', '--iteration'):
|
| /bionic/libc/arch-arm/cortex-a15/bionic/ |
| strcmp.S | 83 use LDRD to load two words from each string in every loop iteration.
89 use LDRD to load two words from each string in every loop iteration, as in the fast path.
92 Use LDRD to load two words from every string in every loop iteration.
189 /* Compare two words in every iteration. */
273 /* Compare two words in every iteration. */
290 /* Compare one word in every loop iteration. */
297 /* Compare one word from each string in every loop iteration. */
|
| /bionic/libc/arch-arm/krait/bionic/ |
| strcmp.S | 83 use LDRD to load two words from each string in every loop iteration.
89 use LDRD to load two words from each string in every loop iteration, as in the fast path.
92 Use LDRD to load two words from every string in every loop iteration.
189 /* Compare two words in every iteration. */
273 /* Compare two words in every iteration. */
290 /* Compare one word in every loop iteration. */
297 /* Compare one word from each string in every loop iteration. */
|
| /external/chromium_org/third_party/icu/source/test/perf/perldriver/ |
| PerfFramework.pm | 165 # [1] events per iteration
190 # out("Events per iteration: $eventsPerIter<BR>\n");
193 # debug("Events per iteration: $eventsPerIter<BR>\n");
219 # events per iteration, to give time per event
345 # calibrate: estimate ms/iteration
359 out(formatSeconds(4, $timePerIter), "/iteration<BR>\n");
379 out("Events per iteration: $eventsPerIter<BR>\n");
|
| /external/icu4c/test/perf/perldriver/ |
| PerfFramework.pm | 165 # [1] events per iteration
190 # out("Events per iteration: $eventsPerIter<BR>\n");
193 # debug("Events per iteration: $eventsPerIter<BR>\n");
219 # events per iteration, to give time per event
345 # calibrate: estimate ms/iteration
359 out(formatSeconds(4, $timePerIter), "/iteration<BR>\n");
379 out("Events per iteration: $eventsPerIter<BR>\n");
|
| /external/chromium/chrome/browser/password_manager/ |
| password_store_mac_unittest.cc | 284 EXPECT_TRUE(parsed) << "In iteration " << i;
286 EXPECT_EQ(expected[i].scheme, form.scheme) << "In iteration " << i;
287 EXPECT_EQ(GURL(expected[i].origin), form.origin) << "In iteration " << i;
288 EXPECT_EQ(expected[i].ssl_valid, form.ssl_valid) << "In iteration " << i;
290 << "In iteration " << i;
293 << "In iteration " << i;
295 << "In iteration " << i;
296 EXPECT_FALSE(form.blacklisted_by_user) << "In iteration " << i;
298 EXPECT_TRUE(form.blacklisted_by_user) << "In iteration " << i;
303 << "In iteration " << i
[all...] |
| /external/chromium_org/chrome/browser/password_manager/ |
| password_store_mac_unittest.cc | 285 EXPECT_TRUE(parsed) << "In iteration " << i;
287 EXPECT_EQ(expected[i].scheme, form.scheme) << "In iteration " << i;
288 EXPECT_EQ(GURL(expected[i].origin), form.origin) << "In iteration " << i;
289 EXPECT_EQ(expected[i].ssl_valid, form.ssl_valid) << "In iteration " << i;
291 << "In iteration " << i;
294 << "In iteration " << i;
296 << "In iteration " << i;
297 EXPECT_FALSE(form.blacklisted_by_user) << "In iteration " << i;
299 EXPECT_TRUE(form.blacklisted_by_user) << "In iteration " << i;
304 << "In iteration " << i
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/ |
| bencher | 674 doublePuts($stderr,file," if (__bencher_index >= #{$warmup}) print(\"#{name}: #{plan.vm}: #{plan.iteration}: \" + (__bencher_index - #{$warmup}) + \": Time: \"+(after-before));");
692 doublePuts($stderr,file,"print(\"#{name}: #{plan.vm}: #{plan.iteration}: #{innerIndex}: Time: \"+__bencher_run(#{benchPath.inspect}));")
703 doublePuts($stderr,file," debug(\"#{name}: #{plan.vm}: #{plan.iteration}: \" + (__bencher_count - #{$warmup}) + \": Time: \" + result);")
776 def planForDescription(plans, benchFullname, vmName, iteration)
780 result = plans.select{|v| v.suite.name == suiteName and v.benchmark.name == benchName and v.vm.name == vmName and v.iteration == iteration}
1125 def iteration method in class:BenchRunPlan
1232 def iteration method in class:BenchPlan
[all...] |
| /external/chromium_org/chrome/browser/profile_resetter/ |
| jtl_interpreter_unittest.cc | 227 SCOPED_TRACE(testing::Message() << "Iteration " << i);
275 SCOPED_TRACE(testing::Message() << "Iteration " << i);
291 SCOPED_TRACE(testing::Message() << "Negated, Iteration " << i);
323 SCOPED_TRACE(testing::Message() << "Iteration " << i);
369 SCOPED_TRACE(testing::Message() << "Iteration " << i);
408 SCOPED_TRACE(testing::Message() << "Iteration " << i);
474 SCOPED_TRACE(testing::Message() << "Iteration " << i);
519 SCOPED_TRACE(testing::Message() << "Iteration " << i);
567 SCOPED_TRACE(testing::Message() << "Iteration " << i);
652 SCOPED_TRACE(testing::Message() << "Iteration " << i)
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uhash.h | 55 * hashcode. During iteration an element may be deleted by calling
56 * uhash_removeElement(); iteration may safely continue thereafter.
58 * mid-iteration. However, if uhash_put() is called during iteration
59 * then the iteration will be out of sync. Under no circumstances
510 * called during iteration to remove an element from the table.
511 * Iteration may safely be resumed afterwards. If uhash_put() is
512 * called during iteration the iteration will then be out of sync and
526 * Iteration may be safely continued afterwards
[all...] |
| /external/icu4c/common/ |
| uhash.h | 57 * hashcode. During iteration an element may be deleted by calling
58 * uhash_removeElement(); iteration may safely continue thereafter.
60 * mid-iteration. However, if uhash_put() is called during iteration
61 * then the iteration will be out of sync. Under no circumstances
490 * called during iteration to remove an element from the table.
491 * Iteration may safely be resumed afterwards. If uhash_put() is
492 * called during iteration the iteration will then be out of sync and
506 * Iteration may be safely continued afterwards
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 51 * iteration order for both keys and values. The iteration order is preserved
60 * ... the iteration order for {@link #keys()} is {@code [key1, key2, key1]},
62 * iteration order is kept consistent between keys, entries and values. For
67 * changes the entries iteration order to {@code [key2=bar, key1=baz]} and the
68 * key iteration order to {@code [key2, key1]}. The {@link #entries()} iterator
70 * iteration order as much as possible.
87 * iteration over any of those collections is in progress, except through the
88 * iterator's methods, the results of the iteration are undefined.
157 * {@link Multimap#entries()} iteration order as the input multimap
[all...] |
| LinkedHashMultimap.java | 50 * <p>The iteration ordering of the collections generated by {@code keySet},
53 * iteration order. However, if you remove all values associated with a key and
55 * iteration order.
79 * Map entries with an iteration order corresponding to the order in which the
111 * multimap has the same {@link Multimap#entries()} iteration order as the
321 * {@link #values()} iteration orderings.
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 47 * iteration order for both keys and values. The iteration order is preserved
56 * ... the iteration order for {@link #keys()} is {@code [key1, key2, key1]},
58 * iteration order is kept consistent between keys, entries and values. For
63 * changes the entries iteration order to {@code [key2=bar, key1=baz]} and the
64 * key iteration order to {@code [key2, key1]}. The {@link #entries()} iterator
66 * iteration order as much as possible.
83 * iteration over any of those collections is in progress, except through the
84 * iterator's methods, the results of the iteration are undefined.
153 * {@link Multimap#entries()} iteration order as the input multimap
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DependenceAnalysis.h | 94 bool PeelFirst : 1; // Peeling the first iteration will break dependence.
95 bool PeelLast : 1; // Peeling the last iteration will break the dependence.
159 /// isPeelFirst - Returns true if peeling the first iteration from
163 /// isPeelLast - Returns true if peeling the last iteration from
253 /// isPeelFirst - Returns true if peeling the first iteration from
257 /// isPeelLast - Returns true if peeling the last iteration from
295 /// particular level, return the iteration that should be used to split
305 /// Sometimes, peeling the first or last iteration of a loop will break
307 /// Sometimes, splitting a loop at some other iteration will do the trick,
309 /// record the exact iteration (since we rarely know), we provid
[all...] |
| /cts/tests/tests/net/src/android/net/cts/ |
| DnsTest.java | 168 for (int iteration = 0; iteration < iterationLimit; iteration++) {
206 for (int iteration = 0; iteration < iterationLimit; iteration++) {
|
| /external/guava/guava/src/com/google/common/math/ |
| BigIntegerMath.java | 219 * This iteration has the following two properties:
221 * a) every iteration (except potentially the first) has guess >= floor(sqrt(x)). This is
225 * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles
226 * with each iteration, so this algorithm takes O(log(digits)) iterations.
229 * true value. Therefore, we perform at least one Newton iteration to get a guess that's
230 * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| filterbanks.c | 56 iteration.
81 encoding iteration.
155 /* write the lookahead samples for the next encoding iteration. Every other
198 encoding iteration is added to the transformed state to get a proper forward state */
280 states from the previous decoding iteration.
286 states is updated for the next decoding iteration */
|
| /libcore/luni/src/main/java/java/util/ |
| LinkedHashMap.java | 21 * LinkedHashMap is an implementation of {@link Map} that guarantees iteration order.
26 * <p>Entries are kept in a doubly-linked list. The iteration order is, by default, the
29 * {@code true}, the iteration will be in the order that entries were accessed.
45 * elements during iteration. It is not possible to guarantee that this
298 * This override is done for LinkedHashMap performance: iteration is cheaper
379 // Override view iterator methods to generate correct iteration order
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMFilter.java | 48 * will appear in the first position of the iteration or traversal.
93 * and such, this is meaningful only when the iteration root is the
105 * Attributes and such, this is meaningful only when the iteration
|
