Создать 2 структуры: DEC и POL - C++

//points.txt
alpha 10 20
beta 20 30
gamma 30 40
delta 40 50
epsilon 5 10
zeta 15 2
eta 100 200
theta 150 100
iota 90 100
kappa 40 40

#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <cmath>
#include <algorithm>
 
#define BUFF_SIZE 100
 
using namespace std;
 
struct DEC {
    string name;
    double x;
    double y;
    DEC(string name, double x, double y) : name{ name }, x{ x }, y{ y } {}
};
 
struct POL {
    string name;
    double r;
    double phi;
    POL(string name, double r, double phi) : name{ name }, r{ r }, phi{ phi } {}
};
 
 
bool contains_name_dec(string name, vector<DEC> decs) {
    for (DEC d : decs)
        if (name == d.name)
            return true;
    return false;
}
 
POL dec_to_pol(DEC d) {
    double r = sqrt(d.x * d.x + d.y * d.y);
    double phi = atan2(d.y, d.x);
    return POL(d.name, r, phi);
}
 
bool my_comp_function(POL p1, POL p2) {
    return p1.phi > p2.phi;
}
 
bool double_equals(double a, double b, double epsilon = 0.001)
{
    return std::abs(a - b) < epsilon;
}
 
string name_by_phi(double phi, vector<POL> pols) {
    for (POL p : pols) {
        if (double_equals(phi, p.phi))
            return p.name;
    }
    return "phi not found";
}
 
int main()
{
    char data[BUFF_SIZE];
    ifstream fin;
    vector<DEC> decs;
    vector<POL> pols;
    string tname;
    double tx, ty;
 
    fin.open("points.txt");
    if (fin.fail())
        cout << "error!\n";
 
    while (fin) {
        fin >> tname;
        fin >> tx;
        fin >> ty;
        DEC d = DEC(tname, tx, ty);
        if (!contains_name_dec(tname, decs)) {
            cout << "pushing " << tname << endl;
            decs.push_back(d);
        }
    }
 
    cout << "all decs:\n";
    for (DEC el : decs)
        cout << el.name << "(" << el.x << ", " << el.y << ")" << endl;
 
    for (DEC el : decs) {
        POL p = dec_to_pol(el);
        pols.push_back(p);
    }
 
    cout << "all pols:\n";
    for (POL el : pols)
        cout << el.name << "(" << el.r << ", " << el.phi << ")" << endl;
 
    std::sort(pols.begin(), pols.end(), my_comp_function);
 
    cout << "sorted pols:\n";
    for (POL el : pols)
        cout << el.name << "(" << el.r << ", " << el.phi << ")" << endl;
 
    cout << name_by_phi(1.10715, pols) << endl;
    cout << name_by_phi(0.982794, pols) << endl;
    cout << name_by_phi(0.927295, pols) << endl;
    cout << name_by_phi(0.896055, pols) << endl;
    cout << name_by_phi(0.837981, pols) << endl;
    cout << name_by_phi(0.785398, pols) << endl;
    cout << name_by_phi(0.588003, pols) << endl;
    cout << name_by_phi(0.132552, pols) << endl;
    
    system("pause");
    return 0;
}