| /external/guava/javadoc/com/google/common/collect/ |
| Ordering.html | 211 Returns an ordering which tries each given comparator in order until a
228 Returns an ordering that compares objects according to the order in
245 Returns an ordering that compares objects according to the order in
315 order".</TD>
442 Returns a serializable ordering that uses the natural order of the values.</TD>
597 <DD>Returns a serializable ordering that uses the natural order of the values.
[all...] |
| /external/icu4c/common/unicode/ |
| ubidi.h | 74 * characters (code units) in logical order.</li>
109 * // the text[start..limit-1] is always in logical order
529 * (keyboard, typing) order and to determine the reordering of it for visual
531 * Some legacy systems store text in visual order, and for operations
533 * to logical order. This is effectively the inverse algorithm of the
684 * (keyboard, typing) order and to determine how to reorder it for visual
692 * <p>Some legacy systems store text in visual order, and for operations
694 * into logical order. This is effectively the inverse algorithm of the
[all...] |
| /build/tools/releasetools/ |
| check_target_files_signatures | 321 order = [(-len(v), k) for (k, v) in by_cert.iteritems()]
322 order.sort()
324 for _, cert in order:
|
| /cts/tests/tests/database/src/android/database/sqlite/cts/ |
| SQLiteQueryBuilderTest.java | 151 // TODO: implement an order-independent way of doing the projection columns comparison
221 "ORDER BY name " +
245 "GROUP BY name HAVING " + DEFAULT_HAVING + " ORDER BY name LIMIT 2";
|
| /dalvik/docs/ |
| instruction-formats.html | 91 <td>immediate signed <b>h</b>at (high-order bits of a 32- or 64-bit
92 value; low-order bits are all <code>0</code>)
156 have non-zero bits in their high-order bits; for these, the zeroes
|
| /dalvik/libcore/archive/src/main/java/java/util/zip/ |
| ZipEntry.java | 437 * Read a four-byte int in little-endian order.
456 * Read a two-byte short in little-endian order.
467 * Read a four-byte int in little-endian order.
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| DelayQueue.java | 372 * The returned array elements are in no particular order.
396 * The returned array elements are in no particular order.
456 * elements in any particular order. The returned
|
| /dalvik/libcore/luni/src/main/java/java/io/ |
| DataOutputStream.java | 152 * Writes the low order bytes from a string to the target stream.
243 * four bytes, highest order first, of {@code val}.
262 * eight bytes, highest order first, of {@code val}.
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| AbstractCollection.java | 190 * objects contained by this {@code Collection}. The order in which the elements are
192 * {@code Collection} has a defined order. In that case, the elements are returned in that order.
|
| /dalvik/libcore/luni/src/test/java/tests/api/java/lang/ref/ |
| ReferenceTest.java | 246 * right order for WeakReferences.
257 "right order for WeakReferences.",
265 "right order for WeakReferences.",
|
| /dalvik/vm/compiler/codegen/arm/ |
| LocalOptimizations.c | 110 * scannng in the top-down order and the new instruction
155 * top-down order.
378 * bottom-up order.
|
| /dalvik/vm/test/ |
| TestIndirectRefTable.c | 58 * Add three, check, remove in the order in which they were added.
104 * Add three, remove in the opposite order.
290 /* because of removal order, should have 20 entries, 19 of them holes */
|
| /external/bison/build-aux/ |
| missing | 214 in order for those modifications to take effect. You can get
244 in order for those modifications to take effect. You can get
267 \`Help2man' package in order for those modifications to take
|
| /external/bluetooth/glib/ |
| README.win32 | 72 Tor uses gcc with the -mms-bitfields flag which means that in order to
273 dependencies order.
325 | the user needs to know the build order
|
| /external/dbus/ |
| missing | 214 in order for those modifications to take effect. You can get
244 in order for those modifications to take effect. You can get
267 \`Help2man' package in order for those modifications to take
|
| /external/dnsmasq/src/ |
| nameser.h | 268 /* you must determine what the correct bit order is for
277 * Structure for query header. The order of the fields is machine- and
278 * compiler-dependent, depending on the byte/bit order and the layout
|
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_pk.h | 169 /** The order of the curve (hex) */
170 char *order; member in struct:__anon1633
306 /** The order of the sub-group used in octets */
|
| /external/elfutils/config/ |
| depcomp | 252 # Important note: in order to support this mode, a compiler *must*
336 # Important note: in order to support this mode, a compiler *must*
374 # Important note: in order to support this mode, a compiler *must*
|
| missing | 190 in order for those modifications to take effect. You can get
220 in order for those modifications to take effect. You can get
248 \`Help2man' package in order for those modifications to take
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| ReportProperties.java | 186 private int [] m_columnOrder; // attribute IDs [order indicates column order]
187 private int [] m_sortOrder; // if m_sortOrder[i+1]>0 , sort m_columnOrder[m_sortOrder[i]] in ascending order
|
| /external/genext2fs/ |
| missing | 214 in order for those modifications to take effect. You can get
244 in order for those modifications to take effect. You can get
267 \`Help2man' package in order for those modifications to take
|
| /external/grub/ |
| missing | 214 in order for those modifications to take effect. You can get
244 in order for those modifications to take effect. You can get
267 \`Help2man' package in order for those modifications to take
|
| /external/guava/src/com/google/common/base/ |
| Splitter.java | 42 * and {@code "bar"}, in that order.
58 * containing just {@code ["foo", "bar", "quux"]}. Note that the order in which
61 * regardless of the order in which the {@link #trimResults()} and
|
| /external/icu4c/i18n/ |
| olsontz.h | 36 * in lexicographic order.
199 * over time, so this API is not useful. In order to approximate
207 * not varies over time. In order to approximate expected
|
| rbt_set.cpp | 236 * Add a rule to this set. Rules are added in order, and order is
279 * Each bin contains zero or more rules, in the same order
|
