- Sort Score
- Num 10 results
- Language All
Results 1 - 7 of 7 for newTable (0.05 seconds)
-
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;Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 14.5K bytes - Click Count (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;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) -
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;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) -
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; }
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) -
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 {Created: Sun Dec 28 09:35:17 GMT 2025 - Last Modified: Sun Oct 26 12:31:09 GMT 2025 - 29.7K bytes - Click Count (0) -
cmd/metrics-v3-types.go
continue } labels := make([]string, 0, len(metric.VariableLabels)*2) for k, v := range metric.VariableLabels { if newLabel, ok := renameLabels[k]; ok { labels = append(labels, newLabel, v) } else { labels = append(labels, k, v) } } labels = append(labels, extraLabels...) // If valid non zero value set the metrics if metric.Value > 0 {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Feb 28 19:33:08 GMT 2025 - 15.6K bytes - Click Count (0) -
api/go1.5.txt
pkg go/types, func NewField(token.Pos, *Package, string, Type, bool) *Var pkg go/types, func NewFunc(token.Pos, *Package, string, *Signature) *Func pkg go/types, func NewInterface([]*Func, []*Named) *Interface pkg go/types, func NewLabel(token.Pos, *Package, string) *Label pkg go/types, func NewMap(Type, Type) *Map pkg go/types, func NewMethodSet(Type) *MethodSet pkg go/types, func NewNamed(*TypeName, Type, []*Func) *Named
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Jul 30 21:14:09 GMT 2015 - 46.6K bytes - Click Count (0)