/dports/devel/llvm13/llvm-project-13.0.1.src/utils/bazel/llvm-project-overlay/llvm/ |
H A D | template_rule.bzl | 25 # substitutions: A dictionary mapping strings to their substitutions 27 def template_rule_impl(ctx): 29 template = ctx.file.src, 30 output = ctx.outputs.out, 36 "src": attr.label( 43 # output_to_genfiles is required for header files.
|
/dports/shells/elvish/elvish-0.17.0/pkg/mods/math/ |
H A D | math.go | 105 func abs(n vals.Num) vals.Num { 256 func ceil(n vals.Num) vals.Num { 321 func floor(n vals.Num) vals.Num { 358 func isInf(opts isInfOpts, n vals.Num) bool { 382 func isNaN(n vals.Num) bool { 587 func pow(base, exp vals.Num) vals.Num { 619 func isExact(n vals.Num) bool { 628 func isExactInt(n vals.Num) bool { 670 func round(n vals.Num) vals.Num { 717 func roundToEven(n vals.Num) vals.Num { [all …]
|
/dports/shells/elvish/elvish-0.17.0/pkg/eval/ |
H A D | builtin_fn_num.go | 89 func num(n vals.Num) vals.Num { 125 func exactNum(n vals.Num) (vals.Num, error) { 196 func lt(nums ...vals.Num) bool { 205 func le(nums ...vals.Num) bool { 213 func eqNum(nums ...vals.Num) bool { 221 func ne(nums ...vals.Num) bool { 229 func gt(nums ...vals.Num) bool { 237 func ge(nums ...vals.Num) bool { 245 func chainCompare(nums []vals.Num, 290 func add(rawNums ...vals.Num) vals.Num { [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
H A D | partial_sort_copy.pass.cpp | 24 struct Num struct 28 Num() : val(0) {} in Num() argument 29 Num(T v) : val(v) {} in Num() function 30 Num(const Num<T>& v) : val(v.val) {} in Num() argument 31 Num(Num<T>&& v) : val(v.val) {} in Num() function 33 operator=(const Num<T>& v) in operator =() argument 40 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() argument 41 Num(T v) : val(v) { ++count_val; } in Num() argument 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() argument 41 Num(T v) : val(v) { ++count_val; } in Num() function 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc10/gcc-10.3.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() argument 41 Num(T v) : val(v) { ++count_val; } in Num() function 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() argument 41 Num(T v) : val(v) { ++count_val; } in Num() argument 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/avr-gcc/gcc-10.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 35 struct Num struct 39 Num() { ++count_val; } in Num() function 40 Num(T v) : val(v) { ++count_val; } in Num() function 41 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 42 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 43 ~Num() { --count_val; } in ~Num() argument 45 operator=(const Num<T>& v) in operator =() argument 52 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 35 struct Num struct 39 Num() { ++count_val; } in Num() argument 40 Num(T v) : val(v) { ++count_val; } in Num() argument 41 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 42 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 43 ~Num() { --count_val; } in ~Num() argument 45 operator=(const Num<T>& v) in operator =() argument 52 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() function 31 Num(T v) : val(v) { ++count_val; } in Num() argument 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc10-devel/gcc-10-20211008/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() function 41 Num(T v) : val(v) { ++count_val; } in Num() function 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() argument 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc9/gcc-9.4.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 35 struct Num struct 39 Num() { ++count_val; } in Num() argument 40 Num(T v) : val(v) { ++count_val; } in Num() function 41 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 42 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 43 ~Num() { --count_val; } in ~Num() argument 45 operator=(const Num<T>& v) in operator =() argument 52 operator<(const Num<T>& v) const in operator <() argument
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 36 struct Num struct 40 Num() { ++count_val; } in Num() argument 41 Num(T v) : val(v) { ++count_val; } in Num() argument 42 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 43 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() argument 44 ~Num() { --count_val; } in ~Num() argument 46 operator=(const Num<T>& v) in operator =() argument 53 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() function 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() function 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/devel/llvm12/llvm-project-12.0.1.src/pstl/test/std/algorithms/alg.sorting/ |
H A D | partial_sort.pass.cpp | 26 struct Num struct 30 Num() { ++count_val; } in Num() argument 31 Num(T v) : val(v) { ++count_val; } in Num() function 32 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 33 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 34 ~Num() { --count_val; } in ~Num() argument 36 operator=(const Num<T>& v) in operator =() argument 43 operator<(const Num<T>& v) const in operator <() argument
|
/dports/lang/gcc9-aux/gcc-9.1.0/libstdc++-v3/testsuite/25_algorithms/pstl/alg_sorting/ |
H A D | partial_sort.cc | 35 struct Num struct 39 Num() { ++count_val; } in Num() argument 40 Num(T v) : val(v) { ++count_val; } in Num() function 41 Num(const Num<T>& v) : val(v.val) { ++count_val; } in Num() argument 42 Num(Num<T>&& v) : val(v.val) { ++count_val; } in Num() function 43 ~Num() { --count_val; } in ~Num() argument 45 operator=(const Num<T>& v) in operator =() argument 52 operator<(const Num<T>& v) const in operator <() argument
|
/dports/www/grafana8/grafana-8.3.6/vendor/cuelang.org/go/internal/core/adt/ |
H A D | decimal.go | 38 func (a *Num) Cmp(b *Num) int { 42 func (c *OpContext) Add(a, b *Num) Value { 46 func (c *OpContext) Sub(a, b *Num) Value { 50 func (c *OpContext) Mul(a, b *Num) Value { 54 func (c *OpContext) Quo(a, b *Num) Value { 62 func (c *OpContext) Pow(a, b *Num) Value { 68 func numOp(c *OpContext, fn numFunc, x, y *Num) Value { 88 func (c *OpContext) IntDiv(a, b *Num) Value { 92 func (c *OpContext) IntMod(a, b *Num) Value { 96 func (c *OpContext) IntQuo(a, b *Num) Value { [all …]
|
/dports/databases/arrow/apache-arrow-6.0.1/go/arrow/decimal128/ |
H A D | decimal128.go | 34 type Num struct { struct 35 lo uint64 // low bits 36 hi int64 // high bits 89 func (n Num) negated() Num { 99 func (n Num) LowBits() uint64 { return n.lo } 102 func (n Num) HighBits() int64 { return n.hi } 109 func (n Num) Sign() int { 116 func toBigIntPositive(n Num) *big.Int { 123 func (n Num) BigInt() *big.Int {
|
/dports/games/memonix/MemonixSourceCode/src/Core/System/ |
H A D | Keyboard.cpp | 33 bool vw_GetKeys(int Num) in vw_GetKeys() 39 void vw_SetKeys(int Num, bool NewKeyStatus) in vw_SetKeys() 56 char * vw_VirtualCodeName(int Num) in vw_VirtualCodeName() 168 char VirtualCodeChar1(int Num) in VirtualCodeChar1() 243 char VirtualCodeChar2(int Num) in VirtualCodeChar2() 318 char VirtualCodeChar3(int Num) in VirtualCodeChar3() 395 char VirtualCodeChar4(int Num) in VirtualCodeChar4() 478 char vw_VirtualCodeCharEN(int Num) in vw_VirtualCodeCharEN()
|