Merge pull request #252 from myoshi2891/dev-from-macmini

Add snail traversal algorithm and improve cache/memoize implementations

Author: myoshi2891

JavaScript/2622. Cache With Time Limit/Claude Code Sonnet 4.5/CacheWithTimeLimit_TS.ipynb

@@ -291,14 +291,17 @@
         "     * 未期限切れキーの数を取得\n",
         "     * @returns アクティブなキーの数\n",
         "     * @complexity Time: O(n), Space: O(1)\n",
+        "     * @remarks 副作用: 期限切れエントリを遅延削除する\n",
         "     */\n",
         "    count(): number {\n",
         "        const now = Date.now();\n",
         "        let count = 0;\n",
         "        \n",
         "        // 期限切れでないエントリのみカウント\n",
-        "        for (const entry of this.cache.values()) {\n",
-        "            if (entry.expiresAt > now) {\n",
+        "        for (const [key, entry] of this.cache) {\n",
+        "            if (entry.expiresAt <= now) {\n",
+        "                this.cache.delete(key);\n",
+        "            } else {\n",
         "                count++;\n",
         "            }\n",
         "        }\n",

JavaScript/2623. Memoize/Claude Code Sonnet 4.5/Memoize_TS.ipynb

@@ -65,8 +65,9 @@
         "    const memoized: Fn = function (...args: number[]): number {\n",
         "        const key = args.join(\",\");\n",
         "\n",
-        "        if (cache.has(key)) {\n",
-        "            return cache.get(key)!;\n",
+        "        const cached = cache.get(key);\n",
+        "        if (cached !== undefined) {\n",
+        "            return cached;\n",
         "        }\n",
         "\n",
         "        callCount += 1;\n",
@@ -141,8 +142,9 @@
         "            ? args[0]\n",
         "            : args[0] * 100001 + args[1];\n",
         "\n",
-        "        if (cache.has(key)) {\n",
-        "            return cache.get(key)!;\n",
+        "        const cached = cache.get(key);\n",
+        "        if (cached !== undefined) {\n",
+        "            return cached;\n",
         "        }\n",
         "\n",
         "        callCount += 1;\n",