|
Lines 1-208
Link Here
|
| 1 |
--- src/dbase/Node.h.orig Sat Nov 27 18:11:57 1999 |
|
|
| 2 |
+++ src/dbase/Node.h Sat Nov 27 18:16:21 1999 |
| 3 |
@@ -101,7 +101,7 @@ |
| 4 |
protected: |
| 5 |
virtual void print(ostream &os) = 0; |
| 6 |
public: |
| 7 |
- virtual operator== (Node &b) = 0; |
| 8 |
+ virtual int operator== (Node &b) = 0; |
| 9 |
virtual void InOrderPrint() = 0; |
| 10 |
virtual void PostOrderPrint() { InOrderPrint(); } |
| 11 |
virtual ~Node() {}; |
| 12 |
@@ -144,7 +144,7 @@ |
| 13 |
virtual void print(ostream &os) = 0; |
| 14 |
|
| 15 |
public: |
| 16 |
- virtual Execute(Route &r) = 0; |
| 17 |
+ virtual void Execute(Route &r) = 0; |
| 18 |
virtual ActionNode *FindFirst(Node_t _type) = 0; |
| 19 |
int operator< (ActionNode &b); |
| 20 |
friend ostream &operator<<(ostream &os, ActionNode *an) { |
| 21 |
@@ -172,7 +172,7 @@ |
| 22 |
type = T_ANDNode; |
| 23 |
} |
| 24 |
|
| 25 |
- virtual operator== (Node& b) { |
| 26 |
+ virtual int operator== (Node& b) { |
| 27 |
return b.type == T_ANDNode |
| 28 |
&& left == ((ANDNode&) b).left |
| 29 |
&& right == ((ANDNode&) b).right; |
| 30 |
@@ -200,7 +200,7 @@ |
| 31 |
type = T_ORNode; |
| 32 |
} |
| 33 |
|
| 34 |
- virtual operator== (Node& b) { |
| 35 |
+ virtual int operator== (Node& b) { |
| 36 |
return b.type == T_ORNode |
| 37 |
&& left == ((ORNode&) b).left |
| 38 |
&& right == ((ORNode&) b).right; |
| 39 |
@@ -227,7 +227,7 @@ |
| 40 |
type = T_NotNode; |
| 41 |
} |
| 42 |
|
| 43 |
- virtual operator== (Node& b) { |
| 44 |
+ virtual int operator== (Node& b) { |
| 45 |
return b.type == T_NotNode |
| 46 |
&& left == ((NotNode&) b).left; |
| 47 |
} |
| 48 |
@@ -256,7 +256,7 @@ |
| 49 |
type = T_AssignNode; |
| 50 |
} |
| 51 |
|
| 52 |
- virtual operator== (Node& b) { |
| 53 |
+ virtual int operator== (Node& b) { |
| 54 |
return b.type == T_AssignNode |
| 55 |
&& val == ((AssignNode&) b).val |
| 56 |
&& left == ((AssignNode&) b).left; |
| 57 |
@@ -281,7 +281,7 @@ |
| 58 |
type = T_ANYNode; |
| 59 |
} |
| 60 |
|
| 61 |
- virtual operator== (Node& b) { |
| 62 |
+ virtual int operator== (Node& b) { |
| 63 |
return b.type == T_ANYNode; |
| 64 |
} |
| 65 |
|
| 66 |
@@ -305,7 +305,7 @@ |
| 67 |
type = T_ASNode; |
| 68 |
} |
| 69 |
|
| 70 |
- virtual operator== (Node& b) { |
| 71 |
+ virtual int operator== (Node& b) { |
| 72 |
return b.type == T_ASNode |
| 73 |
&& val == ((ASNode&) b).val; |
| 74 |
} |
| 75 |
@@ -330,7 +330,7 @@ |
| 76 |
type = T_ASMacroNode; |
| 77 |
} |
| 78 |
|
| 79 |
- virtual operator== (Node& b) { |
| 80 |
+ virtual int operator== (Node& b) { |
| 81 |
return b.type == T_ASMacroNode |
| 82 |
&& val == ((ASMacroNode&) b).val; |
| 83 |
} |
| 84 |
@@ -355,7 +355,7 @@ |
| 85 |
type = T_CommNode; |
| 86 |
} |
| 87 |
|
| 88 |
- virtual operator== (Node& b) { |
| 89 |
+ virtual int operator== (Node& b) { |
| 90 |
return b.type == T_CommNode |
| 91 |
&& val == ((CommNode&) b).val; |
| 92 |
} |
| 93 |
@@ -382,7 +382,7 @@ |
| 94 |
cidr_root = NULL; |
| 95 |
} |
| 96 |
|
| 97 |
- virtual operator== (Node& b) { |
| 98 |
+ virtual int operator== (Node& b) { |
| 99 |
return b.type == T_NetListNode |
| 100 |
&& nets == ((NetListNode&) b).nets; |
| 101 |
} |
| 102 |
@@ -391,7 +391,7 @@ |
| 103 |
virtual NormalExpression *Evaluate(int expand); |
| 104 |
virtual int match(Route &r, char dontcare); |
| 105 |
virtual int match_exact_or_more_specific(Route &r, char dontcare); |
| 106 |
- add(Pix pi) { nets.add(pi); } |
| 107 |
+ void add(Pix pi) { nets.add(pi); } |
| 108 |
}; |
| 109 |
|
| 110 |
////////////////////////////// ASPathNode ////////////////////////////// |
| 111 |
@@ -412,7 +412,7 @@ |
| 112 |
type = T_ASPathNode; |
| 113 |
} |
| 114 |
|
| 115 |
- virtual operator== (Node& b) { |
| 116 |
+ virtual int operator== (Node& b) { |
| 117 |
ASSERT(0); |
| 118 |
return 0; |
| 119 |
} |
| 120 |
@@ -438,7 +438,7 @@ |
| 121 |
type = T_RegisterNode; |
| 122 |
} |
| 123 |
|
| 124 |
- virtual operator== (Node& b) { |
| 125 |
+ virtual int operator== (Node& b) { |
| 126 |
return b.type == T_RegisterNode |
| 127 |
&& val == ((RegisterNode&) b).val; |
| 128 |
} |
| 129 |
@@ -460,13 +460,13 @@ |
| 130 |
type = T_PrefNode; |
| 131 |
} |
| 132 |
|
| 133 |
- virtual operator== (Node& b) { |
| 134 |
+ virtual int operator== (Node& b) { |
| 135 |
return b.type == T_PrefNode |
| 136 |
&& val == ((PrefNode&) b).val; |
| 137 |
} |
| 138 |
|
| 139 |
virtual void InOrderPrint(); |
| 140 |
- virtual Execute(Route &r) { |
| 141 |
+ virtual void Execute(Route &r) { |
| 142 |
} |
| 143 |
virtual ActionNode *FindFirst(Node_t _type) { |
| 144 |
if (type == _type) |
| 145 |
@@ -492,13 +492,13 @@ |
| 146 |
type = T_MEDNode; |
| 147 |
} |
| 148 |
|
| 149 |
- virtual operator== (Node& b) { |
| 150 |
+ virtual int operator== (Node& b) { |
| 151 |
return b.type == T_MEDNode |
| 152 |
&& val == ((MEDNode&) b).val; |
| 153 |
} |
| 154 |
|
| 155 |
virtual void InOrderPrint(); |
| 156 |
- virtual Execute(Route &r) { |
| 157 |
+ virtual void Execute(Route &r) { |
| 158 |
} |
| 159 |
virtual ActionNode *FindFirst(Node_t _type) { |
| 160 |
if (type == _type) |
| 161 |
@@ -524,13 +524,13 @@ |
| 162 |
type = T_DPANode; |
| 163 |
} |
| 164 |
|
| 165 |
- virtual operator== (Node& b) { |
| 166 |
+ virtual int operator== (Node& b) { |
| 167 |
return b.type == T_DPANode |
| 168 |
&& val == ((DPANode&) b).val; |
| 169 |
} |
| 170 |
|
| 171 |
virtual void InOrderPrint(); |
| 172 |
- virtual Execute(Route &r) { |
| 173 |
+ virtual void Execute(Route &r) { |
| 174 |
} |
| 175 |
virtual ActionNode *FindFirst(Node_t _type) { |
| 176 |
if (type == _type) |
| 177 |
@@ -552,12 +552,12 @@ |
| 178 |
type = T_NoopNode; |
| 179 |
} |
| 180 |
|
| 181 |
- virtual operator== (Node& b) { |
| 182 |
+ virtual int operator== (Node& b) { |
| 183 |
return b.type == T_NoopNode; |
| 184 |
} |
| 185 |
|
| 186 |
virtual void InOrderPrint(); |
| 187 |
- virtual Execute(Route &r) {} |
| 188 |
+ virtual void Execute(Route &r) {} |
| 189 |
virtual ActionNode *FindFirst(Node_t _type) { |
| 190 |
if (type == _type) |
| 191 |
return this; |
| 192 |
@@ -581,14 +581,14 @@ |
| 193 |
} |
| 194 |
virtual ~ComposeNode(); |
| 195 |
|
| 196 |
- virtual operator== (Node& b) { |
| 197 |
+ virtual int operator== (Node& b) { |
| 198 |
return b.type == T_ComposeNode |
| 199 |
&& left == ((ComposeNode&) b).left |
| 200 |
&& right == ((ComposeNode&) b).right; |
| 201 |
} |
| 202 |
|
| 203 |
virtual void InOrderPrint(); |
| 204 |
- virtual Execute(Route &r) {} |
| 205 |
+ virtual void Execute(Route &r) {} |
| 206 |
virtual ActionNode *FindFirst(Node_t _type) { |
| 207 |
ActionNode *r; |
| 208 |
if (type == _type) |