Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for leas (0.02 sec)

  1. android/pom.xml

            </plugin>
            <plugin>
              <artifactId>maven-jar-plugin</artifactId>
              <version>3.4.2</version>
              <configuration>
                <!-- Warning: Guava (at least the main module) uses maven-bundle-plugin, not maven-jar-plugin, so the configuration does not apply to it. That configuration may or may not apply to guava-testlib or other modules. -->
                <excludes>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Sep 04 21:35:58 UTC 2025
    - 24.3K bytes
    - Viewed (0)
  2. pom.xml

            </plugin>
            <plugin>
              <artifactId>maven-jar-plugin</artifactId>
              <version>3.4.2</version>
              <configuration>
                <!-- Warning: Guava (at least the main module) uses maven-bundle-plugin, not maven-jar-plugin, so the configuration does not apply to it. That configuration may or may not apply to guava-testlib or other modules. -->
                <excludes>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Sep 04 21:35:58 UTC 2025
    - 23.9K bytes
    - Viewed (0)
  3. cmd/erasure-multipart.go

    	if !opts.NoAuditLog {
    		auditObjectErasureSet(ctx, "PutObjectPart", object, &er)
    	}
    
    	data := r.Reader
    	// Validate input data size and it can never be less than zero.
    	if data.Size() < -1 {
    		bugLogIf(ctx, errInvalidArgument, logger.ErrorKind)
    		return pi, toObjectErr(errInvalidArgument)
    	}
    
    	uploadIDPath := er.getUploadIDDir(bucket, object, uploadID)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Sep 07 16:13:09 UTC 2025
    - 47.3K bytes
    - Viewed (0)
  4. src/bytes/bytes.go

    				return i + j - last
    			}
    		} else {
    			// If bytealg.Index is not available a brute force search is
    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    						if s[i-k] != b[last-k] {
    							continue loop
    						}
    					}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  5. cmd/erasure-object.go

    			metaArr[index].ModTime = modTime
    			metaArr[index].VersionID = versionID
    			if !metaArr[index].InlineData() {
    				// If the data is not inlined, we may end up incorrectly
    				// inlining the data here, that leads to an inconsistent
    				// situation where some objects are were not inlined
    				// were now inlined, make sure to `nil` the Data such
    				// that xl.meta is written as expected.
    				metaArr[index].Data = nil
    			}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Sep 07 16:13:09 UTC 2025
    - 80.4K bytes
    - Viewed (0)
  6. cmd/object-handlers.go

    			Bucket:    objInfo.Bucket,
    			Object:    objInfo.Name,
    			VersionID: objInfo.VersionID,
    			Status:    http.StatusText(http.StatusOK),
    		})
    	}
    
    	// Do not send checksums in events to avoid leaks.
    	hash.TransferChecksumHeader(w, r)
    	writeSuccessResponseHeadersOnly(w)
    
    	// Remove the transitioned object whose object version is being overwritten.
    	if !globalTierConfigMgr.Empty() {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Sep 07 16:13:09 UTC 2025
    - 120.6K bytes
    - Viewed (0)
  7. docs/en/docs/release-notes.md

        * This was reported internally by [@rushilsrivastava](https://github.com/rushilsrivastava) as a memory leak when the server had unhandled exceptions that would produce internal server errors, the memory allocated before that point would not be released.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 12:48:45 UTC 2025
    - 544.1K bytes
    - Viewed (0)
Back to top