/external/stlport/test/unit/ |
H A D | 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 [all...] |
/external/guava/src/com/google/common/collect/ |
H A D | EnumMultiset.java | 44 * Creates a new {@code EnumMultiset} containing the specified elements. 46 * @param elements the elements that the multiset should contain 47 * @throws IllegalArgumentException if {@code elements} is empty 50 Iterable<E> elements) { 51 Iterator<E> iterator = elements.iterator(); 56 Iterables.addAll(multiset, elements); 76 * elements, the first element, its count, the second element, its count, 49 create( Iterable<E> elements) argument
|
H A D | HashMultiset.java | 47 * number of distinct elements. 49 * @param distinctElements the expected number of distinct elements 57 * Creates a new {@code HashMultiset} containing the specified elements. 59 * @param elements the elements that the multiset should contain 61 public static <E> HashMultiset<E> create(Iterable<? extends E> elements) { argument 63 create(Multisets.inferDistinctElements(elements)); 64 Iterables.addAll(multiset, elements); 77 * @serialData the number of distinct elements, the first element, its count,
|
H A D | ImmutableSortedSetFauxverideShim.java | 123 * non-{@code Comparable} elements.</b> Proper calls will resolve to the 130 @Deprecated public static <E> ImmutableSortedSet<E> of(E... elements) { argument 147 * non-Comparable elements. We have not discovered a better solution. In
|
H A D | LinkedHashMultiset.java | 29 * iterator orders elements according to when the first occurrence of the 53 * number of distinct elements. 55 * @param distinctElements the expected number of distinct elements 63 * Creates a new {@code LinkedHashMultiset} containing the specified elements. 65 * @param elements the elements that the multiset should contain 68 Iterable<? extends E> elements) { 70 create(Multisets.inferDistinctElements(elements)); 71 Iterables.addAll(multiset, elements); 85 * @serialData the number of distinct elements, th 67 create( Iterable<? extends E> elements) argument [all...] |
H A D | RegularImmutableSet.java | 24 * Implementation of {@link ImmutableSet} with two or more elements. 31 // the same elements in hashed positions (plus nulls) 38 Object[] elements, int hashCode, Object[] table, int mask) { 39 super(elements); 37 RegularImmutableSet( Object[] elements, int hashCode, Object[] table, int mask) argument
|
H A D | ForwardingList.java | 51 public boolean addAll(int index, Collection<? extends E> elements) { argument 52 return delegate().addAll(index, elements);
|
H A D | ObjectArrays.java | 62 * @param first the first array of elements to concatenate 63 * @param second the second array of elements to concatenate 78 * @param array the array of elements to append 81 * elements of {@code array} occupying the remaining elements. 93 * @param array the array of elements to prepend 114 * Returns an array containing all of the elements in the specified 121 * the array has more elements than the collection), the element in the array 124 * caller knows that the collection does not contain any null elements. 126 * <p>This method returns the elements i 169 fillArray(Iterable<?> elements, Object[] array) argument [all...] |
H A D | TreeMultiset.java | 35 * A multiset which maintains the ordering of its elements, according to either 55 * Creates a new, empty multiset, sorted according to the elements' natural 56 * order. All elements inserted into the multiset must implement the 57 * {@code Comparable} interface. Furthermore, all such elements must be 59 * {@code ClassCastException} for any elements {@code e1} and {@code e2} in 62 * element to a set whose elements are integers), the {@code add(Object)} 76 * comparator. All elements inserted into the multiset must be <i>mutually 78 * e2)} must not throw a {@code ClassCastException} for any elements {@code 84 * null value indicates that the elements' <i>natural ordering</i> should 92 * Creates an empty multiset containing the given initial elements, sorte 100 create( Iterable<? extends E> elements) argument [all...] |
H A D | ConcurrentHashMultiset.java | 41 * elements are not supported. 79 * elements, using the default initial capacity, load factor, and concurrency 82 * @param elements the elements that the multiset should contain 85 Iterable<? extends E> elements) { 87 Iterables.addAll(multiset, elements); 92 * Creates an instance using {@code countMap} to store elements and their 98 * @param countMap backing map for storing the elements in the multiset and 468 * @serialData the number of distinct elements, the first element, its count, 84 create( Iterable<? extends E> elements) argument
|
H A D | 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) { argument 224 this.elements = elements; 228 return elements.length; 236 return Iterators.forArray(elements); 245 final Object[] elements; field in class:ImmutableCollection.SerializedForm 246 SerializedForm(Object[] elements) argument 289 add(E... elements) argument 309 addAll(Iterable<? extends E> elements) argument 329 addAll(Iterator<? extends E> elements) argument [all...] |
H A D | Lists.java | 71 * elements. 73 * <p><b>Note:</b> if mutability is not required and the elements are 76 * @param elements the elements that the list should contain, in order 77 * @return a new {@code ArrayList} containing those elements 80 public static <E> ArrayList<E> newArrayList(E... elements) { argument 81 checkNotNull(elements); // for GWT 83 int capacity = computeArrayListCapacity(elements.length); 85 Collections.addAll(list, elements); 98 * elements 107 newArrayList(Iterable<? extends E> elements) argument 130 newArrayList(Iterator<? extends E> elements) argument 208 newLinkedList( Iterable<? extends E> elements) argument [all...] |
H A D | Multiset.java | 31 * 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 114 * implementation does not permit null elements. Note that if {@code 144 * implementation does not permit null elements. Note that if {@code 165 * implementation does not permit null elements. Note that if {@code 174 * Returns the set of distinct elements contained in this multiset. The 176 * either is immediately reflected in the other. The order of the elements in 185 * elements in the multiset: {@code elementSet().size()}. 187 * @return a view of the set of distinct elements i 353 containsAll(Collection<?> elements) argument [all...] |
H A D | 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, argument 55 this.elements = elements; 57 this.toIndex = elements.length; 60 RegularImmutableSortedSet(Object[] elements, argument 63 this.elements = elements; 72 Iterators.forArray(elements, fromInde [all...] |
/external/icu4c/i18n/ |
H A D | ucol_cnt.h | 47 ContractionTable **elements; member in struct:CntTable
|
/external/webkit/WebCore/bindings/v8/custom/ |
H A D | 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...] |
/external/webkit/WebCore/platform/network/curl/ |
H A D | 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();
|
/external/kernel-headers/original/linux/ |
H A D | mempool.h | 16 int min_nr; /* nr of elements at *elements */ 17 int curr_nr; /* Current nr of elements at *elements */ 18 void **elements; member in struct:mempool_s
|
/external/icu4c/common/ |
H A D | uvector.h | 74 * zero, then it is assumed that the caller will delete elements as 103 UHashTok* elements; member in class:UVector 128 * equal if they are of the same size and all elements are equal, 195 * elements for i >= newSize. If newSize is larger, grow the 201 * Fill in the given array with all elements of this vector. 227 * Returns true if this vector contains none of the elements 236 * as defined by 'compare'. The current elements are assumed to 243 * as defined by 'compare'. The current elements are assumed to
|
H A D | uhash.h | 21 * storage space. As elements are added to it, it grows to accomodate 22 * them. By default, the table never shrinks, even if all elements 98 /* Reorder these elements to pack nicely if necessary */ 154 UHashElement *elements; member in struct:UHashtable 289 * before any elements are added to the hashtable and should not be 302 * once before any elements are added to the hashtable and should not 507 * Iterate through the elements of a UHashtable. The caller must not
|
H A D | uvectr32.h | 67 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 (0 <= index && index < count) ? elements[index] : 0; 228 elements[count] = elem; 237 int32_t *rp = elements+count; 248 return elements [all...] |
/external/opencore/baselibs/gen_data_structures/src/ |
H A D | bool_array.h | 38 elements = (max_array_size + 31) / 32; 184 int elements; member in class:BoolArray
|
/external/dbus/dbus/ |
H A D | dbus-mempool.c | 56 * We just cast freed elements to this so we can 65 * The dummy size of the variable-length "elements" 87 /* this is a long so that "elements" is aligned */ 88 long used_so_far; /**< bytes of this block already allocated as elements. */ 90 unsigned char elements[ELEMENT_PADDING]; /**< the block data, actually allocated to required size */ member in struct:DBusMemBlock 100 unsigned int zero_elements : 1; /**< whether to zero-init allocated elements */ 102 DBusFreedElement *free_elements; /**< a free list of elements to recycle */ 104 int allocated_elements; /**< Count of outstanding allocated elements */ 132 * @param zero_elements whether to zero-initialize elements 178 * Frees a memory pool (and all elements allocate [all...] |
/external/proguard/src/proguard/gui/ |
H A D | ListPanel.java | 89 // 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/webkit/WebCore/platform/network/ |
H A D | FormData.h | 81 const Vector<FormDataElement>& elements() const { return m_elements; } function in class:WebCore::FormData 106 return a.elements() == b.elements(); 111 return a.elements() != b.elements();
|