Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 778 for iterations (0.13 sec)

  1. cmd/prepare-storage.go

    	}
    
    	tries++ // tried already once
    
    	// Wait on each try for an update.
    	ticker := time.NewTicker(1 * time.Second)
    	defer ticker.Stop()
    
    	for {
    		// Only log once every 10 iterations, then reset the tries count.
    		verbose = tries >= 10
    		if verbose {
    			tries = 1
    		}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

        putEdge(N2, N1);
        assertThat(graph.outDegree(N1)).isEqualTo(3);
      }
    
      // Stable order tests
    
      // Note: Stable order means that the ordering doesn't change between iterations and versions.
      // Ideally, the ordering in test should never be updated.
      @Test
      public void stableIncidentEdgeOrder_edges_returnsInStableOrder() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 02 18:21:29 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/hash/HashingTest.java

        HashTestUtils.assertInvariants(Hashing.fingerprint2011());
        assertEquals("Hashing.fingerprint2011()", Hashing.fingerprint2011().toString());
      }
    
      @AndroidIncompatible // slow TODO(cpovirk): Maybe just reduce iterations under Android.
      public void testGoodFastHash() {
        for (int i = 1; i < 200; i += 17) {
          HashFunction hasher = Hashing.goodFastHash(i);
          assertTrue(hasher.bits() >= i);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 09 17:40:09 UTC 2024
    - 26.3K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/collect/OrderingTest.java

        runLeastOfComparison(10, 30, 2);
      }
    
      private static void runLeastOfComparison(int iterations, int elements, int seeds) {
        Random random = new Random(42);
        Ordering<Integer> ordering = Ordering.natural();
    
        for (int i = 0; i < iterations; i++) {
          List<Integer> list = Lists.newArrayList();
          for (int j = 0; j < elements; j++) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 42.6K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/collect/OrderingTest.java

        runLeastOfComparison(10, 30, 2);
      }
    
      private static void runLeastOfComparison(int iterations, int elements, int seeds) {
        Random random = new Random(42);
        Ordering<Integer> ordering = Ordering.natural();
    
        for (int i = 0; i < iterations; i++) {
          List<Integer> list = Lists.newArrayList();
          for (int j = 0; j < elements; j++) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 42.6K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java

                    }
                  },
                  directExecutor());
          for (int i = 0; i < 50_000; i++) {
            if (i % DIRECT_EXECUTIONS_PER_THREAD == 0) {
              // after some number of iterations, switch threads
              unused =
                  serializer.submit(
                      new Callable<@Nullable Void>() {
                        @Override
                        public @Nullable Void call() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 22:10:29 UTC 2024
    - 16.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/BigIntegerMath.java

         * with each iteration, so this algorithm takes O(log(digits)) iterations.
         *
         * We start out with a double-precision approximation, which may be higher or lower than the
         * true value. Therefore, we perform at least one Newton iteration to get a guess that's
         * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
         */
        BigInteger sqrt0;
        int log2 = log2(x, FLOOR);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/hash/BloomFilterTest.java

        BloomFilter<Object> bf = BloomFilter.create(HashTestUtils.BAD_FUNNEL, 10, 0.03);
        double fpp = bf.expectedFpp();
        assertThat(fpp).isEqualTo(0.0);
        // usually completed in less than 200 iterations
        while (fpp != 1.0) {
          boolean changed = bf.put(new Object());
          double newFpp = bf.expectedFpp();
          // if changed, the new fpp is strictly higher, otherwise it is the same
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/cache/CacheLoadingTest.java

            CacheBuilder.newBuilder().weakValues().build(countingLoader);
        ConcurrentMap<Object, Object> map = cache.asMap();
    
        int iterations = 10;
        WeakReference<Object> ref = new WeakReference<>(null);
        int expectedComputations = 0;
        for (int i = 0; i < iterations; i++) {
          // The entry should get garbage collected and recomputed.
          Object oldValue = ref.get();
          if (oldValue == null) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 86.3K bytes
    - Viewed (0)
  10. tensorflow/c/eager/c_api_test.cc

        CHECK_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status);
        TFE_Execute(matmul, &retvals[0], &num_retvals, status);
        CHECK_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status);
        if (state.iterations() >= state.max_iterations && async) {
          TFE_Executor* executor = TFE_ContextGetExecutorForThread(ctx);
          TFE_ExecutorWaitForAllPendingNodes(executor, status);
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Aug 03 20:50:20 UTC 2023
    - 94.6K bytes
    - Viewed (0)
Back to top