Search Options

Results per page
Sort
Preferred Languages
Advance

Results 211 - 220 of 1,008 for mane (0.02 sec)

  1. cmd/xl-storage-format-v2_gen.go

    			}
    		case "MetaSys":
    			var zb0002 uint32
    			zb0002, err = dc.ReadMapHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "MetaSys")
    				return
    			}
    			if z.MetaSys == nil {
    				z.MetaSys = make(map[string][]byte, zb0002)
    			} else if len(z.MetaSys) > 0 {
    				for key := range z.MetaSys {
    					delete(z.MetaSys, key)
    				}
    			}
    			for zb0002 > 0 {
    				zb0002--
    				var za0002 string
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Dec 15 22:50:12 UTC 2024
    - 56K bytes
    - Viewed (0)
  2. guava-testlib/src/com/google/common/collect/testing/testers/NavigableSetNavigationTester.java

       */
      /*
       * TODO(cpovirk): or we could make HOLES_FORBIDDEN a feature. Or we could declare that
       * implementations are permitted to throw IAE if a hole is requested, and we could update
       * test*Hole to permit IAE. (But might this ignore genuine bugs?) But see the TODO above
       * testLower, which could make this all unnecessary
       */
      public static Method[] getHoleMethods() {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Nov 14 23:40:07 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  3. docs/en/docs/tutorial/request-forms.md

    When you need to receive form fields instead of JSON, you can use `Form`.
    
    /// info
    
    To use forms, first install <a href="https://github.com/Kludex/python-multipart" class="external-link" target="_blank">`python-multipart`</a>.
    
    Make sure you create a [virtual environment](../virtual-environments.md){.internal-link target=_blank}, activate it, and then install it, for example:
    
    ```console
    $ pip install python-multipart
    ```
    
    ///
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 2.7K bytes
    - Viewed (0)
  4. cmd/erasure-server-pool-decom.go

    	}
    
    	// However many we ask, versions must exist on ~50%
    	listingQuorum := (set.setDriveCount + 1) / 2
    
    	// How to resolve partial results.
    	resolver := metadataResolutionParams{
    		dirQuorum: listingQuorum, // make sure to capture all quorum ratios
    		objQuorum: listingQuorum, // make sure to capture all quorum ratios
    		bucket:    bi.Name,
    	}
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 42.1K bytes
    - Viewed (1)
  5. guava/src/com/google/common/hash/AbstractStreamingHasher.java

       * even to an intermediate buffer) should be considerably more efficient than potentially
       * copying the CharSequence to a String and then calling getBytes(Charset) on that String, in
       * reality there are optimizations that make the getBytes(Charset) approach considerably faster,
       * at least for commonly used charsets like UTF-8.
       */
    
      @Override
      @CanIgnoreReturnValue
      public final Hasher putByte(byte b) {
        buffer.put(b);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  6. cmd/event-notification.go

    	// targetList/bucketRulesMap/bucketRemoteTargetRulesMap are populated by NotificationSys.InitBucketTargets()
    	return &EventNotifier{
    		targetList:     event.NewTargetList(ctx),
    		bucketRulesMap: make(map[string]event.RulesMap),
    	}
    }
    
    // GetARNList - returns available ARNs.
    func (evnot *EventNotifier) GetARNList() []string {
    	arns := []string{}
    	if evnot == nil {
    		return arns
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Jun 21 22:22:24 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/util/concurrent/AbstractFutureState.java

         */
        Waiter(boolean unused) {}
    
        Waiter() {
          // avoid volatile write, write is made visible by subsequent CAS on waitersField field
          putThread(this, Thread.currentThread());
        }
    
        // non-volatile write to the next field. Should be made visible by a subsequent CAS on
        // waitersField.
        void setNext(@Nullable Waiter next) {
          putNext(this, next);
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 34.8K bytes
    - Viewed (0)
  8. docs/bucket/replication/test_del_marker_proxying.sh

    	echo -n "Cleaning up instances of MinIO ..."
    	pkill -9 minio || sudo pkill -9 minio
    	rm -rf /tmp/sitea
    	rm -rf /tmp/siteb
    	echo "done"
    }
    
    cleanup
    
    export MINIO_CI_CD=1
    export MINIO_BROWSER=off
    
    make install-race
    
    # Start MinIO instances
    echo -n "Starting MinIO instances ..."
    minio server --address 127.0.0.1:9001 --console-address ":10000" "http://127.0.0.1:9001/tmp/sitea/data/disterasure/xl{1...4}" \
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Sep 29 22:40:36 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/ImmutableBiMap.java

        }
    
        /**
         * Throws {@link UnsupportedOperationException}. This method is inherited from {@link
         * ImmutableMap.Builder}, but it does not make sense for bimaps.
         *
         * @throws UnsupportedOperationException always
         * @deprecated This method does not make sense for bimaps and should not be called.
         * @since 31.1
         */
        @DoNotCall
        @Deprecated
        @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 22.2K bytes
    - Viewed (0)
  10. docs/debugging/hash-set/main.go

    // in the slices returned.
    func hashOrder(key string, cardinality int) []int {
    	if cardinality <= 0 {
    		// Returns an empty int slice for cardinality < 0.
    		return nil
    	}
    
    	nums := make([]int, cardinality)
    	keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable)
    
    	start := int(keyCrc % uint32(cardinality))
    	for i := 1; i <= cardinality; i++ {
    		nums[i-1] = 1 + ((start + i) % cardinality)
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.7K bytes
    - Viewed (0)
Back to top