/external/clang/test/Parser/ |
pragma-options.cpp | 5 #pragma options align=natural
|
pragma-options.c | 9 #pragma options align=natural 19 #pragma align=natural
|
/external/guava/guava-tests/test/com/google/common/collect/ |
SortedIterablesTest.java | 37 ASSERT.that(SortedIterables.sortedCounts(Ordering.natural(), list)) 47 ASSERT.that(SortedIterables.sortedCounts(Ordering.natural(), list.iterator())) 55 assertTrue(SortedIterables.hasSameComparator(Ordering.natural(), Sets.newTreeSet())); 59 SortedIterables.hasSameComparator(Ordering.natural(), Maps.newTreeMap().keySet())); 61 assertTrue(SortedIterables.hasSameComparator(Ordering.natural().reverse(), 62 Sets.newTreeSet(Ordering.natural().reverse())));
|
BstRangeOpsTest.java | 64 countAggregate, GeneralRange.downTo(Ordering.natural(), c, type), ROOT); 78 countAggregate, GeneralRange.upTo(Ordering.natural(), c, type), ROOT); 98 Ordering.natural(), chars.charAt(i), lb, chars.charAt(j), ub), ROOT); 119 countAggregate, GeneralRange.<Character>all(Ordering.natural()), ROOT)); 124 GeneralRange<Character> range = GeneralRange.all(Ordering.natural()); 142 GeneralRange<Character> range1 = GeneralRange.downTo(Ordering.natural(), 'f', CLOSED); 145 GeneralRange<Character> range2 = GeneralRange.downTo(Ordering.natural(), 'f', OPEN); 148 GeneralRange<Character> range3 = GeneralRange.downTo(Ordering.natural(), 'a', CLOSED); 151 GeneralRange<Character> range4 = GeneralRange.downTo(Ordering.natural(), 'a', OPEN); 154 GeneralRange<Character> range5 = GeneralRange.downTo(Ordering.natural(), 'c', OPEN) [all...] |
SubMapMultimapAsMapImplementsMapTest.java | 41 = TreeMultimap.create(Ordering.<String>natural().nullsFirst(), 42 Ordering.<Integer>natural().nullsFirst());
|
ImmutableTableTest.java | 224 = builder.orderRowsBy(Ordering.natural()) 225 .orderColumnsBy(Ordering.natural()) 236 builder.orderRowsBy(Ordering.natural()); 237 builder.orderColumnsBy(Ordering.natural()); 259 builder.orderRowsBy(Ordering.natural()); 260 builder.orderColumnsBy(Ordering.natural()); 281 builder.orderRowsBy(Ordering.natural()); 299 builder.orderRowsBy(Ordering.natural()); 316 builder.orderColumnsBy(Ordering.natural()); 334 builder.orderColumnsBy(Ordering.natural()); [all...] |
TreeMultimapNaturalTest.java | 44 * Unit tests for {@code TreeMultimap} with natural ordering. 64 * Create and populate a {@code TreeMultimap} with the natural ordering of 149 assertSame(Ordering.natural(), multimap.get("foo").comparator()); 150 assertSame(Ordering.natural(), multimap.get("missing").comparator()); 200 Ordering.natural(); 203 Ordering.natural().reverse().nullsFirst(); 218 assertSame(Ordering.natural(), copyFromTree.keyComparator()); 219 assertSame(Ordering.natural(), copyFromTree.valueComparator()); 220 assertSame(Ordering.natural(), copyFromTree.get(1.0).comparator()); 225 * results in natural ordering [all...] |
BstOperationsTest.java | 60 assertEquals(a, BstOperations.seek(Ordering.natural(), d, 'a')); 61 assertEquals(b, BstOperations.seek(Ordering.natural(), d, 'b')); 62 assertNull(BstOperations.seek(Ordering.natural(), d, 'c')); 63 assertEquals(d, BstOperations.seek(Ordering.natural(), d, 'd')); 64 assertNull(BstOperations.seek(Ordering.natural(), d, 'e')); 65 assertEquals(f, BstOperations.seek(Ordering.natural(), d, 'f')); 66 assertEquals(g, BstOperations.seek(Ordering.natural(), d, 'g')); 80 assertNull(BstOperations.seek(Ordering.natural(), d, 'a')); 81 assertEquals(b, BstOperations.seek(Ordering.natural(), d, 'b')); 82 assertEquals(c, BstOperations.seek(Ordering.natural(), d, 'c')) [all...] |
BstNodeTest.java | 98 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural())); 107 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural())); 116 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
|
OrderingTest.java | 59 Ordering<Integer> comparator = Ordering.natural(); 75 assertEquals("Ordering.natural()", comparator.toString()); 87 Ordering.from(Ordering.<String>natural()); 90 .addEqualityGroup(orderingFromOrdering, Ordering.natural()) 223 return Ordering.natural().onResultOf(CharAtFunction.values()[index]); 300 .addEqualityGroup(Ordering.natural().reverse()) 321 = Ordering.natural().reverse(); 325 = Ordering.natural().onResultOf(StringLengthFunction.StringLength); 333 Ordering.natural().onResultOf(StringLengthFunction.StringLength)) 337 assertEquals("Ordering.natural().onResultOf(StringLength)" [all...] |
TreeMultimapExplicitTest.java | 66 Ordering.<Integer>natural().reverse().nullsFirst(); 90 * Test that a TreeMultimap created from another uses the natural ordering. 106 assertEquals(Ordering.natural(), copy.keyComparator()); 107 assertEquals(Ordering.natural(), copy.valueComparator()); 108 assertEquals(Ordering.natural(), copy.get("google").comparator());
|
GeneralRangeTest.java | 38 private static final Ordering<Integer> ORDERING = Ordering.natural().nullsFirst(); 174 assertEquals(GeneralRange.all(Ordering.natural()), GeneralRange.from(Ranges.all())); 179 assertEquals(GeneralRange.upTo(Ordering.natural(), 3, endpointType), 182 assertEquals(GeneralRange.downTo(Ordering.natural(), 3, endpointType), 190 assertEquals(GeneralRange.range(Ordering.natural(), 3, lowerType, 4, upperType),
|
ForwardingSortedMapImplementsMapTest.java | 52 new TreeMap<String, Integer>(Ordering.natural().nullsFirst()));
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
TreeMultimap.java | 32 * their natural ordering or by supplied comparators. In all cases, this 43 * through the keys according to the key comparator ordering or the natural 46 * to the value comparator ordering or the natural ordering of the values. The 72 * Creates an empty {@code TreeMultimap} ordered by the natural ordering of 77 return new TreeMultimap<K, V>(Ordering.natural(), Ordering.natural()); 82 * Neither comparator may be null; use {@link Ordering#natural()} to specify 83 * natural order. 96 * Constructs a {@code TreeMultimap}, ordered by the natural ordering of its 103 return new TreeMultimap<K, V>(Ordering.natural(), Ordering.natural() [all...] |
ImmutableSortedSet.java | 51 private static final Comparator NATURAL_ORDER = Ordering.natural(); 78 return ofInternal(Ordering.natural(), element); 84 return ofInternal(Ordering.natural(), e1, e2); 90 return ofInternal(Ordering.natural(), e1, e2, e3); 96 return ofInternal(Ordering.natural(), e1, e2, e3, e4); 102 return ofInternal(Ordering.natural(), e1, e2, e3, e4, e5); 113 return ofInternal(Ordering.natural(), (E[]) all.toArray(new Comparable[0])); 141 return copyOfInternal(Ordering.natural(), elements, false); 146 return copyOfInternal(Ordering.natural(), elements, false); 151 return copyOfInternal(Ordering.natural(), elements) [all...] |
ImmutableSortedMap.java | 46 private static final Comparator NATURAL_ORDER = Ordering.natural(); 62 // non-null instance of Ordering.natural(). 65 // If map has a null comparator, the keys should have a natural ordering, 94 return create(Ordering.natural(), entryOf(k1, v1)); 99 return new Builder<K, V>(Ordering.natural()) 105 return new Builder<K, V>(Ordering.natural()) 111 return new Builder<K, V>(Ordering.natural()) 117 return new Builder<K, V>(Ordering.natural()) 123 return copyOfInternal(map, Ordering.natural()); 133 // If map has a null comparator, the keys should have a natural ordering [all...] |
RegularContiguousSet.java | 134 C lowerEndpoint = Ordering.natural().max(this.first(), other.first()); 135 C upperEndpoint = Ordering.natural().min(this.last(), other.last());
|
/external/qemu/audio/ |
mixeng.c | 32 #define ENDIAN_CONVERSION natural 68 #define ENDIAN_CONVERSION natural 89 #define ENDIAN_CONVERSION natural 110 #define ENDIAN_CONVERSION natural 131 #define ENDIAN_CONVERSION natural
|
/external/guava/guava/src/com/google/common/collect/ |
ImmutableSortedSet.java | 41 * natural sort ordering of their elements. Either way, null elements are not 67 * With natural ordering of elements, the following relation determines whether 93 Ordering.natural(); 125 ImmutableList.of(element), Ordering.natural()); 130 * their natural ordering. When multiple elements are equivalent according to 138 return copyOf(Ordering.natural(), Arrays.asList(e1, e2)); 143 * their natural ordering. When multiple elements are equivalent according to 151 return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3)); 156 * their natural ordering. When multiple elements are equivalent according to 164 return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3, e4)) [all...] |
TreeMultimap.java | 36 * their natural ordering or by supplied comparators. In all cases, this 47 * through the keys according to the key comparator ordering or the natural 50 * to the value comparator ordering or the natural ordering of the values. The 76 * Creates an empty {@code TreeMultimap} ordered by the natural ordering of 81 return new TreeMultimap<K, V>(Ordering.natural(), Ordering.natural()); 86 * Neither comparator may be null; use {@link Ordering#natural()} to specify 87 * natural order. 100 * Constructs a {@code TreeMultimap}, ordered by the natural ordering of its 107 return new TreeMultimap<K, V>(Ordering.natural(), Ordering.natural() [all...] |
ImmutableSortedMultiset.java | 32 * are ordered by an explicit comparator, while others follow the natural sort ordering of their 57 * With natural ordering of elements, the following relation determines whether two elements are 79 private static final Comparator<Comparable> NATURAL_ORDER = Ordering.natural(); 101 * Returns an immutable sorted multiset containing the given elements sorted by their natural 108 return copyOf(Ordering.natural(), Arrays.asList(e1, e2)); 112 * Returns an immutable sorted multiset containing the given elements sorted by their natural 119 return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3)); 123 * Returns an immutable sorted multiset containing the given elements sorted by their natural 131 return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3, e4)); 135 * Returns an immutable sorted multiset containing the given elements sorted by their natural [all...] |
Range.java | 230 if (Ordering.natural().equals(comparator) || comparator == null) { 314 Cut<C> newLower = Ordering.natural().max(lowerBound, other.lowerBound); 315 Cut<C> newUpper = Ordering.natural().min(upperBound, other.upperBound); 370 Cut<C> newLower = Ordering.natural().min(lowerBound, other.lowerBound); 371 Cut<C> newUpper = Ordering.natural().max(upperBound, other.upperBound);
|
ImmutableSortedMap.java | 72 Ordering.natural(); 106 ImmutableList.of(entryOf(k1, v1)), Ordering.natural()); 111 * natural ordering of their keys. 114 * their natural ordering 118 return new Builder<K, V>(Ordering.natural()) 124 * natural ordering of their keys. 127 * their natural ordering 131 return new Builder<K, V>(Ordering.natural()) 137 * natural ordering of their keys. 140 * their natural orderin [all...] |
Ranges.java | 246 min = Ordering.natural().min(min, value); 247 max = Ordering.natural().max(max, value);
|
/external/clang/test/Sema/ |
pragma-pack-and-options-align.c | 12 #pragma options align=natural
|