- Sort Score
- Result 10 results
- Languages All
Results 331 - 340 of 718 for setOp (0.02 sec)
-
guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java
LinkedHashMultiset<Object> linkedHashMultiset; HashMultiset<Object> hashMultiset; // TreeMultiset requires a Comparable element. TreeMultiset<Integer> treeMultiset; @BeforeExperiment void setUp() { hashMultiset = HashMultiset.create(size); linkedHashMultiset = LinkedHashMultiset.create(size); treeMultiset = TreeMultiset.create(); Random random = new Random(); int sizeRemaining = size;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 2.7K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/TearDownStackTest.java
} assertEquals(true, tearDownOne.ran); assertEquals(true, tearDownTwo.ran); } @Override public final void runBare() throws Throwable { try { setUp(); runTest(); } finally { tearDown(); } } @Override protected void tearDown() { tearDownStack.runTearDown(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jun 21 10:19:29 UTC 2024 - 4.6K bytes - Viewed (0) -
src/test/java/org/codelibs/core/collection/CaseInsensitiveMapTest.java
import org.junit.Test; /** * @author higa */ public class CaseInsensitiveMapTest { CaseInsensitiveMap<String> map; /** * @throws Exception */ @Before public void setUp() throws Exception { map = new CaseInsensitiveMap<String>(); map.put("one", "1"); map.put("two", "2"); } /** * @throws Exception */ @After
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 4K bytes - Viewed (0) -
CONTRIBUTING.md
## Development Workflow Start by forking the MinIO GitHub repository, make changes in a branch and then send a pull request. We encourage pull requests to discuss code changes. Here are the steps in details: ### Setup your MinIO GitHub Repository Fork [MinIO upstream](https://github.com/minio/minio/fork) source repository to your own personal repository. Copy the URL of your MinIO fork (you will need it for the `git clone` command below).
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Aug 05 18:35:53 UTC 2024 - 2.9K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/lifecycle/LifecycleExecutor.java
PluginVersionResolutionException; MavenExecutionPlan calculateExecutionPlan(MavenSession session, boolean setup, String... tasks) throws PluginNotFoundException, PluginResolutionException, PluginDescriptorParsingException, MojoNotFoundException, NoPluginFoundForPrefixException, InvalidPluginDescriptorException,
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 4.2K bytes - Viewed (0) -
tests/joins_table_test.go
} func TestOverrideJoinTable(t *testing.T) { DB.Migrator().DropTable(&Person{}, &Address{}, &PersonAddress{}) if err := DB.SetupJoinTable(&Person{}, "Addresses", &PersonAddress{}); err != nil { t.Fatalf("Failed to setup join table for person, got error %v", err) } if err := DB.AutoMigrate(&Person{}, &Address{}); err != nil { t.Fatalf("Failed to migrate, got %v", err) } address1 := Address{Name: "address 1"}
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Thu Sep 10 13:46:18 UTC 2020 - 3.5K bytes - Viewed (0) -
src/test/java/jcifs/tests/ReadWriteTest.java
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 13.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
@Param({"100", "10000"}) private int size; @Param private HeapType heap; private Queue<Integer> queue; private final Random random = new Random(); @BeforeExperiment void setUp() { queue = heap.create(comparator.get()); for (int i = 0; i < size; i++) { queue.add(random.nextInt()); } } @Benchmark void pollAndAdd(int reps) { for (int i = 0; i < reps; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 4.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/StatsBenchmark.java
@Param({"100", "10000"}) int n; @Param MeanAlgorithm meanAlgorithm; @Param VarianceAlgorithm varianceAlgorithm; private double[][] values = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { values[i] = new double[n]; for (int j = 0; j < n; j++) { values[i][j] = rng.nextDouble(); } } }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.7K bytes - Viewed (0) -
src/test/java/jcifs/tests/NtlmTest.java
import jcifs.ntlmssp.Type3Message; /** * @author mbechler * */ @SuppressWarnings ( "javadoc" ) public class NtlmTest { private CIFSContext context; @Before public void setUp () { this.context = SingletonContext.getInstance(); } @Test public void testParsingType1 () throws IOException { int flags = 0x80000000; String suppliedDomain = "TESTDOM";
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Dec 16 10:38:43 UTC 2018 - 4.8K bytes - Viewed (0)