Search Options

Results per page
Sort
Preferred Languages
Advance

Results 171 - 180 of 835 for needed (0.03 sec)

  1. src/test/java/jcifs/smb1/util/HMACT64Test.java

            MessageDigest md5 = MessageDigest.getInstance("MD5");
            byte[] ipad = new byte[64];
            byte[] opad = new byte[64];
    
            // HMACT64 specific: truncate key to 64 bytes if needed
            int keyLen = Math.min(key.length, 64);
            for (int i = 0; i < keyLen; i++) {
                ipad[i] = (byte) (key[i] ^ 0x36);
                opad[i] = (byte) (key[i] ^ 0x5c);
            }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 10.1K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/DiscreteDomain.java

       *     minValue()}
       */
      public abstract @Nullable C previous(C value);
    
      /**
       * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
       * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
       * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 17:34:21 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  3. cmd/iam.go

    	}
    
    	sys.printIAMRoles()
    	sys.Unlock()
    
    	retryCtx, cancel := context.WithCancel(ctx)
    
    	// Indicate to our routine to exit cleanly upon return.
    	defer cancel()
    
    	// Migrate storage format if needed.
    	for {
    		// Migrate IAM configuration, if necessary.
    		if err := saveIAMFormat(retryCtx, sys.store); err != nil {
    			if configRetriableErrors(err) {
    				retryInterval := time.Duration(r.Float64() * float64(time.Second))
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 75.3K bytes
    - Viewed (0)
  4. docs/en/docs/help-fastapi.md

    * Also don't worry about style rules, there are already automatized tools checking that.
    
    And if there's any other style or consistency need, I'll ask directly for that, or I'll add commits on top with the needed changes.
    
    ### Check the code { #check-the-code }
    
    * Check and read the code, see if it makes sense, **run it locally** and see if it actually solves the problem.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 14K bytes
    - Viewed (0)
  5. cmd/streaming-signature-v4.go

    // out of HTTP "chunked" format before returning it.
    // The s3ChunkedReader returns io.EOF when the final 0-length chunk is read.
    //
    // NewChunkedReader is not needed by normal applications. The http package
    // automatically decodes chunking when reading response bodies.
    func newSignV4ChunkedReader(req *http.Request, trailer bool) (io.ReadCloser, APIErrorCode) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 18.2K bytes
    - Viewed (0)
  6. src/test/java/org/codelibs/fess/query/BooleanQueryCommandTest.java

        private BooleanQueryCommand booleanQueryCommand;
    
        @Override
        protected void setUpChild() throws Exception {
            // Register other query commands that might be needed
            new TermQueryCommand().register();
            new MatchAllQueryCommand().register();
    
            // Initialize and register BooleanQueryCommand
            booleanQueryCommand = new BooleanQueryCommand();
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 14.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/DiscreteDomain.java

       *     minValue()}
       */
      public abstract @Nullable C previous(C value);
    
      /**
       * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
       * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
       * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 17:34:21 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  8. docs/en/docs/tutorial/extra-models.md

    This is useful if you don't know the valid field/attribute names (that would be needed for a Pydantic model) beforehand.
    
    In this case, you can use `typing.Dict` (or just `dict` in Python 3.9 and above):
    
    {* ../../docs_src/extra_models/tutorial005_py39.py hl[6] *}
    
    
    ## Recap { #recap }
    
    Use multiple Pydantic models and inherit freely for each case.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 7.2K bytes
    - Viewed (0)
  9. api/maven-api-core/src/main/java/org/apache/maven/api/services/ProjectBuilderRequest.java

         */
        boolean isAllowStubModel();
    
        /**
         * Determines whether the project builder should recursively build parent/child projects.
         * When true, the builder will process parent POMs and child modules as needed.
         *
         * @return true if the build should be recursive, false otherwise
         */
        boolean isRecursive();
    
        /**
         * Determines whether plugins should be processed during project building.
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Thu Apr 03 13:33:59 UTC 2025
    - 11.7K bytes
    - Viewed (0)
  10. cmd/erasure-decode.go

    	// If we cannot decode, just return read quorum error.
    	return nil, fmt.Errorf("%w (offline-disks=%d/%d)", errErasureReadQuorum, disksNotFound, len(p.readers))
    }
    
    // Decode reads from readers, reconstructs data if needed and writes the data to the writer.
    // A set of preferred drives can be supplied. In that case they will be used and the data reconstructed.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 9.5K bytes
    - Viewed (0)
Back to top