All files / src/abap/nodes expression_node.ts

96.45% Statements 245/254
95.55% Branches 86/90
100% Functions 19/19
96.45% Lines 245/254

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 2541x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 251068x 251068x 251068x 1x 1x 413655x 413655x 1x 1x 409708x 409708x 555016x 555016x 409708x 409708x 1x 1x 38832x 38832x 38832x     1x 1x 14173x 14173x 14173x 25737x     25737x 14173x 25737x 11564x 2714x 11564x 8850x 8850x 25737x 25737x 14173x 14173x 1x 1x 45x 45x 45x 61x 61x 61x 61x 61x 61x     61x 45x 61x 16x 9x 16x 7x 7x 61x 61x 45x 45x 1x 1x 14407x 14407x 14407x 21991x 21991x 14407x 14407x 14407x 1x 1x 31272x 31272x 31272x 11573x 11573x 11573x 19699x 31272x 23921x 14640x 23921x 9281x 9281x 23921x 19699x 19699x 19699x 1x 1x 1801x 1801x 1801x 1801x 1801x       1x 1x 735x 735x 735x 884x 427x 884x 457x 457x 884x 735x 735x 735x 1x 1x 22x 22x 22x 46x 21x 21x 46x 22x 22x 22x 1x 1x 7397x 15160x 3741x 3741x 15160x 3656x 3656x 1x 1x 230x 230x 230x 584x 584x 584x 584x 584x 40x 40x 584x 190x 190x 190x 1x 1x 2116x 2116x 6294x 1252x 1252x 6294x 2116x 2116x 1x 1x 3166x 5027x 106x 106x 5027x 3060x 3060x 1x 1x 31991x 31991x 47863x 23515x 47863x 1783x 1783x 24348x 24348x 31991x 31991x 1x 1x 64600x 64600x 95641x 54914x 95641x 1746x 40727x 38981x 38981x 95641x 64600x 64600x 1x 1x 16522x 16522x 23044x 13720x 13720x 9324x 23044x 26940x 170x 170x 26940x 23044x 9179x 9179x 23044x 16522x 16522x 1x 1x 105809x 238x 238x 105571x 105809x 162159x 91341x 162159x 7389x 70818x 63429x 63429x 1910x 1910x 63429x 162159x 96272x 96272x 1x
import {TokenNode} from "./token_node";
import {Token} from "../1_lexer/tokens/_token";
import {INode} from "./_inode";
import {Pragma, String, 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(): Token {
    for (const child of this.getChildren()) {
      return child.getFirstToken();
    }
    throw new Error("ExpressionNode, getFirstToken, no children");
  }
 
  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 concatTokensWithoutStringsAndComments(): string {
    let str = "";
    let prev: Token | undefined;
    for (const token of this.getTokens()) {
      if (token instanceof Comment
          || token instanceof String
          || 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 getTokens(): readonly Token[] {
    const tokens: Token[] = [];
 
    for (const c of this.getChildren()) {
      tokens.push(...this.toTokens(c));
    }
 
    return tokens;
  }
 
  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;
  }
 
  public getLastToken(): Token {
    const child = this.getLastChild();
 
    if (child) {
      return child.getLastToken();
    }

    throw new Error("ExpressionNode, getLastToken, no children");
  }
 
  public getAllTokens(): Token[] {
    const ret: Token[] = [];
 
    for (const child of this.getChildren()) {
      if (child instanceof TokenNode) {
        ret.push(child.get());
      } else {
        ret.push(...child.getAllTokens());
      }
    }
 
    return ret;
  }
 
  public getDirectTokens(): readonly Token[] {
    const ret: Token[] = [];
 
    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 findDirectTokenByText(text: string): Token | undefined {
    for (const child of this.getChildren()) {
      if (child instanceof TokenNode && child.get().getStr().toUpperCase() === text.toUpperCase()) {
        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));
      }
    }
    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;
  }
}