len(x.limbs) xLimbs := x.limbs[:size] if len(xLimbs) == 0 { return no } one := ctEq(xLimbs[0], 1) for i := 1; i < size; i++ { one &= ctEq(xLimbs[i], 0) } return one } // IsMinusOne returns 1 if x == -1 mod m, and 0 otherwise. // // The length of x must be the same as the modulus. x must already be reduced // modulo m. // //go:norace func (x *Nat) IsMinusOne(m *Modulus) choice { minusOne := m.Nat() minusOne.SubOne(m) return x.Equal(minusOne) } // IsOdd returns 1 if x is odd, and 0 otherwise. func (x *Nat) IsOdd()...

x.limbs[i] != 0 { break } x.limbs = x.limbs[:i] } return x } // set assigns x = y, optionally resizing x to the appropriate size. func (x *Nat) set(y *Nat) *Nat { x.reset(len(y.limbs)) copy(x.limbs, y.limbs) return x } // Bits returns x as a little-endian slice of uint. The length of the slice // matches the announced length of x. The result and x share the same underlying // array. func (x *Nat) Bits() []uint { return x.limbs } // Bytes returns x as a zero-extended big-endian byte slice. The size...

property-disallowed-list\n// Single side border-radius\n\n// Helper function to replace negative values with 0\n@function valid-radius($radius) {\n  $return: ();\n  @each $value in $radius {\n    @if type-of($value) == number {\n      $return: append($return, max($value, 0));\n    } @else {\n      $return: append($return, $value);\n    }\n  }\n  @return $return;\n}\n\n@mixin border-radius($radius: $border-radius, $fallback-border-radius: false) {\n  @if $enable-rounded {\n    border-radius: valid-radius($radius);\n...

237D..239A    ; valid                  ;      ; NV8    # 3.0  SHOULDERED OPEN BOX..CLEAR SCREEN SYMBOL
239B..23CE    ; valid                  ;      ; NV8    # 3.2  LEFT PARENTHESIS UPPER HOOK..RETURN SYMBOL
23CF..23D0    ; valid                  ;      ; NV8    # 4.0  EJECT SYMBOL..VERTICAL LINE EXTENSION
23D1..23DB    ; valid                  ;      ; NV8    # 4.1  METRICAL BREVE..FUSE