- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 70 for radix (0.04 sec)
-
src/runtime/mpagealloc_64bit.go
) // levelBits is the number of bits in the radix for a given level in the super summary // structure. // // The sum of all the entries of levelBits should equal heapAddrBits. var levelBits = [summaryLevels]uint{ summaryL0Bits, summaryLevelBits, summaryLevelBits, summaryLevelBits, summaryLevelBits, } // levelShift is the number of bits to shift to acquire the radix for a given level // in the super summary structure.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/math/big/floatconv.go
// special-case 0 if len(z.mant) == 0 { z.prec = prec z.acc = Exact z.form = zero f = z return } // len(z.mant) > 0 // The mantissa may have a radix point (fcount <= 0) and there // may be a nonzero exponent exp. The radix point amounts to a // division by b**(-fcount). An exponent means multiplication by // ebase**exp. Finally, mantissa normalization (shift left) requires
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Ints.java
* @param string the string representation of an integer value * @param radix the radix to use when parsing * @return the integer value represented by {@code string} using {@code radix}, or {@code null} if * {@code string} has a length of zero or cannot be parsed as an integer value * @throws IllegalArgumentException if {@code radix < Character.MIN_RADIX} or {@code radix > * Character.MAX_RADIX}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.9K bytes - Viewed (0) -
src/runtime/mpagealloc.go
// similar to mheap.arenas, since the bitmap may be large on some systems. // // The bitmap is efficiently searched by using a radix tree in combination // with fast bit-wise intrinsics. Allocation is performed using an address-ordered // first-fit approach. // // Each entry in the radix tree is a summary that describes three properties of // a particular region of the address space: the number of contiguous free pages
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/math/big/ratconv.go
} // special-case 0 (see also issue #16176) if len(z.a.abs) == 0 { return z.norm(), true } // len(z.a.abs) > 0 // The mantissa may have a radix point (fcount <= 0) and there // may be a nonzero exponent exp. The radix point amounts to a // division by base**(-fcount), which equals a multiplication by // base**fcount. An exponent means multiplication by ebase**exp.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* @param string the string representation of an integer value * @param radix the radix to use when parsing * @return the integer value represented by {@code string} using {@code radix}, or {@code null} if * {@code string} has a length of zero or cannot be parsed as an integer value * @throws IllegalArgumentException if {@code radix < Character.MIN_RADIX} or {@code radix > * Character.MAX_RADIX}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.7K bytes - Viewed (0) -
src/go/scanner/scanner_test.go
{token.INT, "0b01a0", "0b01 a0", ""}, // only accept 0-9 {token.FLOAT, "0b.", "0b.", "invalid radix point in binary literal"}, {token.FLOAT, "0b.1", "0b.1", "invalid radix point in binary literal"}, {token.FLOAT, "0b1.0", "0b1.0", "invalid radix point in binary literal"}, {token.FLOAT, "0b1e10", "0b1e10", "'e' exponent requires decimal mantissa"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 15:38:31 UTC 2023 - 34.6K bytes - Viewed (0) -
pkg/util/iptree/iptree.go
// remove any references from the deleted node // to avoid memory leak child.child[0] = nil child.child[1] = nil } // Tree is a radix tree for IPv4 and IPv6 networks. type Tree[T any] struct { rootV4 *node[T] rootV6 *node[T] } // New creates a new Radix Tree for IP addresses. func New[T any]() *Tree[T] { return &Tree[T]{ rootV4: &node[T]{ prefix: netip.PrefixFrom(netip.IPv4Unspecified(), 0),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17.7K bytes - Viewed (0) -
src/go/types/expr.go
return } if s[0] != '0' { return } radix := s[1] if radix == 'b' || radix == 'B' { check.versionErrorf(lit, go1_13, "binary literal") return } if radix == 'o' || radix == 'O' { check.versionErrorf(lit, go1_13, "0o/0O-style octal literal") return } if lit.Kind != token.INT && (radix == 'x' || radix == 'X') {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 49.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/expr.go
return } if s[0] != '0' { return } radix := s[1] if radix == 'b' || radix == 'B' { check.versionErrorf(lit, go1_13, "binary literal") return } if radix == 'o' || radix == 'O' { check.versionErrorf(lit, go1_13, "0o/0O-style octal literal") return } if lit.Kind != syntax.IntLit && (radix == 'x' || radix == 'X') {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 51.7K bytes - Viewed (0)