Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 271 - 280 of 507 for replaced (0.05 seconds)

  1. cmd/handler-api.go

    		}
    	}
    
    	if globalIsDistErasure {
    		logger.Info("Configured max API requests per node based on available memory: %d", apiRequestsMaxPerNode)
    	}
    
    	if cap(t.requestsPool) != apiRequestsMaxPerNode {
    		// Only replace if needed.
    		// Existing requests will use the previous limit,
    		// but new requests will use the new limit.
    		// There will be a short overlap window,
    		// but this shouldn't last long.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  2. cmd/signature-v4-utils.go

    		default:
    			return nil, ErrUnsignedHeaders
    		}
    	}
    	return extractedSignedHeaders, ErrNone
    }
    
    // Trim leading and trailing spaces and replace sequential spaces with one space, following Trimall()
    // in http://docs.aws.amazon.com/general/latest/gr/sigv4-create-canonical-request.html
    func signV4TrimAll(input string) string {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Nov 25 17:10:22 GMT 2024
    - 9.1K bytes
    - Click Count (0)
  3. apache-maven/src/main/appended-resources/licenses/EPL-2.0.txt

    related settlement negotiations. The Indemnified Contributor may
    participate in any such claim at its own expense.
    
    For example, a Contributor might include the Program in a commercial
    product offering, Product X. That Contributor is then a Commercial
    Contributor. If that Commercial Contributor then makes performance
    claims, or offers warranties related to Product X, those performance
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Tue Jun 04 06:45:16 GMT 2024
    - 13.9K bytes
    - Click Count (0)
  4. src/archive/zip/zip_test.go

    	return last.off + last.n
    }
    
    func (r *rleBuffer) Write(p []byte) (n int, err error) {
    	var rp *repeatedByte
    	if len(r.buf) > 0 {
    		rp = &r.buf[len(r.buf)-1]
    		// Fast path, if p is entirely the same byte repeated.
    		if lastByte := rp.b; len(p) > 0 && p[0] == lastByte {
    			if bytes.Count(p, []byte{lastByte}) == len(p) {
    				rp.n += int64(len(p))
    				return len(p), nil
    			}
    		}
    	}
    
    	for _, b := range p {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu May 23 01:00:11 GMT 2024
    - 19.6K bytes
    - Click Count (0)
  5. impl/maven-core/src/test/java/org/apache/maven/configuration/internal/EnhancedCompositeBeanHelperTest.java

        }
    
        @Test
        void testMultipleFieldAccessesDoNotLeakAccessibility() throws Exception {
            // This test verifies that repeated field accesses don't leave fields in an accessible state
            // which was the issue with the old caching implementation
            TestBean bean1 = new TestBean();
            TestBean bean2 = new TestBean();
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Nov 12 14:59:46 GMT 2025
    - 8.7K bytes
    - Click Count (0)
  6. impl/maven-core/src/main/java/org/apache/maven/internal/aether/ReverseTreeRepositoryListener.java

                    return;
                }
                baseName = ArtifactIdUtils.toId(collectStepTrace.getPath().get(0).getArtifact())
                        .replace(":", "_");
                trackingFile = trackingDir.resolve(baseName + ext);
                if (Files.exists(trackingFile)) {
                    return;
                }
    
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jan 29 08:17:07 GMT 2025
    - 10.1K bytes
    - Click Count (0)
  7. src/builtin/builtin.go

    // stand-in for either complex type: complex64 or complex128.
    type ComplexType complex64
    
    // The append built-in function appends elements to the end of a slice. If
    // it has sufficient capacity, the destination is resliced to accommodate the
    // new elements. If it does not, a new underlying array will be allocated.
    // Append returns the updated slice. It is therefore necessary to store the
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Dec 30 23:59:23 GMT 2024
    - 12.8K bytes
    - Click Count (0)
  8. docs/en/docs/how-to/custom-request-and-route.md

    {* ../../docs_src/custom_request_and_route/tutorial001_an_py310.py hl[19:27] *}
    
    /// note | Technical Details
    
    A `Request` has a `request.scope` attribute, that's just a Python `dict` containing the metadata related to the request.
    
    A `Request` also has a `request.receive`, that's a function to "receive" the body of the request.
    
    The `scope` `dict` and `receive` function are both part of the ASGI specification.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 10 08:55:32 GMT 2025
    - 4.6K bytes
    - Click Count (0)
  9. PULL_REQUESTS_ETIQUETTE.md

       - Document testing steps in the PR summary if manual testing was performed.
    
    4. **Before Submitting**:
       - Run `make verify` to check formatting, linting, and tests.
       - Reference related issues (e.g., “Closes #1234”).
       - Notify team members via GitHub `@mentions` if urgent or complex.
    
    ## Reviewing PRs
    
    Reviewers ensure MinIO’s commit history remains a clear, reliable record. Responsibilities include:
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun May 25 16:32:03 GMT 2025
    - 4.7K bytes
    - Click Count (0)
  10. callbacks/query.go

    											for idx, v := range vars {
    												bindvar := strings.Builder{}
    												onStmt.Vars = vars[0 : idx+1]
    												db.Dialector.BindVarTo(&bindvar, &onStmt, v)
    												onSQL = strings.Replace(onSQL, bindvar.String(), "?", 1)
    											}
    
    											exprs = append(exprs, clause.Expr{SQL: onSQL, Vars: vars})
    										}
    									}
    								}
    							}
    
    							return clause.Join{
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun May 25 07:40:40 GMT 2025
    - 10.4K bytes
    - Click Count (3)
Back to Top