Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for next_itr (0.39 sec)

  1. android/guava/src/com/google/common/collect/Iterators.java

          return !queue.isEmpty();
        }
    
        @Override
        @ParametricNullness
        public T next() {
          PeekingIterator<T> nextIter = queue.remove();
          T next = nextIter.next();
          if (nextIter.hasNext()) {
            queue.add(nextIter);
          }
          return next;
        }
      }
    
      private static class ConcatenatedIterator<T extends @Nullable Object> implements Iterator<T> {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri May 03 14:46:32 UTC 2024
    - 50.2K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/Iterators.java

          return !queue.isEmpty();
        }
    
        @Override
        @ParametricNullness
        public T next() {
          PeekingIterator<T> nextIter = queue.remove();
          T next = nextIter.next();
          if (nextIter.hasNext()) {
            queue.add(nextIter);
          }
          return next;
        }
      }
    
      private static class ConcatenatedIterator<T extends @Nullable Object> implements Iterator<T> {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri May 03 14:46:32 UTC 2024
    - 50.2K bytes
    - Viewed (0)
  3. tensorflow/compiler/jit/mark_for_compilation_pass_test.cc

      auto b = ops::Placeholder(root.WithOpName("B"), DT_FLOAT);
      auto c = ops::Add(root.WithOpName("C"), a, b);
      auto enter = ops::internal::Enter(root, c, "aframe");
      auto next_iter = ops::NextIteration(root, enter);
      auto exit = ops::internal::Exit(root, next_iter);
      auto d = ops::Add(root.WithOpName("D"), c, exit);
    
      std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
      TF_EXPECT_OK(root.ToGraph(graph.get()));
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Feb 14 10:11:10 UTC 2024
    - 79.6K bytes
    - Viewed (0)
Back to top