收集唯一的排序向量

Question

I have hundred millions of sorted vectors containing floating numbers, the size of each array are the same and reasonably small(less than ten), I need to collect the unique vectors out of such vectors,

    vec1 = {1.0, 1.2, 1.4, 1.6, 1.8}
    vec2 = {1.0, 1.1, 1.3, 1.5, 1.7}
    vec2 = {1.0, 1.3, 1.4, 1.5, 1.6}

...

    SomeTree ={vec1, vec2, vec3 ...}

an array is considered the "same" as another only if every elements are numerically the same(up to some precision), Is there any special tree or other data structure suitable for such purpose ?

Answer 1

Yes, there is. It is called std::set :

#include <vector>
#include <set>

int main()
{
    std::set<std::vector<double>> s{
        { 1.0, 1.1, 1.3, 1.5, 1.7 },
        { 1.0, 1.2, 1.4, 1.6, 1.8 },
        { 1.0, 1.1, 1.3, 1.5, 1.7 },
        { 1.0, 1.3, 1.4, 1.5, 1.6 },
        { 1.0, 1.2, 1.4, 1.6, 1.8 },
        { 1.0, 1.1, 1.3, 1.5, 1.7 },
        { 1.0, 1.2, 1.4, 1.6, 1.8 },
        { 1.0, 1.3, 1.4, 1.5, 1.6 },
        { 1.0, 1.3, 1.4, 1.5, 1.6 },
    };    
}

It's likely that you will want to deeply analyze the Compare parameter of the template, in order to have a definition of less that fits your requirements.