/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
D | RemoteDebugEventSocketListener.cs | 420 string[] elements = GetEventElements( line ); in Dispatch() 421 if ( elements == null || elements[0] == null ) in Dispatch() 426 if ( elements[0].Equals( "enterRule" ) ) in Dispatch() 428 listener.EnterRule( elements[1], elements[2] ); in Dispatch() 430 else if ( elements[0].Equals( "exitRule" ) ) in Dispatch() 432 listener.ExitRule( elements[1], elements[2] ); in Dispatch() 434 else if ( elements[0].Equals( "enterAlt" ) ) in Dispatch() 436 listener.EnterAlt( int.Parse( elements[1] ) ); in Dispatch() 438 else if ( elements[0].Equals( "enterSubRule" ) ) in Dispatch() 440 listener.EnterSubRule( int.Parse( elements[1] ) ); in Dispatch() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
D | RemoteDebugEventSocketListener.cs | 337 string[] elements = GetEventElements(line); in Dispatch() 338 if (elements == null || elements[0] == null) { in Dispatch() 342 if (elements[0].Equals("enterRule")) { in Dispatch() 343 listener.EnterRule(elements[1], elements[2]); in Dispatch() 344 } else if (elements[0].Equals("exitRule")) { in Dispatch() 345 listener.ExitRule(elements[1], elements[2]); in Dispatch() 346 } else if (elements[0].Equals("enterAlt")) { in Dispatch() 347 listener.EnterAlt(int.Parse(elements[1])); in Dispatch() 348 } else if (elements[0].Equals("enterSubRule")) { in Dispatch() 349 listener.EnterSubRule(int.Parse(elements[1])); in Dispatch() [all …]
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
D | RemoteDebugEventSocketListener.java | 254 String[] elements = getEventElements(line); in dispatch() local 255 if ( elements==null || elements[0]==null ) { in dispatch() 259 if ( elements[0].equals("enterRule") ) { in dispatch() 260 listener.enterRule(elements[1], elements[2]); in dispatch() 262 else if ( elements[0].equals("exitRule") ) { in dispatch() 263 listener.exitRule(elements[1], elements[2]); in dispatch() 265 else if ( elements[0].equals("enterAlt") ) { in dispatch() 266 listener.enterAlt(Integer.parseInt(elements[1])); in dispatch() 268 else if ( elements[0].equals("enterSubRule") ) { in dispatch() 269 listener.enterSubRule(Integer.parseInt(elements[1])); in dispatch() [all …]
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
D | CollationRootElements.java | 23 elements = rootElements; in CollationRootElements() 79 return ((int)elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary() 86 return elements[(int)elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE() 93 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE() 101 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary() 111 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary() 118 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE() 125 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE() 132 return elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary() 148 assert(p > elements[(int)elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore() [all …]
|
/external/guava/guava/src/com/google/common/collect/ |
D | ImmutableSet.java | 152 Object[] elements = new Object[paramCount + others.length]; in of() local 153 elements[0] = e1; in of() 154 elements[1] = e2; in of() 155 elements[2] = e3; in of() 156 elements[3] = e4; in of() 157 elements[4] = e5; in of() 158 elements[5] = e6; in of() 159 System.arraycopy(others, 0, elements, paramCount, others.length); in of() 160 return construct(elements.length, elements); in of() 178 private static <E> ImmutableSet<E> construct(int n, Object... elements) { in construct() argument [all …]
|
/external/v8/test/mjsunit/ |
D | for-in-special-cases.js | 75 var elements = Accumulate("abcd"); variable 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); 101 assertEquals(elements, elements1, "For-in elements not the same both times."); 103 assertTrue(-1 != elements.indexOf("0")); 104 assertTrue(-1 != elements.indexOf("1")); [all …]
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
D | SetGenerators.java | 66 @Override protected Set<String> create(String[] elements) { in create() argument 67 return ImmutableSet.copyOf(elements); in create() 78 public Set<Object> create(Object... elements) { in create() argument 79 return ImmutableSet.copyOf(elements); in create() 88 @Override protected Set<String> create(String[] elements) { in create() argument 90 ImmutableSet.of(elements[0], elements[0]); in create() 96 @Override protected SortedSet<String> create(String[] elements) { in create() argument 97 return ImmutableSortedSet.copyOf(elements); in create() 103 @Override protected SortedSet<String> create(String[] elements) { in create() argument 104 List<String> list = Lists.newArrayList(elements); in create() [all …]
|
D | ListGenerators.java | 46 @Override protected List<String> create(String[] elements) { in create() argument 47 return ImmutableList.copyOf(elements); in create() 52 @Override protected List<String> create(String[] elements) { in create() argument 54 for (String element : elements) { in create() 63 @Override protected List<String> create(String[] elements) { in create() argument 65 .addAll(asList(elements)) in create() 72 @Override protected List<String> create(String[] elements) { in create() argument 73 List<String> list = asList(elements); in create() 81 @Override protected List<String> create(String[] elements) { in create() argument 83 String[] all = new String[elements.length + suffix.length]; in create() [all …]
|
/external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
D | SetGenerators.java | 65 @Override protected Set<String> create(String[] elements) { in create() argument 66 return ImmutableSet.copyOf(elements); in create() 77 public Set<Object> create(Object... elements) { in create() argument 78 return ImmutableSet.copyOf(elements); in create() 87 @Override protected Set<String> create(String[] elements) { in create() argument 89 ImmutableSet.of(elements[0], elements[0]); in create() 95 @Override protected SortedSet<String> create(String[] elements) { in create() argument 96 return ImmutableSortedSet.copyOf(elements); in create() 102 @Override protected SortedSet<String> create(String[] elements) { in create() argument 103 List<String> list = Lists.newArrayList(elements); in create() [all …]
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
D | IntArrayList.java | 39 protected int[] elements = null; field in IntArrayList 46 elements = new int[initialCapacity]; in IntArrayList() 54 int v = elements[i]; in set() 55 elements[i] = newValue; in set() 60 if ( n>=elements.length ) { in add() 63 elements[n] = o; in add() 69 if ( newSize>=elements.length ) { in setSize() 76 ensureCapacity((elements.length * 3)/2 + 1); in grow() 81 int element = elements[i]; in contains() 90 int oldCapacity = elements.length; in ensureCapacity() [all …]
|
D | OrderedHashSet.java | 42 protected List<T> elements = new ArrayList<T>(); field in OrderedHashSet 45 return elements.get(i); in get() 52 T oldElement = elements.get(i); in set() 53 elements.set(i,value); // update list in set() 66 elements.add((T)value); in add() 80 elements.clear(); in clear() 87 public List<T> elements() { in elements() method in OrderedHashSet 88 return elements; in elements() 92 return elements.iterator(); in iterator() 96 return elements.toArray(); in toArray() [all …]
|
/external/icu/icu4c/source/i18n/ |
D | collationrootelements.cpp | 25 U_ASSERT(p > elements[elements[IX_FIRST_PRIMARY_INDEX]]); in lastCEWithPrimaryBefore() 27 uint32_t q = elements[index]; in lastCEWithPrimaryBefore() 33 secTer = elements[index - 1]; in lastCEWithPrimaryBefore() 42 p = elements[index]; in lastCEWithPrimaryBefore() 56 q = elements[++index]; in lastCEWithPrimaryBefore() 72 if(p != (elements[index] & 0xffffff00)) { in firstCEWithPrimaryAtLeast() 74 p = elements[++index]; in firstCEWithPrimaryAtLeast() 90 uint32_t q = elements[index]; in getPrimaryBefore() 98 p = elements[--index]; in getPrimaryBefore() 104 uint32_t nextElement = elements[index + 1]; in getPrimaryBefore() [all …]
|
D | collationrootelements.h | 34 : elements(rootElements), length(rootElementsLength) {} in CollationRootElements() 91 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00; in getTertiaryBoundary() 98 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstTertiaryCE() 105 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastTertiaryCE() 113 return (elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00; in getLastCommonSecondary() 123 return (elements[IX_SEC_TER_BOUNDARIES] >> 8) & 0xff00; in getSecondaryBoundary() 130 return elements[elements[IX_FIRST_SECONDARY_INDEX]] & ~SEC_TER_DELTA_FLAG; in getFirstSecondaryCE() 137 return elements[elements[IX_FIRST_PRIMARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG; in getLastSecondaryCE() 144 return elements[elements[IX_FIRST_PRIMARY_INDEX]]; // step=0: cannot be a range end in getFirstPrimary() 267 const uint32_t *elements; variable
|
/external/icu/icu4c/source/common/ |
D | uvector.cpp | 33 elements(0), in UOBJECT_DEFINE_RTTI_IMPLEMENTATION() 43 elements(0), in UVector() 53 elements(0), in UVector() 63 elements(0), in UVector() 78 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity); in _init() 79 if (elements == 0) { in _init() 88 uprv_free(elements); in ~UVector() 89 elements = 0; in ~UVector() 101 if (elements[i].pointer != 0 && deleter != 0) { in assign() 102 (*deleter)(elements[i].pointer); in assign() [all …]
|
D | uvectr32.cpp | 31 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION() 40 elements(0) in UVector32() 58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity); in _init() 59 if (elements == 0) { in _init() 67 uprv_free(elements); in ~UVector32() 68 elements = 0; in ~UVector32() 78 elements[i] = other.elements[i]; in assign() 88 if (elements[i] != other.elements[i]) { in operator ==() 98 elements[index] = elem; in setElementAt() 107 elements[i] = elements[i-1]; in insertElementAt() [all …]
|
D | uvectr64.cpp | 28 elements(NULL) in UOBJECT_DEFINE_RTTI_IMPLEMENTATION() 37 elements(0) in UVector64() 55 elements = (int64_t *)uprv_malloc(sizeof(int64_t)*initialCapacity); in _init() 56 if (elements == 0) { in _init() 64 uprv_free(elements); in ~UVector64() 65 elements = 0; in ~UVector64() 75 elements[i] = other.elements[i]; in assign() 85 if (elements[i] != other.elements[i]) { in operator ==() 95 elements[index] = elem; in setElementAt() 104 elements[i] = elements[i-1]; in insertElementAt() [all …]
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
D | ImmutableSet.java | 82 public static <E> ImmutableSet<E> copyOf(E[] elements) { in copyOf() argument 83 checkNotNull(elements); in copyOf() 84 switch (elements.length) { in copyOf() 88 return of(elements[0]); in copyOf() 90 return create(elements); in copyOf() 94 public static <E> ImmutableSet<E> copyOf(Collection<? extends E> elements) { in copyOf() argument 95 Iterable<? extends E> iterable = elements; in copyOf() 99 public static <E> ImmutableSet<E> copyOf(Iterable<? extends E> elements) { in copyOf() argument 100 if (elements instanceof ImmutableSet && !(elements instanceof ImmutableSortedSet)) { in copyOf() 102 ImmutableSet<E> set = (ImmutableSet<E>) elements; in copyOf() [all …]
|
/external/flac/libFLAC/ |
D | memory.c | 62 FLAC__bool FLAC__memory_alloc_aligned_int32_array(size_t elements, FLAC__int32 **unaligned_pointer,… in FLAC__memory_alloc_aligned_int32_array() argument 70 FLAC__ASSERT(elements > 0); in FLAC__memory_alloc_aligned_int32_array() 75 if(elements > SIZE_MAX / sizeof(*pu)) /* overflow check */ in FLAC__memory_alloc_aligned_int32_array() 78 pu = FLAC__memory_alloc_aligned(sizeof(*pu) * elements, &u.pv); in FLAC__memory_alloc_aligned_int32_array() 91 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(size_t elements, FLAC__uint32 **unaligned_pointe… in FLAC__memory_alloc_aligned_uint32_array() argument 99 FLAC__ASSERT(elements > 0); in FLAC__memory_alloc_aligned_uint32_array() 104 if(elements > SIZE_MAX / sizeof(*pu)) /* overflow check */ in FLAC__memory_alloc_aligned_uint32_array() 107 pu = FLAC__memory_alloc_aligned(sizeof(*pu) * elements, &u.pv); in FLAC__memory_alloc_aligned_uint32_array() 120 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(size_t elements, FLAC__uint64 **unaligned_pointe… in FLAC__memory_alloc_aligned_uint64_array() argument 128 FLAC__ASSERT(elements > 0); in FLAC__memory_alloc_aligned_uint64_array() [all …]
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
D | AbstractContainerTester.java | 87 protected final void expectContents(E... elements) { in expectContents() argument 88 expectContents(Arrays.asList(elements)); in expectContents() 139 protected final void expectAdded(E... elements) { in expectAdded() argument 141 expected.addAll(Arrays.asList(elements)); in expectAdded() 145 protected final void expectAdded(int index, E... elements) { in expectAdded() argument 146 expectAdded(index, Arrays.asList(elements)); in expectAdded() 149 protected final void expectAdded(int index, Collection<E> elements) { in expectAdded() argument 151 expected.addAll(index, elements); in expectAdded() 161 protected void expectMissing(E... elements) { in expectMissing() argument 162 for (E element : elements) { in expectMissing() [all …]
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | MultisetsCollectionTest.java | 103 @Override protected Multiset<String> create(String[] elements) { in unmodifiableMultisetGenerator() 105 LinkedHashMultiset.create(asList(elements))); in unmodifiableMultisetGenerator() 124 @Override protected Multiset<String> create(String[] elements) { 126 TreeMultiset.create(asList(elements))); 138 protected Multiset<String> create(String[] elements) { 141 for (int i = 0; i < elements.length; i++) { 142 String element = elements[i]; 149 multiset1.add(elements[i]); 151 multiset2.add(elements[i]); 161 @Override protected Multiset<String> create(String[] elements) { [all …]
|
D | SetOperationsTest.java | 49 @Override protected Set<String> create(String[] elements) { in suite() 60 @Override protected Set<String> create(String[] elements) { in suite() 61 checkArgument(elements.length == 1); in suite() 63 Sets.<String>newHashSet(elements), Sets.newHashSet(elements)); in suite() 71 @Override protected Set<String> create(String[] elements) { in suite() 73 Sets.<String>newHashSet(), Sets.newHashSet(elements)); in suite() 82 @Override protected Set<String> create(String[] elements) { in suite() 84 Sets.newHashSet(elements), Sets.<String>newHashSet()); in suite() 93 @Override protected Set<String> create(String[] elements) { in suite() 94 checkArgument(elements.length == 3); in suite() [all …]
|
/external/vogar/src/vogar/ |
D | Classpath.java | 31 private final List<File> elements = new ArrayList<File>(); field in Classpath 39 result.elements.addAll(files); in of() 43 public void addAll(File... elements) { in addAll() argument 44 addAll(Arrays.asList(elements)); in addAll() 47 public void addAll(Collection<File> elements) { in addAll() argument 48 this.elements.addAll(elements); in addAll() 52 this.elements.addAll(anotherClasspath.elements); in addAll() 56 return elements; in getElements() 60 return elements.isEmpty(); in isEmpty() 64 return elements.contains(file); in contains() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
D | RewriteRuleElementStream.cs | 69 protected IList elements; field in Antlr.Runtime.Tree.RewriteRuleElementStream 102 … public RewriteRuleElementStream( ITreeAdaptor adaptor, string elementDescription, IList elements ) in RewriteRuleElementStream() argument 106 this.elements = elements; in RewriteRuleElementStream() 129 if ( elements != null ) in Add() 131 elements.Add( el ); in Add() 140 elements = new List<object>( 5 ); in Add() 141 elements.Add( singleElement ); in Add() 143 elements.Add( el ); in Add() 198 object o = ToTree( elements[cursor] ); in NextCore() 227 ( elements != null && cursor < elements.Count ); [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
D | RewriteRuleElementStream.cs | 67 protected IList elements; field in Antlr.Runtime.Tree.RewriteRuleElementStream 98 … public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription, IList elements) in RewriteRuleElementStream() argument 101 this.elements = elements; in RewriteRuleElementStream() 121 if (elements != null) { // if in list, just add in Add() 122 elements.Add(el); in Add() 130 elements = new List<object>(5); in Add() 131 elements.Add(singleElement); in Add() 133 elements.Add(el); in Add() 181 object o = ToTree(elements[cursor]); in NextCore() 207 (elements != null && cursor < elements.Count); [all …]
|
/external/skia/tests/ |
D | LListTest.cpp | 37 ListElement elements[4]) { in check_list() 43 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list() 44 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list() 45 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list() 46 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list() 52 ListElement elements[4] = { in TestTInternalLList() local 60 check_list(list, reporter, true, 0, false, false, false, false, elements); in TestTInternalLList() 62 list.addToHead(&elements[0]); in TestTInternalLList() 64 check_list(list, reporter, false, 1, true, false, false, false, elements); in TestTInternalLList() 66 list.addToHead(&elements[1]); in TestTInternalLList() [all …]
|