Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 1,713 for Jake (0.02 sec)

  1. guava/src/com/google/common/reflect/Invokable.java

    import java.util.Arrays;
    import javax.annotation.CheckForNull;
    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * Wrapper around either a {@link Method} or a {@link Constructor}. Convenience API is provided to
     * make common reflective operation easier to deal with, such as {@link #isPublic}, {@link
     * #getParameters} etc.
     *
     * <p>In addition to convenience methods, {@link TypeToken#method} and {@link TypeToken#constructor}
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Dec 14 20:35:03 UTC 2023
    - 19.6K bytes
    - Viewed (0)
  2. docs/en/docs/advanced/custom-response.md

    For large responses, returning a `Response` directly is much faster than returning a dictionary.
    
    This is because by default, FastAPI will inspect every item inside and make sure it is serializable as JSON, using the same [JSON Compatible Encoder](../tutorial/encoder.md){.internal-link target=_blank} explained in the tutorial. This is what allows you to return **arbitrary objects**, for example database models.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 12K bytes
    - Viewed (0)
  3. CONTRIBUTING.md

    ### Create your feature branch
    
    Before making code changes, make sure you create a separate branch for these changes
    
    ```
    git checkout -b my-new-feature
    ```
    
    ### Test MinIO server changes
    
    After your code changes, make sure
    
    - To add test cases for the new code. If you have questions about how to do it, please ask on our [Slack](https://slack.min.io) channel.
    - To run `make verifiers`
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Aug 05 18:35:53 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  4. internal/event/rulesmap_test.go

    			t.Fatalf("test %v: result: expected: not equal, got: equal", i+1)
    		}
    	}
    }
    
    func TestRulesMapAdd(t *testing.T) {
    	rulesMapCase1 := make(RulesMap)
    	rulesMapToAddCase1 := make(RulesMap)
    	expectedResultCase1 := make(RulesMap)
    
    	rulesMapCase2 := make(RulesMap)
    	rulesMapToAddCase2 := NewRulesMap([]Name{ObjectCreatedAll}, "*", TargetID{"1", "webhook"})
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jan 05 18:43:06 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  5. internal/event/rules_test.go

    	rulesCase1 := make(Rules)
    	rules2Case1 := make(Rules)
    	expectedResultCase1 := make(Rules)
    
    	rulesCase2 := make(Rules)
    	rules2Case2 := make(Rules)
    	rules2Case2.Add(NewPattern("*", "*"), TargetID{"1", "webhook"})
    	expectedResultCase2 := make(Rules)
    
    	rulesCase3 := make(Rules)
    	rulesCase3.Add(NewPattern("*", "*"), TargetID{"1", "webhook"})
    	rules2Case3 := make(Rules)
    	expectedResultCase3 := make(Rules)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 01 21:59:40 UTC 2021
    - 8.8K bytes
    - Viewed (0)
  6. 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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 04 11:32:32 UTC 2024
    - 99.7K bytes
    - Viewed (0)
  7. cmd/bucket-handlers.go

    	postPolicyBucketTagging = "tagging"
    )
    
    // Check if there are buckets on server without corresponding entry in etcd backend and
    // make entries. Here is the general flow
    // - Range over all the available buckets
    // - Check if a bucket has an entry in etcd backend
    // -- If no, make an entry
    // -- If yes, check if the entry matches local IP check if we
    //
    //	need to update the entry then proceed to update
    //
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 12 12:24:04 UTC 2024
    - 63.4K bytes
    - Viewed (0)
  8. cmd/peer-s3-client.go

    			return nil
    		}, idx)
    	}
    
    	errs := g.Wait()
    
    	// The list of buckets in a map to avoid duplication
    	resultMap := make(map[string]BucketInfo)
    
    	for poolIdx := 0; poolIdx < sys.poolsCount; poolIdx++ {
    		perPoolErrs := make([]error, 0, len(sys.peerClients))
    		for i, client := range sys.peerClients {
    			if slices.Contains(client.GetPools(), poolIdx) {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 13 22:26:05 UTC 2024
    - 15.4K bytes
    - Viewed (0)
  9. src/bytes/buffer_test.go

    		}
    
    		rlen := rand.Intn(len(testString))
    		fub := make([]byte, rlen)
    		n, _ := buf.Read(fub)
    		s = s[n:]
    	}
    	empty(t, "TestMixedReadsAndWrites (2)", &buf, s, make([]byte, buf.Len()))
    }
    
    func TestCapWithPreallocatedSlice(t *testing.T) {
    	buf := NewBuffer(make([]byte, 10))
    	n := buf.Cap()
    	if n != 10 {
    		t.Errorf("expected 10, got %d", n)
    	}
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 18.6K bytes
    - Viewed (0)
  10. CONTRIBUTING.md

    Getting Started
    ---------------
    
    + Make sure you have a [JIRA account](https://issues.apache.org/jira/).
    + Make sure you have a [GitHub account](https://github.com/signup/free).
    + If you're planning to implement a new feature, it makes sense to discuss your changes
      on the [dev list](https://maven.apache.org/mailing-lists.html) first.
      This way you can make sure you're not wasting your time on something that isn't
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Sun Oct 10 09:48:27 UTC 2021
    - 4.7K bytes
    - Viewed (0)
Back to top