Searched defs:elements (Results 151 - 175 of 543) sorted by relevance

1234567891011>>

/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src/org/eclipse/releng/generators/
H A DVersionTrackerTask.java35 private Hashtable elements; field in class:VersionTrackerTask
66 elements = new Hashtable();
136 elements.put(element,element+"_"+version);
146 Enumeration keys = elements.keys();
150 writer.println(key.toString()+"="+elements.get(key).toString());
/external/guava/guava/src/com/google/common/collect/
H A DConcurrentHashMultiset.java45 * {@code Multiset} operations (exceptions where noted). Null elements are not supported.
85 * Creates a new {@code ConcurrentHashMultiset} containing the specified elements, using
88 * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.
90 * @param elements the elements that the multiset should contain
92 public static <E> ConcurrentHashMultiset<E> create(Iterable<? extends E> elements) { argument
94 Iterables.addAll(multiset, elements);
125 * Creates an instance using {@code countMap} to store elements and their counts.
130 * @param countMap backing map for storing the elements in the multiset and
568 * @serialData the ConcurrentMap of elements an
[all...]
H A DForwardingList.java70 public boolean addAll(int index, Collection<? extends E> elements) { argument
71 return delegate().addAll(index, elements);
144 int index, Iterable<? extends E> elements) {
145 return Lists.addAllImpl(this, index, elements);
143 standardAddAll( int index, Iterable<? extends E> elements) argument
H A DMultiset.java31 * may have duplicate elements. A multiset is also sometimes called a
51 * #elementSet} contains the distinct elements of the multiset "with duplicates
60 * given initial elements. This is simply a refinement of {@code Collection}'s
122 * implementation does not permit null elements. Note that if {@code
152 * implementation does not permit null elements. Note that if {@code
173 * implementation does not permit null elements. Note that if {@code
182 * Returns the set of distinct elements contained in this multiset. The
184 * either is immediately reflected in the other. The order of the elements in
193 * elements in the multiset: {@code elementSet().size()}.
195 * @return a view of the set of distinct elements i
369 containsAll(Collection<?> elements) argument
[all...]
H A DRegularImmutableSortedSet.java39 * An immutable sorted set with one or more elements. TODO(jlevy): Consider
49 private transient final ImmutableList<E> elements; field in class:RegularImmutableSortedSet
52 ImmutableList<E> elements, Comparator<? super E> comparator) {
54 this.elements = elements;
55 checkArgument(!elements.isEmpty());
59 return elements.iterator();
68 return elements.size();
139 return Collections.binarySearch(elements, key, unsafeComparator);
143 return elements
51 RegularImmutableSortedSet( ImmutableList<E> elements, Comparator<? super E> comparator) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DImmutableCollection.java147 public Builder<E> add(E... elements) { argument
148 checkNotNull(elements); // for GWT
149 for (E element : elements) {
155 public Builder<E> addAll(Iterable<? extends E> elements) { argument
156 checkNotNull(elements); // for GWT
157 for (E element : elements) {
163 public Builder<E> addAll(Iterator<? extends E> elements) { argument
164 checkNotNull(elements); // for GWT
165 while (elements.hasNext()) {
166 add(checkNotNull(elements
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DAbstractContainerTester.java27 * and {@link java.util.Map Map}) that contain elements.
84 * @param elements expected contents of {@link #container}
86 protected final void expectContents(E... elements) { argument
87 expectContents(Arrays.asList(elements));
91 * Asserts that the collection under test contains exactly the given elements,
117 * Asserts that the collection under test contains exactly the elements it was
118 * initialized with plus the given elements, according to
122 * created, and the number of occurrences of all other elements has not
136 * @param elements expected additional contents of {@link #container}
138 protected final void expectAdded(E... elements) { argument
144 expectAdded(int index, E... elements) argument
148 expectAdded(int index, Collection<E> elements) argument
160 expectMissing(E... elements) argument
174 public final E[] elements; field in class:AbstractContainerTester.ArrayWithDuplicate
177 ArrayWithDuplicate(E[] elements, E duplicate) argument
[all...]
H A DAbstractMapTester.java60 protected void expectMissingKeys(K... elements) { argument
61 for (K element : elements) {
67 protected void expectMissingValues(V... elements) { argument
68 for (V element : elements) {
H A DMapTestSuiteBuilder.java196 public Set<Map.Entry<K, V>> create(Object... elements) { argument
197 return mapGenerator.create(elements).entrySet();
240 public Set<K> create(Object... elements) { argument
242 K[] keysArray = (K[]) elements;
246 mapGenerator.getSampleElements(elements.length);
250 new ArrayList<Entry<K, V>>(elements.length);
301 public Collection<V> create(Object... elements) { argument
303 V[] valuesArray = (V[]) elements;
307 mapGenerator.getSampleElements(elements.length);
311 new ArrayList<Entry<K, V>>(elements
[all...]
H A DNavigableMapTestSuiteBuilder.java103 * Creates a suite whose map has some elements filtered out of view.
124 @SuppressWarnings("unchecked") // no elements are inserted into the array
189 * Returns an array of four bogus elements that will always be too high or
258 public Map<K, V> create(Object... elements) { argument
259 return delegate.create(elements);
H A DTestsForSetsInJavaUtil.java107 @Override public Set<String> create(String[] elements) {
122 @Override public Set<String> create(String[] elements) {
123 return Collections.singleton(elements[0]);
138 @Override public Set<String> create(String[] elements) {
139 return new HashSet<String>(MinimalCollection.of(elements));
154 @Override public Set<String> create(String[] elements) {
155 return new LinkedHashSet<String>(MinimalCollection.of(elements));
171 @Override public Set<AnEnum> create(AnEnum[] elements) {
172 return (elements.length == 0)
174 : EnumSet.copyOf(MinimalCollection.of(elements));
320 dedupe(String[] elements) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DSetGenerators.java57 @Override protected Set<String> create(String[] elements) { argument
58 return ImmutableSet.copyOf(elements);
69 public Set<Object> create(Object... elements) { argument
70 return ImmutableSet.copyOf(elements);
79 @Override protected Set<String> create(String[] elements) { argument
81 ImmutableSet.of(elements[0], elements[0]);
87 @Override protected SortedSet<String> create(String[] elements) { argument
88 return ImmutableSortedSet.copyOf(elements);
94 @Override protected SortedSet<String> create(String[] elements) { argument
104 create(String[] elements) argument
114 create(String[] elements) argument
129 create(String[] elements) argument
147 create(String[] elements) argument
162 create(String[] elements) argument
176 create( UnhashableObject[] elements) argument
184 create(String[] elements) argument
191 create(String[] elements) argument
201 create(String[] elements) argument
215 create(String[] elements) argument
228 create(String[] elements) argument
248 createExplicitComparator( String[] elements) argument
[all...]
H A DSortedMultisetTestSuiteBuilder.java205 * Returns an array of four bogus elements that will always be too high or too
274 public Multiset<E> create(Object... elements) { argument
275 return delegate.create(elements);
/external/guava/guava-tests/test/com/google/common/collect/
H A DImmutableSetTest.java73 @Override protected Set<String> copyOf(String[] elements) { argument
74 return ImmutableSet.copyOf(elements);
77 @Override protected Set<String> copyOf(Collection<String> elements) { argument
78 return ImmutableSet.copyOf(elements);
81 @Override protected Set<String> copyOf(Iterable<String> elements) { argument
82 return ImmutableSet.copyOf(elements);
85 @Override protected Set<String> copyOf(Iterator<String> elements) { argument
86 return ImmutableSet.copyOf(elements);
H A DPeekingIteratorTest.java47 * a given collection of elements (used as the reference iterator)
53 * same elements as the reference's iterator {@code #remove()}.
70 @Override protected void verify(List<T> elements) { argument
72 assertEquals(elements, targetList);
188 * This Iterator claims to have more elements than the underlying
189 * iterable, but when you try to fetch the extra elements, it throws
220 * If the PeekingIterator is caching elements too aggressively,
H A DQueuesTest.java94 int elements = drain(q, buf, 100, Long.MAX_VALUE, TimeUnit.NANOSECONDS, interruptibly);
95 assertEquals(100, elements);
138 // asking to drain zero elements
163 int elements = Queues.drain(q, buf, -1, Long.MAX_VALUE, TimeUnit.NANOSECONDS);
164 assertEquals(elements, 0);
203 int elements =
205 // so when this drains all elements, we know the thread has also been interrupted in between
207 assertEquals(100, elements);
268 final int elements; field in class:QueuesTest.Producer
270 Producer(BlockingQueue<Object> q, int elements) { argument
[all...]
/external/icu/icu4c/source/common/
H A Duvectr32.h67 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 (index >= 0 && count > 0 && count - index > 0) ? elements[index] : 0;
228 elements[count] = elem;
237 int32_t *rp = elements+count;
248 return elements
[all...]
/external/libvorbis/vq/
H A Dvqgen.h26 int elements; member in struct:vqgen
58 return v->pointlist+((v->elements+v->aux)*ptr);
66 return v->entrylist+(v->elements*ptr);
70 int elements,int aux,int entries,float mindist,
/external/mesa3d/src/gallium/auxiliary/vl/
H A Dvl_vertex_buffers.c145 vl_vb_element_helper(struct pipe_vertex_element* elements, unsigned num_elements, argument
150 assert(elements && num_elements);
153 elements[i].src_offset = offset;
154 elements[i].instance_divisor = 1;
155 elements[i].vertex_buffer_index = vertex_buffer_index;
156 offset += util_format_get_blocksize(elements[i].src_format);
/external/mesa3d/src/mesa/vbo/
H A Dvbo_primitive_restart.c74 * Scan the elements array to find restart indexes. Return an array
79 find_sub_primitives(const void *elements, unsigned element_size, argument
101 #define IB_INDEX_READ(TYPE, INDEX) (((const GL##TYPE *) elements)[INDEX])
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DTrie.java51 * @param elements not empty, non null.
53 public Trie(Map<String, Integer> elements) { argument
54 this(sortedUniqEntries(elements), 0);
57 private Trie(List<Map.Entry<String, Integer>> elements, int depth) { argument
58 this(elements, depth, 0, elements.size());
62 * @param elements not empty, non null. Not modified.
70 List<Map.Entry<String, Integer>> elements, int depth,
72 this.terminal = depth == elements.get(start).getKey().length();
74 this.value = elements
69 Trie( List<Map.Entry<String, Integer>> elements, int depth, int start, int end) argument
[all...]
/external/proguard/src/proguard/gui/
H A DListPanel.java89 // Remove the selected elements.
109 // Move the selected elements up.
130 // Move the selected elements down.
159 // Remove the selected elements from this panel.
162 // Add the elements to the other panel.
209 protected void addElements(Object[] elements) argument
211 // Add the elements one by one.
212 for (int index = 0; index < elements.length; index++)
214 listModel.addElement(elements[index]);
218 int[] selectedIndices = new int[elements
247 insertElementsAt(Object[] elements, int[] indices) argument
268 setElementsAt(Object[] elements, int[] indices) argument
[all...]
/external/skia/tests/
H A DLListTest.cpp36 ListElement elements[4]) {
42 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0]));
43 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1]));
44 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2]));
45 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3]));
51 ListElement elements[4] = { local
59 check_list(list, reporter, true, 0, false, false, false, false, elements);
61 list.addToHead(&elements[0]);
63 check_list(list, reporter, false, 1, true, false, false, false, elements);
65 list.addToHead(&elements[
31 check_list(const SkTInternalLList<ListElement>& list, skiatest::Reporter* reporter, bool empty, int numElements, bool in0, bool in1, bool in2, bool in3, ListElement elements[4]) argument
[all...]
/external/smack/src/org/xbill/DNS/
H A DAPLRecord.java90 private List elements; field in class:APLRecord
111 * @param elements The list of APL elements.
114 APLRecord(Name name, int dclass, long ttl, List elements) { argument
116 this.elements = new ArrayList(elements.size());
117 for (Iterator it = elements.iterator(); it.hasNext(); ) {
128 this.elements.add(element);
146 elements = new ArrayList(1);
168 elements
[all...]
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/
H A DEncodedValueWriter.java69 Collection<? extends AnnotationElement> elements) throws IOException {
72 writer.writeUleb128(elements.size());
73 for (AnnotationElement element: elements) {
79 public void writeArray(Collection<? extends EncodedValue> elements) throws IOException { argument
81 writer.writeUleb128(elements.size());
82 for (EncodedValue element: elements) {
68 writeAnnotation(TypeKey annotationType, Collection<? extends AnnotationElement> elements) argument

Completed in 808 milliseconds

1234567891011>>