Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for radix (0.06 seconds)

  1. guava-tests/test/com/google/common/primitives/UnsignedLongTest.java

        }
      }
    
      @GwtIncompatible // too slow
      public void testToStringRadix() {
        for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
          for (long l : TEST_LONGS) {
            UnsignedLong value = UnsignedLong.fromLongBits(l);
            assertThat(value.toString(radix)).isEqualTo(value.bigIntegerValue().toString(radix));
          }
        }
      }
    
      public void testToStringRadixQuick() {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java

        for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
          for (int i = 0; i <= 0xff; i++) {
            assertThat(UnsignedBytes.parseUnsignedByte(Integer.toString(i, radix), radix))
                .isEqualTo((byte) i);
          }
          assertParseFails(Integer.toString(1000, radix), radix);
          assertParseFails(Integer.toString(-1, radix), radix);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 13.5K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/primitives/IntsTest.java

        for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
          radixEncodeParseAndAssertEquals(0, radix);
          radixEncodeParseAndAssertEquals(8000, radix);
          radixEncodeParseAndAssertEquals(-8000, radix);
          radixEncodeParseAndAssertEquals(GREATEST, radix);
          radixEncodeParseAndAssertEquals(LEAST, radix);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 29.3K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/primitives/UnsignedLongTest.java

        }
      }
    
      @GwtIncompatible // too slow
      public void testToStringRadix() {
        for (int radix = Character.MIN_RADIX; radix <= Character.MAX_RADIX; radix++) {
          for (long l : TEST_LONGS) {
            UnsignedLong value = UnsignedLong.fromLongBits(l);
            assertThat(value.toString(radix)).isEqualTo(value.bigIntegerValue().toString(radix));
          }
        }
      }
    
      public void testToStringRadixQuick() {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  5. CHANGELOG/CHANGELOG-1.32.md

    - github.com/armon/consul-api: [eb2c6b5](https://github.com/armon/consul-api/tree/eb2c6b5)
    - github.com/armon/go-metrics: [f0300d1](https://github.com/armon/go-metrics/tree/f0300d1)
    - github.com/armon/go-radix: [7fddfc3](https://github.com/armon/go-radix/tree/7fddfc3)
    - github.com/aws/aws-sdk-go: [v1.35.24](https://github.com/aws/aws-sdk-go/tree/v1.35.24)
    - github.com/bgentry/speakeasy: [v0.1.0](https://github.com/bgentry/speakeasy/tree/v0.1.0)
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Tue Dec 16 18:27:41 GMT 2025
    - 448.1K bytes
    - Click Count (0)
  6. doc/go_spec.html

    prefix, an integer part (hexadecimal digits), a radix point, a fractional part (hexadecimal digits),
    and an exponent part (<code>p</code> or <code>P</code> followed by an optional sign and decimal digits).
    One of the integer part or the fractional part may be elided; the radix point may be elided as well,
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 02 23:07:19 GMT 2025
    - 286.5K bytes
    - Click Count (1)
  7. lib/fips140/v1.1.0-rc1.zip

    int8(window) } else { carry = 1 naf[pos] = int8(window) - int8(width) } pos += w } return naf } func (s *Scalar) signedRadix16() [64]int8 { b := s.Bytes() if b[31] > 127 { panic("scalar has high bit set illegally") } var digits [64]int8 // Compute unsigned radix-16 digits: for i := 0; i < 32; i++ { digits[2*i] = int8(b[i] & 15) digits[2*i+1] = int8((b[i] >> 4) & 15) } // Recenter coefficients: for i := 0; i < 63; i++ { carry := (digits[i] + 8) >> 4 digits[i] -= carry << 4 digits[i+1] += carry } return digits...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top