- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for NewTable (0.08 sec)
-
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
int newThreshold = 1 + (int) (newCapacity * loadFactor); int[] newTable = newTable(newCapacity); long[] entries = this.entries; int mask = newTable.length - 1; for (int i = 0; i < size; i++) { long oldEntry = entries[i]; int hash = getHash(oldEntry); int tableIndex = hash & mask; int next = newTable[tableIndex]; newTable[tableIndex] = i;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 14.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// We need to rewrite the `next` link of each of the elements so that it is in the appropriate // linked list starting from `newTable`. In general, each element from the old linked list // belongs to a different linked list from `newTable`. We insert each element in turn at the // head of its appropriate `newTable` linked list. while (oldNext != UNSET) { int entryIndex = oldNext - 1;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
// We need to rewrite the `next` link of each of the elements so that it is in the appropriate // linked list starting from `newTable`. In general, each element from the old linked list // belongs to a different linked list from `newTable`. We insert each element in turn at the // head of its appropriate `newTable` linked list. while (oldNext != UNSET) { int entryIndex = oldNext - 1;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 35.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
int newNext = CompactHashing.tableGet(newTable, newTableIndex); CompactHashing.tableSet(newTable, newTableIndex, oldNext); entries[entryIndex] = CompactHashing.maskCombine(hash, newNext, newMask); oldNext = CompactHashing.getNext(oldEntry, oldMask); } } this.table = newTable; setHashTableMask(newMask); return newMask; }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 24.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
} AtomicReferenceArray<E> newEntryArray(int size) { return new AtomicReferenceArray<>(size); } void initTable(AtomicReferenceArray<E> newTable) { this.threshold = newTable.length() * 3 / 4; // 0.75 this.table = newTable; } // Convenience methods for testing /** * Unsafe cast of the given entry to {@code E}, the type of the specific {@link InternalEntry}Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 89.9K bytes - Viewed (0) -
migrator/migrator.go
var oldTable, newTable interface{} if v, ok := oldName.(string); ok { oldTable = clause.Table{Name: v} } else { stmt := &gorm.Statement{DB: m.DB} if err := stmt.Parse(oldName); err == nil { oldTable = m.CurrentTable(stmt) } else { return err } } if v, ok := newName.(string); ok { newTable = clause.Table{Name: v} } else {Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Sun Oct 26 12:31:09 UTC 2025 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
} void initTable(AtomicReferenceArray<ReferenceEntry<K, V>> newTable) { this.threshold = newTable.length() * 3 / 4; // 0.75 if (!map.customWeigher() && this.threshold == maxSegmentWeight) { // prevent spurious expansion before eviction this.threshold++; } this.table = newTable; } @GuardedBy("this")Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 19:35:11 UTC 2025 - 148.9K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
p256PrecomputedEmbed. var p256GeneratorTables *[43]p256AffineTable func init() { p256GeneratorTablesP := unsafe.Pointer(&p256PrecomputedEmbed) if cpu.BigEndian { var newTable [43 * 32 * 2 * 4]uint64 for i, x := range (*[43 * 32 * 2 * 4][8]byte)(p256GeneratorTablesP) { newTable[i] = byteorder.LEUint64(x[:]) } p256GeneratorTablesP = unsafe.Pointer(&newTable) } p256GeneratorTables = (*[43]p256AffineTable)(p256GeneratorTablesP) } func boothW6(in uint64) (uint8, int) { s := ^((in >> 6) - 1) d := (1 << 7) - in - 1...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
p256PrecomputedEmbed. var p256GeneratorTables *[43]p256AffineTable func init() { p256GeneratorTablesP := unsafe.Pointer(&p256PrecomputedEmbed) if cpu.BigEndian { var newTable [43 * 32 * 2 * 4]uint64 for i, x := range (*[43 * 32 * 2 * 4][8]byte)(p256GeneratorTablesP) { newTable[i] = byteorder.LEUint64(x[:]) } p256GeneratorTablesP = unsafe.Pointer(&newTable) } p256GeneratorTables = (*[43]p256AffineTable)(p256GeneratorTablesP) } func boothW6(in uint64) (uint8, int) { s := ^((in >> 6) - 1) d := (1 << 7) - in - 1...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
api/go1.txt
pkg debug/elf, type Symbol struct, Value uint64 pkg debug/elf, type Type uint16 pkg debug/elf, type Version uint8 pkg debug/gosym, func NewLineTable([]uint8, uint64) *LineTable pkg debug/gosym, func NewTable([]uint8, *LineTable) (*Table, error) pkg debug/gosym, method (*DecodingError) Error() string pkg debug/gosym, method (*LineTable) LineToPC(int, uint64) uint64 pkg debug/gosym, method (*LineTable) PCToLine(uint64) int
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0)