Search Options

Results per page
Sort
Preferred Languages
Advance

Results 161 - 170 of 976 for non (0.05 sec)

  1. CHANGELOG/OWNERS

    # See the OWNERS docs at https://go.k8s.io/owners
    
    options:
      # make root approval non-recursive
      no_parent_owners: true
    approvers:
      - release-engineering-approvers
      - release-managers
      - release-team-subproject-leads
      - satyampsoni # 1.32 Release Notes Lead
    reviewers:
      - release-managers
      - release-team-subproject-leads
      - satyampsoni # 1.32 Release Notes Lead
    labels:
      - sig/release
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Dec 12 18:04:32 UTC 2024
    - 417 bytes
    - Viewed (0)
  2. docs/bucket/lifecycle/README.md

    ### 3.1 Automatic removal of non current objects versions
    
    A non-current object version is a version which is not the latest for a given object. It is possible to set up an automatic removal of non-current versions when a version becomes older than a given number of days.
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  3. src/cmd/asm/internal/asm/testdata/amd64error.s

    	MOVL	(AX)(SP*1), AX		// ERROR "invalid instruction"
    	EXTRACTPS $4, X2, (BX)          // ERROR "invalid instruction"
    	EXTRACTPS $-1, X2, (BX)         // ERROR "invalid instruction"
    	// VSIB addressing does not permit non-vector (X/Y)
    	// scaled index register.
    	VPGATHERDQ X12,(R13)(AX*2), X11 // ERROR "invalid instruction"
    	VPGATHERDQ X2, 664(BX*1), X1    // ERROR "invalid instruction"
    	VPGATHERDQ Y2, (BP)(AX*2), Y1   // ERROR "invalid instruction"
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jun 14 00:03:57 UTC 2023
    - 8.9K bytes
    - Viewed (0)
  4. api/maven-api-annotations/src/main/java/org/apache/maven/api/annotations/package-info.java

    // CHECKSTYLE_OFF: RegexpHeader
    /**
     * This package contains non-functional annotations which are
     * used to tag various elements and help users understanding
     * how those types should be used.
     *
     * @since 4.0.0
     */
    @Experimental
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Tue Dec 10 21:43:27 UTC 2024
    - 273 bytes
    - Viewed (0)
  5. okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerAdapter.kt

       *
       * ```
       * [5] EXPLICIT UTF8String
       * ```
       *
       * @param forceConstructed non-null to set the constructed bit to the specified value, even if the
       *     writing process sets something else. This is used to encode SEQUENCES in values that are
       *     declared to have non-constructed values, like OCTET STRING values.
       */
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/internal/tls/CertificatePinnerChainValidationTest.kt

       * ```
       *
       * The attacker compromises a CA. They take the public key from an intermediate certificate
       * signed by the compromised CA's certificate and uses it in a non-CA certificate. They ask the
       * pinned CA above to sign it for non-certificate-authority uses:
       *
       * ```
       *   pinnedRoot (trusted by CertificatePinner)
       *     -> pinnedIntermediate (trusted by CertificatePinner)
       *         -> attackerSwitch
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Jun 20 11:46:46 UTC 2025
    - 24.3K bytes
    - Viewed (2)
  7. android/guava/src/com/google/common/graph/Graphs.java

      // Graph query methods
    
      /**
       * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/Graphs.java

      // Graph query methods
    
      /**
       * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  9. .github/OWNERS

    # See the OWNERS docs at https://go.k8s.io/owners
    
    options:
      # make root approval non-recursive
      no_parent_owners: true
    reviewers:
      - alisondy
      - cblecker
      - guineveresaenger
      - mrbobbytables
      - nikhita
      - parispittman
      - palnabarun
      - kaslin
      - MadhavJivrajani
      - mfahlandt
      - Priyankasaggu11929
    approvers:
      - sig-contributor-experience-approvers
      - parispittman
    emeritus_approvers:
      - castrojo
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri Feb 14 19:23:30 UTC 2025
    - 464 bytes
    - Viewed (0)
  10. LICENSE.txt

          subsequently incorporated within the Work.
    
       2. Grant of Copyright License. Subject to the terms and conditions of
          this License, each Contributor hereby grants to You a perpetual,
          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
          copyright license to reproduce, prepare Derivative Works of,
          publicly display, publicly perform, sublicense, and distribute the
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Mon Jul 23 14:02:28 UTC 2012
    - 11.1K bytes
    - Viewed (0)
Back to top