Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
test_tpl_hash_macros.cc
Go to the documentation of this file.
1
2/*
3 Aleph_w
4
5 Data structures & Algorithms
6 version 2.0.0b
7 https://github.com/lrleon/Aleph-w
8
9 This file is part of Aleph-w library
10
11 Copyright (c) 2002-2026 Leandro Rabindranath Leon
12
13 Permission is hereby granted, free of charge, to any person obtaining a copy
14 of this software and associated documentation files (the "Software"), to deal
15 in the Software without restriction, including without limitation the rights
16 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
17 copies of the Software, and to permit persons to whom the Software is
18 furnished to do so, subject to the following conditions:
19
20 The above copyright notice and this permission notice shall be included in all
21 copies or substantial portions of the Software.
22
23 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
24 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
25 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
26 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
27 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
28 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
29 SOFTWARE.
30*/
31
32
43#include <iostream>
44#include <cassert>
45#include <type_traits>
46#include "../tpl_hash.H"
47
48using namespace std;
49using namespace Aleph;
50
51static_assert(std::is_same<HashSet<int>, HashSet<int, OLhashTable, Aleph::equal_to<int>>>::value,
52 "HashSet default backend must remain OLhashTable");
53static_assert(std::is_same<HashMap<int, int>, HashMap<int, int, MapOLhash, Aleph::equal_to<int>>>::value,
54 "HashMap default backend must remain MapOLhash");
55
56int main()
57{
58 cout << "Testing tpl_hash.H with new error macros..." << endl;
59
60 // Test 1: Normal usage should work
61 HashMap<int, string> map1({1, 2, 3}, {"one", "two", "three"});
62 assert(map1.size() == 3);
63 cout << "Test 1 passed: Normal constructor works" << endl;
64
65 // Test 2: Mismatched sizes should throw range_error
66 try {
67 HashMap<int, string> map2({1, 2, 3}, {"one", "two"}); // Mismatched!
68 cerr << "FAIL: Expected range_error was not thrown" << endl;
69 return 1;
70 } catch (const range_error& e) {
71 string msg = e.what();
72 // Error message should contain "size mismatch" - location can be in the
73 // header file where the error is thrown
74 if (msg.find("size mismatch") != string::npos) {
75 cout << "Test 2 passed: range_error thrown correctly" << endl;
76 cout << " Message: " << msg << endl;
77 } else {
78 cerr << "FAIL: Wrong error message: " << msg << endl;
79 return 1;
80 }
81 }
82
83 cout << endl << "SUCCESS: All tests passed!" << endl;
84 return 0;
85}
Main namespace for Aleph-w library functions.
Definition ah-arena.H:89
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
STL namespace.
int main()