/external/guava/guava/src/com/google/common/collect/ |
ByFunctionOrdering.java | 30 * An ordering that orders elements by applying an order to the result of a 35 extends Ordering<F> implements Serializable { 37 final Ordering<T> ordering; field in class:ByFunctionOrdering 40 Function<F, ? extends T> function, Ordering<T> ordering) { 42 this.ordering = checkNotNull(ordering); 46 return ordering.compare(function.apply(left), function.apply(right)); 56 && this.ordering.equals(that.ordering) [all...] |
NullsFirstOrdering.java | 25 /** An ordering that treats {@code null} as less than all other values. */ 27 final class NullsFirstOrdering<T> extends Ordering<T> implements Serializable { 28 final Ordering<? super T> ordering; field in class:NullsFirstOrdering 30 NullsFirstOrdering(Ordering<? super T> ordering) { 31 this.ordering = ordering; 44 return ordering.compare(left, right); 47 @Override public <S extends T> Ordering<S> reverse() [all...] |
NullsLastOrdering.java | 25 /** An ordering that treats {@code null} as greater than all other values. */ 27 final class NullsLastOrdering<T> extends Ordering<T> implements Serializable { 28 final Ordering<? super T> ordering; field in class:NullsLastOrdering 30 NullsLastOrdering(Ordering<? super T> ordering) { 31 this.ordering = ordering; 44 return ordering.compare(left, right); 47 @Override public <S extends T> Ordering<S> reverse() [all...] |
MinMaxPriorityQueue.java | 98 return new Builder<Comparable>(Ordering.natural()).create(); 107 return new Builder<E>(Ordering.<E>natural()).create(initialContents); 125 return new Builder<Comparable>(Ordering.natural()) 137 return new Builder<Comparable>(Ordering.natural()) 215 private <T extends B> Ordering<T> ordering() { method in class:MinMaxPriorityQueue.Builder 216 return Ordering.from((Comparator<T>) comparator); 228 Ordering<E> ordering = builder.ordering(); local 489 final Ordering<E> ordering; field in class:MinMaxPriorityQueue.Heap [all...] |
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/executor/ |
FifoPriorityThreadPoolExecutor.java | 18 AtomicInteger ordering = new AtomicInteger(); field in class:FifoPriorityThreadPoolExecutor 37 return new LoadTask<T>(runnable, value, ordering.getAndIncrement());
|
/external/libopus/silk/ |
NLSF2A.c | 73 /* This ordering was found to maximize quality. It improves numerical accuracy of 74 silk_NLSF2A_find_poly() compared to "standard" ordering. */ 81 const unsigned char *ordering; local 92 ordering = d == 16 ? ordering16 : ordering10; 110 cos_LSF_QA[ordering[k]] = silk_RSHIFT_ROUND( silk_LSHIFT( cos_val, 8 ) + silk_MUL( delta, f_frac ), 20 - QA ); /* QA */
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
Extensions.java | 20 private Vector ordering = new Vector(); field in class:Extensions 60 ordering.addElement(ext.getExtnId()); 72 this.ordering.addElement(extension.getExtnId()); 88 this.ordering.addElement(ext.getExtnId()); 98 return ordering.elements(); 144 Enumeration e = ordering.elements(); 182 return toOidArray(ordering); 199 for (int i = 0; i != ordering.size(); i++) 201 Object oid = ordering.elementAt(i);
|
X509Name.java | 353 private Vector ordering = new Vector(); field in class:X509Name 425 ordering.addElement(ASN1ObjectIdentifier.getInstance(s.getObjectAt(0))); 464 * following a specific ordering, you should use the constructor 465 * with the ordering specified below. 466 * @deprecated use an ordered constructor! The hashtable ordering is rarely correct 475 * Constructor from a table of attributes with ordering. 479 * construction process. The ordering vector should contain the OIDs 483 Vector ordering, 486 this(ordering, attributes, new X509DefaultEntryConverter()); 490 * Constructor from a table of attributes with ordering [all...] |
X509Extensions.java | 210 private Vector ordering = new Vector(); field in class:X509Extensions 272 ordering.addElement(s.getObjectAt(0)); 288 * Constructor from a table of extensions with ordering. 294 Vector ordering, 299 if (ordering == null) 305 e = ordering.elements(); 310 this.ordering.addElement(ASN1ObjectIdentifier.getInstance(e.nextElement())); 313 e = this.ordering.elements(); 339 this.ordering.addElement(e.nextElement()); 344 e = this.ordering.elements() [all...] |
/external/guava/guava-tests/benchmark/com/google/common/collect/ |
SortedCopyBenchmark.java | 33 * Ordering#sortedCopy} and {@link Ordering#immutableSortedCopy}, as well as for 103 int ordering(int reps) { method in class:SortedCopyBenchmark 107 dummy += ORDERING.sortedCopy(input).get(0); 111 dummy += ORDERING.immutableSortedCopy(input).get(0); 132 private static final Ordering<Integer> ORDERING = Ordering.natural();
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
IncompleteLUT.h | 235 AMDOrdering<StorageIndex> ordering; local 236 ordering(AtA,m_P); 241 COLAMDOrdering<StorageIndex> ordering; 242 ordering(mat1,m_Pinv);
|
/external/icu/icu4c/source/test/intltest/ |
bidiconf.cpp | 56 int32_t ordering[1000]; member in class:BiDiConformanceTest 116 ordering[orderingCount++]=(int32_t)value; 404 Field 4: An ordered list of indices showing the resulting visual ordering 409 This field is optional. When it is absent, the visual ordering 626 // with the expected ordering that has them omitted. 641 continue; // BiDi control, omitted from expected ordering. 643 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) { 644 errln("\nError on line %d: Wrong ordering value at visual index %d; expected %d actual %d", 645 (int)lineNumber, (int)visualIndex, ordering[visualIndex], logicalIndex); 652 // which should match the length of the BidiTest.txt ordering [all...] |
/external/libusb/examples/getopt/ |
getopt.c | 111 Also, when `ordering' is RETURN_IN_ORDER, 177 the ordering of the two. We describe each non-option ARGV-element 183 of the value of `ordering'. In the case of RETURN_IN_ORDER, only 189 } ordering; 407 /* Determine how to handle the ordering of options and nonoptions. */ 411 ordering = RETURN_IN_ORDER; 416 ordering = REQUIRE_ORDER; 420 ordering = REQUIRE_ORDER; 422 ordering = PERMUTE; 563 if (ordering == PERMUTE 188 } ordering; variable in typeref:enum:__anon25877 [all...] |
/external/selinux/libselinux/src/ |
get_context_list.c | 161 unsigned int *ordering, unsigned int *nordered) 256 the ordering for it. */ 258 if (ordering[i] == nreach) 259 ordering[i] = (*nordered)++; 398 unsigned int *ordering = NULL; local 426 /* Initialize ordering array. */ 427 ordering = malloc(nreach * sizeof(unsigned int)); 428 if (!ordering) 431 ordering[i] = nreach; 433 /* Determine the ordering to apply from the optional per-user confi [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/dexbacked/raw/util/ |
DexAnnotator.java | 35 import com.google.common.collect.Ordering; 155 Ordering<MapItem> ordering = Ordering.from(new Comparator<MapItem>() { local 161 mapItems = ordering.immutableSortedCopy(mapItems);
|
/toolchain/binutils/binutils-2.27/libiberty/ |
getopt.c | 114 Also, when `ordering' is RETURN_IN_ORDER, 180 the ordering of the two. We describe each non-option ARGV-element 186 of the value of `ordering'. In the case of RETURN_IN_ORDER, only 192 } ordering; 418 /* Determine how to handle the ordering of options and nonoptions. */ 422 ordering = RETURN_IN_ORDER; 427 ordering = REQUIRE_ORDER; 431 ordering = REQUIRE_ORDER; 433 ordering = PERMUTE; 563 if (ordering == PERMUTE 191 } ordering; variable in typeref:enum:__anon4996 [all...] |
/external/eigen/Eigen/src/SparseCholesky/ |
SimplicialCholesky.h | 200 ordering(matrix, pmat, tmp); 215 // If there is no ordering, try to directly use the input matrix without any copy 236 ordering(a, pmat, tmp); 241 void ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap); 323 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> 414 * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> 650 void SimplicialCholeskyBase<Derived>::ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap) function in class:Eigen::SimplicialCholeskyBase 655 // Note that ordering methods compute the inverse permutation 662 OrderingType ordering; local 663 ordering(C,m_Pinv) [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/ |
BiDiConformanceTest.java | 147 Field 4: An ordered list of indices showing the resulting visual ordering 152 This field is optional. When it is absent, the visual ordering 321 ordering[orderingCount++]=value; 537 // with the expected ordering that has them omitted. 549 continue; // BiDi control, omitted from expected ordering. 551 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) { 552 errln(" ------------ Wrong ordering value at visual index "+visualIndex+"; expected "+ 553 ordering[visualIndex]+" actual "+logicalIndex); 560 // which should match the length of the BidiTest.txt ordering. 562 errln(" ------------ Wrong number of ordering values; expected "+orderingCount+" actual "+visualIndex) 612 private int ordering[]=new int[1000]; field in class:BiDiConformanceTest [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bidi/ |
BiDiConformanceTest.java | 144 Field 4: An ordered list of indices showing the resulting visual ordering 149 This field is optional. When it is absent, the visual ordering 318 ordering[orderingCount++]=value; 534 // with the expected ordering that has them omitted. 546 continue; // BiDi control, omitted from expected ordering. 548 if(visualIndex<orderingCount && logicalIndex!=ordering[visualIndex]) { 549 errln(" ------------ Wrong ordering value at visual index "+visualIndex+"; expected "+ 550 ordering[visualIndex]+" actual "+logicalIndex); 557 // which should match the length of the BidiTest.txt ordering. 559 errln(" ------------ Wrong number of ordering values; expected "+orderingCount+" actual "+visualIndex) 609 private int ordering[]=new int[1000]; field in class:BiDiConformanceTest [all...] |
/frameworks/base/core/java/android/transition/ |
TransitionSet.java | 87 int ordering = a.getInt(R.styleable.TransitionSet_transitionOrdering, local 89 setOrdering(ordering); 96 * @param ordering {@link #ORDERING_TOGETHER} to play this set's child 101 public TransitionSet setOrdering(int ordering) { 102 switch (ordering) { 111 "ordering: " + ordering); 117 * Returns the ordering of this TransitionSet. By default, the value is 132 * the {@link #getOrdering() ordering} property, determines the
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/X11/extensions/ |
shapeproto.h | 78 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:_ShapeRectangles 222 CARD8 ordering; /* UnSorted, YSorted, YXSorted, YXBanded */ member in struct:__anon61956
|
/frameworks/support/transition/src/main/java/androidx/transition/ |
TransitionSet.java | 113 int ordering = TypedArrayUtils.getNamedInt(a, (XmlResourceParser) attrs, local 116 setOrdering(ordering); 123 * @param ordering {@link #ORDERING_TOGETHER} to play this set's child 129 public TransitionSet setOrdering(int ordering) { 130 switch (ordering) { 139 + "ordering: " + ordering); 145 * Returns the ordering of this TransitionSet. By default, the value is 159 * the {@link #getOrdering() ordering} property, determines the
|
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
TensorConvolution.h | 60 array<Index, NumDims> ordering; local 66 ordering[index] = indices[i]; 77 ordering[written] = i; 85 m_inputStrides[i] = inputStrides[ordering[i]]; 86 m_outputStrides[i] = outputStrides[ordering[i]]; [all...] |
/external/pdfium/core/fpdfapi/parser/ |
cpdf_document.cpp | 813 ByteString ordering; local 819 ordering = "CNS1"; 826 ordering = "GB1"; 835 ordering = "Korea1"; 842 ordering = "Japan1"; 864 pCIDSysInfo->SetNewFor<CPDF_String>("Ordering", ordering, false); [all...] |
/frameworks/base/core/java/android/animation/ |
AnimatorInflater.java | 679 int ordering = a.getInt(R.styleable.AnimatorSet_ordering, TOGETHER); local 680 createAnimatorFromXml(res, theme, parser, attrs, (AnimatorSet) anim, ordering, [all...] |