Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 19 for fromInt (0.16 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. guava-tests/test/com/google/common/hash/HashCodeTest.java

      public void testFromInt() {
        for (ExpectedHashCode expected : expectedHashCodes) {
          if (expected.bytes.length == 4) {
            HashCode fromInt = HashCode.fromInt(expected.asInt);
            assertExpectedHashCode(expected, fromInt);
          }
        }
      }
    
      // expectedHashCodes must contain at least one hash code with 8 bytes
      public void testFromLong() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 13.2K bytes
    - Click Count (0)
  2. internal/s3select/sql/funceval.go

    	inferTypeAsString(v)
    	s, ok := v.ToString()
    	if !ok {
    		err := fmt.Errorf("%s/%s expects a string argument", sqlFnCharLength, sqlFnCharacterLength)
    		return nil, errIncorrectSQLFunctionArgumentType(err)
    	}
    	return FromInt(int64(len([]rune(s)))), nil
    }
    
    func lowerCase(v *Value) (*Value, error) {
    	inferTypeAsString(v)
    	s, ok := v.ToString()
    	if !ok {
    		err := fmt.Errorf("%s expects a string argument", sqlFnLower)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/hash/HashingTest.java

                      ImmutableList.of(HashCode.fromInt(32), HashCode.fromLong(32L)));
            });
      }
    
      public void testCombineUnordered() {
        HashCode hash31 = HashCode.fromInt(31);
        HashCode hash32 = HashCode.fromInt(32);
        assertEquals(hash32, Hashing.combineUnordered(ImmutableList.of(hash32)));
        assertEquals(HashCode.fromInt(64), Hashing.combineUnordered(ImmutableList.of(hash32, hash32)));
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 26.7K bytes
    - Click Count (2)
  4. android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java

      private static HashCode fmix(int h1, int length) {
        h1 ^= length;
        h1 ^= h1 >>> 16;
        h1 *= 0x85ebca6b;
        h1 ^= h1 >>> 13;
        h1 *= 0xc2b2ae35;
        h1 ^= h1 >>> 16;
        return HashCode.fromInt(h1);
      }
    
      private static final class Murmur3_32Hasher extends AbstractHasher {
        private int h1;
        private long buffer;
        private int shift;
        private int length;
        private boolean isDone;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 11.8K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/hash/Crc32cHashFunction.java

            // rolling CRCs.  So we call it on an empty ByteBuffer if we didn't already.
            processRemaining(EMPTY);
          }
          return HashCode.fromInt(~crc0);
        }
    
        static final int[] byteTable = {
          0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c,
          0x26a1e7e8, 0xd4ca64eb, 0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 28 01:26:26 GMT 2024
    - 21.2K bytes
    - Click Count (0)
  6. build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/info/GlobalBuildInfoPlugin.java

        }
    
        private String findJavaHome(String version) {
            Provider<String> javaHomeNames = providers.gradleProperty("org.gradle.java.installations.fromEnv").forUseAtConfigurationTime();
            String javaHomeEnvVar = getJavaHomeEnvVarName(version);
    
            // Provide a useful error if we're looking for a Java home version that we haven't told Gradle about yet
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Aug 17 10:02:58 GMT 2021
    - 18.1K bytes
    - Click Count (0)
  7. docs/en/docs/async.md

    The cashier goes to the kitchen.
    
    You wait, standing in front of the counter 🕙, so that no one else takes your burgers before you do, as there are no numbers for turns.
    
    <img src="/img/async/parallel-burgers/parallel-burgers-03.png" class="illustration">
    
    As you and your crush are busy not letting anyone get in front of you and take your burgers whenever they arrive, you cannot pay attention to your crush. 😞
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 23.4K bytes
    - Click Count (0)
  8. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt

          private val source: BufferedSource = source.buffer()
    
          // Visible for testing.
          @JvmField var dynamicTable = arrayOfNulls<Header>(8)
    
          // Array is populated back to front, so new entries always have lowest index.
          private var nextHeaderIndex = dynamicTable.size - 1
    
          @JvmField var headerCount = 0
    
          @JvmField var dynamicTableByteCount = 0
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:02:18 GMT 2026
    - 23.2K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/graph/Traverser.java

          return topDown(startNodes, InsertionOrder.FRONT);
        }
    
        /**
         * In top-down traversal, an ancestor node is always traversed before any of its descendant
         * nodes. The traversal order among descendant nodes (particularly aunts and nieces) are
         * determined by the {@code InsertionOrder} parameter: nieces are placed at the FRONT before
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 19.3K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

      }
    
      /**
       * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying
       * monitor.
       */
      void removeAt(int i) {
        E[] items = this.items;
        // if removing front item, just advance
        if (i == takeIndex) {
          items[takeIndex] = null;
          takeIndex = inc(takeIndex);
        } else {
          // slide over all others up through putIndex.
          for (; ; ) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
Back to Top