/external/icu4c/common/ |
uvectr32.h | 67 int32_t* elements; member in class:UVector32 84 * equal if they are of the same size and all elements are equal, 137 * elements for i >= newSize. If newSize is larger, grow the 147 * Returns true if this vector contains none of the elements 157 * The current elements are assumed to be sorted already. 170 * Units are vector elements (32 bits each), not bytes. 222 return (0 <= index && index < count) ? elements[index] : 0; 228 elements[count] = elem; 237 int32_t *rp = elements+count; 248 return elements+count-size [all...] |
/external/icu4c/i18n/unicode/ |
ucoleitr.h | 109 * Open the collation elements for a string. 145 * Reset the collation elements to their initial state. 157 * Set the collation elements to use implicit ordering for Han 175 * @return The next collation elements ordering, otherwise returns NULLORDER 185 * Note that internally a stack is used to store buffered collation elements. 193 * @return The previous collation elements ordering, otherwise returns 209 * @return The next collation elements ordering, otherwise returns UCOL_PROCESSED_NULLORDER 220 * Note that internally a stack is used to store buffered collation elements. 231 * @return The previous collation elements ordering, otherwise returns 255 * Set the text containing the collation elements [all...] |
/external/proguard/src/proguard/classfile/visitor/ |
package.html | 4 the <i>visitor pattern</i>. Cfr., for instance, "Design Patterns, Elements of 7 Why the visitor pattern? Class files frequently contain lists of elements of 16 on the elements of a list, followed by type casts and the proper operations.
|
/external/webkit/LayoutTests/dom/html/level1/core/ |
hc_elementgetelementsbytagname.js | 79 of all descendant Elements with the given tag name. 82 Create a NodeList of all the descendant elements 85 "0" since there are not any descendant elements
|
/external/webkit/LayoutTests/dom/html/level2/html/ |
HTMLCollection02.js | 82 the elements attribute. The first SELECT element is further retrieved 83 using the elements name attribute. 107 formsnodeList = testNode.elements;
|
HTMLFormElement01.js | 78 The elements attribute specifies a collection of all control element 81 Retrieve the elements attribute and examine its value. 104 elementnodeList = testNode.elements;
|
/external/webkit/LayoutTests/dom/xhtml/level1/core/ |
hc_elementgetelementsbytagname.js | 79 of all descendant Elements with the given tag name. 82 Create a NodeList of all the descendant elements 85 "0" since there are not any descendant elements
|
/external/webkit/LayoutTests/dom/xhtml/level2/html/ |
HTMLCollection02.js | 82 the elements attribute. The first SELECT element is further retrieved 83 using the elements name attribute. 107 formsnodeList = testNode.elements;
|
HTMLFormElement01.js | 78 The elements attribute specifies a collection of all control element 81 Retrieve the elements attribute and examine its value. 104 elementnodeList = testNode.elements;
|
/external/webkit/Source/WebCore/page/ |
SpeechInput.h | 47 // This class connects the input elements requiring speech input with the platform specific 48 // speech recognition engine. It provides methods for the input elements to activate speech 64 // Methods invoked by the input elements.
|
/libcore/dalvik/src/main/java/dalvik/system/ |
VMStack.java | 66 * @return an array of stack trace elements, or null if the thread 79 * desired. Unused elements will be filled with null values. 80 * @return the number of elements filled
|
DexPathList.java | 51 /** list of dex/resource (class path) elements */ 54 /** list of native library directory elements */ 62 * @param dexPath list of dex/resource path elements, separated by 64 * @param libraryPath list of native library directory path elements, 102 * Splits the given dex path string into elements using the path 103 * separator, pruning out any elements that do not refer to existing 112 * Splits the given library directory path string into elements 114 * defaults to {@code ":"} on Android, appending on the elements 115 * from the system library path, and pruning out any elements that 136 * Splits the given path strings into file elements using the pat 196 ArrayList<Element> elements = new ArrayList<Element>(); local [all...] |
/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
elementgetelementsbytagname.java | 32 * of all descendant Elements with the given tag name. 34 * Create a NodeList of all the descendant elements 37 * "0" since there are not any descendant elements
|
hc_elementgetelementsbytagname.java | 32 * of all descendant Elements with the given tag name. 34 * Create a NodeList of all the descendant elements 37 * "0" since there are not any descendant elements
|
/libcore/luni/src/main/java/java/util/ |
LinkedHashSet.java | 27 * Null elements are allowed, and all the optional Set operations are supported. 73 * elements in the specified collection. 76 * the collection of elements to add.
|
/system/core/nexus/ |
VpnController.h | 32 int elements); 44 int elements); 56 int elements);
|
/external/v8/src/arm/ |
ic-arm.cc | 69 Register elements, 75 // elements: holds the property dictionary on fall through. 79 // elements map. 100 __ ldr(elements, FieldMemOperand(receiver, JSObject::kPropertiesOffset)); 101 __ ldr(t1, FieldMemOperand(elements, HeapObject::kMapOffset)); 108 // Probe the string dictionary in the |elements| register. Jump to the 114 Register elements, 124 __ ldr(scratch1, FieldMemOperand(elements, kCapacityOffset)); 155 __ add(scratch2, elements, Operand(scratch2, LSL, 2)); 169 // elements: Property dictionary. It is not clobbered if a jump to the mis 1443 Register elements = r3; \/\/ Elements array of the receiver. local [all...] |
/external/guava/src/com/google/common/collect/ |
Multiset.java | 31 * may have duplicate elements. A multiset is also sometimes called a 34 * <p>Elements of a multiset that are equal to one another (see "Note on 51 * #elementSet} contains the distinct elements of the multiset "with duplicates 60 * given initial elements. This is simply a refinement of {@code Collection}'s 114 * implementation does not permit null elements. Note that if {@code 144 * implementation does not permit null elements. Note that if {@code 165 * implementation does not permit null elements. Note that if {@code 174 * Returns the set of distinct elements contained in this multiset. The 176 * either is immediately reflected in the other. The order of the elements in 185 * elements in the multiset: {@code elementSet().size()} [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
LinkedBlockingQueue.java | 24 * This queue orders elements FIFO (first-in-first-out). 28 * queue the shortest time. New elements 30 * operations obtain elements at the head of the queue. 46 * @param <E> the type of elements held in this collection 108 /** Current number of elements */ 237 * {@link Integer#MAX_VALUE}, initially containing the elements of the 241 * @param c the collection of elements to initially contain 243 * of its elements are null 269 * Returns the number of elements in this queue. 271 * @return the number of elements in this queu [all...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_set.h | 134 * @brief Default constructor creates no elements. 140 * @brief Creates a %set with no elements. 154 * Create a %set consisting of copies of the elements from [first,last). 170 * Create a %set consisting of copies of the elements from [first,last). 208 * Create a %set consisting of copies of the elements in the list. 223 * All the elements of @a x are copied, but unlike the copy constructor, 254 * This function fills a %set with copies of the elements in the 259 * of elements assigned. Old data may be lost. 378 * This exchanges the elements between two sets in constant time. 440 * of elements [all...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_set.h | 134 * @brief Default constructor creates no elements. 140 * @brief Creates a %set with no elements. 154 * Create a %set consisting of copies of the elements from [first,last). 170 * Create a %set consisting of copies of the elements from [first,last). 208 * Create a %set consisting of copies of the elements in the list. 223 * All the elements of @a x are copied, but unlike the copy constructor, 254 * This function fills a %set with copies of the elements in the 259 * of elements assigned. Old data may be lost. 378 * This exchanges the elements between two sets in constant time. 440 * of elements [all...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_set.h | 134 * @brief Default constructor creates no elements. 140 * @brief Creates a %set with no elements. 154 * Create a %set consisting of copies of the elements from [first,last). 170 * Create a %set consisting of copies of the elements from [first,last). 208 * Create a %set consisting of copies of the elements in the list. 223 * All the elements of @a x are copied, but unlike the copy constructor, 254 * This function fills a %set with copies of the elements in the 259 * of elements assigned. Old data may be lost. 378 * This exchanges the elements between two sets in constant time. 440 * of elements [all...] |
/cts/tools/dex-tools/src/dex/structure/ |
WithModifiers.java | 22 * {@link WithModifiers} is implemented by all language elements that have
|
/dalvik/vm/mterp/c/ |
OP_NEW_ARRAY.cpp | 12 ILOGV("|new-array v%d,v%d,class@0x%04x (%d elements)",
|
OP_NEW_ARRAY_JUMBO.cpp | 12 ILOGV("|new-array/jumbo v%d,v%d,class@0x%08x (%d elements)",
|