Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 521 for step6 (0.11 seconds)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-HeadersCommon.kt

          append("\n")
        }
      }
    
    internal fun commonHeadersGet(
      namesAndValues: Array<String>,
      name: String,
    ): String? {
      for (i in namesAndValues.size - 2 downTo 0 step 2) {
        if (name.equals(namesAndValues[i], ignoreCase = true)) {
          return namesAndValues[i + 1]
        }
      }
      return null
    }
    
    internal fun Headers.Builder.commonAdd(
      name: String,
      value: String,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:02:18 GMT 2026
    - 6K bytes
    - Click Count (0)
  2. docs/en/docs/tutorial/index.md

    # Tutorial - User Guide { #tutorial-user-guide }
    
    This tutorial shows you how to use **FastAPI** with most of its features, step by step.
    
    Each section gradually builds on the previous ones, but it's structured to separate topics, so that you can go directly to any specific one to solve your specific API needs.
    
    It is also built to work as a future reference so you can come back and see exactly what you need.
    
    ## Run the code { #run-the-code }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 5.3K bytes
    - Click Count (0)
  3. tensorflow/c/eager/gradient_checker.cc

    namespace gradients {
    
    using namespace std;
    
    // ================== Helper functions =================
    
    // Fills data with values [start,end) with given step size.
    void Range(vector<int32_t>* data, int32_t start, int32_t end,
               int32_t step = 1) {
      for (int32_t i = start; i < end; i += step) {
        (*data)[i] = i;
      }
    }
    
    // Fills out_dims with the dimensions of the given tensor.
    void GetDims(const TF_Tensor* t, int64_t* out_dims) {
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 7.3K bytes
    - Click Count (0)
  4. .github/workflows/lock.yml

    name: 'Lock Threads'
    
    on:
      schedule:
        - cron: '0 0 * * *'
      workflow_dispatch:
    
    permissions:
      issues: write
    
    concurrency:
      group: lock
    
    jobs:
      action:
        runs-on: ubuntu-latest
        steps:
          - uses: dessant/lock-threads@v3
            with:
              github-token: ${{ github.token }}
              issue-inactive-days: '365'
              exclude-any-issue-labels: 'do-not-close'
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Jan 30 03:27:43 GMT 2022
    - 447 bytes
    - Click Count (0)
  5. helm/minio/templates/NOTES.txt

    Read more about port forwarding here: http://kubernetes.io/docs/user-guide/kubectl/kubectl_port-forward/
    
    You can now access MinIO server on http://localhost:9000. Follow the below steps to connect to MinIO server with mc client:
    
      1. Download the MinIO mc client - https://docs.min.io/community/minio-object-store/reference/minio-mc.html#quickstart
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  6. .github/workflows/publish.yml

    name: publish
    
    on:
      push:
        tags:
          - '**'
    
    env:
      GRADLE_OPTS: "-Dorg.gradle.jvmargs=-Xmx4g -Dorg.gradle.daemon=false -Dkotlin.incremental=false"
    
    jobs:
      publish:
        runs-on: macos-15
    
        steps:
          - uses: actions/checkout@v6
          - uses: actions/setup-java@v5
            with:
              distribution: 'temurin'
              java-version-file: .github/workflows/.java-version
    
          - run: ./gradlew publish
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Feb 03 22:17:59 GMT 2026
    - 787 bytes
    - Click Count (0)
  7. docs/en/docs/advanced/openapi-webhooks.md

    This is normally called a **webhook**.
    
    ## Webhooks steps { #webhooks-steps }
    
    The process normally is that **you define** in your code what is the message that you will send, the **body of the request**.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 2.9K bytes
    - Click Count (0)
  8. docs/en/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    {* ../../docs_src/pydantic_v1_in_v2/tutorial004_an_py310.py hl[4,18] *}
    
    ### Migrate in steps { #migrate-in-steps }
    
    /// tip
    
    First try with `bump-pydantic`, if your tests pass and that works, then you're done in one command. ✨
    
    ///
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 5.4K bytes
    - Click Count (0)
  9. tensorflow/c/eager/immediate_execution_context.h

      virtual void ClearCachesAndThreadExecutors() = 0;
    
      // Initialize the step resource container for a training step. This is used
      // in current TF runtime. For tfrt, it is used by fallback op handler.
      virtual void StartStep() = 0;
      // Destroy the step resource container for a training step.
      virtual void EndStep() = 0;
    
      // Return the Eager Executor for current thread. Please note that Eager
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 12.3K bytes
    - Click Count (0)
  10. .github/workflows/vulncheck.yml

          - master
    
      push:
        branches:
          - master
    
    permissions:
      contents: read # to fetch code (actions/checkout)
    
    jobs:
      vulncheck:
        name: Analysis
        runs-on: ubuntu-latest
        steps:
          - name: Check out code into the Go module directory
            uses: actions/checkout@v4
          - name: Set up Go
            uses: actions/setup-go@v5
            with:
              go-version: 1.24.x
              cached: false
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Apr 24 23:34:11 GMT 2025
    - 682 bytes
    - Click Count (0)
Back to Top