/external/icu4c/common/ |
uvectr32.h | 67 int32_t* elements; member in class:UVector32 84 * equal if they are of the same size and all elements are equal, 137 * elements for i >= newSize. If newSize is larger, grow the 147 * Returns true if this vector contains none of the elements 157 * The current elements are assumed to be sorted already. 170 * Units are vector elements (32 bits each), not bytes. 222 return (0 <= index && index < count) ? elements[index] : 0; 228 elements[count] = elem; 237 int32_t *rp = elements+count; 248 return elements+count-size [all...] |
/external/icu4c/i18n/ |
ucol_cnt.cpp | 60 tbl->elements = (ContractionTable **)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(ContractionTable *)); 61 if(tbl->elements == NULL) { 67 uprv_memset(tbl->elements, 0, INIT_EXP_TABLE_SIZE*sizeof(ContractionTable *)); 98 table->elements[table->size] = el; 100 //uhash_put(table->elements, (void *)table->size, el, status); 107 /* table->elements = (ContractionTable **)realloc(table->elements, table->capacity*2*sizeof(ContractionTable *));*/ 113 ContractionTable **oldElements = table->elements; 117 table->elements = newElements; 151 table->position += table->elements[i]->position [all...] |
/external/guava/guava/src/com/google/common/collect/ |
Constraints.java | 70 * constraint. Any operations that add new elements to the collection will 72 * existing elements satisfy the constraint. 77 * @param constraint the constraint that validates added elements 102 @Override public boolean addAll(Collection<? extends E> elements) { 103 return delegate.addAll(checkElements(elements, constraint)); 109 * constraint. Any operations that add new elements to the set will call the 111 * elements satisfy the constraint. 116 * @param constraint the constraint that validates added elements 140 @Override public boolean addAll(Collection<? extends E> elements) { 141 return delegate.addAll(checkElements(elements, constraint)) [all...] |
EnumMultiset.java | 42 * Creates a new {@code EnumMultiset} containing the specified elements. 44 * <p>This implementation is highly efficient when {@code elements} is itself a {@link 47 * @param elements the elements that the multiset should contain 48 * @throws IllegalArgumentException if {@code elements} is empty 50 public static <E extends Enum<E>> EnumMultiset<E> create(Iterable<E> elements) { 51 Iterator<E> iterator = elements.iterator(); 54 Iterables.addAll(multiset, elements); 75 * elements, the first element, its count, the second element, its
|
ForwardingList.java | 70 public boolean addAll(int index, Collection<? extends E> elements) { 71 return delegate().addAll(index, elements); 144 int index, Iterable<? extends E> elements) { 145 return Lists.addAllImpl(this, index, elements);
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
test-tree-wizard.rb | 253 elements = [] 255 elements << node.to_s 258 assert_equal( %w(B), elements ) 265 elements = [] 267 elements << node.to_s 270 assert_equal(%w(C), elements) 277 elements = [] 279 elements << node.to_s 282 assert_equal(%w(B B B), elements) 289 elements = [ [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
TableCollectionTest.java | 121 @Override protected Set<String> create(String[] elements) { 124 ImmutableList.copyOf(elements), ImmutableList.of(1, 2)); 125 populateForRowKeySet(table, elements); 137 @Override protected Set<String> create(String[] elements) { 139 populateForRowKeySet(table, elements); 148 @Override protected Set<String> create(String[] elements) { 150 populateForRowKeySet(table, elements); 164 @Override protected Set<String> create(String[] elements) { 167 populateForRowKeySet(table, elements); 182 @Override protected Set<String> create(String[] elements) { [all...] |
ListsTest.java | 107 @Override protected List<String> create(String[] elements) { 108 String[] rest = new String[elements.length - 1]; 109 Platform.unsafeArrayCopy(elements, 1, rest, 0, elements.length - 1); 110 return Lists.asList(elements[0], rest); 119 @Override protected List<String> create(String[] elements) { 120 String[] rest = new String[elements.length - 2]; 121 Platform.unsafeArrayCopy(elements, 2, rest, 0, elements.length - 2); 122 return Lists.asList(elements[0], elements[1], rest) [all...] |
MinMaxPriorityQueueTest.java | 190 * this map would contain the same exact elements as the MinMaxHeap; the 522 @Override protected void verify(List<T> elements) { 523 assertEquals(Sets.newHashSet(elements), 581 ArrayList<Integer> elements = createOrderedList(size); local 582 List<Integer> expected = ImmutableList.copyOf(elements); 584 long seed = insertRandomly(elements, q); 586 elements.add(q.pollFirst()); 588 assertEquals("Using seed " + seed, expected, elements); 596 ArrayList<Integer> elements = createOrderedList(size); local 597 List<Integer> expected = ImmutableList.copyOf(elements); 611 ArrayList<Integer> elements = createOrderedList(size); local 628 ArrayList<Integer> elements = createOrderedList(size); local 643 ArrayList<Integer> elements = createOrderedList(size); local 688 List<Integer> elements = Lists.newArrayListWithCapacity(size); local 733 ArrayList<Integer> elements = new ArrayList<Integer>(size); local [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
SortedMapGenerators.java | 59 @Override protected Set<String> create(String[] elements) { 61 for (String key : elements) { 81 public Collection<String> create(Object... elements) { 83 for (int i = 0; i < elements.length; i++) { 84 builder.put(i, toStringOrNull(elements[i])); 128 @Override protected Set<String> create(String[] elements) { 131 for (String key : elements) { 152 public Collection<String> create(Object... elements) { 155 for (int i = 0; i < elements.length; i++) { 156 builder.put(i, toStringOrNull(elements[i])) [all...] |
/external/proguard/src/proguard/gui/ |
ListPanel.java | 89 // Remove the selected elements. 109 // Move the selected elements up. 130 // Move the selected elements down. 159 // Remove the selected elements from this panel. 162 // Add the elements to the other panel. 209 protected void addElements(Object[] elements) 211 // Add the elements one by one. 212 for (int index = 0; index < elements.length; index++) 214 listModel.addElement(elements[index]); 218 int[] selectedIndices = new int[elements.length] [all...] |
/external/libvorbis/vq/ |
vqgen.c | 57 #define vN(data,i) (data+v->elements*i) 62 int el=v->elements; 79 memcpy(_now(v,i),_point(v,i),sizeof(float)*v->elements); 179 for(k=0;k<v->elements;k++){ 201 for(k=0;k<v->elements;k++){ 231 for(k=0;k<v->elements;k++){ 240 void vqgen_init(vqgen *v,int elements,int aux,int entries,float mindist, 246 v->elements=elements; 250 v->pointlist=_ogg_malloc(v->allocated*(v->elements+v->aux)*sizeof(float)) [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/processor/ |
XSLTElementDef.java | 32 * mapping between Xalan classes and the markup elements in the XSLT instance. 33 * This actually represents both text nodes and elements. 50 * @param elements An array of allowed child element defs, or null. 56 XSLTElementDef[] elements, XSLTAttributeDef[] attributes, 59 build(namespace, name, nameAlias, elements, attributes, contentHandler, 78 * @param elements An array of allowed child element defs, or null. 82 * @param has_required true if this element has required elements by the XSLT specification. 85 XSLTElementDef[] elements, XSLTAttributeDef[] attributes, 89 build(namespace, name, nameAlias, elements, attributes, contentHandler, 109 * @param elements An array of allowed child element defs, or null [all...] |
/external/junit/src/org/junit/internal/matchers/ |
IsCollectionContaining.java | 58 public static <T> Matcher<Iterable<T>> hasItems(T... elements) { 60 = new ArrayList<Matcher<? extends Iterable<T>>>(elements.length); 61 for (T element : elements) {
|
/libcore/luni/src/main/java/java/util/concurrent/ |
CopyOnWriteArraySet.java | 58 * @param <E> the type of elements held in this collection 74 * Creates a set containing all of the elements of the specified 77 * @param c the collection of elements to initially contain 86 * Returns the number of elements in this set. 88 * @return the number of elements in this set 95 * Returns <tt>true</tt> if this set contains no elements. 97 * @return <tt>true</tt> if this set contains no elements 117 * Returns an array containing all of the elements in this set. 118 * If this set makes any guarantees as to what order its elements 120 * elements in the same order 336 Object[] elements = al.getArray(); local [all...] |
/cts/suite/pts/lib/commonutil/src/com/android/pts/util/ |
ReportLog.java | 157 StackTraceElement[] elements = Thread.currentThread().getStackTrace(); local 158 String names = elements[depth].getClassName() + "." + elements[depth].getMethodName() + 159 (addLineNumber ? ":" + elements[depth].getLineNumber() : "");
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
ANTLRRewriteRuleElementStream.h | 33 } Elements; 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/ |
ANTLRRewriteRuleElementStream.h | 33 } Elements; 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/ |
ANTLRRewriteRuleElementStream.h | 33 } Elements; 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/tool/src/main/java/org/antlr/misc/ |
IntSet.java | 47 /** Add all elements from incoming set to this set. Can limit 57 IntSet complement(IntSet elements);
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/scripts/ |
Fingerprints.js | 2 var formSelect=document.forms[0].elements[0]; 30 var formSelect=document.forms[0].elements[0];
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
ListEqualsTester.java | 39 "A List should equal any other List containing the same elements.", 48 "A List should not equal another List containing different elements.", 64 ArrayList<E> elements = new ArrayList<E>(getSampleElements()); local 65 elements.set(elements.size() / 2, null); 66 collection = getSubjectGenerator().create(elements.toArray());
|
/external/jmonkeyengine/engine/src/test/jme3test/animation/ |
SubtitleTrack.java | 10 import de.lessvoid.nifty.elements.render.TextRenderer;
|
/libcore/luni/src/test/java/tests/api/java/util/ |
AbstractQueueTest.java | 39 private Object[] elements = new Object[CAPACITY]; field in class:AbstractQueueTest.MockAbstractQueue 55 return (E) elements[currentIndex]; 63 elements[i] = elements[i + 1]; 83 elements[size++] = o; 91 E e = (E) elements[0]; 93 elements[i] = elements[i + 1]; 103 return (E) elements[0];
|
NoSuchElementExceptionTest.java | 35 v.elements().nextElement();
|