Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 305 for earlier (0.11 sec)

  1. common-protos/k8s.io/api/admission/v1beta1/generated.proto

    message AdmissionRequest {
      // UID is an identifier for the individual request/response. It allows us to distinguish instances of requests which are
      // otherwise identical (parallel requests, requests when earlier requests did not modify etc)
      // The UID is meant to track the round trip (request/response) between the KAS and the WebHook, not the user request.
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 8.1K bytes
    - Viewed (0)
  2. guava/src/com/google/common/util/concurrent/AggregateFutureState.java

        if (seenExceptionsLocal == null) {
          // TODO(cpovirk): Should we use a simpler (presumably cheaper) data structure?
          /*
           * Using weak references here could let us release exceptions earlier, but:
           *
           * 1. On Android, querying a WeakReference blocks if the GC is doing an otherwise-concurrent
           * pass.
           *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue May 28 20:40:51 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/hash/Murmur3_32HashFunction.java

                return hashBytes(input.toString().getBytes(charset));
              }
              i++;
              buffer |= codePointToFourUtf8Bytes(codePoint) << shift;
              if (supplementaryPlaneFix) { // bug compatibility: earlier versions did not have this add
                shift += 32;
              }
              len += 4;
            }
    
            if (shift >= 32) {
              int k1 = mixK1((int) buffer);
              h1 = mixH1(h1, k1);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Aug 02 13:50:22 UTC 2024
    - 11.8K bytes
    - Viewed (0)
  4. guava-testlib/src/com/google/common/collect/testing/features/FeatureUtil.java

        if (!disjoint(newFeatures, earlierFeatures)) {
          throw new ConflictingRequirementsException(
              String.format(
                  Locale.ROOT,
                  "Annotation requires to be %s features that earlier "
                      + "annotations required to be %s.",
                  newRequirement,
                  earlierRequirement),
              intersection(newFeatures, earlierFeatures),
              source);
        }
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 05 22:05:05 UTC 2024
    - 12.2K bytes
    - Viewed (0)
  5. internal/lock/lock_windows.go

    	//
    	// The MSDN docs appear to say that a normal path that is 248 bytes long
    	// will work; empirically the path must be less then 248 bytes long.
    	if len(path) < 248 {
    		// Don't fix. (This is how Go 1.7 and earlier worked,
    		// not automatically generating the \\?\ form)
    		return path
    	}
    
    	// The extended form begins with \\?\, as in
    	// \\?\c:\windows\foo.txt or \\?\UNC\server\share\foo.txt.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 18 18:08:15 UTC 2023
    - 7.9K bytes
    - Viewed (0)
  6. okhttp/src/main/kotlin/okhttp3/CertificatePinner.kt

        @JvmStatic
        fun X509Certificate.sha256Hash(): ByteString = publicKey.encoded.toByteString().sha256()
    
        /**
         * Returns the SHA-256 of `certificate`'s public key.
         *
         * In OkHttp 3.1.2 and earlier, this returned a SHA-1 hash of the public key. Both types are
         * supported, but SHA-256 is preferred.
         */
        @JvmStatic
        fun pin(certificate: Certificate): String {
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 14.2K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/graph/ValueGraphTest.java

                    public @Nullable Void call() throws Exception {
                      barrier.await();
                      Integer first = graph.nodes().iterator().next();
                      for (Integer node : graph.nodes()) {
                        Set<Integer> unused = graph.successors(node);
                      }
                      /*
                       * Also look up an earlier node so that, if the graph is using MapRetrievalCache,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 17.4K bytes
    - Viewed (0)
  8. guava/src/com/google/common/base/FinalizableReferenceQueue.java

     * {@link FinalizableReference#finalizeReferent()} on them.
     *
     * <p>Keep a strong reference to this object until all of the associated referents have been
     * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code
     * finalizeReferent()} on the remaining references.
     *
     * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Jul 11 20:51:36 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  9. guava/src/com/google/common/reflect/Types.java

       * so that we get partial compile-time checking.)
       *
       * <p>This workaround should be removed at a distant future time when we no longer support Java
       * versions earlier than 8.
       */
      @SuppressWarnings("removal") // b/318391980
      private static final class TypeVariableInvocationHandler implements InvocationHandler {
        private static final ImmutableMap<String, Method> typeVariableMethods;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 23K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/graph/ValueGraphTest.java

                    public @Nullable Void call() throws Exception {
                      barrier.await();
                      Integer first = graph.nodes().iterator().next();
                      for (Integer node : graph.nodes()) {
                        Set<Integer> unused = graph.successors(node);
                      }
                      /*
                       * Also look up an earlier node so that, if the graph is using MapRetrievalCache,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 06 18:35:19 UTC 2024
    - 20K bytes
    - Viewed (0)
Back to top