| /external/webkit/Source/WebCore/editing/ |
| RemoveFormatCommand.cpp | 48 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, elements, ());
49 if (elements.isEmpty()) {
50 elements.add(acronymTag);
51 elements.add(bTag);
52 elements.add(bdoTag);
53 elements.add(bigTag);
54 elements.add(citeTag);
55 elements.add(codeTag);
56 elements.add(dfnTag);
57 elements.add(emTag)
[all...] |
| /libcore/luni/src/main/java/java/security/ |
| PermissionsHash.java | 53 public Enumeration elements() { method in class:PermissionsHash
54 return perms.elements();
68 for (Enumeration elements = elements(); elements.hasMoreElements();) {
69 if (((Permission)elements.nextElement()).implies(permission)) {
|
| /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/flac/libFLAC/include/private/ |
| memory.h | 48 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer);
49 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer);
50 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer);
51 FLAC__bool FLAC__memory_alloc_aligned_unsigned_array(unsigned elements, unsigned **unaligned_pointer, unsigned **aligned_pointer);
53 FLAC__bool FLAC__memory_alloc_aligned_real_array(unsigned elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer);
|
| /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...] |
| /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...] |
| PriorityQueue.java | 24 * A PriorityQueue holds elements on a priority heap, which orders the elements
26 * construction time. If the queue uses natural ordering, only elements that are
49 private transient E[] elements; field in class:PriorityQueue
87 elements = newElementArray(initialCapacity);
92 * Constructs a priority queue that contains the elements of a collection.
95 * elements.
98 * the collection whose elements will be added to the priority
101 * if any of the elements in the collection are not comparable.
103 * if any of the elements in the collection are null
[all...] |
| /external/stlport/test/unit/ |
| count_test.cpp | 49 int elements = count(numbers.begin(), numbers.end(), 2); local
50 CPPUNIT_ASSERT(elements==33);
52 elements = 0;
53 count(numbers.begin(), numbers.end(), 2, elements);
54 CPPUNIT_ASSERT(elements==33);
62 int elements = count_if(numbers.begin(), numbers.end(), odd); local
63 CPPUNIT_ASSERT(elements==33);
65 elements = 0;
66 count_if(numbers.begin(), numbers.end(), odd, elements);
67 CPPUNIT_ASSERT(elements==33)
[all...] |
| /external/webkit/Source/WebCore/bindings/v8/custom/ |
| V8HTMLFormElementCustom.cpp | 49 RefPtr<Node> formElement = form->elements()->item(index);
65 Vector<RefPtr<Node> > elements; local
66 imp->getNamedElements(v, elements);
67 if (elements.isEmpty())
73 Vector<RefPtr<Node> > elements; local
74 imp->getNamedElements(v, elements);
75 ASSERT(!elements.isEmpty());
77 if (elements.size() == 1)
78 return toV8(elements.at(0).release());
80 return toV8(V8NamedNodesCollection::create(elements));
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| count_test.cpp | 49 int elements = count(numbers.begin(), numbers.end(), 2); local
50 CPPUNIT_ASSERT(elements==33);
52 elements = 0;
53 count(numbers.begin(), numbers.end(), 2, elements);
54 CPPUNIT_ASSERT(elements==33);
62 int elements = count_if(numbers.begin(), numbers.end(), odd); local
63 CPPUNIT_ASSERT(elements==33);
65 elements = 0;
66 count_if(numbers.begin(), numbers.end(), odd, elements);
67 CPPUNIT_ASSERT(elements==33)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| count_test.cpp | 49 int elements = count(numbers.begin(), numbers.end(), 2); local
50 CPPUNIT_ASSERT(elements==33);
52 elements = 0;
53 count(numbers.begin(), numbers.end(), 2, elements);
54 CPPUNIT_ASSERT(elements==33);
62 int elements = count_if(numbers.begin(), numbers.end(), odd); local
63 CPPUNIT_ASSERT(elements==33);
65 elements = 0;
66 count_if(numbers.begin(), numbers.end(), odd, elements);
67 CPPUNIT_ASSERT(elements==33)
[all...] |
| /external/antlr/src/org/antlr/runtime/debug/ |
| RemoteDebugEventSocketListener.java | 254 String[] elements = getEventElements(line); local
255 if ( elements==null || elements[0]==null ) {
259 if ( elements[0].equals("enterRule") ) {
260 listener.enterRule(elements[1], elements[2]);
262 else if ( elements[0].equals("exitRule") ) {
263 listener.exitRule(elements[1], elements[2]);
265 else if ( elements[0].equals("enterAlt") )
481 String[] elements = new String[MAX_EVENT_ELEMENTS]; local
[all...] |
| /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/guava/src/com/google/common/collect/ |
| ImmutableSet.java | 36 * iteration order. Does not permit null elements.
74 // Casting to any type is safe because the set will never hold any elements.
93 * Returns an immutable set containing the given elements, in order. Repeated
105 * Returns an immutable set containing the given elements, in order. Repeated
117 * Returns an immutable set containing the given elements, in order. Repeated
129 * Returns an immutable set containing the given elements, in order. Repeated
141 * Returns an immutable set containing the given elements, in order. Repeated
146 * @throws NullPointerException if any of {@code elements} is null
148 public static <E> ImmutableSet<E> of(E... elements) {
149 checkNotNull(elements); // for GW
259 List<E> elements = new ArrayList<E>(count); local
294 final transient Object[] elements; field in class:ImmutableSet.ArrayImmutableSet
425 final Object[] elements; field in class:SerializedForm
[all...] |
| ImmutableCollection.java | 29 * An immutable collection. Does not permit null elements.
32 * #asList()} method, which returns a list view of the collection's elements.
51 * Returns an unmodifiable iterator across the elements in this collection.
221 private final E[] elements; field in class:ImmutableCollection.ArrayImmutableCollection
223 ArrayImmutableCollection(E[] elements) {
224 this.elements = elements;
228 return elements.length;
236 return Iterators.forArray(elements);
245 final Object[] elements; field in class:ImmutableCollection.SerializedForm
[all...] |
| /frameworks/base/core/java/com/google/android/collect/ |
| Lists.java | 42 * elements.
55 * @param elements the elements that the list should contain, in order
56 * @return a newly-created {@code ArrayList} containing those elements
58 public static <E> ArrayList<E> newArrayList(E... elements) {
59 int capacity = (elements.length * 110) / 100 + 5;
61 Collections.addAll(list, elements);
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_pasteboard_helper_mac.h | 17 // Writes a set of bookmark elements from a profile to the general pasteboard.
19 void WriteToClipboard(const std::vector<BookmarkNodeData::Element>& elements,
22 // Writes a set of bookmark elements from a profile to the dragging pasteboard
25 const std::vector<BookmarkNodeData::Element>& elements,
28 // Reads a set of bookmark elements from the general copy/paste clipboard.
29 bool ReadFromClipboard(std::vector<BookmarkNodeData::Element>& elements,
32 // Reads a set of bookmark elements from the drag and drop clipboard.
33 bool ReadFromDragClipboard(std::vector<BookmarkNodeData::Element>& elements,
37 // bookmark elements. It currently does not consider a plaintext url a
42 // elements
[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/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...] |
| uvectr32.cpp | 31 elements(NULL)
40 elements(0)
58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
59 if (elements == 0) {
67 uprv_free(elements);
68 elements = 0;
78 elements[i] = other.elements[i];
88 if (elements[i] != other.elements[i])
[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...] |
| /external/flac/libFLAC/ |
| memory.c | 74 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer)
82 FLAC__ASSERT(elements > 0);
87 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */
90 pu = (FLAC__int32*)FLAC__memory_alloc_aligned(sizeof(*pu) * (size_t)elements, &u.pv);
103 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer)
111 FLAC__ASSERT(elements > 0);
116 if((size_t)elements > SIZE_MAX / sizeof(*pu)) /* overflow check */
119 pu = (FLAC__uint32*)FLAC__memory_alloc_aligned(sizeof(*pu) * elements, &u.pv);
132 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer)
140 FLAC__ASSERT(elements > 0)
[all...] |
