<
classValueType>
17 usingvalue_type = ValueType;
19std::shared_ptr<Node<ValueType>> next = {};
22template<
typenameNode,
typenameAction>
23voidtraverse(
const Node*
constinNode,
constAction& action) {
26traverse(inNode->next.get(), action);
30template<
typenameNode>
31voiddisplay_all(
const Node*
constinNode) {
33[](
const Node& curNode) { std::cout << curNode.data <<
" "; });
36template<
typenameNode>
37std::vector<typename Node::value_type> push_all_to_vector(
38 const Node*
constinNode,
conststd::size_t expected_size = 0) {
39std::vector<typename Node::value_type> res;
40res.reserve(expected_size);
42[&res](
const Node& curNode) { res.push_back(curNode.data); });
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4