Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for oldTableIndex (0.09 seconds)

  2. github.com/google/guava

    guava/src/com/google/common/collect/CompactHashMap.java 

        // to the full hashcode reflects the change, and so that its `next` link corresponds to the new
    // linked list of entries with the new short hash.
    for (int oldTableIndex = 0; oldTableIndex <= oldMask; oldTableIndex++) {
      int oldNext = CompactHashing.tableGet(oldTable, oldTableIndex);
      // Each element of `oldTable` is the head of a (possibly empty) linked list of elements in
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 39.6K bytes
    - Click Count (0)
  3. github.com/google/guava

    guava/src/com/google/common/collect/CompactHashSet.java 

        }

    Object oldTable = requireTable();
    int[] entries = requireEntries();

    // Loop over current hashtable
    for (int oldTableIndex = 0; oldTableIndex <= oldMask; oldTableIndex++) {
      int oldNext = CompactHashing.tableGet(oldTable, oldTableIndex);
      while (oldNext != UNSET) {
        int entryIndex = oldNext - 1;
        int oldEntry = entries[entryIndex];
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 24.7K bytes
    - Click Count (0)
  4. github.com/google/guava

    android/guava/src/com/google/common/collect/CompactHashMap.java 

        // to the full hashcode reflects the change, and so that its `next` link corresponds to the new
    // linked list of entries with the new short hash.
    for (int oldTableIndex = 0; oldTableIndex <= oldMask; oldTableIndex++) {
      int oldNext = CompactHashing.tableGet(oldTable, oldTableIndex);
      // Each element of `oldTable` is the head of a (possibly empty) linked list of elements in
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 35.7K bytes
    - Click Count (0)
Back to Top