parallel-file-quicksort/csvLine.hpp at master · kbuci/parallel-file-quicksort · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#ifndef __EXTERNAL_PARALLEL_CSVLINE__
#define __EXTERNAL_PARALLEL_CSVLINE__

#include <vector>
#include <sstream>
#include <iostream>

using namespace std;
namespace CsvWrapper{
    static vector<int> colOrder;
    static vector<bool> isInt;
    static void setColOrder(const vector<int>& order){
        colOrder = order;
    }
    static void setDataTypes(const vector<bool>& arr){
        isInt = arr;
    }

class CsvLine{
public:
    vector<string> comp;
    string data;

    CsvLine() {
    }

    CsvLine(const CsvLine& c){
        comp = c.comp;
        data = c.data;
    }
    CsvLine(const string& line) : data(line)
    {

        istringstream s(data);
        string wd;
        while (getline(s, wd, ',')){

            comp.push_back(wd);
        }


    }

    ~CsvLine(){}

    CsvLine& operator= (const CsvLine& rhs){
        comp.clear();
        data = rhs.data;
        istringstream s(rhs.data);
        string wd;
        while (getline(s, wd, ',')){
            comp.push_back(wd);
        }
        return *this;
    }

    friend bool operator> (const CsvLine& l, const CsvLine& r){
        for(int i : colOrder){
            if(isInt[i]){
                int li = stoi(l.comp[i]), lr = stoi(r.comp[i]);
                if(li > lr)
                    return true;
                else if(li < lr)
                    return false;
            }
            else {
                if(l.comp[i] > r.comp[i])
                    return true;
                else if(l.comp[i] < r.comp[i])
                    return false;
            }

        }
        return false;
    }

    friend bool operator== (const CsvLine& r, const CsvLine& l){
        for(int i : colOrder)
        {
            if(isInt[i]){
                int il = stoi(l.comp[i]), ir = stoi(r.comp[i]);
                if(il != ir)
                    return false;
            }
            else {
                if(l.comp[i] != r.comp[i])
                    return false;
            }

        }
        return true;
    }

    friend bool operator< (const CsvLine& l, const CsvLine& r){
        for(int i : colOrder){
            if(isInt[i]){
                int li = stoi(l.comp[i]), lr = stoi(r.comp[i]);
                if(li < lr)
                    return true;
                else if(li > lr)
                    return false;
            }
            else {
                if(l.comp[i] < r.comp[i])
                    return true;
                else if(l.comp[i] > r.comp[i])
                    return false;
            }

        }
        return false;
    }

    friend ostream& operator <<(ostream &os, const CsvLine &c){
        os << c.data;
        return os;
    }

    friend istream& operator >>(istream &is, CsvLine &c){
        c.comp.clear();
        is >> c.data;
        istringstream s(c.data);
        string wd;
        while (getline(s, wd, ',')){
            c.comp.push_back(wd);
        }
        return is;

    }


};
}
#endif