Searched defs:elements (Results 1 - 21 of 21) sorted by relevance

/libcore/luni/src/main/java/java/security/
H A DAllPermissionCollection.java28 @Override public Enumeration<Permission> elements() { return null; } method in class:AllPermissionCollection
H A DPermissions.java29 public Enumeration<Permission> elements() { return null; } method in class:Permissions
H A DPermissionCollection.java32 public abstract Enumeration<Permission> elements(); method in class:PermissionCollection
H A DPermissionsHash.java53 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)) {
/libcore/luni/src/main/java/java/util/
H A DDictionary.java38 * Returns an enumeration on the elements of this dictionary.
45 public abstract Enumeration<V> elements(); method in class:Dictionary
71 * @see #elements
88 * @see #elements
111 * @see #elements
H A DEnumSet.java34 * Creates an empty enum set. The permitted elements are of type
38 * the class object for the elements contained.
39 * @return an empty enum set, with permitted elements of type {@code
56 * Creates an enum set filled with all the enum elements of the specified
60 * the class object for the elements contained.
61 * @return an enum set with elements solely from the specified element type.
72 * Creates an enum set. All the contained elements are of type
73 * Class&lt;E&gt;, and the contained elements are the same as those
78 * @return an enum set with all the elements from the specified enum set.
89 * Creates an enum set. The contained elements ar
325 private E[] elements; field in class:EnumSet.SerializationProxy
[all...]
H A DArrayDeque.java17 * Null elements are prohibited. This class is likely to be faster than
51 * @param <E> the type of elements held in this collection
57 * The array in which the elements of the deque are stored.
64 * deque elements are always null.
66 private transient Object[] elements; field in class:ArrayDeque
90 * Allocate empty array to hold the given number of elements.
92 * @param numElements the number of elements to hold
96 // Find the best power of two to hold elements.
107 if (initialCapacity < 0) // Too many elements, must back off
108 initialCapacity >>>= 1;// Good luck allocating 2 ^ 30 elements
[all...]
H A DPriorityQueue.java24 * 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 i
[all...]
H A DVector.java27 * All optional operations including adding, removing, and replacing elements are supported.
29 * <p>All elements are permitted, including null.
45 * The number of elements or the size of the vector.
50 * The elements of the vector.
55 * How many elements should be added to the vector when it is detected that
103 * Constructs a new instance of {@code Vector} containing the elements in
104 * {@code collection}. The order of the elements in the new {@code Vector}
108 * the collection of elements to add.
163 * returned from the Collection iterator. The elements with an index equal
229 * Returns the number of elements thi
309 copyInto(Object[] elements) argument
339 public Enumeration<E> elements() { method in class:Vector
[all...]
H A DHashtable.java176 * Inserts all of the elements of map into this Hashtable in a manner
212 * the elements in the map.
247 * @see #elements
353 * @see #elements
631 * @see #elements
649 public synchronized Enumeration<V> elements() { method in class:Hashtable
/libcore/support/src/test/java/tests/support/
H A DSupport_Exec.java63 * Returns a command-line ready path formed by joining the path elements
66 public static String createPath(String... elements) { argument
68 for (String element : elements) {
/libcore/luni/src/main/java/libcore/reflect/
H A DAnnotationFactory.java89 * @param elements name-value pairs representing elements of the annotation
93 AnnotationMember[] elements) {
94 AnnotationFactory factory = new AnnotationFactory(annotationType, elements);
100 private AnnotationMember[] elements; field in class:AnnotationFactory
114 elements = defs;
117 elements = new AnnotationMember[defs.length];
118 next: for (int i = elements.length - 1; i >= 0; i--) {
121 elements[i] = val.setDefinition(defs[i]);
125 elements[
92 createAnnotation(Class<? extends Annotation> annotationType, AnnotationMember[] elements) argument
[all...]
/libcore/json/src/test/java/org/json/
H A DParsingTest.java220 private JSONArray array(Object... elements) { argument
221 return new JSONArray(Arrays.asList(elements));
/libcore/luni/src/test/java/libcore/java/lang/reflect/
H A DMethodOverridesTest.java174 private <T> void assertContains(Collection<T> elements, T value) { argument
175 assertTrue("Expected " + value + " in " + elements, elements.contains(value));
/libcore/luni/src/test/java/tests/api/java/util/
H A DAbstractQueueTest.java39 private Object[] elements = new Object[CAPACITY]; field in class:AbstractQueueTest.MockAbstractQueue
55 return (E) elements[currentIndex];
63 elements[i] = elements[i + 1];
83 elements[size++] = o;
91 E e = (E) elements[0];
93 elements[i] = elements[i + 1];
103 return (E) elements[0];
/libcore/luni/src/main/java/java/sql/
H A DConnection.java827 * Returns a new {@link Array} containing the given {@code elements}.
828 * @param typeName the SQL name of the type of the array elements
832 public Array createArrayOf(String typeName, Object[] elements) throws SQLException; argument
/libcore/luni/src/main/java/java/util/concurrent/
H A DCopyOnWriteArrayList.java77 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...]
H A DConcurrentHashMap.java35 * Enumerations return elements reflecting the state of the hash table
80 * well as elements of segment's table must use volatile access,
84 * volatile-writes of table elements and entry "next" fields
298 * The number of elements. Accessed only either within locks
385 * are using power-of-two expansion, the elements from
691 * performs internal sizing to accommodate this many elements.
693 * Resizing may be performed when the average number of elements per
740 * sizing to accommodate this many elements.
742 * Resizing may be performed when the average number of elements per
745 * elements i
1204 public Enumeration<V> elements() { method in class:ConcurrentHashMap
[all...]
/libcore/luni/src/main/java/javax/security/auth/
H A DSubject.java502 private LinkedList<SST> elements; field in class:Subject.SecureSet
537 elements = new LinkedList<SST>();
541 // all collection elements are verified before adding
551 if (trust || !elements.contains(o)) {
552 elements.add(o);
579 if (!elements.contains(o)) {
580 elements.add(o);
595 return new SecureIterator(elements.iterator()) {
607 return new SecureIterator(elements.iterator());
621 return elements
[all...]
/libcore/luni/src/test/java/libcore/java/net/
H A DURLConnectionTest.java2374 private Set<String> newSet(String... elements) { argument
2375 return new HashSet<String>(Arrays.asList(elements));
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 821 milliseconds