Searched refs:order (Results 1 - 25 of 874) 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/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==6||order==8||order==10||order==12||order==14||order
[all...]
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/libopus/silk/arm/
H A DNSQ_neon.h34 static OPUS_INLINE void silk_short_prediction_create_arch_coef_neon(opus_int32 *out, const opus_int16 *in, opus_int order) argument
47 if (order == 16)
69 #define silk_short_prediction_create_arch_coef(out, in, order) \
70 (silk_short_prediction_create_arch_coef_neon(out, in, order))
74 #define silk_short_prediction_create_arch_coef(out, in, order) \
75 do { if (arch == OPUS_ARCH_ARM_NEON) { silk_short_prediction_create_arch_coef_neon(out, in, order); } } while (0)
79 opus_int32 silk_noise_shape_quantizer_short_prediction_neon(const opus_int32 *buf32, const opus_int32 *coef32, opus_int order);
81 opus_int32 silk_NSQ_noise_shape_feedback_loop_neon(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order);
85 #define silk_noise_shape_quantizer_short_prediction(in, coef, coefRev, order, arch) \
86 ((void)arch,silk_noise_shape_quantizer_short_prediction_neon(in, coefRev, order))
[all...]
/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/libopus/silk/fixed/
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==6||order==8||order==10||order==12||order==14||order
[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==6||order==8||order==10||order==12||order==14||order
[all...]
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 */
81 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, const opus_int head_room, opus_int32 *XX, opus_int *rshifts, int arch ) argument
[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
515 void RecursiveFunc(TaskList* order, int cookie, int depth, argument
517 order->RecordStart(RECURSIVE, cookie);
523 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant));
525 order->RecordEnd(RECURSIVE, cookie);
528 void QuitFunc(TaskList* order, int cookie) { argument
529 order->RecordStart(QUITMESSAGELOOP, cookie);
531 order->RecordEnd(QUITMESSAGELOOP, cookie);
538 TaskList order; local
566 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument
572 OrderedFunc(TaskList* order, int cookie) argument
582 TaskList order; local
618 TaskList order; local
651 TaskList order; local
673 FuncThatPumps(TaskList* order, int cookie) argument
682 SleepFunc(TaskList* order, int cookie, TimeDelta delay) argument
693 TaskList order; local
732 FuncThatRuns(TaskList* order, int cookie, RunLoop* run_loop) argument
749 TaskList order; local
784 TaskList order; local
814 TaskList order; local
844 TaskList order; local
877 TaskList order; local
946 TaskList order; local
967 TaskList order; local
994 TaskList order; local
[all...]
/external/icu/icu4c/source/i18n/unicode/
H A Dcoleitr.h68 * The key of a character, is an integer composed of primary order(short),
69 * secondary order(char), and tertiary order(char). Java strictly defines the
84 * int32_t order = c->next(success);
86 * order = c->previous(success);
93 * The method next() returns the collation order of the next character based on
95 * collation order of the previous character based on the comparison level of
102 * Hence at the next call of next() or previous(), the first or last collation order,
103 * or collation order at the spefcifieid position will be returned. If a change of
109 * Character based on the comparison level of the collator. A collation order
382 primaryOrder(int32_t order) argument
387 secondaryOrder(int32_t order) argument
392 tertiaryOrder(int32_t order) argument
397 isIgnorable(int32_t order) argument
[all...]
/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...]
/external/skia/src/core/
H A DSkFontLCDConfig.cpp25 void SkFontLCDConfig::SetSubpixelOrder(LCDOrder order) { argument
26 gLCDOrder = order;
/external/skia/tests/
H A DPathOpsDCubicTest.cpp22 char order[4]; local
23 cubic.convexHull(order);
H A DPathOpsQuadReduceOrderTest.cpp34 int order; local
55 order = reducer.reduce(quad);
56 if (order != 2) {
57 SkDebugf("[%d] line quad order=%d\n", (int) index, order);
64 order = reducer.reduce(quad);
65 if (order != 2 && order != 3) { // FIXME: data probably is not good
66 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
[all...]
/external/libopus/silk/
H A DNSQ.h35 static OPUS_INLINE opus_int32 silk_noise_shape_quantizer_short_prediction_c(const opus_int32 *buf32, const opus_int16 *coef16, opus_int order) argument
38 silk_assert( order == 10 || order == 16 );
41 out = silk_RSHIFT( order, 1 );
53 if( order == 16 )
65 #define silk_noise_shape_quantizer_short_prediction(in, coef, coefRev, order, arch) ((void)arch,silk_noise_shape_quantizer_short_prediction_c(in, coef, order))
67 static OPUS_INLINE opus_int32 silk_NSQ_noise_shape_feedback_loop_c(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order) argument
77 out = silk_RSHIFT(order, 1);
80 for (j = 2; j < order;
[all...]
/external/webrtc/webrtc/common_audio/
H A Dreal_fourier.cc37 size_t RealFourier::FftLength(int order) { argument
38 RTC_CHECK_GE(order, 0);
39 return static_cast<size_t>(1 << order);
42 size_t RealFourier::ComplexLength(int order) { argument
43 return FftLength(order) / 2 + 1;
H A Dreal_fourier_openmax.cc25 OMXFFTSpec_R_F32* CreateOpenmaxState(int order) { argument
26 RTC_CHECK_GE(order, 1);
27 // The omx implementation uses this macro to check order validity.
28 RTC_CHECK_LE(order, TWIDDLE_TABLE_ORDER);
31 OMXResult r = omxSP_FFTGetBufSize_R_F32(order, &buffer_size);
37 r = omxSP_FFTInit_R_F32(omx_spec, order);
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/
H A DCorrelatedRandomVectorGenerator.java102 int order = covariance.getRowDimension();
103 if (mean.length != order) {
104 throw new DimensionMismatchException(mean.length, order);
130 int order = covariance.getRowDimension();
131 mean = new double[order];
132 for (int i = 0; i < order; ++i) {
191 int order = covariance.getRowDimension();
193 double[][] b = new double[order][order];
195 int[] swap = new int[order];
[all...]

Completed in 648 milliseconds

1234567891011>>