HelenOS sources
second 186 uspace/drv/bus/isa/i8237.c dma_controller_regs_second_t *second;
second 270 uspace/drv/bus/isa/i8237.c .second = NULL,
second 295 uspace/drv/bus/isa/i8237.c sizeof(dma_controller_regs_second_t), (void **) &controller->second);
second 302 uspace/drv/bus/isa/i8237.c pio_write_8(&controller->second->master_reset, 0xff);
second 278 uspace/lib/cpp/include/__bits/adt/map.hpp return parent->value.second;
second 283 uspace/lib/cpp/include/__bits/adt/map.hpp return node->value.second;
second 290 uspace/lib/cpp/include/__bits/adt/map.hpp return parent->value.second;
second 295 uspace/lib/cpp/include/__bits/adt/map.hpp return node->value.second;
second 303 uspace/lib/cpp/include/__bits/adt/map.hpp return it->second;
second 311 uspace/lib/cpp/include/__bits/adt/map.hpp return it->second;
second 429 uspace/lib/cpp/include/__bits/adt/map.hpp parent->value.second = forward<T>(val);
second 448 uspace/lib/cpp/include/__bits/adt/map.hpp parent->value.second = forward<T>(val);
second 409 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp target->value.second = forward<T>(val);
second 445 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp target->value.second = forward<T>(val);
second 563 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return current->value.second;
second 575 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return node->value.second;
second 591 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return current->value.second;
second 603 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return node->value.second;
second 611 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return it->second;
second 619 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return it->second;
second 1182 uspace/lib/cpp/include/__bits/random.hpp : a_{p.first}, b_{p.second}
second 1199 uspace/lib/cpp/include/__bits/random.hpp auto range = p.second - p.first + 1;
second 1222 uspace/lib/cpp/include/__bits/random.hpp b_ = p.second;
second 1292 uspace/lib/cpp/include/__bits/random.hpp : a_{p.first}, b_{p.second}
second 1311 uspace/lib/cpp/include/__bits/random.hpp auto range = p.second - p.first + 1;
second 1336 uspace/lib/cpp/include/__bits/random.hpp b_ = p.second;
second 360 uspace/lib/cpp/include/__bits/tuple/tuple.hpp get<1>(*this) = p.second;
second 368 uspace/lib/cpp/include/__bits/tuple/tuple.hpp get<1>(*this) = forward<U2>(p.second);
second 411 uspace/lib/cpp/include/__bits/tuple/tuple.hpp get<1>(*this) = p.second;
second 420 uspace/lib/cpp/include/__bits/tuple/tuple.hpp get<1>(*this) = forward<U2>(p.second);
second 207 uspace/lib/cpp/include/__bits/utility/utility.hpp T2 second;
second 213 uspace/lib/cpp/include/__bits/utility/utility.hpp : first{}, second{}
second 217 uspace/lib/cpp/include/__bits/utility/utility.hpp : first{x}, second{y}
second 227 uspace/lib/cpp/include/__bits/utility/utility.hpp : first(other.first), second(other.second)
second 233 uspace/lib/cpp/include/__bits/utility/utility.hpp second(forward<second_type>(other.second))
second 239 uspace/lib/cpp/include/__bits/utility/utility.hpp second{aux::from_tuple<second_type>(move(second_args))}
second 245 uspace/lib/cpp/include/__bits/utility/utility.hpp second = other.second;
second 254 uspace/lib/cpp/include/__bits/utility/utility.hpp second = other.second;
second 262 uspace/lib/cpp/include/__bits/utility/utility.hpp second = forward<second_type>(other.second);
second 271 uspace/lib/cpp/include/__bits/utility/utility.hpp second = forward<second_type>(other.second);
second 278 uspace/lib/cpp/include/__bits/utility/utility.hpp noexcept(std::swap(second, other.second))
second 282 uspace/lib/cpp/include/__bits/utility/utility.hpp std::swap(second, other.second);
second 294 uspace/lib/cpp/include/__bits/utility/utility.hpp return lhs.first == rhs.first && lhs.second == rhs.second;
second 302 uspace/lib/cpp/include/__bits/utility/utility.hpp (!(rhs.first < lhs.first) && lhs.second < rhs.second);
second 386 uspace/lib/cpp/include/__bits/utility/utility.hpp return p.second;
second 396 uspace/lib/cpp/include/__bits/utility/utility.hpp return p.second;
second 406 uspace/lib/cpp/include/__bits/utility/utility.hpp return forward<T2>(p.second);
second 155 uspace/lib/cpp/src/__bits/test/algorithm.cpp test_eq("mismatch pt2", res14.second, &data5[4]);
second 158 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace succession", res1.second, true);
second 160 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace equivalence pt2", res1.first->second, 2);
second 163 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace failure", res2.second, false);
second 165 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace equivalence pt2", res2.first->second, 2);
second 170 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first emplace_hint equivalence pt2", res3->second, 4);
second 175 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second emplace_hint equivalence pt2", res4->second, 4);
second 179 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("conversion insert succession", res5.second, true);
second 181 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("conversion insert equivalence pt2", res5.first->second, std::string{"A"});
second 184 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first insert succession", res6.second, true);
second 186 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("first insert equivalence pt2", res6.first->second, std::string{"B"});
second 189 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second insert failure", res7.second, false);
second 191 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("second insert equivalence pt2", res7.first->second, std::string{"B"});
second 194 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("insert_or_*assign* result", res8.second, false);
second 196 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("insert_or_*assign* equivalence pt2", res8.first->second, std::string{"D"});
second 199 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("*insert*_or_assign result", res9.second, true);
second 201 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("*insert*_or_assign equivalence pt2", res9.first->second, std::string{"E"});
second 253 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of present key pt2", res5.second->first, 5);
second 257 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("equal_range of absent key pt2", res6.second->first, 15);
second 299 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit emplace pt2", res2->second, 2);
second 304 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique emplace pt2", res3->second, 5);
second 309 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi duplicit insert pt2", res4->second, 6);
second 314 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("multi unique insert pt2", res5->second, 8);
second 417 uspace/lib/cpp/src/__bits/test/map.cpp res1.first, res1.second
second 424 uspace/lib/cpp/src/__bits/test/map.cpp res2.first, res2.second
second 431 uspace/lib/cpp/src/__bits/test/map.cpp res3.first, res3.second
second 121 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first emplace succession", res1.second, true);
second 125 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second emplace failure", res2.second, false);
second 138 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("conversion insert succession", res5.second, true);
second 142 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("first insert succession", res6.second, true);
second 146 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("second insert failure", res7.second, false);
second 202 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of present key pt2", *res5.second, 5);
second 206 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("equal_range of absent key pt2", *res6.second, 15);
second 284 uspace/lib/cpp/src/__bits/test/set.cpp res1.first, res1.second
second 291 uspace/lib/cpp/src/__bits/test/set.cpp res2.first, res2.second
second 298 uspace/lib/cpp/src/__bits/test/set.cpp res3.first, res3.second
second 140 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace succession", res1.second, true);
second 142 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace equivalence pt2", res1.first->second, 2);
second 145 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace failure", res2.second, false);
second 147 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace equivalence pt2", res2.first->second, 2);
second 152 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first emplace_hint equivalence pt2", res3->second, 4);
second 157 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second emplace_hint equivalence pt2", res4->second, 4);
second 161 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("conversion insert succession", res5.second, true);
second 163 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("conversion insert equivalence pt2", res5.first->second, std::string{"A"});
second 166 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first insert succession", res6.second, true);
second 168 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("first insert equivalence pt2", res6.first->second, std::string{"B"});
second 171 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second insert failure", res7.second, false);
second 173 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("second insert equivalence pt2", res7.first->second, std::string{"B"});
second 176 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert_or_*assign* result", res8.second, false);
second 178 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert_or_*assign* equivalence pt2", res8.first->second, std::string{"D"});
second 181 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("*insert*_or_assign result", res9.second, true);
second 183 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("*insert*_or_assign equivalence pt2", res9.first->second, std::string{"E"});
second 194 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert with constructible argument pt1", res12.second, true);
second 196 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("insert with constructible argument pt3", res12.first->second, std::string{"test"});
second 236 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit emplace pt2", res2->second, 2);
second 241 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique emplace pt2", res3->second, 5);
second 246 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi duplicit insert pt2", res4->second, 6);
second 251 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("multi unique insert pt2", res5->second, 8);
second 111 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first emplace succession", res1.second, true);
second 115 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second emplace failure", res2.second, false);
second 128 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("conversion insert succession", res5.second, true);
second 132 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("first insert succession", res6.second, true);
second 136 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("second insert failure", res7.second, false);
second 47 uspace/lib/cpp/src/ios.cpp callback.first(erase_event, *this, callback.second);
second 117 uspace/lib/cpp/src/ios.cpp callback.first(imbue_event, *this, callback.second);
second 114 uspace/lib/posix/src/fnmatch.c static int _coll_elm_between(coll_elm_t first, coll_elm_t second,
second 117 uspace/lib/posix/src/fnmatch.c return *str >= first && *str <= second;
HelenOS homepage, sources at GitHub