| /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/exif/ |
| OrderedDataOutputStream.java | 32 public OrderedDataOutputStream setByteOrder(ByteOrder order) {
33 mByteBuffer.order(order);
|
| /packages/apps/Launcher3/WallpaperPicker/src/com/android/gallery3d/exif/ |
| OrderedDataOutputStream.java | 32 public OrderedDataOutputStream setByteOrder(ByteOrder order) {
33 mByteBuffer.order(order);
|
| /packages/apps/Mms/src/com/android/mms/exif/ |
| OrderedDataOutputStream.java | 32 public OrderedDataOutputStream setByteOrder(ByteOrder order) {
33 mByteBuffer.order(order);
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/executor/ |
| FifoPriorityThreadPoolExecutor.java | 15 * same time. Runnables with the same priority will be executed in FIFO order.
56 private final int order; field in class:FifoPriorityThreadPoolExecutor.FifoPriorityLoadTask
58 public FifoPriorityLoadTask(Runnable runnable, T result, int order) {
65 this.order = order;
72 result = order - loadTask.order;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| statesort.h | 28 // Sorts the input states of an FST, modifying it. ORDER[i] gives the
30 // sorting. ORDER must be a permutation of FST's states ID sequence:
34 const vector<typename Arc::StateId> &order) {
38 CHECK_EQ(order.size(), fst->NumStates());
45 vector<bool> done(order.size(), false);
49 fst->SetStart(order[fst->Start()]);
64 s2 = order[s1];
77 arc.nextstate = order[arc.nextstate];
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
58 if (order == o)
60 else if (order < o)
64 order -= o + 1;
76 find_by_order(size_type order) const
78 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/tree_policy/ |
| order_statistics_imp.hpp | 44 find_by_order(size_type order)
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/arm64/ |
| omxSP_FFTFwd_RToCCS_F32.c | 74 * Compute an FFT for a complex signal of length of 2^order,
75 * where 0 <= order <= 15.
84 * N = 2^order
88 * 2^order; must be aligned on a 32 byte boundary.
93 * pDst - pointer to the complex-valued output vector, of length 2^order;
111 int order; local
127 * Compute the RFFT using a complex FFT of one less order, so set
128 * order to be the order of the complex FFT.
130 order = fastlog2(spec->N) - 1
[all...] |
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
| omxSP_FFTFwd_CToC_SC16_Sfs_s.S | 90 #define order r14 define
128 CLZ order,N @// N = 2^order
129 RSB order,order,#31
133 CMP order,#3
134 BGT orderGreaterthan3 @// order > 3
136 CMP order,#1
137 BGE orderGreaterthan0 @// order > 0
138 M_STR scale, diffOnStack,LT @// order =
[all...] |
| omxSP_FFTFwd_CToC_SC32_Sfs_s.S | 88 #define order r14 define
125 CLZ order,N @// N = 2^order
126 RSB order,order,#31
130 CMP order,#3
131 BGT orderGreaterthan3 @// order > 3
133 CMP order,#1
134 BGE orderGreaterthan0 @// order > 0
135 M_STR scale, diffOnStack,LT @// order =
[all...] |
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/ |
| omxSP_FFTInit_C_FC32.c | 36 * [in] order base-2 logarithm of the desired block length;
46 OMXResult omxSP_FFTInit_C_FC32(OMXFFTSpec_C_FC32* pFFTSpec, OMX_INT order) {
66 if (!pFFTSpec || (order < 1) || (order > TWIDDLE_TABLE_ORDER))
70 Nby2 = 1 << (order - 1);
100 * N = 1 << order
101 * W = -PI >> (order - 1)
104 diff = TWIDDLE_TABLE_ORDER - order;
105 /* step into the twiddle table for the current order */
112 if (order >= 3)
[all...] |
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| k2a_FIX.c | 36 opus_int32 *A_Q24, /* O Prediction coefficients [order] Q24 */
37 const opus_int16 *rc_Q15, /* I Reflection coefficients [order] Q15 */
38 const opus_int32 order /* I Prediction order */
44 for( k = 0; k < order; k++ ) {
|
| k2a_Q16_FIX.c | 36 opus_int32 *A_Q24, /* O Prediction coefficients [order] Q24 */
37 const opus_int32 *rc_Q16, /* I Reflection coefficients [order] Q16 */
38 const opus_int32 order /* I Prediction order */
44 for( k = 0; k < order; k++ ) {
|
| /external/libexif/libexif/canon/ |
| exif-mnote-data-canon.h | 24 #include <libexif/exif-byte-order.h>
40 ExifByteOrder order; member in struct:_ExifMnoteDataCanon
|
