qb
2.0.0.0
C++17 Actor Framework
|
Optimized unordered set implementations. More...
#include <set>
#include <ska_hash/unordered_map.hpp>
#include <unordered_set>
Go to the source code of this file.
Typedefs | |
template<typename K, typename H = std::hash<K>, typename E = std::equal_to<K>, typename A = std::allocator<K>> | |
using | qb::unordered_flat_set = ska::flat_hash_set<K, H, E, A> |
A high-performance flat hash set implementation. | |
template<typename K, typename H = std::hash<K>, typename E = std::equal_to<K>, typename A = std::allocator<K>> | |
using | qb::unordered_set = std::unordered_set<K, H, E, A> |
The primary unordered set implementation. |
Optimized unordered set implementations.
This file provides optimized and specialized unordered set implementations for the QB framework. It includes high-performance alternatives to the standard unordered_set using flat hash sets from the ska_hash library.
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
using qb::unordered_flat_set = ska::flat_hash_set<K, H, E, A> |
A high-performance flat hash set implementation.
This is a type alias for ska::flat_hash_set which provides better performance characteristics than std::unordered_set for many use cases. It uses open addressing with robin hood hashing for better cache locality and performance.
K | The key type |
H | The hash function type (defaults to std::hash<K>) |
E | The equality function type (defaults to std::equal_to<K>) |
A | The allocator type |