Search Options

Results per page
Sort
Preferred Languages
Advance

Results 3351 - 3360 of about 10,000 for four (0.09 sec)

  1. common-protos/k8s.io/api/rbac/v1alpha1/generated.proto

      // +optional
      optional k8s.io.apimachinery.pkg.apis.meta.v1.ObjectMeta metadata = 1;
    
      // Rules holds all the PolicyRules for this ClusterRole
      // +optional
      repeated PolicyRule rules = 2;
    
      // AggregationRule is an optional field that describes how to build the Rules for this ClusterRole.
      // If AggregationRule is set, then the Rules are controller managed and direct changes to Rules will be
      // stomped by the controller.
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  2. okhttp/src/main/kotlin/okhttp3/internal/connection/RoutePlanner.kt

     *     the same connection for an initial exchange and its follow-ups may improve locality.
     *
     *  2. If there is a connection in the pool that can satisfy the request it is used. Note that it is
     *     possible for shared exchanges to make requests to different host names! See
     *     [RealConnection.isEligible] for details.
     *
     *  3. Attempt plans from prior connect attempts for this call. These occur as either follow-ups to
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Wed Dec 20 23:27:07 UTC 2023
    - 4.2K bytes
    - Viewed (0)
  3. compat/maven-compat/src/main/resources/META-INF/maven/plugin-expressions/project.paramdoc.xml

        <description> This is the Artifact instance for the parent of the current POM.
        </description>
      </expression>
      <expression>
        <syntax>project.pluginArtifacts</syntax>
        <configuration>
          <![CDATA[
    <build>
      <plugins>
        ...
      </plugins>
    </build>
        ]]></configuration>
        <description>
          <![CDATA[
          This is the list of Artifact instances for plugins used in the current build
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  4. ci/official/utilities/rename_and_verify_wheels.sh

    # 'k' for kilobytes, 'M' for megabytes, or 'G' for gigabytes, and the + to indicate
    # "anything greater than" is added by the script.
    if [[ "$TFCI_WHL_SIZE_LIMIT_ENABLE" == "1" ]] && [[ -n "$(find . -iname "*.whl" -size "+$TFCI_WHL_SIZE_LIMIT")" ]]; then
      echo "Error: Generated wheel is too big! Limit is $TFCI_WHL_SIZE_LIMIT"
      echo '(search for TFCI_WHL_SIZE_LIMIT to change it)'
      ls -sh *.whl
      exit 2
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Wed Oct 02 21:18:17 UTC 2024
    - 4.3K bytes
    - Viewed (0)
  5. src/main/webapp/js/jquery-3.7.1.min.js

    turn[t-1]}),eq:X(function(e,t,n){return[n<0?n+t:n]}),even:X(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:X(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:X(function(e,t,n){var r;for(r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:X(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=B(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=_(e);function G(){}function Y(e,t){var...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 85.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/ListMultimap.java

    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * A {@code Multimap} that can hold duplicate key-value pairs and that maintains the insertion
     * ordering of values for a given key. See the {@link Multimap} documentation for information common
     * to all multimaps.
     *
     * <p>The {@link #get}, {@link #removeAll}, and {@link #replaceValues} methods each return a {@link
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 24 17:47:51 UTC 2022
    - 3.5K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/graph/GraphMutationTest.java

          int numNodesToRemove = gen.nextInt(NUM_NODES);
          for (int i = 0; i < numNodesToRemove; ++i) {
            assertThat(graph.removeNode(nodeList.get(i))).isTrue();
          }
    
          assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove);
          // Number of edges remaining is unknown (node's incident edges have been removed).
          AbstractGraphTest.validateGraph(graph);
    
          for (int i = numNodesToRemove; i < NUM_NODES; ++i) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Aug 18 16:17:46 UTC 2017
    - 4.2K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/ListMultimap.java

    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * A {@code Multimap} that can hold duplicate key-value pairs and that maintains the insertion
     * ordering of values for a given key. See the {@link Multimap} documentation for information common
     * to all multimaps.
     *
     * <p>The {@link #get}, {@link #removeAll}, and {@link #replaceValues} methods each return a {@link
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 24 17:47:51 UTC 2022
    - 3.5K bytes
    - Viewed (0)
  9. src/bytes/boundary_test.go

    }
    
    func TestEqualNearPageBoundary(t *testing.T) {
    	t.Parallel()
    	b := dangerousSlice(t)
    	for i := range b {
    		b[i] = 'A'
    	}
    	for i := 0; i <= len(b); i++ {
    		Equal(b[:i], b[len(b)-i:])
    		Equal(b[len(b)-i:], b[:i])
    	}
    }
    
    func TestIndexByteNearPageBoundary(t *testing.T) {
    	t.Parallel()
    	b := dangerousSlice(t)
    	for i := range b {
    		idx := IndexByte(b[i:], 1)
    		if idx != -1 {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Nov 30 20:05:58 UTC 2023
    - 2.8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/Striped.java

          return ImmutableList.of();
        }
        int[] stripes = new int[result.size()];
        for (int i = 0; i < result.size(); i++) {
          stripes[i] = indexFor(result.get(i));
        }
        Arrays.sort(stripes);
        // optimize for runs of identical stripes
        int previousStripe = stripes[0];
        result.set(0, getAt(previousStripe));
        for (int i = 1; i < result.size(); i++) {
          int currentStripe = stripes[i];
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Jun 26 12:58:35 UTC 2024
    - 20.6K bytes
    - Viewed (0)
Back to top