| /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/arm/ |
| LPC_inv_pred_gain_arm.h | 35 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...] |
| NSQ_neon.h | 35 static OPUS_INLINE void silk_short_prediction_create_arch_coef_neon(opus_int32 *out, const opus_int16 *in, opus_int order)
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...] |
| /art/test/712-varhandle-invocations/src/ |
| VarHandleUnitTestHelpers.java | 56 public static boolean getBytesAs_boolean(byte[] array, int index, ByteOrder order) {
57 return getBytesAs_boolean(ByteBuffer.wrap(array), index, order);
60 public static byte getBytesAs_byte(byte[] array, int index, ByteOrder order) {
61 return getBytesAs_byte(ByteBuffer.wrap(array), index, order);
64 public static char getBytesAs_char(byte[] array, int index, ByteOrder order) {
65 return getBytesAs_char(ByteBuffer.wrap(array), index, order);
68 public static short getBytesAs_short(byte[] array, int index, ByteOrder order) {
69 return getBytesAs_short(ByteBuffer.wrap(array), index, order);
72 public static int getBytesAs_int(byte[] array, int index, ByteOrder order) {
73 return getBytesAs_int(ByteBuffer.wrap(array), index, order);
121 setBytesAs_boolean(ByteBuffer.wrap(array), index, value, order); local
125 setBytesAs_byte(ByteBuffer.wrap(array), index, value, order); local
129 setBytesAs_char(ByteBuffer.wrap(array), index, value, order); local
133 setBytesAs_short(ByteBuffer.wrap(array), index, value, order); local
137 setBytesAs_int(ByteBuffer.wrap(array), index, value, order); local
141 setBytesAs_long(ByteBuffer.wrap(array), index, value, order); local
145 setBytesAs_float(ByteBuffer.wrap(array), index, value, order); local
149 setBytesAs_double(ByteBuffer.wrap(array), index, value, order); local
272 ByteOrder order = ByteOrder.LITTLE_ENDIAN; external variable declarations
[all...] |
| /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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/tests/data/fixers/ |
| bad_order.py | 5 order = "crazy"
variable in class:FixBadOrder
|
| /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...] |
| /external/python/cpython2/Lib/lib2to3/tests/data/fixers/ |
| bad_order.py | 5 order = "crazy" variable in class:FixBadOrder
|
| /external/python/cpython3/Lib/lib2to3/tests/data/fixers/ |
| bad_order.py | 5 order = "crazy" variable in class:FixBadOrder
|
| /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/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| hlo_schedule_test.cc | 58 // 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->ExecutesBefore(x, y))
148 auto order = schedule->ConsumeHloOrdering(); local
217 auto order = schedule->ConsumeHloOrdering(); local
303 auto order = schedule->ConsumeHloOrdering(); local
[all...] |
| /external/libopus/silk/tests/ |
| test_unit_LPC_inv_pred_gain.c | 42 int check_stability(opus_int16 *A_Q12, int order) {
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 must be even. *
[all...] |
| /external/libchrome/base/message_loop/ |
| message_loop_test.cc | 150 // 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,
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) {
528 order->RecordStart(QUITMESSAGELOOP, cookie);
530 order->RecordEnd(QUITMESSAGELOOP, cookie);
537 TaskList order; local
581 TaskList order; local
617 TaskList order; local
650 TaskList order; local
690 TaskList order; local
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/ |
| coleitr.h | 69 * 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
[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/libopus/silk/fixed/ |
| 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] */
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 ] */
[all...] |
| /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 >= 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++ ) {
|
| 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++ ) {
|
