HomeSort by relevance Sort by last modified time
    Searched refs:partition (Results 201 - 225 of 266) sorted by null

1 2 3 4 5 6 7 891011

  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
algorithmfwd.h 89 partition
131 * searching, merge, partition, heap, set, minima, maxima, and
175 * searching for the partition point in a partitioned range. We
437 // partition
693 partition(_BIter, _BIter, _Predicate);
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
algorithmfwd.h 89 partition
131 * searching, merge, partition, heap, set, minima, maxima, and
175 * searching for the partition point in a partitioned range. We
437 // partition
693 partition(_BIter, _BIter, _Predicate);
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
algorithmfwd.h 91 partition
134 * searching, merge, partition, heap, set, minima, maxima, and
178 * searching for the partition point in a partitioned range. We
442 // partition
697 partition(_BIter, _BIter, _Predicate);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
algorithmfwd.h 659 partition(_FIter, _FIter, Predicate, __gnu_parallel::sequential_tag);
663 partition(_FIter, _FIter, Predicate);
algo.h 56 #include <parallel/partition.h>
1668 partition(ForwardIterator begin, ForwardIterator end, function in namespace:std::__parallel
1703 partition(ForwardIterator begin, ForwardIterator end, Predicate pred) function in namespace:std::__parallel
    [all...]
  /external/libvpx/libvpx/vp8/encoder/
rdopt.c 60 PARTITION_INFO partition; member in struct:best_mode_struct
    [all...]
encodeframe.c 520 inter_b_modes[x->partition->bmi[b].mode] ++;
723 BOOL_CODER * bc = &cpi->bc[1]; /* bc[0] is for control partition */
    [all...]
  /external/qemu/
block.c 1155 struct partition { struct
1160 uint8_t sys_ind; /* What partition type */
1165 uint32_t nr_sects; /* nr of sectors in partition */
1168 /* try to guess the disk logical geometry from the MSDOS partition table. Return 0 if OK, -1 if could not guess */
1174 struct partition *p;
1187 p = ((struct partition *)(buf + 0x1be)) + i;
1190 /* We make the assumption that the partition terminates on
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
token.rb 535 value_maps, names = token_names.partition { |i| Hash === i }
  /external/guava/guava/src/com/google/common/collect/
Iterators.java 569 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code
576 * @param size the desired size of each partition (the last may be smaller)
581 public static <T> UnmodifiableIterator<List<T>> partition(
589 * an iterator containing {@code [a, b, c, d, e]} with a partition size of 3
596 * @param size the desired size of each partition
    [all...]
Lists.java 468 * partitioning a list containing {@code [a, b, c, d, e]} with a partition
483 public static <T> List<List<T>> partition(List<T> list, int size) {
488 : new Partition<T>(list, size);
491 private static class Partition<T> extends AbstractList<List<T>> {
495 Partition(List<T> list, int size) {
522 private static class RandomAccessPartition<T> extends Partition<T>
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
Iterators.java 551 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code
558 * @param size the desired size of each partition (the last may be smaller)
563 public static <T> UnmodifiableIterator<List<T>> partition(
571 * an iterator containing {@code [a, b, c, d, e]} with a partition size of 3
578 * @param size the desired size of each partition
    [all...]
  /external/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
_algo.c 672 // partition, stable_partition, and their auxiliary functions
738 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) { function
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
_algo.c 672 // partition, stable_partition, and their auxiliary functions
738 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) { function
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
_algo.c 672 // partition, stable_partition, and their auxiliary functions
738 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) { function
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
_algo.c 672 // partition, stable_partition, and their auxiliary functions
738 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) { function
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
algorithmfwd.h 93 partition
136 * searching, merge, partition, heap, set, minima, maxima, and
180 * searching for the partition point in a partitioned range. We
444 // partition
708 partition(_BIter, _BIter, _Predicate);
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_algo.h 396 // partition, stable_partition, and their auxiliary functions
399 _ForwardIter partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred);
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.jface.text_3.6.1.r361_v20100825-0800.jar 
  /external/v8/src/
array.js 822 partition: for (var i = low_end + 1; i < high_start; i++) {
832 if (high_start == i) break partition;
    [all...]

Completed in 737 milliseconds

1 2 3 4 5 6 7 891011