@shaxpir/duiduidui-models 1.37.4 → 1.38.0

package/dist/models/Device.d.ts

@@ -96,38 +96,28 @@ export declare class Device extends Content {
      */
     get searchHistory(): SearchHistory;
     /**
-     * Gets the current search state (at the cursor position), or undefined if history is empty.
+     * Gets the current search state (top of stack), or undefined if history is empty.
      */
     get currentSearchState(): SearchState | undefined;
     /**
      * Returns true if back navigation is possible.
-     * Skips over empty entries to find a non-empty one.
+     * Requires at least two entries with a non-empty entry below the top.
      */
     get canGoBack(): boolean;
-    /**
-     * Returns true if forward navigation is possible.
-     * Skips over empty entries to find a non-empty one.
-     */
-    get canGoForward(): boolean;
     /**
      * Pushes a new search state onto the history stack.
-     * - Deduplicates: won't push if identical to current state
-     * - Discards forward history (entries after cursor)
+     * - Deduplicates: won't push if identical to current top
      * - Respects max entries limit (drops oldest when full)
      *
-     * @returns The new search state at the cursor, or undefined if deduplicated
+     * @returns The new search state, or undefined if deduplicated
      */
     pushSearchState(state: SearchState): SearchState | undefined;
     /**
-     * Navigates back in search history, skipping over empty entries.
-     * @returns The search state at the new cursor position, or undefined if can't go back
+     * Navigates back in search history by popping the top entry.
+     * Skips over empty entries to find a non-empty one.
+     * @returns The search state at the new top of stack, or undefined if can't go back
      */
     goBack(): SearchState | undefined;
-    /**
-     * Navigates forward in search history, skipping over empty entries.
-     * @returns The search state at the new cursor position, or undefined if can't go forward
-     */
-    goForward(): SearchState | undefined;
     /**
      * Clears the entire search history stack.
      */

package/dist/models/Device.js

@@ -320,40 +320,25 @@ class Device extends Content_1.Content {
         return this.payload.search_history;
     }
     /**
-     * Gets the current search state (at the cursor position), or undefined if history is empty.
+     * Gets the current search state (top of stack), or undefined if history is empty.
      */
     get currentSearchState() {
         this.checkDisposed("Device.currentSearchState");
         const history = this.searchHistory;
-        if (history.cursor < 0 || history.cursor >= history.entries.length) {
+        if (history.entries.length === 0) {
             return undefined;
         }
-        return history.entries[history.cursor];
+        return history.entries[history.entries.length - 1];
     }
     /**
      * Returns true if back navigation is possible.
-     * Skips over empty entries to find a non-empty one.
+     * Requires at least two entries with a non-empty entry below the top.
      */
     get canGoBack() {
         this.checkDisposed("Device.canGoBack");
         const history = this.searchHistory;
-        // Look for any non-empty entry before the cursor
-        for (let i = history.cursor - 1; i >= 0; i--) {
-            if (!(0, SearchState_1.isEmptySearchState)(history.entries[i])) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Returns true if forward navigation is possible.
-     * Skips over empty entries to find a non-empty one.
-     */
-    get canGoForward() {
-        this.checkDisposed("Device.canGoForward");
-        const history = this.searchHistory;
-        // Look for any non-empty entry after the cursor
-        for (let i = history.cursor + 1; i < history.entries.length; i++) {
+        // Look for any non-empty entry below the top of the stack
+        for (let i = history.entries.length - 2; i >= 0; i--) {
             if (!(0, SearchState_1.isEmptySearchState)(history.entries[i])) {
                 return true;
             }
@@ -362,48 +347,39 @@ class Device extends Content_1.Content {
     }
     /**
      * Pushes a new search state onto the history stack.
-     * - Deduplicates: won't push if identical to current state
-     * - Discards forward history (entries after cursor)
+     * - Deduplicates: won't push if identical to current top
      * - Respects max entries limit (drops oldest when full)
      *
-     * @returns The new search state at the cursor, or undefined if deduplicated
+     * @returns The new search state, or undefined if deduplicated
      */
     pushSearchState(state) {
         this.checkDisposed("Device.pushSearchState");
         const history = this.searchHistory;
-        // Deduplicate: don't push if identical to current state
-        const currentState = history.cursor >= 0 && history.cursor < history.entries.length
-            ? history.entries[history.cursor]
+        // Deduplicate: don't push if identical to current top
+        const currentState = history.entries.length > 0
+            ? history.entries[history.entries.length - 1]
             : undefined;
         if ((0, SearchState_1.areSearchStatesEqual)(state, currentState)) {
             return undefined;
         }
-        // Build new entries array
-        // Discard any entries after the current cursor (browser-style)
-        let newEntries = history.cursor >= 0
-            ? history.entries.slice(0, history.cursor + 1)
-            : [];
-        // Add the new state
-        newEntries.push(state);
+        let newEntries = [...history.entries, state];
         // Enforce max entries limit - drop oldest entries
-        let newCursor = newEntries.length - 1;
         if (newEntries.length > SearchState_1.SEARCH_HISTORY_MAX_ENTRIES) {
             const overflow = newEntries.length - SearchState_1.SEARCH_HISTORY_MAX_ENTRIES;
             newEntries = newEntries.slice(overflow);
-            newCursor = newEntries.length - 1;
         }
         // Commit the update
         const batch = new Operation_1.BatchOperation(this);
         batch.setPathValue(['payload', 'search_history'], {
             entries: newEntries,
-            cursor: newCursor
         });
         batch.commit();
         return state;
     }
     /**
-     * Navigates back in search history, skipping over empty entries.
-     * @returns The search state at the new cursor position, or undefined if can't go back
+     * Navigates back in search history by popping the top entry.
+     * Skips over empty entries to find a non-empty one.
+     * @returns The search state at the new top of stack, or undefined if can't go back
      */
     goBack() {
         this.checkDisposed("Device.goBack");
@@ -411,41 +387,22 @@ class Device extends Content_1.Content {
             return undefined;
         }
         const history = this.searchHistory;
-        // Find the first non-empty entry before the cursor
-        let newCursor = history.cursor - 1;
-        while (newCursor >= 0 && (0, SearchState_1.isEmptySearchState)(history.entries[newCursor])) {
-            newCursor--;
-        }
-        if (newCursor < 0) {
-            return undefined;
-        }
-        const batch = new Operation_1.BatchOperation(this);
-        batch.setPathValue(['payload', 'search_history', 'cursor'], newCursor);
-        batch.commit();
-        return history.entries[newCursor];
-    }
-    /**
-     * Navigates forward in search history, skipping over empty entries.
-     * @returns The search state at the new cursor position, or undefined if can't go forward
-     */
-    goForward() {
-        this.checkDisposed("Device.goForward");
-        if (!this.canGoForward) {
-            return undefined;
-        }
-        const history = this.searchHistory;
-        // Find the first non-empty entry after the cursor
-        let newCursor = history.cursor + 1;
-        while (newCursor < history.entries.length && (0, SearchState_1.isEmptySearchState)(history.entries[newCursor])) {
-            newCursor++;
+        // Pop entries from the top until we find a non-empty one below
+        let newEntries = [...history.entries];
+        newEntries.pop(); // Remove current top
+        // Skip over any empty entries
+        while (newEntries.length > 0 && (0, SearchState_1.isEmptySearchState)(newEntries[newEntries.length - 1])) {
+            newEntries.pop();
         }
-        if (newCursor >= history.entries.length) {
+        if (newEntries.length === 0) {
             return undefined;
         }
         const batch = new Operation_1.BatchOperation(this);
-        batch.setPathValue(['payload', 'search_history', 'cursor'], newCursor);
+        batch.setPathValue(['payload', 'search_history'], {
+            entries: newEntries,
+        });
         batch.commit();
-        return history.entries[newCursor];
+        return newEntries[newEntries.length - 1];
     }
     /**
      * Clears the entire search history stack.

package/dist/models/SearchState.d.ts

@@ -21,20 +21,19 @@ export interface SearchState {
  */
 export declare const SEARCH_HISTORY_MAX_ENTRIES = 50;
 /**
- * Search history with browser-style back/forward navigation.
+ * Search history as a simple stack (push/pop).
  *
- * - `entries`: Stack of search states
- * - `cursor`: Current position in the stack (0-indexed)
+ * - `entries`: Stack of search states, current state is the last entry
  *
  * Navigation behavior:
- * - Back: decrements cursor (if cursor > 0)
- * - Forward: increments cursor (if cursor < entries.length - 1)
- * - New search: discards entries after cursor, pushes new entry, cursor moves to end
+ * - Back: pops the last entry, returns the new top
+ * - New search: pushes new entry onto the end
  * - Clear: empties the entire stack
  */
 export interface SearchHistory {
     entries: SearchState[];
-    cursor: number;
+    /** @deprecated No longer used — current state is always the last entry. Kept for backwards compatibility with existing persisted data. */
+    cursor?: number;
 }
 /**
  * Creates an empty search history.

package/dist/models/SearchState.js

@@ -15,7 +15,6 @@ exports.SEARCH_HISTORY_MAX_ENTRIES = 50;
 function createEmptySearchHistory() {
     return {
         entries: [],
-        cursor: -1
     };
 }
 /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@shaxpir/duiduidui-models",
-  "version": "1.37.4",
+  "version": "1.38.0",
   "repository": {
     "type": "git",
     "url": "https://github.com/shaxpir/duiduidui-models"