Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1621 - 1630 of 1,876 for breathe (0.05 sec)

  1. cni/pkg/nodeagent/net.go

    // AddPodToMesh adds a pod to mesh by
    // 1. Getting the netns
    // 2. Adding the pod's IPs to the hostnetns ipsets for node probe checks
    // 3. Creating iptables rules inside the pod's netns
    // 4. Notifying ztunnel via GRPC to create a proxy for the pod
    //
    // You may ask why we pass the pod IPs separately from the pod manifest itself (which contains the pod IPs as a field)
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Oct 21 16:48:55 UTC 2024
    - 9.1K bytes
    - Viewed (0)
  2. common-protos/k8s.io/api/rbac/v1alpha1/generated.proto

    // AggregationRule describes how to locate ClusterRoles to aggregate into the ClusterRole
    message AggregationRule {
      // ClusterRoleSelectors holds a list of selectors which will be used to find ClusterRoles and create the rules.
      // If any of the selectors match, then the ClusterRole's permissions will be added
      // +optional
      repeated k8s.io.apimachinery.pkg.apis.meta.v1.LabelSelector clusterRoleSelectors = 1;
    }
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  3. common-protos/k8s.io/api/storage/v1alpha1/generated.proto

      // previous fields.
      //
      // This is defined since CSI spec 1.4.0 as the largest size
      // that may be used in a
      // CreateVolumeRequest.capacity_range.required_bytes field to
      // create a volume with the same parameters as those in
      // GetCapacityRequest. The corresponding value in the Kubernetes
      // API is ResourceRequirements.Requests in a volume claim.
      //
      // +optional
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 9.4K bytes
    - Viewed (0)
  4. cmd/erasure-server-pool-rebalance.go

    			if z.checkIfRebalanceDone(poolIdx) {
    				return
    			}
    
    			fivs, err := entry.fileInfoVersions(bucket)
    			if err != nil {
    				return
    			}
    
    			// We need a reversed order for rebalance,
    			// to create the appropriate stack.
    			versionsSorter(fivs.Versions).reverse()
    
    			var rebalanced, expired int
    			for _, version := range fivs.Versions {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 06 13:20:19 UTC 2024
    - 28.4K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/helper/DocumentHelper.java

                    try {
                        return (Map<String, Object>) SerializeUtil.fromBinaryToObject(data);
                    } catch (final Exception e) {
                        throw new CrawlerSystemException("Could not create an instance from bytes.", e);
                    }
                }
                return null;
            } catch (final Exception e) {
                throw new CrawlingAccessException("Failed to parse " + url, e);
            }
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 22 01:53:18 UTC 2024
    - 12K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/util/concurrent/AbstractExecutionThreadServiceTest.java

        WaitOnRunService service = new WaitOnRunService();
        service.startAsync().awaitRunning();
        enterRun.await();
        service.stopAsync().awaitTerminated();
      }
    
      public void testTimeout() {
        // Create a service whose executor will never run its commands
        Service service =
            new AbstractExecutionThreadService() {
              @Override
              protected void run() throws Exception {}
    
              @Override
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 22:10:29 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/util/concurrent/SequentialExecutorTest.java

        }
      }
    
      public void testRejectedExecutionThrownWithMultipleCalls() throws Exception {
        final CountDownLatch latch = new CountDownLatch(1);
        final SettableFuture<?> future = SettableFuture.create();
        final Executor delegate =
            new Executor() {
              @Override
              public void execute(Runnable task) {
                if (future.set(null)) {
                  awaitUninterruptibly(latch);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 22:10:29 UTC 2024
    - 11.4K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/RegularImmutableBiMap.java

            checkNoConflictInValueBucket(value, entry, nextInValueBucket);
          } catch (BucketOverflowException e) {
            return JdkBackedImmutableBiMap.create(n, entryArray);
          }
          ImmutableMapEntry<K, V> newEntry =
              (nextInValueBucket == null && nextInKeyBucket == null)
                  ? RegularImmutableMap.makeImmutable(entry, key, value)
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 11.3K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/body.md

    ///
    
    ## Import Pydantic's `BaseModel`
    
    First, you need to import `BaseModel` from `pydantic`:
    
    {* ../../docs_src/body/tutorial001_py310.py hl[2] *}
    
    ## Create your data model
    
    Then you declare your data model as a class that inherits from `BaseModel`.
    
    Use standard Python types for all the attributes:
    
    {* ../../docs_src/body/tutorial001_py310.py hl[5:9] *}
    
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 16:58:19 UTC 2024
    - 6.6K bytes
    - Viewed (0)
  10. tensorflow/c/c_api_experimental_test.cc

          TFE_Op* op,
          const std::vector<absl::optional<std::vector<int64_t>>>& input_shapes_vec,
          const std::vector<TF_Tensor*>& input_tensors,
          const absl::optional<std::vector<int64_t>>& expected_shape) {
        // Create input_shapes.
        TF_ShapeAndTypeList* input_shapes =
            TF_NewShapeAndTypeList(input_shapes_vec.size());
        for (size_t i = 0; i < input_shapes_vec.size(); ++i) {
          const auto& input_shape = input_shapes_vec[i];
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Tue Jan 17 22:27:52 UTC 2023
    - 13.1K bytes
    - Viewed (0)
Back to top