Searched refs:order (Results 1 - 25 of 860) 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/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...]
H A Dexif-utils.c87 exif_get_sshort (const unsigned char *buf, ExifByteOrder order) argument
90 switch (order) {
102 exif_get_short (const unsigned char *buf, ExifByteOrder order) argument
104 return (exif_get_sshort (buf, order) & 0xffff);
108 exif_set_sshort (unsigned char *b, ExifByteOrder order, ExifSShort value) argument
111 switch (order) {
124 exif_set_short (unsigned char *b, ExifByteOrder order, ExifShort value) argument
126 exif_set_sshort (b, order, value);
130 exif_get_slong (const unsigned char *b, ExifByteOrder order) argument
133 switch (order) {
145 exif_set_slong(unsigned char *b, ExifByteOrder order, ExifSLong value) argument
165 exif_get_long(const unsigned char *buf, ExifByteOrder order) argument
171 exif_set_long(unsigned char *b, ExifByteOrder order, ExifLong value) argument
177 exif_get_srational(const unsigned char *buf, ExifByteOrder order) argument
188 exif_get_rational(const unsigned char *buf, ExifByteOrder order) argument
199 exif_set_rational(unsigned char *buf, ExifByteOrder order, ExifRational value) argument
208 exif_set_srational(unsigned char *buf, ExifByteOrder order, ExifSRational value) argument
[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] */
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 ] */
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 ) argument
75 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 ) 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.
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, argument
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) { argument
474 order->RecordStart(QUITMESSAGELOOP, cookie);
476 order->RecordEnd(QUITMESSAGELOOP, cookie);
483 TaskList order; local
514 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument
520 OrderedFunc(TaskList* order, int cookie) argument
530 TaskList order; local
570 TaskList order; local
603 TaskList order; local
624 FuncThatPumps(TaskList* order, int cookie) argument
633 SleepFunc(TaskList* order, int cookie, TimeDelta delay) argument
645 TaskList order; local
696 FuncThatRuns(TaskList* order, int cookie, RunLoop* run_loop) argument
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/
H A Dcoleitr.h66 * 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
380 primaryOrder(int32_t order) argument
385 secondaryOrder(int32_t order) argument
390 tertiaryOrder(int32_t order) argument
395 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/tests/
H A DPathOpsDCubicTest.cpp20 char order[4]; local
21 cubic.convexHull(order);
H A DPathOpsQuadReduceOrderTest.cpp32 int order; local
51 order = reducer.reduce(quad);
52 if (order != 2) {
53 SkDebugf("[%d] line quad order=%d\n", (int) index, order);
58 order = reducer.reduce(quad);
59 if (order != 2 && order != 3) { // FIXME: data probably is not good
60 SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
[all...]
H A DPathOpsCubicReduceOrderTest.cpp64 int order; local
110 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
111 if (order != 1) {
112 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order);
119 order = reducer.reduce(cubic, SkReduceOrder::kAllow_Quadratics);
120 if (order == 1) {
121 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order);
122 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);
H A Dreal_fourier.h35 // Construct a wrapper instance for the given input order, which must be
40 // Helper to compute the smallest FFT order (a power of 2) which will contain
44 // Helper to compute the input length from the FFT order.
45 static size_t FftLength(int order);
48 // output (i.e. |2^order / 2 + 1|).
49 static size_t ComplexLength(int order);
59 // enough for |2^order / 2 + 1| elements - the conjugate pairs are not
62 // |2^order| (same as given at construction time).
69 virtual int order() const = 0;
/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 5863 milliseconds

1234567891011>>