| /libcore/ojluni/src/main/java/sun/security/util/ |
| AlgorithmDecomposer.java | 33 * The class decomposes standard algorithms into sub-elements.
46 Set<String> elements = new HashSet<>(); local
64 elements.add(token);
67 return elements;
71 * Decompose the standard algorithm name into sub-elements.
84 Set<String> elements = decomposeImpl(algorithm); local
94 if (elements.contains("SHA1") && !elements.contains("SHA-1")) {
95 elements.add("SHA-1");
97 if (elements.contains("SHA-1") && !elements.contains("SHA1"))
154 Set<String> elements = decomposeImpl(algorithm); local
[all...] |
| /developers/samples/android/ui/text/TextStyling-Java/app/src/main/java/com/android/example/text/styling/parser/ |
| TextMarkdown.java | 29 private final List<Element> elements; field in class:TextMarkdown
31 public TextMarkdown(@NonNull final List<Element> elements) {
32 this.elements = elements;
37 return elements;
|
| /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/main/java/org/mockito/internal/stubbing/answers/ |
| ReturnsElementsOf.java | 14 * Returns elements of the collection. Keeps returning the last element forever.
15 * Might be useful on occasion when you have a collection of elements to return.
34 private final LinkedList<Object> elements; field in class:ReturnsElementsOf
36 public ReturnsElementsOf(Collection<?> elements) {
37 if (elements == null) {
41 this.elements = new LinkedList<Object>(elements);
45 if (elements.size() == 1)
46 return elements.get(0);
48 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...] |
| /art/test/590-checker-arr-set-null-regression/src/ |
| Main.java | 20 Element[] elements = new Element[51]; local
21 testArraySetCheckCastNull(elements);
60 static void testArraySetCheckCastNull(Element[] elements) {
63 elements[42] = element;
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/concretesyntaxmodel/ |
| CsmMix.java | 11 * A group of elements that could be in any order.
14 private List<CsmElement> elements; field in class:CsmMix
16 public CsmMix(List<CsmElement> elements) {
17 if (elements == null) {
20 if (elements.stream().anyMatch(Objects::isNull)) {
23 this.elements = elements;
27 return elements;
32 elements.forEach(e -> e.prettyPrint(node, printer));
42 return elements != null ? elements.equals(csmMix.elements) : csmMix.elements == null
[all...] |
| CsmSequence.java | 31 private List<CsmElement> elements; field in class:CsmSequence
33 public CsmSequence(List<CsmElement> elements) {
34 if (elements == null) {
37 if (elements.stream().anyMatch(Objects::isNull)) {
40 this.elements = elements;
44 return elements;
49 elements.forEach(e -> e.prettyPrint(node, printer));
|
| /test/suite_harness/common/util/src/com/android/compatibility/common/util/ |
| Stacktrace.java | 47 StackTraceElement[] elements = Thread.currentThread().getStackTrace(); local
48 // Look for the first class name in the elements array that ends with Test
49 for (int i = 0; i < elements.length; i++) {
50 if (elements[i].getClassName().endsWith(TEST_POSTFIX)) {
51 return buildClassMethodName(elements, i, includeLineNumber);
56 return buildClassMethodName(elements, SAFETY_DEPTH, includeLineNumber);
60 StackTraceElement[] elements, int depth, boolean includeLineNumber) {
61 depth = Math.min(depth, elements.length - 1);
63 builder.append(elements[depth].getClassName()).append("#")
64 .append(elements[depth].getMethodName())
[all...] |
| /developers/samples/android/ui/text/TextStyling-Kotlin/app/src/test/java/com/android/example/text/styling/parser/ |
| ParserTest.kt | 29 val elements = Parser.parse(withQuote).elements
34 assertEquals(expected, elements)
40 val elements = Parser.parse(withQuote).elements
45 assertEquals(expected, elements)
51 val elements = Parser.parse(bulletPoints).elements
53 assertEquals(elements.size, 4)
54 assertEquals(elements[0].type, Element.Type.TEXT
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| RegularEnumSet.java | 42 private long elements = 0L; field in class:RegularEnumSet
49 elements = (-1L >>> (from.ordinal() - to.ordinal() - 1)) << from.ordinal();
54 elements = -1L >>> -universe.length;
59 elements = ~elements;
60 elements &= -1L >>> -universe.length; // Mask unused bits
65 * Returns an iterator over the elements contained in this set. The
66 * iterator traverses the elements in their <i>natural order</i> (which is
69 * ConcurrentModificationException}; the elements are traversed as they
72 * @return an iterator over the elements contained in this se
[all...] |
| JumboEnumSet.java | 30 * (i.e., those with more than 64 elements).
44 private long elements[]; field in class:JumboEnumSet
51 elements = new long[(universe.length + 63) >>> 6];
59 elements[fromIndex] = (-1L >>> (from.ordinal() - to.ordinal() - 1))
62 elements[fromIndex] = (-1L << from.ordinal());
64 elements[i] = -1;
65 elements[toIndex] = -1L >>> (63 - to.ordinal());
71 for (int i = 0; i < elements.length; i++)
72 elements[i] = -1;
73 elements[elements.length - 1] >>>= -universe.length
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationRootElements.java | 18 * Container and access methods for collation elements and weights
27 elements = rootElements;
47 * Same as the start of the compact root elements table.
72 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX].
83 return ((int)elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00;
90 return elements[(int)elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG;
97 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG;
105 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationRootElements.java | 17 * Container and access methods for collation elements and weights
25 elements = rootElements;
45 * Same as the start of the compact root elements table.
70 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX].
81 return ((int)elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00;
88 return elements[(int)elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG;
95 return elements[(int)elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG;
103 return ((int)elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00
[all...] |
| /developers/samples/android/ui/text/TextStyling-Java/app/src/test/java/com/android/example/text/styling/parser/ |
| ParserTest.java | 38 List<Element> elements = new Parser().parse(withQuote).getElements(); local
40 assertEquals(elements.size(), 2);
41 assertEquals(elements.get(0).getType(), QUOTE);
42 assertEquals(elements.get(0).getText(), "This is a quote.\n");
43 assertEquals(elements.get(1).getType(), TEXT);
44 assertEquals(elements.get(1).getText(), "This is not");
51 List<Element> elements = new Parser().parse(withQuote).getElements(); local
53 assertEquals(elements.size(), 2);
54 assertEquals(elements.get(0).getType(), TEXT);
55 assertEquals(elements.get(0).getText(), "This is not a quote.\n")
64 List<Element> elements = new Parser().parse(bulletPoints).getElements(); local
81 List<Element> elements = new Parser().parse(code).getElements(); local
98 List<Element> elements = new Parser().parse(code).getElements(); local
115 List<Element> elements = new Parser().parse(text).getElements(); local
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/resolution/types/ |
| ResolvedIntersectionType.java | 35 private List<ResolvedType> elements; field in class:ResolvedIntersectionType
37 public ResolvedIntersectionType(Collection<ResolvedType> elements) {
38 if (elements.size() < 2) {
39 throw new IllegalArgumentException("An intersection type should have at least two elements. This has " + elements.size());
41 this.elements = new LinkedList<>(elements);
51 return new HashSet<>(elements).equals(new HashSet<>(that.elements));
56 return new HashSet<>(elements).hashCode()
[all...] |
| /external/vogar/src/vogar/ |
| Classpath.java | 31 private final List<File> elements = new ArrayList<File>(); field in class:Classpath
39 result.elements.addAll(files);
43 public void addAll(File... elements) {
44 addAll(Arrays.asList(elements));
47 public void addAll(Collection<File> elements) {
48 this.elements.addAll(elements);
52 this.elements.addAll(anotherClasspath.elements);
56 return elements;
[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/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListGenerators.java | 46 @Override protected List<String> create(String[] elements) {
47 return ImmutableList.copyOf(elements);
52 @Override protected List<String> create(String[] elements) {
54 for (String element : elements) {
63 @Override protected List<String> create(String[] elements) {
65 .addAll(asList(elements))
72 @Override protected List<String> create(String[] elements) {
73 List<String> list = asList(elements);
81 @Override protected List<String> create(String[] elements) {
83 String[] all = new String[elements.length + suffix.length]
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/type/ |
| IntersectionType.java | 24 private List<ReferenceType> elements; field in class:IntersectionType
26 public IntersectionType(Range range, List<ReferenceType> elements) {
28 setElements(elements);
31 public IntersectionType(List<ReferenceType> elements) {
33 setElements(elements);
47 return elements;
50 public IntersectionType setElements(List<ReferenceType> elements) {
51 if (this.elements != null) {
52 for (ReferenceType element : elements){
56 this.elements = elements
[all...] |
| UnionType.java | 16 private List<ReferenceType> elements; field in class:UnionType
18 public UnionType(Range range, List<ReferenceType> elements) {
20 setElements(elements);
23 public UnionType(List<ReferenceType> elements) {
25 setElements(elements);
29 return elements;
32 public UnionType setElements(List<ReferenceType> elements) {
33 if (this.elements != null) {
34 for (ReferenceType element : elements){
38 this.elements = elements
[all...] |
| /toolchain/binutils/binutils-2.27/libiberty/ |
| partition.c | 39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
53 part->elements[e].class_element = e;
54 part->elements[e].next = &(part->elements[e]);
55 part->elements[e].class_count = 1;
77 struct partition_elem *elements = part->elements; local
83 int class_element = elements[elem1].class_element;
86 if (class_element == elements[elem2].class_element)
91 if (elements[elem1].class_count < elements[elem2].class_count)
144 struct partition_elem *elements = part->elements; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationrootelements.h | 27 * Container and access methods for collation elements and weights
36 : elements(rootElements), length(rootElementsLength) {}
56 * Same as the start of the compact root elements table.
81 * Currently the same as elements[IX_FIRST_TERTIARY_INDEX].
93 return (elements[IX_SEC_TER_BOUNDARIES] << 8) & 0xff00;
100 return elements[elements[IX_FIRST_TERTIARY_INDEX]] & ~SEC_TER_DELTA_FLAG;
107 return elements[elements[IX_FIRST_SECONDARY_INDEX] - 1] & ~SEC_TER_DELTA_FLAG;
115 return (elements[IX_SEC_TER_BOUNDARIES] >> 16) & 0xff00
269 const uint32_t *elements; member in class:CollationRootElements
[all...] |
| /external/flac/libFLAC/include/private/ |
| memory.h | 49 FLAC__bool FLAC__memory_alloc_aligned_int32_array(size_t elements, FLAC__int32 **unaligned_pointer, FLAC__int32 **aligned_pointer);
50 FLAC__bool FLAC__memory_alloc_aligned_uint32_array(size_t elements, FLAC__uint32 **unaligned_pointer, FLAC__uint32 **aligned_pointer);
51 FLAC__bool FLAC__memory_alloc_aligned_uint64_array(size_t elements, FLAC__uint64 **unaligned_pointer, FLAC__uint64 **aligned_pointer);
52 FLAC__bool FLAC__memory_alloc_aligned_unsigned_array(size_t elements, unsigned **unaligned_pointer, unsigned **aligned_pointer);
54 FLAC__bool FLAC__memory_alloc_aligned_real_array(size_t elements, FLAC__real **unaligned_pointer, FLAC__real **aligned_pointer);
|
