@@ -76,19 +76,19 @@ namespace
76
76
77
77
struct cmpTuple
78
78
{
79
- bool operator ()(tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*> a,
80
- tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*> b)
79
+ bool operator ()(boost:: tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*> a,
80
+ boost:: tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*> b)
81
81
{
82
- if (get<0 >(a) < get<0 >(b))
82
+ if (boost:: get<0 >(a) < boost:: get<0 >(b))
83
83
return true ;
84
84
85
- if (get<0 >(a) == get<0 >(b))
85
+ if (boost:: get<0 >(a) == boost:: get<0 >(b))
86
86
{
87
- if (get<1 >(a) < get<1 >(b))
87
+ if (boost:: get<1 >(a) < boost:: get<1 >(b))
88
88
return true ;
89
89
90
- if (get<1 >(a) == get<1 >(b))
91
- return get<2 >(a) < get<2 >(b);
90
+ if (boost:: get<1 >(a) == boost:: get<1 >(b))
91
+ return boost:: get<2 >(a) < boost:: get<2 >(b);
92
92
}
93
93
94
94
return false ;
@@ -101,7 +101,7 @@ typedef vector<RowBucket> RowBucketVec;
101
101
// The AGG_MAP type is used to maintain a list of aggregate functions in order to
102
102
// detect duplicates. Since all UDAF have the same op type (ROWAGG_UDAF), we add in
103
103
// the function pointer in order to ensure uniqueness.
104
- typedef map<tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*>, uint64_t , cmpTuple> AGG_MAP;
104
+ typedef map<boost:: tuple<uint32_t , int , mcsv1sdk::mcsv1_UDAF*>, uint64_t , cmpTuple> AGG_MAP;
105
105
106
106
inline RowAggFunctionType functionIdMap (int planFuncId)
107
107
{
@@ -1477,7 +1477,7 @@ void TupleAggregateStep::prep1PhaseAggregate(
1477
1477
}
1478
1478
1479
1479
// find if this func is a duplicate
1480
- AGG_MAP::iterator iter = aggFuncMap.find (make_tuple (key, aggOp, pUDAFFunc));
1480
+ AGG_MAP::iterator iter = aggFuncMap.find (boost:: make_tuple (key, aggOp, pUDAFFunc));
1481
1481
1482
1482
if (iter != aggFuncMap.end ())
1483
1483
{
@@ -1494,7 +1494,7 @@ void TupleAggregateStep::prep1PhaseAggregate(
1494
1494
}
1495
1495
else
1496
1496
{
1497
- aggFuncMap.insert (make_pair (make_tuple (key, aggOp, pUDAFFunc), funct->fOutputColumnIndex ));
1497
+ aggFuncMap.insert (make_pair (boost:: make_tuple (key, aggOp, pUDAFFunc), funct->fOutputColumnIndex ));
1498
1498
}
1499
1499
}
1500
1500
@@ -1704,7 +1704,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
1704
1704
typeAgg.push_back (typeProj[colProj]);
1705
1705
widthAgg.push_back (widthProj[colProj]);
1706
1706
1707
- aggFuncMap.insert (make_pair (make_tuple (keysAgg[colAgg], 0 , pUDAFFunc), colAgg));
1707
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAgg[colAgg], 0 , pUDAFFunc), colAgg));
1708
1708
colAgg++;
1709
1709
}
1710
1710
@@ -1745,7 +1745,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
1745
1745
typeAgg.push_back (typeProj[colProj]);
1746
1746
widthAgg.push_back (widthProj[colProj]);
1747
1747
1748
- aggFuncMap.insert (make_pair (make_tuple (keysAgg[colAgg], 0 , pUDAFFunc), colAgg));
1748
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAgg[colAgg], 0 , pUDAFFunc), colAgg));
1749
1749
colAgg++;
1750
1750
}
1751
1751
@@ -1775,7 +1775,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
1775
1775
SP_ROWAGG_FUNC_t funct (new RowAggFunctionCol (
1776
1776
aggOp, stats, colAgg, colAgg, -1 ));
1777
1777
functionVec1.push_back (funct);
1778
- aggFuncMap.insert (make_pair (make_tuple (aggKey, aggOp, pUDAFFunc), colAgg));
1778
+ aggFuncMap.insert (make_pair (boost:: make_tuple (aggKey, aggOp, pUDAFFunc), colAgg));
1779
1779
colAgg++;
1780
1780
1781
1781
continue ;
@@ -1831,11 +1831,11 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
1831
1831
}
1832
1832
1833
1833
// skip if this is a duplicate
1834
- if (aggFuncMap.find (make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
1834
+ if (aggFuncMap.find (boost:: make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
1835
1835
continue ;
1836
1836
1837
1837
functionVec1.push_back (funct);
1838
- aggFuncMap.insert (make_pair (make_tuple (aggKey, aggOp, pUDAFFunc), colAgg));
1838
+ aggFuncMap.insert (make_pair (boost:: make_tuple (aggKey, aggOp, pUDAFFunc), colAgg));
1839
1839
1840
1840
switch (aggOp)
1841
1841
{
@@ -2081,7 +2081,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2081
2081
{
2082
2082
SP_ROWAGG_GRPBY_t groupby (new RowAggGroupByCol (i, -1 ));
2083
2083
groupByNoDist.push_back (groupby);
2084
- aggFuncMap.insert (make_pair (make_tuple (keysAgg[i], 0 , pUDAFFunc), i));
2084
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAgg[i], 0 , pUDAFFunc), i));
2085
2085
}
2086
2086
2087
2087
// locate the return column position in aggregated rowgroup
@@ -2096,7 +2096,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2096
2096
if (find (jobInfo.distinctColVec .begin (), jobInfo.distinctColVec .end (), retKey) !=
2097
2097
jobInfo.distinctColVec .end () )
2098
2098
{
2099
- AGG_MAP::iterator it = aggFuncMap.find (make_tuple (retKey, 0 , pUDAFFunc));
2099
+ AGG_MAP::iterator it = aggFuncMap.find (boost:: make_tuple (retKey, 0 , pUDAFFunc));
2100
2100
2101
2101
if (it != aggFuncMap.end ())
2102
2102
{
@@ -2208,7 +2208,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2208
2208
case ROWAGG_BIT_XOR:
2209
2209
default :
2210
2210
{
2211
- AGG_MAP::iterator it = aggFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
2211
+ AGG_MAP::iterator it = aggFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
2212
2212
2213
2213
if (it != aggFuncMap.end ())
2214
2214
{
@@ -2239,7 +2239,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2239
2239
// check if a SUM or COUNT covered by AVG
2240
2240
if (aggOp == ROWAGG_SUM || aggOp == ROWAGG_COUNT_COL_NAME)
2241
2241
{
2242
- it = aggFuncMap.find (make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
2242
+ it = aggFuncMap.find (boost:: make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
2243
2243
2244
2244
if (it != aggFuncMap.end ())
2245
2245
{
@@ -2417,7 +2417,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2417
2417
functionVec2.push_back (funct);
2418
2418
2419
2419
// find if this func is a duplicate
2420
- AGG_MAP::iterator iter = aggDupFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
2420
+ AGG_MAP::iterator iter = aggDupFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
2421
2421
2422
2422
if (iter != aggDupFuncMap.end ())
2423
2423
{
@@ -2434,7 +2434,7 @@ void TupleAggregateStep::prep1PhaseDistinctAggregate(
2434
2434
}
2435
2435
else
2436
2436
{
2437
- aggDupFuncMap.insert (make_pair (make_tuple (retKey, aggOp, pUDAFFunc),
2437
+ aggDupFuncMap.insert (make_pair (boost:: make_tuple (retKey, aggOp, pUDAFFunc),
2438
2438
funct->fOutputColumnIndex ));
2439
2439
}
2440
2440
@@ -2910,7 +2910,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
2910
2910
typeAggPm.push_back (typeProj[colProj]);
2911
2911
widthAggPm.push_back (width[colProj]);
2912
2912
2913
- aggFuncMap.insert (make_pair (make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
2913
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
2914
2914
colAggPm++;
2915
2915
}
2916
2916
@@ -2951,7 +2951,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
2951
2951
typeAggPm.push_back (typeProj[colProj]);
2952
2952
widthAggPm.push_back (width[colProj]);
2953
2953
2954
- aggFuncMap.insert (make_pair (make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
2954
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
2955
2955
colAggPm++;
2956
2956
}
2957
2957
@@ -3011,11 +3011,11 @@ void TupleAggregateStep::prep2PhasesAggregate(
3011
3011
}
3012
3012
3013
3013
// skip if this is a duplicate
3014
- if (aggFuncMap.find (make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
3014
+ if (aggFuncMap.find (boost:: make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
3015
3015
continue ;
3016
3016
3017
3017
functionVecPm.push_back (funct);
3018
- aggFuncMap.insert (make_pair (make_tuple (aggKey, aggOp, pUDAFFunc), colAggPm));
3018
+ aggFuncMap.insert (make_pair (boost:: make_tuple (aggKey, aggOp, pUDAFFunc), colAggPm));
3019
3019
3020
3020
switch (aggOp)
3021
3021
{
@@ -3269,7 +3269,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
3269
3269
pUDAFFunc = udafc->getContext ().getFunction ();
3270
3270
}
3271
3271
3272
- AGG_MAP::iterator it = aggFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
3272
+ AGG_MAP::iterator it = aggFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
3273
3273
3274
3274
if (it != aggFuncMap.end ())
3275
3275
{
@@ -3290,7 +3290,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
3290
3290
// check if a SUM or COUNT covered by AVG
3291
3291
if (aggOp == ROWAGG_SUM || aggOp == ROWAGG_COUNT_COL_NAME)
3292
3292
{
3293
- it = aggFuncMap.find (make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
3293
+ it = aggFuncMap.find (boost:: make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
3294
3294
3295
3295
if (it != aggFuncMap.end ())
3296
3296
{
@@ -3435,7 +3435,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
3435
3435
functionVecUm.push_back (funct);
3436
3436
3437
3437
// find if this func is a duplicate
3438
- AGG_MAP::iterator iter = aggDupFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
3438
+ AGG_MAP::iterator iter = aggDupFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
3439
3439
3440
3440
if (iter != aggDupFuncMap.end ())
3441
3441
{
@@ -3452,7 +3452,7 @@ void TupleAggregateStep::prep2PhasesAggregate(
3452
3452
}
3453
3453
else
3454
3454
{
3455
- aggDupFuncMap.insert (make_pair (make_tuple (retKey, aggOp, pUDAFFunc),
3455
+ aggDupFuncMap.insert (make_pair (boost:: make_tuple (retKey, aggOp, pUDAFFunc),
3456
3456
funct->fOutputColumnIndex ));
3457
3457
}
3458
3458
@@ -3707,7 +3707,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
3707
3707
typeAggPm.push_back (typeProj[colProj]);
3708
3708
widthAggPm.push_back (width[colProj]);
3709
3709
3710
- aggFuncMap.insert (make_pair (make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
3710
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
3711
3711
colAggPm++;
3712
3712
}
3713
3713
@@ -3748,7 +3748,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
3748
3748
typeAggPm.push_back (typeProj[colProj]);
3749
3749
widthAggPm.push_back (width[colProj]);
3750
3750
3751
- aggFuncMap.insert (make_pair (make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
3751
+ aggFuncMap.insert (make_pair (boost:: make_tuple (keysAggPm[colAggPm], 0 , pUDAFFunc), colAggPm));
3752
3752
colAggPm++;
3753
3753
}
3754
3754
@@ -3815,11 +3815,11 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
3815
3815
}
3816
3816
3817
3817
// skip if this is a duplicate
3818
- if (aggFuncMap.find (make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
3818
+ if (aggFuncMap.find (boost:: make_tuple (aggKey, aggOp, pUDAFFunc)) != aggFuncMap.end ())
3819
3819
continue ;
3820
3820
3821
3821
functionVecPm.push_back (funct);
3822
- aggFuncMap.insert (make_pair (make_tuple (aggKey, aggOp, pUDAFFunc), colAggPm));
3822
+ aggFuncMap.insert (make_pair (boost:: make_tuple (aggKey, aggOp, pUDAFFunc), colAggPm));
3823
3823
3824
3824
switch (aggOp)
3825
3825
{
@@ -4110,7 +4110,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
4110
4110
if (find (jobInfo.distinctColVec .begin (), jobInfo.distinctColVec .end (), retKey) !=
4111
4111
jobInfo.distinctColVec .end () )
4112
4112
{
4113
- AGG_MAP::iterator it = aggFuncMap.find (make_tuple (retKey, 0 , pUDAFFunc));
4113
+ AGG_MAP::iterator it = aggFuncMap.find (boost:: make_tuple (retKey, 0 , pUDAFFunc));
4114
4114
4115
4115
if (it != aggFuncMap.end ())
4116
4116
{
@@ -4228,7 +4228,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
4228
4228
case ROWAGG_CONSTANT:
4229
4229
default :
4230
4230
{
4231
- AGG_MAP::iterator it = aggFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
4231
+ AGG_MAP::iterator it = aggFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
4232
4232
4233
4233
if (it != aggFuncMap.end ())
4234
4234
{
@@ -4249,7 +4249,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
4249
4249
// check if a SUM or COUNT covered by AVG
4250
4250
if (aggOp == ROWAGG_SUM || aggOp == ROWAGG_COUNT_COL_NAME)
4251
4251
{
4252
- it = aggFuncMap.find (make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
4252
+ it = aggFuncMap.find (boost:: make_tuple (returnedColVec[i].first , ROWAGG_AVG, pUDAFFunc));
4253
4253
4254
4254
if (it != aggFuncMap.end ())
4255
4255
{
@@ -4384,7 +4384,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
4384
4384
functionVecUm.push_back (funct);
4385
4385
4386
4386
// find if this func is a duplicate
4387
- AGG_MAP::iterator iter = aggDupFuncMap.find (make_tuple (retKey, aggOp, pUDAFFunc));
4387
+ AGG_MAP::iterator iter = aggDupFuncMap.find (boost:: make_tuple (retKey, aggOp, pUDAFFunc));
4388
4388
4389
4389
if (iter != aggDupFuncMap.end ())
4390
4390
{
@@ -4401,7 +4401,7 @@ void TupleAggregateStep::prep2PhasesDistinctAggregate(
4401
4401
}
4402
4402
else
4403
4403
{
4404
- aggDupFuncMap.insert (make_pair (make_tuple (retKey, aggOp, pUDAFFunc),
4404
+ aggDupFuncMap.insert (make_pair (boost:: make_tuple (retKey, aggOp, pUDAFFunc),
4405
4405
funct->fOutputColumnIndex ));
4406
4406
}
4407
4407
0 commit comments