HomeSort by relevance Sort by last modified time
    Searched refs:order (Results 726 - 750 of 1605) sorted by null

<<21222324252627282930>>

  /frameworks/base/media/tests/EffectsTest/src/com/android/effectstest/
BassBoostTest.java 211 converter.order(ByteOrder.nativeOrder());
217 converter.order(ByteOrder.nativeOrder());
VirtualizerTest.java 208 converter.order(ByteOrder.nativeOrder());
214 converter.order(ByteOrder.nativeOrder());
  /frameworks/base/packages/WallpaperCropper/src/com/android/gallery3d/exif/
ExifData.java 51 ExifData(ByteOrder order) {
52 mByteOrder = order;
117 * Gets the byte order.
  /frameworks/native/opengl/tests/testViewport/src/com/android/test/
TestView.java 125 .order(ByteOrder.nativeOrder());
134 .order(ByteOrder.nativeOrder()).asCharBuffer();
  /hardware/libhardware/modules/audio/
Android.mk 18 # device specific modules are present. The exact load order can be seen in
  /hardware/libhardware/modules/local_time/
Android.mk 22 # if no other device specific modules are present. The exact load order can be
  /hardware/ti/omap4-aah/test/CameraHal/
Android.mk 6 # OMAP_ENHANCEMENT and OMAP_ENHANCEMENT_CPCAM macros in order to
  /packages/apps/Camera2/src/com/android/camera/exif/
ExifData.java 51 ExifData(ByteOrder order) {
52 mByteOrder = order;
117 * Gets the byte order.
  /packages/apps/CellBroadcastReceiver/tests/
Android.mk 32 # Apk must be signed with platform signature in order to send test broadcasts.
  /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/exif/
ExifData.java 51 ExifData(ByteOrder order) {
52 mByteOrder = order;
117 * Gets the byte order.
  /packages/apps/Launcher3/WallpaperPicker/src/com/android/gallery3d/exif/
ExifData.java 51 ExifData(ByteOrder order) {
52 mByteOrder = order;
117 * Gets the byte order.
  /packages/apps/Mms/src/com/android/mms/exif/
ExifData.java 53 ExifData(ByteOrder order) {
54 mByteOrder = order;
119 * Gets the byte order.
  /packages/experimental/CameraPreviewTest/src/com/example/android/videochatcameratest/
SurfaceTextureView.java 165 FLOAT_SIZE_BYTES).order(ByteOrder.nativeOrder()).asFloatBuffer();
168 FLOAT_SIZE_BYTES).order(ByteOrder.nativeOrder()).asFloatBuffer();
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
OpenWnnDictionaryImpl.java 83 " from " + TABLE_NAME_DIC + " where %s order by " +
93 " from " + TABLE_NAME_DIC + " where %s = ? and %s = ? and %s order by " +
415 * @param order The type of sort order
417 protected void createQuery( String keyString, WnnWord wnnWord, int operation, int order) {
495 switch( order ) {
535 public int searchWord( int operation, int order, String keyString ) {
544 createQuery( keyString, null, operation, order );
567 int ret = OpenWnnDictionaryImplJni.searchWord( this.mWnnWork, operation, order, keyString );
580 public int searchWord( int operation, int order, String keyString, WnnWord wnnWord )
    [all...]
  /external/chromium_org/chrome/common/extensions/docs/examples/api/webNavigation/basic/
navigation_collector.js 23 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
32 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
41 * request's tab ID, frame ID, and URL in order to ensure uniqueness.
49 // in handling in order to build up a complete picture of the whole
441 * successful navigation requests, sorted in decending order of frequency.
455 * unsuccessful navigation requests, sorted in decending order
471 * navigation requests, sorted in decending order of frequency.
  /external/chromium_org/third_party/bintrees/bintrees/
treemixin.py 70 * foreach(f, [order]) -> visit all nodes of tree and call f(k, v) for each node, O(n)
151 self.foreach(tree.insert, order=-1)
207 order if reverse is True, iterate in descending order, reverse defaults
217 """ T.values([reverse]) -> an iterator over the values of T, in ascending order
218 if reverse is True, iterate in descending order, reverse defaults to False
224 in ascending order if reverse is True, iterate in descending order,
437 def foreach(self, func, order=0):
441 param int order: inorder = 0, preorder = -1, postorder = +
    [all...]
  /external/chromium_org/third_party/icu/source/i18n/
ucal.cpp 621 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
624 order = ures_getByKey(rb, "001", NULL, status);
632 for (int i = 0; i < ures_getSize(order); i++) {
634 const UChar *type = ures_getStringByIndex(order, i, &len, status);
667 ures_close(order);
ucol.cpp 950 * a) collapse the 2 different Han ranges from UCA into one (in the right order), and
1435 uint32_t order = 0; local
4338 uint32_t order = UCOL_NO_MORE_CES; local
4764 uint32_t order = 0; local
5360 uint32_t order = 0; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/math/
m_eval.c 84 GLuint dim, GLuint order)
89 if (order >= 2) {
90 bincoeff = (GLfloat) (order - 1);
96 for (i = 2, cp += 2 * dim, powert = t * t; i < order;
98 bincoeff *= (GLfloat) (order - i);
105 else { /* order=1 -> constant curve */
  /external/mesa3d/src/mesa/math/
m_eval.c 75 GLuint dim, GLuint order)
80 if (order >= 2) {
81 bincoeff = (GLfloat) (order - 1);
87 for (i = 2, cp += 2 * dim, powert = t * t; i < order;
89 bincoeff *= (GLfloat) (order - i);
96 else { /* order=1 -> constant curve */
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
rmepsilon.h 207 // States sorted in topological order when (acyclic) or generic
208 // topological order (cyclic).
215 vector<StateId> order; local
217 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
221 states.resize(order.size());
222 for (StateId i = 0; i < (StateId)order.size(); i++)
223 states[order[i]] = i;
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-coretext.cc 219 unsigned int order; member in struct:active_feature_t
223 a->order < b->order ? -1 : a->order > b->order ? 1 :
462 feature.order = i;
486 feature.order = num_features + 1;
810 /* Fix up clusters so that we never return out-of-order indices;
    [all...]
hb-uniscribe.cc 262 unsigned int order; member in struct:active_feature_t
266 a->order < b->order ? -1 : a->order > b->order ? 1 :
616 feature.order = i;
640 feature.order = num_features + 1;
881 /* Asking for glyphs in logical order circumvents at least
  /external/harfbuzz_ng/src/
hb-coretext.cc 219 unsigned int order; member in struct:active_feature_t
223 a->order < b->order ? -1 : a->order > b->order ? 1 :
462 feature.order = i;
486 feature.order = num_features + 1;
808 /* Fix up clusters so that we never return out-of-order indices;
    [all...]
hb-uniscribe.cc 259 unsigned int order; member in struct:active_feature_t
263 a->order < b->order ? -1 : a->order > b->order ? 1 :
613 feature.order = i;
637 feature.order = num_features + 1;
878 /* Asking for glyphs in logical order circumvents at least

Completed in 4345 milliseconds

<<21222324252627282930>>