История изменений
Исправление Dudraug, (текущая версия) :
На с++
struct SPerson
{
std::string name;
int department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const auto& s)
{return std::tie(f.department_id, f.name) < std::tie(s.department_id, s.name);});
...
std::sort(v.begin(), v.end(), [](const auto& f, const auto& s)
{return std::tie(f.name) < std::tie(s.name);});
Исправление Dudraug, :
На с++
struct SPerson
{
std::string name;
int department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const auto& s)
{return std::tie(f.department_id, s.name) < std::tie(s.department_id, f.name);});
...
std::sort(v.begin(), v.end(), [](const auto& f, const auto& s)
{return std::tie(f.name) < std::tie(f.name);});
Исправление Dudraug, :
На с++
struct SPerson
{
std::string name;
int department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.department_id, s.name) < std::tie(s.department_id, f.name);});
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.name) < std::tie(f.name);});
Исправление Dudraug, :
На с++
struct SPerson
{
std::string name;
in department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.department_id, s.name) < std::tie(s.department_id, f.name);});
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.name) < std::tie(f.name);});
Исправление Dudraug, :
На с++
struct SPerson
{
std::string name;
in department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.department_id, s.name) < std::tie(s.department_id, f.name);}
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.name) < std::tie(f.name);}
Исправление Dudraug, :
На с++
struct SPerson
{
std::string name;
in department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.department_id, f.name) < std::tie(s.department_id, f.name);}
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s)
{return std::tie(f.name) < std::tie(f.name);}
Исходная версия Dudraug, :
На с++
struct SPerson
{
std::string name;
in department_id;
};
...
std::vector<SPerson> v;
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s) {return std::tie(f.department_id, f.name) < std::tie(s.department_id, f.name);}
...
std::sort(v.begin(), v.end(), [](const auto& f, const aut& s) {return std::tie(f.name) < std::tie(f.name);}