@@ -101,7 +101,7 @@ int g_comp = 0;
101
101
102
102
void Ordering_terms::compile (const std::vector<Table*>& tables, const std::vector<int >& search_order, Query& q)
103
103
{
104
- for (std::vector<Ordering_terms::OP_dir>::iterator it = m_terms.begin (); it != m_terms.end (); it++) {
104
+ for (auto it = m_terms.begin (); it != m_terms.end (); it++) {
105
105
OP* op = it->m_op ;
106
106
it->m_op = op->compile (tables, search_order, q);
107
107
}
@@ -120,7 +120,7 @@ class Sorter {
120
120
Row** ia_rows = &ia;
121
121
Row** ib_rows = &ib;
122
122
123
- for (std::vector<Ordering_terms::OP_dir>::iterator it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
123
+ for (auto it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
124
124
g_comp++;
125
125
126
126
OP* op = it->m_op ;
@@ -139,7 +139,7 @@ class Sorter {
139
139
Row** ia_rows = &ia;
140
140
Row** ib_rows = &ib;
141
141
142
- for (std::vector<Ordering_terms::OP_dir>::iterator it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
142
+ for (auto it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
143
143
g_comp++;
144
144
145
145
OP* op = it->m_op ;
@@ -156,7 +156,7 @@ class Sorter {
156
156
Row** ia_rows = &ia;
157
157
Row** ib_rows = &ib;
158
158
159
- for (std::vector<Ordering_terms::OP_dir>::iterator it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
159
+ for (auto it = m_order.m_terms .begin (); it != m_order.m_terms .end (); it++) {
160
160
g_comp++;
161
161
162
162
OP* op = it->m_op ;
@@ -389,8 +389,8 @@ class Per_sort {
389
389
int table_size = (int )m_table.m_rows .size ();
390
390
if (table_size <= 1 )
391
391
return ;
392
- std::list<Row*>::iterator it = m_table.m_rows .begin ();
393
- Tlink* links = new Tlink[table_size];
392
+ auto it = m_table.m_rows .begin ();
393
+ Tlink* links = new Tlink[table_size];
394
394
395
395
int i;
396
396
for (i = 0 ; i < table_size; i++) {
@@ -469,9 +469,9 @@ void Table::merge_sort(Ordering_terms& order)
469
469
Row** row_ptrs = new Row*[table_size];
470
470
Spkt* spktpool = new Spkt[table_size * 2 ];
471
471
Spkt* rows[2 ];
472
- rows[0 ] = spktpool;
473
- rows[1 ] = &spktpool[table_size];
474
- std::list<Row*>::iterator it = m_rows.begin ();
472
+ rows[0 ] = spktpool;
473
+ rows[1 ] = &spktpool[table_size];
474
+ auto it = m_rows.begin ();
475
475
476
476
int i = 0 ;
477
477
Spkt* r = rows[0 ];
@@ -569,9 +569,9 @@ void Table::merge_sort(Ordering_terms& order)
569
569
570
570
void Table::limit (int limit, int offset)
571
571
{
572
- int count = 0 ;
573
- std::list<Row*>::iterator e = m_rows.end ();
574
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
572
+ int count = 0 ;
573
+ auto e = m_rows.end ();
574
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
575
575
if (e != m_rows.end ()) {
576
576
delete_row (*e);
577
577
m_rows.erase (e);
@@ -649,7 +649,7 @@ void Table::xml()
649
649
g_output.add_string (" </th>" );
650
650
}
651
651
g_output.add_string (" </tr>\n " );
652
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
652
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
653
653
g_output.add_string (" <tr>" );
654
654
Row* r = *it;
655
655
@@ -752,7 +752,7 @@ void Table::json(bool trailing_comma)
752
752
g_output.add_q_string (" data" );
753
753
g_output.add_string (" : [" );
754
754
bool outer_comma = false ;
755
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
755
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
756
756
if (outer_comma)
757
757
g_output.add_string (" ,\n [" );
758
758
else
@@ -829,7 +829,7 @@ void Table::csv(bool format)
829
829
int max = 0 ;
830
830
char * tmp = 0 ;
831
831
if (format) {
832
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
832
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
833
833
Row* r = *it;
834
834
835
835
for (int i = 0 ; i < cols; i++) {
@@ -899,7 +899,7 @@ void Table::csv(bool format)
899
899
}
900
900
}
901
901
printf (" \n " );
902
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
902
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
903
903
Row* r = *it;
904
904
905
905
for (int i = 0 ; i < cols; i++) {
@@ -973,7 +973,7 @@ void Table::dump()
973
973
printf (" \n " );
974
974
printrep ((width + 2 ) * cols + 1 , ' *' );
975
975
printf (" \n " );
976
- for (std::list<Row*>::iterator it = m_rows.begin (); it != m_rows.end (); it++) {
976
+ for (auto it = m_rows.begin (); it != m_rows.end (); it++) {
977
977
printf (" |" );
978
978
Row* r = *it;
979
979
@@ -1025,15 +1025,15 @@ class Parser {
1025
1025
1026
1026
void dump ()
1027
1027
{
1028
- for (std::list<Token>::iterator it = m_tokens.begin (); it != m_tokens.end (); it++) {
1028
+ for (auto it = m_tokens.begin (); it != m_tokens.end (); it++) {
1029
1029
printf (" Type %d: %s\n " , it->get_type (), it->get_token ());
1030
1030
}
1031
1031
}
1032
1032
1033
1033
bool analyze (Query& q)
1034
1034
{
1035
- std::list<Token>::iterator it = m_tokens.begin ();
1036
- bool ok = true ;
1035
+ auto it = m_tokens.begin ();
1036
+ bool ok = true ;
1037
1037
while (ok) {
1038
1038
ok = false ;
1039
1039
if (get_sample_stmt (q, it))
@@ -2115,7 +2115,7 @@ std::vector<OP*> find_unique_column_ops(std::vector<OP*> ops)
2115
2115
void Query::replace_star_column_with_all_columns ()
2116
2116
{
2117
2117
bool found_star = false ;
2118
- for (std::vector<OP*>::iterator i = m_select.begin (); i != m_select.end (); ++i) {
2118
+ for (auto i = m_select.begin (); i != m_select.end (); ++i) {
2119
2119
if (strcmp ((*i)->get_token (), " *" ) == 0 ) {
2120
2120
found_star = true ;
2121
2121
break ;
@@ -2239,7 +2239,7 @@ std::vector<Variant> process_group_by_key(Ordering_terms& group_by, Row** rows)
2239
2239
bool Query::has_aggregate_functions ()
2240
2240
{
2241
2241
// this assumes the ops have been compiled
2242
- for (std::vector<OP*>::iterator it = m_select.begin (); it != m_select.end (); it++)
2242
+ for (auto it = m_select.begin (); it != m_select.end (); it++)
2243
2243
if ((*it)->m_has_aggregate_function )
2244
2244
return true ;
2245
2245
@@ -2442,9 +2442,9 @@ bool DB::query(const char* q)
2442
2442
2443
2443
Table* DB::get_table (const char * i_name)
2444
2444
{
2445
- std::string name = lower (i_name);
2446
- Table* t = 0 ;
2447
- std::map<std::string, Table*>::iterator it = m_tables.find (name);
2445
+ std::string name = lower (i_name);
2446
+ Table* t = 0 ;
2447
+ auto it = m_tables.find (name);
2448
2448
if (it != m_tables.end ())
2449
2449
t = it->second ;
2450
2450
@@ -2542,7 +2542,7 @@ Cc_func::Cc_func(const OP& op)
2542
2542
paths.push_front (std::string (env));
2543
2543
}
2544
2544
2545
- std::list<std::string>::iterator i = paths.begin ();
2545
+ auto i = paths.begin ();
2546
2546
for (; i != paths.end (); i++) {
2547
2547
db = (*i) + " /GeoLite2-Country.mmdb" ;
2548
2548
struct stat s;
@@ -2634,7 +2634,7 @@ Asn_func::Asn_func(const OP& op)
2634
2634
paths.push_front (std::string (env));
2635
2635
}
2636
2636
2637
- std::list<std::string>::iterator i = paths.begin ();
2637
+ auto i = paths.begin ();
2638
2638
for (; i != paths.end (); i++) {
2639
2639
db = (*i) + " /GeoLite2-ASN.mmdb" ;
2640
2640
struct stat s;
0 commit comments