@@ -252,18 +252,18 @@ namespace {
252252class without_first
253253{
254254public:
255- explicit without_first (point_list_t const &list) : m_list(list) {}
255+ explicit without_first (point_list_t const &list) : m_list(& list) {}
256256
257257 point_list_t ::const_iterator begin ()
258258 {
259- assert (m_list. begin () != m_list. end ());
260- return std::next (m_list. begin ());
259+ assert (m_list-> begin () != m_list-> end ());
260+ return std::next (m_list-> begin ());
261261 }
262262
263- point_list_t ::const_iterator end () { return m_list. end (); }
263+ point_list_t ::const_iterator end () { return m_list-> end (); }
264264
265265private:
266- point_list_t const & m_list;
266+ point_list_t const * m_list;
267267}; // class without_first
268268
269269} // anonymous namespace
@@ -593,10 +593,10 @@ void line_merge(geometry_t *output, geometry_t const &input)
593593 struct connection_t
594594 {
595595 std::size_t left = NOCONN;
596- linestring_t const *ls ;
596+ linestring_t const *linestring ;
597597 std::size_t right = NOCONN;
598598
599- explicit connection_t (linestring_t const *l) noexcept : ls (l) {}
599+ explicit connection_t (linestring_t const *l) noexcept : linestring (l) {}
600600 };
601601
602602 std::vector<connection_t > conns;
@@ -633,7 +633,7 @@ void line_merge(geometry_t *output, geometry_t const &input)
633633 std::size_t done_ways = 0 ;
634634 std::size_t const todo_ways = conns.size ();
635635 for (std::size_t i = 0 ; i < todo_ways; ++i) {
636- if (!conns[i].ls ||
636+ if (!conns[i].linestring ||
637637 (conns[i].left != NOCONN && conns[i].right != NOCONN)) {
638638 continue ; // way already done or not the beginning of a segment
639639 }
@@ -645,8 +645,8 @@ void line_merge(geometry_t *output, geometry_t const &input)
645645
646646 do {
647647 auto &conn = conns[cur];
648- assert (conn.ls );
649- auto const &nl = *conn.ls ;
648+ assert (conn.linestring );
649+ auto const &nl = *conn.linestring ;
650650 bool const forward = conn.left == prev;
651651 prev = cur;
652652 // add line
@@ -660,7 +660,7 @@ void line_merge(geometry_t *output, geometry_t const &input)
660660 cur = conn.left ;
661661 }
662662 // mark line as done
663- conns[prev].ls = nullptr ;
663+ conns[prev].linestring = nullptr ;
664664 ++done_ways;
665665 } while (cur != NOCONN);
666666 }
@@ -675,7 +675,7 @@ void line_merge(geometry_t *output, geometry_t const &input)
675675 // oh dear, there must be circular ways without an end
676676 // need to do the same shebang again
677677 for (std::size_t i = 0 ; i < todo_ways; ++i) {
678- if (!conns[i].ls ) {
678+ if (!conns[i].linestring ) {
679679 continue ; // way already done
680680 }
681681
@@ -686,12 +686,12 @@ void line_merge(geometry_t *output, geometry_t const &input)
686686
687687 do {
688688 auto &conn = conns[cur];
689- assert (conn.ls );
690- auto const &nl = *conn.ls ;
689+ assert (conn.linestring );
690+ auto const &nl = *conn.linestring ;
691691 bool const forward =
692692 (conn.left == prev &&
693- (!conns[conn.left ].ls ||
694- conns[conn.left ].ls ->back () == nl.front ()));
693+ (!conns[conn.left ].linestring ||
694+ conns[conn.left ].linestring ->back () == nl.front ()));
695695 prev = cur;
696696 if (forward) {
697697 // add line forwards
@@ -705,7 +705,7 @@ void line_merge(geometry_t *output, geometry_t const &input)
705705 cur = conn.left ;
706706 }
707707 // mark line as done
708- conns[prev].ls = nullptr ;
708+ conns[prev].linestring = nullptr ;
709709 } while (cur != i);
710710 }
711711
@@ -801,9 +801,9 @@ static bool simplify(linestring_t *output, linestring_t const &input,
801801static bool simplify (multilinestring_t *output, multilinestring_t const &input,
802802 double tolerance)
803803{
804- for (auto const &ls : input) {
804+ for (auto const &linestring : input) {
805805 linestring_t simplified_ls;
806- if (simplify (&simplified_ls, ls , tolerance)) {
806+ if (simplify (&simplified_ls, linestring , tolerance)) {
807807 output->add_geometry (std::move (simplified_ls));
808808 }
809809 }
0 commit comments