- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,987 for setI (0.06 sec)
-
src/test/java/org/codelibs/core/beans/util/BeanUtilTest.java
} /** * @throws Exception */ @Test public void testCopy_BeanToMap() throws Exception { final HogeDto hoge = new HogeDto(); hoge.setA("A"); hoge.setB(true); hoge.setC(3); final Map<String, Object> map = newHashMap(); BeanUtil.copyBeanToMap(hoge, map); assertThat(map, is(notNullValue())); assertThat(map.get("a"), is((Object) "A"));
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 34.5K bytes - Viewed (0) -
cmd/erasure-server-pool-rebalance.go
workerSize, err := env.GetInt(envRebalanceWorkers, len(pool.sets)) if err != nil { rebalanceLogIf(ctx, fmt.Errorf("invalid workers value err: %v, defaulting to %d", err, len(pool.sets))) workerSize = len(pool.sets) } // Each decom worker needs one List() goroutine/worker // add that many extra workers. workerSize += len(pool.sets) wk, err := workers.New(workerSize) if err != nil { return err
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 13:20:19 UTC 2024 - 28.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetOperationsTest.java
protected Set<String> create(String[] elements) { Set<String> set = newHashSet(elements); Set<String> other = newHashSet("wz", "xq"); set.addAll(other); other.add("pq"); return Sets.difference(set, other); } }) .named("set - set") .withFeatures(
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 14.5K 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.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetOperationsTest.java
protected Set<String> create(String[] elements) { Set<String> set = newHashSet(elements); Set<String> other = newHashSet("wz", "xq"); set.addAll(other); other.add("pq"); return Sets.difference(set, other); } }) .named("set - set") .withFeatures(
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 14.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
if (set.isEmpty()) { /* * The (tooLow + 1, tooHigh) arguments below would be invalid because tooLow would be * greater than tooHigh. */ return ContiguousSet.create(Range.openClosed(0, 1), DiscreteDomain.integers()).subSet(0, 1); } int tooHigh = set.last() + 1; int tooLow = set.first() - 1; set.add(tooHigh);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 15.6K 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",
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 23.2K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/ModelBuildingRequest.java
* * @return The source of the POM or {@code null} if not set. */ ModelSource getModelSource(); /** * Sets the source of the POM to process. Eventually, either {@link #setModelSource(ModelSource)} or * {@link #setPomPath(Path)} must be set. * * @param modelSource The source of the POM to process, may be {@code null}. * @return This request, never {@code null}. */
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 14.9K bytes - Viewed (0) -
cmd/metacache-server-pool.go
if o.pool < len(z.serverPools) && o.set < len(z.serverPools[o.pool].sets) { o.debugln("Resuming", o) entries, err = z.serverPools[o.pool].sets[o.set].streamMetadataParts(ctx, *o) entries.reuse = true // We read from stream and are not sharing results. if err == nil { return entries, nil } } else { err = fmt.Errorf("invalid pool/set") o.pool, o.set = 0, 0 } }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 12 16:23:16 UTC 2024 - 12.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsFilterHashSetTest.java
*/ package com.google.common.collect; import static com.google.common.collect.Sets.newHashSet; import com.google.common.base.Predicate; import com.google.common.collect.FilteredCollectionsTestUtil.AbstractFilteredSetTest; import java.util.Set; public final class SetsFilterHashSetTest extends AbstractFilteredSetTest<Set<Integer>> { @Override Set<Integer> createUnfiltered(Iterable<Integer> contents) { return newHashSet(contents);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 1.2K bytes - Viewed (0)