libtcod
Loading...
Searching...
No Matches
tree.hpp
Go to the documentation of this file.
1/* BSD 3-Clause License
2 *
3 * Copyright © 2008-2025, Jice and the libtcod contributors.
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright notice,
13 * this list of conditions and the following disclaimer in the documentation
14 * and/or other materials provided with the distribution.
15 *
16 * 3. Neither the name of the copyright holder nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
24 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
31 */
34#pragma once
35#ifndef TCOD_TREE_HPP_
36#define TCOD_TREE_HPP_
37
38#include <utility>
39
40#include "tree.h"
41
42// clang-format off
43class TCODLIB_API TCODTree {
44 public:
45 TCODTree* next{};
46 TCODTree* father{};
47 TCODTree* sons{};
48
49 TCODTree() = default;
50 TCODTree(const TCODTree&) = delete;
51 TCODTree& operator=(const TCODTree&) = delete;
52 TCODTree(TCODTree&& rhs) noexcept { (*this) = std::move(rhs); };
53 TCODTree& operator=(TCODTree&& rhs) noexcept {
54 swap(*this, rhs);
55 return *this;
56 };
57
58 void addSon(TCODTree* data) {
59 data->father = this;
60 TCODTree* last_son = sons;
61 while (last_son && last_son->next) last_son = last_son->next;
62 if (last_son) {
63 last_son->next = data;
64 } else {
65 sons = data;
66 }
67 }
68
69 friend void swap(TCODTree& lhs, TCODTree& rhs) noexcept {
70 std::swap(lhs.next, rhs.next);
71 std::swap(lhs.father, rhs.father);
72 std::swap(lhs.sons, rhs.sons);
73 };
74};
75
76#endif // TCOD_TREE_HPP_
Internal tree container.