Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for SetBits (0.2 seconds)

  1. src/bytes/bytes.go

    	n := 0
    	wasSpace := 1
    	// setBits is used to track which bits are set in the bytes of s.
    	setBits := uint8(0)
    	for i := 0; i < len(s); i++ {
    		r := s[i]
    		setBits |= r
    		isSpace := int(asciiSpace[r])
    		n += wasSpace & ^isSpace
    		wasSpace = isSpace
    	}
    
    	if setBits >= utf8.RuneSelf {
    		// Some runes in the input slice are not ASCII.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/collect/Sets.java

        }
    
        @Override
        public Iterator<Set<E>> iterator() {
          return new AbstractIndexedListIterator<Set<E>>(size()) {
            @Override
            protected Set<E> get(int setBits) {
              return new SubSet<>(inputSet, setBits);
            }
          };
        }
    
        @Override
        public boolean contains(@Nullable Object obj) {
          if (obj instanceof Set) {
            Set<?> set = (Set<?>) obj;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 81.6K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    := n.Bits() x.reset(len(limbs)) for i := range limbs { x.limbs[i] = uint(limbs[i]) } return x } func (n *Nat) asBig() *big.Int { bits := make([]big.Word, len(n.limbs)) for i := range n.limbs { bits[i] = big.Word(n.limbs[i]) } return new(big.Int).SetBits(bits) } func (n *Nat) String() string { var limbs []string for i := range n.limbs { limbs = append(limbs, fmt.Sprintf("%016X", n.limbs[len(n.limbs)-1-i])) } return "{" + strings.Join(limbs, " ") + "}" } // Generate generates an even nat. It's used...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    := n.Bits() x.reset(len(limbs)) for i := range limbs { x.limbs[i] = uint(limbs[i]) } return x } func (n *Nat) asBig() *big.Int { bits := make([]big.Word, len(n.limbs)) for i := range n.limbs { bits[i] = big.Word(n.limbs[i]) } return new(big.Int).SetBits(bits) } func (n *Nat) String() string { var limbs []string for i := range n.limbs { limbs = append(limbs, fmt.Sprintf("%016X", n.limbs[len(n.limbs)-1-i])) } return "{" + strings.Join(limbs, " ") + "}" } // Generate generates an even nat. It's used...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  5. api/go1.txt

    pkg math/big, method (*Int) Scan(fmt.ScanState, int32) error
    pkg math/big, method (*Int) Set(*Int) *Int
    pkg math/big, method (*Int) SetBit(*Int, int, uint) *Int
    pkg math/big, method (*Int) SetBits([]Word) *Int
    pkg math/big, method (*Int) SetBytes([]uint8) *Int
    pkg math/big, method (*Int) SetInt64(int64) *Int
    pkg math/big, method (*Int) SetString(string, int) (*Int, bool)
    pkg math/big, method (*Int) Sign() int
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Aug 14 18:58:28 GMT 2013
    - 1.7M bytes
    - Click Count (0)
Back to Top