| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/utils/shapebuilders/ |
| BoxShapeBuilder.java | 45 final short i110 = builder.vertex(corner110); local
55 builder.rect(i000, i100, i110, i010);
57 builder.index(i000, i001, i010, i011, i110, i111, i100, i101);
60 builder.rect(i000, i100, i110, i010);
64 builder.rect(i000, i100, i110, i010);
67 builder.rect(i101, i111, i110, i100);
69 builder.rect(i110, i111, i011, i010);
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local
252 assert(std::is_heap_until(i110, i110+6) == i110+5);
|
| is_heap.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local
252 assert(std::is_heap(i110, i110+6) == (std::is_heap_until(i110, i110+6) == i110+6));
|
| is_heap_until_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local
253 assert(std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+2);
|
| is_heap_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local
253 assert(std::is_heap(i110, i110+6, std::greater<int>()) == (std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+6));
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local
252 assert(std::is_heap_until(i110, i110+6) == i110+5);
|
| is_heap.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local
252 assert(std::is_heap(i110, i110+6) == (std::is_heap_until(i110, i110+6) == i110+6));
|
| is_heap_until_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local
253 assert(std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+2);
|
| is_heap_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local
253 assert(std::is_heap(i110, i110+6, std::greater<int>()) == (std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+6));
[all...] |
| /art/test/083-compiler-regressions/src/ |
| Main.java | 1556 int i110 = 110; local
[all...] |
