Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 60 for resultCh (1.14 sec)

  1. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/errorsas/errorsas.go

    		// Sometimes they are testing what happens to incorrect programs.
    		return nil, nil
    	}
    
    	if !analysisutil.Imports(pass.Pkg, "errors") {
    		return nil, nil // doesn't directly import errors
    	}
    
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    
    	nodeFilter := []ast.Node{
    		(*ast.CallExpr)(nil),
    	}
    	inspect.Preorder(nodeFilter, func(n ast.Node) {
    		call := n.(*ast.CallExpr)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Nov 20 21:52:54 UTC 2023
    - 2.9K bytes
    - Viewed (0)
  2. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unusedresult/unusedresult.go

    	Analyzer.Flags.Var(&funcs, "funcs",
    		"comma-separated list of functions whose results must be used")
    
    	stringMethods.Set("Error,String")
    	Analyzer.Flags.Var(&stringMethods, "stringmethods",
    		"comma-separated list of names of methods of type func() string whose results must be used")
    }
    
    func run(pass *analysis.Pass) (interface{}, error) {
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jan 22 19:00:13 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  3. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/shift/shift.go

    	URL:      "https://pkg.go.dev/golang.org/x/tools/go/analysis/passes/shift",
    	Requires: []*analysis.Analyzer{inspect.Analyzer},
    	Run:      run,
    }
    
    func run(pass *analysis.Pass) (interface{}, error) {
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    
    	// Do a complete pass to compute dead nodes.
    	dead := make(map[ast.Node]bool)
    	nodeFilter := []ast.Node{
    		(*ast.IfStmt)(nil),
    		(*ast.SwitchStmt)(nil),
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 02:20:05 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  4. okhttp/src/main/kotlin/okhttp3/internal/connection/RoutePlanner.kt

      /** Returns a plan to attempt. */
      @Throws(IOException::class)
      fun plan(): Plan
    
      /**
       * Returns true if there's more route plans to try.
       *
       * @param failedConnection an optional connection that was resulted in a failure. If the failure
       *     is recoverable, the connection's route may be recovered for the retry.
       */
      fun hasNext(failedConnection: RealConnection? = null): Boolean
    
      /**
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Wed Dec 20 23:27:07 UTC 2023
    - 4.2K bytes
    - Viewed (0)
  5. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/composite/composite.go

    }
    
    // runUnkeyedLiteral checks if a composite literal is a struct literal with
    // unkeyed fields.
    func run(pass *analysis.Pass) (interface{}, error) {
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    
    	nodeFilter := []ast.Node{
    		(*ast.CompositeLit)(nil),
    	}
    	inspect.Preorder(nodeFilter, func(n ast.Node) {
    		cl := n.(*ast.CompositeLit)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 02:20:05 UTC 2024
    - 4.4K bytes
    - Viewed (0)
  6. docs/fr/docs/benchmarks.md

        * Si on n'utilisait pas FastAPI mais directement Starlette (ou un outil équivalent comme Sanic, Flask, Responder, etc) il faudrait implémenter la validation des données et la sérialisation par nous-même. Le résultat serait donc le même dans les deux cas mais du travail supplémentaire serait à réaliser avec Starlette, surtout en considérant que la validation des données et la sérialisation représentent la plus grande quantité de code à écrire dans une application....
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Jul 27 18:49:56 UTC 2023
    - 3.9K bytes
    - Viewed (0)
  7. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unsafeptr/unsafeptr.go

    	URL:      "https://pkg.go.dev/golang.org/x/tools/go/analysis/passes/unsafeptr",
    	Requires: []*analysis.Analyzer{inspect.Analyzer},
    	Run:      run,
    }
    
    func run(pass *analysis.Pass) (interface{}, error) {
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    
    	nodeFilter := []ast.Node{
    		(*ast.CallExpr)(nil),
    		(*ast.StarExpr)(nil),
    		(*ast.UnaryExpr)(nil),
    	}
    	inspect.Preorder(nodeFilter, func(n ast.Node) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 02:20:05 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  8. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/stringintconv/string.go

    	switch t := t.(type) {
    	case *types.Basic:
    		return t.Name()
    	case hasTypeName:
    		return t.Obj().Name()
    	}
    	return ""
    }
    
    func run(pass *analysis.Pass) (interface{}, error) {
    	inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector)
    	nodeFilter := []ast.Node{
    		(*ast.CallExpr)(nil),
    	}
    	inspect.Preorder(nodeFilter, func(n ast.Node) {
    		call := n.(*ast.CallExpr)
    
    		if len(call.Args) != 1 {
    			return
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 16:19:04 UTC 2024
    - 5.2K bytes
    - Viewed (0)
  9. docs/de/docs/tutorial/dependencies/sub-dependencies.md

        Beachten Sie, dass wir in der *Pfadoperation-Funktion* nur eine einzige Abhängigkeit deklarieren, den `query_or_cookie_extractor`.
    
        Aber **FastAPI** wird wissen, dass es zuerst `query_extractor` auflösen muss, um dessen Resultat `query_or_cookie_extractor` zu übergeben, wenn dieses aufgerufen wird.
    
    ```mermaid
    graph TB
    
    query_extractor(["query_extractor"])
    query_or_cookie_extractor(["query_or_cookie_extractor"])
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sat Mar 30 18:09:48 UTC 2024
    - 6.3K bytes
    - Viewed (0)
  10. src/math/fma.go

    	r2 = u2>>n | u1<<(64-n) | u1>>(n-64)
    	r1 = u1 >> n
    	return
    }
    
    // shrcompress compresses the bottom n+1 bits of the two-word
    // value into a single bit. the result is equal to the value
    // shifted to the right by n, except the result's 0th bit is
    // set to the bitwise OR of the bottom n+1 bits.
    func shrcompress(u1, u2 uint64, n uint) (r1, r2 uint64) {
    	// TODO: Performance here is really sensitive to the
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jul 05 22:05:30 UTC 2023
    - 4.6K bytes
    - Viewed (0)
Back to top