Data Structures | |
struct | std::hash< CmiUInt16 > |
struct | iterator_traits |
struct | std::iterator_traits< T * > |
class | vector |
STL class. | |
Functions | |
template<class Container, class Iterator> | |
insert_iterator< Container > | inserter (Container &_Cont, Iterator _It) |
template<class Iterator> | |
int | distance (Iterator first, Iterator last) |
insert_iterator<Container> std::inserter | ( | Container & | _Cont, | |
Iterator | _It | |||
) | [inline] |
Referenced by makeAdjacencyRequests(), and mesh2graph_face().
Definition at line 41 of file spanningTreeStrategy.h.
References n.
Referenced by topo::impl::TreeBoundingBoxOn3dTorus< Iterator >::bisect(), edge::buildLockingCloud(), topo::impl::buildNextGen_nodeAware_minBytes(), topo::impl::buildNextGen_nodeAware_minGens(), topo::impl::buildNextGen_topoUnaware(), ST_RecursivePartition< Iterator >::buildSpanningTree(), diameter(), KMeansBOC::findInitialClusters(), edge::flipPrevent(), FTN_NAME(), getNeighborsTopoTree_R(), ST_RecursivePartition< Iterator >::initPhyNodes(), topo::impl::TreeBoundingBoxOn3dTorus< Iterator >::partition(), ST_RecursivePartition< Iterator >::subtreeSize(), topo::impl::TreeBoundingBoxOn3dTorus< Iterator >::trisect(), and KMeansBOC::updateSeedMembership().