Search Options

Results per page
Sort
Preferred Languages
Advance

Results 411 - 420 of 426 for iterable (0.25 sec)

  1. docs/de/docs/advanced/custom-response.md

    3. Dieses `yield from` weist die Funktion an, über das Ding namens `file_like` zu iterieren. Und dann für jeden iterierten Teil, diesen Teil so zurückzugeben, als wenn er aus dieser Generatorfunktion (`iterfile`) stammen würde.
    
        Es handelt sich also hier um eine Generatorfunktion, die die „generierende“ Arbeit intern auf etwas anderes überträgt.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  2. docs/pt/docs/advanced/custom-response.md

    3. Essa declaração `yield from` informa a função para iterar sobre essa coisa nomeada de `file_like`. E então, para cada parte iterada, fornece essa parte como se viesse dessa função geradora (`iterfile`).
    
        Então, é uma função geradora que transfere o trabalho de "geração" para alguma outra coisa interna.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 13.2K bytes
    - Viewed (0)
  3. docs/en/docs/advanced/custom-response.md

    3. This `yield from` tells the function to iterate over that thing named `file_like`. And then, for each part iterated, yield that part as coming from this generator function (`iterfile`).
    
        So, it is a generator function that transfers the "generating" work to something else internally.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 12.2K bytes
    - Viewed (0)
  4. guava/src/com/google/common/net/InetAddresses.java

        if (IPV4_DELIMITER_MATCHER.countIn(ipString) + 1 != IPV4_PART_COUNT) {
          return null; // Wrong number of parts
        }
    
        byte[] bytes = new byte[IPV4_PART_COUNT];
        int start = 0;
        // Iterate through the parts of the ip string.
        // Invariant: start is always the beginning of an octet.
        for (int i = 0; i < IPV4_PART_COUNT; i++) {
          int end = ipString.indexOf(IPV4_DELIMITER, start);
          if (end == -1) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 19 21:24:11 UTC 2025
    - 47.4K bytes
    - Viewed (0)
  5. src/main/java/jcifs/smb/SmbTransportPoolImpl.java

         */
        private void removeIdleConnections() {
            long now = System.currentTimeMillis();
            List<SmbTransportImpl> idle = new ArrayList<>();
    
            // Iterate through connections without synchronization - ConcurrentLinkedQueue is thread-safe
            for (SmbTransportImpl transport : connections) {
                try {
                    // Check if connection has been idle too long
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 33.4K bytes
    - Viewed (0)
  6. RELEASE.md

    *   Introduce ops for batching/unbatching tensors across Session::Run() calls.
    *   Add tf.log_sigmoid(x) = tf.log(tf.sigmoid(x)) = -tf.nn.softplus(-x).
    *   Changed hooks lists to immutable tuples, and now allow any iterable for the
        associated arguments.
    *   Introduce TFDecorator.
    *   Added an Mfcc op for speech feature generation.
    *   Improved DirectSession::Run() overhead and error checking. Feeding a value
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  7. android/guava/src/com/google/common/net/InetAddresses.java

        if (IPV4_DELIMITER_MATCHER.countIn(ipString) + 1 != IPV4_PART_COUNT) {
          return null; // Wrong number of parts
        }
    
        byte[] bytes = new byte[IPV4_PART_COUNT];
        int start = 0;
        // Iterate through the parts of the ip string.
        // Invariant: start is always the beginning of an octet.
        for (int i = 0; i < IPV4_PART_COUNT; i++) {
          int end = ipString.indexOf(IPV4_DELIMITER, start);
          if (end == -1) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 19 21:24:11 UTC 2025
    - 47.4K bytes
    - Viewed (0)
  8. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/DefaultLegacyArtifactCollector.java

            fireEvent(ResolutionListener.TEST_ARTIFACT, listeners, node);
    
            Object key = node.getKey();
    
            // TODO Does this check need to happen here? Had to add the same call
            // below when we iterate on child nodes -- will that suffice?
            if (managedVersions.containsKey(key)) {
                manageArtifact(node, managedVersions, listeners);
            }
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 36.5K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/helper/SearchHelper.java

                }
            }
            return documentItems;
        }
    
        /**
         * Performs a scroll search for processing large result sets efficiently.
         *
         * This method uses OpenSearch scroll API to iterate through large numbers of
         * documents without loading them all into memory at once.
         *
         * @param params The search request parameters
         * @param cursor Function to process each document in the result set
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 35.8K bytes
    - Viewed (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt

       * to do so leaks open files!
       */
      @Synchronized
      @Throws(IOException::class)
      fun snapshots(): MutableIterator<Snapshot> {
        initialize()
        return object : MutableIterator<Snapshot> {
          /** Iterate a copy of the entries to defend against concurrent modification errors. */
          private val delegate = ArrayList(lruEntries.values).iterator()
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed May 28 23:28:25 UTC 2025
    - 34.7K bytes
    - Viewed (0)
Back to top