- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 836 for Sets (0.61 sec)
-
android/guava/src/com/google/common/collect/Sets.java
return CartesianSet.create(sets); } /** * Returns every possible list that can be formed by choosing one element from each of the given * sets in order; the "n-ary <a href="http://en.wikipedia.org/wiki/Cartesian_product">Cartesian * product</a>" of the sets. For example: * * <pre>{@code * Sets.cartesianProduct(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
cmd/erasure-sets.go
func (s *erasureSets) StorageInfo(ctx context.Context) StorageInfo { var storageInfo madmin.StorageInfo storageInfos := make([]madmin.StorageInfo, len(s.sets)) g := errgroup.WithNErrs(len(s.sets)) for index := range s.sets { index := index g.Go(func() error { storageInfos[index] = s.sets[index].StorageInfo(ctx) return nil }, index) }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 20:08:20 GMT 2024 - 37.7K bytes - Viewed (5) -
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 May 05 19:28:20 GMT 2024 - Last Modified: Mon Feb 12 07:21:56 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
checkHashCode(Sets.cartesianProduct(set(num), mt)); checkHashCode(Sets.cartesianProduct(set(num), set(1))); checkHashCode(Sets.cartesianProduct(set(1), set(2, num))); checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1))); checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1), set(3, num + 1))); // a bigger one checkHashCode(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K 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) -
android/guava-tests/test/com/google/common/collect/SetOperationsTest.java
@Override public void setUp() { friends = Sets.newHashSet("Tom", "Joe", "Dave"); enemies = Sets.newHashSet("Dick", "Harry", "Tom"); } public void testUnion() { Set<String> all = Sets.union(friends, enemies); assertEquals(5, all.size()); ImmutableSet<String> immut = Sets.union(friends, enemies).immutableCopy(); HashSet<String> mut = Sets.union(friends, enemies).copyInto(new HashSet<String>());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K 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 May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 3.5K bytes - Viewed (0) -
cmd/format-erasure.go
tmpFormat.Erasure.This = "" if len(reference.Erasure.Sets) != len(format.Erasure.Sets) { return fmt.Errorf("Expected number of sets %d, got %d", len(reference.Erasure.Sets), len(format.Erasure.Sets)) } // Make sure that the sets match. for i := range reference.Erasure.Sets { if len(reference.Erasure.Sets[i]) != len(format.Erasure.Sets[i]) { return fmt.Errorf("Each set should be of same size, expected %d got %d",
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 23.2K 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 May 05 19:28:20 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 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)