All files / src/abap/nodes statement_node.ts

96.46% Statements 355/368
94.16% Branches 129/137
100% Functions 28/28
96.46% Lines 355/368

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 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 3681x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 47217x 47217x 47217x 47217x 47217x 22893x 47217x 24324x 24324x 47217x 1x 1x 461168x 461168x 1x 1x 29319x 29319x 1x 1x 9480x 9480x 1x 1x 47181x     47181x 47181x 47181x 47181x 47181x 1x 1x 5418x 5418x 1x 1x 899x 899x 899x 1x 1x 38782x 38782x 38782x 230609x 230609x 38782x 38782x 38782x 1x 1x 1258x 4894x 322x 322x 4894x 936x 936x 1x 1x 1234x 1234x 1234x 3871x 3871x 1234x 1234x 1234x 1x 1x 5784x 5784x 5784x 40384x     40384x 5784x 40384x 34600x 9829x 34600x 24771x 24771x 40384x 40384x 5784x 5784x 1x 1x 11x 11x 11x 40x     40x 40x 40x 11x 40x 29x 29x 13x 29x 16x 16x 40x 40x 11x 11x 1x 1x 926x 926x 926x 3561x 3561x 3561x 3561x 3561x 3561x 25x 25x 3561x 926x 3561x 2610x 1048x 2610x 1562x 1562x 3536x 3536x 926x 926x 1x 1x 1484x 1484x 1x 1x 51032x 51032x 51032x     1x 1x 34600x 34600x 34600x 34600x 34600x       1x 1x 16157x 60607x 6368x 6368x 60607x 9789x 9789x 1x 1x 2158x 2158x 10100x 1434x 1434x 10100x 2158x 2158x 1x 1x 4171x 4171x 21218x 86x 86x 21218x 4085x 4085x 1x 1x 43032x 141215x 83952x 141215x 13646x 57263x 43617x 43617x 3762x 3762x 43617x 141215x 25624x 25624x 1x 1x 33612x 33612x 113640x 82901x 113640x 1111x 30739x 29628x 29628x 113640x 33612x 33612x 1x 1x 9075x 9075x 32773x 22688x 32773x 864x 864x 10085x 10085x 9075x 9075x 1x 1x 8506x 8506x 28251x 20978x 20978x 7273x 28251x 23184x 162x 162x 23184x 28251x 7221x 7221x 28251x 8506x 8506x 1x 1x 1x 1x 1x 1x 1x 1x 22x 22x 94x 94x 94x 94x 94x 94x 8x 8x 94x 22x 94x 64x 64x 94x     1x 1x 2044x 2044x 2044x 8221x 8221x 8221x 8221x 8221x 226x 226x 8221x 1818x 1818x 1818x 1x 1x 14x 14x 14x 14x 155x 155x 155x 155x 155x 7x 7x 155x 14x 14x 14x 1x 1x 1x 1x 269996x 269996x 269996x 211328x 211328x 211328x 58668x 269996x 84035x 44648x 84035x 39387x 39387x 84035x 58668x 58668x 58668x 1x 1x 5166x 5166x 5166x 2951x 2951x 2951x 2215x 5166x 2994x 1699x 2994x 1295x 1295x 2994x 2215x 2215x 2215x 1x
import {Position, VirtualPosition} from "../../position";
import {AbstractNode} from "./_abstract_node";
import {INode} from "./_inode";
import {TokenNode} from "./token_node";
import {ExpressionNode} from "./expression_node";
import {Comment} from "../1_lexer/tokens/comment";
import {Token} from "../1_lexer/tokens/_token";
import {Pragma} from "../1_lexer/tokens/pragma";
import {StringToken, StringTemplate, StringTemplateBegin, StringTemplateMiddle, StringTemplateEnd} from "../1_lexer/tokens/string";
import {IStatement} from "../2_statements/statements/_statement";
import {IStatementRunnable} from "../2_statements/statement_runnable";
 
export class StatementNode extends AbstractNode<ExpressionNode | TokenNode> {
  private readonly statement: IStatement;
  private readonly colon: Token | undefined;
  private readonly pragmas: readonly Token[];
 
  public constructor(statement: IStatement, colon?: Token | undefined, pragmas?: readonly Token[]) {
    super();
    this.statement = statement;
    this.colon = colon;
 
    if (pragmas) {
      this.pragmas = pragmas;
    } else {
      this.pragmas = [];
    }
  }
 
  public get() {
    return this.statement;
  }
 
  public getColon(): Token | undefined {
    return this.colon;
  }
 
  public getPragmas(): readonly Token[] {
    return this.pragmas;
  }
 
  public setChildren(children: (ExpressionNode | TokenNode)[]): StatementNode {
    if (children.length === 0) {
      throw new Error("statement: zero children");
    }
 
    this.children = children;
 
    return this;
  }
 
  public getStart(): Position {
    return this.getFirstToken().getStart();
  }
 
  public getEnd(): Position {
    const last = this.getLastToken();
    return last.getEnd();
  }
 
  public getTokens(): readonly Token[] {
    const tokens: Token[] = [];
 
    for (const c of this.getChildren()) {
      tokens.push(...this.toTokens(c));
    }
 
    return tokens;
  }
 
  public includesToken(search: Token): boolean {
    for (const t of this.getTokens()) {
      if (t.getStart().equals(search.getStart())) {
        return true;
      }
    }
    return false;
  }
 
  public getTokenNodes(): readonly TokenNode[] {
    const tokens: TokenNode[] = [];
 
    for (const c of this.getChildren()) {
      tokens.push(...this.toTokenNodess(c));
    }
 
    return tokens;
  }
 
  public concatTokens(): string {
    let str = "";
    let prev: Token | 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 concatTokensVirtual(): string {
    let str = "";
    let prev: Token | undefined;
    for (const token of this.getTokens()) {
      if (token instanceof Pragma) {
        continue;
      }
      const vprev = prev?.getStart() as VirtualPosition | undefined;
      const vtoke = token?.getStart() as VirtualPosition | undefined;
      if (str === "") {
        str = token.getStr();
      } else if (prev && vprev && vtoke
          && prev.getStr().length + vprev.vcol === vtoke.vcol
          && vprev.vrow === vtoke.vrow) {
        str = str + token.getStr();
      } else {
        str = str + " " + token.getStr();
      }
      prev = token;
    }
    return str;
  }
 
  public concatTokensWithoutStringsAndComments(): string {
    let str = "";
    let prev: Token | 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;
  }
 
  public getTerminator(): string {
    return this.getLastToken().getStr();
  }
 
  public getFirstToken(): Token {
    for (const child of this.getChildren()) {
      return child.getFirstToken();
    }
    throw new Error("StatementNode, getFirstToken, no children, " + this.get().constructor.name);
  }
 
  public getLastToken(): Token {
    const child = this.getLastChild();
 
    if (child !== undefined) {
      return child.getLastToken();
    }

    throw new Error("StatementNode, getLastToken, no children");
  }
 
  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 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 findDirectTokenByText(text: string): Token | undefined {
    const upper = text.toUpperCase();
    for (const child of this.getChildren()) {
      if (child instanceof TokenNode && child.get().getStr().toUpperCase() === upper) {
        return child.get();
      }
    }
    return undefined;
  }
 
  public findFirstExpression(type: new () => IStatementRunnable): ExpressionNode | undefined {
    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;
  }
 
  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 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 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;
  }
 
  /**
   * Returns the Position of the first token if the sequence is found,
   * otherwise undefined. Strings and Comments are ignored in this search.
   * @param first - Text of the first Token
   * @param second - Text of the second Token
   */
  public findTokenSequencePosition(first: string, second: string): Position | undefined {
    let prev: Token | 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 (prev && token.getStr().toUpperCase() === second && prev?.getStr().toUpperCase() === first.toUpperCase()) {
        return prev.getStart();
      } else {
        prev = token;
      }
    }
    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 findExpressionsAfterToken(text: string): ExpressionNode[] {
    const children = this.getChildren();
    const ret = [];
 
    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) {
        ret.push(next);
      }
    }
 
    return ret;
  }
 
////////////////////////////////
 
  private toTokens(b: INode): readonly Token[] {
    const tokens: Token[] = [];
 
    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;
  }
 
  private toTokenNodess(b: INode): readonly TokenNode[] {
    const tokens: TokenNode[] = [];
 
    if (b instanceof TokenNode) {
      tokens.push(b);
      return tokens;
    }
 
    for (const c of b.getChildren()) {
      if (c instanceof TokenNode) {
        tokens.push(c);
      } else {
        tokens.push(...this.toTokenNodess(c));
      }
    }
 
    return tokens;
  }
}