HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 226 - 250 of 1516) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/ltp/testcases/kernel/device-drivers/nls/
Makefile 21 rm -f modules.order
  /external/ltp/testcases/kernel/device-drivers/usb/tusb/
Makefile 21 rm -f modules.order
  /external/ltp/testcases/kernel/device-drivers/v4l/kernel_space/
Makefile 16 rm -f modules.order
  /external/mesa3d/src/mesa/math/
m_eval.h 61 GLuint dim, GLuint order);
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
UUIDConverter.java 45 b.order(ByteOrder.BIG_ENDIAN);
  /external/perfetto/test/trace_processor/
android_log_msgs.sql 1 create view v1 as select tag, count(*) from android_logs group by tag order by 2 desc limit 5
3 create view v2 as select tag, count(*) from android_logs group by tag order by 2 asc limit 5;
  /external/python/cpython3/Lib/lib2to3/fixes/
fix_intern.py 15 order = "pre" variable in class:FixIntern
fix_reload.py 12 order = "pre" variable in class:FixReload
  /external/swiftshader/third_party/SPIRV-Tools/test/val/
val_layout_test.cpp 42 // returns true if order is equal to VAL
44 spv_result_t Equals(int order) {
45 return order == VAL ? SPV_SUCCESS : RET;
48 // returns true if order is between MIN and MAX(inclusive)
52 spv_result_t operator()(int order) {
53 return (inverse_ ^ (order >= MIN && order <= MAX)) ? SPV_SUCCESS : RET;
61 spv_result_t InvalidSet(int order) {
62 for (spv_result_t val : {T(true)(order)...})
167 // instructions vector and reinserts it in the location specified by order
187 int order; local
    [all...]
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/
lpc_analysis.h 24 double WebRtcIsac_LevDurb(double *a, double *k, double *r, size_t order);
  /external/cblas/testing/
c_dblas2.c 11 void F77_dgemv(int *order, char *transp, int *m, int *n, double *alpha,
20 if (*order == TEST_ROW_MJR) {
30 else if (*order == TEST_COL_MJR)
38 void F77_dger(int *order, int *m, int *n, double *alpha, double *x, int *incx,
44 if (*order == TEST_ROW_MJR) {
63 void F77_dtrmv(int *order, char *uplow, char *transp, char *diagn,
75 if (*order == TEST_ROW_MJR) {
84 else if (*order == TEST_COL_MJR)
91 void F77_dtrsv(int *order, char *uplow, char *transp, char *diagn,
103 if (*order == TEST_ROW_MJR)
    [all...]
c_sblas2.c 11 void F77_sgemv(int *order, char *transp, int *m, int *n, float *alpha,
20 if (*order == TEST_ROW_MJR) {
30 else if (*order == TEST_COL_MJR)
38 void F77_sger(int *order, int *m, int *n, float *alpha, float *x, int *incx,
44 if (*order == TEST_ROW_MJR) {
63 void F77_strmv(int *order, char *uplow, char *transp, char *diagn,
75 if (*order == TEST_ROW_MJR) {
84 else if (*order == TEST_COL_MJR)
91 void F77_strsv(int *order, char *uplow, char *transp, char *diagn,
103 if (*order == TEST_ROW_MJR)
    [all...]
  /external/libopus/silk/float/
noise_shape_analysis_FLP.c 42 opus_int order
48 gain = coefs[ order - 1 ];
49 for( i = order - 2; i >= 0; i-- ) {
61 opus_int order
67 for( i = order - 1; i > 0; i-- ) {
71 for( i = 0; i < order; i++ ) {
79 for( i = 0; i < order; i++ ) {
92 for( i = 1; i < order; i++ ) {
96 for( i = 0; i < order; i++ ) {
102 silk_bwexpander_FLP( coefs, order, chirp )
    [all...]
  /external/cldr/tools/java/org/unicode/cldr/util/
DiscreteComparator.java 23 * DiscreteComparator<String> comp = new Builder<String>(order).add("c", "d", "b", "a").add("m", "n", "d").get();
33 * The builder can take three different orders: input order, natural order
60 * @return integer representing the order
115 private Ordering order; field in class:DiscreteComparator.Builder
118 * Pass the order you want for the results.
120 * @param order
122 public Builder(Ordering order) {
123 this.order = order;
    [all...]
  /cts/tests/tests/keystore/src/android/keystore/cts/
ECCurves.java 107 BigInteger order,
120 order,
  /development/samples/OpenGL/HelloOpenGLES10/src/com/example/android/opengl/
Square.java 41 private final short drawOrder[] = { 0, 1, 2, 0, 2, 3 }; // order to draw vertices
53 bb.order(ByteOrder.nativeOrder());
62 dlb.order(ByteOrder.nativeOrder());
  /external/flac/libFLAC/include/private/
fixed.h 48 * of the residual signal for each order. The _wide() version uses
85 * IN data[-order,data_len-1] original signal (NOTE THE INDICES!)
87 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
90 void FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]);
100 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
102 * IN data[-order,-1] previously-reconstructed historical samples
105 void FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
ReserializingTestCollectionGenerator.java 80 public Iterable<E> order(List<E> insertionOrder) { method in class:ReserializingTestCollectionGenerator
81 return delegate.order(insertionOrder);
  /external/guava/guava-tests/test/com/google/common/collect/
MultisetsCollectionTest.java 107 @Override public List<String> order(List<String> insertionOrder) { method in class:MultisetsCollectionTest
108 List<String> order = new ArrayList<String>(); local
110 int index = order.indexOf(s);
112 order.add(s);
114 order.add(index, s);
117 return order;
128 @Override public List<String> order(List<String> insertionOrder) {
243 public List<String> order(List<String> insertionOrder) {
  /external/libopus/silk/fixed/mips/
prefilter_FIX_mipsr1.h 40 opus_int32 state[], /* I/O State [order + 1] */
42 const opus_int16 coef_Q13[], /* I Coefficients [order] */
46 const opus_int order, /* I Filter order (even) */
56 /* Order must be even */
59 silk_assert( ( order & 1 ) == 0 );
69 acc_Q11 = silk_RSHIFT( order, 1 );
79 acc_Q22 = silk_RSHIFT( order, 1 );
83 for( i = 2; i < order; i += 2 ) {
103 acc_Q11 = silk_SMLAWB( acc_Q11, tmp1, coef_Q13[ order - 1 ] )
    [all...]
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_mm.c 15 * HACK: Max order == 21 to accommodate TF2's 1.5 MiB, frequently reallocated
46 int order; member in struct:mm_slab
93 mm_bucket_by_order(struct nouveau_mman *cache, int order)
95 if (order > MM_MAX_ORDER)
97 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
148 slab->order = chunk_order;
196 *offset = mm_slab_alloc(slab) << slab->order;
220 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order);
222 mm_slab_free(slab, alloc->offset >> slab->order);
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
AccelTable.h 122 return order() < Other.order();
132 virtual uint64_t order() const = 0;
270 uint64_t order() const override { return Die.getOffset(); }
294 uint64_t order() const override { return DieOffset; }
343 uint64_t order() const override { return Die.getOffset(); }
392 uint64_t order() const override { return Offset; }
425 uint64_t order() const override { return Offset; }
  /external/tensorflow/tensorflow/python/keras/utils/
np_utils.py 56 def normalize(x, axis=-1, order=2):
62 order: Normalization order (e.g. 2 for L2 norm).
67 l2 = np.atleast_1d(np.linalg.norm(x, order, axis))
  /external/wpa_supplicant_8/
Android.mk 4 # The order of the 2 Android.mks does matter!
  /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
DynamicTableModel.java 30 * of each subsequent cell, based on the order of the plot. Tables with
31 * an order of COLUMN_MAJOR are traversed left to right column by column until
33 * Tables with an order of ROW_MAJOR are traversed top to bottom row by row
54 * Convenience method. Sets order to ROW_MAJOR.
63 public DynamicTableModel(int numColumns, int numRows, TableOrder order) {
64 super(order);
71 //this.order = order;
74 /*public DynamicTableModel(Number colVal, CellSizingMethod colSzMethod, Number rowVal, CellSizingMethod rowSzMethod, TableOrder order) {
191 private TableOrder order; field in class:DynamicTableModel.TableModelIterator
    [all...]

Completed in 1061 milliseconds

1 2 3 4 5 6 7 8 91011>>