Method Append

libs/routing/fake_graph.cpp:44–76

}

void FakeGraph::Append(FakeGraph const & rhs)
{
  std::map<Segment, FakeVertex> intersection;
  typename std::map<Segment, FakeVertex>::iterator intersectionIt(intersection.begin());

  std::set_intersection(m_segmentToVertex.begin(), m_segmentToVertex.end(), rhs.m_segmentToVertex.begin(),
                        rhs.m_segmentToVertex.end(), std::inserter(intersection, intersectionIt),
                        base::LessBy(&std::pair<Segment, FakeVertex>::first));

  size_t countEqual = 0;
  for (auto const & segmentVertexPair : intersection)
  {
    auto const it = m_fakeToReal.find(segmentVertexPair.first);
    if (it == m_fakeToReal.cend() || !FakeFeatureIds::IsGuidesFeature(it->second.GetFeatureId()))
      countEqual++;
  }

  CHECK_EQUAL(countEqual, 0, ("Fake segments are not unique."));

  m_segmentToVertex.insert(rhs.m_segmentToVertex.begin(), rhs.m_segmentToVertex.end());
  m_vertexToSegment.insert(rhs.m_vertexToSegment.begin(), rhs.m_vertexToSegment.end());

  for (auto const & kv : rhs.m_outgoing)
    m_outgoing[kv.first].insert(kv.second.begin(), kv.second.end());

  for (auto const & kv : rhs.m_ingoing)
    m_ingoing[kv.first].insert(kv.second.begin(), kv.second.end());

  for (auto const & kv : rhs.m_realToFake)
    m_realToFake[kv.first].insert(kv.second.begin(), kv.second.end());

  m_fakeToReal.insert(rhs.m_fakeToReal.begin(), rhs.m_fakeToReal.end());
}

FakeVertex const & FakeGraph::GetVertex(Segment const & segment) const
{