Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 534 for Reed (0.14 sec)

  1. CONTRIBUTING.md

      * If you are an individual writing original source code and you're sure you own the intellectual property, then you'll need to sign an [individual CLA](https://code.google.com/legal/individual-cla-v1.0.html).
      * If you work for a company that wants to allow you to contribute your work, then you'll need to sign a [corporate CLA](https://code.google.com/legal/corporate-cla-v1.0.html).
    
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Thu Mar 21 11:45:51 GMT 2024
    - 15.6K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

     * any particular order. If you need ordered traversal, consider using {@code
     * Arrays.sort(pq.toArray())}. Also, method {@code drainTo} can be used to remove some or
     * all elements in priority order and place them in another collection.
     *
     * <p>Operations on this class make no guarantees about the ordering of elements with equal
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Apr 19 19:24:36 GMT 2023
    - 19.5K bytes
    - Viewed (0)
  3. cmd/admin-handlers-idp-config.go

    		return
    	}
    
    	if err = validateConfig(ctx, cfg, subSys); err != nil {
    
    		var validationErr ldap.Validation
    		if errors.As(err, &validationErr) {
    			// If we got an LDAP validation error, we need to send appropriate
    			// error message back to client (likely mc).
    			writeCustomErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrAdminConfigLDAPValidation),
    				validationErr.FormatError(), r.URL)
    			return
    		}
    
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 12.7K bytes
    - Viewed (0)
  4. docs/en/docs/deployment/concepts.md

    I'll tell you a bit more about these **concepts** here, and that would hopefully give you the **intuition** you would need to decide how to deploy your API in very different environments, possibly even in **future** ones that don't exist yet.
    
    By considering these concepts, you will be able to **evaluate and design** the best way to deploy **your own APIs**.
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu May 02 22:37:31 GMT 2024
    - 18K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/sql-databases.md

        But in FastAPI, using normal functions (`def`) more than one thread could interact with the database for the same request, so we need to make SQLite know that it should allow that with `connect_args={"check_same_thread": False}`.
    
        Also, we will make sure each request gets its own database connection session in a dependency, so there's no need for that default mechanism.
    
    ### Create a `SessionLocal` class
    
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu Apr 18 19:53:19 GMT 2024
    - 29.6K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/Ordering.java

          return "Ordering.arbitrary()";
        }
    
        /*
         * We need to be able to mock identityHashCode() calls for tests, because it
         * can take 1-10 seconds to find colliding objects. Mocking frameworks that
         * can do magic to mock static method calls still can't do so for a system
         * class, so we need the indirection. In production, Hotspot should still
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Apr 24 19:38:27 GMT 2024
    - 39.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/CompactHashMap.java

          entries[dstIndex] = entries[srcIndex];
          entries[srcIndex] = 0;
    
          // also need to update whoever's "next" pointer was pointing to the last entry place
          int tableIndex = smearedHash(key) & mask;
          int next = CompactHashing.tableGet(table, tableIndex);
          int srcNext = srcIndex + 1;
          if (next == srcNext) {
            // we need to update the root pointer
            CompactHashing.tableSet(table, tableIndex, dstIndex + 1);
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Jun 26 21:02:13 GMT 2023
    - 35.8K bytes
    - Viewed (0)
  8. maven-compat/src/test/java/org/apache/maven/AbstractCoreMavenComponentTestCase.java

            }
    
            return request;
        }
    
        // layer the creation of a project builder configuration with a request, but this will need to be
        // a Maven subclass because we don't want to couple maven to the project builder which we need to
        // separate.
        protected MavenSession createMavenSession(File pom) throws Exception {
            return createMavenSession(pom, new Properties());
        }
    
    Java
    - Registered: Sun May 05 03:35:11 GMT 2024
    - Last Modified: Thu May 02 15:10:38 GMT 2024
    - 11.7K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/CompactHashSet.java

          entries[srcIndex] = 0;
    
          // also need to update whoever's "next" pointer was pointing to the last entry place
          int tableIndex = smearedHash(object) & mask;
          int next = CompactHashing.tableGet(table, tableIndex);
          int srcNext = srcIndex + 1;
          if (next == srcNext) {
            // we need to update the root pointer
            CompactHashing.tableSet(table, tableIndex, dstIndex + 1);
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Mon Feb 05 21:38:59 GMT 2024
    - 24.9K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/hash/HashTestUtils.java

      }
    
      interface HashFn {
        byte[] hash(byte[] input, int seed);
      }
    
      static void verifyHashFunction(HashFn hashFunction, int hashbits, int expected) {
        int hashBytes = hashbits / 8;
    
        byte[] key = new byte[256];
        byte[] hashes = new byte[hashBytes * 256];
    
        // Hash keys of the form {}, {0}, {0,1}, {0,1,2}... up to N=255,using 256-N as the seed
        for (int i = 0; i < 256; i++) {
          key[i] = (byte) i;
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Mon Oct 10 19:45:10 GMT 2022
    - 25.3K bytes
    - Viewed (0)
Back to top