| /libcore/luni/src/main/java/java/nio/ |
| ByteBufferAsShortBuffer.java | 39 slice.order(byteBuffer.order());
56 buf.byteBuffer.order = byteBuffer.order;
77 ByteBuffer bb = byteBuffer.duplicate().order(byteBuffer.order());
123 public ByteOrder order() { method in class:ByteBufferAsShortBuffer
124 return byteBuffer.order();
172 ByteBuffer bb = byteBuffer.slice().order(byteBuffer.order());
[all...] |
| DirectByteBuffer.java | 115 this.block.peekCharArray(offset + position, dst, dstOffset, charCount, order.needsSwap);
121 this.block.peekDoubleArray(offset + position, dst, dstOffset, doubleCount, order.needsSwap);
127 this.block.peekFloatArray(offset + position, dst, dstOffset, floatCount, order.needsSwap);
133 this.block.peekIntArray(offset + position, dst, dstOffset, intCount, order.needsSwap);
139 this.block.peekLongArray(offset + position, dst, dstOffset, longCount, order.needsSwap);
145 this.block.peekShortArray(offset + position, dst, dstOffset, shortCount, order.needsSwap);
166 char result = (char) this.block.peekShort(offset + position, order);
173 return (char) this.block.peekShort(offset + index, order);
181 double result = Double.longBitsToDouble(this.block.peekLong(offset + position, order));
188 return Double.longBitsToDouble(this.block.peekLong(offset + index, order));
[all...] |
| /external/openfst/src/include/fst/ |
| topsort.h | 43 // If acyclic, ORDER[i] gives the topological position of state Id i;
46 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
47 : order_(order), acyclic_(acyclic) {}
78 vector<StateId> *finish_; // states in finishing-time order
94 vector<StateId> order; local
97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
101 StateSort(fst, order);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| topsort.h | 38 // If acyclic, ORDER[i] gives the topological position of state Id i;
41 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
42 : order_(order), acyclic_(acyclic) {}
73 vector<StateId> *finish_; // states in finishing-time order
89 vector<StateId> order; local
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
96 StateSort(fst, order);
|
| /external/chromium_org/third_party/opus/src/silk/ |
| NLSF_encode.c | 67 silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
70 silk_NLSF_VQ( err_Q26, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->nVectors, psNLSF_CB->order );
80 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ];
81 for( i = 0; i < psNLSF_CB->order; i++ ) {
87 silk_NLSF_VQ_weights_laroia( W_tmp_QW, NLSF_tmp_Q15, psNLSF_CB->order );
90 for( i = 0; i < psNLSF_CB->order; i++ ) {
96 for( i = 0; i < psNLSF_CB->order; i++ ) {
105 psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order );
122 silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) );
|
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| eval.c | 40 __glFillMap1f(GLint k, GLint order, GLint stride,
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride,
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
|
| /external/mesa3d/src/glx/ |
| eval.c | 40 __glFillMap1f(GLint k, GLint order, GLint stride,
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride,
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
|
| /frameworks/base/libs/hwui/utils/ |
| SortedListImpl.cpp | 50 ssize_t SortedListImpl::_indexOrderOf(const void* item, size_t* order) const {
71 if (order) {
72 *order = l;
78 size_t order; local
79 ssize_t index = _indexOrderOf(item, &order);
80 index = VectorImpl::insertAt(item, order, 1);
|
| /external/aac/libAACdec/src/ |
| aacdec_tns.cpp | 133 UCHAR n_filt,order; local
176 filter->Order = order = (UCHAR) FDKreadBits(bs, isLongFlag ? 5 : 3);
179 if (filter->Order > TNS_MAXIMUM_ORDER){
180 filter->Order = order = TNS_MAXIMUM_ORDER;
183 if (order)
200 for (i=0; i < order; i++)
216 static void CTns_Filter (FIXP_DBL *spec, int size, int inc, FIXP_TCC coeff [], int order)
218 // - Simple all-pole filter of order "order" defined b
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/spec/ |
| ECParameterSpec_ImplTest.java | 66 * <code>curve</code>, <code>generator</code> or <code>order</code> is <code>null</code><br>
77 BigInteger order = BigInteger.valueOf(5L); local
81 new ECParameterSpec(null, generator, order, 10);
89 new ECParameterSpec(curve, null, order, 10);
95 // Test case 3: order is null
114 * <code>order</code> or <code>cofactor</code> is not positive<br>
127 // Test case 1: order is negative
135 // Test case 2: order == 0
159 // Test case 5: both order and cofactor are not positive
182 BigInteger order = BigInteger.valueOf(5L) local
205 BigInteger order = BigInteger.valueOf(5L); local
230 BigInteger order = BigInteger.valueOf(5L); local
255 BigInteger order = BigInteger.valueOf(5L); local
[all...] |
| /external/flac/libFLAC/ |
| lpc.c | 143 /* save this order */
156 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigned precision, FLAC__int32 qlp_coeff[], int *shift)
173 for(i = 0; i < order; i++) {
201 for(i = 0; i < order; i++) {
234 fprintf(stderr,"FLAC__lpc_quantize_coefficients: negative shift=%d order=%u cmax=%f\n", *shift, order, cmax);
236 for(i = 0; i < order; i++) {
265 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[])
274 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization)
1361 unsigned order, index, best_index; \/* 'index' the index into lpc_error; index==order-1 since lpc_error[0] is for order==1, lpc_error[1] is for order==2, etc *\/ local
[all...] |
| /external/chromium_org/components/browser_context_keyed_service/ |
| dependency_graph.h | 32 // Topologically sorts nodes to produce a safe construction order
35 std::vector<DependencyNode*>* order) WARN_UNUSED_RESULT;
37 // Topologically sorts nodes to produce a safe destruction order
40 std::vector<DependencyNode*>* order) WARN_UNUSED_RESULT;
51 // Populates |construction_order_| with computed construction order.
61 // Cached construction order (needs rebuild with BuildConstructionOrder
|
| /external/chromium_org/skia/ext/ |
| recursive_gaussian_convolution.h | 21 enum Order {
29 SK_API RecursiveFilter(float sigma, Order order);
31 Order order() const { return order_; } function in class:skia::RecursiveFilter
35 Order order_;
|
| /external/chromium_org/third_party/WebKit/Source/web/linux/ |
| WebFontRendering.cpp | 84 void WebFontRendering::setLCDOrder(SkFontHost::LCDOrder order)
86 SkFontHost::SetSubpixelOrder(order);
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/ |
| build.properties | 25 jars.compile.order = performanceui.jar
|
| /external/flac/libFLAC/include/private/ |
| fixed.h | 46 * of the residual signal for each order. The _wide() version uses
75 * IN data[-order,data_len-1] original signal (NOTE THE INDICES!)
77 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
80 void FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]);
90 * IN order <= FLAC__MAX_FIXED_ORDER fixed-predictor order
92 * IN data[-order,-1] previously-reconstructed historical samples
95 void FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]);
|
| /external/valgrind/main/helgrind/tests/ |
| tc15_laog_lockdel.stderr.exp | 2 Establish order 1 -> 2
3 Try order 2 -> 1. This gives an error.
10 Thread #x: lock order "0x........ before 0x........" violated
12 Observed (incorrect) order is: acquisition of lock at 0x........
20 Required order was established by acquisition of lock at 0x........
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| az_isp.c | 22 * Compute the ISPs from the LPC coefficients (order=M) *
30 * For a even order m=2n, F1(z) has M/2 conjugate roots on the unit *
34 * For a 16th order LP analysis, F1(z) and F2(z) can be written as *
66 Word32 i, j, nf, ip, order; local
111 order = NC;
113 ylow = Chebps2(xlow, coef, order);
121 ylow = Chebps2(xlow, coef, order);
128 ymid = Chebps2(xmid, coef, order);
171 order = NC - 1;
176 order = NC
[all...] |
| /hardware/broadcom/wlan/ |
| .gitignore | 24 *.order
|
| /hardware/ti/wlan/ |
| .gitignore | 24 *.order
|
| /packages/apps/Settings/src/com/android/settings/deviceinfo/ |
| PercentageBarChart.java | 43 public final int order; field in class:PercentageBarChart.Entry
47 protected Entry(int order, float percentage, Paint paint) {
48 this.order = order;
55 return order - another.order;
150 public static Entry createEntry(int order, float percentage, int color) {
154 return new Entry(order, percentage, p);
|
| /external/chromium_org/third_party/icu/source/i18n/unicode/ |
| ucoleitr.h | 71 * . t_int32 order, primaryOrder;
79 * . order = ucol_next(c, &success);
81 * . order = ucol_prev(c, &success);
88 * ucol_next() returns the collation order of the next.
89 * ucol_prev() returns the collation order of the previous character.
95 * ucol_prev or ucol_next, the first or last collation order will be returned.
101 * Character based on the comparison level of the collator. A collation order
102 * consists of primary order, secondary order and tertiary order. The data
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestCollidingSetGenerator.java | 44 public List<Object> order(List<Object> insertionOrder) { method in class:TestCollidingSetGenerator
|
| TestContainerGenerator.java | 54 * Returns the iteration ordering of elements, given the order in
63 * non-deterministic iteration order.
65 Iterable<E> order(List<E> insertionOrder); method in interface:TestContainerGenerator
|
| TestStringSortedSetGenerator.java | 36 @Override public List<String> order(List<String> insertionOrder) { method in class:TestStringSortedSetGenerator
|
