17 class DoublyConnectedEdgeList;
50 TUniquePtr<RoadSegmentDescription> ptr{
RoadSegments.back().Release()};
56 TUniquePtr<CityAreaDescription> ptr{
CityAreas.back().Release()};
std::vector< TUniquePtr< RoadSegmentDescription > > RoadSegmentList
size_t CityAreaCount() const
TUniquePtr< RoadSegmentDescription > PopRoadSegment()
Simple doubly-connected edge list structure.
bool HasRoadSegments() const
RoadSegmentList RoadSegments
std::vector< TUniquePtr< CityAreaDescription > > CityAreaList
bool HasCityAreas() const
const RoadSegmentDescription & GetRoadSegmentAt(size_t i) const
TUniquePtr< CityAreaDescription > PopCityArea()
size_t RoadSegmentCount() const
const CityAreaDescription & GetCityAreaAt(size_t i) const
GraphParser(DoublyConnectedEdgeList &Dcel)