blob: 9dc6b27fba4f076a6ef12773962cb1f0538b6b9f (
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
|
/* valaelementaccess.vala
*
* Copyright (C) 2006-2008 Raffaele Sandrini, Jürg Billeter
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author:
* Raffaele Sandrini <raffaele@sandrini.ch>
* Jürg Billeter <j@bitron.ch>
*/
using GLib;
using Gee;
/**
* Represents an array access expression e.g. "a[1,2]".
*/
public class Vala.ElementAccess : Expression {
/**
* Expression representing the container on wich we want to access.
*/
public Expression container { get; set; }
/**
* Expressions representing the indices we want to access inside the container.
*/
private Gee.List<Expression> indices = new ArrayList<Expression> ();
public void append_index (Expression index) {
indices.add (index);
index.parent_node = this;
}
public Gee.List<Expression> get_indices () {
return new ReadOnlyList<Expression> (indices);
}
public ElementAccess (construct Expression container, construct SourceReference source_reference) {
}
public override void accept (CodeVisitor visitor) {
container.accept (visitor);
foreach (Expression e in indices) {
e.accept (visitor);
}
visitor.visit_element_access (this);
}
public override void replace_expression (Expression old_node, Expression new_node) {
if (container == old_node) {
container = new_node;
}
int index = indices.index_of (old_node);
if (index >= 0 && new_node.parent_node == null) {
indices[index] = new_node;
new_node.parent_node = this;
}
}
public override bool is_pure () {
foreach (Expression index in indices) {
if (!index.is_pure ()) {
return false;
}
}
return container.is_pure ();
}
}
|
