- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 52 for andNot (5 sec)
-
src/cmd/compile/internal/syntax/tokens.go
Lss // < Leq // <= Gtr // > Geq // >= // precAdd Add // + Sub // - Or // | Xor // ^ // precMul Mul // * Div // / Rem // % And // & AndNot // &^ Shl // << Shr // >> ) // Operator precedences const ( _ = iota precOrOr precAndAnd precCmp precAdd precMul
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 20 14:52:38 UTC 2023 - 2.6K bytes - Viewed (0) -
src/math/big/int_test.go
y.SetString(test.y, 0) testBitFun(t, "and", (*Int).And, x, y, test.and) testBitFunSelf(t, "and", (*Int).And, x, y, test.and) testBitFun(t, "andNot", (*Int).AndNot, x, y, test.andNot) testBitFunSelf(t, "andNot", (*Int).AndNot, x, y, test.andNot) testBitFun(t, "or", (*Int).Or, x, y, test.or) testBitFunSelf(t, "or", (*Int).Or, x, y, test.or) testBitFun(t, "xor", (*Int).Xor, x, y, test.xor)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0) -
test/fixedbugs/issue9604b.go
binop{"|", func(x, y *big.Int) *big.Int { return new(big.Int).Or(x, y) }}, binop{"^", func(x, y *big.Int) *big.Int { return new(big.Int).Xor(x, y) }}, binop{"&^", func(x, y *big.Int) *big.Int { return new(big.Int).AndNot(x, y) }}, } type unop struct { name string eval func(x *big.Int) *big.Int } var unops = []unop{ unop{"+", func(x *big.Int) *big.Int { return new(big.Int).Set(x) }},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 4.8K bytes - Viewed (0) -
src/math/big/int.go
if x.neg { x, y = y, x // & is symmetric } // x & (-y) == x & ^(y-1) == x &^ (y-1) y1 := nat(nil).sub(y.abs, natOne) z.abs = z.abs.andNot(x.abs, y1) z.neg = false return z } // AndNot sets z = x &^ y and returns z. func (z *Int) AndNot(x, y *Int) *Int { if x.neg == y.neg { if x.neg { // (-x) &^ (-y) == ^(x-1) &^ ^(y-1) == ^(x-1) & (y-1) == (y-1) &^ (x-1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/scanner_test.go
{_Operator, "^", Xor, precAdd}, {_Star, "*", Mul, precMul}, {_Operator, "/", Div, precMul}, {_Operator, "%", Rem, precMul}, {_Operator, "&", And, precMul}, {_Operator, "&^", AndNot, precMul}, {_Operator, "<<", Shl, precMul}, {_Operator, ">>", Shr, precMul}, // assignment operations {_AssignOp, "+=", Add, precAdd}, {_AssignOp, "-=", Sub, precAdd}, {_AssignOp, "|=", Or, precAdd},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 14 16:11:21 UTC 2022 - 21.9K bytes - Viewed (0) -
src/cmd/compile/internal/noder/noder.go
syntax.Add: ir.OADD, syntax.Sub: ir.OSUB, syntax.Or: ir.OOR, syntax.Xor: ir.OXOR, syntax.Mul: ir.OMUL, syntax.Div: ir.ODIV, syntax.Rem: ir.OMOD, syntax.And: ir.OAND, syntax.AndNot: ir.OANDNOT, syntax.Shl: ir.OLSH, syntax.Shr: ir.ORSH, } // error is called concurrently if files are parsed concurrently. func (p *noder) error(err error) { p.err <- err.(syntax.Error) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 11 20:40:57 UTC 2023 - 12.5K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/internal/component/model/MultipleCandidateMatcher.java
} } if (any.cardinality() > 0 && any.cardinality() != candidateCount) { // there is at least one candidate which does NOT provide this attribute remaining.andNot(any); if (remaining.cardinality() == 0) { // there are no left candidate, do not bother checking other attributes break; } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 19.4K bytes - Viewed (0) -
src/go/constant/value.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 34K bytes - Viewed (0) -
src/cmd/compile/internal/types2/expr.go
syntax.Sub: token.SUB, syntax.Or: token.OR, syntax.Xor: token.XOR, syntax.Mul: token.MUL, syntax.Div: token.QUO, syntax.Rem: token.REM, syntax.And: token.AND, syntax.AndNot: token.AND_NOT, syntax.Shl: token.SHL, syntax.Shr: token.SHR,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 51.7K bytes - Viewed (0) -
src/math/big/nat.go
w := (n + _W - 1) / _W if uint(len(x)) < w { return z.set(x) } z = z.make(int(w)) copy(z, x) if n%_W != 0 { z[len(z)-1] &= 1<<(n%_W) - 1 } return z.norm() } func (z nat) andNot(x, y nat) nat { m := len(x) n := len(y) if n > m { n = m } // m >= n z = z.make(m) for i := 0; i < n; i++ { z[i] = x[i] &^ y[i] } copy(z[n:m], x[n:m])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0)