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
|
/*****
* array.h
* Tom Prince 2005/06/18
*
* Array type used by virtual machine.
*****/
#ifndef ARRAY_H
#define ARRAY_H
#include "vm.h"
#include "common.h"
#include "item.h"
namespace vm {
// Arrays are vectors with push and pop functions.
class array : public mem::vector<item> {
bool cycle;
void setNonBridgingSlice(size_t l, size_t r, mem::vector<item> *a);
void setBridgingSlice(size_t l, size_t r, mem::vector<item> *a);
public:
array() : cycle(false) {}
array(size_t n)
: mem::vector<item>(n), cycle(false)
{}
array(size_t n, item i, Int depth);
void push(item i)
{
push_back(i);
}
item pop()
{
item i=back();
pop_back();
return i;
}
template <typename T>
T read(size_t i) const
{
return get<T>((*this)[i]);
}
array *slice(Int left, Int right);
void setSlice(Int left, Int right, array *a);
void cyclic(bool b) {
cycle=b;
}
bool cyclic() const {
return cycle;
}
array *copyToDepth(Int depth);
};
template <typename T>
inline T read(const array *a, size_t i)
{
return a->array::read<T>(i);
}
template <typename T>
inline T read(const array &a, size_t i)
{
return a.array::read<T>(i);
}
inline size_t checkArray(const vm::array *a)
{
if(a == 0) vm::error("dereference of null array");
return a->size();
}
inline void checkEqual(size_t i, size_t j) {
if(i == j) return;
ostringstream buf;
buf << "operation attempted on arrays of different lengths: "
<< i << " != " << j;
vm::error(buf);
}
inline size_t checkArrays(const vm::array *a, const vm::array *b)
{
size_t asize=checkArray(a);
size_t bsize=checkArray(b);
checkEqual(asize,bsize);
return asize;
}
// Tests if an item is actually an array. This needs to be defined here,
// after the array type is declared.
inline bool isarray(const item& it)
{
return *it.kind == typeid(array);
}
// Copies an item to a depth d. If d==0 or if the item is not array, then the
// item is just returned without copying, otherwise, the array and its
// subarrays are copied as deeply as possible up to a depth d.
item copyItemToDepth(item i, Int depth);
} // namespace vm
#endif // ARRAY_H
|
