blob: 4673e9e27e31b7baa06fe396750a8d4adcbf59ac (
plain)
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
#ifndef INDEXED_LIST_H
#define INDEXED_LIST_H
#include <assert.h>
#include "array_list.h"
class indexed_list_object {
public:
virtual ~indexed_list_object() {}
int32_t list_index;
};
template<typename T>
class indexed_list_element : public indexed_list_object {
public:
T value;
indexed_list_element(T value) : value(value) {
}
};
/**
* An array list of objects that are aware of their position in the list.
* Normally, objects in this list should derive from the base class
* "indexed_list_object" however because of nasty Rust compiler dependencies
* on the layout of runtime objects we cannot always derive from this
* base class, so instead we just enforce the informal protocol that any
* object inserted in this list must define a "int32_t list_index" member.
*/
template<typename T> class indexed_list {
array_list<T*> list;
public:
int32_t append(T *value);
bool pop(T **value);
/**
* Same as pop(), except that it returns NULL if the list is empty.
*/
T* pop_value();
size_t length() const {
return list.size();
}
bool is_empty() const {
return list.is_empty();
}
int32_t remove(T* value);
T * operator[](int32_t index);
const T * operator[](int32_t index) const;
~indexed_list() {}
};
template<typename T> int32_t
indexed_list<T>::append(T *value) {
value->list_index = list.push(value);
return value->list_index;
}
/**
* Swap delete the last object in the list with the specified object.
*/
template<typename T> int32_t
indexed_list<T>::remove(T *value) {
assert (value->list_index >= 0);
assert (value->list_index < (int32_t)list.size());
int32_t removeIndex = value->list_index;
T *last = 0;
list.pop(&last);
if (last->list_index == removeIndex) {
last->list_index = -1;
return removeIndex;
} else {
value->list_index = -1;
list[removeIndex] = last;
last->list_index = removeIndex;
return removeIndex;
}
}
template<typename T> bool
indexed_list<T>::pop(T **value) {
return list.pop(value);
}
template<typename T> T*
indexed_list<T>::pop_value() {
T *value = NULL;
if (list.pop(&value)) {
return value;
}
return NULL;
}
template <typename T> T *
indexed_list<T>::operator[](int32_t index) {
T *value = list[index];
assert(value->list_index == index);
return value;
}
template <typename T> const T *
indexed_list<T>::operator[](int32_t index) const {
T *value = list[index];
assert(value->list_index == index);
return value;
}
#endif /* INDEXED_LIST_H */
|
