Search Options

Results per page
Sort
Preferred Languages
Advance

Results 411 - 420 of 1,487 for makes (0.07 sec)

  1. cmd/admin-handlers.go

    		return
    	}
    
    	updateStatus := madmin.ServerUpdateStatusV2{
    		DryRun:  dryRun,
    		Results: make([]madmin.ServerPeerUpdateStatus, 0, len(globalNotificationSys.allPeerClients)),
    	}
    	peerResults := make(map[string]madmin.ServerPeerUpdateStatus, len(globalNotificationSys.allPeerClients))
    	failedClients := make(map[int]bool, len(globalNotificationSys.allPeerClients))
    
    	if lrTime.Sub(currentReleaseTime) <= 0 {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 99.7K bytes
    - Viewed (0)
  2. cmd/xl-storage-format-v1_gen_test.go

    	v := ChecksumInfo{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgChecksumInfo(b *testing.B) {
    	v := ChecksumInfo{}
    	bts := make([]byte, 0, v.Msgsize())
    	bts, _ = v.MarshalMsg(bts[0:0])
    	b.SetBytes(int64(len(bts)))
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		bts, _ = v.MarshalMsg(bts[0:0])
    	}
    }
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 13.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/StandardNetwork.java

      private final ElementOrder<N> nodeOrder;
      private final ElementOrder<E> edgeOrder;
    
      final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections;
    
      // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
      // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
      final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/StandardNetwork.java

      private final ElementOrder<N> nodeOrder;
      private final ElementOrder<E> edgeOrder;
    
      final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections;
    
      // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
      // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
      final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/middleware.md

    * It takes each **request** that comes to your application.
    * It can then do something to that **request** or run any needed code.
    * Then it passes the **request** to be processed by the rest of the application (by some *path operation*).
    * It then takes the **response** generated by the application (by some *path operation*).
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  6. .github/pull_request_template.md

    - [ ] Write unit tests that match behavioral changes, where the tests fail if the changes to the runtime are not applied.
      This may not always be possible but is a best-practice.
    - [ ] Run `mvn verify` to make sure basic checks pass.
      A more thorough check will be performed on your pull request automatically.
    - [ ] You have run the [Core IT][core-its] successfully.
    
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Fri Jun 06 14:30:05 UTC 2025
    - 1.5K bytes
    - Viewed (0)
  7. cmd/batch-replicate_gen_test.go

    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgBatchJobReplicateCredentials(b *testing.B) {
    	v := BatchJobReplicateCredentials{}
    	bts := make([]byte, 0, v.Msgsize())
    	bts, _ = v.MarshalMsg(bts[0:0])
    	b.SetBytes(int64(len(bts)))
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		bts, _ = v.MarshalMsg(bts[0:0])
    	}
    }
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 14.2K bytes
    - Viewed (0)
  8. internal/etag/etag_test.go

    	Plaintext ETag
    }{
    	{ // 0
    		Key:       make([]byte, 32),
    		ETag:      must("3b83ef96387f14655fc854ddc3c6bd57"),
    		Plaintext: must("3b83ef96387f14655fc854ddc3c6bd57"),
    	},
    	{ // 1
    		Key:       make([]byte, 32),
    		ETag:      must("7b976cc68452e003eec7cb0eb631a19a-1"),
    		Plaintext: must("7b976cc68452e003eec7cb0eb631a19a-1"),
    	},
    	{ // 2
    		Key:       make([]byte, 32),
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 12.6K bytes
    - Viewed (0)
  9. LICENSES/OWNERS

    # See the OWNERS docs at https://go.k8s.io/owners
    
    options:
      # make root approval non-recursive
      no_parent_owners: true
    approvers:
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Mon Oct 10 12:26:53 UTC 2022
    - 151 bytes
    - Viewed (0)
  10. internal/logger/target/http/http.go

    	name := newTgt.Name()
    
    	currentBuff, ok := logChBuffers[name]
    	if !ok {
    		logChBuffers[name] = make(chan any, requiredCap)
    		currentCap = requiredCap
    	} else {
    		currentCap = cap(currentBuff)
    		requiredCap += len(currentBuff)
    	}
    
    	if requiredCap > currentCap {
    		logChBuffers[name] = make(chan any, requiredCap)
    
    		if len(currentBuff) > 0 {
    		drain:
    			for {
    				select {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 15.6K bytes
    - Viewed (0)
Back to top