HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 1 - 25 of 1824) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
TableModel.java 24 private TableOrder order; field in class:TableModel
26 protected TableModel(TableOrder order) {
27 setOrder(order);
35 return order;
38 public void setOrder(TableOrder order) {
39 this.order = order;
  /external/libopus/silk/float/
schur_FLP.c 35 silk_float refl_coef[], /* O reflection coefficients (length order) */
36 const silk_float auto_corr[], /* I autocorrelation sequence (length order+1) */
37 opus_int order /* I order */
44 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
    [all...]
warped_autocorrelation_FLP.c 36 silk_float *corr, /* O Result [order + 1] */
40 const opus_int order /* I Correlation order (even) */
48 /* Order must be even */
49 silk_assert( ( order & 1 ) == 0 );
55 for( i = 0; i < order; i += 2 ) {
65 state[ order ] = tmp1;
66 C[ order ] += state[ 0 ] * tmp1;
70 for( i = 0; i < order + 1; i++ ) {
  /external/compiler-rt/lib/builtins/
atomic_flag_clear_explicit.c 24 memory_order order) {
25 __c11_atomic_store(&(object)->_Value, 0, order);
atomic_flag_test_and_set_explicit.c 24 memory_order order) {
25 return __c11_atomic_exchange(&(object)->_Value, 1, order);
atomic_signal_fence.c 23 void atomic_signal_fence(memory_order order) {
24 __c11_atomic_signal_fence(order);
atomic_thread_fence.c 23 void atomic_thread_fence(memory_order order) {
24 __c11_atomic_thread_fence(order);
  /libcore/ojluni/src/main/java/java/text/
CollationElementIterator.java 64 * The key of a character is an integer composed of primary order(short),
65 * secondary order(byte), and tertiary order(byte). Java strictly defines
89 * <code>CollationElementIterator.next</code> returns the collation order
90 * of the next character. A collation order consists of primary order,
91 * secondary order and tertiary order. The data type of the collation
92 * order is <strong>int</strong>. The first 16 bits of a collation order
    [all...]
  /external/libexif/libexif/
exif-byte-order.h 1 /*! \file exif-byte-order.h
30 /*! Which byte order to use */
32 /*! Big-endian byte order */
34 /*! Little-endian byte order */
38 /*! Return a short, localized, textual name for the given byte order.
39 * \param[in] order byte order
40 * \return localized textual name of the byte order
42 const char *exif_byte_order_get_name (ExifByteOrder order);
exif-byte-order.c 1 /* exif-byte-order.c
23 #include <libexif/exif-byte-order.h>
29 exif_byte_order_get_name (ExifByteOrder order)
31 switch (order) {
exif-utils.h 30 #include <libexif/exif-byte-order.h>
71 * \param[in] order byte order of raw value
74 ExifShort exif_get_short (const unsigned char *b, ExifByteOrder order);
79 * \param[in] order byte order of raw value
82 ExifSShort exif_get_sshort (const unsigned char *b, ExifByteOrder order);
87 * \param[in] order byte order of raw value
90 ExifLong exif_get_long (const unsigned char *b, ExifByteOrder order);
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/
bad_order.py 5 order = "crazy" variable in class:FixBadOrder
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/
bad_order.py 5 order = "crazy" variable in class:FixBadOrder
  /external/libopus/silk/fixed/
schur64_FIX.c 37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
38 const opus_int32 c[], /* I Correlations [order+1] */
39 opus_int32 order /* I Prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
    [all...]
schur_FIX.c 37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
38 const opus_int32 *c, /* I correlations [order+1] */
39 const opus_int32 order /* I prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
    [all...]
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 ] */
    [all...]
  /external/libchrome/base/message_loop/
message_loop_test.cc 150 // Test that two tasks with different delays run in the right order.
175 // Test that two tasks with the same delay run in the order in which they
460 void RecursiveFunc(TaskList* order, int cookie, int depth,
462 order->RecordStart(RECURSIVE, cookie);
468 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant));
470 order->RecordEnd(RECURSIVE, cookie);
473 void QuitFunc(TaskList* order, int cookie) {
474 order->RecordStart(QUITMESSAGELOOP, cookie);
476 order->RecordEnd(QUITMESSAGELOOP, cookie);
483 TaskList order; local
530 TaskList order; local
570 TaskList order; local
603 TaskList order; local
645 TaskList order; local
713 TaskList order; local
748 TaskList order; local
778 TaskList order; local
808 TaskList order; local
841 TaskList order; local
910 TaskList order; local
931 TaskList order; local
958 TaskList order; local
    [all...]
  /external/icu/icu4c/source/i18n/unicode/
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
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/
CollationElementIteratorTest.java 63 int order = iterator.next(); local
65 while (order != CollationElementIterator.NULLORDER) {
66 orders[i++] = order;
67 order = iterator.next();
74 order = iterator.previous();
76 while (order != CollationElementIterator.NULLORDER) {
77 assertEquals(orders[--i], order);
78 order = iterator.previous();
90 int order = iterator.next(); local
92 while (order != CollationElementIterator.NULLORDER)
115 int order = iterator.next(); local
134 int order = iterator.next(); local
145 int order = iterator.next(); local
157 int order = iterator.next(); local
170 int order = iterator.next(); local
    [all...]
  /external/speex/libspeex/
quant_lsp.h 57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);
  /external/webrtc/webrtc/common_audio/signal_processing/
real_fft.c 18 int order; member in struct:RealFFT
21 struct RealFFT* WebRtcSpl_CreateRealFFT(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...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/
fix_preorder.py 4 order = "pre" variable in class:FixPreorder
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/
fix_preorder.py 4 order = "pre" variable in class:FixPreorder
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mt/
badorder.s 1 ; Good operands in the wrong order should generate an error.
  /external/skia/tests/
PathOpsDCubicTest.cpp 20 char order[4]; local
21 cubic.convexHull(order);

Completed in 394 milliseconds

1 2 3 4 5 6 7 8 91011>>