blob: 460998dadd61586f06ea506e505a77b5ec11de75 (
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
|
//
// NodeAddress.cs
//
// Author:
// Jean-Philippe Bruyère <jp.bruyere@hotmail.com>
//
// Copyright (c) 2016 jp
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Reflection;
using System.Reflection.Emit;
namespace Crow.IML
{
public class NodeAddress : List<Node>
{
public NodeAddress (Node[] nodes) : base(nodes) {
}
public Type NodeType { get { return Count == 0 ? null : this[this.Count -1].CrowType; }}
public override bool Equals (object obj)
{
if (obj == null)
return false;
NodeAddress na = (NodeAddress)obj;
return this.SequenceEqual (na);
}
public override int GetHashCode ()
{
unchecked {
int hash = 19;
foreach (Node n in this)
hash = hash * 31 + (n == null ? 0 : n.GetHashCode ());
return hash;
}
}
public override string ToString ()
{
string tmp = "";
foreach (Node n in this)
tmp += string.Format ("{0};", n.Index);
return tmp;
}
}
public class NamedNodeAddress : NodeAddress {
public string Name;
public NamedNodeAddress(string name, Node[] nodes) : base(nodes){
Name = name;
}
}
}
|
