Search Options

Results per page
Sort
Preferred Languages
Advance

Results 121 - 130 of 166 for allocations (0.11 sec)

  1. docs/bucket/replication/README.md

    On the target bucket, `s3:PutObject` event shows `X-Amz-Replication-Status` status of `REPLICA` in the metadata. Additional metrics to monitor backlog state for the purpose of bandwidth management and resource allocation are exposed via Prometheus - see <https://github.com/minio/minio/blob/master/docs/metrics/prometheus/list.md> for more details.
    
    ### Sync/Async Replication
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jan 24 23:46:33 UTC 2023
    - 18.2K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.2.md

    restarts. More information [here](https://github.com/kubernetes/kubernetes/issues/20995)
      * Pod IP allocation-related issues. Deleting the docker checkpoint prior to
    restarting the daemon alleviates this issue, but hasn’t been verified to
    completely eliminate the IP allocation issue. More information [here](https://github.com/kubernetes/kubernetes/issues/21523#issuecomment-191498969)
    Registered: Fri Nov 01 09:05:11 UTC 2024
    - Last Modified: Fri Dec 04 06:36:19 UTC 2020
    - 41.4K bytes
    - Viewed (0)
  3. cmd/metacache-stream.go

    			case nil:
    				r.err = io.EOF
    				return io.EOF
    			case io.EOF:
    				r.err = io.ErrUnexpectedEOF
    				return io.ErrUnexpectedEOF
    			}
    			r.err = err
    			return err
    		}
    		// Read name without allocating more than 1 buffer.
    		sz, err := r.mr.ReadStringHeader()
    		if err != nil {
    			r.err = err
    			return err
    		}
    		if cap(tmp) < int(sz) {
    			tmp = make([]byte, 0, sz+256)
    		}
    		tmp = tmp[:sz]
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Apr 04 12:04:40 UTC 2024
    - 19.5K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/ImmutableSortedMap.java

              // We might, somehow, be able to reorder values in-place.  But it doesn't seem like
              // there's a way around creating the separate sortedKeys array, and if we're allocating
              // one array of size n, we might as well allocate two -- to say nothing of the allocation
              // done in Arrays.sort.
              for (int i = 0; i < size; i++) {
                // We're careful to put only K instances in.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 53K bytes
    - Viewed (0)
  5. src/main/java/jcifs/Configuration.java

         * @return whether to use strict resource lifecycle
         */
        boolean isStrictResourceLifecycle ();
    
    
        /**
         * This is solely intended for debugging
         * 
         * @return whether to track the locations from which resources were created
         */
        boolean isTraceResourceUsage ();
    
    
        /**
         * @param command
         * @return whether to allow creating compound requests with that command
         */
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Thu Jan 05 13:06:39 UTC 2023
    - 18K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb/SmbResourceLocatorImpl.java

    import jcifs.SmbConstants;
    import jcifs.SmbResourceLocator;
    import jcifs.internal.util.StringUtil;
    import jcifs.netbios.NbtAddress;
    import jcifs.netbios.UniAddress;
    
    
    /**
     * 
     * 
     * This mainly tracks two locations:
     * - canonical URL path: path component of the URL: this is used to reconstruct URLs to resources and is not adjusted by
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sat Jul 20 08:24:53 UTC 2019
    - 23.9K bytes
    - Viewed (0)
  7. src/archive/zip/zip_test.go

    			rp.n++
    		}
    	}
    	return len(p), nil
    }
    
    func memset(a []byte, b byte) {
    	if len(a) == 0 {
    		return
    	}
    	// Double, until we reach power of 2 >= len(a), same as bytes.Repeat,
    	// but without allocation.
    	a[0] = b
    	for i, l := 1, len(a); i < l; i *= 2 {
    		copy(a[i:], a[:i])
    	}
    }
    
    func (r *rleBuffer) ReadAt(p []byte, off int64) (n int, err error) {
    	if len(p) == 0 {
    		return
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 19.6K bytes
    - Viewed (0)
  8. guava/src/com/google/common/base/CharMatcher.java

       *     matching characters in {@code sequence}
       * @return the new string
       */
      public String collapseFrom(CharSequence sequence, char replacement) {
        // This implementation avoids unnecessary allocation.
        int len = sequence.length();
        for (int i = 0; i < len; i++) {
          char c = sequence.charAt(i);
          if (matches(c)) {
            if (c == replacement && (i == len - 1 || !matches(sequence.charAt(i + 1)))) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 13:00:28 UTC 2024
    - 53.9K bytes
    - Viewed (0)
  9. internal/s3select/select.go

    }
    
    func (s3Select *S3Select) marshal(buf *bytes.Buffer, record sql.Record) error {
    	switch s3Select.Output.format {
    	case csvFormat:
    		// Use bufio Writer to prevent csv.Writer from allocating a new buffer.
    		bufioWriter := bufioWriterPool.Get().(*bufio.Writer)
    		defer func() {
    			bufioWriter.Reset(xioutil.Discard)
    			bufioWriterPool.Put(bufioWriter)
    		}()
    
    		bufioWriter.Reset(buf)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Sep 22 00:33:43 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

       * #aboutToAcquire(CycleDetectingLock)} and {@link #lockStateChanged(CycleDetectingLock)}.
       */
      // This is logically a Set, but an ArrayList is used to minimize the amount
      // of allocation done on lock()/unlock().
      private static final ThreadLocal<ArrayList<LockGraphNode>> acquiredLocks =
          new ThreadLocal<ArrayList<LockGraphNode>>() {
            @Override
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Dec 15 19:31:54 UTC 2023
    - 35.9K bytes
    - Viewed (0)
Back to top