| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| RemoveFormatCommand.cpp | 50 DEFINE_STATIC_LOCAL(HashSet<QualifiedName>, elements, ());
51 if (elements.isEmpty()) {
52 elements.add(acronymTag);
53 elements.add(bTag);
54 elements.add(bdoTag);
55 elements.add(bigTag);
56 elements.add(citeTag);
57 elements.add(codeTag);
58 elements.add(dfnTag);
59 elements.add(emTag)
[all...] |
| /libcore/luni/src/main/java/java/security/ |
| PermissionsHash.java | 53 public Enumeration elements() { method in class:PermissionsHash
54 return perms.elements();
68 for (Enumeration elements = elements(); elements.hasMoreElements();) {
69 if (((Permission)elements.nextElement()).implies(permission)) {
|
| /external/clang/test/SemaCXX/ |
| 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/internal/stubbing/answers/ |
| 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) {
38 if (elements == null) {
42 this.elements = new LinkedList<Object>(elements);
46 if (elements.size() == 1)
47 return elements.get(0);
49 return elements.poll();
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntArrayList.java | 39 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.length
106 public int[] elements() { method in class:IntArrayList
[all...] |
| OrderedHashSet.java | 35 /** 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. Note that you ar
87 public List<T> elements() { method in class:OrderedHashSet
[all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| LongVector.java | 23 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/ |
| 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) {
27 super(elements);
|
| /external/flac/libFLAC/include/private/ |
| memory.h | 48 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/ |
| AbstractContainerTester.java | 27 * and {@link java.util.Map Map}) that contain elements.
84 * @param elements expected contents of {@link #container}
86 protected final void expectContents(E... elements) {
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) {
174 public final E[] elements; field in class:AbstractContainerTester.ArrayWithDuplicate
188 E[] elements = createSamplesArray(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.java | 33 /** 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
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListGenerators.java | 43 @Override protected List<String> create(String[] elements) {
44 return ImmutableList.copyOf(elements);
49 @Override protected List<String> create(String[] elements) {
51 for (String element : elements) {
60 @Override protected List<String> create(String[] elements) {
62 .addAll(asList(elements))
69 @Override protected List<String> create(String[] elements) {
70 List<String> list = asList(elements);
78 @Override protected List<String> create(String[] elements) {
80 String[] all = new String[elements.length + suffix.length]
[all...] |
| /external/stlport/test/unit/ |
| 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==33)
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| 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==33)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| 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==33)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| RemoteDebugEventSocketListener.cs | 337 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[0].Equals("enterAlt"))
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
| RemoteDebugEventSocketListener.cs | 420 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[0].Equals( "enterAlt" )
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
| RemoteDebugEventSocketListener.java | 254 String[] elements = getEventElements(line); local
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[0].equals("enterAlt") )
481 String[] elements = new String[MAX_EVENT_ELEMENTS]; local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| ArrayDeque.java | 17 * Null elements are prohibited. This class is likely to be faster than
51 * @param <E> the type of elements held in this collection
57 * The array in which the elements of the deque are stored.
64 * deque elements are always null.
66 private transient Object[] elements; field in class:ArrayDeque
90 * Allocate empty array to hold the given number of elements.
92 * @param numElements the number of elements to hold
96 // Find the best power of two to hold elements.
107 if (initialCapacity < 0) // Too many elements, must back off
108 initialCapacity >>>= 1;// Good luck allocating 2 ^ 30 elements
506 final Object[] elements = this.elements; local
[all...] |
| PriorityQueue.java | 24 * A PriorityQueue holds elements on a priority heap, which orders the elements
26 * construction time. If the queue uses natural ordering, only elements that are
49 private transient E[] elements; field in class:PriorityQueue
87 elements = newElementArray(initialCapacity);
92 * Constructs a priority queue that contains the elements of a collection.
95 * elements.
98 * the collection whose elements will be added to the priority
101 * if any of the elements in the collection are not comparable.
103 * if any of the elements in the collection are null
[all...] |
| /cts/tools/signature-tools/src/signature/model/impl/ |
| SigAnnotation.java | 30 private Set<IAnnotationElement> elements; field in class:SigAnnotation
34 elements = Collections.emptySet();
46 return elements;
49 public void setElements(Set<IAnnotationElement> elements) {
50 this.elements = elements;
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.as | 30 /** 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)
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_node_data_mac.cc | 18 elements,
26 elements,
39 elements,
|
| /frameworks/base/core/java/com/google/android/collect/ |
| Lists.java | 42 * elements.
55 * @param elements the elements that the list should contain, in order
56 * @return a newly-created {@code ArrayList} containing those elements
58 public static <E> ArrayList<E> newArrayList(E... elements) {
59 int capacity = (elements.length * 110) / 100 + 5;
61 Collections.addAll(list, elements);
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_pasteboard_helper_mac.h | 17 // Writes a set of bookmark elements from a profile to the general pasteboard.
19 void WriteToClipboard(const std::vector<BookmarkNodeData::Element>& elements,
22 // Writes a set of bookmark elements from a profile to the dragging pasteboard
25 const std::vector<BookmarkNodeData::Element>& elements,
28 // Reads a set of bookmark elements from the general copy/paste clipboard.
29 bool ReadFromClipboard(std::vector<BookmarkNodeData::Element>& elements,
32 // Reads a set of bookmark elements from the drag and drop clipboard.
33 bool ReadFromDragClipboard(std::vector<BookmarkNodeData::Element>& elements,
37 // bookmark elements. It currently does not consider a plaintext url a
42 // elements
[all...] |
