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

1234567891011>>

/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRRewriteRuleElementStream.h33 BOOL dirty; ///< indicates whether the stream should return copies of its elements, set to true after a call to -reset
36 __strong AMutableArray *elements; variable
46 @property (assign) AMutableArray *elements; variable
57 elements:(NSArray *)theElements;
61 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription elements:(NSArray *)theElements;
/external/clang/test/SemaCXX/
H A Dfor-range-unused.cpp10 for (auto& e : elements)
14 T elements[10]; member in struct:Vector
/external/mockito/src/org/mockito/stubbing/answers/
H A DReturnsElementsOf.java10 * Returns elements of the collection. Keeps returning the last element forever.
11 * Might be useful on occasion when you have a collection of elements to return.
26 public ReturnsElementsOf(Collection<?> elements) { argument
27 super(elements);
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRRewriteRuleElementStream.h38 BOOL dirty; ///< indicates whether the stream should return copies of its elements, set to true after a call to -reset
40 Elements elements; variable
49 @property (assign, getter=GetElement, setter=SetElement:) Elements elements; variable
60 elements:(NSArray *)theElements;
64 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription elements:(NSArray *)theElements;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRRewriteRuleElementStream.h38 BOOL dirty; ///< indicates whether the stream should return copies of its elements, set to true after a call to -reset
40 Elements elements; variable
49 @property (assign, getter=GetElement, setter=SetElement:) Elements elements; variable
60 elements:(NSArray *)theElements;
64 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription elements:(NSArray *)theElements;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRRewriteRuleElementStream.h38 BOOL dirty; ///< indicates whether the stream should return copies of its elements, set to true after a call to -reset
40 Elements elements; variable
49 @property (assign, getter=GetElement, setter=SetElement:) Elements elements; variable
60 elements:(NSArray *)theElements;
64 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)aTreeAdaptor description:(NSString *)anElementDescription elements:(NSArray *)theElements;
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DEnumMultiset.java38 * Creates a new {@code EnumMultiset} containing the specified elements.
40 * <p>This implementation is highly efficient when {@code elements} is itself a {@link
43 * @param elements the elements that the multiset should contain
44 * @throws IllegalArgumentException if {@code elements} is empty
46 public static <E extends Enum<E>> EnumMultiset<E> create(Iterable<E> elements) { argument
47 Iterator<E> iterator = elements.iterator();
50 Iterables.addAll(multiset, elements);
H A DHashMultiset.java43 * 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) { argument
62 create(Multisets.inferDistinctElements(elements));
63 Iterables.addAll(multiset, elements);
H A DLinkedHashMultiset.java25 * 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);
66 create( Iterable<? extends E> elements) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DMinimalIterable.java53 * Returns an iterable whose iterator returns the given elements in order.
55 public static <E> MinimalIterable<E> of(E... elements) { argument
57 return new MinimalIterable<E>(Arrays.asList(elements).iterator());
61 * Returns an iterable whose iterator returns the given elements in order.
62 * The elements are copied out of the source collection at the time this
66 public static <E> MinimalIterable<E> from(final Collection<E> elements) { argument
67 return (MinimalIterable) of(elements.toArray());
H A DReserializingTestSetGenerator.java41 @Override public Set<E> create(Object... elements) { argument
42 return (Set<E>) super.create(elements);
H A DTestListGenerator.java22 * Creates sets, containing sample elements, to be tested.
30 List<E> create(Object... elements); argument
H A DTestQueueGenerator.java22 * Creates queues, containing sample elements, to be tested.
30 Queue<E> create(Object... elements); argument
H A DTestSetGenerator.java22 * Creates sets, containing sample elements, to be tested.
30 Set<E> create(Object... elements); argument
H A DTestStringSortedSetGenerator.java33 @Override protected abstract SortedSet<String> create(String[] elements); argument
35 /** Sorts the elements by their natural ordering. */
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DTestMultisetGenerator.java24 * Creates multisets, containing sample elements, to be tested.
31 Multiset<E> create(Object... elements); argument
/external/mockito/src/org/mockito/internal/stubbing/answers/
H A DReturnsElementsOf.java15 * Returns elements of the collection. Keeps returning the last element forever.
16 * Might be useful on occasion when you have a collection of elements to return.
35 private final LinkedList<Object> elements; field in class:ReturnsElementsOf
37 public ReturnsElementsOf(Collection<?> elements) { argument
38 if (elements == null) {
42 this.elements = new LinkedList<Object>(elements);
46 if (elements.size() == 1)
47 return elements.get(0);
49 return elements
[all...]
/external/stlport/test/unit/
H A Dcount_test.cpp49 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/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DRewriteRuleSubtreeStream.cs48 public RewriteRuleSubtreeStream(ITreeAdaptor adaptor, string elementDescription, IList elements) argument
49 : base(adaptor, elementDescription, elements) {
70 //System.Console.WriteLine("nextNode: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
73 // if out of elements and size is 1, dup (at most a single node
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DRewriteRuleNodeStream.java52 List elements)
54 super(adaptor, elementDescription, elements);
50 RewriteRuleNodeStream(TreeAdaptor adaptor, String elementDescription, List elements) argument
H A DRewriteRuleSubtreeStream.java49 List elements)
51 super(adaptor, elementDescription, elements);
68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
71 // if out of elements and size is 1, dup (at most a single node
47 RewriteRuleSubtreeStream(TreeAdaptor adaptor, String elementDescription, List elements) argument
H A DRewriteRuleTokenStream.java51 List elements)
53 super(adaptor, elementDescription, elements);
49 RewriteRuleTokenStream(TreeAdaptor adaptor, String elementDescription, List elements) argument
/external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/
H A DMyPermissionCollection.java37 public Enumeration<Permission> elements() { method in class:MyPermissionCollection
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_node_data.h39 // // 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/dexmaker/src/dx/java/com/android/dx/util/
H A DIntSet.java55 * Returns the count of unique elements in this set.
57 * @return {@code > = 0;} count of unique elements
59 int elements(); method in interface:IntSet

Completed in 1029 milliseconds

1234567891011>>