| /dports/shells/ksh93-devel/ast-cc1bca27/src/cmd/dsslib/bgp/data/ |
| H A D | cisco-split.dat | 24 *>i112.224.174.125/32
|
| /dports/shells/ksh93/ast-93u/src/cmd/dsslib/bgp/data/ |
| H A D | cisco-split.dat | 24 *>i112.224.174.125/32
|
| /dports/shells/ast-ksh/ast-ksh93v/src/cmd/dsslib/bgp/data/ |
| H A D | cisco-split.dat | 24 *>i112.224.174.125/32
|
| /dports/math/openblas/OpenBLAS-0.3.18/kernel/power/ |
| H A D | izamin.c | 290 [i64] "b"(64), [i80] "b"(80), [i96] "b"(96), [i112] "b"(112), in ziamin_kernel_16_TUNED()
|
| H A D | izamax.c | 293 [i64] "b"(64), [i80] "b"(80), [i96] "b"(96), [i112] "b"(112), in ziamax_kernel_16()
|
| H A D | idamin.c | 309 [i64] "b"(64), [i80] "b"(80), [i96] "b"(96), [i112] "b"(112), in diamin_kernel_32()
|
| H A D | idamax.c | 311 [i64] "b"(64), [i80] "b"(80), [i96] "b"(96), [i112] "b"(112), in diamax_kernel_32()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| H A D | is_heap_until.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap_until(i112, i112+6) == i112+5); in test()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 206 int i112[] = {1, 1, 0, 1, 1, 1}; in test() local
269 assert(std::is_heap(i112, i112+6) == (std::is_heap_until(i112, i112+6) == i112+6)); in test()
|