| /dalvik/libcore/security/src/main/java/java/security/ |
| PermissionsHash.java | 55 public Enumeration elements() { method in class:PermissionsHash
56 return perms.elements();
70 for (Enumeration elements = elements(); elements.hasMoreElements();) {
71 if (((Permission)elements.nextElement()).implies(permission)) {
|
| /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/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 NodeList* collection = new V8NamedNodesCollection(elements);
[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...] |
| 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...] |
| 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...] |
| 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...] |
| /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);
|
| Sets.java | 48 * Creates a {@code HashSet} instance containing the given elements.
60 * @param elements the elements that the set should contain
61 * @return a newly-created {@code HashSet} containing those elements (minus
64 public static <E> HashSet<E> newHashSet(E... elements) {
65 int capacity = elements.length * 4 / 3 + 1;
67 Collections.addAll(set, elements);
81 * Creates a {@code SortedSet} instance containing the given elements.
83 * @param elements the elements that the set should contai
[all...] |
| /external/webkit/WebCore/platform/network/curl/ |
| FormDataStreamCurl.cpp | 52 Vector<FormDataElement> elements;
54 elements = m_resourceHandle->request().httpBody()->elements();
56 if (m_formDataElementIndex >= elements.size())
59 FormDataElement element = elements[m_formDataElementIndex];
106 Vector<FormDataElement> elements; local
108 elements = m_resourceHandle->request().httpBody()->elements();
110 return m_formDataElementIndex < elements.size();
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| 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/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 | 30 elements(NULL)
39 elements(0)
54 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
55 if (elements == 0) {
63 uprv_free(elements);
64 elements = 0;
74 elements[i] = other.elements[i];
84 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...] |
| /dalvik/vm/native/ |
| java_lang_Throwable.c | 48 ArrayObject* elements = NULL; local
55 elements = dvmGetStackTrace(stackState);
56 RETURN_PTR(elements);
|
| /external/libffi/testsuite/libffi.call/ |
| pyobjc-tc.c | 50 point_type.elements = malloc(3 * sizeof(ffi_type*));
51 point_type.elements[0] = &ffi_type_float;
52 point_type.elements[1] = &ffi_type_float;
53 point_type.elements[2] = NULL;
58 size_type.elements = malloc(3 * sizeof(ffi_type*));
59 size_type.elements[0] = &ffi_type_float;
60 size_type.elements[1] = &ffi_type_float;
61 size_type.elements[2] = NULL;
66 rect_type.elements = malloc(3 * sizeof(ffi_type*));
67 rect_type.elements[0] = &point_type
[all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| CopyOnWriteArrayList.java | 48 * <p>All elements are permitted, including <tt>null</tt>.
59 * @param <E> the type of elements held in this collection
94 * Creates a list containing the elements of the specified
98 * @param c the collection of initially held elements
102 Object[] elements = c.toArray(); local
104 if (elements.getClass() != Object[].class)
105 elements = Java6Arrays.copyOf(elements, elements.length, Object[].class);
106 setArray(elements);
198 Object[] elements = getArray(); local
206 Object[] elements = getArray(); local
226 Object[] elements = getArray(); local
234 Object[] elements = getArray(); local
255 Object[] elements = getArray(); local
290 Object[] elements = getArray(); local
335 Object[] elements = getArray(); local
373 Object[] elements = getArray(); local
401 Object[] elements = getArray(); local
423 Object[] elements = getArray(); local
456 Object[] elements = getArray(); local
492 Object[] elements = getArray(); local
539 Object[] elements = getArray(); local
572 Object[] elements = getArray(); local
600 Object[] elements = getArray(); local
627 Object[] elements = getArray(); local
667 Object[] elements = getArray(); local
708 Object[] elements = getArray(); local
759 Object[] elements = getArray(); local
791 Object[] elements = getArray(); local
831 Object[] elements = getArray(); local
856 Object[] elements = new Object[len]; local
901 Object[] elements = getArray(); local
920 Object[] elements = getArray(); local
966 Object[] elements = getArray(); local
1062 Object[] elements = getArray(); local
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| IntSet.java | 55 * Returns the count of unique elements in this set.
57 * @return {@code > = 0;} count of unique elements
59 int elements(); method in interface:IntSet
|
| /dalvik/libcore/support/src/test/java/org/apache/harmony/security/tests/support/acl/ |
| AclEnumerator.java | 33 u1 = hashtable.elements();
34 u2 = hashtable2.elements();
35 g1 = hashtable1.elements();
36 g2 = hashtable3.elements();
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnSentence.java | 30 public ArrayList<WnnClause> elements; field in class:WnnSentence
47 this.elements = clauses;
90 this.elements = new ArrayList<WnnClause>();
91 this.elements.add(clause);
108 this.elements = new ArrayList<WnnClause>();
109 this.elements.addAll(prev.elements);
110 this.elements.add(clause);
128 this.elements = new ArrayList<WnnClause>();
129 this.elements.add(head)
[all...] |
| /dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/lang/annotation/ |
| AnnotationFactory.java | 93 * @param elements name-value pairs representing elements of the annotation
98 AnnotationMember[] elements)
100 AnnotationFactory antn = new AnnotationFactory(annotationType, elements);
106 private AnnotationMember[] elements; field in class:AnnotationFactory
120 elements = defs;
123 elements = new AnnotationMember[defs.length];
124 next: for (int i = elements.length - 1; i >= 0; i-- ){
127 elements[i] = val.setDefinition(defs[i]);
131 elements[i] = defs[i]
[all...] |
| /dalvik/dx/src/com/android/dx/rop/annotation/ |
| Annotation.java | 51 private final TreeMap<CstUtf8, NameValuePair> elements; field in class:Annotation
54 * Construct an instance. It initially contains no elements.
70 this.elements = new TreeMap<CstUtf8, NameValuePair>();
87 return elements.equals(otherAnnotation.elements);
93 hash = (hash * 31) + elements.hashCode();
112 Iterator<NameValuePair> thisIter = elements.values().iterator();
113 Iterator<NameValuePair> otherIter = other.elements.values().iterator();
150 for (NameValuePair pair : elements.values()) {
197 elements.put(pair.getName(), pair)
[all...] |
| /system/core/nexus/ |
| VpnController.cpp | 52 int elements) :
53 IntegerProperty(name, ro, elements) {
59 bool ro, int elements) :
60 StringProperty(name, ro, elements) {
66 bool ro, int elements) :
67 IPV4AddressProperty(name, ro, elements) {
|
