/external/replicaisland/src/com/replica/replicaisland/ |
H A D | QuickSorter.java | 47 int i = partition(a, left, right, comparator); 52 // partition a[left] to a[right], assumes left < right 53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { method in class:QuickSorter 71 Type swap = a[i]; // swap with partition element
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
H A D | Percentile.java | 323 // select a pivot and partition work array around it 324 pivot = partition(work, begin, end, medianOf3(work, begin, end)); 334 // the element is in the left partition 338 // the element is in the right partition 394 * @return index of the pivot after partition 396 private int partition(final double[] work, final int begin, final int end, final int pivot) { method in class:Percentile
|
/external/kernel-headers/original/uapi/linux/ |
H A D | fsl_hypervisor.h | 46 * struct fsl_hv_ioctl_restart - restart a partition 48 * @partition: the ID of the partition to restart, or -1 for the 49 * calling partition 55 __u32 partition; member in struct:fsl_hv_ioctl_restart 59 * struct fsl_hv_ioctl_status - get a partition's status 61 * @partition: the ID of the partition to query, or -1 for the 62 * calling partition 63 * @status: The returned status of the partition 75 __u32 partition; member in struct:fsl_hv_ioctl_status 90 __u32 partition; member in struct:fsl_hv_ioctl_start 105 __u32 partition; member in struct:fsl_hv_ioctl_stop [all...] |
/external/llvm/lib/ExecutionEngine/Orc/ |
H A D | IndirectionUtils.cpp | 86 void partition(Module &M, const ModulePartitionMap &PMap) { function in namespace:llvm::orc 160 partition(M, PMap);
|
/external/vboot_reference/cgpt/ |
H A D | cgpt_prioritize.c | 13 // contains an unordered list of GPT partition numbers. 54 static void AddToGroup(group_list_t *gl, int priority, int partition) { argument 66 // add the partition to it 68 gl->group[i].part[j] = partition; 123 Error("invalid partition number: %d (must be between 1 and %d\n", 130 Error("partition %d is not a ChromeOS kernel\n", params->set_partition); 151 // Is this partition special?
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | Ordering.java | 668 * the buffer gets full, find the median and partition around it, keeping 669 * only the lowest k elements. This requires n/k find-median-and-partition 700 // We apply the quickselect algorithm to partition about the median, 711 int pivotNewIndex = partition(buffer, left, right, pivotIndex); 738 private <E extends T> int partition( method in class:Ordering
|
H A D | Iterables.java | 520 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code 529 * Lists#partition(List, int)} instead. 532 * @param size the desired size of each partition (the last may be smaller) 537 public static <T> Iterable<List<T>> partition( method in class:Iterables 544 return Iterators.partition(iterable.iterator(), size); 552 * an iterable containing {@code [a, b, c, d, e]} with a partition size of 3 560 * @param size the desired size of each partition
|
H A D | Lists.java | 601 * partitioning a list containing {@code [a, b, c, d, e]} with a partition 616 public static <T> List<List<T>> partition(List<T> list, int size) { method in class:Lists
|
H A D | Iterators.java | 567 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code 574 * @param size the desired size of each partition (the last may be smaller) 579 public static <T> UnmodifiableIterator<List<T>> partition( method in class:Iterators 587 * an iterator containing {@code [a, b, c, d, e]} with a partition size of 3 594 * @param size the desired size of each partition
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_entropymode.h | 60 unsigned int partition[PARTITION_CONTEXTS][PARTITION_TYPES]; member in struct:__anon9513
|
H A D | vp9_blockd.h | 240 PARTITION_TYPE partition) { 241 return subsize_lookup[partition][bsize]; 239 get_subsize(BLOCK_SIZE bsize, PARTITION_TYPE partition) argument
|
/external/openfst/src/include/fst/ |
H A D | partition.h | 0 // partition.h 18 // \file Functions and classes to create a partition of states 66 // Create an empty partition for num_states. At initialization time 105 // partition. Once elements have been added to a class, you need to 199 // partition, create new once and update the queue of active classes 255 // iterate over members of a class in a partition 260 PartitionIterator(const Partition<T>& partition, T class_id) argument 261 : p_(partition),
|
H A D | minimize.h | 40 #include <fst/partition.h> 49 // comparator for creating partition based on sorting on 66 const Partition<typename A::StateId>& partition, 68 : fst_(fst), partition_(partition), flags_(flags) {} 146 const Partition<StateId>& partition() const { function in class:fst::CyclicMinimizer 155 ArcIterCompare(const Partition<StateId>& partition) argument 156 : partition_(partition) {} 162 // (partition class Ids) 213 // in the partition corresponding to final, non-final 223 // prep partition 65 StateComparator(const Fst<A>& fst, const Partition<typename A::StateId>& partition, uint32 flags = kCompareAll) argument 323 const Partition<StateId>& partition() { function in class:fst::AcyclicMinimizer 454 MergeStates( const Partition<typename A::StateId>& partition, MutableFst<A>* fst) argument [all...] |
/external/vboot_reference/host/include/ |
H A D | cgpt_params.h | 26 uint32_t partition; member in struct:CgptAddParams 52 uint32_t partition; member in struct:CgptShowParams 67 uint32_t partition; member in struct:CgptBootParams
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterables.java | 503 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code 512 * Lists#partition(List, int)} instead. 515 * @param size the desired size of each partition (the last may be smaller) 520 public static <T> Iterable<List<T>> partition( method in class:Iterables 527 return Iterators.partition(iterable.iterator(), size); 535 * an iterable containing {@code [a, b, c, d, e]} with a partition size of 3 543 * @param size the desired size of each partition
|
H A D | Lists.java | 567 * partitioning a list containing {@code [a, b, c, d, e]} with a partition 582 public static <T> List<List<T>> partition(List<T> list, int size) { method in class:Lists
|
H A D | Iterators.java | 549 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@code 556 * @param size the desired size of each partition (the last may be smaller) 561 public static <T> UnmodifiableIterator<List<T>> partition( method in class:Iterators 569 * an iterator containing {@code [a, b, c, d, e]} with a partition size of 3 576 * @param size the desired size of each partition
|
/external/deqp/modules/gles2/accuracy/ |
H A D | es2aTextureMipmapTests.cpp | 498 bool partition = rnd.getFloat() > 0.4f; local 499 bool partitionX = partition && width > minWidth && rnd.getBool(); 500 bool partitionY = partition && height > minHeight && !partitionX;
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fTextureMipmapTests.cpp | 555 bool partition = rnd.getFloat() > 0.4f; local 556 bool partitionX = partition && width > minWidth && rnd.getBool(); 557 bool partitionY = partition && height > minHeight && !partitionX;
|
/external/deqp/modules/gles3/accuracy/ |
H A D | es3aTextureMipmapTests.cpp | 486 bool partition = rnd.getFloat() > 0.4f; local 487 bool partitionX = partition && width > minWidth && rnd.getBool(); 488 bool partitionY = partition && height > minHeight && !partitionX;
|
/external/deqp/modules/gles3/functional/ |
H A D | es3fTextureMipmapTests.cpp | 594 bool partition = rnd.getFloat() > 0.4f; local 595 bool partitionX = partition && width > minWidth && rnd.getBool(); 596 bool partitionY = partition && height > minHeight && !partitionX;
|
/external/flac/libFLAC/ |
H A D | stream_decoder.c | 2741 unsigned partition, sample, u; local 2769 for(partition = 0; partition < partitions; partition++) { 2772 partitioned_rice_contents->parameters[partition] = rice_parameter; 2774 partitioned_rice_contents->raw_bits[partition] = 0; 2775 u = (partition_order == 0 || partition > 0)? partition_samples : partition_samples - predictor_order; 2783 partitioned_rice_contents->raw_bits[partition] = rice_parameter; 2784 for(u = (partition_order == 0 || partition > 0)? 0 : predictor_order; u < partition_samples; u++, sample++) {
|
/external/kernel-headers/original/uapi/linux/genwqe/ |
H A D | genwqe_card.h | 341 __u32 partition; /* '0', '1', or 'v' */ member in struct:genwqe_bitstream
|
/external/libvorbis/lib/ |
H A D | psy.c | 959 /* sort magnitudes for noise norm portion of partition */ 1019 int partition=(p->vi->normal_p ? p->vi->normal_partition : 16); local 1050 raw[0] = alloca(ch*partition*sizeof(**raw)); 1051 quant[0] = alloca(ch*partition*sizeof(**quant)); 1052 floor[0] = alloca(ch*partition*sizeof(**floor)); 1053 flag[0] = alloca(ch*partition*sizeof(**flag)); 1056 raw[i] = &raw[0][partition*i]; 1057 quant[i] = &quant[0][partition*i]; 1058 floor[i] = &floor[0][partition*i]; 1059 flag[i] = &flag[0][partition* [all...] |
/external/libvpx/libvpx/vp9/decoder/ |
H A D | vp9_decodeframe.c | 402 ++cm->counts.partition[ctx][p]; 412 PARTITION_TYPE partition; local 418 partition = read_partition(cm, xd, hbs, mi_row, mi_col, bsize, r); 419 subsize = get_subsize(bsize, partition); 427 switch (partition) { 448 assert(0 && "Invalid partition type"); 452 // update partition context 454 (bsize == BLOCK_8X8 || partition != PARTITION_SPLIT)) 465 // Validate the calculated partition length. If the buffer 466 // described by the partition ca [all...] |