Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 1,271 for Range (0.05 sec)

  1. guava/src/com/google/common/collect/GeneralRange.java

      /** Converts a Range to a GeneralRange. */
      @SuppressWarnings("rawtypes") // https://github.com/google/guava/issues/989
      static <T extends Comparable> GeneralRange<T> from(Range<T> range) {
        T lowerEndpoint = range.hasLowerBound() ? range.lowerEndpoint() : null;
        BoundType lowerBoundType = range.hasLowerBound() ? range.lowerBoundType() : OPEN;
    
        T upperEndpoint = range.hasUpperBound() ? range.upperEndpoint() : null;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.8K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/ContiguousSet.java

       * Range#contains contained} by the range.
       *
       * @throws IllegalArgumentException if neither range nor the domain has a lower bound, or if
       *     neither has an upper bound
       * @since 13.0
       */
      public static <C extends Comparable> ContiguousSet<C> create(
          Range<C> range, DiscreteDomain<C> domain) {
        checkNotNull(range);
        checkNotNull(domain);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Nov 30 21:54:06 UTC 2023
    - 9.9K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/collect/SetsTest.java

        assertEquals(ImmutableSortedSet.of(4), Sets.subSet(set, Range.open(2, 6)));
        assertEquals(ImmutableSortedSet.of(4, 6), Sets.subSet(set, Range.open(3, 7)));
        assertEquals(empty, Sets.subSet(set, Range.open(20, 30)));
    
        assertEquals(set, Sets.subSet(set, Range.openClosed(0, 12)));
        assertEquals(ImmutableSortedSet.of(2, 4), Sets.subSet(set, Range.openClosed(0, 4)));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 48.6K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/escape/ArrayBasedCharEscaper.java

      private final int replacementsLength;
      // The first character in the safe range.
      private final char safeMin;
      // The last character in the safe range.
      private final char safeMax;
    
      /**
       * Creates a new ArrayBasedCharEscaper instance with the given replacement map and specified safe
       * range. If {@code safeMax < safeMin} then no characters are considered safe.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jan 18 20:55:09 UTC 2022
    - 6.3K bytes
    - Viewed (0)
  5. istioctl/pkg/describe/describe.go

    	svcHost := extendFQDN(fmt.Sprintf("%s.%s", svc.ObjectMeta.Name, svc.ObjectMeta.Namespace))
    	for _, dest := range route.Route {
    		fqdn := string(model.ResolveShortnameToFQDN(dest.Destination.Host, config.Meta{Namespace: vs.Namespace}))
    		if extendFQDN(fqdn) == svcHost {
    			match = true
    		}
    	}
    
    	if match {
    		for _, trafficMatch := range route.Match {
    			facts = append(facts, trafficMatch.String())
    		}
    	}
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Oct 24 17:36:49 UTC 2024
    - 50.6K bytes
    - Viewed (0)
  6. cmd/notification.go

    	ng := WithNPeers(len(sys.peerClients))
    	for idx, client := range sys.peerClients {
    		if client == nil {
    			continue
    		}
    		client := client
    		ng.Go(ctx, func() error {
    			return client.LoadBucketMetadata(ctx, bucketName)
    		}, idx, *client.host)
    	}
    	for _, nErr := range ng.Wait() {
    		reqInfo := (&logger.ReqInfo{}).AppendTags("peerAddress", nErr.Host.String())
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 09 16:58:30 UTC 2024
    - 46.2K bytes
    - Viewed (0)
  7. istioctl/pkg/writer/envoy/configdump/listener.go

    			for _, rm := range ip.GetRangeMatchers() {
    				for _, r := range rm.Ranges {
    					cidr := r.AddressPrefix
    					pl := r.PrefixLen.GetValue()
    					if pl != 32 && pl != 128 {
    						cidr += fmt.Sprintf("/%d", pl)
    					}
    					m[cidr] = rm.OnMatch
    				}
    			}
    		default:
    			panic("unhandled")
    		}
    	}
    	outputs := []string{}
    	for k, v := range m {
    		switch v := v.GetOnMatch().(type) {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Wed Nov 29 12:37:14 UTC 2023
    - 18.1K bytes
    - Viewed (0)
  8. cmd/tier-last-day-stats_gen.go

    	o = msgp.Require(b, z.Msgsize())
    	o = msgp.AppendMapHeader(o, uint32(len(z)))
    	for zb0007, zb0008 := range z {
    		o = msgp.AppendString(o, zb0007)
    		// map header, size 2
    		// string "Bins"
    		o = append(o, 0x82, 0xa4, 0x42, 0x69, 0x6e, 0x73)
    		o = msgp.AppendArrayHeader(o, uint32(24))
    		for zb0009 := range zb0008.Bins {
    			o, err = zb0008.Bins[zb0009].MarshalMsg(o)
    			if err != nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Mar 21 17:21:35 UTC 2024
    - 9.3K bytes
    - Viewed (0)
  9. src/cmd/asm/internal/asm/testdata/riscv64error.s

    	RORIW	$32, X5, X6			// ERROR "immediate out of range 0 to 31"
    	SLLIW	$32, X5, X6			// ERROR "immediate out of range 0 to 31"
    	SRLIW	$32, X5, X6			// ERROR "immediate out of range 0 to 31"
    	SRAIW	$32, X5, X6			// ERROR "immediate out of range 0 to 31"
    	RORIW	$-1, X5, X6			// ERROR "immediate out of range 0 to 31"
    	SLLIW	$-1, X5, X6			// ERROR "immediate out of range 0 to 31"
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Sun Apr 07 03:32:27 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  10. callbacks/associations.go

    			// Save Belongs To associations
    			for _, rel := range db.Statement.Schema.Relationships.BelongsTo {
    				if v, ok := selectColumns[rel.Name]; (ok && !v) || (!ok && restricted) {
    					continue
    				}
    
    				setupReferences := func(obj reflect.Value, elem reflect.Value) {
    					for _, ref := range rel.References {
    						if !ref.OwnPrimaryKey {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Tue Apr 11 03:06:13 UTC 2023
    - 14.3K bytes
    - Viewed (0)
Back to top