Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 277 for Look (0.17 sec)

  1. okhttp/src/main/kotlin/okhttp3/Response.kt

       *
       * Use the `request` of the [networkResponse] field to get the wire-level request that was
       * transmitted. In the case of follow-ups and redirects, also look at the `request` of the
       * [priorResponse] objects, which have its own [priorResponse].
       */
      @get:JvmName("request") val request: Request,
    Plain Text
    - Registered: Fri May 03 11:42:14 GMT 2024
    - Last Modified: Tue Jan 23 14:31:42 GMT 2024
    - 15.5K bytes
    - Viewed (0)
  2. licenses/github.com/hashicorp/golang-lru/v2/LICENSE

    If it is not possible or desirable to put the notice in a particular file,
    then You may include the notice in a location (such as a LICENSE file in a
    relevant directory) where a recipient would be likely to look for such a
    notice.
    
    You may add additional accurate notices of copyright ownership.
    
    Exhibit B - "Incompatible With Secondary Licenses" Notice
    
          This Source Code Form is "Incompatible
    Plain Text
    - Registered: Wed May 08 22:53:08 GMT 2024
    - Last Modified: Fri Feb 03 20:21:32 GMT 2023
    - 15.6K bytes
    - Viewed (0)
  3. tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.h

      /// Prune the cache by removing files with expired blocks.
      void Prune() ABSL_LOCKS_EXCLUDED(mu_);
    
      bool BlockNotStale(const std::shared_ptr<Block>& block)
          ABSL_EXCLUSIVE_LOCKS_REQUIRED(mu_);
    
      /// Look up a Key in the block cache.
      std::shared_ptr<Block> Lookup(const Key& key) ABSL_LOCKS_EXCLUDED(mu_);
    
      void MaybeFetch(const Key& key, const std::shared_ptr<Block>& block,
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Mon Aug 31 04:46:34 GMT 2020
    - 10.6K bytes
    - Viewed (0)
  4. src/cmd/api/main_test.go

    		log.Panicf("no source in tree for import %q (from import %s in %s): %v", name, fromPath, fromDir, err)
    	}
    
    	context := w.context
    	if context == nil {
    		context = &build.Default
    	}
    
    	// Look in cache.
    	// If we've already done an import with the same set
    	// of relevant tags, reuse the result.
    	var key string
    	if usePkgCache {
    		if tags, ok := pkgTags[dir]; ok {
    			key = tagKey(dir, context, tags)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Apr 09 20:48:51 GMT 2024
    - 31.4K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/lex/input.go

    	peek            bool
    	peekToken       ScanToken
    	peekText        string
    }
    
    // NewInput returns an Input from the given path.
    func NewInput(name string) *Input {
    	return &Input{
    		// include directories: look in source dir, then -I directories.
    		includes:        append([]string{filepath.Dir(name)}, flags.I...),
    		beginningOfLine: true,
    		macros:          predefine(flags.D),
    	}
    }
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 12.6K bytes
    - Viewed (0)
  6. docs/en/docs/deployment/https.md

    The idea is to automate the acquisition and renewal of these certificates so that you can have **secure HTTPS, for free, forever**.
    
    ## HTTPS for Developers
    
    Here's an example of how an HTTPS API could look like, step by step, paying attention mainly to the ideas important for developers.
    
    ### Domain Name
    
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu Jan 11 16:31:18 GMT 2024
    - 12K bytes
    - Viewed (0)
  7. licenses/github.com/hashicorp/go-version/LICENSE

    If it is not possible or desirable to put the notice in a particular file, then
    You may include the notice in a location (such as a LICENSE file in a relevant
    directory) where a recipient would be likely to look for such a notice.
    
    You may add additional accurate notices of copyright ownership.
    
    Exhibit B - “Incompatible With Secondary Licenses” Notice
    
          This Source Code Form is “Incompatible
    Plain Text
    - Registered: Wed May 08 22:53:08 GMT 2024
    - Last Modified: Sat Oct 26 02:47:39 GMT 2019
    - 15.6K bytes
    - Viewed (0)
  8. guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableSortedMap.java

       * GWT SortedMap implementation that we delegate to throws
       * NullPointerException if the comparator does. Since our construction
       * methods ensure that null is never present in the map, it's OK for the
       * comparator to look for it wherever it wants.
       *
       * Note that we do NOT touch the comparator returned by comparator(), which
       * should be identical to the one the user passed in. We touch only the
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Tue Feb 27 19:19:19 GMT 2024
    - 16.4K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/dependencies/classes-as-dependencies.md

    You declare the dependency as the type of the parameter, and you use `Depends()` without any parameter, instead of having to write the full class *again* inside of `Depends(CommonQueryParams)`.
    
    The same example would then look like:
    
    === "Python 3.10+"
    
        ```Python hl_lines="19"
        {!> ../../../docs_src/dependencies/tutorial004_an_py310.py!}
        ```
    
    === "Python 3.9+"
    
        ```Python hl_lines="19"
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu Apr 18 19:53:19 GMT 2024
    - 11.4K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/graph/ValueGraphTest.java

                      for (Integer node : graph.nodes()) {
                        Set<Integer> unused = graph.successors(node);
                      }
                      /*
                       * Also look up an earlier node so that, if the graph is using MapRetrievalCache,
                       * we read one of the fields declared in that class.
                       */
                      Set<Integer> unused = graph.successors(first);
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Tue Feb 06 18:35:19 GMT 2024
    - 20K bytes
    - Viewed (0)
Back to top