//---------------------------------------------------------
int CSG_Network::_Add_Node(CSG_PRQuadTree &Search, int Edge_ID, const TSG_Point &Node_Point, const TSG_Point &Dir_Point)
{
int Node_ID;
double Distance;
CSG_PRQuadTree_Leaf *pLeaf = Search.Get_Nearest_Leaf(Node_Point, Distance);
if( !pLeaf || Distance > 0.0 )//00001 )
{
Node_ID = Get_Node_Count();
m_Nodes.Inc_Array();
((CSG_Network_Node **)m_Nodes.Get_Array())[Node_ID] = new CSG_Network_Node(Node_ID, Node_Point);
Search.Add_Point(Node_Point.x, Node_Point.y, Node_ID);
}
else
{
Node_ID = (int)pLeaf->Get_Z();
}
Get_Node(Node_ID).Add_Edge(Edge_ID, SG_Get_Angle_Of_Direction(Node_Point, Dir_Point));
return( Node_ID );
}
//---------------------------------------------------------
inline bool CSG_PRQuadTree::_Add_Selected(CSG_Array &Selection, CSG_PRQuadTree_Leaf *pLeaf, double Distance) const
{
if( Selection.Inc_Array() )
{
TLeaf *pL = (TLeaf *)Selection.Get_Entry(Selection.Get_Size() - 1);
pL->pLeaf = pLeaf;
pL->Distance = Distance;
return( true );
}
return( false );
}