Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 61 - 70 of 655 for wantCS (0.13 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. .github/ISSUE_TEMPLATE/feature_enhancement_request.yaml

      - type: textarea
        attributes:
          label: API(s)
          description: Which existing classes or methods do you want to improve?
          placeholder: e.g., `com.google.common.collect.ImmutableList::of`
          render: java
        validations:
          required: true
    
      - type: textarea
        attributes:
          label: How do you want it to be improved?
        validations:
          required: true
    
      - type: textarea
        attributes:
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Nov 17 18:47:47 GMT 2023
    - 3.9K bytes
    - Click Count (0)
  2. 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)
  3. 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)
  4. 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)
  5. android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java

      //   completion preferably and AQS is non-deterministic (depends on where in the queue the waiter
      //   is). If we wanted to be strict about it, we could store the unpark() time in the Waiter node
      //   and we could use that to make a decision about whether or not we timed out prior to being
      //   unparked.
    
      @SuppressWarnings({
        "LabelledBreakTarget", // TODO(b/345814817): Maybe fix?
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 33.2K bytes
    - Click Count (0)
  6. 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)
  7. 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)
  8. 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)
  9. 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)
  10. CONTRIBUTING.md

    starting the implementation. There are often a number of ways to fix a problem
    and it is important to find the right approach before spending time on a PR
    that cannot be merged.
    
    We add the `help wanted` label to existing GitHub issues for which community
    contributions are particularly welcome, and we use the `good first issue` label
    to mark issues that we think will be suitable for new contributors.
    
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Wed Sep 01 07:32:01 GMT 2021
    - 36.5K bytes
    - Click Count (0)
Back to Top