| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | MultisetWritesTester.java | 58 int oldCount = getMultiset().count(samples.e0); in testAddOccurrences()
60 oldCount, getMultiset().add(samples.e0, 2)); in testAddOccurrences()
62 oldCount + 2, getMultiset().count(samples.e0)); in testAddOccurrences()
68 getMultiset().add(samples.e0, 2); in testAddOccurrences_unsupported()
77 1, getMultiset().remove(samples.e0, 2)); in testRemove_occurrences_present()
79 getMultiset().contains(samples.e0)); in testRemove_occurrences_present()
100 int oldCount = getMultiset().count(samples.e0); in testRemove_occurrences_0()
102 oldCount, getMultiset().remove(samples.e0, 0)); in testRemove_occurrences_0()
108 getMultiset().remove(samples.e0, -1); in testRemove_occurrences_negative()
134 Multisets.immutableEntry(samples.e0, 1), iterator.next()); in testEntrySet_iterator()
[all …]
|
| D | MultisetReadsTester.java | 51 1, getMultiset().count(samples.e0)); in testCount_1()
58 3, getMultiset().count(samples.e0)); in testCount_3()
74 getMultiset().elementSet().contains(samples.e0)); in testElementSet_contains()
81 Multisets.immutableEntry(samples.e0, 1))); in testEntrySet_contains()
92 getMultiset().entrySet().contains(samples.e0)); in testEntrySet_contains_nonentry()
109 1 ^ samples.e0.hashCode(), getMultiset().entrySet().hashCode()); in testEntrySet_hashCode_size1()
119 other.add(samples.e0); in testEquals_differentSize()
127 other.remove(samples.e0); in testEquals_differentElements()
142 1 ^ samples.e0.hashCode(), getMultiset().hashCode()); in testHashCode_size1()
|
| D | MultisetIteratorTester.java | 42 Arrays.asList(samples.e0, samples.e1, samples.e1, samples.e2)), in testRemovingIteratorKnownOrder()
46 return getSubjectGenerator().create(samples.e0, samples.e1, samples.e1, samples.e2) in testRemovingIteratorKnownOrder()
55 new IteratorTester<E>(4, IteratorFeature.MODIFIABLE, Arrays.asList(samples.e0, samples.e1, in testRemovingIteratorUnknownOrder()
59 return getSubjectGenerator().create(samples.e0, samples.e1, samples.e1, samples.e2) in testRemovingIteratorUnknownOrder()
69 Arrays.asList(samples.e0, samples.e1, samples.e1, samples.e2)), in testIteratorKnownOrder()
73 return getSubjectGenerator().create(samples.e0, samples.e1, samples.e1, samples.e2) in testIteratorKnownOrder()
82 new IteratorTester<E>(4, IteratorFeature.UNMODIFIABLE, Arrays.asList(samples.e0, samples.e1, in testIteratorUnknownOrder()
86 return getSubjectGenerator().create(samples.e0, samples.e1, samples.e1, samples.e2) in testIteratorUnknownOrder()
|
| D | AbstractMultisetSetCountTester.java | 113 assertSetCount(samples.e0, 1); in assertOneToOne()
118 assertSetCount(samples.e0, 3); in assertThreeToThree()
196 assertSetCount(samples.e0, 3); in testSetCount_oneToThree_supported()
220 assertSetCount(samples.e0, 0); in testSetCount_oneToZero_supported()
227 assertSetCount(samples.e0, 0); in testSetCount_threeToZero_supported()
234 assertSetCount(samples.e0, 1); in testSetCount_threeToOne_supported()
240 assertSetCountDecreasingFailure(samples.e0, 0); in testSetCount_oneToZero_unsupported()
247 assertSetCountDecreasingFailure(samples.e0, 0); in testSetCount_threeToZero_unsupported()
254 assertSetCountDecreasingFailure(samples.e0, 1); in testSetCount_threeToOne_unsupported()
|
| D | AbstractMultisetTester.java | 36 getSubjectGenerator().create(samples.e0, samples.e0, samples.e0); in initThreeCopies()
|
| D | MultisetSetCountConditionallyTester.java | 81 getMultiset().setCount(samples.e0, 2, 3)); in testSetCountConditional_oldCountTooLarge()
89 getMultiset().setCount(samples.e0, 0, 2)); in testSetCountConditional_oldCountTooSmallZero()
98 getMultiset().setCount(samples.e0, 1, 5)); in testSetCountConditional_oldCountTooSmallNonzero()
99 expectContents(nCopies(3, samples.e0)); in testSetCountConditional_oldCountTooSmallNonzero()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| D | ListAddAllTester.java | 41 getList().addAll(MinimalCollection.of(samples.e0))); in testAddAll_supportedAllPresent()
42 expectAdded(samples.e0); in testAddAll_supportedAllPresent()
49 getList().addAll(MinimalCollection.of(samples.e0)); in testAddAll_unsupportedAllPresent()
59 = MinimalCollection.of(samples.e0, samples.e1, samples.e0, samples.e1); in testAddAll_withDuplicates()
62 expectAdded(samples.e0, samples.e1, samples.e0, samples.e1); in testAddAll_withDuplicates()
|
| D | CollectionRemoveAllTester.java | 62 collection.removeAll(MinimalCollection.of(samples.e0))); in testRemoveAll_allPresent()
63 expectMissing(samples.e0); in testRemoveAll_allPresent()
70 collection.removeAll(MinimalCollection.of(samples.e0, samples.e3))); in testRemoveAll_somePresent()
71 expectMissing(samples.e0); in testRemoveAll_somePresent()
82 samples.e0, samples.e0, samples.e0, in testRemoveAll_somePresentLargeCollectionToRemove()
84 expectMissing(samples.e0); in testRemoveAll_somePresentLargeCollectionToRemove()
113 collection.removeAll(MinimalCollection.of(samples.e0)); in testRemoveAll_unsupportedPresent()
119 assertTrue(collection.contains(samples.e0)); in testRemoveAll_unsupportedPresent()
|
| D | ListAddAllAtIndexTester.java | 48 getList().addAll(0, MinimalCollection.of(samples.e0))); in testAddAllAtIndex_supportedAllPresent()
49 expectAdded(0, samples.e0); in testAddAllAtIndex_supportedAllPresent()
56 getList().addAll(0, MinimalCollection.of(samples.e0)); in testAddAllAtIndex_unsupportedAllPresent()
67 getList().addAll(0, MinimalCollection.of(samples.e0, samples.e3))); in testAddAllAtIndex_supportedSomePresent()
68 expectAdded(0, samples.e0, samples.e3); in testAddAllAtIndex_supportedSomePresent()
75 getList().addAll(0, MinimalCollection.of(samples.e0, samples.e3)); in testAddAllAtIndex_unsupportedSomePresent()
103 = MinimalCollection.of(samples.e0, samples.e1, samples.e0, samples.e1); in testAddAllAtIndex_withDuplicates()
106 expectAdded(0, samples.e0, samples.e1, samples.e0, samples.e1); in testAddAllAtIndex_withDuplicates()
|
| D | MapNavigationTester.java | 97 assertNull(navigableMap.lowerEntry(samples.e0.getKey())); in testEmptyMapNearby()
98 assertNull(navigableMap.lowerKey(samples.e0.getKey())); in testEmptyMapNearby()
99 assertNull(navigableMap.floorEntry(samples.e0.getKey())); in testEmptyMapNearby()
100 assertNull(navigableMap.floorKey(samples.e0.getKey())); in testEmptyMapNearby()
101 assertNull(navigableMap.ceilingEntry(samples.e0.getKey())); in testEmptyMapNearby()
102 assertNull(navigableMap.ceilingKey(samples.e0.getKey())); in testEmptyMapNearby()
103 assertNull(navigableMap.higherEntry(samples.e0.getKey())); in testEmptyMapNearby()
104 assertNull(navigableMap.higherKey(samples.e0.getKey())); in testEmptyMapNearby()
138 assertNull(navigableMap.lowerEntry(samples.e0.getKey())); in testSingletonMapNearby()
139 assertNull(navigableMap.lowerKey(samples.e0.getKey())); in testSingletonMapNearby()
[all …]
|
| D | MapRemoveTester.java | 46 samples.e0.getValue(), getMap().remove(samples.e0.getKey())); in testRemove_present()
49 expectMissing(samples.e0); in testRemove_present()
76 getMap().remove(samples.e0.getKey()); in testRemove_unsupported()
82 samples.e0.getValue(), get(samples.e0.getKey())); in testRemove_unsupported()
|
| D | QueuePollTester.java | 50 samples.e0, getQueue().poll()); in testPoll_size1()
51 expectMissing(samples.e0); in testPoll_size1()
58 samples.e0, getQueue().poll()); in testPoll_sizeMany()
59 expectMissing(samples.e0); in testPoll_sizeMany()
|
| D | SetNavigationTester.java | 93 assertNull(navigableSet.lower(samples.e0)); in testEmptySetNearby()
94 assertNull(navigableSet.floor(samples.e0)); in testEmptySetNearby()
95 assertNull(navigableSet.ceiling(samples.e0)); in testEmptySetNearby()
96 assertNull(navigableSet.higher(samples.e0)); in testEmptySetNearby()
128 assertNull(navigableSet.lower(samples.e0)); in testSingletonSetNearby()
129 assertEquals(a, navigableSet.floor(samples.e0)); in testSingletonSetNearby()
130 assertEquals(a, navigableSet.ceiling(samples.e0)); in testSingletonSetNearby()
131 assertNull(navigableSet.higher(samples.e0)); in testSingletonSetNearby()
|
| D | QueueRemoveTester.java | 55 samples.e0, getQueue().remove()); in testRemove_size1()
56 expectMissing(samples.e0); in testRemove_size1()
63 samples.e0, getQueue().remove()); in testRemove_sizeMany()
64 expectMissing(samples.e0); in testRemove_sizeMany()
|
| D | CollectionRemoveTester.java | 47 collection.remove(samples.e0)); in testRemove_present()
50 expectMissing(samples.e0); in testRemove_present()
76 collection.remove(samples.e0); in testRemove_unsupported()
82 collection.contains(samples.e0)); in testRemove_unsupported()
127 assertTrue(collection.contains(samples.e0)); in testIteratorRemove_unsupported()
|
| D | CollectionAddAllTester.java | 84 collection.addAll(MinimalCollection.of(samples.e3, samples.e0))); in testAddAll_supportedSomePresent()
86 assertTrue("should contain " + samples.e0, collection.contains(samples.e0)); in testAddAll_supportedSomePresent()
93 collection.addAll(MinimalCollection.of(samples.e3, samples.e0)); in testAddAll_unsupportedSomePresent()
105 collection.addAll(MinimalCollection.of(samples.e0))); in testAddAll_unsupportedAllPresent()
|
| D | CollectionRetainAllTester.java | 88 samples.e0, samples.e1, samples.e2, samples.e3, samples.e4), in setUp()
95 MinimalCollection.of(samples.e0, samples.e0, samples.e3, samples.e3), in setUp()
125 expectMissing(samples.e0, samples.e1, samples.e2); in testRetainAll_emptyPreviouslyNonEmpty()
156 expectMissing(samples.e0, samples.e1, samples.e2); in testRetainAll_disjointPreviouslyNonEmpty()
232 expectContents(samples.e0); in testRetainAll_containsDuplicatesSizeOne()
239 expectContents(samples.e0); in testRetainAll_containsDuplicatesSizeSeveral()
|
| /external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
| D | Intersection.java | 97 Vector3f e0 = vars.vect4, in intersect() local
114 tmp1.subtract(tmp0, e0); // tri edge 0 in intersect()
122 float fex = FastMath.abs(e0.x); in intersect()
123 float fey = FastMath.abs(e0.y); in intersect()
124 float fez = FastMath.abs(e0.z); in intersect()
129 p0 = e0.z * tmp0.y - e0.y * tmp0.z; in intersect()
130 p2 = e0.z * tmp2.y - e0.y * tmp2.z; in intersect()
140 p0 = -e0.z * tmp0.x + e0.x * tmp0.z; in intersect()
141 p2 = -e0.z * tmp2.x + e0.x * tmp2.z; in intersect()
151 p1 = e0.y * tmp1.x - e0.x * tmp1.y; in intersect()
[all …]
|
| /external/skia/src/core/ |
| D | SkConcaveToTriangles.cpp | 218 VertexType classify(Vertex **e0, Vertex **e1);
455 Vertex::VertexType Vertex::classify(Vertex **e0, Vertex **e1) { in classify() argument
469 *e0 = prev(); in classify()
475 *e0 = this; in classify()
478 *e0 = prev(); in classify()
485 *e0 = this; // flat to the left in classify()
489 *e0 = prev(); // concave to the left in classify()
497 *e0 = this; in classify()
503 *e0 = prev(); in classify()
506 *e0 = this; in classify()
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | SampleElements.java | 30 public final E e0; field in SampleElements
36 public SampleElements(E e0, E e1, E e2, E e3, E e4) { in SampleElements() argument
37 this.e0 = e0; in SampleElements()
68 Helpers.mapEntry(keys.e0, values.e0), in mapEntries()
|
| /external/v8/test/mjsunit/ |
| D | error-constructors.js | 41 var e0 = new ReferenceError(); variable
44 assertTrue(e0.hasOwnProperty('stack'));
46 assertTrue(e0.hasOwnProperty('type'));
48 assertTrue(e0.hasOwnProperty('arguments'));
|
| D | array-literal-transitions.js | 83 var e0 = [1, 2, 3.5];
84 assertTrue(%HasFastDoubleElements(e0));
85 assertEquals(3.5, e0[2]);
86 assertEquals(2, e0[1]);
87 assertEquals(1, e0[0]);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | ImmutableMultimapTest.java | 103 0, unhashables.e0); in testUnhashableSingletonValue()
105 assertTrue(multimap.get(0).contains(unhashables.e0)); in testUnhashableSingletonValue()
111 0, unhashables.e0, 2, "hey you", 0, unhashables.e1); in testUnhashableMixedValues()
113 assertTrue(multimap.get(0).contains(unhashables.e0)); in testUnhashableMixedValues()
|
| /external/fdlibm/ |
| D | e_rem_pio2.c | 92 int e0,i,j,nx,n,ix,hx; local
163 e0 = (ix>>20)-1046; /* e0 = ieee_ilogb(z)-23; */
164 __HI(z) = ix - (e0<<20);
172 n = __kernel_rem_pio2(tx,y,e0,nx,2,two_over_pi);
|
| /external/llvm/test/TableGen/ |
| D | SetTheory.td | 136 def e0;
146 def E : Set<(add e0, e1, e2, e3, e4, e5, e6, e7, e8, e9)>;
152 // CHECK: S8a = [ e0 e3 e6 e9 ]
153 // CHECK: S8b = [ e0 e9 ]
154 // CHECK: S8c = [ e0 ]
156 // CHECK: S8e = [ e0 e2 e4 e6 e8 e1 e3 e5 e7 e9 ]
166 // CHECK: S9c = [ e0 ]
167 // CHECK: S9d = [ a b c d e0 e3 e6 e9 e4 e5 e7 ]
174 // CHECK: T0b = [ e0 e1 e2 e3 e4 e5 e6 e7 e8 e9 ]
|