Search Options

Results per page
Sort
Preferred Languages
Advance

Results 351 - 360 of 535 for Store (0.03 sec)

  1. cmd/bucket-lifecycle.go

    func newExpiryState(ctx context.Context, objAPI ObjectLayer, n int) *expiryState {
    	es := &expiryState{
    		ctx:    ctx,
    		objAPI: objAPI,
    	}
    	workers := make([]chan expiryOp, 0, n)
    	es.workers.Store(&workers)
    	es.ResizeWorkers(n)
    	return es
    }
    
    func (es *expiryState) getWorkerCh(h uint64) chan<- expiryOp {
    	w := es.workers.Load()
    	if w == nil || len(*w) == 0 {
    		return nil
    	}
    	workers := *w
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 23 15:35:37 UTC 2024
    - 33.7K bytes
    - Viewed (0)
  2. src/main/java/jcifs/smb1/smb1/ServerMessageBlock.java

         * We will still use the readXxxWireFormat return values to
         * indicate how many bytes(note: readParameterWordsWireFormat
         * returns bytes read and not the number of words(but the
         * wordCount member DOES store the number of words)) we
         * actually read. Incedentally this is important to the
         * AndXServerMessageBlock class that needs to potentially
         * read in another smb's parameter words and bytes based on
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 21K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/ImmutableCollection.java

        static final int DEFAULT_INITIAL_CAPACITY = 4;
    
        static int expandedCapacity(int oldCapacity, int minCapacity) {
          if (minCapacity < 0) {
            throw new IllegalArgumentException("cannot store more than MAX_VALUE elements");
          } else if (minCapacity <= oldCapacity) {
            return oldCapacity;
          }
          // careful of overflow!
          int newCapacity = oldCapacity + (oldCapacity >> 1) + 1;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 12 16:59:15 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/BigIntegerMath.java

          long normalizedNum = num >> tz;
          shift += tz;
          // Adjust floor(log2(num)) + 1.
          int normalizedBits = bits - tz;
          // If it won't fit in a long, then we store off the intermediate product.
          if (normalizedBits + productBits >= Long.SIZE) {
            bignums.add(BigInteger.valueOf(product));
            product = 1;
            productBits = 0;
          }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  5. internal/grid/muxclient.go

    }
    
    func (m *muxClient) addErrorNonBlockingClose(respHandler chan<- Response, err error) {
    	m.respMu.Lock()
    	defer m.respMu.Unlock()
    	if !m.closed {
    		m.respErr.Store(&err)
    		// Do not block.
    		select {
    		case respHandler <- Response{Err: err}:
    			xioutil.SafeClose(respHandler)
    		default:
    			go func() {
    				respHandler <- Response{Err: err}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jun 07 15:51:52 UTC 2024
    - 15.9K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb1/http/NetworkExplorer.java

            if(( level = Config.getInt( "jcifs.smb1.util.loglevel", -1 )) != -1 ) {
                LogStream.setLevel( level );
            }
            if( log.level > 2 ) {
                try {
                    Config.store( log, "JCIFS PROPERTIES" );
                } catch( IOException ioe ) {
                }
            }
        }
    
        protected void doFile( HttpServletRequest req,
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Wed Jan 22 03:57:31 UTC 2020
    - 19.7K bytes
    - Viewed (0)
  7. docs/bucket/replication/DESIGN.md

    runs at a one minute frequency, each time scanning upto a sixteenth of the namespace. Object versions marked `PENDING` or `FAILED` are re-queued for replication.
    
    Replication speed depends on the cluster load, number of objects in the object store as well as storage speed. In addition, any bandwidth limits set via `mc admin bucket remote add` could also contribute to replication speed. The number of workers used for replication defaults to 100. Based on network bandwidth and system load, the...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 14.7K bytes
    - Viewed (0)
  8. src/main/webapp/css/font-awesome.min.css

    t:before{content:"\f105"}.fa-angle-up:before{content:"\f106"}.fa-angry:before{content:"\f556"}.fa-angrycreative:before{content:"\f36e"}.fa-angular:before{content:"\f420"}.fa-ankh:before{content:"\f644"}.fa-app-store:before{content:"\f36f"}.fa-app-store-ios:before{content:"\f370"}.fa-apper:before{content:"\f371"}.fa-apple:before{content:"\f179"}.fa-apple-alt:before{content:"\f5d1"}.fa-apple-pay:before{content:"\f415"}.fa-archive:before{content:"\f187"}.fa-archway:before{content:"\f557"}.fa-arrow-...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (1)
  9. android/guava/src/com/google/common/collect/Tables.java

       * by {@code factory}. Those objects should not be manually updated and they should not use soft,
       * weak, or phantom references.
       *
       * @param backingMap place to store the mapping from each row key to its corresponding column key
       *     / value map
       * @param factory supplier of new, empty maps that will each hold all column key / value mappings
       *     for a given row key
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 21:21:17 UTC 2024
    - 26.3K bytes
    - Viewed (0)
  10. src/builtin/builtin.go

    // 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
    // result of append, often in the variable holding the slice itself:
    //
    //	slice = append(slice, elem1, elem2)
    //	slice = append(slice, anotherSlice...)
    //
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 12.7K bytes
    - Viewed (0)
Back to top