solid-ctrl-flow 2.2.4 → 2.2.5

package/dist/index.d.ts

@@ -134,7 +134,8 @@ export declare class OrderedLinkedList<T> {
     /** Yields all the elements PAST the current */
     [Symbol.iterator](): Generator<T>;
     /**
-     * Adds a node to the list in order
+     * Adds a node to the list in order.
+     * If two nodes have the same order, it would have been more efficient to put the latest one first, but this would not have been ok, since we also want to order by insertion time
      * @param node The node to add
      * @param comp The comparison function to use
      * @returns The same value as {@link node}

package/dist/index.mjs

@@ -61,14 +61,15 @@ class OrderedLinkedList {
     yield* next;
   }
   /**
-   * Adds a node to the list in order
-   * @param node The node to add
-   * @param comp The comparison function to use
-   * @returns The same value as {@link node}
-   */
+     * Adds a node to the list in order.
+  * If two nodes have the same order, it would have been more efficient to put the latest one first, but this would not have been ok, since we also want to order by insertion time
+     * @param node The node to add
+     * @param comp The comparison function to use
+     * @returns The same value as {@link node}
+     */
   add(node, comp) {
     const { next } = this;
-    if (next && comp(node.value, next.value) > 0)
+    if (next && comp(node.value, next.value) >= 0)
       return next.add(node, comp);
     this.next = node;
     node.prev = this;
@@ -194,7 +195,10 @@ function Source(props) {
   };
   const node = new OrderedLinkedListNode(info);
   createRenderEffect(on(order, () => {
-    onCleanup(() => node.remove());
+    onCleanup(() => {
+      node.remove();
+      state.force();
+    });
     sources.add(node, COMPARATOR);
     state.force();
   }));

package/dist/index.umd.js

@@ -64,14 +64,15 @@
       yield* next;
     }
     /**
-     * Adds a node to the list in order
-     * @param node The node to add
-     * @param comp The comparison function to use
-     * @returns The same value as {@link node}
-     */
+       * Adds a node to the list in order.
+    * If two nodes have the same order, it would have been more efficient to put the latest one first, but this would not have been ok, since we also want to order by insertion time
+       * @param node The node to add
+       * @param comp The comparison function to use
+       * @returns The same value as {@link node}
+       */
     add(node, comp) {
       const { next } = this;
-      if (next && comp(node.value, next.value) > 0)
+      if (next && comp(node.value, next.value) >= 0)
         return next.add(node, comp);
       this.next = node;
       node.prev = this;
@@ -197,7 +198,10 @@
     };
     const node = new OrderedLinkedListNode(info);
     solidJs.createRenderEffect(solidJs.on(order, () => {
-      solidJs.onCleanup(() => node.remove());
+      solidJs.onCleanup(() => {
+        node.remove();
+        state.force();
+      });
       sources.add(node, COMPARATOR);
       state.force();
     }));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "solid-ctrl-flow",
-  "version": "2.2.4",
+  "version": "2.2.5",
   "description": "Control flow components for solid-js",
   "author": "AFatNiBBa",
   "license": "ISC",