[#BloombergLP-bdlb-TopologicalSortUtil_Helper-processNextNodeInOrder]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlb.adoc[bdlb]::xref:BloombergLP/bdlb/TopologicalSortUtil_Helper.adoc[TopologicalSortUtil_Helper]::processNextNodeInOrder
:relfileprefix: ../../../
:mrdocs:

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()`.

== Synopsis

Declared in `<bdlb_topologicalsortutil.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class OUTPUT_ITER>
bool
processNextNodeInOrder(OUTPUT_ITER* resultOutIter_p);
----


[.small]#Created with https://www.mrdocs.com[MrDocs]#