Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 821 - 830 of 1,101 for orange (0.12 seconds)

  1. docs/en/docs/tutorial/handling-errors.md

    * etc.
    
    In these cases, you would normally return an **HTTP status code** in the range of **400** (from 400 to 499).
    
    This is similar to the 200 HTTP status codes (from 200 to 299). Those "200" status codes mean that somehow there was a "success" in the request.
    
    The status codes in the 400 range mean that there was an error from the client.
    
    Remember all those **"404 Not Found"** errors (and jokes)?
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 9K bytes
    - Click Count (0)
  2. build-logic/binary-compatibility/src/main/groovy/gradlebuild/binarycompatibility/rules/KotlinModifiersBreakingChangeRule.groovy

                if (infixChanged) {
                    changes.add(modifierChangeDetail("infix", newIsInfix))
                }
                return acceptOrReject(member, changes, Violation.error(member, "Breaking Kotlin modifier change"))
            }
    
            return null
        }
    
        private static String modifierChangeDetail(String modifier, boolean added) {
            return "$modifier modifier was ${added ? "added" : "removed"}"
        }
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Thu Oct 06 19:15:15 GMT 2022
    - 2.4K bytes
    - Click Count (0)
  3. soft_delete.go

    	if _, ok := stmt.Clauses["soft_delete_enabled"]; !ok && !stmt.Statement.Unscoped {
    		if c, ok := stmt.Clauses["WHERE"]; ok {
    			if where, ok := c.Expression.(clause.Where); ok && len(where.Exprs) >= 1 {
    				for _, expr := range where.Exprs {
    					if orCond, ok := expr.(clause.OrConditions); ok && len(orCond.Exprs) == 1 {
    						where.Exprs = []clause.Expression{clause.And(where.Exprs...)}
    						c.Expression = where
    						stmt.Clauses["WHERE"] = c
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Wed Feb 01 06:40:55 GMT 2023
    - 4.5K bytes
    - Click Count (1)
  4. cmd/dynamic-timeouts.go

    // adjust changes the value of the dynamic timeout based on the
    // previous results
    func (dt *dynamicTimeout) adjust(entries [dynamicTimeoutLogSize]time.Duration) {
    	failures, maxDur := 0, time.Duration(0)
    	for _, dur := range entries[:] {
    		if dur == maxDuration {
    			failures++
    		} else if dur > maxDur {
    			maxDur = dur
    		}
    	}
    
    	failPct := float64(failures) / float64(len(entries))
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 4.5K bytes
    - Click Count (0)
  5. internal/jwt/parser_test.go

    	tk, _ := j.SignedString([]byte("HelloSecret"))
    	return tk
    }
    
    func TestParserParse(t *testing.T) {
    	// Iterate over test data set and run tests
    	for _, data := range jwtTestData {
    		t.Run(data.name, func(t *testing.T) {
    			// Parse the token
    			var err error
    
    			// Figure out correct claims type
    			switch claims := data.claims.(type) {
    			case *MapClaims:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 6K bytes
    - Click Count (0)
  6. internal/s3select/simdj/reader_amd64_test.go

    	name  string
    	array bool
    }{
    	{
    		name: "parking-citations-10",
    	},
    }
    
    func TestNDJSON(t *testing.T) {
    	if !simdjson.SupportedCPU() {
    		t.Skip("Unsupported cpu")
    	}
    
    	for _, tt := range testCases {
    		t.Run(tt.name, func(t *testing.T) {
    			ref := loadCompressed(t, tt.name)
    
    			var err error
    			dst := make(chan simdjson.Object, 100)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  7. internal/s3select/sql/stringfuncs.go

    	runeZero   rune = 0
    )
    
    func evalSQLLike(text, pattern string, escape rune) (match bool, err error) {
    	s := []rune{}
    	prev := runeZero
    	hasLeadingPercent := false
    	patLen := len([]rune(pattern))
    	for i, r := range pattern {
    		if i > 0 && prev == escape {
    			switch r {
    			case percent, escape, underscore:
    				s = append(s, r)
    				prev = r
    				if r == escape {
    					prev = runeZero
    				}
    			default:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  8. ci/README.md

    The CI folder contains the configuration files and scripts used to build, test,
    and deploy TensorFlow. This folder is typically used by continuous integration
    (CI) tools to build and test TensorFlow whenever there is a change to the
    code. This folder is broken into subfolders that represent the level of support
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Jun 06 21:00:01 GMT 2023
    - 825 bytes
    - Click Count (0)
  9. internal/kms/stub.go

    func (s StubKMS) ListKeys(ctx context.Context, req *ListRequest) ([]madmin.KMSKeyInfo, string, error) {
    	matches := []madmin.KMSKeyInfo{}
    	if req.Prefix == "" {
    		req.Prefix = "*"
    	}
    	for _, keyName := range s.KeyNames {
    		if wildcard.MatchAsPatternPrefix(req.Prefix, keyName) {
    			matches = append(matches, madmin.KMSKeyInfo{Name: keyName, CreatedAt: StubCreatedAt, CreatedBy: StubCreatedBy})
    		}
    	}
    
    	return matches, "", nil
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Aug 18 06:43:03 GMT 2024
    - 3.6K bytes
    - Click Count (0)
  10. src/archive/zip/reader.go

    		// Return the readDirectoryHeader error if we read
    		// the wrong number of directory entries.
    		return err
    	}
    	if zipinsecurepath.Value() == "0" {
    		for _, f := range r.File {
    			if f.Name == "" {
    				// Zip permits an empty file name field.
    				continue
    			}
    			// The zip specification states that names must use forward slashes,
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Mar 11 22:19:38 GMT 2025
    - 28.4K bytes
    - Click Count (0)
Back to Top