diff --git a/src/Interpreters/SetVariants.h b/src/Interpreters/SetVariants.h index 454de98d35b..118cf0115ab 100644 --- a/src/Interpreters/SetVariants.h +++ b/src/Interpreters/SetVariants.h @@ -190,24 +190,24 @@ struct NonClearableSet * As in Aggregator, using consecutive keys cache doesn't improve performance * for FixedHashTables. */ - std::unique_ptr, false /* use_cache */>> key8; - std::unique_ptr, false /* use_cache */>> key16; + std::unique_ptr, false /* use_cache */>> key8; + std::unique_ptr, false /* use_cache */>> key16; /** Also for the experiment was tested the ability to use SmallSet, * as long as the number of elements in the set is small (and, if necessary, converted to a full-fledged HashSet). * But this experiment showed that there is an advantage only in rare cases. */ - std::unique_ptr>>> key32; - std::unique_ptr>>> key64; - std::unique_ptr>> key_string; - std::unique_ptr>> key_fixed_string; - std::unique_ptr>> keys128; - std::unique_ptr>> keys256; - std::unique_ptr>> hashed; + std::unique_ptr>>> key32; + std::unique_ptr>>> key64; + std::unique_ptr>> key_string; + std::unique_ptr>> key_fixed_string; + std::unique_ptr>> keys128; + std::unique_ptr>> keys256; + std::unique_ptr>> hashed; /// Support for nullable keys (for DISTINCT implementation). - std::unique_ptr, true>> nullable_keys128; - std::unique_ptr, true>> nullable_keys256; + std::unique_ptr, true>> nullable_keys128; + std::unique_ptr, true>> nullable_keys256; /** Unlike Aggregator, `concat` method is not used here. * This is done because `hashed` method, although slower, but in this case, uses less RAM. * since when you use it, the key values themselves are not stored. @@ -216,20 +216,20 @@ struct NonClearableSet struct ClearableSet { - std::unique_ptr, false /* use_cache */>> key8; - std::unique_ptr, false /*use_cache */>> key16; + std::unique_ptr, false /* use_cache */>> key8; + std::unique_ptr, false /*use_cache */>> key16; - std::unique_ptr>>> key32; - std::unique_ptr>>> key64; - std::unique_ptr>> key_string; - std::unique_ptr>> key_fixed_string; - std::unique_ptr>> keys128; - std::unique_ptr>> keys256; - std::unique_ptr>> hashed; + std::unique_ptr>>> key32; + std::unique_ptr>>> key64; + std::unique_ptr>> key_string; + std::unique_ptr>> key_fixed_string; + std::unique_ptr>> keys128; + std::unique_ptr>> keys256; + std::unique_ptr>> hashed; /// Support for nullable keys (for DISTINCT implementation). - std::unique_ptr, true>> nullable_keys128; - std::unique_ptr, true>> nullable_keys256; + std::unique_ptr, true>> nullable_keys128; + std::unique_ptr, true>> nullable_keys256; /** Unlike Aggregator, `concat` method is not used here. * This is done because `hashed` method, although slower, but in this case, uses less RAM. * since when you use it, the key values themselves are not stored.