HelenOS sources
test_eq 62 uspace/lib/cpp/include/__bits/test/test.hpp test_eq(tname, expr, true);
test_eq 126 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue initialized from deque not empty", q.empty(), false);
test_eq 127 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue initialized form queue size", q.size(), 1U);
test_eq 128 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("single element queue front == back", q.front(), q.back());
test_eq 131 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue push", q.back(), 2);
test_eq 132 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue size", q.size(), 2U);
test_eq 135 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue pop", q.front(), 2);
test_eq 138 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue emplace", q.back(), 4);
test_eq 147 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from iterator range not empty", q1.empty(), false);
test_eq 148 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from iterator range size", q1.size(), 5U);
test_eq 151 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue push pt1", q1.size(), 6U);
test_eq 152 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue push pt2", q1.top(), 9);
test_eq 154 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq(
test_eq 164 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from vector and compare not empty", q2.empty(), false);
test_eq 165 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from vector and compare size", q2.size(), 5U);
test_eq 168 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue push pt1", q2.size(), 6U);
test_eq 169 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue push pt2", q2.top(), 1);
test_eq 171 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq(
test_eq 183 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack initialized from deque top", s.top(), 1);
test_eq 184 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack initialized from deque size", s.size(), 1U);
test_eq 185 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack initialized from deque not empty", s.empty(), false);
test_eq 188 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack push top", s.top(), 2);
test_eq 189 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack push size", s.size(), 2U);
test_eq 192 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack pop top", s.top(), 1);
test_eq 193 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack pop size", s.size(), 1U);
test_eq 102 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 108 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("find", res7, &data2[3]);
test_eq 114 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("find_if", res8, &data2[3]);
test_eq 120 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("find_if_not", res9, &data2[3]);
test_eq 126 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("adjacent_find pt1", res10, &data3[2]);
test_eq 134 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("adjacent_find pt2", res11, &data3[5]);
test_eq 137 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("count", res12, 2);
test_eq 145 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("count_if", res13, 4);
test_eq 154 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("mismatch pt1", res14.first, &data4[4]);
test_eq 155 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("mismatch pt2", res14.second, &data5[4]);
test_eq 200 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 204 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("copy pt2", res1, data2.end());
test_eq 212 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 216 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("copy_n pt2", res2, &data3[6]);
test_eq 227 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 231 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("copy_if pt2", res3, data4.end());
test_eq 248 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 256 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("move pt3", res4, data7.end());
test_eq 268 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 272 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 276 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("swap_ranges pt3", res5, data9.end());
test_eq 279 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("swap_iter pt1", data8[0], 1);
test_eq 280 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("swap_iter pt2", data9[0], 10);
test_eq 289 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq(
test_eq 294 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("transform pt2", res6, data10.end());
test_eq 46 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 53 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 57 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 63 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 70 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 75 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 84 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 91 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 96 uspace/lib/cpp/src/__bits/test/array.cpp test_eq(
test_eq 106 uspace/lib/cpp/src/__bits/test/array.cpp test_eq("structured binding part 1", a, 1);
test_eq 107 uspace/lib/cpp/src/__bits/test/array.cpp test_eq("structured binding part 2", b, 2);
test_eq 108 uspace/lib/cpp/src/__bits/test/array.cpp test_eq("structured binding part 3", c, 3);
test_eq 59 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 71 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("from number iterating over bits", i, 8U);
test_eq 74 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 86 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("from string iterating over bits", i, 8U);
test_eq 89 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 95 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 101 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 107 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 113 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 123 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 129 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 137 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 146 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq(
test_eq 157 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("set", b1[3], true);
test_eq 160 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("reset", b1[3], false);
test_eq 163 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("flip", b1[3], true);
test_eq 166 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("lshift new", b1[2], true);
test_eq 167 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("lshift old", b1[3], false);
test_eq 170 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("rshift new", b1[2], false);
test_eq 171 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("rshift old", b1[3], true);
test_eq 173 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("any1", b1.any(), true);
test_eq 174 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("none1", b1.none(), false);
test_eq 175 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("all1", b1.all(), false);
test_eq 183 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("set + all", b1.all(), true);
test_eq 186 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("reset + none", b1.none(), true);
test_eq 191 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("flip all", b2, b3);
test_eq 195 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("and", (b4 & b5), std::bitset<8>{0b0010'0100});
test_eq 196 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("or", (b4 | b5), std::bitset<8>{0b1011'1101});
test_eq 197 uspace/lib/cpp/src/__bits/test/bitset.cpp test_eq("count", b4.count(), 4U);
test_eq 58 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 66 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 74 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 81 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 88 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 93 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("move construction - origin empty", d4.empty(), true);
test_eq 96 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 103 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 110 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 115 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("move assignment - origin empty", d4.empty(), true);
test_eq 118 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 126 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 133 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 140 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 154 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 161 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 171 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 178 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 185 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("resize to 0", d2.empty(), true);
test_eq 193 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_back to empty equivalence", d1[0], 42);
test_eq 194 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_back to empty size", d1.size(), 1U);
test_eq 197 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_front after push_back equivalence", d1[0], 21);
test_eq 198 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_front after push_back size", d1.size(), 2U);
test_eq 202 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("back after bucket test", d1.back(), 100);
test_eq 205 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("back after pop_back", d1.back(), 99);
test_eq 207 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("front after pop_front", d1.back(), 99);
test_eq 212 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("front after bucket test", d1.front(), 100);
test_eq 217 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_front to empty equivalence", d2[0], 42);
test_eq 218 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_front to empty size", d2.size(), 1U);
test_eq 221 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_back after push_front equivalence", d2[1], 21);
test_eq 222 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("push_back after push_front size", d2.size(), 2U);
test_eq 225 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("clear() - empty()", d2.empty(), true);
test_eq 226 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("clear() - iterators", d2.begin(), d2.end());
test_eq 243 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 250 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 261 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 269 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 277 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 284 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 289 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq(
test_eq 93 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("reference_wrapper equivalence after modification pt1", ref.get(), 5);
test_eq 94 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("reference_wrapper equivalence after modification pt2", x, 5);
test_eq 98 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("reference_wrapper equivalence after assignment pt1", ref.get(), 10);
test_eq 99 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("reference_wrapper equivalence after assignment pt2", x, 5);
test_eq 104 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("reference_wrapper function invoke", res, 7);
test_eq 112 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("function from function pointer", res1, 3);
test_eq 118 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("function from lambda", res2, 'C');
test_eq 119 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("function from lambda - capture", x, 42);
test_eq 131 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("bind placeholder", res1, 4);
test_eq 136 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("bind reverse placeholder order", res2, 65);
test_eq 143 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("bind std::ref as bound", y, 1337);
test_eq 144 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("bind std::ref as unbound", x, 42);
test_eq 149 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("bind all arguments bound", res3, 1757);
test_eq 155 uspace/lib/cpp/src/__bits/test/functional.cpp test_eq("mem_fn", res4, 9);
test_eq 106 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("swap switches states pt1", s1, p1.__state());
test_eq 107 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("swap switches states pt2", s2, p2.__state());
test_eq 110 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("move construction state moved", s1, p3.__state());
test_eq 111 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("move construction source empty", p1.__state(), nullptr);
test_eq 114 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("move assignment state move", s1, p1.__state());
test_eq 115 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("move assignment source empty", p3.__state(), nullptr);
test_eq 119 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("set_value sets value", s1->get(), 42);
test_eq 132 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount in basic case", s1->refs(), 2);
test_eq 136 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("simple case get", f1.get(), 1);
test_eq 146 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("parallel get waits and has correct value", f2.get(), 42);
test_eq 158 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("after wait value is correct", s3->get(), 42);
test_eq 177 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount with just promise", s5->refs(), 1);
test_eq 180 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount after creating future", s5->refs(), 2);
test_eq 182 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount after future is destroyed", s5->refs(), 1);
test_eq 183 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("state not destroyed with future", mock::destructor_calls, 0U);
test_eq 185 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("state destroyed with promise", mock::destructor_calls, 1U);
test_eq 196 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("move construction only increments refcount once", s6->refs(), 2);
test_eq 199 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount after promise is destroyed", s6->refs(), 1);
test_eq 200 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("state not destroyed with promise", mock::destructor_calls, 0U);
test_eq 202 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("state destroyed with future", mock::destructor_calls, 1U);
test_eq 206 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("wait_for timeout", res7, std::future_status::timeout);
test_eq 209 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("wait_until timeout", res7, std::future_status::timeout);
test_eq 218 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("wait_for ready", res7, std::future_status::ready);
test_eq 229 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("wait_until ready", res8, std::future_status::ready);
test_eq 237 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("reference equal to original", x, y);
test_eq 240 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("equal after modifying original", x, y);
test_eq 243 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("equal after modifying reference", x, y);
test_eq 253 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("ret async default policy", res1.get(), 42);
test_eq 260 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("ret async deferred policy", res2.get(), 42);
test_eq 267 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("ret async async policy", res3.get(), 42);
test_eq 277 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("void async", x, 42);
test_eq 296 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("result stored in future correct", f1.get(), 11);
test_eq 305 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("no argument packaged_task return value correct", f2.get(), 42);
test_eq 308 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("reset causes refcount decrement", f2.__state()->refs(), 1);
test_eq 312 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("invocation after reset returns correct value", f3.get(), 42);
test_eq 322 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("shared state moved on share", sf1.__state(), s1);
test_eq 323 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("no refcount increment on share", s1->refs(), 2);
test_eq 327 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount increment on copy", s1->refs(), 3);
test_eq 328 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("shared state shared between copies", sf1.__state(), sf2.__state());
test_eq 330 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("refcount decrement when copy gets destroyed", s1->refs(), 2);
test_eq 348 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("first result correct", res1, 42);
test_eq 349 uspace/lib/cpp/src/__bits/test/future.cpp test_eq("second result correct", res2, 42);
test_eq 58 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 65 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 72 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 79 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 84 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("size", l4.size(), 6U);
test_eq 85 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("not empty", l4.empty(), false);
test_eq 88 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 93 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("move initializaiton - origin empty pt1", l4.empty(), true);
test_eq 94 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("move initializaiton - origin empty pt2", l4.size(), 0U);
test_eq 97 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 102 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("copy assignment size", l4.size(), l5.size());
test_eq 105 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 110 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("move assignment - origin empty", l4.empty(), true);
test_eq 114 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 119 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("initializer_list assignment pt2", l4.size(), 5U);
test_eq 122 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 127 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("iterator range assign() pt2", l5.size(), 5U);
test_eq 130 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 135 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("n*value assign() pt2", l5.size(), 6U);
test_eq 138 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 143 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("initializer_list assign() pt2", l5.size(), 5U);
test_eq 146 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 152 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("front", l5.front(), 5);
test_eq 153 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("back", l5.back(), 1);
test_eq 159 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list", l1.empty(), true);
test_eq 162 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list push_back pt1", l1.size(), 1U);
test_eq 163 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list push_back pt2", l1.empty(), false);
test_eq 164 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list push_back pt3", l1.front(), 1);
test_eq 165 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list push_back pt4", l1.back(), 1);
test_eq 168 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("push_front pt1", l1.size(), 2U);
test_eq 169 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("push_front pt2", l1.front(), 2);
test_eq 170 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("push_front pt3", l1.back(), 1);
test_eq 173 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("pop_back pt1", l1.size(), 1U);
test_eq 174 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("pop_back pt2", l1.back(), 2);
test_eq 177 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("size", l1.size(), 2U);
test_eq 180 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("pop_front", l1.front(), 2);
test_eq 184 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 196 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 207 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 218 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 230 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 237 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("clear empty", l1.empty(), true);
test_eq 238 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("clear size", l1.size(), 0U);
test_eq 251 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 256 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("splice pt2", l3.empty(), true);
test_eq 259 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 264 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 269 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("splice size pt1", l2.size(), 7U);
test_eq 270 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("splice size pt2", l3.size(), 3U);
test_eq 277 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 282 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("remove size", l4.size(), 8U);
test_eq 285 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 290 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("remove_if size", l4.size(), 4U);
test_eq 296 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 301 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("unique size", l5.size(), 6U);
test_eq 307 uspace/lib/cpp/src/__bits/test/list.cpp test_eq(
test_eq 312 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("unique predicate size", l6.size(), 7U);
test_eq 81 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 86 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("size", m1.size(), 7U);
test_eq 89 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 96 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 103 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 108 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("move initialization - origin empty", m1.size(), 0U);
test_eq 109 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("empty", m1.empty(), true);
test_eq 112 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 119 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 124 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("move assignment - origin empty", m1.size(), 0U);
test_eq 127 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 144 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt1", map["a"], 5U);
test_eq 145 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt2", map["b"], 4U);
test_eq 146 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt3", map["c"], 2U);
test_eq 147 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt4", map["d"], 2U);
test_eq 148 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt5", map["e"], 3U);
test_eq 149 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("histogram pt6", map["f"], 0U);
test_eq 150 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("at", map.at("a"), 5U);
test_eq 158 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace succession", res1.second, true);
test_eq 159 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace equivalence pt1", res1.first->first, 1);
test_eq 160 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace equivalence pt2", res1.first->second, 2);
test_eq 163 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace failure", res2.second, false);
test_eq 164 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace equivalence pt1", res2.first->first, 1);
test_eq 165 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace equivalence pt2", res2.first->second, 2);
test_eq 168 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace_hint succession", (res3 != map1.end()), true);
test_eq 169 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace_hint equivalence pt1", res3->first, 2);
test_eq 170 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace_hint equivalence pt2", res3->second, 4);
test_eq 173 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace_hint failure", (res4 != map1.end()), true);
test_eq 174 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace_hint equivalence pt1", res4->first, 2);
test_eq 175 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace_hint equivalence pt2", res4->second, 4);
test_eq 179 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("conversion insert succession", res5.second, true);
test_eq 180 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("conversion insert equivalence pt1", res5.first->first, 5);
test_eq 181 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("conversion insert equivalence pt2", res5.first->second, std::string{"A"});
test_eq 184 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first insert succession", res6.second, true);
test_eq 185 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first insert equivalence pt1", res6.first->first, 6);
test_eq 186 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first insert equivalence pt2", res6.first->second, std::string{"B"});
test_eq 189 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second insert failure", res7.second, false);
test_eq 190 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second insert equivalence pt1", res7.first->first, 6);
test_eq 191 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second insert equivalence pt2", res7.first->second, std::string{"B"});
test_eq 194 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("insert_or_*assign* result", res8.second, false);
test_eq 195 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("insert_or_*assign* equivalence pt1", res8.first->first, 6);
test_eq 196 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("insert_or_*assign* equivalence pt2", res8.first->second, std::string{"D"});
test_eq 199 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("*insert*_or_assign result", res9.second, true);
test_eq 200 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("*insert*_or_assign equivalence pt1", res9.first->first, 7);
test_eq 201 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("*insert*_or_assign equivalence pt2", res9.first->second, std::string{"E"});
test_eq 204 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase", map2.find(7), map2.end());
test_eq 205 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("highest erased", res10, map2.end());
test_eq 208 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase by key pt1", res11, 1U);
test_eq 210 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase by key pt2", res12, 0U);
test_eq 215 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by key pt1", res13, 1U);
test_eq 216 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by key pt2", map3.empty(), true);
test_eq 220 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by iterator pt1", res14, map3.end());
test_eq 221 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by iterator pt2", map3.empty(), true);
test_eq 224 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("clear", map2.empty(), true);
test_eq 228 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("count", res15, 1U);
test_eq 240 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("lower_bound of present key", res1->first, 5);
test_eq 243 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("lower_bound of absent key", res2->first, 9);
test_eq 246 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("upper_bound of present key", res3->first, 8);
test_eq 249 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("upper_bound of absent key", res4->first, 15);
test_eq 252 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of present key pt1", res5.first->first, 4);
test_eq 253 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of present key pt2", res5.second->first, 5);
test_eq 256 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of absent key pt1", res6.first->first, 9);
test_eq 257 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of absent key pt2", res6.second->first, 15);
test_eq 288 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 295 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi count", res1, 3U);
test_eq 298 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit emplace pt1", res2->first, 7);
test_eq 299 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit emplace pt2", res2->second, 2);
test_eq 300 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit emplace pt3", mmap.count(7), 2U);
test_eq 303 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique emplace pt1", res3->first, 8);
test_eq 304 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique emplace pt2", res3->second, 5);
test_eq 305 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique emplace pt3", mmap.count(8), 1U);
test_eq 308 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit insert pt1", res4->first, 8);
test_eq 309 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit insert pt2", res4->second, 6);
test_eq 310 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit insert pt3", mmap.count(8), 2U);
test_eq 313 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique insert pt1", res5->first, 9);
test_eq 314 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique insert pt2", res5->second, 8);
test_eq 315 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique insert pt3", mmap.count(9), 1U);
test_eq 318 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi erase by key pt1", res6, 2U);
test_eq 319 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi erase by key pt2", mmap.count(8), 0U);
test_eq 322 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi erase by iterator pt1", res7->first, 7);
test_eq 323 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi erase by iterator pt2", mmap.count(7), 1U);
test_eq 354 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 380 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 414 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 421 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 428 uspace/lib/cpp/src/__bits/test/map.cpp test_eq(
test_eq 111 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr get() when non-null", (ptr.get() != nullptr), true);
test_eq 112 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr operator bool when non-null", (bool)ptr, true);
test_eq 114 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr make_unique", mock::constructor_calls, 1U);
test_eq 115 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr out of scope", mock::destructor_calls, 1U);
test_eq 122 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr release", mock::destructor_calls, 1U);
test_eq 129 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr reset", mock::destructor_calls, 2U);
test_eq 134 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr get() when null", ptr1.get(), nullptr);
test_eq 135 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr operator bool when null", (bool)ptr1, false);
test_eq 140 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr move pt1", mock::destructor_calls, 0U);
test_eq 142 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr move pt2", mock::destructor_calls, 1U);
test_eq 147 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr make_unique array version", mock::constructor_calls, 10U);
test_eq 150 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("placement new into the array", mock::constructor_calls, 11U);
test_eq 151 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("original not destroyed during placement new", mock::destructor_calls, 0U);
test_eq 153 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("unique_ptr array out of scope", mock::destructor_calls, 10U);
test_eq 161 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr make_shared", mock::constructor_calls, 1U);
test_eq 162 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr unique", ptr1.unique(), true);
test_eq 165 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr copy pt1", ptr1.use_count(), 2L);
test_eq 166 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr copy pt2", ptr2.use_count(), 2L);
test_eq 167 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr copy no constructor call", mock::copy_constructor_calls, 0U);
test_eq 168 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr not unique", ptr1.unique(), false);
test_eq 171 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr move pt1", ptr1.use_count(), 2L);
test_eq 172 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr move pt2", ptr3.use_count(), 2L);
test_eq 173 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr move pt3", ptr2.use_count(), 0L);
test_eq 175 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr move origin empty", (bool)ptr2, false);
test_eq 177 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr copy out of scope", mock::destructor_calls, 0U);
test_eq 179 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared_ptr original out of scope", mock::destructor_calls, 1U);
test_eq 192 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("weak_ptr shares use count", wptr2.use_count(), 1L);
test_eq 193 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("weak_ptr not expired", wptr2.expired(), false);
test_eq 196 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("locked ptr increases use count", ptr1.use_count(), 2L);
test_eq 199 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("weak_ptr expired after all shared_ptrs die", wptr1.expired(), true);
test_eq 200 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("shared object destroyed while weak_ptr exists", mock::destructor_calls, 1U);
test_eq 359 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("pointer_traits<Ptr>::pointer_to", dummy_traits1::pointer_to(x).tag, 10);
test_eq 360 uspace/lib/cpp/src/__bits/test/memory.cpp test_eq("pointer_traits<T*>::pointer_to", int_traits::pointer_to(x), &x);
test_eq 62 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("accumulate pt1", res1, 20);
test_eq 70 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("accumulate pt2", res2, 240);
test_eq 73 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("accumulate pt3", res3, 10);
test_eq 81 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("inner_product pt1", res4, 79);
test_eq 92 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("inner_product pt2", res5, 92);
test_eq 101 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq(
test_eq 106 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("partial sum pt2", res6, result.end());
test_eq 115 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq(
test_eq 120 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("partial sum pt4", res7, result.end());
test_eq 126 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq(
test_eq 131 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("adjacent_difference pt2", res8, result.end());
test_eq 140 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq(
test_eq 145 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("adjacent_difference pt4", res9, result.end());
test_eq 149 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq(
test_eq 158 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex literals pt1", c1.real(), 1.f);
test_eq 159 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex literals pt2", c1.imag(), 2.5f);
test_eq 162 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex value initialization", c2, (2.0 + 0.5i));
test_eq 165 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex copy initialization", c3, (2.0 + 0.5i));
test_eq 168 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex conversion initialization", c4, (1.0 + 2.5i));
test_eq 170 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex sum", ((1.0 + 2.5i) + (3.0 + 0.5i)), (4.0 + 3.0i));
test_eq 171 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex sub", ((2.0 + 3.0i) - (1.0 + 5.0i)), (1.0 - 2.0i));
test_eq 172 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex mul", ((2.0 + 2.0i) * (2.0 + 3.0i)), (-2.0 + 10.0i));
test_eq 173 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex div", ((2.0 - 1.0i) / (3.0 + 4.0i)), (0.08 - 0.44i));
test_eq 174 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex unary minus", -(1.0 + 1.0i), (-1.0 - 1.0i));
test_eq 175 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex abs", std::abs(2.0 - 4.0i), 20.0);
test_eq 176 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex real", std::real(2.0 + 3.0i), 2.0);
test_eq 177 uspace/lib/cpp/src/__bits/test/numeric.cpp test_eq("complex imag", std::imag(2.0 + 3.0i), 3.0);
test_eq 41 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 46 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 52 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 57 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 63 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 68 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 74 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 79 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 85 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 89 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 93 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 97 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 101 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 105 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 109 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 113 uspace/lib/cpp/src/__bits/test/ratio.cpp test_eq(
test_eq 63 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 68 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("size", s1.size(), 7U);
test_eq 71 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 78 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 85 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 90 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("move initialization - origin empty", s1.size(), 0U);
test_eq 91 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("empty", s1.empty(), true);
test_eq 94 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 101 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 106 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("move assignment - origin empty", s1.size(), 0U);
test_eq 109 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 121 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first emplace succession", res1.second, true);
test_eq 122 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first emplace equivalence", *res1.first, 1);
test_eq 125 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second emplace failure", res2.second, false);
test_eq 126 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second emplace equivalence", *res2.first, 1);
test_eq 129 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first emplace_hint succession", (res3 != set1.end()), true);
test_eq 130 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first emplace_hint equivalence", *res3, 2);
test_eq 133 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second emplace_hint failure", (res4 != set1.end()), true);
test_eq 134 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second emplace_hint equivalence", *res4, 2);
test_eq 138 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("conversion insert succession", res5.second, true);
test_eq 139 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("conversion insert equivalence", *res5.first, std::string{"A"});
test_eq 142 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first insert succession", res6.second, true);
test_eq 143 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first insert equivalence", *res6.first, std::string{"B"});
test_eq 146 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second insert failure", res7.second, false);
test_eq 147 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second insert equivalence", *res7.first, std::string{"B"});
test_eq 150 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase", set1.find(2), set1.end());
test_eq 151 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("highest erased", res10, set1.end());
test_eq 157 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase by key pt1", res11, 1U);
test_eq 159 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase by key pt2", res12, 0U);
test_eq 164 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by key pt1", res13, 1U);
test_eq 165 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by key pt2", set3.empty(), true);
test_eq 169 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by iterator pt1", res14, set3.end());
test_eq 170 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by iterator pt2", set3.empty(), true);
test_eq 173 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("clear", set2.empty(), true);
test_eq 177 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("count", res15, 1U);
test_eq 189 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("lower_bound of present key", *res1, 5);
test_eq 192 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("lower_bound of absent key", *res2, 9);
test_eq 195 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("upper_bound of present key", *res3, 8);
test_eq 198 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("upper_bound of absent key", *res4, 15);
test_eq 201 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of present key pt1", *res5.first, 4);
test_eq 202 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of present key pt2", *res5.second, 5);
test_eq 205 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of absent key pt1", *res6.first, 9);
test_eq 206 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of absent key pt2", *res6.second, 15);
test_eq 215 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 222 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi count", res1, 3U);
test_eq 225 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi duplicit emplace pt1", *res2, 7);
test_eq 226 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi duplicit emplace pt2", mset.count(7), 2U);
test_eq 229 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi unique emplace pt1", *res3, 8);
test_eq 230 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi unique emplace pt2", mset.count(8), 1U);
test_eq 233 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi duplicit insert pt1", *res4, 8);
test_eq 234 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi duplicit insert pt2", mset.count(8), 2U);
test_eq 237 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi unique insert pt1", *res5, 9);
test_eq 238 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi unique insert pt2", mset.count(9), 1U);
test_eq 241 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi erase by key pt1", res6, 2U);
test_eq 242 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi erase by key pt2", mset.count(8), 0U);
test_eq 245 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi erase by iterator pt1", *res7, 7);
test_eq 246 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("multi erase by iterator pt2", mset.count(7), 1U);
test_eq 255 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 265 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 281 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 288 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 295 uspace/lib/cpp/src/__bits/test/set.cpp test_eq(
test_eq 64 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 68 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 75 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 82 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 87 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 93 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 99 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 106 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 119 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 127 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 136 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 144 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 152 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 160 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 173 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 181 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 189 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 199 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 208 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 221 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 229 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 237 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 245 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 253 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 261 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 269 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 282 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 290 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 298 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 306 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 314 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 322 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 331 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 339 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 347 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 356 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 365 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 374 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 389 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 404 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 410 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 416 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 422 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 428 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 434 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 442 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 448 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 454 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 460 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 468 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 474 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 480 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 486 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 492 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 498 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 504 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 510 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 516 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 522 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 528 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 534 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 540 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 546 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 554 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 560 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 566 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 572 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 578 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 584 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 590 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 598 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 604 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 610 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 616 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 622 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 628 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 634 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 651 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 657 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 663 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 677 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 683 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 689 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 695 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 701 uspace/lib/cpp/src/__bits/test/string.cpp test_eq(
test_eq 60 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("value initialization pt1", std::get<0>(tpl1), 1);
test_eq 61 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("value initialization pt2", std::get<1>(tpl1), .5f);
test_eq 65 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("pair initialization pt1", std::get<0>(tpl2), 2);
test_eq 66 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("pair initialization pt2", std::get<1>(tpl2), 1.f);
test_eq 69 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("pair assignment pt1", std::get<0>(tpl1), 2);
test_eq 70 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("pair assignment pt2", std::get<1>(tpl1), 1.f);
test_eq 75 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("move assignment pt1", std::get<0>(tpl3), std::string{"C"});
test_eq 76 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("move assignment pt2", std::get<1>(tpl3), std::string{"D"});
test_eq 80 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("move initialization pt1", std::get<0>(tpl6), 1);
test_eq 81 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("move initialization pt2", std::get<1>(tpl6), .5f);
test_eq 92 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("make_tuple pt1", std::get<0>(tpl1), 1);
test_eq 93 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("make_tuple pt2", std::get<1>(tpl1), .5f);
test_eq 94 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("make_tuple pt3", std::get<2>(tpl1), std::string{"test"});
test_eq 95 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("make_tuple pt4", std::get<3>(tpl1), true);
test_eq 106 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("modify reference in tuple", i, 3);
test_eq 113 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("modify reference in forward_as_tuple", f, 1.5f);
test_eq 123 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tie unpack pt1", i1, 1);
test_eq 124 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tie unpack pt2", f1, .5f);
test_eq 132 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("structured bindings pt1", i2, 2);
test_eq 133 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("structured bindings pt2", f2, .5f);
test_eq 144 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple == pt1", (tpl1 == tpl2), true);
test_eq 145 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple == pt2", (tpl1 == tpl3), false);
test_eq 146 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple == pt3", (tpl1 == tpl4), false);
test_eq 147 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple < pt1", (tpl1 < tpl2), false);
test_eq 148 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple < pt2", (tpl1 < tpl3), true);
test_eq 149 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple < pt3", (tpl1 < tpl4), true);
test_eq 150 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple < pt4", (tpl1 < tpl5), true);
test_eq 153 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple swap pt1", std::get<0>(tpl1), 2);
test_eq 154 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple swap pt2", std::get<1>(tpl1), 1.f);
test_eq 155 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple swap pt3", std::get<0>(tpl5), 1);
test_eq 156 uspace/lib/cpp/src/__bits/test/tuple.cpp test_eq("tuple swap pt4", std::get<1>(tpl5), .5f);
test_eq 74 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("size", m1.size(), 7U);
test_eq 93 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("move initialization - origin empty", m1.size(), 0U);
test_eq 94 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("empty", m1.empty(), true);
test_eq 107 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("move assignment - origin empty", m1.size(), 0U);
test_eq 126 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt1", unordered_map["a"], 5U);
test_eq 127 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt2", unordered_map["b"], 4U);
test_eq 128 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt3", unordered_map["c"], 2U);
test_eq 129 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt4", unordered_map["d"], 2U);
test_eq 130 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt5", unordered_map["e"], 3U);
test_eq 131 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("histogram pt6", unordered_map["f"], 0U);
test_eq 132 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("at", unordered_map.at("a"), 5U);
test_eq 140 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace succession", res1.second, true);
test_eq 141 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace equivalence pt1", res1.first->first, 1);
test_eq 142 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace equivalence pt2", res1.first->second, 2);
test_eq 145 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace failure", res2.second, false);
test_eq 146 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace equivalence pt1", res2.first->first, 1);
test_eq 147 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace equivalence pt2", res2.first->second, 2);
test_eq 150 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace_hint succession", (res3 != map1.end()), true);
test_eq 151 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace_hint equivalence pt1", res3->first, 2);
test_eq 152 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace_hint equivalence pt2", res3->second, 4);
test_eq 155 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace_hint failure", (res4 != map1.end()), true);
test_eq 156 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace_hint equivalence pt1", res4->first, 2);
test_eq 157 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace_hint equivalence pt2", res4->second, 4);
test_eq 161 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("conversion insert succession", res5.second, true);
test_eq 162 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("conversion insert equivalence pt1", res5.first->first, 5);
test_eq 163 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("conversion insert equivalence pt2", res5.first->second, std::string{"A"});
test_eq 166 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first insert succession", res6.second, true);
test_eq 167 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first insert equivalence pt1", res6.first->first, 6);
test_eq 168 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first insert equivalence pt2", res6.first->second, std::string{"B"});
test_eq 171 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second insert failure", res7.second, false);
test_eq 172 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second insert equivalence pt1", res7.first->first, 6);
test_eq 173 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second insert equivalence pt2", res7.first->second, std::string{"B"});
test_eq 176 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert_or_*assign* result", res8.second, false);
test_eq 177 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert_or_*assign* equivalence pt1", res8.first->first, 6);
test_eq 178 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert_or_*assign* equivalence pt2", res8.first->second, std::string{"D"});
test_eq 181 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("*insert*_or_assign result", res9.second, true);
test_eq 182 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("*insert*_or_assign equivalence pt1", res9.first->first, 7);
test_eq 183 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("*insert*_or_assign equivalence pt2", res9.first->second, std::string{"E"});
test_eq 186 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("erase", map2.find(7), map2.end());
test_eq 189 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("erase by key pt1", res10, 1U);
test_eq 191 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("erase by key pt2", res11, 0U);
test_eq 194 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert with constructible argument pt1", res12.second, true);
test_eq 195 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert with constructible argument pt2", res12.first->first, 11);
test_eq 196 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert with constructible argument pt3", res12.first->second, std::string{"test"});
test_eq 201 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("count", res13, 1U);
test_eq 204 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("clear", map2.empty(), true);
test_eq 232 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi count", res1, 3U);
test_eq 235 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit emplace pt1", res2->first, 7);
test_eq 236 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit emplace pt2", res2->second, 2);
test_eq 237 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit emplace pt3", mmap.count(7), 2U);
test_eq 240 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique emplace pt1", res3->first, 8);
test_eq 241 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique emplace pt2", res3->second, 5);
test_eq 242 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique emplace pt3", mmap.count(8), 1U);
test_eq 245 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit insert pt1", res4->first, 8);
test_eq 246 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit insert pt2", res4->second, 6);
test_eq 247 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit insert pt3", mmap.count(8), 2U);
test_eq 250 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique insert pt1", res5->first, 9);
test_eq 251 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique insert pt2", res5->second, 8);
test_eq 252 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique insert pt3", mmap.count(9), 1U);
test_eq 255 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase by key pt1", res6, 2U);
test_eq 256 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase by key pt2", mmap.count(8), 0U);
test_eq 260 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase keeps bucket intact", (mmap.find(8) != mmap.end()), true);
test_eq 263 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase by iterator pt1", res7->first, 7);
test_eq 264 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi erase by iterator pt2", mmap.count(7), 1U);
test_eq 64 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("size", s1.size(), 7U);
test_eq 83 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("move initialization - origin empty", s1.size(), 0U);
test_eq 84 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("empty", s1.empty(), true);
test_eq 97 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("move assignment - origin empty", s1.size(), 0U);
test_eq 111 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first emplace succession", res1.second, true);
test_eq 112 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first emplace equivalence", *res1.first, 1);
test_eq 115 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second emplace failure", res2.second, false);
test_eq 116 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second emplace equivalence", *res2.first, 1);
test_eq 119 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first emplace_hint succession", (res3 != set1.end()), true);
test_eq 120 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first emplace_hint equivalence", *res3, 2);
test_eq 123 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second emplace_hint failure", (res4 != set1.end()), true);
test_eq 124 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second emplace_hint equivalence", *res4, 2);
test_eq 128 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("conversion insert succession", res5.second, true);
test_eq 129 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("conversion insert equivalence", *res5.first, std::string{"A"});
test_eq 132 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first insert succession", res6.second, true);
test_eq 133 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first insert equivalence", *res6.first, std::string{"B"});
test_eq 136 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second insert failure", res7.second, false);
test_eq 137 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second insert equivalence", *res7.first, std::string{"B"});
test_eq 140 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase", set1.find(2), set1.end());
test_eq 141 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("highest erased", res10, set1.end());
test_eq 147 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase by key pt1", res11, 1U);
test_eq 149 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase by key pt2", res12, 0U);
test_eq 154 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by key pt1", res13, 1U);
test_eq 155 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by key pt2", set3.empty(), true);
test_eq 159 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by iterator pt1", res14, set3.end());
test_eq 160 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by iterator pt2", set3.empty(), true);
test_eq 163 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("clear", set2.empty(), true);
test_eq 167 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("count", res15, 1U);
test_eq 171 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("find", *res16, 15);
test_eq 188 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi count", res1, 3U);
test_eq 191 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi duplicit emplace pt1", *res2, 7);
test_eq 192 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi duplicit emplace pt2", mset.count(7), 2U);
test_eq 195 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi unique emplace pt1", *res3, 8);
test_eq 196 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi unique emplace pt2", mset.count(8), 1U);
test_eq 199 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi duplicit insert pt1", *res4, 8);
test_eq 200 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi duplicit insert pt2", mset.count(8), 2U);
test_eq 203 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi unique insert pt1", *res5, 9);
test_eq 204 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi unique insert pt2", mset.count(9), 1U);
test_eq 207 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi erase by key pt1", res6, 2U);
test_eq 208 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi erase by key pt2", mset.count(8), 0U);
test_eq 211 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi erase by iterator pt1", *res7, 7);
test_eq 212 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("multi erase by iterator pt2", mset.count(7), 1U);
test_eq 65 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 72 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 79 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq("capacity constructor", 11ul, vec3.capacity());
test_eq 82 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 91 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 98 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 103 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 109 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 117 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 126 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 132 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq("move assignment origin empty", vec9.size(), 0U);
test_eq 143 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 148 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 155 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 163 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 171 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 179 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 187 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 202 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 210 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
test_eq 224 uspace/lib/cpp/src/__bits/test/vector.cpp test_eq(
HelenOS homepage, sources at GitHub