@abaplint/runtime 2.4.12 → 2.4.14

package/build/src/binary_search.d.ts

@@ -0,0 +1,5 @@
+import { ICharacter } from "./types/_character";
+import { INumeric } from "./types/_numeric";
+export declare function binarySearchFromRow(array: readonly any[], left: number, right: number, keyField: (i: any) => any, keyValue: INumeric | ICharacter): number;
+export declare function binarySearchFrom(array: readonly any[], left: number, right: number, keyField: string, keyValue: INumeric | ICharacter): number;
+export declare function binarySearchTo(array: readonly any[], left: number, right: number, keyField: string, keyValue: INumeric | ICharacter): number;

package/build/src/binary_search.js

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.binarySearchTo = exports.binarySearchFrom = exports.binarySearchFromRow = void 0;
+/* eslint-disable max-len */
+const compare_1 = require("./compare");
+const types_1 = require("./types");
+function binarySearchFromRow(array, left, right, keyField, keyValue) {
+    const isStructured = array[0] instanceof types_1.Structure;
+    while (right - left > 1) {
+        const middle = Math.floor(((right - left) / 2) + left);
+        const a = array[middle];
+        const row = isStructured ? Object.assign({ table_line: a }, a.get()) : { table_line: a };
+        if ((0, compare_1.ge)(keyField(row), keyValue)) {
+            right = middle;
+        }
+        else {
+            left = middle;
+        }
+    }
+    return right;
+}
+exports.binarySearchFromRow = binarySearchFromRow;
+function binarySearchFrom(array, left, right, keyField, keyValue) {
+    while (right - left > 1) {
+        const middle = Math.floor(((right - left) / 2) + left);
+        if ((0, compare_1.ge)(array[middle].get()[keyField], keyValue)) {
+            right = middle;
+        }
+        else {
+            left = middle;
+        }
+    }
+    return right;
+}
+exports.binarySearchFrom = binarySearchFrom;
+function binarySearchTo(array, left, right, keyField, keyValue) {
+    while (right - left > 1) {
+        const middle = Math.floor(((right - left) / 2) + left);
+        if ((0, compare_1.le)(array[middle].get()[keyField], keyValue)) {
+            left = middle;
+        }
+        else {
+            right = middle;
+        }
+    }
+    return right;
+}
+exports.binarySearchTo = binarySearchTo;
+//# sourceMappingURL=binary_search.js.map

package/build/src/statements/call_function.js

@@ -7,6 +7,18 @@ class CallFunction {
     }
     // note: this is only called if DESTINIATION is supplied
     async callFunction(options) {
+        if (options.destination.trim() === "") {
+            const param = {
+                exporting: options.exporting,
+                importing: options.importing,
+                tables: options.tables,
+                changing: options.changing,
+                exceptions: options.exceptions,
+            };
+            // @ts-ignore
+            await abap.FunctionModules[options.name](param);
+            return;
+        }
         const dest = this.context.RFCDestinations[options.destination];
         if (dest === undefined) {
             throw new Error(`RFC destination ${options.destination} does not exist`);

package/build/src/statements/loop.js

@@ -25,32 +25,8 @@ var __asyncGenerator = (this && this.__asyncGenerator) || function (thisArg, _ar
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.loop = void 0;
-const compare_1 = require("../compare");
+const binary_search_1 = require("../binary_search");
 const types_1 = require("../types");
-function binarySearchFrom(array, left, right, keyField, keyValue) {
-    while (right - left > 1) {
-        const middle = Math.floor(((right - left) / 2) + left);
-        if ((0, compare_1.ge)(array[middle].get()[keyField], keyValue)) {
-            right = middle;
-        }
-        else {
-            left = middle;
-        }
-    }
-    return right;
-}
-function binarySearchTo(array, left, right, keyField, keyValue) {
-    while (right - left > 1) {
-        const middle = Math.floor(((right - left) / 2) + left);
-        if ((0, compare_1.le)(array[middle].get()[keyField], keyValue)) {
-            left = middle;
-        }
-        else {
-            right = middle;
-        }
-    }
-    return right;
-}
 function determineFromTo(array, topEquals, key) {
     if (topEquals === undefined) {
         // if there is no WHERE supplied, its using the sorting of the secondary key
@@ -62,8 +38,8 @@ function determineFromTo(array, topEquals, key) {
     const keyField = key.keyFields[0].toLowerCase();
     const keyValue = topEquals[keyField];
     if (keyField && keyValue) {
-        from = binarySearchFrom(array, from, to, keyField, keyValue);
-        to = binarySearchTo(array, from, to, keyField, keyValue);
+        from = (0, binary_search_1.binarySearchFrom)(array, from, to, keyField, keyValue);
+        to = (0, binary_search_1.binarySearchTo)(array, from, to, keyField, keyValue);
         //    console.dir("from: " + from + ", to: " + to);
     }
     return {

package/build/src/statements/read_table.d.ts

@@ -8,8 +8,14 @@ export interface IReadTableOptions {
     from?: INumeric | ICharacter | Structure | Table | DataReference;
     referenceInto?: DataReference;
     assigning?: FieldSymbol;
+    binarySearch?: boolean;
+    withKeyValue?: {
+        key: (i: any) => any;
+        value: any;
+    }[];
 }
-export declare function readTable(table: Table | FieldSymbol, options?: IReadTableOptions): {
+export declare type ReadTableReturn = {
     subrc: number;
     foundIndex: number;
 };
+export declare function readTable(table: Table | FieldSymbol, options?: IReadTableOptions): ReadTableReturn;

package/build/src/statements/read_table.js

@@ -1,8 +1,27 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.readTable = void 0;
+const binary_search_1 = require("../binary_search");
 const compare_1 = require("../compare");
 const types_1 = require("../types");
+function searchWithKey(arr, withKey, startIndex = 0) {
+    const isStructured = arr[0] instanceof types_1.Structure;
+    for (let index = startIndex; index < arr.length; index++) {
+        const a = arr[index];
+        const row = isStructured ? Object.assign({ table_line: a }, a.get()) : { table_line: a };
+        if (withKey(row) === true) {
+            return {
+                found: a,
+                foundIndex: index + 1,
+            };
+        }
+    }
+    return {
+        found: undefined,
+        foundIndex: 0,
+    };
+}
+/////////////////
 function readTable(table, options) {
     var _a, _b;
     let found = undefined;
@@ -18,19 +37,20 @@ function readTable(table, options) {
             foundIndex = index;
         }
     }
+    else if ((options === null || options === void 0 ? void 0 : options.binarySearch) === true
+        && options.withKeyValue
+        && options.withKey) {
+        // note: it currently only uses the first key field for binary search, todo
+        const first = options.withKeyValue[0];
+        const startIndex = (0, binary_search_1.binarySearchFromRow)(arr, 0, arr.length, first.key, first.value) - 1;
+        const searchResult = searchWithKey(arr, options.withKey, startIndex);
+        found = searchResult.found;
+        foundIndex = searchResult.foundIndex;
+    }
     else if (options === null || options === void 0 ? void 0 : options.withKey) {
-        const isStructured = arr[0] instanceof types_1.Structure;
-        for (const a of arr) {
-            foundIndex++;
-            const row = isStructured ? Object.assign({ table_line: a }, a.get()) : { table_line: a };
-            if (options.withKey(row) === true) {
-                found = a;
-                break;
-            }
-        }
-        if (found === undefined) {
-            foundIndex = 0;
-        }
+        const searchResult = searchWithKey(arr, options.withKey);
+        found = searchResult.found;
+        foundIndex = searchResult.foundIndex;
     }
     else if (options === null || options === void 0 ? void 0 : options.from) {
         if (options.from instanceof types_1.FieldSymbol) {
@@ -69,7 +89,8 @@ function readTable(table, options) {
         throw new Error("runtime, readTable, unexpected input");
     }
     let subrc = found ? 0 : 4;
-    if ((options === null || options === void 0 ? void 0 : options.from) && subrc === 4) {
+    if (((options === null || options === void 0 ? void 0 : options.from) || (options === null || options === void 0 ? void 0 : options.binarySearch) === true)
+        && subrc === 4) {
         subrc = 8;
     }
     // @ts-ignore

package/build/src/types/data_reference.d.ts

@@ -19,7 +19,7 @@ export declare class DataReference {
     clear(): void;
     get(): any;
     array(): any;
-    set(value: any): void | Float | Structure | ABAPObject | this;
+    set(value: any): void | Float | ABAPObject | this | Structure;
     getOffset(input: {
         offset?: number | INumeric | Hex;
         length?: number | INumeric | Hex;

package/build/src/types/field_symbol.d.ts

@@ -18,7 +18,7 @@ export declare class FieldSymbol {
     unassign(): void;
     isAssigned(): boolean;
     getPointer(): any;
-    dereference(): INumeric | Float | ICharacter | Structure | Table | ABAPObject | undefined;
+    dereference(): INumeric | Float | ICharacter | ABAPObject | Table | Structure | undefined;
     clear(): void | Structure | undefined;
     get(): any;
     appendInitial(): import("./table").TableRowType | undefined;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@abaplint/runtime",
-  "version": "2.4.12",
+  "version": "2.4.14",
   "description": "Transpiler - Runtime",
   "main": "build/src/index.js",
   "typings": "build/src/index.d.ts",