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
|
//@beginlicenses@
//@license{chiba-tokyo}{}@
//@license{Grzegorz Jakacki}{2004}@
//
// Copyright (C) 1997-2001 Shigeru Chiba, Tokyo Institute of Technology.
//
// Permission to use, copy, distribute and modify this software and
// its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appears in all copies and that
// both that copyright notice and this permission notice appear in
// supporting documentation.
//
// Shigeru Chiba makes no representations about the suitability of this
// software for any purpose. It is provided "as is" without express or
// implied warranty.
//
// -----------------------------------------------------------------
//
// Permission to use, copy, distribute and modify this software and its
// documentation for any purpose is hereby granted without fee, provided that
// the above copyright notice appears in all copies and that both that copyright
// notice and this permission notice appear in supporting documentation.
//
// Grzegorz Jakacki make(s) no representations about the suitability of this
// software for any purpose. It is provided "as is" without express or implied
// warranty.
//
// Copyright (C) 2004 Grzegorz Jakacki
//
//@endlicenses@
#include <opencxx/parser/PtreeArray.h>
#include <opencxx/parser/NonLeaf.h>
#include <opencxx/parser/TheErrorLog.h>
#include <opencxx/parser/ErrorLog.h>
#include <opencxx/parser/MopMsg.h>
#include <opencxx/parser/GC.h>
namespace Opencxx
{
PtreeArray::PtreeArray(int s)
{
num = 0;
if(s > 8){
size = s;
array = new (GC) Ptree*[s];
}
else{
size = 8;
array = default_buf;
}
}
void PtreeArray::Append(Ptree* p)
{
if(num >= size){
size = size * 2;
Ptree** a = new (GC) Ptree*[size];
memmove(a, array, size_t(num * sizeof(Ptree*)));
array = a;
}
array[num++] = p;
}
Ptree*& PtreeArray::Ref(unsigned i)
{
if(i < num)
return array[i];
else{
TheErrorLog().Report(MopMsg(Msg::Fatal, "PtreeArray", "out of range"));
return array[0];
}
}
Ptree* PtreeArray::All()
{
Ptree* lst = 0;
for(int i = Number() - 1; i >= 0; --i)
lst = new NonLeaf(Ref(i), lst);
return lst;
}
}
|
