Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 261 - 270 of 371 for topk (0.04 seconds)

  1. cmd/xl-storage.go

    	// Check if backend is writable and supports O_DIRECT
    	uuid := mustGetUUID()
    	filePath := pathJoin(s.drivePath, minioMetaTmpDeletedBucket, ".writable-check-"+uuid+".tmp")
    
    	// Create top level directories if they don't exist.
    	// with mode 0o777 mkdir honors system umask.
    	mkdirAll(pathutil.Dir(filePath), 0o777, s.drivePath) // don't need to fail here
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 91.7K bytes
    - Click Count (0)
  2. src/main/webapp/js/admin/bootstrap.min.js.map

    '.modal-dialog'\nconst SELECTOR_MODAL_BODY = '.modal-body'\nconst SELECTOR_DATA_TOGGLE = '[data-toggle=\"modal\"]'\nconst SELECTOR_DATA_DISMISS = '[data-dismiss=\"modal\"]'\nconst SELECTOR_FIXED_CONTENT = '.fixed-top, .fixed-bottom, .is-fixed, .sticky-top'\nconst SELECTOR_STICKY_CONTENT = '.sticky-top'\n\nconst Default = {\n  backdrop: true,\n  keyboard: true,\n  focus: true,\n  show: true\n}\n\nconst DefaultType = {\n  backdrop: '(boolean|string)',\n  keyboard: 'boolean',\n  focus: 'boolean',\n  show: ...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 180.9K bytes
    - Click Count (0)
  3. docs/en/docs/tutorial/first-steps.md

    * the path `/`
    * using a <dfn title="an HTTP GET method"><code>get</code> operation</dfn>
    
    /// info | `@decorator` Info
    
    That `@something` syntax in Python is called a "decorator".
    
    You put it on top of a function. Like a pretty decorative hat (I guess that's where the term came from).
    
    A "decorator" takes the function below and does something with it.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 13.4K bytes
    - Click Count (0)
  4. docs/en/docs/tutorial/dependencies/dependencies-with-yield.md

    ## Execution of dependencies with `yield` { #execution-of-dependencies-with-yield }
    
    The sequence of execution is more or less like this diagram. Time flows from top to bottom. And each column is one of the parts interacting or executing code.
    
    ```mermaid
    sequenceDiagram
    
    participant client as Client
    participant handler as Exception handler
    participant dep as Dep with yield
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/CompactHashMap.java

      // array. The top bits of this value are the remaining bits of the hash value that were not used
      // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
      // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
      // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 35.7K bytes
    - Click Count (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/EventListener.kt

       */
      open fun satisfactionFailure(
        call: Call,
        response: Response,
      ) {
      }
    
      /**
       * Invoked when a result is served from the cache. The Response provided is the top level
       * Response and normal event sequences will not be received.
       *
       * This event will only be received when a Cache is configured for the client.
       */
      open fun cacheHit(
        call: Call,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Oct 07 21:03:04 GMT 2025
    - 24.9K bytes
    - Click Count (0)
  7. docs/en/docs/tutorial/bigger-applications.md

    * go to the parent package (the directory `app/`)...
    * then go to the parent of that package (there's no parent package, `app` is the top level 😱)...
    * and in there, find the module `dependencies` (the file at `app/dependencies.py`)...
    * and from it, import the function `get_token_header`.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 19.2K bytes
    - Click Count (0)
  8. compat/maven-embedder/src/main/java/org/fusesource/jansi/Ansi.java

            return this;
        }
    
        /**
         * Moves the cursor to row n, column m. The values are 1-based.
         * Any values less than 1 are mapped to 1.
         *
         * @param row    row (1-based) from top
         * @param column column (1 based) from left
         * @return this Ansi instance
         */
        public Ansi cursor(final int row, final int column) {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Sat Apr 05 11:52:05 GMT 2025
    - 23.1K bytes
    - Click Count (0)
  9. docs/bucket/notifications/README.md

    ```
    mc cp myphoto.jpg myminio/images
    ```
    
    Use curl to view contents of `minio_events` index.
    
    ```
    $ curl  "http://localhost:9200/minio_events/_search?pretty=true"
    {
      "took" : 40,
      "timed_out" : false,
      "_shards" : {
        "total" : 5,
        "successful" : 5,
        "failed" : 0
      },
      "hits" : {
        "total" : 1,
        "max_score" : 1.0,
        "hits" : [
          {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 84.2K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/Queues.java

          throws InterruptedException {
        Preconditions.checkNotNull(buffer);
        /*
         * This code performs one System.nanoTime() more than necessary, and in return, the time to
         * execute Queue#drainTo is not added *on top* of waiting for the timeout (which could make
         * the timeout arbitrarily inaccurate, given a queue that is slow to drain).
         */
        long deadline = System.nanoTime() + unit.toNanos(timeout);
        int added = 0;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 18K bytes
    - Click Count (0)
Back to Top