Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 79 for ran0 (0.01 sec)

  1. guava-tests/test/com/google/common/util/concurrent/WrappingExecutorServiceTest.java

        {
          MockExecutor mock = new MockExecutor();
          TestExecutor testExecutor = new TestExecutor(mock);
          String s = testExecutor.invokeAny(tasks);
          assertEquals("ran0", s);
          mock.assertLastMethodCalled("invokeAny");
        }
        {
          MockExecutor mock = new MockExecutor();
          TimeUnit unit = SECONDS;
          long timeout = 5;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Jul 14 14:44:08 UTC 2025
    - 9.9K bytes
    - Viewed (0)
  2. cmd/metacache-entries_test.go

    data/huffman-pi.wb.expect-noinput", "src/compress/flate/testdata/huffman-rand-1k.dyn.expect", "src/compress/flate/testdata/huffman-rand-1k.dyn.expect-noinput", "src/compress/flate/testdata/huffman-rand-1k.golden", "src/compress/flate/testdata/huffman-rand-1k.in", "src/compress/flate/testdata/huffman-rand-1k.wb.expect", "src/compress/flate/testdata/huffman-rand-1k.wb.expect-noinput", "src/compress/flate/testdata/huffman-rand-limit.dyn.expect", "src/compress/flate/testdata/huffman-rand-limit.dyn.expect-noinput",...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 31.6K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java

        }
    
        /**
         * Loads the available searcher names from system properties.
         * Parses the "rank.fusion.searchers" system property to determine which searchers
         * are available for use in rank fusion processing.
         */
        protected void load() {
            final String value = System.getProperty("rank.fusion.searchers");
            if (StringUtil.isBlank(value)) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/HashTestUtils.java

        Random rand = new Random(0);
        int keyBits = 32;
        int hashBits = function.bits();
        for (int i = 0; i < keyBits; i++) {
          int[] same = new int[hashBits];
          int[] diff = new int[hashBits];
          // go through trials to compute probability
          for (int j = 0; j < trials; j++) {
            int key1 = rand.nextInt();
            // flip input bit for key2
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  5. cmd/erasure.go

    	var wg sync.WaitGroup
    	disks := er.getDisks()
    	infos := make([]DiskInfo, len(disks))
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	for _, i := range r.Perm(len(disks)) {
    		wg.Add(1)
    		go func() {
    			defer wg.Done()
    
    			disk := disks[i]
    			if disk == nil {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 16.1K bytes
    - Viewed (0)
  6. cmd/metacache-stream_test.go

    data/huffman-pi.wb.expect-noinput", "src/compress/flate/testdata/huffman-rand-1k.dyn.expect", "src/compress/flate/testdata/huffman-rand-1k.dyn.expect-noinput", "src/compress/flate/testdata/huffman-rand-1k.golden", "src/compress/flate/testdata/huffman-rand-1k.in", "src/compress/flate/testdata/huffman-rand-1k.wb.expect", "src/compress/flate/testdata/huffman-rand-1k.wb.expect-noinput", "src/compress/flate/testdata/huffman-rand-limit.dyn.expect", "src/compress/flate/testdata/huffman-rand-limit.dyn.expect-noinput",...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 15K bytes
    - Viewed (0)
  7. docs/vi/docs/python-types.md

    Cả hai là tương đương và bên dưới chúng giống nhau, nhưng tôi sẽ đễ xuất `Union` thay cho `Optional` vì từ "**tùy chọn**" có vẻ ngầm định giá trị là tùy chọn, và nó thực sự có nghĩa rằng "nó có thể là `None`", do đó nó không phải là tùy chọn và nó vẫn được yêu cầu.
    
    Tôi nghĩ `Union[SomeType, None]` là rõ ràng hơn về ý nghĩa của nó.
    
    Nó chỉ là về các từ và tên. Nhưng những từ đó có thể ảnh hưởng cách bạn và những đồng đội của bạn suy nghĩ về code.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 21.5K bytes
    - Viewed (0)
  8. api/go1.23.txt

    pkg maps, func Values[$0 interface{ ~map[$1]$2 }, $1 comparable, $2 interface{}]($0) iter.Seq[$2] #61900
    pkg math/rand/v2, func Uint() uint #61716
    pkg math/rand/v2, method (*ChaCha8) Read([]uint8) (int, error) #67059
    pkg math/rand/v2, method (*Rand) Uint() uint #61716
    pkg net, method (*DNSError) Unwrap() error #63116
    pkg net, method (*TCPConn) SetKeepAliveConfig(KeepAliveConfig) error #62254
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Jun 25 17:08:08 UTC 2024
    - 10.1K bytes
    - Viewed (0)
  9. cmd/local-locker_test.go

    	}
    	if len(l.lockUID) != 0 {
    		t.Fatalf("lockUID len, got %d, want %d + %d", len(l.lockUID), 0, 0)
    	}
    }
    
    func Test_localLocker_expireOldLocksExpire(t *testing.T) {
    	rng := rand.New(rand.NewSource(0))
    	quorum := 0
    	// Numbers of unique locks
    	for _, locks := range []int{100, 1000, 1e6} {
    		if testing.Short() && locks > 100 {
    			continue
    		}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 11.8K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb1/util/DES.java

        private void cookey(final int[] raw, final int KnL[]) {
            int raw0, raw1;
            int rawi, KnLi;
            int i;
    
            for (i = 0, rawi = 0, KnLi = 0; i < 16; ++i) {
                raw0 = raw[rawi];
                rawi++;
                raw1 = raw[rawi++];
                KnL[KnLi] = (raw0 & 0x00fc0000) << 6;
                KnL[KnLi] |= (raw0 & 0x00000fc0) << 10;
                KnL[KnLi] |= (raw1 & 0x00fc0000) >>> 10;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 22.7K bytes
    - Viewed (0)
Back to top