HomeSort by relevance Sort by last modified time
    Searched refs:elements (Results 101 - 125 of 1272) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
HashMultiset.java 43 * number of distinct elements.
45 * @param distinctElements the expected number of distinct elements
53 * Creates a new {@code HashMultiset} containing the specified elements.
55 * <p>This implementation is highly efficient when {@code elements} is itself
58 * @param elements the elements that the multiset should contain
60 public static <E> HashMultiset<E> create(Iterable<? extends E> elements) {
62 create(Multisets.inferDistinctElements(elements));
63 Iterables.addAll(multiset, elements);
ImmutableAsList_CustomFieldSerializer.java 41 List<Object> elements = new ArrayList<Object>(); local
42 Collection_CustomFieldSerializerBase.deserialize(reader, elements);
43 return new ImmutableAsList<Object>(elements);
LinkedHashMultiset.java 25 * iterator orders elements according to when the first occurrence of the
49 * number of distinct elements.
51 * @param distinctElements the expected number of distinct elements
59 * Creates a new {@code LinkedHashMultiset} containing the specified elements.
61 * <p>This implementation is highly efficient when {@code elements} is itself
64 * @param elements the elements that the multiset should contain
67 Iterable<? extends E> elements) {
69 create(Multisets.inferDistinctElements(elements));
70 Iterables.addAll(multiset, elements);
    [all...]
ImmutableList.java 54 // Casting to any type is safe because the list will never hold any elements.
129 public static <E> ImmutableList<E> of(E[] elements) {
130 checkNotNull(elements); // for GWT
131 switch (elements.length) {
135 return new SingletonImmutableList<E>(elements[0]);
138 ImmutableList.<E>nullCheckedList(elements));
146 public static <E> ImmutableList<E> copyOf(Iterable<? extends E> elements) {
147 checkNotNull(elements); // for GWT
148 return (elements instanceof Collection)
149 ? copyOf((Collection<? extends E>) elements)
177 Object[] elements = collection.toArray(); local
    [all...]
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
TestsForQueuesInJavaUtil.java 81 @Override public Queue<String> create(String[] elements) {
82 return new LinkedList<String>(MinimalCollection.of(elements));
99 @Override public Queue<String> create(String[] elements) {
101 100, false, MinimalCollection.of(elements));
116 @Override public Queue<String> create(String[] elements) {
118 MinimalCollection.of(elements));
133 @Override public Queue<String> create(String[] elements) {
135 MinimalCollection.of(elements));
155 @Override public Queue<String> create(String[] elements) {
157 MinimalCollection.of(elements));
    [all...]
TestMapEntrySetGenerator.java 47 public Set<Map.Entry<K, V>> create(Object... elements) {
48 Map.Entry<K, V>[] entries = createArray(elements.length);
49 Platform.unsafeArrayCopy(elements, 0, entries, 0, elements.length);
  /external/guava/guava-testlib/src/com/google/common/collect/testing/google/
BiMapGenerators.java 44 @Override protected Set<String> create(String[] elements) {
46 for (int i = 0; i < elements.length; i++) {
47 map.put(elements[i], i);
55 @Override protected Set<String> create(String[] elements) {
57 for (int i = 0; i < elements.length; i++) {
58 map.put(i, elements[i]);
83 @Override protected Set<String> create(String[] elements) {
85 for (int i = 0; i < elements.length; i++) {
86 map.put(i, elements[i]);
94 @Override protected Set<String> create(String[] elements) {
    [all...]
TestEnumMultisetGenerator.java 43 public Multiset<AnEnum> create(Object... elements) {
44 AnEnum[] array = new AnEnum[elements.length];
46 for (Object e : elements) {
52 protected abstract Multiset<AnEnum> create(AnEnum[] elements);
  /external/skia/tests/
LListTest.cpp 38 ListElement elements[4]) {
44 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0]));
45 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1]));
46 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2]));
47 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3]));
53 ListElement elements[4] = { local
61 check_list(list, reporter, true, 0, false, false, false, false, elements);
63 list.addToHead(&elements[0]);
65 check_list(list, reporter, false, 1, true, false, false, false, elements);
67 list.addToHead(&elements[1])
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
BiMapCollectionTest.java 42 @Override protected Set<String> create(String[] elements) {
44 for (int i = 0; i < elements.length; i++) {
45 bimap.put(elements[i], i);
57 @Override protected Set<String> create(String[] elements) {
59 for (int i = 0; i < elements.length; i++) {
60 bimap.put(i, elements[i]);
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
RewriteRuleNodeStream.java 52 List elements)
54 super(adaptor, elementDescription, elements);
  /external/guava/guava/src/com/google/common/collect/
ImmutableSortedSet.java 39 * An immutable {@code SortedSet} that stores its elements in a sorted array.
41 * natural sort ordering of their elements. Either way, null elements are not
61 * two elements are equivalent. Instead, with an explicit comparator, the
62 * following relation determines whether elements {@code x} and {@code y} are
67 * With natural ordering of elements, the following relation determines whether
68 * two elements are equivalent: <pre> {@code
129 * Returns an immutable sorted set containing the given elements sorted by
130 * their natural ordering. When multiple elements are equivalent according to
142 * Returns an immutable sorted set containing the given elements sorted b
675 final Object[] elements; field in class:ImmutableSortedSet.SerializedForm
    [all...]
  /packages/apps/Email/tests/src/com/android/email/
VendorPolicyLoaderTest.java 122 String[] elements = id.split("\""); local
123 assertEquals(0, elements.length % 4);
124 for (int i = 0; i < elements.length; ) {
131 assertTrue(elements[i] == null || elements[i].startsWith(" "));
132 assertTrue(elements[i+1].charAt(0) != ' ');
133 assertTrue(elements[i+2].startsWith(" "));
134 assertTrue(elements[i+3].charAt(0) != ' ');
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3rewritestreams.c 72 if (stream->elements != NULL)
77 if (stream->elements->factoryMade == ANTLR3_TRUE)
80 factory->returnVector(factory, stream->elements);
82 stream->elements = NULL;
89 stream->elements->clear(stream->elements);
120 if (stream->elements != NULL)
122 // We have some elements to traverse
126 for (i = 1; i<= stream->elements->count; i++)
128 tree = (pANTLR3_BASE_TREE)(stream->elements->elements[i-1].element)
    [all...]
  /bionic/libc/kernel/common/linux/
mempool.h 31 void **elements; member in struct:mempool_s
  /development/ndk/platforms/android-3/include/linux/
mempool.h 26 void **elements; member in struct:mempool_s
  /external/apache-http/src/org/apache/http/impl/auth/
RFC2617Scheme.java 70 HeaderElement[] elements = parser.parseElements(buffer, cursor); local
71 if (elements.length == 0) {
75 this.params = new HashMap<String, String>(elements.length);
76 for (HeaderElement element : elements) {
  /external/chromium/chrome/browser/bookmarks/
bookmark_node_data.h 39 // // data is valid, contents are in elements.
92 // Writes elements to the clipboard.
106 // Writes elements to data. If there is only one element and it is a URL
134 bool is_valid() const { return !elements.empty(); }
137 bool has_single_url() const { return is_valid() && elements[0].is_url; }
139 // Number of elements.
140 size_t size() const { return elements.size(); }
153 // The actual elements written to the clipboard.
154 std::vector<Element> elements; member in struct:BookmarkNodeData
  /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
SetHashCodeTester.java 41 "A Set's hashCode() should be the sum of those of its elements.",
48 Collection<E> elements = getSampleElements(getNumElements() - 1); local
50 for (E element : elements) {
54 elements.add(null);
55 collection = getSubjectGenerator().create(elements.toArray());
57 "A Set's hashCode() should be the sum of those of its elements (with "
  /external/libvorbis/vq/
vqgen.h 26 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,
  /libcore/luni/src/main/java/java/security/
PermissionCollection.java 32 public abstract Enumeration<Permission> elements(); method in class:PermissionCollection
Permissions.java 29 public Enumeration<Permission> elements() { return null; } method in class:Permissions
  /libcore/luni/src/main/java/java/util/
Dictionary.java 38 * 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
  /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/linux/
mempool.h 26 void **elements; member in struct:mempool_s
  /prebuilts/ndk/4/platforms/android-4/arch-arm/usr/include/linux/
mempool.h 26 void **elements; member in struct:mempool_s

Completed in 4610 milliseconds

1 2 3 45 6 7 8 91011>>