@actual-app/api 25.12.0-nightly.20251119 → 25.12.0-nightly.20251120

package/@types/loot-core/src/shared/schedules.d.ts

@@ -1,11 +1,11 @@
 import type { IRuleOptions } from '@rschedule/core';
 import { Locale } from 'date-fns';
-import { type PayeeEntity, type ScheduleEntity } from '../types/models';
+import { type PayeeEntity, type RecurConfig, type ScheduleEntity } from '../types/models';
 import { Condition } from '../server/rules';
 export declare function getStatus(nextDate: string, completed: boolean, hasTrans: boolean, upcomingLength?: string): "completed" | "paid" | "due" | "upcoming" | "missed" | "scheduled";
 export declare function getStatusLabel(status: string): string;
 export declare function getHasTransactionsQuery(schedules: any): import("./query").Query;
-export declare function getRecurringDescription(config: any, dateFormat: any, locale: Locale): string;
+export declare function getRecurringDescription(config: RecurConfig, dateFormat: string, locale: Locale): string;
 export declare function recurConfigToRSchedule(config: any): IRuleOptions[];
 export declare function extractScheduleConds(conditions: any): {
     payee: any;

package/@types/loot-core/src/types/models/schedule.d.ts

@@ -11,7 +11,7 @@ export interface RecurConfig {
     patterns?: RecurPattern[];
     skipWeekend?: boolean;
     start: string;
-    endMode: 'never' | 'after_n_occurrences' | 'on_date';
+    endMode?: 'never' | 'after_n_occurrences' | 'on_date';
     endOccurrences?: number;
     endDate?: string;
     weekendSolveMode?: 'before' | 'after';

package/dist/app/bundle.api.js

@@ -12643,7 +12643,7 @@ proto.SyncResponse.prototype.setMerkle = function (value) {
 };
 goog.object.extend(exports, proto);
 function emptyTrie() {
-    return { hash: 0 };
+    return createTrieNode({ hash: 0 });
 }
 function isNumberTrieNodeKey(input) {
     return ["0", "1", "2"].includes(input);
@@ -12651,6 +12651,22 @@ function isNumberTrieNodeKey(input) {
 function getKeys(trie) {
     return Object.keys(trie).filter(isNumberTrieNodeKey);
 }
+function createTrieNode(props = {}) {
+    const result = {};
+    if (props["0"] !== void 0) {
+        result["0"] = props["0"];
+    }
+    if (props["1"] !== void 0) {
+        result["1"] = props["1"];
+    }
+    if (props["2"] !== void 0) {
+        result["2"] = props["2"];
+    }
+    if (props.hash !== void 0) {
+        result.hash = props.hash;
+    }
+    return result;
+}
 function keyToTimestamp(key) {
     const fullkey = key + "0".repeat(16 - key.length);
     return parseInt(fullkey, 3) * 1e3 * 60;
@@ -12658,7 +12674,12 @@ function keyToTimestamp(key) {
 function insert$1(trie, timestamp) {
     const hash = timestamp.hash();
     const key = Number(Math.floor(timestamp.millis() / 1e3 / 60)).toString(3);
-    trie = Object.assign({}, trie, { hash: (trie.hash || 0) ^ hash });
+    trie = createTrieNode({
+        "0": trie["0"],
+        "1": trie["1"],
+        "2": trie["2"],
+        hash: (trie.hash || 0) ^ hash
+    });
     return insertKey(trie, key, hash);
 }
 function insertKey(trie, key, hash) {
@@ -12668,10 +12689,18 @@ function insertKey(trie, key, hash) {
     const c = key[0];
     const t2 = isNumberTrieNodeKey(c) ? trie[c] : void 0;
     const n = t2 || {};
-    return Object.assign({}, trie, {
-        [c]: Object.assign({}, n, insertKey(n, key.slice(1), hash), {
-            hash: (n.hash || 0) ^ hash
-        })
+    const childWithInserted = insertKey(n, key.slice(1), hash);
+    const updatedChild = createTrieNode({
+        "0": childWithInserted["0"],
+        "1": childWithInserted["1"],
+        "2": childWithInserted["2"],
+        hash: (n.hash || 0) ^ hash
+    });
+    return createTrieNode({
+        "0": c === "0" ? updatedChild : trie["0"],
+        "1": c === "1" ? updatedChild : trie["1"],
+        "2": c === "2" ? updatedChild : trie["2"],
+        hash: trie.hash
     });
 }
 function diff(trie1, trie2) {
@@ -12713,15 +12742,20 @@ function prune(trie, n = 2) {
     }
     const keys2 = getKeys(trie);
     keys2.sort();
-    const next = { hash: trie.hash };
+    const prunedChildren = {};
     for (const k of keys2.slice(-n)) {
         const node2 = trie[k];
         if (!node2) {
             throw new Error(`TrieNode for key ${k} could not be found`);
         }
-        next[k] = prune(node2, n);
+        prunedChildren[k] = prune(node2, n);
     }
-    return next;
+    return createTrieNode({
+        "0": prunedChildren["0"],
+        "1": prunedChildren["1"],
+        "2": prunedChildren["2"],
+        hash: trie.hash
+    });
 }
 var murmurhash$1 = { exports: {} };
 var hasRequiredMurmurhash;

package/dist/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@actual-app/api",
-    "version": "25.12.0-nightly.20251119",
+    "version": "25.12.0-nightly.20251120",
     "license": "MIT",
     "description": "An API for Actual",
     "engines": {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@actual-app/api",
-  "version": "25.12.0-nightly.20251119",
+  "version": "25.12.0-nightly.20251120",
   "license": "MIT",
   "description": "An API for Actual",
   "engines": {