Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 384 for Polling (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. android/guava-tests/test/com/google/common/math/MathBenchmarking.java

        if (digits == 0) {
          return new BigInteger(1, RANDOM_SOURCE);
        } else {
          return new BigInteger(digits, RANDOM_SOURCE).setBit(digits);
        }
      }
    
      /**
       * Equivalent to calling randomPositiveBigInteger(numBits) and then flipping the sign with 50%
       * probability.
       */
      static BigInteger randomNonZeroBigInteger(int numBits) {
        BigInteger result = randomPositiveBigInteger(numBits);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Aug 10 19:54:19 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  2. src/main/webapp/WEB-INF/view/header.jsp

    					<c:if test="${eoled}">
    						<li class="nav-item" data-bs-toggle="tooltip" data-placement="left" title="<la:message key="labels.eol_error" />">
    							<a class="nav-link active" href="${eolLink}" target="_olh"><i class="fas fa-times-circle text-danger" aria-hidden="true"></i></a>
    						</li>
    					</c:if>
    					<c:if test="${developmentMode}">
    						<li class="nav-item" data-bs-toggle="tooltip" data-placement="left"
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Thu Nov 13 05:54:52 GMT 2025
    - 4.3K bytes
    - Click Count (0)
  3. guava/src/com/google/common/hash/MessageDigestHashFunction.java

        @Override
        protected void update(ByteBuffer bytes) {
          checkNotDone();
          digest.update(bytes);
        }
    
        private void checkNotDone() {
          checkState(!done, "Cannot re-use a Hasher after calling hash() on it");
        }
    
        @Override
        public HashCode hash() {
          checkNotDone();
          done = true;
          return (bytes == digest.getDigestLength())
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Feb 13 17:34:21 GMT 2025
    - 4.9K bytes
    - Click Count (0)
  4. cmd/object-api-deleteobject_test.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package cmd
    
    import (
    	"context"
    	"crypto/md5"
    	"encoding/hex"
    	"strings"
    	"testing"
    )
    
    // Wrapper for calling DeleteObject tests for both Erasure multiple disks and single node setup.
    func TestDeleteObject(t *testing.T) {
    	ExecObjectLayerTest(t, testDeleteObject)
    }
    
    // Unit test for DeleteObject in general.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Thu Aug 29 01:40:52 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  5. guava/src/com/google/common/collect/ImmutableEnumSet.java

            return new ImmutableEnumSet<>(set);
        }
      }
    
      /*
       * Notes on EnumSet and <E extends Enum<E>>:
       *
       * This class isn't an arbitrary ForwardingImmutableSet because we need to
       * know that calling {@code clone()} during deserialization will return an
       * object that no one else has a reference to, allowing us to guarantee
       * immutability. Hence, we support only {@link EnumSet}.
       */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 4.5K bytes
    - Click Count (0)
  6. internal/disk/stat_windows.go

    	// which is the total amount of space, the total amount of free space, and the total
    	// amount of free space available to the user that is associated with the calling thread.
    	GetDiskFreeSpaceEx = kernel32.NewProc("GetDiskFreeSpaceExW")
    
    	// GetDiskFreeSpace - https://msdn.microsoft.com/en-us/library/windows/desktop/aa364935(v=vs.85).aspx
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Feb 26 19:34:50 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  7. okhttp-testing-support/src/main/kotlin/okhttp3/internal/duplex/MockSocketHandler.kt

    import okhttp3.internal.connection.asBufferedSocket
    import okio.Socket
    import okio.utf8Size
    
    private typealias Action = (BufferedSocket) -> Unit
    
    /**
     * A scriptable request/response conversation. Create the script by calling methods like
     * [receiveRequest] in the sequence they are run.
     */
    class MockSocketHandler : SocketHandler {
      private val actions = LinkedBlockingQueue<Action>()
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Thu Jul 31 04:18:40 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/base/SneakyThrows.java

       * fact the static type of {@link Throwable} is occasionally justified even for a method with no
       * {@code throws} clause: Some such methods can in fact throw a checked exception (e.g., by
       * calling code written in Kotlin).) Typically, we want to let a {@link Throwable} from such a
       * method propagate untouched, just as we'd typically let it do for a non-reflective call.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Feb 03 21:52:39 GMT 2025
    - 2.4K bytes
    - Click Count (0)
  9. internal/s3select/jstream/scanner.go

    	return s.buf[s.ipos]
    }
    
    // back undoes a previous call to next(), moving backward one byte in the internal buffer.
    // as we only guarantee a lookback buffer size of one, any subsequent calls to back()
    // before calling next() may panic
    func (s *scanner) back() {
    	if s.ipos <= 0 {
    		panic("back buffer exhausted")
    	}
    	s.ipos--
    	s.pos--
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Sep 23 19:35:41 GMT 2024
    - 2.5K bytes
    - Click Count (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/Tags.kt

    import kotlin.reflect.KClass
    
    /**
     * An immutable collection of key-value pairs implemented as a singly-linked list.
     *
     * Build up a collection by starting with [EmptyTags] and repeatedly calling [plus]. Each such call
     * returns a new instance.
     *
     * This collection is optimized for safe concurrent access over a very small number of elements.
     *
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Fri Oct 24 11:37:46 GMT 2025
    - 3.9K bytes
    - Click Count (0)
Back to Top