Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 2,322 for havde (0.02 sec)

  1. docs/en/docs/advanced/additional-status-codes.md

    If you want to return additional status codes apart from the main one, you can do that by returning a `Response` directly, like a `JSONResponse`, and set the additional status code directly.
    
    For example, let's say that you want to have a *path operation* that allows to update items, and returns HTTP status codes of 200 "OK" when successful.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 2K bytes
    - Viewed (0)
  2. misc/go_android_exec/exitcode_test.go

    		if err != nil {
    			t.Fatal(err)
    		}
    	}
    
    	// The "pre" output should all have been flushed already.
    	if want, got := pre, out.String(); want != got {
    		t.Errorf("filter should have already flushed %q, but flushed %q", want, got)
    	}
    
    	code, err := f.Finish()
    	if err != nil {
    		t.Fatal(err)
    	}
    
    	// Nothing more should have been written to out.
    	if want, got := pre, out.String(); want != got {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed May 03 14:54:58 UTC 2023
    - 2.1K bytes
    - Viewed (0)
  3. docs/en/docs/python-types.md

    ### Edit it { #edit-it }
    
    It's a very simple program.
    
    But now imagine that you were writing it from scratch.
    
    At some point you would have started the definition of the function, you had the parameters ready...
    
    But then you have to call "that method that converts the first letter to upper case".
    
    Was it `upper`? Was it `uppercase`? `first_uppercase`? `capitalize`?
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 17.1K bytes
    - Viewed (0)
  4. cmd/erasure-healing-common_test.go

    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 3).UTC(),
    			},
    			time.Unix(0, 3).UTC(),
    			4,
    		},
    		{
    			// 3. Tests common time obtained when elements have a mixture of
    			// sentinel values and don't have read quorum on any of the values.
    			[]time.Time{
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 2).UTC(),
    				time.Unix(0, 1).UTC(),
    				time.Unix(0, 3).UTC(),
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  5. guava/src/com/google/common/math/PairedStatsAccumulator.java

      public void add(double x, double y) {
        // We extend the recursive expression for the one-variable case at Art of Computer Programming
        // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
        // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
        // We also define the sum of the products of the differences from the means
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java

       * file. For discussion, see AbstractFutureState.
       */
    
      // Lazily initialized the first time we see an exception; not released until all the input futures
      // have completed and we have processed them all.
      volatile @Nullable Set<Throwable> seenExceptionsField = null;
    
      volatile int remainingField;
    
      private static final AtomicHelper ATOMIC_HELPER;
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  7. guava/src/com/google/common/graph/SuccessorsFunction.java

     * any other implementation of this interface.
     *
     * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
     * which has a method {@code getChildren()} that retrieves its successors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getChildren);
     * }
     *
     * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  8. .github/ISSUE_TEMPLATE/feature_enhancement_request.yaml

              required: true
            - label: >
                I have read and understood the [contribution
                guidelines](https://github.com/google/guava/wiki/HowToContribute#feature-requests).
              required: true
            - label: >
                I have read and understood
                [Guava's philosophy](https://github.com/google/guava/wiki/PhilosophyExplained), and
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Nov 17 18:47:47 UTC 2023
    - 3.9K bytes
    - Viewed (0)
  9. docs/en/docs/advanced/dataclasses.md

    You can also combine `dataclasses` with other type annotations to make nested data structures.
    
    In some cases, you might still have to use Pydantic's version of `dataclasses`. For example, if you have errors with the automatically generated API documentation.
    
    In that case, you can simply swap the standard `dataclasses` with `pydantic.dataclasses`, which is a drop-in replacement:
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  10. cmd/speedtest.go

    		if opts.autotune {
    			// if we have less drives than concurrency then choose
    			// only the concurrency to be number of drives to start
    			// with - since default '32' might be big and may not
    			// complete in total time of 10s.
    			if globalEndpoints.NEndpoints() < concurrency {
    				concurrency = globalEndpoints.NEndpoints()
    			}
    
    			// Check if we have local disks per pool less than
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue May 27 15:19:03 UTC 2025
    - 9.2K bytes
    - Viewed (0)
Back to top