- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 86 for radix (0.06 sec)
-
guava-tests/test/com/google/common/primitives/LongsTest.java
public void testTryParse_radix() { for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) { radixEncodeParseAndAssertEquals((long) 0, radix); radixEncodeParseAndAssertEquals((long) 8000, radix); radixEncodeParseAndAssertEquals((long) -8000, radix); radixEncodeParseAndAssertEquals(MAX_VALUE, radix); radixEncodeParseAndAssertEquals(MIN_VALUE, radix); assertWithMessage("Radix: " + radix)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 30K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* * @param string the string representation of a long value * @param radix the radix to use when parsing * @return the long value represented by {@code string} using {@code radix}, or {@code null} if * {@code string} has a length of zero or cannot be parsed as a long 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 - 28.7K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Longs.java
* * @param string the string representation of a long value * @param radix the radix to use when parsing * @return the long value represented by {@code string} using {@code radix}, or {@code null} if * {@code string} has a length of zero or cannot be parsed as a long 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 - 28.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/op_or_arg_name_mapper.cc
while (true) { probe_name.resize(probe_prefix_size); // TODO(jpienaar): Subtract one so that the initial suffix is 0 instead // of 1. // TODO(jpienaar): Switch to radix 36 and update tests. llvm::APInt(32, val++).toString(probe_name, /*Radix=*/10, /*Signed=*/false); if (IsUnique(probe_name)) { // Insert/find if prefix with appended number is unique. auto probe_name_it = name_to_count_.try_emplace(probe_name, 1);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 5.7K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/scanner_test.go
{IntLit, "0b01a0", "0b01 a0", ""}, // only accept 0-9 {FloatLit, "0b.", "0b.", "invalid radix point in binary literal"}, {FloatLit, "0b.1", "0b.1", "invalid radix point in binary literal"}, {FloatLit, "0b1.0", "0b1.0", "invalid radix point in binary literal"}, {FloatLit, "0b1e10", "0b1e10", "'e' exponent requires decimal mantissa"},
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/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)