Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 819 for wants (0.02 seconds)

  1. cmd/bucket-replication-utils_test.go

    			t.Errorf("Test%d (%s): Size  got %d , want %d", i+1, test.name, actualSize, test.expectedCompletedSize)
    		}
    		if repStatusStr := rinfos.ReplicationStatusInternal(); repStatusStr != test.expectedReplicationStatusInternal {
    			t.Errorf("Test%d (%s): Internal replication status  got %s , want %s", i+1, test.name, repStatusStr, test.expectedReplicationStatusInternal)
    		}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Apr 09 14:28:39 GMT 2025
    - 9.3K bytes
    - Click Count (0)
  2. docs/debugging/inspect/decrypt-v1.go

    		return err
    	}
    	key, err := hex.DecodeString(keyHex[8:])
    	if err != nil {
    		return err
    	}
    	// Verify that CRC is ok.
    	want := binary.LittleEndian.Uint32(id)
    	got := crc32.ChecksumIEEE(key)
    	if want != got {
    		return fmt.Errorf("Invalid key checksum, want %x, got %x", want, got)
    	}
    
    	stream, err := sio.AES_256_GCM.Stream(key)
    	if err != nil {
    		return err
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Apr 11 21:22:47 GMT 2024
    - 1.6K bytes
    - Click Count (0)
  3. src/archive/zip/reader_test.go

    	if b.Len() != len(c) {
    		t.Errorf("%s: len=%d, want %d", f.Name, b.Len(), len(c))
    		return
    	}
    
    	for i, b := range b.Bytes() {
    		if b != c[i] {
    			t.Errorf("%s: content[%d]=%q want %q", f.Name, i, b, c[i])
    			return
    		}
    	}
    }
    
    func testFileMode(t *testing.T, f *File, want fs.FileMode) {
    	mode := f.Mode()
    	if want == 0 {
    		t.Errorf("%s mode: got %v, want none", f.Name, mode)
    	} else if mode != want {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 15 18:35:56 GMT 2026
    - 57.9K bytes
    - Click Count (0)
  4. docs/en/docs/deployment/concepts.md

    ///
    
    ## Previous Steps Before Starting { #previous-steps-before-starting }
    
    There are many cases where you want to perform some steps **before starting** your application.
    
    For example, you might want to run **database migrations**.
    
    But in most cases, you will want to perform these steps only **once**.
    
    So, you will want to have a **single process** to perform those **previous steps**, before starting the application.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 18.5K bytes
    - Click Count (1)
  5. internal/hash/checker.go

    type Checker struct {
    	c io.Closer
    	r io.Reader
    	h hash.Hash
    
    	want []byte
    }
    
    // NewChecker ensures that content with the specified length is read from rc.
    // Calling Close on this will close upstream.
    func NewChecker(rc io.ReadCloser, h hash.Hash, wantSum []byte, length int64) *Checker {
    	return &Checker{c: rc, r: ioutil.HardLimitReader(rc, length), h: h, want: wantSum}
    }
    
    // Read satisfies io.Reader
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Jan 20 14:49:07 GMT 2025
    - 1.8K bytes
    - Click Count (0)
  6. dbflute_fess/dfprop/databaseInfoMap.dfprop

        # o variousMap: (NotRequired - Default map:{})
        #  The various settings about JDBC task mainly.
        #
        ; variousMap = map:{
            # o objectTypeTargetList: (NotRequired - Default list:{TABLE;VIEW})
            #  If you want to include other object types in generating target,
            #  you should specify the list of included object types as adding.
            #    e.g. Synonym of Oracle --> list:{TABLE ; VIEW ; SYNONYM}
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 31 23:35:14 GMT 2015
    - 7.3K bytes
    - Click Count (0)
  7. internal/etag/etag_test.go

    	},
    }
    
    func TestString(t *testing.T) {
    	for i, test := range stringTests {
    		s := test.ETag.String()
    		if s != test.String {
    			t.Fatalf("Test %d: got %s - want %s", i, s, test.String)
    		}
    	}
    }
    
    var equalTests = []struct {
    	A     string
    	B     string
    	Equal bool
    }{
    	{A: "3b83ef96387f14655fc854ddc3c6bd57", B: "3b83ef96387f14655fc854ddc3c6bd57", Equal: true},   // 0
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Apr 09 14:28:39 GMT 2025
    - 12.6K bytes
    - Click Count (0)
  8. cmd/streaming-signature-v4_test.go

    		tests = append(tests, testCase{in: fmt.Sprintf("%x", i), want: i})
    	}
    	for _, tt := range tests {
    		got, err := parseHexUint([]byte(tt.in))
    		if tt.wantErr != "" {
    			if err != nil && !strings.Contains(err.Error(), tt.wantErr) {
    				t.Errorf("parseHexUint(%q) = %v, %v; want error %q", tt.in, got, err, tt.wantErr)
    			}
    		} else {
    			if err != nil || got != tt.want {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  9. src/cmd/asm/internal/asm/endtoend_test.go

    			printed = f[0] + "\t" + strings.Join(f[1:], " ")
    		}
    
    		want := fmt.Sprintf("%05d (%s:%d)\t%s", seq, input, lineno, printed)
    		for len(output) > 0 && (output[0] < want || output[0] != want && len(output[0]) >= 5 && output[0][:5] == want[:5]) {
    			if len(output[0]) >= 5 && output[0][:5] == want[:5] {
    				t.Errorf("mismatched output:\nhave %s\nwant %s", output[0], want)
    				output = output[1:]
    				continue Diff
    			}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Mar 20 17:02:17 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  10. src/main/webapp/WEB-INF/view/common/help.jsp

    		Queries can be inclusive or exclusive of the upper and lower bounds.
    		If you want to find documents whose content_length fields have values
    		between 1000 and 10000, inclusive, you can enter:
    		<pre>content_length:[1000 TO 10000]</pre>
    		If you want to exclude the upper and lower bounds, use "{}".
    	</dd>
    	<dt>Boost</dt>
    	<dd>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Feb 26 14:01:31 GMT 2018
    - 2.4K bytes
    - Click Count (0)
Back to Top