Search Options

Results per page
Sort
Preferred Languages
Advance

Results 321 - 330 of 403 for SUB (0.04 sec)

  1. api/go1.12.txt

    pkg math/bits, func Mul(uint, uint) (uint, uint)
    pkg math/bits, func Mul32(uint32, uint32) (uint32, uint32)
    pkg math/bits, func Mul64(uint64, uint64) (uint64, uint64)
    pkg math/bits, func Sub(uint, uint, uint) (uint, uint)
    pkg math/bits, func Sub32(uint32, uint32, uint32) (uint32, uint32)
    pkg math/bits, func Sub64(uint64, uint64, uint64) (uint64, uint64)
    pkg net/http, const StatusTooEarly = 425
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Jan 02 21:21:53 UTC 2019
    - 13.5K bytes
    - Viewed (0)
  2. cmd/batch-handlers.go

    	if ri == nil {
    		return errInvalidArgument
    	}
    	now := UTCNow()
    	ri.mu.Lock()
    	var (
    		format, version uint16
    		jobTyp          string
    	)
    
    	if now.Sub(ri.LastUpdate) >= duration {
    		switch job.Type() {
    		case madmin.BatchJobReplicate:
    			format = batchReplFormat
    			version = batchReplVersion
    			jobTyp = string(job.Type())
    			ri.Version = batchReplVersionV1
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 18 15:32:09 UTC 2024
    - 62.2K bytes
    - Viewed (0)
  3. cmd/metrics-resource.go

    func updateDriveIOStats(currentStats madmin.DiskIOStats, latestStats madmin.DiskIOStats, labels map[string]string) {
    	sectorSize := uint64(512)
    	kib := float64(1 << 10)
    	diffInSeconds := time.Now().UTC().Sub(lastDriveStatsRefresh).Seconds()
    	if diffInSeconds == 0 {
    		// too soon to update the stats
    		return
    	}
    	diffStats := getDiffStats(latestStats, currentStats)
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 24 23:30:33 UTC 2024
    - 17.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/ImmutableList.java

       * strong reference to {@code this}, which may prevent the original list from being garbage
       * collected. If you want the original list to be eligible for garbage collection, you should
       * create and use a copy of the sub list (e.g., {@code
       * ImmutableList.copyOf(originalList.subList(...))}).
       */
      @Override
      public ImmutableList<E> subList(int fromIndex, int toIndex) {
        checkPositionIndexes(fromIndex, toIndex, size());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 21:21:17 UTC 2024
    - 27.7K bytes
    - Viewed (0)
  5. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/ComparableVersion.java

                return stringPart.toString() + digitPart.toString();
            }
        }
    
        /**
         * Represents a version list item. This class is used both for the global item list and for sub-lists (which start
         * with '-(number)' in the version specification).
         */
        private static class ListItem extends ArrayList<Item> implements Item {
            @Override
            public int getType() {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 26K bytes
    - Viewed (0)
  6. guava/src/com/google/common/primitives/Bytes.java

       * i, i + target.length)} contains exactly the same elements as {@code target}.
       *
       * @param array the array to search for the sequence {@code target}
       * @param target the array to search for as a sub-sequence of {@code array}
       */
      public static int indexOf(byte[] array, byte[] target) {
        checkNotNull(array, "array");
        checkNotNull(target, "target");
        if (target.length == 0) {
          return 0;
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Aug 27 16:47:48 UTC 2024
    - 15.3K bytes
    - Viewed (0)
  7. cmd/erasure-server-pool-decom.go

    	if p.Pools[idx].Decommission == nil {
    		return false, errInvalidArgument
    	}
    	now := UTCNow()
    	if now.Sub(p.Pools[idx].LastUpdate) >= duration {
    		if serverDebugLog {
    			console.Debugf("decommission: persisting poolMeta on drive: threshold:%s, poolMeta:%#v\n", now.Sub(p.Pools[idx].LastUpdate), p.Pools[idx])
    		}
    		p.Pools[idx].LastUpdate = now
    		if err := p.save(ctx, pools); err != nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 06 13:20:19 UTC 2024
    - 42.2K bytes
    - Viewed (0)
  8. cmd/batch-expire.go

    		return false
    	}
    
    	if len(ef.Name) > 0 && !wildcard.Match(ef.Name, obj.Name) {
    		return false
    	}
    	if ef.OlderThan > 0 && now.Sub(obj.ModTime) <= ef.OlderThan.D() {
    		return false
    	}
    
    	if ef.CreatedBefore != nil && !obj.ModTime.Before(*ef.CreatedBefore) {
    		return false
    	}
    
    	if len(ef.Tags) > 0 && !obj.DeleteMarker {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Sep 18 17:59:03 UTC 2024
    - 21.9K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/primitives/Ints.java

       * i, i + target.length)} contains exactly the same elements as {@code target}.
       *
       * @param array the array to search for the sequence {@code target}
       * @param target the array to search for as a sub-sequence of {@code array}
       */
      public static int indexOf(int[] array, int[] target) {
        checkNotNull(array, "array");
        checkNotNull(target, "target");
        if (target.length == 0) {
          return 0;
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 31K bytes
    - Viewed (0)
  10. docs/en/docs/release-notes.md

    ## 0.4.0
    
    * Add `openapi_prefix`, support for reverse proxy and mounting sub-applications. See the docs at [https://fastapi.tiangolo.com/advanced/sub-applications-proxy/](https://fastapi.tiangolo.com/advanced/sub-applications-proxy/): [#26](https://github.com/tiangolo/fastapi/pull/26) by [@kabirkhan](https://github.com/kabirkhan).
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Fri Nov 01 11:25:57 UTC 2024
    - 460.3K bytes
    - Viewed (0)
Back to top