@abaplint/core 2.85.26 → 2.85.27

package/build/abaplint.d.ts

@@ -4996,6 +4996,7 @@ declare class StatementNode extends AbstractNode<ExpressionNode | TokenNode> {
      */
     findTokenSequencePosition(first: string, second: string): Position | undefined;
     findExpressionAfterToken(text: string): ExpressionNode | undefined;
+    findExpressionsAfterToken(text: string): ExpressionNode[];
     private toTokens;
     private toTokenNodess;
 }

package/build/src/abap/5_syntax/statements/find.js

@@ -26,9 +26,11 @@ class Find {
                 this.inline(rfound, scope, filename, new basic_1.TableType(type, { withHeader: false }));
             }
         }
-        const ofound = node.findExpressionAfterToken("OFFSET");
-        if (ofound && ofound.get() instanceof Expressions.Target) {
-            this.inline(ofound, scope, filename, new basic_1.IntegerType());
+        const ofound = node.findExpressionsAfterToken("OFFSET");
+        for (const o of ofound) {
+            if (o.get() instanceof Expressions.Target) {
+                this.inline(o, scope, filename, new basic_1.IntegerType());
+            }
         }
         const lfound = node.findExpressionAfterToken("LINE");
         if (lfound && lfound.get() instanceof Expressions.Target) {
@@ -44,7 +46,10 @@ class Find {
         }
         if (node.findDirectTokenByText("SUBMATCHES")) {
             for (const t of node.findDirectExpressions(Expressions.Target)) {
-                if (t === rfound || t === ofound || t === lfound || t === cfound || t === lnfound) {
+                if (t === rfound || t === lfound || t === cfound || t === lnfound) {
+                    continue;
+                }
+                else if (ofound.indexOf(t) >= 0) {
                     continue;
                 }
                 const inline = t === null || t === void 0 ? void 0 : t.findDirectExpression(Expressions.InlineData);

package/build/src/abap/nodes/statement_node.js

@@ -255,6 +255,20 @@ class StatementNode extends _abstract_node_1.AbstractNode {
         }
         return undefined;
     }
+    findExpressionsAfterToken(text) {
+        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 token_node_1.TokenNode
+                && c.get().getStr().toUpperCase() === text.toUpperCase()
+                && next instanceof expression_node_1.ExpressionNode) {
+                ret.push(next);
+            }
+        }
+        return ret;
+    }
     ////////////////////////////////
     toTokens(b) {
         const tokens = [];

package/build/src/registry.js

@@ -68,7 +68,7 @@ class Registry {
     }
     static abaplintVersion() {
         // magic, see build script "version.sh"
-        return "2.85.26";
+        return "2.85.27";
     }
     getDDICReferences() {
         return this.references;

package/build/src/rules/downport.js

@@ -335,6 +335,9 @@ Only one transformation is applied to a statement at a time, so multiple steps m
         if (fields.length === 1) {
             fieldDefinition = `DATA ${name} TYPE ${tableName}-${fields[0].concatTokens()}.`;
         }
+        else if (fieldList.concatTokens() === "*") {
+            fieldDefinition = `DATA ${name} TYPE ${tableName}.`;
+        }
         else {
             for (const f of fields) {
                 const fieldName = f.concatTokens();

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@abaplint/core",
-    "version": "2.85.26",
+    "version": "2.85.27",
     "description": "abaplint - Core API",
     "main": "build/src/index.js",
     "typings": "build/abaplint.d.ts",