Search Options

Results per page
Sort
Preferred Languages
Advance

Results 681 - 690 of 1,247 for each (1.19 sec)

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

        checkHelperVersion(NO_UNSAFE, "AtomicReferenceFieldUpdaterAtomicHelper");
        checkHelperVersion(NO_ATOMIC_REFERENCE_FIELD_UPDATER, "SynchronizedHelper");
    
        // Then, run the actual tests under each alternative classloader:
    
        /*
         * Under Java 8, there is no need to test the no-VarHandle case here: It's already tested by the
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  2. src/test/java/jcifs/internal/smb2/RequestWithFileIdTest.java

                    Smb2QueryDirectoryRequest.class, Smb2ReadRequest.class, Smb2WriteRequest.class, Smb2FlushRequest.class,
                    Smb2IoctlRequest.class, Smb2LockRequest.class };
    
            // Verify each implements the interface
            for (Class<?> impl : implementations) {
                assertTrue(RequestWithFileId.class.isAssignableFrom(impl), impl.getSimpleName() + " should implement RequestWithFileId");
            }
        }
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.9K bytes
    - Viewed (0)
  3. src/test/java/jcifs/netbios/SessionRequestPacketTest.java

            byte[] dst = new byte[256];
            int bytesWritten = packet.writeTrailerWireFormat(dst, 0);
    
            assertTrue(bytesWritten > 0);
            // Each name should write at least 34 bytes (encoded name + scope)
            assertTrue(bytesWritten >= 68);
        }
    
        @Test
        @DisplayName("writeTrailerWireFormat with scope should handle scoped names")
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.5K bytes
    - Viewed (0)
  4. compat/maven-compat/src/main/java/org/apache/maven/project/interpolation/AbstractStringBasedModelInterpolator.java

            }
    
            return model;
        }
    
        /**
         * Interpolates all expressions in the src parameter.
         * <p>
         * The algorithm used for each expression is:
         * <ul>
         *   <li>If it starts with either "pom." or "project.", the expression is evaluated against the model.</li>
         *   <li>If the value is null, get the value from the context.</li>
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 13.6K bytes
    - Viewed (0)
  5. cmd/erasure-coding.go

    			failOnErr(err)
    			encoded, err := e.EncodeData(GlobalContext, testData[:])
    			failOnErr(err)
    			hash := xxhash.New()
    			for i, data := range encoded {
    				// Write index to keep track of sizes of each.
    				_, err = hash.Write([]byte{byte(i)})
    				failOnErr(err)
    				_, err = hash.Write(data)
    				failOnErr(err)
    				got[conf] = map[ErasureAlgo]uint64{algo: hash.Sum64()}
    			}
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  6. internal/mountinfo/mountinfo_linux_test.go

    		`
    	var err error
    	dir := t.TempDir()
    
    	mountsPath := filepath.Join(dir, "mounts")
    	if err = os.WriteFile(mountsPath, []byte(successCase), 0o666); err != nil {
    		t.Fatal(err)
    	}
    	// Verifies if reading each line worked properly.
    	{
    		var mounts mountInfos
    		mounts, err = readProcMounts(mountsPath)
    		if err != nil {
    			t.Fatal(err)
    		}
    		if len(mounts) != 3 {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  7. build-logic/documentation/src/test/groovy/gradlebuild/docs/FindBrokenInternalLinksTest.groovy

        }
    
        private void assertFoundDeadLinks(Collection<DeadLink> deadLinks) {
            assert linkErrors.exists()
    
            def lines = linkErrors.readLines()
            deadLinks.each { deadLink ->
                String errorStart = "ERROR: ${deadLink.file.name}:"
                assert lines.any { it.startsWith(errorStart) && it.endsWith(deadLink.message) }
            }
        }
    
    Registered: Wed Dec 31 11:36:14 UTC 2025
    - Last Modified: Thu Aug 21 16:24:54 UTC 2025
    - 11.6K bytes
    - Viewed (0)
  8. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/concurrent/TaskQueue.kt

    import java.util.concurrent.RejectedExecutionException
    import okhttp3.internal.okHttpName
    
    /**
     * A set of tasks that are executed in sequential order.
     *
     * Work within queues is not concurrent. This is equivalent to each queue having a dedicated thread
     * for its work; in practice a set of queues may share a set of threads to save resources.
     */
    class TaskQueue internal constructor(
      internal val taskRunner: TaskRunner,
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Wed May 28 23:28:25 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/Serialization.java

       * Multimap#asMap} view determines the ordering in which data is written to the stream.
       *
       * <p>The serialized output consists of the number of distinct keys, and then for each distinct
       * key: the key, the number of values for that key, and the key's values.
       */
      static <K extends @Nullable Object, V extends @Nullable Object> void writeMultimap(
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Dec 09 15:58:48 UTC 2025
    - 6.7K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/hash/HashTestUtils.java

       * bit(j) about half the time
       *
       * <p>Funneling is pretty simple to detect. The key idea is to find example keys which
       * unequivocally demonstrate that funneling cannot be occurring. This is done bit-by-bit. For each
       * input bit(i) and output bit(j), two pairs of keys must be found with all bits identical except
       * bit(i). One pair must differ in output bit(j), and one pair must not. This proves that input
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
Back to top