- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for negatable (0.26 sec)
-
.idea/dictionaries/valentin.xml
<dictionary name="valentin"> <words> <w>decapitalize</w> <w>delegator</w> <w>elipsis</w> <w>funs</w> <w>immediates</w> <w>initializers</w> <w>inserter</w> <w>negatable</w> <w>pparent</w> <w>precheck</w> <w>prioritizer</w> <w>processings</w> <w>rbrace</w> <w>rbracket</w> <w>renderers</w> <w>rparenth</w> <w>selectioner</w>
XML - Registered: Fri Apr 26 08:18:10 GMT 2024 - Last Modified: Tue Sep 13 14:46:16 GMT 2016 - 605 bytes - Viewed (0) -
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;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/base/super/com/google/common/base/Platform.java
/** @author Jesse Wilson */ final class Platform { static CharMatcher precomputeCharMatcher(CharMatcher matcher) { // CharMatcher.precomputed() produces CharMatchers that are maybe a little // faster (and that's debatable), but definitely more memory-hungry. We're // choosing to turn .precomputed() into a no-op in GWT, because it doesn't // seem to be a worthwhile tradeoff in a browser. return matcher; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 17:58:45 GMT 2023 - 2K 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;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
android/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; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K 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;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K 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; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K 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}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.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 {
Go - Registered: Sun Apr 28 09:35:09 GMT 2024 - Last Modified: Fri Apr 26 07:15:49 GMT 2024 - 29K bytes - Viewed (0) -
android/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")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0)