- Sort Score
- Num 10 results
- Language All
Results 121 - 130 of 178 for dedupe (0.13 seconds)
-
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/goals/PluginUpgradeStrategy.java
} } return false; }) .reduce(false, Boolean::logicalOr); } /** * Upgrades a specific plugin's version if needed. */ private boolean upgradePluginVersion( Element pluginElement,Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Tue Nov 18 18:03:26 GMT 2025 - 37K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableSet.java
SetBuilderImpl(int expectedCapacity) { this.dedupedElements = (E[]) new Object[expectedCapacity]; this.distinct = 0; } /** Initializes this SetBuilderImpl with a copy of the deduped elements array from toCopy. */ SetBuilderImpl(SetBuilderImpl<E> toCopy) { this.dedupedElements = Arrays.copyOf(toCopy.dedupedElements, toCopy.dedupedElements.length); this.distinct = toCopy.distinct; }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Nov 07 16:09:47 GMT 2025 - 35.3K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.17.md
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu Jan 28 10:44:33 GMT 2021 - 346.2K bytes - Click Count (1) -
android/guava/src/com/google/common/hash/BloomFilter.java
* * @since 22.0 */ public long approximateElementCount() { long bitSize = bits.bitSize(); long bitCount = bits.bitCount(); /* * Each insertion is expected to reduce the # of clear bits by a factor of * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 -
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 23 19:23:59 GMT 2025 - 26.9K bytes - Click Count (0) -
src/main/java/jcifs/smb1/netbios/NbtAddress.java
"JCIFS" + (addr[2] & 0xFF) + "_" + (addr[3] & 0xFF) + "_" + Hexdump.toHexString((int) (Math.random() * 0xFF), 2); } /* Create an NbtAddress for the local interface with * the name deduced above possibly with scope applied and * cache it forever. */ localName = new Name(localHostname, 0x00, Config.getProperty("jcifs.smb1.netbios.scope", null));
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 31.7K bytes - Click Count (0) -
README.md
* **Fast to code**: Increase the speed to develop features by about 200% to 300%. * * **Fewer bugs**: Reduce about 40% of human (developer) induced errors. * * **Intuitive**: Great editor support. <abbr title="also known as auto-complete, autocompletion, IntelliSense">Completion</abbr> everywhere. Less time debugging.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Thu Dec 25 11:01:37 GMT 2025 - 26.4K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.6.md
* see https://kubernetes.io/docs/user-guide/persistent-volumes/#class-1 for details. * Reduce verbosity of volume reconciler when attaching volumes ([#36900](https://github.com/kubernetes/kubernetes/pull/36900), [@codablock](https://github.com/codablock))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu Dec 24 02:28:26 GMT 2020 - 304K bytes - Click Count (0) -
docs/en/docs/index.md
* **Fast to code**: Increase the speed to develop features by about 200% to 300%. * * **Fewer bugs**: Reduce about 40% of human (developer) induced errors. * * **Intuitive**: Great editor support. <abbr title="also known as auto-complete, autocompletion, IntelliSense">Completion</abbr> everywhere. Less time debugging.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Thu Dec 25 11:01:37 GMT 2025 - 23.5K bytes - Click Count (0) -
docs/changelogs/changelog_4x.md
Castle is great! But it's a large dependency (6.5 MiB) and its security provider feature impacts VM-wide behavior. * New: Reduce contention for applications that make a very high number of concurrent requests. Previously OkHttp used its connection pool as a lock when making changes to connections and
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Apr 17 13:25:31 GMT 2024 - 25.2K bytes - Click Count (0) -
cmd/data-usage-cache.go
} d.copyWithChildren(src, dataUsageHash(ch), &hash) } if parent != nil { p := d.Cache[parent.Key()] p.addChild(hash) d.Cache[parent.Key()] = p } } // reduceChildrenOf will reduce the recursive number of children to the limit // by compacting the children with the least number of objects. func (d *dataUsageCache) reduceChildrenOf(path dataUsageHash, limit int, compactSelf bool) {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 34.7K bytes - Click Count (0)