Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1151 - 1160 of 1,315 for range (0.07 sec)

  1. src/archive/zip/struct.go

    	// Limits for non zip64 files.
    	uint16max = (1 << 16) - 1
    	uint32max = (1 << 32) - 1
    
    	// Extra header IDs.
    	//
    	// IDs 0..31 are reserved for official use by PKWARE.
    	// IDs above that range are defined by third-party vendors.
    	// Since ZIP lacked high precision timestamps (nor an official specification
    	// of the timezone used for the date fields), many competing extra fields
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue May 28 21:41:09 UTC 2024
    - 12.1K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

    import static org.junit.Assert.assertThrows;
    
    import com.google.common.annotations.GwtIncompatible;
    import com.google.common.annotations.J2ktIncompatible;
    import com.google.common.collect.Iterables;
    import com.google.common.collect.Range;
    import com.google.common.collect.Sets;
    import com.google.common.primitives.Ints;
    import com.google.common.util.concurrent.internal.InternalFutureFailureAccess;
    import java.util.ArrayList;
    import java.util.Arrays;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 22:10:29 UTC 2024
    - 47.1K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/es/config/cbean/ca/bs/BsDataConfigCA.java

    import org.opensearch.search.aggregations.bucket.missing.MissingAggregationBuilder;
    import org.opensearch.search.aggregations.bucket.range.IpRangeAggregationBuilder;
    import org.opensearch.search.aggregations.bucket.range.RangeAggregationBuilder;
    import org.opensearch.search.aggregations.bucket.sampler.SamplerAggregationBuilder;
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 88.1K bytes
    - Viewed (0)
  4. common-protos/k8s.io/api/networking/v1/generated.proto

      // except is a slice of CIDRs that should not be included within an IPBlock
      // Valid examples are "192.168.1.0/24" or "2001:db8::/64"
      // Except values will be rejected if they are outside the cidr range
      // +optional
      repeated string except = 2;
    }
    
    // Ingress is a collection of rules that allow inbound connections to reach the
    // endpoints defined by a backend. An Ingress can be configured to give services
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 25.2K bytes
    - Viewed (0)
  5. tensorflow/c/c_api_experimental.cc

      if (!status->status.ok()) return nullptr;
    
      if (input_index >= op_def->input_arg_size() || input_index < 0) {
        status->status = tensorflow::errors::InvalidArgument(
            input_index, " out of range for ", op_name);
        return nullptr;
      }
    
      const tensorflow::OpDef_ArgDef& input_arg = op_def->input_arg()[input_index];
    
      if (input_arg.number_attr().empty()) {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 16:27:48 UTC 2024
    - 29.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/math/PairedStats.java

       * guaranteed to be exactly +/-1 even when the data are perfectly (anti-)correlated, due to
       * numerical errors. However, it is guaranteed to be in the inclusive range [-1, +1].
       *
       * <h3>Non-finite values</h3>
       *
       * <p>If the dataset contains any non-finite values ({@link Double#POSITIVE_INFINITY}, {@link
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 12.6K bytes
    - Viewed (0)
  7. internal/event/target/elasticsearch.go

    	if err := json.NewDecoder(res.Body).Decode(&v); err != nil {
    		return fmt.Errorf("Error parsing response body: %v", err)
    	}
    
    	indices, ok := v["indices"].([]interface{})
    	if ok {
    		for _, index := range indices {
    			name := index.(map[string]interface{})["name"]
    			if name == args.Index {
    				found = true
    				break
    			}
    		}
    	}
    
    	if !found {
    		resp, err := c.Indices.Create(args.Index)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 06 23:06:30 UTC 2024
    - 15K bytes
    - Viewed (0)
  8. tests/multi_primary_keys_test.go

    	Locale string `gorm:"primary_key"`
    	Value  string
    	Blogs  []*Blog `gorm:"many2many:blog_tags"`
    }
    
    func compareTags(tags []Tag, contents []string) bool {
    	var tagContents []string
    	for _, tag := range tags {
    		tagContents = append(tagContents, tag.Value)
    	}
    	sort.Strings(tagContents)
    	sort.Strings(contents)
    	return reflect.DeepEqual(tagContents, contents)
    }
    
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Jan 06 07:02:53 UTC 2022
    - 12.8K bytes
    - Viewed (0)
  9. internal/s3select/unused-errors.go

    		statusCode: 400,
    		cause:      err,
    	}
    }
    
    func errUnsupportedRangeHeader(err error) *s3Error {
    	return &s3Error{
    		code:       "UnsupportedRangeHeader",
    		message:    "Range header is not supported for this operation.",
    		statusCode: 400,
    		cause:      err,
    	}
    }
    
    func errUnsupportedStorageClass(err error) *s3Error {
    	return &s3Error{
    		code:       "UnsupportedStorageClass",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Feb 20 08:16:35 UTC 2024
    - 17.5K bytes
    - Viewed (0)
  10. src/bufio/bufio.go

    	full, frag, n, err := b.collectFragments(delim)
    	// Allocate new buffer to hold the full pieces and the fragment.
    	buf := make([]byte, n)
    	n = 0
    	// Copy full pieces and fragment in.
    	for i := range full {
    		n += copy(buf[n:], full[i])
    	}
    	copy(buf[n:], frag)
    	return buf, err
    }
    
    // ReadString reads until the first occurrence of delim in the input,
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 12 14:39:08 UTC 2023
    - 21.8K bytes
    - Viewed (0)
Back to top