Search Options

Results per page
Sort
Preferred Languages
Advance

Results 191 - 200 of 270 for Consumer (0.1 sec)

  1. common-protos/k8s.io/api/events/v1beta1/generated.proto

    // Event is a report of an event somewhere in the cluster. It generally denotes some state change in the system.
    // Events have a limited retention time and triggers and messages may evolve
    // with time.  Event consumers should not rely on the timing of an event
    // with a given Reason reflecting a consistent underlying trigger, or the
    // continued existence of events with that Reason.  Events should be
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 5.2K bytes
    - Viewed (0)
  2. docs/kms/IAM.md

    - Reduced server startup time. For IAM encryption with the root credentials, MinIO had
       to use a memory-hard function (Argon2) that (on purpose) consumes a lot of memory and CPU.
       The new KMS-based approach can use a key derivation function that is orders of magnitudes
       cheaper w.r.t. memory and CPU.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  3. tensorflow/c/eager/gradients.h

          absl::Span<const AbstractTensorHandle* const> tensors) const;
      // Unwatches this tensor on the tape. Mainly used for cleanup when deleting
      // eager tensors.
      void DeleteTrace(const AbstractTensorHandle*);
    
      // Consumes the internal state of the tape (so cannot be called more than
      // once unless the tape is persistent) and produces the gradient of the target
      // tensors with respect to the source tensors. The output gradients are used
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  4. common-protos/k8s.io/api/events/v1/generated.proto

    // Event is a report of an event somewhere in the cluster. It generally denotes some state change in the system.
    // Events have a limited retention time and triggers and messages may evolve
    // with time.  Event consumers should not rely on the timing of an event
    // with a given Reason reflecting a consistent underlying trigger, or the
    // continued existence of events with that Reason.  Events should be
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  5. okhttp/src/main/kotlin/okhttp3/MultipartReader.kt

          // Read a boundary, skipping the remainder of the preceding part as necessary.
          if (partCount == 0 && source.rangeEquals(0L, dashDashBoundary)) {
            // This is the first part. Consume "--" followed by the boundary.
            source.skip(dashDashBoundary.size.toLong())
          } else {
            // This is a subsequent part or a preamble. Skip until "\r\n--" followed by the boundary.
            while (true) {
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  6. common-protos/k8s.io/api/storage/v1alpha1/generated.proto

    // - such an object exists, but the capacity is unset
    // - such an object exists, but the capacity is zero
    //
    // The producer of these objects can decide which approach is more suitable.
    //
    // They are consumed by the kube-scheduler when a CSI driver opts into
    // capacity-aware scheduling with CSIDriverSpec.StorageCapacity. The scheduler
    // compares the MaximumVolumeSize against the requested size of pending volumes
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 9.4K bytes
    - Viewed (0)
  7. docs/en/docs/help-fastapi.md

    * Then check that the tests **pass** after the PR. ✅
    
    * Many PRs don't have tests, you can **remind** them to add tests, or you can even **suggest** some tests yourself. That's one of the things that consume most time and you can help a lot with that.
    
    * Then also comment what you tried, that way I'll know that you checked it. 🤓
    
    ## Create a Pull Request
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu Aug 15 23:30:12 UTC 2024
    - 13.7K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb/DfsImpl.java

                        dr.stripPathConsumed(1 + domain.length() + 1 + root.length());
    
                        if ( dr.getPathConsumed() > ( path != null ? path.length() : 0 ) ) {
                            log.error("Consumed more than we provided");
                        }
    
                        link = path != null && dr.getPathConsumed() > 0 ? path.substring(0, dr.getPathConsumed()) : "\\";
                        dr.setLink(link);
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Thu Jan 05 13:07:29 UTC 2023
    - 29.1K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java

          service.shutdown();
        }
        assertThat(holder.count).isEqualTo(ITERATION_COUNT);
        for (int length : completeLengthChecks) {
          // Verify that at max depth, less than one stack frame per submitted task was consumed
          assertThat(length - baseStackDepth).isLessThan(DIRECT_EXECUTIONS_PER_THREAD / 2);
        }
      }
    
      @SuppressWarnings("ObjectToString") // Intended behavior
      public void testToString() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 22:10:29 UTC 2024
    - 16.7K bytes
    - Viewed (0)
  10. guava/src/com/google/common/io/CharStreams.java

       * or all lines have been read and returning the result produced by the processor. Does not close
       * {@code readable}. Note that this method may not fully consume the contents of {@code readable}
       * if the processor stops processing early.
       *
       * @throws IOException if an I/O error occurs
       * @since 14.0
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed May 17 14:35:11 UTC 2023
    - 10.9K bytes
    - Viewed (0)
Back to top