/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
H A D | TableModel.java | 24 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 D | 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 [all...] |
H A D | warped_autocorrelation_FLP.c | 36 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/libexif/libexif/ |
H A D | 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);
|
H A D | exif-byte-order.c | 1 /* 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 D | 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...] |
H A D | exif-utils.c | 87 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 D | 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 [all...] |
H A D | 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 [all...] |
H A D | 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 ] */ 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/icu/icu4c/source/i18n/unicode/ |
H A D | 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 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 D | 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);
|
H A D | quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order) argument 75 for (i=0;i<order;i++) 81 if (i==order-1) 159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 165 for (i=0;i<order;i++) 168 compute_quant_weights(qlsp, quant_weight, order); 170 for (i=0;i<order;i++) 174 for (i=0;i<order;i++) 177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order); 180 for (i=0;i<order; 213 lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 242 lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 283 lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 306 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 310 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument 319 lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits) argument 366 lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits) argument [all...] |
/external/skia/tests/ |
H A D | PathOpsDCubicTest.cpp | 20 char order[4]; local 21 cubic.convexHull(order);
|
H A D | PathOpsQuadReduceOrderTest.cpp | 32 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 D | PathOpsCubicReduceOrderTest.cpp | 64 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/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
H A D | CorrelatedRandomVectorGenerator.java | 102 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...] |
/external/cblas/src/ |
H A D | cblas_cgeru.c | 10 void cblas_cgeru(const enum CBLAS_ORDER order, const int M, const int N, argument 30 if (order == CblasColMajor) 35 else if (order == CblasRowMajor) 41 else cblas_xerbla(1, "cblas_cgeru","Illegal Order setting, %d\n", order);
|
H A D | cblas_dger.c | 12 void cblas_dger(const enum CBLAS_ORDER order, const int M, const int N, argument 31 if (order == CblasColMajor) 36 else if (order == CblasRowMajor) 43 else cblas_xerbla(1, "cblas_dger", "Illegal Order setting, %d\n", order);
|
H A D | cblas_dspr.c | 12 void cblas_dspr(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo, argument 33 if (order == CblasColMajor) 50 } else if (order == CblasRowMajor) 66 } else cblas_xerbla(1, "cblas_dspr", "Illegal Order setting, %d\n", order);
|
H A D | cblas_sger.c | 12 void cblas_sger(const enum CBLAS_ORDER order, const int M, const int N, argument 31 if (order == CblasColMajor) 36 else if (order == CblasRowMajor) 42 else cblas_xerbla(1, "cblas_sger", "Illegal Order setting, %d\n", order);
|
H A D | cblas_sspr.c | 12 void cblas_sspr(const enum CBLAS_ORDER order, const enum CBLAS_UPLO Uplo, argument 35 if (order == CblasColMajor) 52 } else if (order == CblasRowMajor) 68 } else cblas_xerbla(1, "cblas_sspr", "Illegal Order setting, %d\n", order);
|
H A D | cblas_zgeru.c | 10 void cblas_zgeru(const enum CBLAS_ORDER order, const int M, const int N, argument 29 if (order == CblasColMajor) 34 else if (order == CblasRowMajor) 40 else cblas_xerbla(1, "cblas_zgeru", "Illegal Order setting, %d\n", order);
|
/external/clang/test/PCH/ |
H A D | field-designator.c | 26 # error Header inclusion order messed up
|
/external/libopus/silk/ |
H A D | NLSF_unpack.c | 46 ec_sel_ptr = &psNLSF_CB->ec_sel[ CB1_index * psNLSF_CB->order / 2 ]; 47 for( i = 0; i < psNLSF_CB->order; i += 2 ) { 50 pred_Q8[ i ] = psNLSF_CB->pred_Q8[ i + ( entry & 1 ) * ( psNLSF_CB->order - 1 ) ]; 52 pred_Q8[ i + 1 ] = psNLSF_CB->pred_Q8[ i + ( silk_RSHIFT( entry, 4 ) & 1 ) * ( psNLSF_CB->order - 1 ) + 1 ];
|