Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 221 - 227 of 227 for COLUMN (0.12 seconds)

  1. CHANGELOG/CHANGELOG-1.14.md

    * Increase Azure default maximumLoadBalancerRuleCount to 250. ([#72621](https://github.com/kubernetes/kubernetes/pull/72621), [@feiskyer](https://github.com/feiskyer))
    * RuntimeClass is now printed with extra `RUNTIME-HANDLER` column. ([#72446](https://github.com/kubernetes/kubernetes/pull/72446), [@Huang-Wei](https://github.com/Huang-Wei))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Mon Jun 14 22:06:39 GMT 2021
    - 271.5K bytes
    - Click Count (0)
  2. CHANGELOG/CHANGELOG-1.8.md

    Kubernetes API supports retrieving tabular output for API resources via a new mime-type `application/json;as=Table;v=v1alpha1;g=meta.k8s.io`.  The returned object (if the server supports it) will be of type `meta.k8s.io/v1alpha1` with `Table`, and contain column and row information related to the resource.  Each row will contain information about the resource - by default it will be the object metadata, but callers can add the `?includeObject=Object` query parameter and receive the full object.  In the future...
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Tue Feb 20 15:45:02 GMT 2024
    - 312.2K bytes
    - Click Count (0)
  3. CHANGELOG/CHANGELOG-1.21.md

    - Kubectl: Fixed panic when describing an ingress backend without an API Group ([#100505](https://github.com/kubernetes/kubernetes/pull/100505), [@lauchokyip](https://github.com/lauchokyip)) [SIG CLI]
    - Kubectl: fix case of age column in describe node (#96963, @bl-ue) ([#96963](https://github.com/kubernetes/kubernetes/pull/96963), [@bl-ue](https://github.com/bl-ue)) [SIG CLI]
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Fri Oct 14 07:03:14 GMT 2022
    - 367.3K bytes
    - Click Count (0)
  4. api/go1.txt

    pkg encoding/csv, method (*Writer) Write([]string) error
    pkg encoding/csv, method (*Writer) WriteAll([][]string) error
    pkg encoding/csv, type ParseError struct
    pkg encoding/csv, type ParseError struct, Column int
    pkg encoding/csv, type ParseError struct, Err error
    pkg encoding/csv, type ParseError struct, Line int
    pkg encoding/csv, type Reader struct
    pkg encoding/csv, type Reader struct, Comma int32
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Aug 14 18:58:28 GMT 2013
    - 1.7M bytes
    - Click Count (0)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  6. docs/en/docs/release-notes.md

    The sequence of execution before FastAPI 0.106.0 was 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 Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  7. lib/fips140/v1.1.0-rc1.zip

    Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top