Searched refs:elements (Results 1 - 25 of 999) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DRemoveFormatCommand.cpp51 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, elements, ());
52 if (elements.isEmpty()) {
53 elements.add(acronymTag);
54 elements.add(bTag);
55 elements.add(bdoTag);
56 elements.add(bigTag);
57 elements.add(citeTag);
58 elements.add(codeTag);
59 elements.add(dfnTag);
60 elements
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dfor-in-special-cases.js75 var elements = Accumulate("abcd");
76 // We do not assume that for-in enumerates elements in order.
77 assertTrue(-1 != elements.indexOf("0"));
78 assertTrue(-1 != elements.indexOf("1"));
79 assertTrue(-1 != elements.indexOf("2"));
80 assertTrue(-1 != elements.indexOf("3"));
81 assertEquals(4, elements.length);
97 var elements = Accumulate(y);
99 // If for-in returns elements in a different order on multiple calls, this
101 assertEquals(elements, elements
[all...]
/external/clang/test/SemaCXX/
H A Dfor-range-unused.cpp10 for (auto& e : elements) // expected-warning {{unused variable 'e'}}
14 T elements[10]; member in struct:Vector
/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/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DIntArrayList.java39 protected int[] elements = null; field in class:IntArrayList
46 elements = new int[initialCapacity];
54 int v = elements[i];
55 elements[i] = newValue;
60 if ( n>=elements.length ) {
63 elements[n] = o;
69 if ( newSize>=elements.length ) {
76 ensureCapacity((elements.length * 3)/2 + 1);
81 int element = elements[i];
90 int oldCapacity = elements
106 public int[] elements() { method in class:IntArrayList
[all...]
H A DOrderedHashSet.java35 /** A HashMap that remembers the order that the elements were added.
41 /** Track the elements as they are added to the set */
42 protected List<T> elements = new ArrayList<T>(); field in class:OrderedHashSet
45 return elements.get(i);
52 T oldElement = elements.get(i);
53 elements.set(i,value); // update list
66 elements.add((T)value);
74 elements.remove(o);
80 elements.clear();
84 /** Return the List holding list of table elements
87 public List<T> elements() { method in class:OrderedHashSet
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DRemoteDebugEventSocketListener.cs337 string[] elements = GetEventElements(line);
338 if (elements == null || elements[0] == null) {
342 if (elements[0].Equals("enterRule")) {
343 listener.EnterRule(elements[1], elements[2]);
344 } else if (elements[0].Equals("exitRule")) {
345 listener.ExitRule(elements[1], elements[2]);
346 } else if (elements[
494 DeserializeNode(string[] elements, int offset) argument
505 DeserializeToken(string[] elements, int offset) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DRemoteDebugEventSocketListener.cs420 string[] elements = GetEventElements( line );
421 if ( elements == null || elements[0] == null )
426 if ( elements[0].Equals( "enterRule" ) )
428 listener.EnterRule( elements[1], elements[2] );
430 else if ( elements[0].Equals( "exitRule" ) )
432 listener.ExitRule( elements[1], elements[2] );
434 else if ( elements[
642 DeserializeNode( string[] elements, int offset ) argument
654 DeserializeToken( string[] elements, int offset ) argument
[all...]
/external/javassist/src/main/javassist/bytecode/
H A DLongVector.java23 private int elements; field in class:LongVector
27 elements = 0;
33 elements = 0;
36 public int size() { return elements; }
41 if (i < 0 || elements <= i)
48 int nth = elements >> ABITS;
49 int offset = elements & (ASIZE - 1);
61 elements++;
/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/icu/icu4c/source/i18n/
H A Dcollationrootelements.h25 * Container and access methods for collation elements and weights
34 : elements(rootElements), length(rootElementsLength) {}
54 * Same as the start of the compact root elements table.
79 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX].
91 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00;
98 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG;
105 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG;
113 return (elements[IX_SEC_TER_BOUNDARIE
247 const uint32_t *elements; member in class:CollationRootElements
[all...]
H A Dcollationrootelements.cpp25 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]);
27 uint32_t q = elements[index];
30 // p == elements[index] is a root primary. Find the CE before it.
33 secTer = elements[index - 1];
42 p = elements[index];
51 // p > elements[index] which is the previous primary.
56 q = elements[++index];
72 if(p != (elements[index] & 0xffffff00)) {
74 p = elements[
[all...]
/external/flac/libFLAC/include/private/
H A Dmemory.h48 FLAC__bool FLAC__memory_alloc_aligned_int32_array(unsigned elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer);
49 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(unsigned elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer);
50 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(unsigned elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer);
51 FLAC__bool FLAC__memory_alloc_aligned_unsigned_array(unsigned elements, unsigned **unaligned_pointer, unsigned **aligned_pointer);
53 FLAC__bool FLAC__memory_alloc_aligned_real_array(unsigned elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer);
/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...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DRewriteRuleElementStream.cs38 * A generic list of elements tracked in an alternative to be used in
45 * Once you start next()ing, do not try to add more elements. It will
58 * which bumps it to 1 meaning no more elements.
63 /** <summary>Track single elements w/o creating a list. Upon 2nd add, alloc list */
67 protected IList elements; field in class:Antlr.Runtime.Tree.RewriteRuleElementStream
98 public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription, IList elements) argument
101 this.elements = elements;
106 * not consumed any of its elements. Elements themselves are untouched.
121 if (elements !
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DRewriteRuleElementStream.cs39 * A generic list of elements tracked in an alternative to be used in
46 * Once you start next()ing, do not try to add more elements. It will
60 * which bumps it to 1 meaning no more elements.
65 /** <summary>Track single elements w/o creating a list. Upon 2nd add, alloc list */
69 protected IList elements; field in class:Antlr.Runtime.Tree.RewriteRuleElementStream
102 public RewriteRuleElementStream( ITreeAdaptor adaptor, string elementDescription, IList elements )
106 this.elements = elements;
111 * not consumed any of its elements. Elements themselves are untouched.
129 if ( elements !
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DRewriteRuleElementStream.java33 /** A generic list of elements tracked in an alternative to be used in
38 * Once you start next()ing, do not try to add more elements. It will
48 * which bumps it to 1 meaning no more elements.
52 /** Track single elements w/o creating a list. Upon 2nd add, alloc list */
56 protected List elements; field in class:RewriteRuleElementStream
94 List elements)
98 this.elements = elements;
102 * not consumed any of its elements. Elements themselves are untouched.
116 if ( elements!
92 RewriteRuleElementStream(TreeAdaptor adaptor, String elementDescription, List elements) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DListGenerators.java43 @Override protected List<String> create(String[] elements) { argument
44 return ImmutableList.copyOf(elements);
49 @Override protected List<String> create(String[] elements) { argument
51 for (String element : elements) {
60 @Override protected List<String> create(String[] elements) { argument
62 .addAll(asList(elements))
69 @Override protected List<String> create(String[] elements) { argument
70 List<String> list = asList(elements);
78 @Override protected List<String> create(String[] elements) { argument
80 String[] all = new String[elements
90 create(String[] elements) argument
102 create(String[] elements) argument
124 create(UnhashableObject[] elements) argument
[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/Java/src/main/java/org/antlr/runtime/debug/
H A DRemoteDebugEventSocketListener.java254 String[] elements = getEventElements(line);
255 if ( elements==null || elements[0]==null ) {
259 if ( elements[0].equals("enterRule") ) {
260 listener.enterRule(elements[1], elements[2]);
262 else if ( elements[0].equals("exitRule") ) {
263 listener.exitRule(elements[1], elements[2]);
265 else if ( elements[
433 deserializeNode(String[] elements, int offset) argument
444 deserializeToken(String[] elements, int offset) argument
[all...]
/external/chromium_org/base/android/java/src/org/chromium/base/
H A DCollectionUtil.java21 public static <E> HashSet<E> newHashSet(E... elements) { argument
22 HashSet<E> set = new HashSet<E>(elements.length);
23 Collections.addAll(set, elements);
28 public static <E> ArrayList<E> newArrayList(E... elements) { argument
29 ArrayList<E> list = new ArrayList<E>(elements.length);
30 Collections.addAll(list, elements);
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteRuleElementStream.as30 /** A generic list of elements tracked in an alternative to be used in
35 * Once you start next()ing, do not try to add more elements. It will
45 * which bumps it to 1 meaning no more elements.
49 /** Track single elements w/o creating a list. Upon 2nd add, alloc list */
53 protected var elements:Array;
78 this.elements = element as Array;
88 * not consumed any of its elements. Elements themselves are untouched.
102 if ( elements!=null ) { // if in list, just add
103 elements.push(el);
106 if ( singleElement == null ) { // no elements ye
[all...]
/external/chromium_org/chrome/browser/resources/
H A Dflags.js22 // 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/guava/guava/src/com/google/common/collect/
H A DImmutableCollection.java28 * An immutable collection. Does not permit null elements.
31 * #asList()} method, which returns a list view of the collection's elements.
50 * Returns an unmodifiable iterator across the elements in this collection.
219 private final E[] elements; field in class:ImmutableCollection.ArrayImmutableCollection
221 ArrayImmutableCollection(E[] elements) { argument
222 this.elements = elements;
227 return elements.length;
235 return Iterators.forArray(elements);
239 return elements
253 final Object[] elements; field in class:ImmutableCollection.SerializedForm
254 SerializedForm(Object[] elements) argument
303 add(E... elements) argument
322 addAll(Iterable<? extends E> elements) argument
341 addAll(Iterator<? extends E> elements) argument
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duvector.cpp33 elements(0),
43 elements(0),
53 elements(0),
63 elements(0),
78 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity);
79 if (elements == 0) {
88 uprv_free(elements);
89 elements = 0;
101 if (elements[i].pointer != 0 && deleter != 0) {
102 (*deleter)(elements[
[all...]

Completed in 783 milliseconds

1234567891011>>