Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 307 for random (0.04 sec)

  1. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBenchmark.java

        queue = (BlockingQueue<String>) constructor.newInstance(capacity);
    
        strings = new String[capacity];
        for (int i = 0; i < capacity; i++) {
          strings[i] = String.valueOf(Math.random());
        }
      }
    
      @Benchmark
      void addsAndRemoves(int reps) {
        int capacity = this.capacity;
        BlockingQueue<String> queue = this.queue;
        String[] strings = this.strings;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 2.1K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/base/CharMatcherTest.java

        assertTrue(len4.matches('d'));
        for (char c = 'e'; c < 'z'; c++) {
          assertFalse(len4.matches(c));
        }
    
        Random rand = new Random(1234);
        for (int testCase = 0; testCase < 100; testCase++) {
          char[] chars = randomChars(rand, rand.nextInt(63) + 1);
          CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars));
          checkExactMatches(m, chars);
        }
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 30.4K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/math/IntMathTest.java

        for (int i = 0; i < 100000; i++) {
          assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
        }
    
        // Then check 1000 deterministic pseudo-random int values.
        Random rand = new Random(1);
        for (int i = 0; i < 1000; i++) {
          int n = rand.nextInt(Integer.MAX_VALUE);
          assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
        }
      }
    
      public void testSaturatedAbs() {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 24.1K bytes
    - Viewed (0)
  4. android/guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java

        ArbitraryInstances.get(Stopwatch.class).start();
        assertNotNull(ArbitraryInstances.get(Ticker.class));
        assertFreshInstanceReturned(Random.class);
        assertEquals(
            ArbitraryInstances.get(Random.class).nextInt(),
            ArbitraryInstances.get(Random.class).nextInt());
      }
    
      public void testGet_concurrent() {
        assertTrue(ArbitraryInstances.get(BlockingDeque.class).isEmpty());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Jul 16 17:42:14 UTC 2025
    - 21.8K bytes
    - Viewed (0)
  5. docs/throttle/README.md

    ## Examples
    
    ### Configuring connection limit
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 16 08:43:49 UTC 2024
    - 1.5K bytes
    - Viewed (1)
  6. android/guava-tests/test/com/google/common/base/CharMatcherTest.java

        assertTrue(len4.matches('d'));
        for (char c = 'e'; c < 'z'; c++) {
          assertFalse(len4.matches(c));
        }
    
        Random rand = new Random(1234);
        for (int testCase = 0; testCase < 100; testCase++) {
          char[] chars = randomChars(rand, rand.nextInt(63) + 1);
          CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars));
          checkExactMatches(m, chars);
        }
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 30.3K bytes
    - Viewed (0)
  7. cmd/erasure-heal_test.go

    		if err != nil {
    			t.Fatalf("Test %d: failed to create ErasureStorage: %v", i, err)
    		}
    		data := make([]byte, test.size)
    		if _, err = io.ReadFull(rand.Reader, data); err != nil {
    			t.Fatalf("Test %d: failed to create random test data: %v", i, err)
    		}
    		buffer := make([]byte, test.blocksize, 2*test.blocksize)
    		writers := make([]io.Writer, len(disks))
    		for i, disk := range disks {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  8. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache2/FileOperator.kt

    /**
     * Read and write a target file. Unlike Okio's built-in `Okio.source(java.io.File file)` and `Okio.sink(java.io.File file)`
     * this class offers:
     *
     *  * **Read/write:** read and write using the same operator.
     *  * **Random access:** access any position within the file.
     *  * **Shared channels:** read and write a file channel that's shared between
     * multiple operators. Note that although the underlying [FileChannel] may be shared,
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  9. docs/sts/web-identity.py

    app = Flask(__name__)
    
    
    @app.route('/')
    def homepage():
        text = '<a href="%s">Authenticate with keycloak</a>'
        return text % make_authorization_url()
    
    
    def make_authorization_url():
        # Generate a random string for the state parameter
        # Save it for use later to prevent xsrf attacks
    
        state = str(uuid4())
        params = {"client_id": client_id,
                  "response_type": "code",
                  "state": state,
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Jul 28 01:37:51 UTC 2021
    - 2.9K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb/SmbTreeConnection.java

        private SmbTransportInternal exclusiveTransport;
        private boolean nonPooled;
    
        private final AtomicLong usageCount = new AtomicLong();
    
        private static final Random RAND = new Random();
    
        protected SmbTreeConnection(final CIFSContext ctx) {
            this.ctx = ctx;
            this.delegate = null;
        }
    
        protected SmbTreeConnection(final SmbTreeConnection treeConnection) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 30.4K bytes
    - Viewed (0)
Back to top