/external/openfst/src/include/fst/ |
H A D | statesort.h | 39 const vector<typename Arc::StateId> &order) { 43 if (order.size() != fst->NumStates()) { 44 FSTERROR() << "StateSort: bad order vector size: " << order.size(); 54 vector<bool> done(order.size(), false); 58 fst->SetStart(order[fst->Start()]); 73 s2 = order[s1]; 86 arc.nextstate = order[arc.nextstate]; 38 StateSort(MutableFst<Arc> *fst, const vector<typename Arc::StateId> &order) argument
|
/external/pdfium/core/src/fxcrt/ |
H A D | fx_basic_utf.cpp | 69 int order = 1 << ((nbytes - 1) * 6);
local 71 m_Buffer.AppendChar(prefix[nbytes - 2] | (code / order));
73 code = code % order;
74 order >>= 6;
75 m_Buffer.AppendChar(0x80 | (code / order));
|
/external/regex-re2/util/ |
H A D | sparse_array_test.cc | 18 int order[n]; local 21 order[i] = i; 26 int t = order[i]; 27 order[i] = order[j]; 28 order[j] = t; 33 ASSERT_TRUE(set.has_index(order[j])); 34 ASSERT_EQ(value[order[j]], set.get(order[j], -1)); 39 ASSERT_FALSE(set.has_index(order[ [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | statesort.h | 34 const vector<typename Arc::StateId> &order) { 38 CHECK_EQ(order.size(), fst->NumStates()); 45 vector<bool> done(order.size(), false); 49 fst->SetStart(order[fst->Start()]); 64 s2 = order[s1]; 77 arc.nextstate = order[arc.nextstate]; 33 StateSort(MutableFst<Arc> *fst, const vector<typename Arc::StateId> &order) argument
|
/external/chromium_org/third_party/WebKit/Source/web/linux/ |
H A D | WebFontRendering.cpp | 79 void WebFontRendering::setLCDOrder(SkFontHost::LCDOrder order) argument 81 SkFontHost::SetSubpixelOrder(order);
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | TreeNodeTest.cpp | 207 TestTree* order[] = { local 214 EXPECT_EQ(node, order[orderIndex]); 215 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*)); 224 TestTree* order[] = { local 231 EXPECT_EQ(node, order[orderIndex]); 232 EXPECT_EQ(orderIndex, sizeof(order) / sizeof(TestTree*));
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | eval.c | 40 __glFillMap1f(GLint k, GLint order, GLint stride, argument 45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k); 50 for (i = 0; i < order; i++) { 59 __glFillMap1d(GLint k, GLint order, GLint stride, argument 64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k); 68 for (i = 0; i < order; i++) {
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/ |
H A D | omxSP_FFTInv_CCSToR_F32.c | 125 * using CCS format, of length (2^order) + 2; must be aligned on a 132 * 2^order ; must be aligned on a 32-byte boundary. 149 int order; local 176 order = fastlog2(spec->N) - 1; 187 pComplexSrc = pOut + (1 << order); 190 if (order > 3) { 197 if ((order & 2) == 0) { 205 * Odd order uses a radix 8 first stage; even order, a radix 4 208 if (order [all...] |
H A D | omxSP_FFTInv_CToC_FC32.c | 75 * greater than or equal to 2 (order >= 1) 92 * length of 2^order, where 0 <= order <= 15. Transform length is 100 * N=2^order. 103 * pSrc - pointer to the complex-valued input signal, of length 2^order ; 109 * order 110 * pDst - pointer to the complex-valued output signal, of length 2^order; 128 int order; local 141 order = fastlog2(spec->N); 148 if (order > [all...] |
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
H A D | omxSP_FFTFwd_RToCCS_S16S32_Sfs_s.S | 68 #define order r7 define 117 CLZ order,N @// N = 2^order 118 RSB order,order,#31 120 TST order,#1
|
/external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/ |
H A D | omxSP_FFTInit_C_FC32.c | 36 * [in] order base-2 logarithm of the desired block length; 46 OMXResult omxSP_FFTInit_C_FC32(OMXFFTSpec_C_FC32* pFFTSpec, OMX_INT order) { argument 66 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER)) 70 Nby2 = 1 << (order - 1); 100 * N = 1 << order 101 * W = -PI >> (order - 1) 104 diff = TWIDDLE_TABLE_ORDER - order; 105 /* step into the twiddle table for the current order */ 112 if (order > [all...] |
/external/chromium_org/third_party/opus/src/silk/fixed/ |
H A D | corrMatrix_FIX.c | 40 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */ 43 const opus_int order, /* I Max lag for correlation */ 44 opus_int32 *Xt, /* O Pointer to X'*t correlation vector [order] */ 52 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */ 57 for( lag = 0; lag < order; lag++ ) { 67 for( lag = 0; lag < order; lag++ ) { 76 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */ 78 const opus_int order, /* I Max lag for correlation */ 80 opus_int32 *XX, /* O Pointer to X'*X correlation matrix [ order x order ] */ 39 silk_corrVector_FIX( const opus_int16 *x, const opus_int16 *t, const opus_int L, const opus_int order, opus_int32 *Xt, const opus_int rshifts ) argument 75 silk_corrMatrix_FIX( const opus_int16 *x, const opus_int L, const opus_int order, const opus_int head_room, opus_int32 *XX, opus_int *rshifts ) argument [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticReduceOrder_Test.cpp | 33 int order; local 50 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 51 if (order != 2) { 52 printf("[%d] line quad order=%d\n", (int) index, order); 57 order = reduceOrder(quad, reduce, kReduceOrder_TreatAsFill); 58 if (order != 3) { 59 printf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsQuadReduceOrderTest.cpp | 32 int order; local 51 order = reducer.reduce(quad); 52 if (order != 2) { 53 SkDebugf("[%d] line quad order=%d\n", (int) index, order); 58 order = reducer.reduce(quad); 59 if (order != 3) { 60 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
|
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
H A D | real_fft.c | 18 int order; member in struct:RealFFT 21 struct RealFFT* WebRtcSpl_CreateRealFFTC(int order) { argument 24 if (order > kMaxFFTOrder || order < 0) { 32 self->order = order; 53 int n = 1 << self->order; 54 // The complex-value FFT implementation needs a buffer to hold 2^order 64 WebRtcSpl_ComplexBitReverse(complex_buffer, self->order); 65 result = WebRtcSpl_ComplexFFT(complex_buffer, self->order, 107 WebRtcSpl_CreateRealFFTNeon(int order) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | StdCatchBuilder.java | 41 /** {@code non-null;} block output order */ 42 private final int[] order; field in class:StdCatchBuilder 52 * @param order {@code non-null;} block output order 55 public StdCatchBuilder(RopMethod method, int[] order, argument 61 if (order == null) { 62 throw new NullPointerException("order == null"); 70 this.order = order; 76 return build(method, order, addresse 122 build(RopMethod method, int[] order, BlockAddresses addresses) argument [all...] |
/external/eigen/test/ |
H A D | product_symm.cpp | 17 enum { order = OtherSize==1 ? 0 : RowMajor }; enumerator in enum:__anon21052 18 typedef Matrix<Scalar, Size, OtherSize,order> Rhs3;
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | OneSizeGenerator.java | 86 public Iterable<E> order(List<E> insertionOrder) { method in class:OneSizeGenerator 87 return generator.order(insertionOrder);
|
H A D | ReserializingTestCollectionGenerator.java | 80 public Iterable<E> order(List<E> insertionOrder) { method in class:ReserializingTestCollectionGenerator 81 return delegate.order(insertionOrder);
|
H A D | TestEnumMapGenerator.java | 78 public Iterable<Entry<AnEnum, String>> order( method in class:TestEnumMapGenerator
|
H A D | TestMapEntrySetGenerator.java | 64 public List<Map.Entry<K, V>> order(List<Map.Entry<K, V>> insertionOrder) { method in class:TestMapEntrySetGenerator
|
H A D | TestStringMapGenerator.java | 81 public Iterable<Entry<String, String>> order( method in class:TestStringMapGenerator
|
/external/icu/icu4c/source/i18n/unicode/ |
H A D | coleitr.h | 66 * The key of a character, is an integer composed of primary order(short), 67 * secondary order(char), and tertiary order(char). Java strictly defines the 82 * int32_t order = c->next(success); 84 * order = c->previous(success); 91 * The method next() returns the collation order of the next character based on 93 * collation order of the previous character based on the comparison level of 100 * Hence at the next call of next() or previous(), the first or last collation order, 101 * or collation order at the spefcifieid position will be returned. If a change of 107 * Character based on the comparison level of the collator. A collation order 380 primaryOrder(int32_t order) argument 385 secondaryOrder(int32_t order) argument 390 tertiaryOrder(int32_t order) argument 395 isIgnorable(int32_t order) argument [all...] |
/external/iproute2/tc/ |
H A D | f_route.c | 43 __u32 order = 0; local 108 } else if (matches(*argv, "order") == 0) { 110 if (get_u32(&order, *argv, 0)) { 111 fprintf(stderr, "Illegal \"order\"\n"); 125 if (order) { 127 fh |= (order<<8)&0x7F00; 147 fprintf(f, "order %d ", (handle>>8)&0x7F);
|
/external/libexif/libexif/olympus/ |
H A D | exif-mnote-data-olympus.h | 26 #include <libexif/exif-byte-order.h> 50 ExifByteOrder order; member in struct:_ExifMnoteDataOlympus
|