I mean not keep pointer on array
std::vector<int*> vector; but
std::vector<int[]> vector; The problem is to keep such array in hash_map in order to compare not pointers when Insert there but when I try like this
std::hash_map<std::vector<BYTE>,std::string> xxx I've got an error.
You cant do std::vector<int[]> vector. You have to specify the size of the array for it to compile like this std::vector<int[5]> vector.
However, this is a bad idea because you can`t assign arrays to other arrays, etc. and you will get all kinds of errors when you try to use vector.
Instead, use vector<vector<int>> vector or in C++11 use vector<std::array<int, 5>> vector.
Also, I don't know what implementation of hash_map you are using so I dont know if the above solutions will work in your case. (Also, C++11 has unordered_map, so that might be preferable)
vector<int[]>is exactly the same thing as avector<int*>. Did you maybe mean avector<int[N]>(where N is a compile-time constant)?unordered_map, and this works fine for me:std::unordered_map<std::vector<unsigned char>, std::string>std::unordered_map<std::array<unsigned char, N>, std::string>is a possibility too, since the array is presumably statically-sized.vector<int[3]> v; v.push_back({1, 2, 3});This even makes GCC segfault :)cannot convert from 'const std::vector<_Ty>' to 'size_t'