All files / src/abap/nodes expression_node.ts

96.27% Statements 284/295
95.23% Branches 100/105
100% Functions 21/21
96.27% Lines 284/295

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 2951x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 335067x 335067x 335067x 1x 1x 726558x 726558x 1x 1x 594496x 594496x 804041x 804041x 594496x 594496x 1x 1x 61954x 61954x 61954x     1x 1x 35x 35x 35x 111x     111x 35x 111x 76x 2x 76x 74x 2x 74x 72x 72x 74x 111x 111x 35x 35x 1x 1x 21501x 21501x 21501x 40281x     40281x 21501x 40281x 18780x 4002x 18780x 14778x 14778x 40281x 40281x 21501x 21501x 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 21746x 21746x 21746x 34957x 34957x 21746x 21746x 21746x 1x 1x 45942x 45942x 45942x 21383x 21383x 21383x 24559x 45942x 30348x 19363x 30348x 10985x 10985x 30348x 24559x 24559x 24559x 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 19424x 39974x 7976x 7976x 39974x 11448x 11448x 1x 1x 303x 303x 303x 739x 739x 739x 739x 739x 60x 60x 739x 243x 243x 243x 1x 1x 4437x 4437x 14343x 2178x 2178x 14343x 4437x 4437x 1x 1x 314x 314x 1086x 689x 1698x 257x 257x 257x 1698x 689x 1086x 314x 314x 1x 1x 6593x 6593x 10287x 290x 290x 10287x 6303x 6303x 1x 1x 57700x 57700x 87499x 42169x 87499x 3151x 3151x 45330x 45330x 57700x 57700x 1x 1x 100554x 100554x 153092x 88049x 153092x 3501x 65043x 61542x 61542x 153092x 100554x 100554x 1x 1x 19068x 19068x 27050x 16060x 16060x 10990x 27050x 36075x 349x 349x 36075x 27050x 10829x 10829x 27050x 19068x 19068x 1x 1x 201414x 442x 442x 200972x 201414x 301626x 165201x 301626x 15983x 136425x 120442x 120442x 2948x 2948x 120442x 301626x 182041x 182041x 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;
  }
}