/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRRewriteRuleElementStream.h | 33 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 D | for-range-unused.cpp | 10 for (auto& e : elements) // expected-warning {{unused variable 'e'}} 14 T elements[10]; member in struct:Vector
|
/external/mockito/src/org/mockito/stubbing/answers/ |
H A D | ReturnsElementsOf.java | 10 * 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 D | ANTLRRewriteRuleElementStream.h | 38 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 D | ANTLRRewriteRuleElementStream.h | 38 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 D | ANTLRRewriteRuleElementStream.h | 38 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/chromium_org/chrome/browser/resources/ |
H A D | flags.js | 22 // Add handlers to dynamically created HTML elements. 23 var elements = document.getElementsByClassName('experiment-select'); 24 for (var i = 0; i < elements.length; ++i) { function 25 elements[i].onchange = function() { 31 elements = document.getElementsByClassName('experiment-disable-link'); 32 for (var i = 0; i < elements.length; ++i) { 33 elements[i].onclick = function() { 39 elements = document.getElementsByClassName('experiment-enable-link'); 40 for (var i = 0; i < elements.length; ++i) { 41 elements[ [all...] |
/external/chromium_org/ppapi/shared_impl/ |
H A D | array_var.h | 40 const ElementVector& elements() const { function in class:ppapi::ArrayVar 44 ElementVector& elements() { function in class:ppapi::ArrayVar
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | EnumMultiset.java | 38 * 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 D | 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) { argument 62 create(Multisets.inferDistinctElements(elements)); 63 Iterables.addAll(multiset, elements);
|
H A D | 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); 66 create( Iterable<? extends E> elements) argument [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | MinimalIterable.java | 53 * 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 D | ReserializingTestSetGenerator.java | 41 @Override public Set<E> create(Object... elements) { argument 42 return (Set<E>) super.create(elements);
|
H A D | TestListGenerator.java | 22 * Creates sets, containing sample elements, to be tested. 30 List<E> create(Object... elements); argument
|
H A D | TestQueueGenerator.java | 22 * Creates queues, containing sample elements, to be tested. 30 Queue<E> create(Object... elements); argument
|
H A D | TestSetGenerator.java | 22 * Creates sets, containing sample elements, to be tested. 30 Set<E> create(Object... elements); argument
|
H A D | TestStringSortedSetGenerator.java | 33 @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 D | TestMultisetGenerator.java | 24 * 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 D | ReturnsElementsOf.java | 15 * 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 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/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | RewriteRuleSubtreeStream.cs | 48 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 D | RewriteRuleNodeStream.java | 52 List elements) 54 super(adaptor, elementDescription, elements); 50 RewriteRuleNodeStream(TreeAdaptor adaptor, String elementDescription, List elements) argument
|
H A D | RewriteRuleSubtreeStream.java | 49 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 D | RewriteRuleTokenStream.java | 51 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 D | MyPermissionCollection.java | 37 public Enumeration<Permission> elements() { method in class:MyPermissionCollection
|