Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 128 for Step (0.49 sec)

  1. docs/en/docs/virtual-environments.md

    /// tip
    
    If you used <a href="https://github.com/astral-sh/uv" class="external-link" target="_blank">`uv`</a> to create the virtual environment, it already did this for you, you can skip this step. 😎
    
    ///
    
    /// tip
    
    Do this **once**, right after you create the virtual environment.
    
    ///
    
    <div class="termy">
    
    ```console
    $ echo "*" > .venv/.gitignore
    ```
    
    </div>
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Tue Dec 02 05:09:25 UTC 2025
    - 22.8K bytes
    - Viewed (0)
  2. src/main/webapp/css/admin/font-awesome.min.css

    of-david:before{content:"\f69a"}.fa-star-of-life:before{content:"\f621"}.fa-staylinked:before{content:"\f3f5"}.fa-steam:before{content:"\f1b6"}.fa-steam-square:before{content:"\f1b7"}.fa-steam-symbol:before{content:"\f3f6"}.fa-step-backward:before{content:"\f048"}.fa-step-forward:before{content:"\f051"}.fa-stethoscope:before{content:"\f0f1"}.fa-sticker-mule:before{content:"\f3f7"}.fa-sticky-note:before{content:"\f249"}.fa-stop:before{content:"\f04d"}.fa-stop-circle:before{content:"\f28d"}.fa-sto...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (0)
  3. docs/en/docs/alternatives.md

    It used custom types in its declarations instead of standard Python types, but it was still a huge step forward.
    
    It also was one of the first frameworks to generate a custom schema declaring the whole API in JSON.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Oct 11 17:48:49 UTC 2025
    - 23.6K bytes
    - Viewed (0)
  4. docs/en/docs/async.md

    Then you go to the counter 🔀, to the initial task that is now finished ⏯, pick the burgers, say thanks and take them to the table. That finishes that step / task of interaction with the counter ⏹. That in turn, creates a new task, of "eating burgers" 🔀 ⏯, but the previous one of "getting burgers" is finished ⏹.
    
    ### Parallel Burgers { #parallel-burgers }
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24K bytes
    - Viewed (0)
  5. LICENSE

    with the library after making changes to the library and recompiling
    it.  And you must show them these terms so they know their rights.
    
      We protect your rights with a two-step method: (1) we copyright the
    library, and (2) we offer you this license, which gives you legal
    permission to copy, distribute and/or modify the library.
    
      To protect each distributor, we want to make it very clear that
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Mon Jan 18 20:25:38 UTC 2016
    - 25.8K bytes
    - Viewed (0)
  6. src/cmd/api/main_test.go

    		log.Fatal(err)
    	}
    	s := string(bs)
    
    	// Diagnose common mistakes people make,
    	// since there is no apifmt to format these files.
    	// The missing final newline is important for the
    	// final release step of cat next/*.txt >go1.X.txt.
    	// If the files don't end in full lines, the concatenation goes awry.
    	if strings.Contains(s, "\r") {
    		log.Printf("%s: contains CRLFs", filename)
    		exitCode = 1
    	}
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Feb 20 03:25:33 UTC 2025
    - 31.4K bytes
    - Viewed (0)
  7. lib/fips140/v1.0.0-c2097c7c.zip

    the i-th digit. // // Instead of running two loops, one for Step 1 and one for Steps 2–6, // the result of Step 1 is computed during the next loop. This is // possible because each iteration only uses T[i] in Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  8. lib/fips140/v1.1.0-rc1.zip

    the i-th digit. // // Instead of running two loops, one for Step 1 and one for Steps 2–6, // the result of Step 1 is computed during the next loop. This is // possible because each iteration only uses T[i] in Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
  9. CHANGELOG/CHANGELOG-1.35.md

    ### Other (Cleanup or Flake)
    
    - Added the `Step` field to the testing framework to allow volume expansion in configurable step sizes for tests. ([#134760](https://github.com/kubernetes/kubernetes/pull/134760), [@Rishita-Golla](https://github.com/Rishita-Golla)) [SIG Storage and Testing]
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Dec 17 13:01:55 UTC 2025
    - 228.5K bytes
    - Viewed (0)
  10. RELEASE.md

            or a list/tuple of arrays into two `Dataset` objects (e.g. train/test).
        *   Added step granularity to `BackupAndRestore` callback for handling
            distributed training failures & restarts. The training state can now be
            restored at the exact epoch and step at which it was previously saved
            before failing.
        *   Added
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Tue Oct 28 22:27:41 UTC 2025
    - 740.4K bytes
    - Viewed (3)
Back to top