OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:order
(Results
726 - 750
of
5392
) sorted by null
<<
21
22
23
24
25
26
27
28
29
30
>>
/ndk/build/platforms/android-8/arch-x86/usr/include/netinet/
in_systm.h
48
* represent the types with the bytes in ``high-ender''
order
.
/ndk/build/tools/
patch-sources.sh
30
Patches are applied in the
order
they are found by 'find'."
/packages/apps/Email/res/layout-land/
message_view.xml
35
<!-- put invisible views for prev/next in
order
to not special-case the lanscape in code -->
/packages/apps/Email/src/org/apache/commons/io/comparator/
LastModifiedFileComparator.java
24
* Compare the <b>last modified date/time</b> of two files for
order
/packages/apps/Gallery3D/src/com/cooliris/media/
GridQuadFrame.java
95
mVertexBuffer = ByteBuffer.allocateDirect(FLOAT_SIZE * size * 3).
order
(ByteOrder.nativeOrder()).asFloatBuffer();
96
mTexCoordBuffer = ByteBuffer.allocateDirect(FLOAT_SIZE * size * 2).
order
(ByteOrder.nativeOrder()).asFloatBuffer();
97
mSecTexCoordBuffer = ByteBuffer.allocateDirect(FLOAT_SIZE * size * 2).
order
(ByteOrder.nativeOrder()).asFloatBuffer();
100
mIndexBuffer = ByteBuffer.allocateDirect(CHAR_SIZE * indexCount).
order
(ByteOrder.nativeOrder()).asCharBuffer();
/packages/apps/Mms/src/org/w3c/dom/events/
DocumentEvent.java
36
*
order
to initialize the <code>Event</code>'s values. As an example,
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/voice/
WaveformImage.java
49
.
order
(ByteOrder.nativeOrder())
/packages/inputmethods/PinyinIME/jni/include/
ngram.h
35
// In
order
to reduce the storage size, the original log value is amplified by
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
treestruct.def
26
These enumerator values are used in
order
to distinguish members of union
/sdk/traceview/src/com/android/traceview/
MethodData.java
418
// then reverse the sort
order
.
420
// Reverse the sort
order
426
// Sort names into increasing
order
, data into decreasing
order
.
/external/dropbear/libtomcrypt/src/math/fp/
ltc_ecc_fp_mulmod.c
784
void *tk, *
order
;
local
909
void *tka, *tkb, *
order
;
local
[
all
...]
/external/icu4c/common/unicode/
ustring.h
41
* upper/lower-casing and string comparison in code point
order
.
411
* Compare two Unicode strings for bitwise equality (code unit
order
).
425
* Compare two Unicode strings in code point
order
.
432
* in code point
order
439
* Compare two Unicode strings (binary
order
).
441
* The comparison can be done in code unit
order
or in code point
order
.
445
* In code unit
order
, high BMP code points sort after supplementary code points
458
* @param codePointOrder Choose between code unit
order
(FALSE)
459
* and code point
order
(TRUE)
[
all
...]
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/
DTMDefaultBaseTraversers.java
95
* over an XPath axis, though perhaps not in document
order
.
198
* Implements traversal of the Ancestor access, in reverse document
order
.
242
* Implements traversal of the Ancestor access, in reverse document
order
.
328
* Implements traversal of the Ancestor access, in reverse document
order
.
579
* Implements traversal of the Ancestor access, in reverse document
order
.
758
* Implements traversal of the Ancestor access, in reverse document
order
.
828
* Implements traversal of the following access, in document
order
.
981
* Implements traversal of the Ancestor access, in reverse document
order
.
1023
* Implements traversal of the Ancestor access, in reverse document
order
.
[
all
...]
/bionic/libc/bionic/
fts.c
128
*
order
; otherwise traverse in the
order
specified.
297
/* Directory in pre-
order
. */
299
/* If skipped or crossed mount point, do post-
order
visit. */
489
* If not a directory being visited in pre-
order
, stop here. Could
593
* but set a flag so we don't chdir after the post-
order
visit.
598
* has already been visited in pre-
order
, have to wait until the
599
* post-
order
visit to return the error. There is a special case
731
/* We walk in directory
order
so "ls -f" doesn't get upset. */
865
* Reassemble the array in the
order
returned by qsort. If unable t
[
all
...]
/dalvik/libcore/xml/src/main/java/javax/xml/datatype/
Duration.java
47
* <h2>
Order
relationship</h2>
48
* <p>Duration objects only have partial
order
, where two values A and B
62
* the
order
relationship among <code>Duration</code> objects.</p>
67
* Because durations don't have total
order
, an operation could
306
* <p>If the seconds field carries more digits than millisecond
order
,
343
* <p>If the seconds field carries more digits than millisecond
order
,
495
*
order
of YEARS, MONTHS, DAYS, HOURS, MINUTES, SECONDS, and MILLISECONDS
738
* <p>Partial
order
relation comparison with this <code>Duration</code> instance.</p>
741
* <a href="http://www.w3.org/TR/xmlschema-2/#duration-
order
">W3C XML Schema 1.0 Part 2, Section 3.2.7.6.2,
742
* <i>
Order
relation on duration</i></a>.</p
[
all
...]
/external/guava/src/com/google/common/collect/
Synchronized.java
94
* collection using the specified mutex. In
order
to guarantee serial access,
215
* the specified mutex. In
order
to guarantee serial access, it is critical
271
* sorted set using the specified mutex. In
order
to guarantee serial access,
350
* using the specified mutex. In
order
to guarantee serial access, it is
477
* multiset using the specified mutex. In
order
to guarantee serial access, it
586
* multimap using the specified mutex. In
order
to guarantee serial access, it
920
* collection using the specified mutex. In
order
to guarantee serial access,
941
* {@link #set} or {@link #list} respectively, in that
order
of specificity.
961
* the specified mutex. In
order
to guarantee serial access, it is critical
1076
* the specified mutex. In
order
to guarantee serial access, it is critica
[
all
...]
/external/icu4c/test/cintltst/
callcoll.c
445
int32_t
order
;
local
454
while ((
order
=ucol_next(iter, &status)) != UCOL_NULLORDER)
467
orders[size].
order
=
order
;
509
if (o != orders[index].
order
) {
513
while (index > 0 && orders[-- index].
order
== 0) {
517
if (o != orders[index].
order
) {
518
log_err("Mismatched
order
at index %d: 0x%8.8X vs. 0x%8.8X\n", index,
519
orders[index].
order
, o);
535
while (index != 0 && orders[index - 1].
order
== 0)
[
all
...]
/external/openssl/crypto/ec/
ec_curve.c
84
const char *
order
; /* the
order
of the group generated by the
member in struct:ec_curve_data_st
1128
BIGNUM *p=NULL, *a=NULL, *b=NULL, *x=NULL, *y=NULL, *
order
=NULL;
local
[
all
...]
/bionic/libc/arch-arm/include/machine/
ieee.h
84
* and 96-bit IEEE formats, with the words in big-endian
order
. VFP supports
86
*
order
.
/build/tools/droiddoc/src/
SinceTagger.java
33
* this method should be called in
order
from oldest version to newest.
40
// read through the XML files in
order
, applying their since information
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
PriorityBlockingQueue.java
31
* the PriorityBlockingQueue in any particular
order
. If you need
35
*
order
and place them in another collection.
104
* @param comparator the comparator that will be used to
order
this
267
* Returns the comparator used to
order
the elements in this queue,
271
* @return the comparator used to
order
the elements in this queue,
339
* The returned array elements are in no particular
order
.
442
* The returned array elements are in no particular
order
.
488
* iterator does not return the elements in any particular
order
.
/dalvik/libcore/luni/src/main/java/java/util/
EnumMap.java
525
* The
order
of the entries in the set will be the
order
that the enum keys
589
* The
order
of the set will be the
order
that the enum keys were declared
690
* in the their corresponding keys' natural
order
(the {@code Enum} constants are
691
* declared in this
order
).
693
* The
order
of the values in the collection will be the
order
that their
SortedSet.java
22
* SortedSet is a Set which iterates over its elements in a sorted
order
. The
23
*
order
is determined either by the elements natural ordering, or by a
/dalvik/libcore/luni/src/main/java/org/apache/harmony/misc/
HashCode.java
22
* object based on the field values. The result depends on the
order
of elements
26
* If you need
order
independent hash code just summate, multiply or XOR all
/dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/kernel/vm/
LangAccess.java
70
* declaration (ordinal)
order
. It is not safe to hand out this
75
* declaration
order
or <code>null</code> if the given class is
Completed in 187 milliseconds
<<
21
22
23
24
25
26
27
28
29
30
>>