HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 476 - 500 of 1317) sorted by null

<<11121314151617181920>>

  /system/extras/librank/
librank.c 69 static int order; variable
228 order = -1;
302 order *= -1;
432 " (Default sort order is PSS.)\n"
435 " -R Reverse sort order (default is descending).\n"
463 return order * numcmp(
471 return order * compfn( \
  /external/chromium_org/third_party/icu/source/i18n/
colldata.cpp 57 int32_t order; local
87 while ((order = ucol_next(elems, &status)) != UCOL_NULLORDER) {
88 UBool cont = isContinuation(order);
90 order &= strengthMask;
92 if (toShift && variableTop > (uint32_t)order && (order & UCOL_PRIMARYORDERMASK) != 0) {
94 order &= UCOL_PRIMARYORDERMASK;
96 order = UCOL_IGNORABLE;
100 if (order == UCOL_IGNORABLE) {
105 order |= UCOL_CONTINUATION_MARKER
    [all...]
ucol_imp.h 69 * Physical order of structures:
397 /* mask off anything but primary order */
399 /* mask off anything but secondary order */
401 /* mask off anything but tertiary order */
403 /* primary order shift */
405 /* secondary order shift */
416 #define UCOL_PRIMARYORDER(order) (((order) & UCOL_PRIMARYORDERMASK)>> UCOL_PRIMARYORDERSHIFT)
417 #define UCOL_SECONDARYORDER(order) (((order) & UCOL_SECONDARYORDERMASK)>> UCOL_SECONDARYORDERSHIFT
    [all...]
  /external/icu4c/i18n/
ucol_imp.h 73 * Physical order of structures:
395 /* mask off anything but primary order */
397 /* mask off anything but secondary order */
399 /* mask off anything but tertiary order */
401 /* primary order shift */
403 /* secondary order shift */
414 #define UCOL_PRIMARYORDER(order) (((order) & UCOL_PRIMARYORDERMASK)>> UCOL_PRIMARYORDERSHIFT)
415 #define UCOL_SECONDARYORDER(order) (((order) & UCOL_SECONDARYORDERMASK)>> UCOL_SECONDARYORDERSHIFT
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/nio/tests/java/nio/
CharBufferTest.java 99 assertEquals(buf.order(), readonly.order());
124 assertEquals(buf.order(), readonly.order());
227 assertEquals(buf.order(), duplicate.order());
254 assertEquals(buf.order(), duplicate.order());
630 assertEquals(buf.order(), slice.order());
    [all...]
DoubleBufferTest.java 120 assertEquals(buf.order(), readonly.order());
223 assertEquals(buf.order(), duplicate.order());
413 assertEquals(ByteOrder.nativeOrder(), buf.order());
587 assertEquals(buf.order(), slice.order());
  /external/chromium/chrome/common/extensions/docs/examples/api/webNavigation/basic/
navigation_collector.js 23 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
32 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
41 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
49 // in handling in order to build up a complete picture of the whole
312 * successful navigation requests, sorted in decending order of frequency.
326 * unsuccessful navigation requests, sorted in decending order
342 * navigation requests, sorted in decending order of frequency.
  /external/aac/libAACenc/src/
bitenc.cpp 440 description: encode TNS data (filter order, coeffs, ..)
474 description: encode TNS data (filter order, coeffs, ..)
512 FDK_ASSERT(tnsInfo->order[i][j] <= 12);
513 FDKwriteBits(hBitStream,tnsInfo->order[i][j],(blockType==SHORT_WINDOW?3:5));
515 if (tnsInfo->order[i][j]){
520 for(k=0; k<tnsInfo->order[i][j]; k++) {
529 for(k=0; k<tnsInfo->order[i][j]; k++) {
539 for (k=0; k<tnsInfo->order[i][j]; k++ ) {
558 if (tnsInfo->order[i][j]) {
563 for (k=0; k<tnsInfo->order[i][j]; k++)
    [all...]
  /external/flac/libFLAC/
stream_decoder.c 122 static FLAC__bool read_subframe_fixed_(FLAC__StreamDecoder *decoder, unsigned channel, unsigned bps, const unsigned order, FLAC__bool do_full_decode);
123 static FLAC__bool read_subframe_lpc_(FLAC__StreamDecoder *decoder, unsigned channel, unsigned bps, const unsigned order, FLAC__bool do_full_decode);
163 void (*local_lpc_restore_signal)(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]);
165 void (*local_lpc_restore_signal_64bit)(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]);
167 void (*local_lpc_restore_signal_16bit)(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]);
168 /* for use when the signal is <= 16 bits-per-sample, or <= 15 bits-per-sample on a side channel (which requires 1 extra bit), AND order <= 8: */
169 void (*local_lpc_restore_signal_16bit_order8)(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]);
    [all...]
  /external/wpa_supplicant_8/src/common/
sae.c 35 tmp->order = crypto_ec_get_order(tmp->ec);
57 tmp->order_buf = crypto_bignum_init_set(tmp->dh->order,
63 tmp->order = tmp->order_buf;
119 int order_len_bits = crypto_bignum_bits(sae->tmp->order);
137 crypto_bignum_cmp(bn, sae->tmp->order) >= 0)
258 crypto_bignum_div(b, sae->tmp->order, b) < 0) {
487 crypto_bignum_mod(sae->tmp->own_commit_scalar, sae->tmp->order,
617 crypto_bignum_mod(tmp, sae->tmp->order, tmp);
766 crypto_bignum_cmp(peer_scalar, sae->tmp->order) >= 0) {
858 sae->tmp->order, sae->tmp->prime, res) < 0 |
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/ec/
ectest.c 195 /* test multiplication with group order, long and negative scalars */
198 BIGNUM *n1, *n2, *order; local
203 n1 = BN_new(); n2 = BN_new(); order = BN_new();
204 fprintf(stdout, "verify group order ...");
206 if (!EC_GROUP_get_order(group, order, ctx)) ABORT;
207 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
212 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
217 /* n1 = 1 - order */
218 if (!BN_sub(n1, n1, order)) ABORT;
221 /* n2 = 1 + order */
1284 const char *p, *a, *b, *Qx, *Qy, *Gx, *Gy, *order, *d; member in struct:nistp_test_params
1336 BIGNUM *p, *a, *b, *x, *y, *n, *m, *order; local
    [all...]
ec_mult.c 770 BIGNUM *order; local
797 order = BN_CTX_get(ctx);
798 if (order == NULL) goto err;
800 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
801 if (BN_is_zero(order))
807 bits = BN_num_bits(order);
  /external/openssl/crypto/ec/
ectest.c 195 /* test multiplication with group order, long and negative scalars */
198 BIGNUM *n1, *n2, *order; local
203 n1 = BN_new(); n2 = BN_new(); order = BN_new();
204 fprintf(stdout, "verify group order ...");
206 if (!EC_GROUP_get_order(group, order, ctx)) ABORT;
207 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
212 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
217 /* n1 = 1 - order */
218 if (!BN_sub(n1, n1, order)) ABORT;
221 /* n2 = 1 + order */
1284 const char *p, *a, *b, *Qx, *Qy, *Gx, *Gy, *order, *d; member in struct:nistp_test_params
1336 BIGNUM *p, *a, *b, *x, *y, *n, *m, *order; local
    [all...]
ec_mult.c 770 BIGNUM *order; local
797 order = BN_CTX_get(ctx);
798 if (order == NULL) goto err;
800 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
801 if (BN_is_zero(order))
807 bits = BN_num_bits(order);
  /external/chromium_org/chrome/browser/resources/file_manager/js/
async_util.js 14 * Added tasks will be executed sequentially in order they were added.
52 * a dependency order.
87 * Runs the enqueued closured in order of dependencies.
  /external/chromium_org/third_party/opus/src/silk/
SigProc_FIX.h 38 #define SILK_MAX_ORDER_LPC 16 /* max order of the LPC analysis in schur() and k2a() */
91 * second order ARMA filter;
105 /* Variable order MA prediction error filter. */
109 const opus_int16 *B, /* I MA prediction coefficients, Q12 [order] */
111 const opus_int32 d /* I Filter order */
131 const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */
132 const opus_int order /* I Prediction order */
137 const opus_int32 *A_Q24, /* I Prediction coefficients [order] */
138 const opus_int order /* I Prediction order *
    [all...]
  /system/core/libutils/
VectorImpl.cpp 540 ssize_t SortedVectorImpl::_indexOrderOf(const void* item, size_t* order) const
562 if (order) *order = l;
568 size_t order;
569 ssize_t index = _indexOrderOf(item, &order);
571 index = VectorImpl::insertAt(item, order, 1);
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/sensors/
AccelerometerTestRenderer.java 71 vbb.order(ByteOrder.nativeOrder());
75 tbb.order(ByteOrder.nativeOrder());
79 ibb.order(ByteOrder.nativeOrder());
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/spritetext/
SpriteTextRenderer.java 290 // must have their byte order set to native order
293 vbb.order(ByteOrder.nativeOrder());
297 tbb.order(ByteOrder.nativeOrder());
301 ibb.order(ByteOrder.nativeOrder());
  /external/chromium_org/chrome/browser/resources/extensions/
extensions.js 260 // We can get called many times in short order, thus we need to
272 // Enforce order specified in the data or (if equal) then sort by
275 if (a.order == b.order) {
280 return a.order < b.order ? -1 : 1;
  /external/chromium_org/tools/telemetry/telemetry/core/
browser_options.py 70 'in order of priority. Supported values: list,%s' %
134 help='Shuffle the order of pages within a pageset.')
135 group.add_option('--pageset-shuffle-order-file',
138 'pageset. The tests will run in the same order again, overriding ' +
170 'test is executed at maximum CPU speed in order to minimize noise '
  /external/guava/guava-testlib/src/com/google/common/collect/testing/google/
SetGenerators.java 135 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetExplicitComparator
153 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetExplicitSuperclassComparatorGenerator
168 @Override public List<String> order(List<String> insertionOrder) { method in class:SetGenerators.ImmutableSortedSetReversedOrderGenerator
  /external/zlib/src/contrib/puff/
puff.c 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code
201 * each length, which for a canonical code are stepped through in order.
202 * symbol[] are the symbol values in canonical order, where the number of
222 * build the code value reversed from what is in the stream in order to
312 * sorted by length, retaining their original order within each length. The
337 * - Within a given code length, the symbols are kept in ascending order for
370 * put symbols in table sorted by length, by symbol order within each
592 * - The code lengths are stored in order for the symbols, so lengths are
641 * code. The code length code lengths are received in a permuted order (see
642 * the order[] array below) to make a short code length code length list mor
674 static const short order[19] = \/* permutation of code length codes *\/ local
    [all...]
  /packages/screensavers/Basic/src/com/android/dreams/basic/
ColorsGLRenderer.java 334 private short drawOrder[] = { 0, 1, 2, 0, 2, 3 }; // order to draw vertices (CCW)
336 private final float HUES[] = { // reverse order due to CCW winding
364 bb.order(ByteOrder.nativeOrder());
370 bb.order(ByteOrder.nativeOrder());
377 dlb.order(ByteOrder.nativeOrder());
  /cts/tools/dex-tools/src/dex/reader/
DexBuffer.java 64 b.order(ByteOrder.LITTLE_ENDIAN);

Completed in 1205 milliseconds

<<11121314151617181920>>