ocelot/ocelot/analysis/implementation/DivergenceGraph.cpp
void DivergenceGraph::setAsDiv(const node_type &node)
{
	if (_divergenceSources.find(node) == _divergenceSources.end()) {
		_upToDate = false;
		_divergenceSources.insert(node);
	}
	if (nodes.find(node) == nodes.end()) {
		_upToDate = false;
		nodes.insert(node);
	}
}
/*!\brief Define a node as being divergent,
	not depending on it's predecessors */
\brief Define a node as being divergent,
not depending on it's predecessors
\ brief Define a node as being divergent not depending on it ' s predecessors
void DivergenceGraph::setAsDiv(const node_type &node)
{
	if (_divergenceSources.find(node) == _divergenceSources.end()) {
		_upToDate = false;
		_divergenceSources.insert(node);
	}
	if (nodes.find(node) == nodes.end()) {
		_upToDate = false;
		nodes.insert(node);
	}
}
void DivergenceGraph :: setAsDiv ( const node_type & node ) { if ( _divergenceSources . find ( node ) == _divergenceSources . end ( ) ) { _upToDate = false ; _divergenceSources . insert ( node ) ; } if ( nodes . find ( node ) == nodes . end ( ) ) { _upToDate = false ; nodes . insert ( node ) ; } }
\brief Define a node as being divergent,
not depending on it's predecessors
\ brief Define a node as being divergent not depending on it ' s predecessors