Searched refs:order (Results 1 - 25 of 1031) sorted by relevance

1234567891011>>

/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DTableModel.java24 private TableOrder order; field in class:TableModel
26 protected TableModel(TableOrder order) { argument
27 setOrder(order);
35 return order;
38 public void setOrder(TableOrder order) { argument
39 this.order = order;
/external/libopus/silk/arm/
H A DLPC_inv_pred_gain_arm.h35 const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */
36 const opus_int order /* I Prediction order */
41 # define silk_LPC_inverse_pred_gain(A_Q12, order, arch) ((void)(arch), PRESUME_NEON(silk_LPC_inverse_pred_gain)(A_Q12, order))
48 extern opus_int32 (*const SILK_LPC_INVERSE_PRED_GAIN_IMPL[OPUS_ARCHMASK+1])(const opus_int16 *A_Q12, const opus_int order);
50 # define silk_LPC_inverse_pred_gain(A_Q12, order, arch) ((*SILK_LPC_INVERSE_PRED_GAIN_IMPL[(arch)&OPUS_ARCHMASK])(A_Q12, order))
53 # define silk_LPC_inverse_pred_gain(A_Q12, order, arch) ((void)(arch), silk_LPC_inverse_pred_gain_neon(A_Q12, order))
[all...]
H A DNSQ_neon.h35 static OPUS_INLINE void silk_short_prediction_create_arch_coef_neon(opus_int32 *out, const opus_int16 *in, opus_int order) argument
48 if (order == 16)
70 #define silk_short_prediction_create_arch_coef(out, in, order) \
71 (silk_short_prediction_create_arch_coef_neon(out, in, order))
75 #define silk_short_prediction_create_arch_coef(out, in, order) \
76 do { if (arch == OPUS_ARCH_ARM_NEON) { silk_short_prediction_create_arch_coef_neon(out, in, order); } } while (0)
80 opus_int32 silk_noise_shape_quantizer_short_prediction_neon(const opus_int32 *buf32, const opus_int32 *coef32, opus_int order);
82 opus_int32 silk_NSQ_noise_shape_feedback_loop_neon(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order);
86 #define silk_noise_shape_quantizer_short_prediction(in, coef, coefRev, order, arch) \
87 ((void)arch,silk_noise_shape_quantizer_short_prediction_neon(in, coefRev, order))
[all...]
/external/python/cpython2/Lib/lib2to3/tests/data/fixers/
H A Dbad_order.py5 order = "crazy" variable in class:FixBadOrder
/external/python/cpython3/Lib/lib2to3/tests/data/fixers/
H A Dbad_order.py5 order = "crazy" variable in class:FixBadOrder
/external/compiler-rt/lib/builtins/
H A Datomic_flag_clear_explicit.c24 memory_order order) {
25 __c11_atomic_store(&(object)->_Value, 0, order);
23 atomic_flag_clear_explicit(volatile atomic_flag *object, memory_order order) argument
H A Datomic_flag_test_and_set_explicit.c24 memory_order order) {
25 return __c11_atomic_exchange(&(object)->_Value, 1, order);
23 atomic_flag_test_and_set_explicit(volatile atomic_flag *object, memory_order order) argument
H A Datomic_signal_fence.c23 void atomic_signal_fence(memory_order order) { argument
24 __c11_atomic_signal_fence(order);
H A Datomic_thread_fence.c23 void atomic_thread_fence(memory_order order) { argument
24 __c11_atomic_thread_fence(order);
/external/libexif/libexif/
H A Dexif-byte-order.h1 /*! \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);
H A Dexif-byte-order.c1 /* exif-byte-order.c
23 #include <libexif/exif-byte-order.h>
29 exif_byte_order_get_name (ExifByteOrder order) argument
31 switch (order) {
H A Dexif-utils.h30 #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...]
/external/python/cpython2/Lib/lib2to3/tests/data/fixers/myfixes/
H A Dfix_preorder.py4 order = "pre" variable in class:FixPreorder
/external/python/cpython3/Lib/lib2to3/tests/data/fixers/myfixes/
H A Dfix_preorder.py4 order = "pre" variable in class:FixPreorder
/external/tensorflow/tensorflow/compiler/xla/service/gpu/
H A Dhlo_schedule_test.cc58 // execution order.
86 auto order = schedule->ConsumeHloOrdering(); local
87 EXPECT_TRUE(order->ExecutesBefore(x, dot1));
88 EXPECT_TRUE(order->ExecutesBefore(x, dot2));
89 EXPECT_TRUE(order->ExecutesBefore(y, dot1));
90 EXPECT_TRUE(order->ExecutesBefore(y, dot2));
91 EXPECT_TRUE(order->ExecutesBefore(z, dot2));
92 EXPECT_TRUE(order->ExecutesBefore(dot1, dot2));
94 EXPECT_FALSE(order->ExecutesBefore(x, x));
95 EXPECT_FALSE(order
148 auto order = schedule->ConsumeHloOrdering(); local
217 auto order = schedule->ConsumeHloOrdering(); local
303 auto order = schedule->ConsumeHloOrdering(); local
[all...]
/external/libopus/silk/tests/
H A Dtest_unit_LPC_inv_pred_gain.c42 int check_stability(opus_int16 *A_Q12, int order) { argument
47 for( j = 0; j < order; j++ ) {
64 for( j = 0; j < order; j++ ) {
67 for( j = order - 1; j > 0; j-- ) {
79 for( j = 0; j < order; j++ ) {
104 opus_int order; local
109 for( order = 2; order <= SILK_MAX_ORDER_LPC; order += 2 ) { /* order mus
[all...]
/external/libchrome/base/message_loop/
H A Dmessage_loop_test.cc150 // Test that two tasks with different delays run in the right order.
173 // Test that two tasks with the same delay run in the order in which they
514 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
516 order->RecordStart(RECURSIVE, cookie);
522 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant));
524 order->RecordEnd(RECURSIVE, cookie);
527 void QuitFunc(TaskList* order, int cookie) { argument
528 order->RecordStart(QUITMESSAGELOOP, cookie);
530 order->RecordEnd(QUITMESSAGELOOP, cookie);
537 TaskList order; local
565 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument
571 OrderedFunc(TaskList* order, int cookie) argument
581 TaskList order; local
617 TaskList order; local
650 TaskList order; local
670 FuncThatPumps(TaskList* order, int cookie) argument
679 SleepFunc(TaskList* order, int cookie, TimeDelta delay) argument
690 TaskList order; local
723 FuncThatRuns(TaskList* order, int cookie, RunLoop* run_loop) argument
740 TaskList order; local
773 TaskList order; local
803 TaskList order; local
833 TaskList order; local
866 TaskList order; local
935 TaskList order; local
956 TaskList order; local
982 TaskList order; local
[all...]
/external/icu/icu4c/source/i18n/unicode/
H A Dcoleitr.h69 * The key of a character, is an integer composed of primary order(short),
70 * secondary order(char), and tertiary order(char). Java strictly defines the
85 * int32_t order = c->next(success);
87 * order = c->previous(success);
94 * The method next() returns the collation order of the next character based on
96 * collation order of the previous character based on the comparison level of
103 * Hence at the next call of next() or previous(), the first or last collation order,
104 * or collation order at the spefcifieid position will be returned. If a change of
110 * Character based on the comparison level of the collator. A collation order
383 primaryOrder(int32_t order) argument
388 secondaryOrder(int32_t order) argument
393 tertiaryOrder(int32_t order) argument
398 isIgnorable(int32_t order) argument
[all...]
/external/libopus/silk/fixed/
H A DcorrMatrix_FIX.c40 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] */
53 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */
58 for( lag = 0; lag < order; lag++ ) {
68 for( lag = 0; lag < order; lag++ ) {
77 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */
79 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, int arch ) argument
76 silk_corrMatrix_FIX( const opus_int16 *x, const opus_int L, const opus_int order, opus_int32 *XX, opus_int32 *nrg, opus_int *rshifts, int arch ) argument
[all...]
H A Dschur_FIX.c37 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 >= 0 && order <= SILK_MAX_ORDER_LPC );
57 } while( ++k <= order );
63 } while( ++k <= order );
68 } while( ++k <= order );
71 for( k = 0; k < order;
[all...]
H A Dschur64_FIX.c37 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 >= 0 && order <= SILK_MAX_ORDER_LPC );
50 silk_memset( rc_Q16, 0, order * sizeof( opus_int32 ) );
57 } while( ++k <= order );
59 for( k = 0; k < order; k++ ) {
78 for( n = 0; n < order
[all...]
/external/libopus/silk/float/
H A Dschur_FLP.c35 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 >= 0 && order <= SILK_MAX_ORDER_LPC );
50 } while( ++k <= order );
52 for( k = 0; k < order; k++ ) {
60 for( n = 0; n < order - k; n++ ) {
H A Dwarped_autocorrelation_FLP.c36 silk_float *corr, /* O Result [order + 1] */
40 const opus_int order /* I Correlation order (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/speex/libspeex/
H A Dquant_lsp.h57 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/
H A Dreal_fft.c18 int order; member in struct:RealFFT
21 struct RealFFT* WebRtcSpl_CreateRealFFT(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,
[all...]

Completed in 929 milliseconds

1234567891011>>