feat: add open addressing hash set

[BorysTheDev]

#4915

Added main functionality of OAHSet class
added tests

Current hash table is a classic open addressing hash table with linear probing, but with next modification:

1. every entry contains additional hash data that allows avoid collisions
2. resize is done when the number of elements == size of buckets
3. if there is no place for a new entry it is placed in the extension point vector (stored only in every 16th elements)
4. search for element is linear in the next 16 entries or in the extension point vector

For now, benchmarks are the next, but the code wasn't optimized for performance yet

Benchmark	CPU OAHSet	CPU StringSet
BM_Clone/elements:32000	1425050 ns	1331906 ns
BM_Fill/elements:32000	3411021 ns	926307 ns
BM_Clear/elements:32000	179716 ns	360826 ns
BM_Add/elements:1000/Key Size:10	30650 ns	25309 ns
BM_Add/elements:10000/Key Size:10	635063 ns	251686 ns
BM_Add/elements:100000/Key Size:10	7044638 ns	3523484 ns
BM_Add/elements:1000/Key Size:100	34389 ns	29599 ns
BM_Add/elements:10000/Key Size:100	688113 ns	338721 ns
BM_Add/elements:100000/Key Size:100	7900725 ns	5036263 ns
BM_Add/elements:1000/Key Size:1000	82427 ns	76512 ns
BM_Add/elements:10000/Key Size:1000	1309386 ns	1025027 ns
BM_Add/elements:100000/Key Size:1000	16908210 ns	20320960 ns
BM_AddMany/elements:1000/Key Size:10	101403 ns	24962 ns
BM_AddMany/elements:10000/Key Size:10	1076909 ns	253995 ns
BM_AddMany/elements:100000/Key Size:10	11202105 ns	3062356 ns
BM_AddMany/elements:1000/Key Size:100	105353 ns	29585 ns
BM_AddMany/elements:10000/Key Size:100	1123937 ns	322189 ns
BM_AddMany/elements:100000/Key Size:100	12108941 ns	4798887 ns
BM_AddMany/elements:1000/Key Size:1000	150628 ns	77652 ns
BM_AddMany/elements:10000/Key Size:1000	1725259 ns	1169702 ns
BM_AddMany/elements:100000/Key Size:1000	20425583 ns	17881405 ns
BM_Erase/elements:1000/Key Size:10	17769 ns	19052 ns
BM_Erase/elements:10000/Key Size:10	270268 ns	201989 ns
BM_Erase/elements:100000/Key Size:10	5210262 ns	2716412 ns
BM_Erase/elements:1000/Key Size:100	23975 ns	22230 ns
BM_Erase/elements:10000/Key Size:100	356889 ns	274502 ns
BM_Erase/elements:100000/Key Size:100	8264147 ns	4470247 ns
BM_Erase/elements:1000/Key Size:1000	76743 ns	69454 ns
BM_Erase/elements:10000/Key Size:1000	1129342 ns	845411 ns
BM_Erase/elements:100000/Key Size:1000	17723758 ns	19108144 ns
BM_Get/elements:1000/Key Size:10	10129 ns	11026 ns
BM_Get/elements:10000/Key Size:10	72916 ns	101239 ns
BM_Get/elements:100000/Key Size:10	1700811 ns	2256349 ns
BM_Get/elements:1000/Key Size:100	15117 ns	14620 ns
BM_Get/elements:10000/Key Size:100	142955 ns	192986 ns
BM_Get/elements:100000/Key Size:100	2599509 ns	3984429 ns
BM_Get/elements:1000/Key Size:1000	58808 ns	59685 ns
BM_Get/elements:10000/Key Size:1000	674511 ns	790375 ns
BM_Get/elements:100000/Key Size:1000	12420843 ns	19972071 ns
BM_Grow	5333783 ns	7546771 ns

[vyavdoshenko]

Looks promising.
However, besides that code, the comprehensive documentation must also be added. For example, what to do if a new type should be added?

It seems additional testing should be added, i.e. memory leaks.