HomeSort by relevance Sort by last modified time
    Searched full:iteration (Results 976 - 1000 of 2702) sorted by null

<<31323334353637383940>>

  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 42 * which is needed for efficient iteration).
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 42 * which is needed for efficient iteration).
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 77 * @a header node which is needed for efficient iteration).
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 42 * which is needed for efficient iteration).
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 77 * @a header node which is needed for efficient iteration).
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/rb_tree_map_/
rb_tree_.hpp 77 * @a header node which is needed for efficient iteration).
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
list_partition.h 172 // Correction of the end size (the end iteration has not finished).
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/
__init__.py 130 'during iteration.')
139 # the database was modified during iteration. abort.
173 'during iteration.')
182 # the database was modified during iteration. abort.
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/hotshot/
log.py 90 # Iteration support:
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/
__init__.py 130 'during iteration.')
139 # the database was modified during iteration. abort.
173 'during iteration.')
182 # the database was modified during iteration. abort.
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/hotshot/
log.py 90 # Iteration support:
  /system/core/include/cutils/
atomic.h 102 * than possible, because we re-issue the memory barrier on each iteration.
  /system/core/libnl_2/
README 80 * netlink/attr.h - netlink attribute constants, iteration macros and setters
  /external/chromium_org/third_party/icu/source/test/intltest/
tsmthred.cpp 638 int32_t iteration; local
653 for(iteration = 0;!getError() && iteration<kFormatThreadIterations;iteration++)
656 int32_t whichLine = (iteration + fOffset)%kNumberFormatTestDataLength;
670 whichLine = (iteration + fOffset)%kPercentFormatTestDataLength;
691 switch((iteration+fOffset) % kNumberOfMessageTests)
    [all...]
  /external/icu4c/test/intltest/
tsmthred.cpp 789 int32_t iteration; local
804 for(iteration = 0;!getError() && iteration<kFormatThreadIterations;iteration++)
807 int32_t whichLine = (iteration + fOffset)%kNumberFormatTestDataLength;
821 whichLine = (iteration + fOffset)%kPercentFormatTestDataLength;
842 switch((iteration+fOffset) % kNumberOfMessageTests)
    [all...]
  /libcore/expectations/
brokentests.txt 638 description: "tests that depend on the iteration order of a hash",
644 description: "tests that depend on the iteration order of a hash",
650 description: "tests that depend on the iteration order of a hash",
656 description: "tests that depend on the iteration order of a hash",
662 description: "tests that depend on the iteration order of a hash",
668 description: "tests that depend on the iteration order of a hash",
674 description: "tests that depend on the iteration order of a hash",
    [all...]
  /external/flac/libFLAC/ia32/
lpc_asm.nasm 112 ; each iteration is 11 bytes so we need (-eax)*11, so we do (-12*eax + eax)
120 inc edx ; compensate for the shorter opcode on the last iteration
121 inc edx ; compensate for the shorter opcode on the last iteration
122 inc edx ; compensate for the shorter opcode on the last iteration
125 sub edx, byte 9 ; compensate for the longer opcodes on the first iteration
282 ; each iteration is 11 bytes so we need (-eax)*11, so we do (-12*eax + eax)
290 inc edx ; compensate for the shorter opcode on the last iteration
291 inc edx ; compensate for the shorter opcode on the last iteration
292 inc edx ; compensate for the shorter opcode on the last iteration
    [all...]
  /external/guava/guava/src/com/google/common/collect/
Sets.java 71 * <p>The iteration order of the returned set follows the enum's iteration
89 * <p>The iteration order of the returned set follows the enum's iteration
618 * The iteration order of the returned set matches that of {@code set1}.
671 * present in {@code set1}; these are simply ignored. The iteration order of
703 * {@code set1} or {@code set2} but not in both. The iteration order of the
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
Sets.java 68 * <p>The iteration order of the returned set follows the enum's iteration
86 * <p>The iteration order of the returned set follows the enum's iteration
606 * The iteration order of the returned set matches that of {@code set1}.
659 * present in {@code set1}; these are simply ignored. The iteration order of
691 * {@code set1} or {@code set2} but not in both. The iteration order of the
    [all...]
  /external/chromium_org/base/test/launcher/
test_launcher.cc 538 // The current iteration is done.
546 // Kick off the next iteration.
560 // The current iteration is done.
577 // Kick off the next iteration.
772 // No tests have actually been started, so kick off the next iteration.
    [all...]
  /frameworks/base/test-runner/src/android/test/
InstrumentationTestRunner.java 895 Bundle iteration = (Bundle)p; local
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow.h 204 Fast iteration allows each use to be examined, but does not allow
207 Normal iteration allows insertion, deletion, and modification. the
213 When iterating to the next use, the iteration routines check to see
221 If iteration is halted early, the marker node must be removed from
636 the loop will exit in the first iteration (i.e.
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow.h 204 Fast iteration allows each use to be examined, but does not allow
207 Normal iteration allows insertion, deletion, and modification. the
213 When iterating to the next use, the iteration routines check to see
221 If iteration is halted early, the marker node must be removed from
636 the loop will exit in the first iteration (i.e.
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-flow.h 204 Fast iteration allows each use to be examined, but does not allow
207 Normal iteration allows insertion, deletion, and modification. the
213 When iterating to the next use, the iteration routines check to see
221 If iteration is halted early, the marker node must be removed from
636 the loop will exit in the first iteration (i.e.
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-flow.h 204 Fast iteration allows each use to be examined, but does not allow
207 Normal iteration allows insertion, deletion, and modification. the
213 When iterating to the next use, the iteration routines check to see
221 If iteration is halted early, the marker node must be removed from
636 the loop will exit in the first iteration (i.e.

Completed in 791 milliseconds

<<31323334353637383940>>