Search Options

Results per page
Sort
Preferred Languages
Advance

Results 721 - 730 of 840 for release (0.03 sec)

  1. CONTRIBUTING.md

    + Run all the tests with `mvn -Prun-its verify` to assure nothing else was accidentally broken.
    + Submit a pull request to the repository in the Apache organization.
    
    If you plan to contribute on a regular basis, please consider filing a [contributor license agreement][cla].
    
    Additional Resources
    --------------------
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Sat Jun 07 09:55:33 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. android/guava-testlib/src/com/google/common/collect/testing/testers/ListAddAllAtIndexTester.java

    import java.util.List;
    import org.junit.Ignore;
    
    /**
     * A generic JUnit test which tests {@code addAll(int, Collection)} operations on a list. Can't be
     * invoked directly; please see {@link com.google.common.collect.testing.ListTestSuiteBuilder}.
     *
     * @author Chris Povirk
     */
    @GwtCompatible
    @Ignore("test runners must not instantiate and run this directly, only via suites we build")
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Nov 14 23:40:07 UTC 2024
    - 6.4K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java

      //   2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78
      private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41
      private static final int CRC32C_GENERATOR_FLIPPED = Integer.reverse(CRC32C_GENERATOR);
    
      public void testCrc32cByteTable() {
        // See Hacker's Delight 2nd Edition, Figure 14-7.
        int[] expected = new int[256];
        for (int i = 0; i < expected.length; i++) {
          int crc = i;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 6.6K bytes
    - Viewed (0)
  4. cmd/metacache.go

    )
    
    //go:generate msgp -file $GOFILE -unexported
    
    // metacache contains a tracked cache entry.
    type metacache struct {
    	// do not re-arrange the struct this struct has been ordered to use less
    	// space - if you do so please run https://github.com/orijtech/structslop
    	// and verify if your changes are optimal.
    	ended        time.Time  `msg:"end"`
    	started      time.Time  `msg:"st"`
    	lastHandout  time.Time  `msg:"lh"`
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 6K bytes
    - Viewed (0)
  5. docs/en/docs/async.md

    This idea of **asynchronous** code described above is also sometimes called **"concurrency"**. It is different from **"parallelism"**.
    
    **Concurrency** and **parallelism** both relate to "different things happening more or less at the same time".
    
    But the details between *concurrency* and *parallelism* are quite different.
    
    To see the difference, imagine the following story about burgers:
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24K bytes
    - Viewed (0)
  6. src/main/java/jcifs/internal/smb1/trans/SmbComTransaction.java

         * @param buffer
         *            the transaction buffer to use
         */
        public void setBuffer(final byte[] buffer) {
            this.txn_buf = buffer;
        }
    
        /**
         * Releases and returns the transaction buffer
         * @return the txn_buf
         */
        public byte[] releaseBuffer() {
            final byte[] buf = this.txn_buf;
            this.txn_buf = null;
            return buf;
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 17.3K bytes
    - Viewed (0)
  7. guava/src/com/google/common/collect/ImmutableSortedMultiset.java

        ImmutableSortedMultiset<E> result = descendingMultiset;
        if (result == null) {
          return descendingMultiset =
              this.isEmpty()
                  ? emptyMultiset(Ordering.from(comparator()).reverse())
                  : new DescendingImmutableSortedMultiset<E>(this);
        }
        return result;
      }
    
      /**
       * {@inheritDoc}
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  8. LICENSE

     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
     Everyone is permitted to copy and distribute verbatim copies
     of this license document, but changing it is not allowed.
    
    (This is the first released version of the Lesser GPL.  It also counts
     as the successor of the GNU Library Public License, version 2, hence
     the version number 2.1.)
    
                                Preamble
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Mon Jan 18 20:25:38 UTC 2016
    - 25.8K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/Lists.java

       *
       * @since 7.0
       */
      public static <T extends @Nullable Object> List<T> reverse(List<T> list) {
        if (list instanceof ImmutableList) {
          // Avoid nullness warnings.
          List<?> reversed = ((ImmutableList<?>) list).reverse();
          @SuppressWarnings("unchecked")
          List<T> result = (List<T>) reversed;
          return result;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 42.2K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb/NtlmPasswordAuthenticator.java

                throws SmbException {
            checkNotClosed();
    
            // Check if authentication has expired
            if (isExpired()) {
                throw new SmbException("Authentication has expired. Please re-authenticate.");
            }
    
            // Generate session ID for secure key management
            if (this.sessionId == null) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 30.3K bytes
    - Viewed (0)
Back to top