C++ (Cpp) prepareNext Examples

Example #1

File: GraphIterator.cpp Project: vadivelselvaraj/TulipGLImprovement

edge InOutEdgesIterator::next() {
  assert(curEdge.isValid());
  // we are already pointing to the next
  edge tmp=curEdge;
  // anticipating the next iteration
  prepareNext();
  return tmp;
}

Example #2

File: GraphIterator.cpp Project: vadivelselvaraj/TulipGLImprovement

//===============================================================
SGraphEdgeIterator::SGraphEdgeIterator(const Graph *sG, const MutableContainer<bool>& filter, bool val):FactorEdgeIterator(sG,filter), sg(sG), value(val) {
  it=_parentGraph->getEdges();
#if !defined(NDEBUG) && !defined(_OPENMP)
  _parentGraph->addListener(this);
#endif
  // anticipate first iteration
  prepareNext();
}

Example #3

File: GraphIterator.cpp Project: vadivelselvaraj/TulipGLImprovement

node SGraphNodeIterator::next() {
  assert(curNode.isValid());
  // we are already pointing to the next
  node tmp = curNode;
  // anticipate next iteration
  prepareNext();
  return tmp;
}

Example #4

File: GraphIterator.cpp Project: vadivelselvaraj/TulipGLImprovement

//===================================================================
InOutEdgesIterator::InOutEdgesIterator(const Graph *sG,const MutableContainer<bool>& filter, node n):FactorEdgeIterator(sG,filter) {
  assert(sG->isElement(n));
  it=_parentGraph->getInOutEdges(n);
#if !defined(NDEBUG) && !defined(_OPENMP)
  _parentGraph->addListener(this);
#endif
  // anticipate first iteration
  prepareNext();
}

Example #5

File: flatten-nested-list-iterator_1_AC.cpp Project: Septemberchar/leetcode-2

 bool hasNext() {
     prepareNext();
     return !arr.empty();
 }

Example #6

File: flatten-nested-list-iterator_1_AC.cpp Project: Septemberchar/leetcode-2

 int next() {
     prepareNext();
     int res = (*arr.top())[pos.top()].getInteger();
     ++pos.top();
     return res;
 }