Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 1,586 for makeCT (0.06 sec)

  1. docs/en/docs/tutorial/body.md

    * Generate <a href="https://json-schema.org" class="external-link" target="_blank">JSON Schema</a> definitions for your model, you can also use them anywhere else you like if it makes sense for your project.
    * Those schemas will be part of the generated OpenAPI schema, and used by the automatic documentation <abbr title="User Interfaces">UIs</abbr>.
    
    ## Automatic docs
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 16:58:19 UTC 2024
    - 6.6K bytes
    - Viewed (0)
  2. licenses/github.com/hashicorp/go-version/LICENSE

            Licensable by such Contributor to use, reproduce, make available,
            modify, display, perform, distribute, and otherwise exploit its
            Contributions, either on an unmodified basis, with Modifications, or as
            part of a Larger Work; and
    
         b. under Patent Claims of such Contributor to make, use, sell, offer for
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Jun 06 15:59:40 UTC 2024
    - 15.6K bytes
    - Viewed (0)
  3. licenses/github.com/hashicorp/golang-lru/v2/LICENSE

            Licensable by such Contributor to use, reproduce, make available,
            modify, display, perform, distribute, and otherwise exploit its
            Contributions, either on an unmodified basis, with Modifications, or
            as part of a Larger Work; and
    
         b. under Patent Claims of such Contributor to make, use, sell, offer for
            sale, have made, import, and otherwise transfer either its
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Fri Feb 03 20:21:32 UTC 2023
    - 15.6K bytes
    - Viewed (0)
  4. LICENSE

    our General Public Licenses are intended to guarantee your freedom to
    share and change all versions of a program--to make sure it remains free
    software for all its users.
    
      When we speak of free software, we are referring to freedom, not
    price.  Our General Public Licenses are designed to make sure that you
    have the freedom to distribute copies of free software (and charge for
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 33.7K bytes
    - Viewed (0)
  5. src/cmd/api/main_test.go

    		c.Compiler = build.Default.Compiler
    	}
    
    	walkers := make([]*Walker, len(contexts))
    	var wg sync.WaitGroup
    	for i, context := range contexts {
    		i, context := i, context
    		wg.Add(1)
    		go func() {
    			defer wg.Done()
    			walkers[i] = NewWalker(context, filepath.Join(testenv.GOROOT(t), "src"))
    		}()
    	}
    	wg.Wait()
    
    	var featureCtx = make(map[string]map[string]bool) // feature -> context name -> true
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Sep 04 18:16:59 UTC 2024
    - 31.4K bytes
    - Viewed (0)
  6. src/builtin/builtin.go

    // constant. See the Go language specification's "Length and capacity" section for
    // details.
    func cap(v Type) int
    
    // The make built-in function allocates and initializes an object of type
    // slice, map, or chan (only). Like new, the first argument is a type, not a
    // value. Unlike new, make's return type is the same as the type of its
    // argument, not a pointer to it. The specification of the result depends on
    // the type:
    //
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

      }
    
      public void testOneSecondBurst() {
        RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
        stopwatch.sleepMillis(1000); // max capacity reached
        stopwatch.sleepMillis(1000); // this makes no difference
        limiter.acquire(1); // R0.00, since it's the first request
    
        limiter.acquire(1); // R0.00, from capacity
        limiter.acquire(3); // R0.00, from capacity
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 21.8K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb/SmbTreeConnection.java

                    return send0(loc, request, response, params);
                }
                catch ( SmbException smbe ) {
                    // Retrying only makes sense if the invalid parameter is an tree id. If we have a stale file descriptor
                    // retrying make no sense, as it will never become available again.
                    if ( params.contains(RequestParam.NO_RETRY)
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Tue Jul 07 10:50:16 UTC 2020
    - 31K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java

      }
    
      public void testOneSecondBurst() {
        RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
        stopwatch.sleepMillis(1000); // max capacity reached
        stopwatch.sleepMillis(1000); // this makes no difference
        limiter.acquire(1); // R0.00, since it's the first request
    
        limiter.acquire(1); // R0.00, from capacity
        limiter.acquire(3); // R0.00, from capacity
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 21.8K bytes
    - Viewed (0)
  10. cni/pkg/nodeagent/server_test.go

    type WaitGroup struct {
    	count int32
    	done  chan struct{}
    }
    
    func NewWaitGroup() *WaitGroup {
    	return &WaitGroup{
    		done: make(chan struct{}),
    	}
    }
    
    func NewWaitForNCalls(t *testing.T, n int32) (*WaitGroup, func()) {
    	wg := &WaitGroup{
    		done: make(chan struct{}),
    	}
    
    	wg.Add(n)
    	return wg, func() {
    		select {
    		case <-wg.C():
    			return
    		case <-time.After(time.Second):
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Wed Oct 09 16:05:45 UTC 2024
    - 18.7K bytes
    - Viewed (0)
Back to top