@@ -9,7 +9,7 @@ size_t dodgr_sf::make_edge_name_set (std::unordered_set <std::string> &new_edge_
99 // Rcpp::CharacterVector requires long int index type
1010 for (long int i = 0 ; i < new_edges.size (); i++)
1111 {
12- new_edge_name_set.emplace (static_cast <std::string> (new_edges [i] ));
12+ new_edge_name_set.emplace (static_cast <std::string> (new_edges (i) ));
1313 }
1414 return new_edge_name_set.size ();
1515}
@@ -26,7 +26,7 @@ void dodgr_sf::make_edge_name_vec (const size_t n,
2626 size_t count = 0 ;
2727 for (long int i = 1 ; i < new_edges.size (); i++)
2828 {
29- std::string new_edge_i = static_cast <std::string> (new_edges [i] );
29+ std::string new_edge_i = static_cast <std::string> (new_edges (i) );
3030 if (new_edge_i != new_edge_name_vec [count])
3131 new_edge_name_vec [++count] = new_edge_i;
3232 }
@@ -44,7 +44,7 @@ size_t dodgr_sf::get_edgevec_sizes (const size_t nedges,
4444 size_t count = 1 , edgenum = 0 ;
4545 for (long int i = 1 ; i < new_edges.size (); i++)
4646 {
47- if (new_edges [i] == new_edges [ i - 1 ] )
47+ if (new_edges (i) == new_edges ( i - 1 ) )
4848 count++;
4949 else
5050 {
@@ -82,11 +82,11 @@ void dodgr_sf::get_edge_to_vert_maps (const std::vector <size_t> &edgevec_sizes,
8282 to_node.resize (edgevec_sizes [edgenum]);
8383 // old_edges is 1-indexed!
8484 long int the_edge = static_cast <long int > (atoi (old_edges [0 ])) - 1 ;
85- from_node [0 ] = static_cast <std::string> (idf_r [ the_edge] );
86- to_node [0 ] = static_cast <std::string> (idt_r [ the_edge] );
85+ from_node [0 ] = static_cast <std::string> (idf_r ( the_edge) );
86+ to_node [0 ] = static_cast <std::string> (idt_r ( the_edge) );
8787 for (long int i = 1 ; i < new_edges.size (); i++)
8888 {
89- if (new_edges [i] != new_edges [ i - 1 ] )
89+ if (new_edges (i) != new_edges ( i - 1 ) )
9090 {
9191 full_from_edge_map.emplace (new_edge_names [edgenum], from_node);
9292 full_to_edge_map.emplace (new_edge_names [edgenum], to_node);
@@ -97,9 +97,9 @@ void dodgr_sf::get_edge_to_vert_maps (const std::vector <size_t> &edgevec_sizes,
9797 to_node.resize (edgevec_sizes [edgenum]);
9898 count = 0 ;
9999 }
100- the_edge = atoi (old_edges [i] ) - 1 ; // it's 1-indexed!
101- from_node [count] = static_cast <std::string> (idf_r [ the_edge] );
102- to_node [count++] = static_cast <std::string> (idt_r [ the_edge] );
100+ the_edge = atoi (old_edges (i) ) - 1 ; // it's 1-indexed!
101+ from_node [count] = static_cast <std::string> (idf_r ( the_edge) );
102+ to_node [count++] = static_cast <std::string> (idt_r ( the_edge) );
103103 }
104104 full_from_edge_map.emplace (new_edge_names [edgenum], from_node);
105105 full_to_edge_map.emplace (new_edge_names [edgenum], to_node);
@@ -154,7 +154,7 @@ void dodgr_sf::order_vert_sequences (Rcpp::List &edge_sequences,
154154 }
155155 idmap_rev.clear ();
156156
157- edge_sequences [ static_cast <long int > (i)] = id;
157+ edge_sequences ( static_cast <long int > (i)) = id;
158158 }
159159}
160160
@@ -167,7 +167,7 @@ size_t dodgr_sf::count_non_contracted_edges (const Rcpp::CharacterVector &contr_
167167 for (long int i = 0 ; i < contr_edges.size (); i++)
168168 {
169169 if (new_edge_name_set.find (static_cast <std::string>
170- (contr_edges [i] )) == new_edge_name_set.end ())
170+ (contr_edges (i) )) == new_edge_name_set.end ())
171171 {
172172 edge_count++;
173173 }
@@ -193,13 +193,13 @@ void dodgr_sf::append_nc_edges (const size_t nc_edge_count,
193193 for (long int i = 0 ; i < graph_contr.nrow (); i++)
194194 {
195195 if (new_edge_name_set.find (static_cast <std::string>
196- (contr_edges [i] )) == new_edge_name_set.end ())
196+ (contr_edges (i) )) == new_edge_name_set.end ())
197197 {
198- old_edge_names [count] = contr_edges [i] ;
198+ old_edge_names [count] = contr_edges (i) ;
199199 Rcpp::CharacterVector idvec (2 );
200- idvec [0 ] = idf_r_c [i] ;
201- idvec [1 ] = idt_r_c [i] ;
202- edge_sequences_new [ static_cast <long int > (count++)] = idvec;
200+ idvec [0 ] = idf_r_c (i) ;
201+ idvec [1 ] = idt_r_c (i) ;
202+ edge_sequences_new ( static_cast <long int > (count++)) = idvec;
203203 }
204204 }
205205 // Then just join the two edge_sequence Lists together, along with vectors
@@ -211,12 +211,12 @@ void dodgr_sf::append_nc_edges (const size_t nc_edge_count,
211211 for (size_t i = 0 ; i < static_cast <size_t > (edge_sequences_contr.size ()); i++)
212212 all_edge_names [i] = new_edge_name_vec [i];
213213 for (long int i = 0 ; i < edge_sequences_contr.size (); i++)
214- edge_sequences_all [i] = edge_sequences_contr [i];
214+ edge_sequences_all (i) = edge_sequences_contr [i];
215215 for (size_t i = 0 ; i < static_cast <size_t > (edge_sequences_new.size ()); i++)
216216 all_edge_names [static_cast <size_t > (edge_sequences_contr.size ()) + i] =
217217 old_edge_names [i];
218218 for (long int i = 0 ; i < edge_sequences_new.size (); i++)
219- edge_sequences_all [ edge_sequences_contr.size () + i] = edge_sequences_new [i] ;
219+ edge_sequences_all ( edge_sequences_contr.size () + i) = edge_sequences_new (i) ;
220220}
221221
222222// from osmdata/src/get-bbox.cpp
0 commit comments