Write the next ready node to an output iterator.
Declared in <bdlb_topologicalsortutil.h>
template<class OUTPUT_ITER>
bool
processNextNodeInOrder(OUTPUT_ITER* resultOutIter_p);Write the next element in order that doesn't have any predecessors into the specified resultOutIter_p output iterator then increment it and return true. If there are still elements left but all of them still have predecessors do nothing and return false. The behavior is undefined unless !d_workSet.empty().
true if a ready node was written, and false if remaining nodes still have predecessors
| Name | Description |
|---|---|
| resultOutIter_p | address of the output iterator for the next node |