/external/guava/guava-tests/test/com/google/common/primitives/ |
H A D | ByteArrayAsListTest.java | 152 public List<Byte> order(List<Byte> insertionOrder) { method in class:ByteArrayAsListTest.TestByteListGenerator
|
H A D | CharArrayAsListTest.java | 152 public List<Character> order(List<Character> insertionOrder) { method in class:CharArrayAsListTest.TestCharListGenerator
|
H A D | DoubleArrayAsListTest.java | 152 public List<Double> order(List<Double> insertionOrder) { method in class:DoubleArrayAsListTest.TestDoubleListGenerator
|
H A D | FloatArrayAsListTest.java | 152 public List<Float> order(List<Float> insertionOrder) { method in class:FloatArrayAsListTest.TestFloatListGenerator
|
H A D | IntArrayAsListTest.java | 152 public List<Integer> order(List<Integer> insertionOrder) { method in class:IntArrayAsListTest.TestIntegerListGenerator
|
H A D | LongArrayAsListTest.java | 152 public List<Long> order(List<Long> insertionOrder) { method in class:LongArrayAsListTest.TestLongListGenerator
|
H A D | ShortArrayAsListTest.java | 152 public List<Short> order(List<Short> insertionOrder) { method in class:ShortArrayAsListTest.TestShortListGenerator
|
/external/mesa3d/src/glx/ |
H A D | render2.c | 43 GLint order, const GLdouble * pnts) 54 else if (stride < k || order <= 0) { 58 compsize = k * order * __GLX_SIZE_FLOAT64; 69 __GLX_PUT_LONG(24, order); 74 __glFillMap1d(k, order, stride, pnts, (pc + 28)); 83 __GLX_PUT_LONG(28, order); 97 __glFillMap1d(k, order, stride, pnts, buf); 110 GLint order, const GLfloat * pnts) 121 else if (stride < k || order <= 0) { 125 compsize = k * order * __GLX_SIZE_FLOAT3 42 __indirect_glMap1d(GLenum target, GLdouble u1, GLdouble u2, GLint stride, GLint order, const GLdouble * pnts) argument 109 __indirect_glMap1f(GLenum target, GLfloat u1, GLfloat u2, GLint stride, GLint order, const GLfloat * pnts) argument [all...] |
/external/openfst/src/include/fst/ |
H A D | topsort.h | 46 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument 47 : order_(order), acyclic_(acyclic) {} 78 vector<StateId> *finish_; // states in finishing-time order 94 vector<StateId> order; local 97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 101 StateSort(fst, order);
|
/external/oprofile/libpp/ |
H A D | symbol_sort.cpp | 43 int compare_by(sort_options::sort_order order, argument 46 switch (order) { 85 << static_cast<int>(order) << endl; 95 symbol_compare(vector<sort_options::sort_order> const & order, argument 97 : compare_order(order), reverse_sort(reverse) {} 187 void sort_options::add_sort_option(sort_options::sort_order order) argument 189 options.push_back(order);
|
/external/skia/experimental/Intersection/ |
H A D | ConvexHull.cpp | 20 The indices returned in order describe the convex hull. 22 int convex_hull(const Cubic& cubic, char order[4]) { argument 32 order[0] = yMin; 48 order[1] = side1; 49 order[2] = side2; 78 order[0] = yMin; 79 order[1] = least; 84 order[2] = midX; 90 order[2] = most; 93 order[ [all...] |
H A D | CubicToQuadratics.cpp | 98 int order = 0; local 107 if (order < o1) { 108 order = o1; 113 return order; 143 // it would still take the prechopped cubic for reduce order and find cubic inflections 146 int order = reduceOrder(cubic, reduced, kReduceOrder_QuadraticsAllowed, 148 if (order < 3) {
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | topsort.h | 41 TopOrderVisitor(vector<StateId> *order, bool *acyclic) argument 42 : order_(order), acyclic_(acyclic) {} 73 vector<StateId> *finish_; // states in finishing-time order 89 vector<StateId> order; local 92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 96 StateSort(fst, order);
|
/external/webrtc/src/common_audio/signal_processing/ |
H A D | levinson_durbin.c | 23 WebRtc_Word16 order) 40 // Normalize the autocorrelation R[0]...R[order+1] 44 for (i = order; i >= 0; i--) 108 for (i = 2; i <= order; i++) 244 Set A[0] to 1.0 and store the A[i] i=1...order in Q12 250 for (i = 1; i <= order; i++) 22 WebRtcSpl_LevinsonDurbin(WebRtc_Word32 *R, WebRtc_Word16 *A, WebRtc_Word16 *K, WebRtc_Word16 order) argument
|
/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
H A D | filters.c | 30 WebRtc_Word16 order, 54 for (i = 1; i < order + 1; i++) { 65 return(order + 1); 27 WebRtcIsacfix_AutocorrC(WebRtc_Word32* __restrict r, const WebRtc_Word16* __restrict x, WebRtc_Word16 N, WebRtc_Word16 order, WebRtc_Word16* __restrict scale) argument
|
H A D | filters_neon.c | 30 WebRtc_Word16 order, 85 for (i = 1; i < order + 1; i++) { 95 for (i = 1; i < order + 1; i++) { 166 return(order + 1); 26 WebRtcIsacfix_AutocorrNeon( WebRtc_Word32* __restrict r, const WebRtc_Word16* __restrict x, WebRtc_Word16 N, WebRtc_Word16 order, WebRtc_Word16* __restrict scale) argument
|
/external/chromium_org/net/dns/ |
H A D | address_sorter_posix_unittest.cc | 160 // Verify that NULL-terminated |addresses| matches (-1)-terminated |order| 162 void Verify(const char* addresses[], const int order[]) { argument 166 for (size_t i = 0; order[i] >= 0; ++i) 167 CHECK_LT(order[i], static_cast<int>(list.size())); 175 for (size_t i = 0; (i < result.size()) || (order[i] >= 0); ++i) { 176 IPEndPoint expected = order[i] >= 0 ? list[order[i]] : IPEndPoint(); 179 "Address out of order at position " << i << "\n" << 193 const int order[] = { 1, -1 }; 194 Verify(addresses, order); [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | coleitr.cpp | 255 int32_t CollationElementIterator::strengthOrder(int32_t order) const 260 order &= RuleBasedCollator::PRIMARYDIFFERENCEONLY; 263 order &= RuleBasedCollator::SECONDARYDIFFERENCEONLY; 266 return order; 277 const RuleBasedCollator* order, 310 m_data_ = ucol_openElements(order->ucollator, string, length, &status); 325 const RuleBasedCollator* order, 343 Normalizer::EMode decomp = order->getStrength() == Collator::IDENTICAL 344 ? Normalizer::NO_OP : order->getDecomposition(); 378 m_data_ = ucol_openElements(order 275 CollationElementIterator( const UnicodeString& sourceText, const RuleBasedCollator* order, UErrorCode& status) argument 323 CollationElementIterator( const CharacterIterator& sourceText, const RuleBasedCollator* order, UErrorCode& status) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/math/ |
H A D | m_eval.c | 84 GLuint dim, GLuint order) 89 if (order >= 2) { 90 bincoeff = (GLfloat) (order - 1); 96 for (i = 2, cp += 2 * dim, powert = t * t; i < order; 98 bincoeff *= (GLfloat) (order - i); 105 else { /* order=1 -> constant curve */ 83 _math_horner_bezier_curve(const GLfloat * cp, GLfloat * out, GLfloat t, GLuint dim, GLuint order) argument
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
H A D | omxSP_FFTInv_CToC_FC32_Sfs_s.S | 73 #define order r14 define 115 CLZ order,N @// N = 2^order 116 RSB order,order,#31 120 CMP order,#3 121 BGT orderGreaterthan3 @// order > 3 123 CMP order,#1 124 BGE orderGreaterthan0 @// order > 0 132 CMP order,# [all...] |
H A D | omxSP_FFTInv_CToC_SC32_Sfs_s.S | 89 #define order r14 define 126 CLZ order,N @// N = 2^order 127 RSB order,order,#31 131 ADD scale,scale,order @// FFTInverse has a final scaling factor by N 133 CMP order,#3 134 BGT orderGreaterthan3 @// order > 3 136 CMP order,#1 137 BGE orderGreaterthan0 @// order > [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicIntersection.cpp | 37 int order = reduceOrder(quad, simple, kReduceOrder_TreatAsFill); local 47 if (order > 1) { 50 if (order > 2) { 54 SkASSERT(order < 4 && order > 0); 56 return order;
|
H A D | CubicReduceOrder_Test.cpp | 16 int order; local 49 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 51 if (order != 1) { 52 SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order); 57 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 59 if (order == 1) { 60 SkDebugf("[%d] notPointDegenerates order=%d\n", (int) index, order); 65 order [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 33 int order = reducer->reduce(quad); local 46 if (order > 1) { 49 if (order > 2) { 53 SkASSERT(order < 4 && order > 0); 56 return order;
|
H A D | SkDCubicToQuads.cpp | 117 // it would still take the prechopped cubic for reduce order and find cubic inflections 120 int order = reducer.reduce(*this, SkReduceOrder::kAllow_Quadratics); local 121 if (order < 3) {
|