Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
snode.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
38#include <gtest/gtest.h>
39
40#include <tpl_snode.H>
41
42using namespace Aleph;
43using namespace testing;
44
46{
47 Snode<int> head; // sentinel
48 head.reset();
49
50 Snode<int> n1(1);
51 Snode<int> n2(2);
52
53 head.insert_next(&n1);
54 EXPECT_EQ(head.get_next(), &n1);
55 EXPECT_EQ(head.get_next()->get_data(), 1);
56
57 head.insert_next(&n2);
58 EXPECT_EQ(head.get_next(), &n2);
59 EXPECT_EQ(head.get_next()->get_next(), &n1);
60
61 auto removed = head.remove_next();
62 ASSERT_EQ(removed, &n2);
64
65 removed = head.remove_first();
66 EXPECT_EQ(removed, &n1);
67 EXPECT_TRUE(head.is_empty());
68}
69
71{
72 const Snode<int> node(42);
73 EXPECT_EQ(node.get_data(), 42);
74
75 Snode<int> head;
76 head.reset();
77 head.insert_next(const_cast<Snode<int>*>(&node));
78 const Snode<int> & cref = head;
79 EXPECT_EQ(cref.get_next(), head.get_next());
80}
constexpr bool is_empty() const noexcept
Return true if list is empty.
Definition htlist.H:523
Singly linked node that stores data of type T.
Definition tpl_snode.H:66
Snode * remove_first()
Remove and return the first node (for symmetry with list front).
Definition tpl_snode.H:100
T & get_data()
Return a modifiable reference to the stored data.
Definition tpl_snode.H:73
Snode *& get_next()
Return the next node after this.
Definition tpl_snode.H:91
Snode * remove_next()
Remove the node right after this and return it.
Definition tpl_snode.H:88
#define TEST(name)
Main namespace for Aleph-w library functions.
Definition ah-arena.H:89
DynList< T > maps(const C &c, Op op)
Classic map operation.
Typed singly linked node.