[#llvm-GraphTraits-00]
= xref:llvm.adoc[llvm]::xref:llvm/GraphTraits-061.adoc[GraphTraits]<xref:llvm/LazyCallGraph/Node.adoc[LazyCallGraph::Node]*>
:relfileprefix: ../
:mrdocs:

GraphTraits specialization for LazyCallGraph nodes.

== Synopsis

Declared in `<llvm/Analysis/LazyCallGraph.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<>
struct xref:llvm/GraphTraits-061.adoc[GraphTraits]<xref:llvm/LazyCallGraph/Node.adoc[LazyCallGraph::Node]*>;
----

== Type Aliases

[cols="1,4"]
|===
| Name| Description
| xref:llvm/GraphTraits-00/ChildIteratorType.adoc[`ChildIteratorType`] 
| Iterator over outgoing edges from a node.
| xref:llvm/GraphTraits-00/NodeRef.adoc[`NodeRef`] 
| Graph node type for a LazyCallGraph::Node.
|===


== Static Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:llvm/GraphTraits-00/child_begin.adoc[`child_begin`] 
| Return the begin iterator over children of `N.`
| xref:llvm/GraphTraits-00/child_end.adoc[`child_end`] 
| Return the end iterator over children of `N.`
| xref:llvm/GraphTraits-00/getEntryNode.adoc[`getEntryNode`] 
| Return `N` as the graph entry node.
|===



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