thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-12-03 13:02:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed build [#METR-2807].

Browse Source
This commit is contained in:
Alexey Milovidov 2014-03-26 22:29:30 +04:00
parent e060784ecc
commit 966995b011
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
dbms/src/Interpreters/tests/hash_map.cpp
View File

@ -48,7 +48,7 @@
* Но в этом тесте осталось нечто похожее на старый сценарий использования хэш-таблиц при агрегации.
*/
#define USE_AUTO_ARRAY 1
#define USE_AUTO_ARRAY 0
int main(int argc, char ** argv)
@ -131,7 +131,7 @@ int main(int argc, char ** argv)
map.emplace(data[i], it, inserted);
if (inserted)
{
new(&it->second) Value(value);
new(&it->second) Value(std::move(value));
INIT;
}
}
@ -155,7 +155,7 @@ int main(int argc, char ** argv)
std::unordered_map<Key, Value, DB::default_hash<Key> >::iterator it;
for (size_t i = 0; i < n; ++i)
{
it = map.insert(std::make_pair(data[i], value)).first;
it = map.insert(std::make_pair(data[i], std::move(value))).first;
INIT;
}
@ -176,7 +176,7 @@ int main(int argc, char ** argv)
map.set_empty_key(-1ULL);
for (size_t i = 0; i < n; ++i)
{
it = map.insert(std::make_pair(data[i], value)).first;
it = map.insert(std::make_pair(data[i], std::move(value))).first;
INIT;
}
@ -196,7 +196,7 @@ int main(int argc, char ** argv)
google::sparse_hash_map<Key, Value, DB::default_hash<Key> >::iterator it;
for (size_t i = 0; i < n; ++i)
{
map.insert(std::make_pair(data[i], value));
map.insert(std::make_pair(data[i], std::move(value)));
INIT;
}