Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 334579x 334579x 334579x 1x 1x 725148x 725148x 1x 1x 593836x 593836x 803126x 803126x 593836x 593836x 1x 1x 61775x 61775x 61775x 1x 1x 35x 35x 35x 111x 111x 35x 111x 76x 2x 76x 74x 2x 74x 72x 72x 74x 111x 111x 35x 35x 1x 1x 21431x 21431x 21431x 40153x 40153x 21431x 40153x 18722x 3996x 18722x 14726x 14726x 40153x 40153x 21431x 21431x 1x 1x 49x 49x 49x 65x 65x 65x 65x 65x 65x 65x 49x 65x 16x 9x 16x 7x 7x 65x 65x 49x 49x 1x 1x 1x 21676x 21676x 21676x 34843x 34843x 21676x 21676x 21676x 1x 1x 45799x 45799x 45799x 21301x 21301x 21301x 24498x 45799x 30273x 19317x 30273x 10956x 10956x 30273x 24498x 24498x 24498x 1x 1x 1685x 1685x 1685x 1685x 1685x 1x 1x 1417x 1417x 1417x 1754x 595x 1754x 1159x 1159x 1754x 1417x 1417x 1417x 1x 1x 40x 40x 40x 82x 34x 34x 82x 40x 40x 40x 1x 1x 19338x 39817x 7925x 7925x 39817x 11413x 11413x 1x 1x 303x 303x 303x 739x 739x 739x 739x 739x 60x 60x 739x 243x 243x 243x 1x 1x 4409x 4409x 14286x 2160x 2160x 14286x 4409x 4409x 1x 1x 314x 314x 1086x 689x 1698x 257x 257x 257x 1698x 689x 1086x 314x 314x 1x 1x 6564x 6564x 10237x 289x 289x 10237x 6275x 6275x 1x 1x 57580x 57580x 87331x 42097x 87331x 3143x 3143x 45234x 45234x 57580x 57580x 1x 1x 100502x 100502x 152985x 87990x 152985x 3489x 64995x 61506x 61506x 152985x 100502x 100502x 1x 1x 19068x 19068x 27050x 16060x 16060x 10990x 27050x 36075x 349x 349x 36075x 27050x 10829x 10829x 27050x 19068x 19068x 1x 1x 200959x 440x 440x 200519x 200959x 300979x 164874x 300979x 15942x 136105x 120163x 120163x 2940x 2940x 120163x 300979x 181637x 181637x 1x | import {TokenNode} from "./token_node";
import {AbstractToken} from "../1_lexer/tokens/abstract_token";
import {INode} from "./_inode";
import {Pragma, StringToken, StringTemplate, StringTemplateBegin, StringTemplateMiddle, StringTemplateEnd, Comment} from "../1_lexer/tokens";
import {IStatementRunnable} from "../2_statements/statement_runnable";
import {AbstractNode} from "./_abstract_node";
export class ExpressionNode extends AbstractNode<ExpressionNode | TokenNode> {
private readonly expression: IStatementRunnable;
public constructor(expression: IStatementRunnable) {
super();
this.expression = expression;
}
public get(): IStatementRunnable {
return this.expression;
}
public countTokens(): number {
let ret = 0;
for (const c of this.getChildren()) {
ret = ret + c.countTokens();
}
return ret;
}
public getFirstToken(): AbstractToken {
for (const child of this.getChildren()) {
return child.getFirstToken();
}
throw new Error("ExpressionNode, getFirstToken, no children");
}
public concatTokensWithLinebreaks(): string {
let str = "";
let prev: AbstractToken | undefined;
for (const token of this.getTokens()) {
if (token instanceof Pragma) {
continue;
}
if (str === "") {
str = token.getStr();
} else if (prev && prev.getStr().length + prev.getCol() === token.getCol()
&& prev.getRow() === token.getRow()) {
str = str + token.getStr();
} else {
if (prev && prev.getRow() !== token.getRow()) {
str = str + "\n" + token.getStr();
} else {
str = str + " " + token.getStr();
}
}
prev = token;
}
return str;
}
public concatTokens(): string {
let str = "";
let prev: AbstractToken | undefined;
for (const token of this.getTokens()) {
if (token instanceof Pragma) {
continue;
}
if (str === "") {
str = token.getStr();
} else if (prev && prev.getStr().length + prev.getCol() === token.getCol()
&& prev.getRow() === token.getRow()) {
str = str + token.getStr();
} else {
str = str + " " + token.getStr();
}
prev = token;
}
return str;
}
public concatTokensWithoutStringsAndComments(): string {
let str = "";
let prev: AbstractToken | undefined;
for (const token of this.getTokens()) {
if (token instanceof Comment
|| token instanceof StringToken
|| token instanceof StringTemplate
|| token instanceof StringTemplateBegin
|| token instanceof StringTemplateMiddle
|| token instanceof StringTemplateEnd) {
continue;
}
if (str === "") {
str = token.getStr();
} else if (prev && prev.getStr().length + prev.getCol() === token.getCol()
&& prev.getRow() === token.getRow()) {
str = str + token.getStr();
} else {
str = str + " " + token.getStr();
}
prev = token;
}
return str;
}
// todo: delete this method?, its slow
public getTokens(): readonly AbstractToken[] {
const tokens: AbstractToken[] = [];
for (const c of this.getChildren()) {
tokens.push(...this.toTokens(c));
}
return tokens;
}
private toTokens(b: INode): readonly AbstractToken[] {
const tokens: AbstractToken[] = [];
if (b instanceof TokenNode) {
tokens.push(b.get());
return tokens;
}
for (const c of b.getChildren()) {
if (c instanceof TokenNode) {
tokens.push(c.get());
} else {
tokens.push(...this.toTokens(c));
}
}
return tokens;
}
public getLastToken(): AbstractToken {
const child = this.getLastChild();
if (child) {
return child.getLastToken();
}
throw new Error("ExpressionNode, getLastToken, no children");
}
public getAllTokens(): AbstractToken[] {
const ret: AbstractToken[] = [];
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
ret.push(child.get());
} else {
ret.push(...child.getAllTokens());
}
}
return ret;
}
public getDirectTokens(): readonly AbstractToken[] {
const ret: AbstractToken[] = [];
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
ret.push(child.get());
}
}
return ret;
}
public findDirectExpression(type: new () => IStatementRunnable): ExpressionNode | undefined {
for (const child of this.getChildren()) {
if (child instanceof ExpressionNode && child.get() instanceof type) {
return child;
}
}
return undefined;
}
public findExpressionAfterToken(text: string): ExpressionNode | undefined {
const children = this.getChildren();
for (let i = 0; i < children.length - 1; i++) {
const c = children[i];
const next = children[i + 1];
if (c instanceof TokenNode
&& c.get().getStr().toUpperCase() === text.toUpperCase()
&& next instanceof ExpressionNode) {
return next;
}
}
return undefined;
}
public findDirectExpressions(type: new () => IStatementRunnable): readonly ExpressionNode[] {
const ret: ExpressionNode[] = [];
for (const child of this.getChildren()) {
if (child instanceof ExpressionNode && child.get() instanceof type) {
ret.push(child);
}
}
return ret;
}
public findDirectExpressionsMulti(type: (new () => IStatementRunnable)[]): ExpressionNode[] {
const ret: ExpressionNode[] = [];
for (const child of this.getChildren()) {
if (child instanceof ExpressionNode) {
for (const t of type) {
if (child.get() instanceof t) {
ret.push(child);
break;
}
}
}
}
return ret;
}
public findDirectTokenByText(text: string): AbstractToken | undefined {
const search = text.toUpperCase();
for (const child of this.getChildren()) {
if (child instanceof TokenNode && child.get().getStr().toUpperCase() === search) {
return child.get();
}
}
return undefined;
}
public findAllExpressionsRecursive(type: new () => IStatementRunnable): readonly ExpressionNode[] {
const ret: ExpressionNode[] = [];
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
continue;
} else if (child.get() instanceof type) {
ret.push(child);
}
ret.push(...child.findAllExpressionsRecursive(type));
}
return ret;
}
public findAllExpressions(type: new () => IStatementRunnable): readonly ExpressionNode[] {
const ret: ExpressionNode[] = [];
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
continue;
} else if (child.get() instanceof type) {
ret.push(child);
} else {
ret.push(...child.findAllExpressions(type));
}
}
return ret;
}
public findAllExpressionsMulti(type: (new () => IStatementRunnable)[], recursive = false): ExpressionNode[] {
const ret: ExpressionNode[] = [];
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
continue;
}
const before = ret.length;
for (const t of type) {
if (child.get() instanceof t) {
ret.push(child);
}
}
if (before === ret.length || recursive === true) {
ret.push(...child.findAllExpressionsMulti(type, recursive));
}
}
return ret;
}
public findFirstExpression(type: new () => IStatementRunnable): ExpressionNode | undefined {
if (this.get() instanceof type) {
return this;
}
for (const child of this.getChildren()) {
if (child instanceof TokenNode) {
continue;
} else if (child.get() instanceof type) {
return child;
} else {
const res = child.findFirstExpression(type);
if (res) {
return res;
}
}
}
return undefined;
}
} |