- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 383 for Sets (0.2 sec)
-
cmd/erasure-sets_test.go
// consistently for a given object name. func TestHashedLayer(t *testing.T) { // Test distribution with 16 sets. var objs [16]*erasureObjects for i := range objs { objs[i] = &erasureObjects{} } sets := &erasureSets{sets: objs[:], distributionAlgo: "CRCMOD"} testCases := []struct { objectName string expectedObj *erasureObjects }{
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Mon Feb 12 07:21:56 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheBuilderFactory.java
// the CacheBuilder default). private Set<Integer> concurrencyLevels = Sets.newHashSet((Integer) null); private Set<Integer> initialCapacities = Sets.newHashSet((Integer) null); private Set<Integer> maximumSizes = Sets.newHashSet((Integer) null); private Set<DurationSpec> expireAfterWrites = Sets.newHashSet((DurationSpec) null); private Set<DurationSpec> expireAfterAccesses = Sets.newHashSet((DurationSpec) null);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 8.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SetMultimapAsMapTester.java
Helpers.mapEntry(k0(), v0()), Helpers.mapEntry(k1(), v0()), Helpers.mapEntry(k0(), v3())); Set<Entry<K, Collection<V>>> expected = Sets.newHashSet(); expected.add(Helpers.mapEntry(k0(), (Collection<V>) Sets.newHashSet(v0(), v3()))); expected.add(Helpers.mapEntry(k1(), (Collection<V>) Sets.newHashSet(v0()))); new EqualsTester().addEqualityGroup(expected, multimap().asMap().entrySet()).testEquals(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 3.9K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/plugin/version/PluginVersionRequest.java
* * @since 3.0 */ public interface PluginVersionRequest { /** * Gets the group id of the plugin. * * @return The group id of the plugin. */ String getGroupId(); /** * Sets the group id of the plugin. * * @param groupId The group id of the plugin. * @return This request, never {@code null}. */
Java - Registered: Sun Apr 21 03:35:09 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 3.5K bytes - Viewed (0) -
internal/deadlineconn/deadlineconn.go
type DeadlineConn struct { net.Conn readDeadline time.Duration // sets the read deadline on a connection. writeDeadline time.Duration // sets the write deadline on a connection. } // Sets read deadline func (c *DeadlineConn) setReadDeadline() { if c.readDeadline > 0 { c.SetReadDeadline(time.Now().UTC().Add(c.readDeadline)) } }
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Sat Nov 05 18:09:21 GMT 2022 - 2.3K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultProfileActivationContext.java
private Path projectDirectory; @Override public List<String> getActiveProfileIds() { return activeProfileIds; } /** * Sets the identifiers of those profiles that should be activated by explicit demand. * * @param activeProfileIds The identifiers of those profiles to activate, may be {@code null}. * @return This context, never {@code null}.
Java - Registered: Sun Apr 21 03:35:09 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 6.9K bytes - Viewed (0) -
docs/distributed/DESIGN.md
- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
Plain Text - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 GMT 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java
*/ public final int length() { return longs.length(); } /** * Gets the current value at position {@code i}. * * @param i the index * @return the current value */ public final double get(int i) { return longBitsToDouble(longs.get(i)); } /** * Atomically sets the element at position {@code i} to the given value. * * @param i the index
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 8K bytes - Viewed (0) -
guava/src/com/google/common/cache/ReferenceEntry.java
@SuppressWarnings("GoodTime") long getAccessTime(); /** Sets the entry access time in ns. */ @SuppressWarnings("GoodTime") // b/122668874 void setAccessTime(long time); /** Returns the next entry in the access queue. */ ReferenceEntry<K, V> getNextInAccessQueue(); /** Sets the next entry in the access queue. */ void setNextInAccessQueue(ReferenceEntry<K, V> next);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
assertThat(network).isNotEqualTo(g2); } // Node sets are the same, but edge sets differ. @Test public void equivalent_edgeSetsDiffer() { network.addEdge(N1, N2, E12); MutableNetwork<Integer, String> g2 = createNetwork(edgeType); g2.addEdge(N1, N2, E13); assertThat(network).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0)