[#BloombergLP-bdlb-TopologicalSortUtil_Helper-processNextNodeInOrder]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlb.adoc[bdlb]::xref:BloombergLP/bdlb/TopologicalSortUtil_Helper.adoc[TopologicalSortUtil&lowbar;Helper]::processNextNodeInOrder
:relfileprefix: ../../../
:mrdocs:

Write the next element in order that doesn&apos;t have any predecessors into the specified `resultOutIter&lowbar;p` output iterator then increment it and return `true`&period; If there are still elements left but all of them still have predecessors do nothing and return `false`&period; The behavior is undefined unless `!d&lowbar;workSet&period;empty()`&period;

== Synopsis

Declared in `&lt;bdlb&lowbar;topologicalsortutil&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;class OUTPUT&lowbar;ITER&gt;
bool
processNextNodeInOrder(OUTPUT&lowbar;ITER* resultOutIter&lowbar;p);
----


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