Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 35 for pre (0.14 sec)

  1. misc/go_android_exec/exitcode_test.go

    	// Embed a "fake" exit code in the middle to check that we don't get caught on it.
    	pre := "abc" + exitStr + "123def"
    	text := pre + exitStr + `1`
    	for i := 0; i < len(text); i++ {
    		_, err := f.Write([]byte{text[i]})
    		if err != nil {
    			t.Fatal(err)
    		}
    	}
    
    	// The "pre" output should all have been flushed already.
    	if want, got := pre, out.String(); want != got {
    Go
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Wed May 03 14:54:58 GMT 2023
    - 2.1K bytes
    - Viewed (0)
  2. cmd/routers.go

    	// accordingly. Client receives a HTTP error for invalid/unsupported
    	// signatures.
    	//
    	// Validates all incoming requests to have a valid date header.
    	setAuthMiddleware,
    	// Redirect some pre-defined browser request paths to a static location
    	// prefix.
    	setBrowserRedirectMiddleware,
    	// Adds 'crossdomain.xml' policy middleware to serve legacy flash clients.
    	setCrossDomainPolicyMiddleware,
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Fri Mar 08 19:08:18 GMT 2024
    - 3.6K bytes
    - Viewed (1)
  3. cmd/s3-zip-handlers.go

    		return
    	}
    
    	if r.Header.Get(xhttp.Range) != "" {
    		writeErrorResponse(ctx, w, errorCodes.ToAPIErr(ErrInvalidRange), r.URL)
    		return
    	}
    
    	// Validate pre-conditions if any.
    	opts.CheckPrecondFn = func(oi ObjectInfo) bool {
    		if _, err := DecryptObjectInfo(&oi, r); err != nil {
    			writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
    			return true
    		}
    
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Tue Apr 09 10:41:25 GMT 2024
    - 15.8K bytes
    - Viewed (0)
  4. src/archive/tar/reader.go

    			// If we are unable to parse them and the prefix field looks like
    			// an ASCII string, then we fallback on the pre-Go1.8 behavior
    			// of treating these fields as the USTAR prefix field.
    			//
    			// Note that this will not use the fallback logic for all possible
    			// files generated by a pre-Go1.8 toolchain. If the generated file
    			// happened to have a prefix field that parses as valid
    Go
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Fri Mar 08 01:59:14 GMT 2024
    - 26.8K bytes
    - Viewed (0)
  5. internal/kms/context.go

    // is based on the un-escaped keys. It never returns an error.
    func (c Context) MarshalText() ([]byte, error) {
    	if len(c) == 0 {
    		return []byte{'{', '}'}, nil
    	}
    
    	// Pre-allocate a buffer - 128 bytes is an arbitrary
    	// heuristic value that seems like a good starting size.
    	b := bytes.NewBuffer(make([]byte, 0, 128))
    	if len(c) == 1 {
    		for k, v := range c {
    			b.WriteString(`{"`)
    Go
    - Registered: Sun Apr 21 19:28:08 GMT 2024
    - Last Modified: Sun Jan 02 17:15:06 GMT 2022
    - 6K bytes
    - Viewed (0)
  6. cni/test/install_k8s_test.go

    			chainedCNIPlugin:       true,
    			resultFileName:         "00-calico.conflist",
    			expectedOutputFile:     testDataDir + "/expected/10-calico.conflist-istioconfig",
    			expectedPostCleanFile:  testDataDir + "/pre/calico.conflist",
    			cniConfDirOrderedFiles: []string{"calico.conflist", "minikube_cni.conf"},
    		},
    		{
    			name:                   "First file without pre-plugins--.conf",
    			chainedCNIPlugin:       true,
    Go
    - Registered: Wed Apr 24 22:53:08 GMT 2024
    - Last Modified: Wed Jul 27 18:01:48 GMT 2022
    - 8K bytes
    - Viewed (0)
  7. src/archive/tar/common.go

    	dst := src[:0]
    	var pre sparseEntry
    	for _, cur := range src {
    		if cur.Length == 0 {
    			continue // Skip empty fragments
    		}
    		pre.Length = cur.Offset - pre.Offset
    		if pre.Length > 0 {
    			dst = append(dst, pre) // Only add non-empty fragments
    		}
    		pre.Offset = cur.endOffset()
    	}
    	pre.Length = size - pre.Offset // Possibly the only empty fragment
    	return append(dst, pre)
    Go
    - Registered: Tue Apr 23 11:13:09 GMT 2024
    - Last Modified: Fri Mar 15 16:01:50 GMT 2024
    - 24.7K bytes
    - Viewed (2)
  8. cmd/batch-handlers.go

    				success := true
    				if err := r.ReplicateToTarget(ctx, api, c, result, retry); err != nil {
    					if miniogo.ToErrorResponse(err).Code == "PreconditionFailed" {
    						// pre-condition failed means we already have the object copied over.
    						return
    					}
    					// object must be deleted concurrently, allow these failures but do not count them
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Mon Apr 08 14:11:38 GMT 2024
    - 55.2K bytes
    - Viewed (0)
  9. internal/bpool/bpool.go

    		panic("buffer length cannot be > capacity of the buffer")
    	}
    	return &BytePoolCap{
    		c:    make(chan []byte, maxSize),
    		w:    width,
    		wcap: capwidth,
    	}
    }
    
    // Populate - populates and pre-warms the byte pool, this function is non-blocking.
    func (bp *BytePoolCap) Populate() {
    	for _, buf := range reedsolomon.AllocAligned(cap(bp.c), bp.wcap) {
    		bp.Put(buf[:bp.w])
    	}
    }
    
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Fri Apr 19 16:44:59 GMT 2024
    - 2.6K bytes
    - Viewed (0)
  10. tests/scopes_test.go

    					func(d *gorm.DB) *gorm.DB {
    						return d.Where(DB.Or("b = 2").Or("c = 3"))
    					},
    				).Find(&Language{})
    			},
    			expected: `SELECT * FROM "languages" WHERE a = 1 AND (b = 2 OR c = 3)`,
    		}, {
    			name: "depth_1_pre_cond",
    			queryFn: func(tx *gorm.DB) *gorm.DB {
    				return tx.Where("z = 0").Scopes(
    					func(d *gorm.DB) *gorm.DB { return d.Where("a = 1") },
    					func(d *gorm.DB) *gorm.DB {
    						return d.Or(DB.Where("b = 2").Or("c = 3"))
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Fri Jan 12 08:42:21 GMT 2024
    - 3.3K bytes
    - Viewed (0)
Back to top