| /external/chromium_org/third_party/icu/source/test/cintltst/ |
| callcoll.h | 34 int32_t order; member in struct:OrderAndOffset
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| tscoll.h | 26 struct Order
28 int32_t order; member in struct:IntlTestCollator::Order
51 Order *getOrders(CollationElementIterator &iter, int32_t &orderLength);
|
| /external/icu/icu4c/source/test/cintltst/ |
| callcoll.h | 34 int32_t order; member in struct:OrderAndOffset
|
| /external/icu/icu4c/source/test/intltest/ |
| tscoll.h | 26 struct Order
28 int32_t order; member in struct:IntlTestCollator::Order
51 Order *getOrders(CollationElementIterator &iter, int32_t &orderLength);
|
| /external/openssl/crypto/ec/ |
| ec_check.c | 62 BIGNUM *order; local
76 if ((order = BN_CTX_get(ctx)) == NULL) goto err;
97 /* check the order of the generator */
99 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
100 if (BN_is_zero(order))
106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
|
| /external/chromium_org/third_party/boringssl/src/crypto/ecdsa/ |
| ecdsa_asn1.c | 74 BIGNUM *order = NULL; local
91 order = BN_new();
92 if (order == NULL) {
95 if (!EC_GROUP_get_order(group, order, NULL)) {
96 BN_clear_free(order);
100 num_bits = BN_num_bits(order);
113 BN_clear_free(order);
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/ |
| omxSP_FFTFwd_CToC_FC32.c | 68 * Compute an FFT for a complex signal of length of 2^order,
69 * where 0 <= order <= 15.
78 * N = 2^order
82 * 2^order; must be aligned on a 32 byte boundary.
87 * pDst - pointer to the complex-valued output vector, of length 2^order;
105 int order; local
118 order = fastlog2(spec->N);
125 if (order > 3) {
132 if ((order & 2) == 0) {
140 * Odd order uses a radix 8 first stage; even order, a radix
[all...] |
| omxSP_FFTFwd_RToCCS_F32.c | 74 * Compute an FFT for a complex signal of length of 2^order,
75 * where 0 <= order <= 15.
84 * N = 2^order
88 * 2^order; must be aligned on a 32 byte boundary.
93 * pDst - pointer to the complex-valued output vector, of length 2^order;
111 int order; local
127 * Compute the RFFT using a complex FFT of one less order, so set
128 * order to be the order of the complex FFT.
130 order = fastlog2(spec->N) - 1
[all...] |
| 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 & 1)
[all...] |
| 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 > 3)
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestCollidingSetGenerator.java | 44 public List<Object> order(List<Object> insertionOrder) { method in class:TestCollidingSetGenerator
|
| TestContainerGenerator.java | 54 * Returns the iteration ordering of elements, given the order in
63 * non-deterministic iteration order.
65 Iterable<E> order(List<E> insertionOrder); method in interface:TestContainerGenerator
|
| TestStringSortedSetGenerator.java | 36 @Override public List<String> order(List<String> insertionOrder) { method in class:TestStringSortedSetGenerator
|
| /external/libexif/libexif/canon/ |
| exif-mnote-data-canon.h | 24 #include <libexif/exif-byte-order.h>
40 ExifByteOrder order; member in struct:_ExifMnoteDataCanon
|
| mnote-canon-entry.h | 25 #include <libexif/exif-byte-order.h>
38 ExifByteOrder order; member in struct:_MnoteCanonEntry
|
| /external/libexif/libexif/fuji/ |
| exif-mnote-data-fuji.h | 37 ExifByteOrder order; member in struct:_ExifMnoteDataFuji
|
| mnote-fuji-entry.h | 40 ExifByteOrder order; member in struct:_MnoteFujiEntry
|
| /external/libexif/libexif/olympus/ |
| mnote-olympus-entry.h | 25 #include <libexif/exif-byte-order.h>
38 ExifByteOrder order; member in struct:_MnoteOlympusEntry
|
| /external/libexif/libexif/pentax/ |
| mnote-pentax-entry.h | 25 #include <libexif/exif-byte-order.h>
38 ExifByteOrder order; member in struct:_MnotePentaxEntry
|
| /external/libvorbis/doc/ |
| 02-bitpacking.tex | 11 read one-by-one in the same monotonically increasing order by the
39 \subsubsection{bit order}
50 \subsubsection{byte order}
63 Logically, bytes are always coded and decoded in order from byte zero
|
| /external/chromium_org/skia/ext/ |
| recursive_gaussian_convolution.h | 21 enum Order {
29 SK_API RecursiveFilter(float sigma, Order order);
31 Order order() const { return order_; } function in class:skia::RecursiveFilter
35 Order order_;
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/api/ |
| mipsSP.h | 33 OMX_U32 order; member in struct:MIPSFFTSpec_R_FC32_Tag
|
| /external/chromium_org/third_party/re2/util/ |
| 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[j]))
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkTileGrid.h | 54 size_t order; // Insertion order. Used to preserve order when merging multiple tiles. member in struct:SkTileGrid::Entry
62 // (fXTiles * fYTiles) SkTDArrays, each listing data overlapping that tile in insertion order.
|
| /external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
| real_fft.c | 18 int order; member in struct:RealFFT
21 struct RealFFT* WebRtcSpl_CreateRealFFTC(int order) {
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, 1)
[all...] |
