Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 162 for setLit (0.46 sec)

  1. src/cmd/compile/internal/syntax/scanner.go

    func (s *scanner) errorAtf(offset int, format string, args ...interface{}) {
    	s.errh(s.line, s.col+uint(offset), fmt.Sprintf(format, args...))
    }
    
    // setLit sets the scanner state for a recognized _Literal token.
    func (s *scanner) setLit(kind LitKind, ok bool) {
    	s.nlsemi = true
    	s.tok = _Literal
    	s.lit = string(s.segment())
    	s.bad = !ok
    	s.kind = kind
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 28 18:17:41 UTC 2022
    - 17.1K bytes
    - Viewed (0)
  2. src/math/big/bits_test.go

    	x := NewInt(0)
    	for _, b := range bits {
    		badj := b - min
    		// propagate carry if necessary
    		for x.Bit(badj) != 0 {
    			x.SetBit(x, badj, 0)
    			badj++
    		}
    		x.SetBit(x, badj, 1)
    	}
    
    	// create corresponding float
    	z := new(Float).SetInt(x) // normalized
    	if e := int64(z.exp) + int64(min); MinExp <= e && e <= MaxExp {
    		z.exp = int32(e)
    	} else {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  3. src/math/big/int_test.go

    	}
    }
    
    func BenchmarkBitset(b *testing.B) {
    	z := new(Int)
    	z.SetBit(z, 512, 1)
    	b.ResetTimer()
    	for i := b.N - 1; i >= 0; i-- {
    		z.SetBit(z, i&512, 1)
    	}
    }
    
    func BenchmarkBitsetNeg(b *testing.B) {
    	z := NewInt(-1)
    	z.SetBit(z, 512, 0)
    	b.ResetTimer()
    	for i := b.N - 1; i >= 0; i-- {
    		z.SetBit(z, i&512, 0)
    	}
    }
    
    func BenchmarkBitsetOrig(b *testing.B) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 18:42:28 UTC 2024
    - 58.5K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/ssa/sparsemap.go

    		s.dense[i].val = v
    		return
    	}
    	s.dense = append(s.dense, sparseEntry{k, v})
    	s.sparse[k] = int32(len(s.dense)) - 1
    }
    
    // setBit sets the v'th bit of k's value, where 0 <= v < 32
    func (s *sparseMap) setBit(k ID, v uint) {
    	if v >= 32 {
    		panic("bit index too large.")
    	}
    	i := s.sparse[k]
    	if i < int32(len(s.dense)) && s.dense[i].key == k {
    		s.dense[i].val |= 1 << v
    		return
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Oct 31 21:41:06 UTC 2022
    - 1.9K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java

            assertTrue(ZERO.setBit(result).compareTo(x) <= 0);
            assertTrue(ZERO.setBit(result + 1).compareTo(x) > 0);
          }
        }
      }
    
      public void testLog2Ceiling() {
        for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
          for (RoundingMode mode : asList(CEILING, UP)) {
            int result = BigIntegerMath.log2(x, mode);
            assertTrue(ZERO.setBit(result).compareTo(x) >= 0);
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri May 17 17:58:33 UTC 2024
    - 27.8K bytes
    - Viewed (0)
  6. src/math/big/int.go

    		return t.bit(uint(i)) ^ 1
    	}
    
    	return x.abs.bit(uint(i))
    }
    
    // SetBit sets z to x, with x's i'th bit set to b (0 or 1).
    // That is, if b is 1 SetBit sets z = x | (1 << i);
    // if b is 0 SetBit sets z = x &^ (1 << i). If b is not 0 or 1,
    // SetBit will panic.
    func (z *Int) SetBit(x *Int, i int, b uint) *Int {
    	if i < 0 {
    		panic("negative bit index")
    	}
    	if x.neg {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 14 17:02:38 UTC 2024
    - 33.1K bytes
    - Viewed (0)
  7. pkg/registry/core/service/allocator/bitmap.go

    	if offset < 0 || offset >= r.max {
    		return false, fmt.Errorf("offset %d out of range [0,%d]", offset, r.max)
    	}
    	if r.allocated.Bit(offset) == 1 {
    		return false, nil
    	}
    	r.allocated = r.allocated.SetBit(r.allocated, offset, 1)
    	r.count++
    	return true, nil
    }
    
    // AllocateNext reserves one of the items from the pool.
    // (0, false, nil) may be returned if there are no items left.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jan 25 20:32:40 UTC 2023
    - 7.6K bytes
    - Viewed (0)
  8. src/runtime/export_windows_test.go

    }
    
    type ContextStub struct {
    	context
    }
    
    func (c ContextStub) GetPC() uintptr {
    	return c.ip()
    }
    
    func NewContextStub() *ContextStub {
    	var ctx context
    	ctx.set_ip(getcallerpc())
    	ctx.set_sp(getcallersp())
    	ctx.set_fp(getcallerfp())
    	return &ContextStub{ctx}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 19 17:25:00 UTC 2024
    - 759 bytes
    - Viewed (0)
  9. subprojects/core/src/main/java/org/gradle/api/tasks/GradleBuild.java

         *
         * @param dir The project directory. Should not be null.
         * @since 4.0
         */
        public void setDir(File dir) {
            setDir((Object) dir);
        }
    
        /**
         * Sets the project directory for the build.
         *
         * @param dir The project directory. Should not be null.
         */
        public void setDir(Object dir) {
            getStartParameter().setCurrentDir(getProject().file(dir));
        }
    
        /**
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Oct 05 19:36:14 UTC 2023
    - 6.6K bytes
    - Viewed (0)
  10. pkg/controller/nodeipam/ipam/cidrset/cidr_set.go

    	var i int
    	for i = 0; i < s.maxCIDRs; i++ {
    		if s.used.Bit(candidate) == 0 {
    			break
    		}
    		candidate = (candidate + 1) % s.maxCIDRs
    	}
    
    	s.nextCandidate = (candidate + 1) % s.maxCIDRs
    	s.used.SetBit(&s.used, candidate, 1)
    	s.allocatedCIDRs++
    	// Update metrics
    	cidrSetAllocations.WithLabelValues(s.label).Inc()
    	cidrSetAllocationTriesPerRequest.WithLabelValues(s.label).Observe(float64(i))
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu May 11 08:53:03 UTC 2023
    - 9.4K bytes
    - Viewed (0)
Back to top