| /external/webkit/WebKit/mac/icu/unicode/ |
| unorm.h | 56 * accent. Sometimes the order of a character's combining accents is
86 * order, so that you do not have to worry about accent rearrangement on your
165 * Lowest-order bit number of unorm_compare() options bits corresponding to
495 * Compare strings in code point order instead of code unit order.
504 * code point order (as opposed to code unit order).
519 * where code point order and foldCase are all optional.
532 * Case-sensitive comparison in code unit order, and the input strings
541 * Set to choose code point order instead of code unit orde
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| uctralgo.h | 26 /// *(result + n) = *(first + n). Assignments are performed in forward order,
27 /// i.e. in order of increasing n.
48 /// performed in forward order, i.e. from first to last. For_each returns
60 /// performed in forward order, i.e. from first to last. For_each returns
249 /// relative order of the elements that are copied is the same as in the
262 /// is stable, meaning that the relative order of the elements that are copied
275 /// meaning that the relative order of elements that are not equal to value is
289 /// meaning that the relative order of elements that are not equal to value is
304 /// meaning that the relative order of elements that are not removed is
333 /// meaning that the relative order of elements that are not removed i
[all...] |
| /dalvik/libcore/icu/src/main/native/ |
| NativeCollation.cpp | 148 * comparison order.
152 * @param order collation order returned by previous or next.
154 * order or 1 if collation order does not occur at the end of any
158 jint address, jint order) {
161 return ucol_getMaxExpansion(iterator, order);
|
| /external/guava/src/com/google/common/collect/ |
| Lists.java | 76 * @param elements the elements that the list should contain, in order
103 * @param elements the elements that the list should contain, in order
126 * @param elements the elements that the list should contain, in order
204 * @param elements the elements that the list should contain, in order
224 * {@code (Foo firstFoo, Foo... moreFoos)}, in order to avoid overload
265 * {@code (Foo firstFoo, Foo secondFoo, Foo... moreFoos)}, in order to avoid
452 * two inner lists of three and two elements, all in the original order.
|
| /external/icu4c/i18n/unicode/ |
| dtitvinf.h | 76 * hides the order of fields.
93 * Those calendar fields can be defined in the following order:
97 * first different calendar field in above order.
126 * We use fallback format for the default order for the locale.
131 * For a particular interval pattern, the default order can be overriden
322 /** Get default order -- whether the first date in pattern is later date
507 // default order
|
| /external/opencore/oscl/oscl/osclutil/src/ |
| oscl_bin_stream.h | 33 * \brief Defines a set of binary stream classes which handle portable input / output of binary data regardless of the native byte order.
46 ** will read/write in the correct byte order regardless of the platform you are running on.
48 ** OsclBinIStreamBigEndian - Input stream for big endian byte order.
49 ** OsclBinIStreamLittleEndian - Input stream for little endian byte order.
50 ** OsclBinOStreamBigEndian - Output stream for big endian byte order.
51 ** OsclBinIStreamLittleEndian - Input stream for little endian byte order.
54 ** in oscl_base.h and tell this module the byte order used by the native platform. This is used
|
| /external/openssl/apps/ |
| s_socket.c | 71 /* With IPv6, it looks like Digital has mixed up the proper order of
575 unsigned long order; member in struct:ghbn_cache_st
589 if (low > ghbn_cache[i].order)
591 low=ghbn_cache[i].order;
594 if (ghbn_cache[i].order > 0)
610 ghbn_cache[lowi].order=ghbn_miss+ghbn_hits;
618 ghbn_cache[i].order=ghbn_miss+ghbn_hits;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmepsilon.h | 209 // States sorted in topological order when (acyclic) or generic
210 // topological order (cyclic).
217 vector<StateId> order; local
219 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
223 states.resize(order.size());
224 for (StateId i = 0; i < (StateId)order.size(); i++)
225 states[order[i]] = i;
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_6/ |
| shell.js | 205 Calculate the "order" of a set of data points {X: [], Y: []}
211 var order = 0;
219 // only increase the order if the slope
221 order++;
234 if (2 == origLength - order)
236 order = Number.POSITIVE_INFINITY;
238 return order;
|
| /external/webkit/WebCore/platform/graphics/chromium/ |
| UniscribeHelper.h | 221 // reading order. However, for rtl text, the characters within each
268 // are in screen order.
397 // in one script and one direction. This array is in reading order.
402 // This is a mapping between reading order and screen order for the items.
403 // Uniscribe's items array are in reading order. For right-to-left text,
406 // and positions. This list is in screen order from left to right, and
|
| /hardware/ti/omap3/omx/video/src/openmax_il/video_encode/inc/ |
| OMX_VideoEnc_DSP.h | 136 /* Picture Order Count Type Identifier for H.264 Encoder*/
144 /* Picture Order Count Type Identifier for H.264 Encoder*/
169 IH264_RASTER_SCAN = 0 , /* 0 : Raster scan order*/
170 IH264_REVERSE_RASTER_SCAN /* 1 : Reverse Raster Scan Order*/
248 OMX_U32 picOrderCountType ; /* Picture Order count type Valid values 0, 2*/
263 OMX_U32 asoSliceOrder[MAXNUMSLCGPS] ; /* Array containing the order of slices in which they should
284 raster scan order of slice group macroblock units.
|
| /hardware/ti/wlan/wl1271/platforms/os/linux/ |
| Makefile | 221 @echo 'In order to select host platform one of the scripts: omap2430_env.tcsh or omap3430_env.tcsh must be run:'
305 # in order to remove all .*.o.cmd
307 # in order to remove all *.order and *.symvers
308 @find ../../../. -type f -print | grep .order | xargs rm -f
310 # in order to remove Module.markers file
312 # in order to remove the binaries tar
|
| /external/webkit/WebCore/rendering/ |
| RenderLayerCompositor.cpp | 198 // Go through the layers in presentation order, so that we can compute which RenderLayers need compositing layers.
465 // Recurse through the layers in z-index and overflow order (which is equivalent to painting order)
466 // For the z-order children of a compositing layer:
468 // be compositing in order to render above that layer.
470 // If a child in the negative z-order list is compositing, then the layer itself
541 // For the negative z-order, if we have a fixed layer
544 // still be drawn onto a higher z-order layer (e.g. the body)
548 // and positive z-order.
562 // (since we need to ensure that the -ve z-order child renders underneath our contents)
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/xslt/ |
| ObjectFactory.java | 84 * Finds the implementation Class object in the specified order. The
85 * specified order is the following:
107 * Finds the implementation Class object in the specified order. The
108 * specified order is the following:
154 * Finds the implementation Class object in the specified order. The
155 * specified order is the following:
182 * Finds the implementation Class object in the specified order. The
183 * specified order is the following:
237 * order. The specified order is the following
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
| ObjectFactory.java | 84 * Finds the implementation Class object in the specified order. The
85 * specified order is the following:
107 * Finds the implementation Class object in the specified order. The
108 * specified order is the following:
154 * Finds the implementation Class object in the specified order. The
155 * specified order is the following:
182 * Finds the implementation Class object in the specified order. The
183 * specified order is the following:
237 * order. The specified order is the following
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
| ObjectFactory.java | 83 * Finds the implementation Class object in the specified order. The
84 * specified order is the following:
106 * Finds the implementation Class object in the specified order. The
107 * specified order is the following:
153 * Finds the implementation Class object in the specified order. The
154 * specified order is the following:
181 * Finds the implementation Class object in the specified order. The
182 * specified order is the following:
236 * order. The specified order is the following
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| ObjectFactory.java | 84 * Finds the implementation Class object in the specified order. The
85 * specified order is the following:
107 * Finds the implementation Class object in the specified order. The
108 * specified order is the following:
154 * Finds the implementation Class object in the specified order. The
155 * specified order is the following:
182 * Finds the implementation Class object in the specified order. The
183 * specified order is the following:
237 * order. The specified order is the following
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/functions/ |
| ObjectFactory.java | 84 * Finds the implementation Class object in the specified order. The
85 * specified order is the following:
107 * Finds the implementation Class object in the specified order. The
108 * specified order is the following:
154 * Finds the implementation Class object in the specified order. The
155 * specified order is the following:
182 * Finds the implementation Class object in the specified order. The
183 * specified order is the following:
237 * order. The specified order is the following
[all...] |
| /external/opencore/codecs_v2/audio/aac/dec/src/ |
| tns_decode_coef.cpp | 54 (1) Changed the order of the unsigned * signed multiply so the
73 Inputs: order = RANGE = 1-20
158 for (i=0; i<order; i++)
165 for (m=1; m<=order; m++)
284 const Int order,
342 * iteration of the do-while( m < order ) loop.
393 * iteration of the do-while( m < order ) loop.
434 while (m < order);
471 for (m = order; m > 0; m--)
490 for (m = order; m > 0; m--
[all...] |
| /external/opencore/codecs_v2/audio/gsm_amr/amr_wb/dec/src/ |
| qpisf_2s.cpp | 167 for (i = 0; i < ORDER; i++)
201 for (i = 0; i < ORDER; i++)
208 for (i = 0; i < ORDER; i++)
217 Reorder_isf(isf_q, ISF_GAP, ORDER);
261 for (i = 0; i < ORDER; i++)
296 for (i = 0; i < ORDER; i++)
303 for (i = 0; i < ORDER; i++)
311 Reorder_isf(isf_q, ISF_GAP, ORDER);
319 * To make sure that the isfs are properly order and to keep a certain
326 * n LPC order
[all...] |
| /external/speex/libspeex/ |
| lsp.c | 55 A(z) is a polynomial of order lpcrdr with {ak} as the coefficients.
70 LSP frequencies is basically finding the roots of 5th order
143 int m, /* LPC order/2 */
221 /* int lpcrdr order of LPC coefficients (10) */
244 m = lpcrdr/2; /* order of P'(z) & Q'(z) polynomials */
406 /* int lpcrdr order of LPC coefficients */
420 Reconstruct P(z) and Q(z) by cascading second order polynomials
433 2nd order filter. The first row is the impulse input to the
525 /* int lpcrdr order of LPC coefficients */
555 /* reconstruct P(z) and Q(z) by cascading second order
[all...] |
| /frameworks/base/core/java/android/text/format/ |
| DateFormat.java | 42 Formatting characters may be repeated in order to get more detailed representations
265 * to the current locale and the user's date-order preference.
355 * 3 elements ({@link #DATE}, {@link #MONTH}, and {@link #YEAR}) in the order
356 * specified by the user's format preference. Note that this order is
360 * order returned here.
363 char[] order = new char[] {DATE, MONTH, YEAR}; local
373 order[index] = DATE;
379 order[index] = MONTH;
385 order[index] = YEAR;
389 return order;
[all...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| tns_decode_coef.cpp | 54 (1) Changed the order of the unsigned * signed multiply so the
73 Inputs: order = RANGE = 1-20
158 for (i=0; i<order; i++)
165 for (m=1; m<=order; m++)
284 const Int order,
342 * iteration of the do-while( m < order ) loop.
393 * iteration of the do-while( m < order ) loop.
434 while (m < order);
471 for (m = order; m > 0; m--)
490 for (m = order; m > 0; m--
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrwb/src/ |
| qpisf_2s.cpp | 167 for (i = 0; i < ORDER; i++)
201 for (i = 0; i < ORDER; i++)
208 for (i = 0; i < ORDER; i++)
217 Reorder_isf(isf_q, ISF_GAP, ORDER);
261 for (i = 0; i < ORDER; i++)
296 for (i = 0; i < ORDER; i++)
303 for (i = 0; i < ORDER; i++)
311 Reorder_isf(isf_q, ISF_GAP, ORDER);
319 * To make sure that the isfs are properly order and to keep a certain
326 * n LPC order
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/ |
| NodeSetDTM.java | 38 * NodeList, or NodeIterator. However, in order for it to
41 * nextNode() is called, in order that nodes can be added
43 * must override runTo(int index), in order that they may
581 // * document order. If a node is null, don't add it.
615 // * document order. Only genuine node references will be copied;
640 * document order. Null references are not added.
668 // * document order. If a node is null, don't add it.
696 * document order. If a node is null, don't add it.
719 // * Add the node list to this node set in document order.
784 * document order
[all...] |
