{"entries":[{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T09:37:52.000000+01:00"},"committer":{"email":"did:plc:wshs7t2adsemcrrd4snkeqli","name":"Tangled","when":"2026-03-22T08:42:38.000000Z"},"hash":"4b4f554ac3dd278a6637adb6fe6d4f90eeeeabef","message":"Implement JS parser: AST and expression/statement parsing\n\nAdd a recursive-descent JavaScript parser with Pratt expression parsing\nfor ECMAScript 2024. Transforms the token stream from the lexer into an\nAbstract Syntax Tree.\n\nAST node types cover:\n- All expression types (literals, binary, unary, assignment, member access,\n call, new, arrow functions, template literals, spread, yield, await)\n- All statement types (if, for/for-in/for-of, while, do-while, switch,\n try/catch/finally, return, throw, break, continue, labeled, with)\n- Variable declarations (var/let/const) with destructuring patterns\n- Function declarations (sync, async, generators)\n- Class declarations (constructor, methods, getters/setters, static)\n- Import/export declarations (default, named, namespace, re-export)\n\nFeatures:\n- Operator precedence via Pratt parsing with binding power table\n- Automatic Semicolon Insertion (ASI) using lexer newline tracking\n- Arrow function detection with expression-to-pattern reinterpretation\n- Destructuring patterns (array, object, default values, rest)\n- for-in/for-of disambiguation with allow_in flag\n- 73 unit tests covering all grammar productions and error cases\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"62b545f79a6dc463b500ac6080e89fcf9c87c984"},"mode":"0100644","name":"ast.rs","size":12022},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T15:02:41.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T15:02:41.000000+01:00"},"hash":"9c1ff471d487d71de1c8569c28e3f80e064f2f4e","message":"Fix Map/Set deleted entry marker to avoid key collision\n\nThe __deleted__ string marker could collide with user data — if a user\nset \"__deleted__\" as a Map key, it would be silently treated as a\ndeleted slot. Instead, mark entries as deleted by removing their key\nproperty from the entries object. The existing entry_key_at function\nalready returns None for missing properties via the ? operator.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"6863c24ba898e7a3430247e31188dc3116274754"},"mode":"0100644","name":"builtins.rs","size":190877},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T12:44:54.000000+01:00"},"committer":{"email":"did:plc:wshs7t2adsemcrrd4snkeqli","name":"Tangled","when":"2026-03-22T11:50:43.000000Z"},"hash":"ec5ec682a916a7fb5f8408869bea4aac0b83775e","message":"Implement JS closures, const immutability, and method-call this binding\n\nAdd upvalue-based closure system using GC-allocated cells:\n- New bytecode ops: NewCell, CellLoad, CellStore, LoadUpvalue, StoreUpvalue\n- UpvalueDef metadata on Function for closure capture resolution\n- HeapObject::Cell variant for mutable captured variable storage\n- Free variable analysis with transitive capture support\n- Captured parameters are boxed into cells at function entry\n- const declarations enforce immutability at compile time\n- Method calls (obj.method()) set this before invocation\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"7c42abf22e0bda70f5e89325736dd5d8a6673d4b"},"mode":"0100644","name":"bytecode.rs","size":37035},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:36:00.000000+01:00"},"committer":{"email":"did:plc:wshs7t2adsemcrrd4snkeqli","name":"Tangled","when":"2026-03-22T13:41:18.000000Z"},"hash":"302c2cddbe1b2e4a2b280ca452b718471b664114","message":"Implement JS built-in RegExp engine\n\nAdd a from-scratch regex engine and wire it into the JS runtime:\n\n- regex.rs: Pattern parser (character classes, quantifiers, anchors,\n groups, alternation, backreferences, lookahead, escape sequences)\n and backtracking matcher with proper continuation-based sequence\n matching for greedy/lazy quantifiers.\n\n- RegExp constructor and prototype methods (test, exec, toString)\n with support for g/i/m/s/u/y flags, lastIndex tracking, and\n named capture groups.\n\n- Compiler emits RegExp(pattern, flags) calls for regex literals.\n\n- String.prototype gains match, matchAll, search methods; replace,\n replaceAll, split updated to handle RegExp arguments with capture\n group substitution ($1, $&, etc.).\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"272f3d3425872b734fc2564c9e2808c116c004af"},"mode":"0100644","name":"compiler.rs","size":107615},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T10:45:59.000000+01:00"},"committer":{"email":"did:plc:wshs7t2adsemcrrd4snkeqli","name":"Tangled","when":"2026-03-22T09:48:52.000000Z"},"hash":"38791b59cf6e8cdb061343c3c3e92a15bf85981a","message":"Implement tri-color mark-and-sweep garbage collector for JS engine\n\nAdd a generic GC module (gc.rs) with tri-color marking (white/gray/black),\nheap allocation via Vec with free-list reuse, and stop-the-world collection\ntriggered when live object count exceeds a configurable threshold.\n\nRefactor VM to use GcRef handles for heap objects (plain objects and\nfunctions) instead of owned values. This gives correct JS reference\nsemantics — object assignment shares identity rather than deep-cloning.\nThe GC traces through object properties and prototype chains to find all\nreachable objects, and correctly collects cycles.\n\nKey changes:\n- gc.rs: Generic Gc with alloc/get/collect, HeapSlot with\n color metadata, mark phase with gray stack, sweep with free-list\n- vm.rs: Value::Object(GcRef) and Value::Function(GcRef) replace owned\n data; VM allocates through self.gc and triggers collection after\n allocations; root collection scans registers and globals\n- lib.rs: evaluate() uses to_js_string(&gc) for GC-aware string conversion\n\n8 new GC tests (alloc, collect, transitive reachability, cycle collection,\nfree-list reuse, threshold, stress) plus 3 integration tests. All 226\nexisting tests continue to pass.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"25b2bb0befcc0694cde5bddaa48b48be6201b3e4"},"mode":"0100644","name":"gc.rs","size":11688},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:41:06.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:45:45.000000+01:00"},"hash":"b4c18278bc14048c6cf7de9d9f3a1b6f88916d81","message":"Fix String.prototype.search lastIndex handling and remove unimplemented regex flags\n\n- search() now saves/restores lastIndex so global/sticky regexps\n always search from position 0 per the ES spec\n- Remove 'v' (UnicodeSets) and 'd' (HasIndices) from lexer's accepted\n regex flags since they're not implemented in the regex engine\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"71d085ba9e20bab720dd813db41976426deffa18"},"mode":"0100644","name":"lexer.rs","size":65327},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:36:00.000000+01:00"},"committer":{"email":"did:plc:wshs7t2adsemcrrd4snkeqli","name":"Tangled","when":"2026-03-22T13:41:18.000000Z"},"hash":"302c2cddbe1b2e4a2b280ca452b718471b664114","message":"Implement JS built-in RegExp engine\n\nAdd a from-scratch regex engine and wire it into the JS runtime:\n\n- regex.rs: Pattern parser (character classes, quantifiers, anchors,\n groups, alternation, backreferences, lookahead, escape sequences)\n and backtracking matcher with proper continuation-based sequence\n matching for greedy/lazy quantifiers.\n\n- RegExp constructor and prototype methods (test, exec, toString)\n with support for g/i/m/s/u/y flags, lastIndex tracking, and\n named capture groups.\n\n- Compiler emits RegExp(pattern, flags) calls for regex literals.\n\n- String.prototype gains match, matchAll, search methods; replace,\n replaceAll, split updated to handle RegExp arguments with capture\n group substitution ($1, $&, etc.).\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"272f3d3425872b734fc2564c9e2808c116c004af"},"mode":"0100644","name":"lib.rs","size":3019},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T09:42:25.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T09:43:01.000000+01:00"},"hash":"f8089da959472631ddcfd4304048840095a4e68c","message":"Fix export default anonymous function/class parsing\n\nexport default function() {} and export default class {} are valid\nJavaScript but the parser incorrectly required a name. Check whether\nthe function/class has a name and route to expression parsing when\nanonymous.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"e4be849304ec3334c7c2765038b0a7d2d4a4ba6d"},"mode":"0100644","name":"parser.rs","size":125659},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:45:04.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:45:45.000000+01:00"},"hash":"e796770e7a630c924aeec8aa201def878e8906d4","message":"Fix Dot matching to use is_line_terminator for all ECMAScript line terminators\n\nThe Dot (.) without the s flag should not match U+2028 (LINE SEPARATOR)\nand U+2029 (PARAGRAPH SEPARATOR) per the ECMAScript spec, not just \\n\nand \\r. Use the existing is_line_terminator helper for consistency.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"1ac0340b1a17ff803b533b12798625699e21117c"},"mode":"0100644","name":"regex.rs","size":44394},{"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:58:54.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T14:58:54.000000+01:00"},"hash":"e13eab70858950e79e92ccf021a11c69ece0e76f","message":"Implement JS built-in Map, Set, WeakMap, WeakSet collections\n\nAdd Map, Set, WeakMap, and WeakSet constructors with prototype\nmethods to the JavaScript engine:\n\n- Map: constructor (from iterable), set/get/has/delete/clear,\n size property, forEach, keys/values/entries iterators.\n SameValueZero key equality, insertion order preserved.\n\n- Set: constructor (from iterable), add/has/delete/clear,\n size property, forEach, keys/values/entries iterators.\n SameValueZero value equality, insertion order preserved.\n\n- WeakMap: constructor, set/get/has/delete. Keys must be objects.\n\n- WeakSet: constructor, add/has/delete. Values must be objects.\n\nInternal storage uses indexed entry objects on the GC heap with\ndeleted-slot markers for stable insertion-order iteration.\n\n30 new integration tests covering all methods and edge cases\n(NaN keys, object keys, chaining, uniqueness, constructor from\narrays, insertion order preservation).\n\nAlso removes Map/Set from test262 unsupported features list.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"ed2b892278aa2e7e0ec7a1a091a4e1fd4c633555"},"mode":"0100644","name":"vm.rs","size":173479}],"lastCommit":{"author":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T15:02:41.000000+01:00"},"committer":{"email":"hello@pierrelf.com","name":"Pierre Le Fevre","when":"2026-03-22T15:02:41.000000+01:00"},"hash":"9c1ff471d487d71de1c8569c28e3f80e064f2f4e","message":"Fix Map/Set deleted entry marker to avoid key collision\n\nThe __deleted__ string marker could collide with user data — if a user\nset \"__deleted__\" as a Map key, it would be silently treated as a\ndeleted slot. Instead, mark entries as deleted by removing their key\nproperty from the entries object. The existing entry_key_at function\nalready returns None for missing properties via the ? operator.\n\nCo-Authored-By: Claude Opus 4.6 (1M context) \n","tree":"6863c24ba898e7a3430247e31188dc3116274754"}}