- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 137 for mutating (0.07 seconds)
-
internal/disk/directio_unsupported.go
// so there is no risk of polluting the entire cache with data accessed once. // Another goal of DirectIO is to minimize the mutation of data by the kernel // before issuing IO to underlying devices. ZFS users often enable features like // compression and checksumming which currently necessitates mutating data in // the kernel. // // DirectIO semantics for a filesystem like ZFS would be quite different than
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Oct 18 18:08:15 GMT 2023 - 2.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/ConcurrentHashMultisetTest.java
multiset.add(KEY); multiset.add(KEY + "_2"); multiset.add(KEY); int mutations = 0; for (Iterator<String> it = multiset.iterator(); it.hasNext(); ) { it.next(); it.remove(); mutations++; } assertTrue(multiset.isEmpty()); assertEquals(3, mutations); } public void testSetCount_basic() { int initialCount = 20; int countToSet = 40;Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Dec 08 22:42:14 GMT 2025 - 16.3K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
object : Task("$okHttpName ConnectionPool connection closer") { override fun runOnce(): Long = closeConnections(System.nanoTime()) } /** * Holding the lock of the connection being added or removed when mutating this, and check its * [RealConnection.noNewExchanges] property. This defends against races where a connection is * simultaneously adopted and removed. */
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Oct 08 03:50:05 GMT 2025 - 11.1K bytes - Click Count (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
return true; } boolean get(long bitIndex) { return (data.get((int) (bitIndex >>> LONG_ADDRESSABLE_BITS)) & (1L << bitIndex)) != 0; } /** * Careful here: if threads are mutating the atomicLongArray while this method is executing, the * final long[] will be a "rolling snapshot" of the state of the bit array. This is usually good * enough, but should be kept in mind. */Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Jan 08 14:27:16 GMT 2025 - 10.7K bytes - Click Count (0) -
impl/maven-core/src/main/java/org/apache/maven/project/DefaultProjectBuilder.java
// defined repositories. // // Compute merged repositories for this project and store in session // instead of mutating the shared request to avoid leakage between projects List<ArtifactRepository> mergedRepositories; switch (request.getRepositoryMerging()) { case POM_DOMINANT -> {Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Tue Nov 18 17:20:31 GMT 2025 - 51.8K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Graph.java
* of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not * need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on the graph), * you should use the non-mutating {@link Graph} interface, or an {@link ImmutableGraph}. * * <p>You can create an immutable copy of an existing {@code Graph} using {@link * ImmutableGraph#copyOf(Graph)}: * * {@snippet :Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 13.6K bytes - Click Count (0) -
guava/src/com/google/common/graph/Graph.java
* of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not * need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on the graph), * you should use the non-mutating {@link Graph} interface, or an {@link ImmutableGraph}. * * <p>You can create an immutable copy of an existing {@code Graph} using {@link * ImmutableGraph#copyOf(Graph)}: * * {@snippet :Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 13.6K bytes - Click Count (0) -
guava/src/com/google/common/graph/ValueGraph.java
* subtype of {@code ValueGraph} that provides methods for adding and removing nodes and edges. If * you do not need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on * the graph), you should use the non-mutating {@link ValueGraph} interface, or an {@link * ImmutableValueGraph}. * * <p>You can create an immutable copy of an existing {@code ValueGraph} using {@link * ImmutableValueGraph#copyOf(ValueGraph)}: * * {@snippet :Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 16K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/EventListener.kt
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Tue Oct 07 21:03:04 GMT 2025 - 24.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Network.java
* subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on * the network), you should use the non-mutating {@link Network} interface, or an {@link * ImmutableNetwork}. * * <p>You can create an immutable copy of an existing {@code Network} using {@link * ImmutableNetwork#copyOf(Network)}: * * {@snippet :Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 07 15:57:03 GMT 2025 - 17.7K bytes - Click Count (0)