flat_list.hpp 1.93 KB
Newer Older
Gauthier Quesnel's avatar
snif  
Gauthier Quesnel committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/* Copyright (C) 2019-2019 INRA
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */

#ifndef ORG_VLEPROJECT_BITS_FLAT_LIST_HPP
#define ORG_VLEPROJECT_BITS_FLAT_LIST_HPP

#include "bits/array.hpp"

namespace bits {

template<typename Object_ID>
struct flat_list
{
    struct item
    {
        item() = default;
        item(Object_ID id_, int next_)
          : id(id_)
          , next(next_)
        {}

        Object_ID id;
        int next;
    };

    std::vector<item> items;
    int head = -1;

    flat_list() = default;
    ~flat_list() = default;

    void emplace(Object_ID id)
    {
        items.emplace_back(id, head);
        head = (int)items.size();
    }

    void clear()
    {
        while (head != -1) {
            auto next = items[head].next;
            items[head].id = -1;
            items[head].next = -1;
            head = next;
        }
    }
};

} // namespace bits

#endif // ORG_VLEPROJECT_BITS_FLAT_LIST_HPP