| /libcore/luni/src/main/java/java/util/ |
| ArrayDeque.java | 19 * Null elements are prohibited. This class is likely to be faster than
53 * @param <E> the type of elements held in this collection
59 * The array in which the elements of the deque are stored.
66 * deque elements are always null.
68 private transient E[] elements; field in class:ArrayDeque
92 * Allocate empty array to hold the given number of elements.
94 * @param numElements the number of elements to hold
98 // Find the best power of two to hold elements.
109 if (initialCapacity < 0) // Too many elements, must back off
110 initialCapacity >>>= 1;// Good luck allocating 2 ^ 30 elements
502 final E[] elements = this.elements; local
[all...] |
| /external/webkit/LayoutTests/fast/dom/Node/ |
| normalize-expected.txt | 4 test3 (non-empty text nodes mixed with elements): PASSED
6 test5 (empty text node between elements): PASSED
10 test9 (empty and non-empty text nodes mixed with elements): PASSED
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| valarray_array.tcc | 55 // Copy n elements of a into consecutive elements of b. When m is
57 // at least n true elements. a must contain at least n elements and
58 // enough elements to match up with m through the nth true element
59 // of m. I.e. if n is 10, m has 15 elements with 5 false followed
60 // by 10 true, a must have 15 elements.
80 // Copy n consecutive elements from a into elements of b. Elements
[all...] |
| gslice_array.h | 48 * A gslice_array is a reference to the actual elements of an array
51 * permits carrying operations out on the referenced subset of elements in
53 * values to the subset of elements in the underlying valarray this
70 /// Assignment operator. Assigns slice elements to corresponding
71 /// elements of @a a.
74 /// Assign slice elements to corresponding elements of @a v.
76 /// Multiply slice elements by corresponding elements of @a v.
78 /// Divide slice elements by corresponding elements of @a v
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| valarray_array.tcc | 55 // Copy n elements of a into consecutive elements of b. When m is
57 // at least n true elements. a must contain at least n elements and
58 // enough elements to match up with m through the nth true element
59 // of m. I.e. if n is 10, m has 15 elements with 5 false followed
60 // by 10 true, a must have 15 elements.
80 // Copy n consecutive elements from a into elements of b. Elements
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| valarray_array.tcc | 55 // Copy n elements of a into consecutive elements of b. When m is
57 // at least n true elements. a must contain at least n elements and
58 // enough elements to match up with m through the nth true element
59 // of m. I.e. if n is 10, m has 15 elements with 5 false followed
60 // by 10 true, a must have 15 elements.
80 // Copy n consecutive elements from a into elements of b. Elements
[all...] |
| /external/icu4c/common/ |
| uvector.cpp | 32 elements(0),
42 elements(0),
52 elements(0),
62 elements(0),
77 elements = (UHashTok *)uprv_malloc(sizeof(UHashTok)*initialCapacity);
78 if (elements == 0) {
87 uprv_free(elements);
88 elements = 0;
100 if (elements[i].pointer != 0 && deleter != 0) {
101 (*deleter)(elements[i].pointer)
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| CopyOnWriteArrayList.java | 77 private transient volatile Object[] elements; field in class:CopyOnWriteArrayList
83 elements = EmptyArray.OBJECT;
87 * Creates a new instance containing the elements of {@code collection}.
95 * Creates a new instance containing the elements of {@code array}.
98 this.elements = Arrays.copyOf(array, array.length, Object[].class);
104 result.elements = result.elements.clone();
112 return elements.length;
117 return (E) elements[index];
125 Object[] snapshot = elements;
[all...] |
| /external/guava/src/com/google/common/collect/ |
| ImmutableSortedSet.java | 36 * An immutable {@code SortedSet} that stores its elements in a sorted array.
38 * natural sort ordering of their elements. Either way, null elements are not
58 * two elements are equivalent. Instead, with an explicit comparator, the
59 * following relation determines whether elements {@code x} and {@code y} are
64 * With natural ordering of elements, the following relation determines whether
65 * two elements are equivalent: <pre> {@code
126 * Returns an immutable sorted set containing the given elements sorted by
127 * their natural ordering. When multiple elements are equivalent according to
139 * Returns an immutable sorted set containing the given elements sorted b
661 final Object[] elements; field in class:ImmutableSortedSet.SerializedForm
[all...] |
| ImmutableList.java | 37 * Does not permit null elements.
64 // Casting to any type is safe because the list will never hold any elements.
188 * Returns an immutable list containing the given elements, in order.
190 * @throws NullPointerException if any of {@code elements} is null
192 public static <E> ImmutableList<E> of(E... elements) {
193 checkNotNull(elements); // for GWT
194 switch (elements.length) {
198 return new SingletonImmutableList<E>(elements[0]);
200 return new RegularImmutableList<E>(copyIntoArray(elements));
205 * Returns an immutable list containing the given elements, in order. I
268 Object[] elements = collection.toArray(); local
365 final Object[] elements; field in class:ImmutableList.SerializedForm
[all...] |
| RegularImmutableSortedSet.java | 30 * An immutable sorted set with one or more elements.
40 private final Object[] elements; field in class:RegularImmutableSortedSet
52 RegularImmutableSortedSet(Object[] elements,
55 this.elements = elements;
57 this.toIndex = elements.length;
60 RegularImmutableSortedSet(Object[] elements,
63 this.elements = elements;
72 Iterators.forArray(elements, fromIndex, size())
[all...] |
| /external/llvm/test/Assembler/ |
| 2003-05-21-MalformedStructCrash.ll | 2 ; RUN: not llvm-as < %s > /dev/null |& grep {initializer with struct type has wrong # elements}
|
| /external/webkit/LayoutTests/fast/dom/HTMLFormElement/ |
| htmlformelement-indexed-getter-expected.txt | 1 This test verifies that elements can be fetched by index from HTMLFormElements.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/testdata/ |
| color1-expected-completion45.txt | 2 <selector ></selector> : Required. This must be the root element. Contains one or more <item> elements.
|
| /external/clang/test/SemaCXX/ |
| for-range-unused.cpp | 10 for (auto& e : elements)
14 T elements[10]; member in struct:Vector
|
| /external/javassist/src/main/javassist/bytecode/ |
| LongVector.java | 23 private int elements; field in class:LongVector
27 elements = 0;
33 elements = 0;
36 public int size() { return elements; }
41 if (i < 0 || elements <= i)
48 int nth = elements >> ABITS;
49 int offset = elements & (ASIZE - 1);
61 elements++;
|
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 30 /// storing the elements that have non-zero bits set. In order to make this
289 ElementList Elements;
295 if (Elements.empty()) {
296 CurrElementIter = Elements.begin();
297 return Elements.begin();
301 if (CurrElementIter == Elements.end())
310 while (ElementIter != Elements.begin()
314 while (ElementIter != Elements.end() &&
346 if (BitVector->Elements.empty()) {
350 Iter = BitVector->Elements.begin()
[all...] |
| /frameworks/base/graphics/java/android/graphics/drawable/ |
| package.html | 3 <p>Provides classes to manage a variety of visual elements that are intended for
4 display only, such as bitmaps and gradients. These elements are often used
|
| /cts/tools/signature-tools/src/signature/model/impl/ |
| SigAnnotation.java | 30 private Set<IAnnotationElement> elements; field in class:SigAnnotation
34 elements = Collections.emptySet();
46 return elements;
49 public void setElements(Set<IAnnotationElement> elements) {
50 this.elements = elements;
|
| /external/antlr/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.java | 33 /** A generic list of elements tracked in an alternative to be used in
38 * Once you start next()ing, do not try to add more elements. It will
48 * which bumps it to 1 meaning no more elements.
52 /** Track single elements w/o creating a list. Upon 2nd add, alloc list */
56 protected List elements; field in class:RewriteRuleElementStream
94 List elements)
98 this.elements = elements;
102 * not consumed any of its elements. Elements themselves are untouched
[all...] |
| /external/collada/include/1.4/dom/ |
| domCOLLADA.h | 55 * base of the scene hierarchy or scene graph. The scene contains elements
66 protected: // Elements
87 * @return Returns a reference to the array of instance_physics_scene elements.
92 * @return Returns a constant reference to the array of instance_physics_scene elements.
102 * @return Returns a reference to the array of extra elements.
107 * @return Returns a constant reference to the array of extra elements.
155 protected: // Elements
161 * The COLLADA element may contain any number of library_animations elements.
167 * elements. @see domLibrary_animation_clips
171 * The COLLADA element may contain any number of library_cameras elements
[all...] |
| domNode.h | 33 * Nodes embody the hierarchical relationship of elements in the scene.
72 protected: // Elements
78 * The node element may contain any number of lookat elements. @see domLookat
82 * The node element may contain any number of matrix elements. @see domMatrix
86 * The node element may contain any number of rotate elements. @see domRotate
90 * The node element may contain any number of scale elements. @see domScale
94 * The node element may contain any number of skew elements. @see domSkew
98 * The node element may contain any number of translate elements. @see domTranslate
119 * The node element may instance any number of node elements or hierarchies
125 * other node elements. @see domNod
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| partition.h | 23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
51 /* The next element in this class. Elements in each class form a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| partition.h | 23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
51 /* The next element in this class. Elements in each class form a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
| partition.h | 23 elements are partitioned into classes. Each class is represented
24 by one of its elements, the canonical element, which is chosen
25 arbitrarily from elements in the class. The principal operations
28 which unites the two classes that contain two given elements into a
51 /* The next element in this class. Elements in each class form a
54 /* The number of elements in this class. Valid only if this is the
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
64 struct partition_elem elements[1]; member in struct:partition_def
76 ((partition__)->elements[(element__)].class_element
[all...] |
