[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7EKF9PB0SDGT6KNFZSMTMA7":3,"skill-same:01M7EKF9PB0SDGT6KNFZSMTMA7":76},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":14,"repositoryHtmlUrl":27,"repositoryHomepageUrl":6,"ownerHtmlUrl":28,"ownerBlogUrl":29,"ownerDescription":30,"updatedAt":31,"install":32,"resources":45},"01M7EKF9PB0SDGT6KNFZSMTMA7","memory-management",null,"Native systems memory management, arena & pool allocators, cache locality, false sharing prevention, ASan\u002FValgrind verification, and leak-free resource lifecycles.","raillen\u002Fdaisy-code-editor","raillen","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F50306048?v=4","01M7EKBDVVBSPF21PBPVJYMNYR","Raillen Santos","01M7EKBDWD12A1K9N9Y638FGX9",0,"MIT","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: memory-management\ndescription: Native systems memory management, arena & pool allocators, cache locality, false sharing prevention, ASan\u002FValgrind verification, and leak-free resource lifecycles.\n---\n\n# Native Memory Management & Allocation Architecture\n\n## 1. Title and Description\n**Native Memory Management & Allocation Architecture (`memory-management`)**\nGoverns the design, implementation, and verification of low-level memory architectures across C, C++, Rust, Zig, and systems runtimes. Covers custom allocation strategies (Arenas, Fixed-size Pools, Slabs), cache-conscious layout optimization (SoA vs AoS, false sharing prevention), spatial\u002Ftemporal safety, and AddressSanitizer (ASan) validation.\n\n## 2. Purpose\nEliminate memory fragmentation, latency spikes from general-purpose `malloc`\u002F`free` contention, use-after-free (UAF) vulnerabilities, and cache-thrashing bottlenecks in performance-critical systems.\n\n## 3. Prerequisites\n- Target language toolchain supporting low-level memory addressing (C, C++, Rust, Zig, Odin).\n- Sanitizer tooling: AddressSanitizer (`-fsanitize=address`) or Valgrind Memcheck.\n\n## 4. Inputs\n- Subsystem architecture specifications and memory footprint targets.\n- Allocation frequency requirements: per-frame, per-request, or persistent.\n- Hardware constraints: CPU cache hierarchy (L1\u002FL2\u002FL3), cache line size (typically 64 bytes), and page size (typically 4KB).\n\n## 5. Outputs\n- Custom allocator implementations (Arena, Pool, Ring Buffer) with alignment proofs.\n- Cache-optimized data layouts (Structure of Arrays, cache-aligned hot structs).\n- Memory audit reports conforming to `templates\u002Fmemory-management-template.md`.\n- Sanitizer-clean verification logs with zero detected leaks or invalid accesses.\n\n## 6. Execution Steps\n\n### Step 1: Select the Optimal Allocation Strategy\nMatch the problem's lifecycle to the mathematically optimal memory allocator:\n\n| Strategy | Allocation Complexity | Deallocation Complexity | Ideal Workload |\n|---|---|---|---|\n| **Arena \u002F Bump Allocator** | O(1) (pointer increment) | O(1) (bulk reset) | Per-frame game ticks, per-request HTTP parsing, compiler AST passes |\n| **Fixed-Size Pool Allocator** | O(1) (freelist pop) | O(1) (freelist push) | Homogeneous objects (graph nodes, ECS components, network packets) |\n| **Stack \u002F Scratch Allocator** | O(1) | O(1) (LIFO rewind) | Scoped temporary buffers, intermediate string transformations |\n| **Slab \u002F Buddy Allocator** | O(log N) | O(log N) | Dynamic objects of variable power-of-two sizes with coalescing |\n\n### Step 2: Enforce Strict Memory Alignment\nHardware requires values to reside at memory addresses that are multiples of their size:\n1. **Alignment Calculation**:\n   ```c\n   uintptr_t align_forward(uintptr_t ptr, size_t align) {\n       uintptr_t p = ptr;\n       uintptr_t a = (uintptr_t)align;\n       uintptr_t modulo = p & (a - 1); \u002F\u002F Only valid when align is power-of-two\n       if (modulo != 0) {\n           p += (a - modulo);\n       }\n       return p;\n   }\n   ```\n2. **SIMD & Page Alignment**:\n   - Ensure AVX-256 buffers are aligned to 32 bytes; AVX-512 to 64 bytes.\n   - Ensure direct I\u002FO and shared memory buffers align with OS virtual memory page boundaries (4096 bytes).\n\n### Step 3: Cache Locality & False Sharing Prevention\n1. **False Sharing**:\n   - Occurs when two independent threads modify variables residing on the same 64-byte cache line, causing cache-coherence invalidate traffic across CPU cores.\n   - **Remediation**: Align per-thread structures to 64-byte boundaries using `alignas(64)` (C++), `#[repr(align(64))]` (Rust), or explicit padding fields.\n2. **Structure of Arrays (SoA) vs Array of Structures (AoS)**:\n   - Prefer AoS (`struct Particle { float x, y, z, mass, color; }`) for random individual access.\n   - Prefer SoA (`struct ParticleCloud { float* x; float* y; float* z; }`) for tight vectorized update loops that scan single fields sequentially.\n\n### Step 4: AddressSanitizer (ASan) Poisoning Integration\nCustom memory arenas bypass libc `malloc`\u002F`free`, which blinds default ASan checks. Manually instrument custom allocators using the ASan C API:\n```c\n#if defined(__SANITIZE_ADDRESS__) || (defined(__has_feature) && __has_feature(address_sanitizer))\n#include \u003Csanitizer\u002Fasan_interface.h>\n#define ASAN_POISON_MEMORY_REGION(addr, size)   __asan_poison_memory_region((addr), (size))\n#define ASAN_UNPOISON_MEMORY_REGION(addr, size) __asan_unpoison_memory_region((addr), (size))\n#else\n#define ASAN_POISON_MEMORY_REGION(addr, size)   ((void)0)\n#define ASAN_UNPOISON_MEMORY_REGION(addr, size) ((void)0)\n#endif\n```\n- Poison unallocated arena capacity: `ASAN_POISON_MEMORY_REGION(arena->curr, arena->capacity - arena->offset)`.\n- Unpoison allocated blocks on bump: `ASAN_UNPOISON_MEMORY_REGION(allocated_ptr, requested_size)`.\n- Re-poison everything upon `arena_reset()`.\n\n### Step 5: Virtual Memory & Operating System Guard Pages\nFor large allocations (> 1MB):\n1. Use `mmap(MAP_ANONYMOUS | MAP_PRIVATE)` (POSIX) or `VirtualAlloc` (Windows) to allocate virtual address space lazily.\n2. Place a `PROT_NONE` guard page at the end of the allocation block to immediately trap stack\u002Fbuffer overflows with a hardware segment fault (`SIGSEGV`) rather than silent memory corruption.\n\n### Step 6: Verification & Stress Testing\n1. Compile with `-fsanitize=address,undefined -g`.\n2. Run differential tests with Valgrind: `valgrind --tool=memcheck --leak-check=full --track-origins=yes .\u002Fbinary`.\n3. Check high-water memory mark and fragmentation metrics.\n\n## 7. Verification\nRun the memory audit routine:\n```bash\n# 1. AddressSanitizer build and execution\nclang -fsanitize=address,undefined -g -O1 src\u002Fallocator_test.c -o \u002Ftmp\u002Fasan_test\n\u002Ftmp\u002Fasan_test\n\n# 2. Check for naked malloc\u002Ffree in hot code\ngrep -rn \"malloc(\" src\u002F | grep -v \"allocator\"\n```\n\n## 8. Fallbacks & Failure Recovery\n| Failure Class | Root Cause | Deterministic Remediation |\n|---|---|---|\n| Use-After-Free (UAF) | Pointer accessed after arena reset or block free | Poison freed regions using ASan macros. Clear pointers to `NULL` immediately upon release. |\n| Memory Fragmentation | Interleaved allocation\u002Fdeallocation of heterogeneous sizes in general heap | Segregate objects by size class into dedicated pool allocators or arenas. |\n| Cache Thrashing \u002F Stalls | Heavy cache misses due to fragmented pointer chasing | Flatten linked data structures into contiguous arrays indexed by 32-bit handles instead of raw 64-bit pointers. |\n| False Sharing CPU Bottleneck | Cores modifying adjacent memory in parallel loop | Pad data to 64 bytes (`alignas(64)`) or allocate thread-local scratch buffers. |\n\n## 9. Constraints\n- **Zero dynamic heap allocations in hot loops**: No `malloc`, `new`, or heap reallocation in per-frame or high-frequency real-time loops.\n- **Explicit alignment proofs**: All custom allocations must be mathematically guaranteed to meet type alignment requirements.\n- **Clean ASan passes**: Zero memory leaks, out-of-bounds, or misaligned accesses tolerated under `-fsanitize=address`.\n\n## 10. Examples\n\n### Anti-Pattern: Unaligned Allocator & Blind Use-After-Free\n```c\n\u002F\u002F BAD: Ignores alignment requirements, no ASan poisoning, leaks on individual free\ntypedef struct {\n    char* buffer;\n    size_t offset;\n    size_t capacity;\n} NaiveArena;\n\nvoid* naive_alloc(NaiveArena* a, size_t size) {\n    void* ptr = a->buffer + a->offset; \u002F\u002F ERROR: Does not align ptr! UB on ARM \u002F SIMD!\n    a->offset += size;                 \u002F\u002F ERROR: No capacity check; buffer overflow!\n    return ptr;\n}\n```\n\n### Idiomatic Pattern: Robust Aligned Arena with ASan Instrumentation\n```c\n\u002F\u002F GOOD: Safe alignment math, bounds enforcement, and sanitizer poison guards\n#include \u003Cstdint.h>\n#include \u003Cstddef.h>\n#include \u003Cstdbool.h>\n\ntypedef struct {\n    uint8_t* buffer;\n    size_t offset;\n    size_t capacity;\n} MemoryArena;\n\nstatic inline uintptr_t align_forward_ptr(uintptr_t ptr, size_t align) {\n    uintptr_t p = ptr;\n    uintptr_t a = (uintptr_t)align;\n    uintptr_t modulo = p & (a - 1);\n    if (modulo != 0) {\n        p += (a - modulo);\n    }\n    return p;\n}\n\nvoid* arena_alloc_align(MemoryArena* arena, size_t size, size_t alignment) {\n    uintptr_t current_ptr = (uintptr_t)arena->buffer + (uintptr_t)arena->offset;\n    uintptr_t aligned_ptr = align_forward_ptr(current_ptr, alignment);\n    size_t new_offset = (aligned_ptr - (uintptr_t)arena->buffer) + size;\n\n    if (new_offset > arena->capacity) {\n        return NULL; \u002F\u002F Out of memory\n    }\n\n    arena->offset = new_offset;\n    return (void*)aligned_ptr;\n}\n\nvoid arena_reset(MemoryArena* arena) {\n    arena->offset = 0;\n}\n```\n","# Native Memory Management & Allocation Architecture\n\n## 1. Title and Description\n**Native Memory Management & Allocation Architecture (`memory-management`)**\nGoverns the design, implementation, and verification of low-level memory architectures across C, C++, Rust, Zig, and systems runtimes. Covers custom allocation strategies (Arenas, Fixed-size Pools, Slabs), cache-conscious layout optimization (SoA vs AoS, false sharing prevention), spatial\u002Ftemporal safety, and AddressSanitizer (ASan) validation.\n\n## 2. Purpose\nEliminate memory fragmentation, latency spikes from general-purpose `malloc`\u002F`free` contention, use-after-free (UAF) vulnerabilities, and cache-thrashing bottlenecks in performance-critical systems.\n\n## 3. Prerequisites\n- Target language toolchain supporting low-level memory addressing (C, C++, Rust, Zig, Odin).\n- Sanitizer tooling: AddressSanitizer (`-fsanitize=address`) or Valgrind Memcheck.\n\n## 4. Inputs\n- Subsystem architecture specifications and memory footprint targets.\n- Allocation frequency requirements: per-frame, per-request, or persistent.\n- Hardware constraints: CPU cache hierarchy (L1\u002FL2\u002FL3), cache line size (typically 64 bytes), and page size (typically 4KB).\n\n## 5. Outputs\n- Custom allocator implementations (Arena, Pool, Ring Buffer) with alignment proofs.\n- Cache-optimized data layouts (Structure of Arrays, cache-aligned hot structs).\n- Memory audit reports conforming to `templates\u002Fmemory-management-template.md`.\n- Sanitizer-clean verification logs with zero detected leaks or invalid accesses.\n\n## 6. Execution Steps\n\n### Step 1: Select the Optimal Allocation Strategy\nMatch the problem's lifecycle to the mathematically optimal memory allocator:\n\n| Strategy | Allocation Complexity | Deallocation Complexity | Ideal Workload |\n|---|---|---|---|\n| **Arena \u002F Bump Allocator** | O(1) (pointer increment) | O(1) (bulk reset) | Per-frame game ticks, per-request HTTP parsing, compiler AST passes |\n| **Fixed-Size Pool Allocator** | O(1) (freelist pop) | O(1) (freelist push) | Homogeneous objects (graph nodes, ECS components, network packets) |\n| **Stack \u002F Scratch Allocator** | O(1) | O(1) (LIFO rewind) | Scoped temporary buffers, intermediate string transformations |\n| **Slab \u002F Buddy Allocator** | O(log N) | O(log N) | Dynamic objects of variable power-of-two sizes with coalescing |\n\n### Step 2: Enforce Strict Memory Alignment\nHardware requires values to reside at memory addresses that are multiples of their size:\n1. **Alignment Calculation**:\n   ```c\n   uintptr_t align_forward(uintptr_t ptr, size_t align) {\n       uintptr_t p = ptr;\n       uintptr_t a = (uintptr_t)align;\n       uintptr_t modulo = p & (a - 1); \u002F\u002F Only valid when align is power-of-two\n       if (modulo != 0) {\n           p += (a - modulo);\n       }\n       return p;\n   }\n   ```\n2. **SIMD & Page Alignment**:\n   - Ensure AVX-256 buffers are aligned to 32 bytes; AVX-512 to 64 bytes.\n   - Ensure direct I\u002FO and shared memory buffers align with OS virtual memory page boundaries (4096 bytes).\n\n### Step 3: Cache Locality & False Sharing Prevention\n1. **False Sharing**:\n   - Occurs when two independent threads modify variables residing on the same 64-byte cache line, causing cache-coherence invalidate traffic across CPU cores.\n   - **Remediation**: Align per-thread structures to 64-byte boundaries using `alignas(64)` (C++), `#[repr(align(64))]` (Rust), or explicit padding fields.\n2. **Structure of Arrays (SoA) vs Array of Structures (AoS)**:\n   - Prefer AoS (`struct Particle { float x, y, z, mass, color; }`) for random individual access.\n   - Prefer SoA (`struct ParticleCloud { float* x; float* y; float* z; }`) for tight vectorized update loops that scan single fields sequentially.\n\n### Step 4: AddressSanitizer (ASan) Poisoning Integration\nCustom memory arenas bypass libc `malloc`\u002F`free`, which blinds default ASan checks. Manually instrument custom allocators using the ASan C API:\n```c\n#if defined(__SANITIZE_ADDRESS__) || (defined(__has_feature) && __has_feature(address_sanitizer))\n#include \u003Csanitizer\u002Fasan_interface.h>\n#define ASAN_POISON_MEMORY_REGION(addr, size)   __asan_poison_memory_region((addr), (size))\n#define ASAN_UNPOISON_MEMORY_REGION(addr, size) __asan_unpoison_memory_region((addr), (size))\n#else\n#define ASAN_POISON_MEMORY_REGION(addr, size)   ((void)0)\n#define ASAN_UNPOISON_MEMORY_REGION(addr, size) ((void)0)\n#endif\n```\n- Poison unallocated arena capacity: `ASAN_POISON_MEMORY_REGION(arena->curr, arena->capacity - arena->offset)`.\n- Unpoison allocated blocks on bump: `ASAN_UNPOISON_MEMORY_REGION(allocated_ptr, requested_size)`.\n- Re-poison everything upon `arena_reset()`.\n\n### Step 5: Virtual Memory & Operating System Guard Pages\nFor large allocations (> 1MB):\n1. Use `mmap(MAP_ANONYMOUS | MAP_PRIVATE)` (POSIX) or `VirtualAlloc` (Windows) to allocate virtual address space lazily.\n2. Place a `PROT_NONE` guard page at the end of the allocation block to immediately trap stack\u002Fbuffer overflows with a hardware segment fault (`SIGSEGV`) rather than silent memory corruption.\n\n### Step 6: Verification & Stress Testing\n1. Compile with `-fsanitize=address,undefined -g`.\n2. Run differential tests with Valgrind: `valgrind --tool=memcheck --leak-check=full --track-origins=yes .\u002Fbinary`.\n3. Check high-water memory mark and fragmentation metrics.\n\n## 7. Verification\nRun the memory audit routine:\n```bash\n# 1. AddressSanitizer build and execution\nclang -fsanitize=address,undefined -g -O1 src\u002Fallocator_test.c -o \u002Ftmp\u002Fasan_test\n\u002Ftmp\u002Fasan_test\n\n# 2. Check for naked malloc\u002Ffree in hot code\ngrep -rn \"malloc(\" src\u002F | grep -v \"allocator\"\n```\n\n## 8. Fallbacks & Failure Recovery\n| Failure Class | Root Cause | Deterministic Remediation |\n|---|---|---|\n| Use-After-Free (UAF) | Pointer accessed after arena reset or block free | Poison freed regions using ASan macros. Clear pointers to `NULL` immediately upon release. |\n| Memory Fragmentation | Interleaved allocation\u002Fdeallocation of heterogeneous sizes in general heap | Segregate objects by size class into dedicated pool allocators or arenas. |\n| Cache Thrashing \u002F Stalls | Heavy cache misses due to fragmented pointer chasing | Flatten linked data structures into contiguous arrays indexed by 32-bit handles instead of raw 64-bit pointers. |\n| False Sharing CPU Bottleneck | Cores modifying adjacent memory in parallel loop | Pad data to 64 bytes (`alignas(64)`) or allocate thread-local scratch buffers. |\n\n## 9. Constraints\n- **Zero dynamic heap allocations in hot loops**: No `malloc`, `new`, or heap reallocation in per-frame or high-frequency real-time loops.\n- **Explicit alignment proofs**: All custom allocations must be mathematically guaranteed to meet type alignment requirements.\n- **Clean ASan passes**: Zero memory leaks, out-of-bounds, or misaligned accesses tolerated under `-fsanitize=address`.\n\n## 10. Examples\n\n### Anti-Pattern: Unaligned Allocator & Blind Use-After-Free\n```c\n\u002F\u002F BAD: Ignores alignment requirements, no ASan poisoning, leaks on individual free\ntypedef struct {\n    char* buffer;\n    size_t offset;\n    size_t capacity;\n} NaiveArena;\n\nvoid* naive_alloc(NaiveArena* a, size_t size) {\n    void* ptr = a->buffer + a->offset; \u002F\u002F ERROR: Does not align ptr! UB on ARM \u002F SIMD!\n    a->offset += size;                 \u002F\u002F ERROR: No capacity check; buffer overflow!\n    return ptr;\n}\n```\n\n### Idiomatic Pattern: Robust Aligned Arena with ASan Instrumentation\n```c\n\u002F\u002F GOOD: Safe alignment math, bounds enforcement, and sanitizer poison guards\n#include \u003Cstdint.h>\n#include \u003Cstddef.h>\n#include \u003Cstdbool.h>\n\ntypedef struct {\n    uint8_t* buffer;\n    size_t offset;\n    size_t capacity;\n} MemoryArena;\n\nstatic inline uintptr_t align_forward_ptr(uintptr_t ptr, size_t align) {\n    uintptr_t p = ptr;\n    uintptr_t a = (uintptr_t)align;\n    uintptr_t modulo = p & (a - 1);\n    if (modulo != 0) {\n        p += (a - modulo);\n    }\n    return p;\n}\n\nvoid* arena_alloc_align(MemoryArena* arena, size_t size, size_t alignment) {\n    uintptr_t current_ptr = (uintptr_t)arena->buffer + (uintptr_t)arena->offset;\n    uintptr_t aligned_ptr = align_forward_ptr(current_ptr, alignment);\n    size_t new_offset = (aligned_ptr - (uintptr_t)arena->buffer) + size;\n\n    if (new_offset > arena->capacity) {\n        return NULL; \u002F\u002F Out of memory\n    }\n\n    arena->offset = new_offset;\n    return (void*)aligned_ptr;\n}\n\nvoid arena_reset(MemoryArena* arena) {\n    arena->offset = 0;\n}\n```\n",{"name":5,"description":7},"main","2e465213b972294984c8c9515a47f811e4b358da",".agents\u002Fskills\u002Fmemory-management","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor","https:\u002F\u002Fgithub.com\u002Fraillen","https:\u002F\u002Fraillen.com","\u003C\u003CMarketing & IT>>\r\n\r\n@poppy-team\r\n@wasd-lat ","2026-10-16 09:17:52",{"source":8,"skillName":5,"commands":33,"prompt":43,"zipAvailable":44},[34,37,40],{"tool":35,"command":36},"npx","npx skills add raillen\u002Fdaisy-code-editor --skill memory-management",{"tool":38,"command":39},"bunx","bunx skills add raillen\u002Fdaisy-code-editor --skill memory-management",{"tool":41,"command":42},"pnpm","pnpm dlx skills add raillen\u002Fdaisy-code-editor --skill memory-management","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002FSKILL.md",true,[46,52,58,62,66,72],{"path":47,"resourceType":48,"resourceTypeDesc":49,"sizeBytes":50,"sourceHtmlUrl":51},"checks\u002Fmemory-management-invariants.md","REFERENCE","参考文档",1658,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Fchecks\u002Fmemory-management-invariants.md",{"path":53,"resourceType":54,"resourceTypeDesc":55,"sizeBytes":56,"sourceHtmlUrl":57},"examples\u002Farena_allocator.c","OTHER","其他",4331,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Fexamples\u002Farena_allocator.c",{"path":59,"resourceType":48,"resourceTypeDesc":49,"sizeBytes":60,"sourceHtmlUrl":61},"manifest.json",2210,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Fmanifest.json",{"path":63,"resourceType":48,"resourceTypeDesc":49,"sizeBytes":64,"sourceHtmlUrl":65},"references\u002Fmemory-management-guide.md",2740,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Freferences\u002Fmemory-management-guide.md",{"path":67,"resourceType":68,"resourceTypeDesc":69,"sizeBytes":70,"sourceHtmlUrl":71},"scripts\u002Fverify.sh","SCRIPT","脚本",1472,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Fscripts\u002Fverify.sh",{"path":73,"resourceType":48,"resourceTypeDesc":49,"sizeBytes":74,"sourceHtmlUrl":75},"templates\u002Fmemory-management-template.md",1220,"https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.agents\u002Fskills\u002Fmemory-management\u002Ftemplates\u002Fmemory-management-template.md",[77,83,89,96,103,110],{"skillNo":78,"name":79,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":80,"categories":81,"keywords":82,"publishedAt":19},"01M7EKQYSDAX3SGSCRF873Z8E2","zoom-reflow","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Fzoom-reflow\u002FSKILL.md",[],[],{"skillNo":84,"name":85,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":86,"categories":87,"keywords":88,"publishedAt":19},"01M7EKQX0MWJNQD482GGZPGES4","wireframe-styleguide","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Fwireframe-styleguide\u002FSKILL.md",[],[],{"skillNo":90,"name":91,"nameZh":6,"description":92,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":93,"categories":94,"keywords":95,"publishedAt":19},"01M7EKQS57FS6JYE6KWW6X5ADJ","visual-regression","Pixel-by-pixel snapshot testing, Playwright integration, dynamic content masking, deterministic font rendering, and cross-browser CI gates","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Fvisual-regression\u002FSKILL.md",[],[],{"skillNo":97,"name":98,"nameZh":6,"description":99,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":100,"categories":101,"keywords":102,"publishedAt":19},"01M7EKQMFR7651NVH100P5781Z","ui-implementation","Component-driven UI implementation, multi-state matrix (default, hover, focus-visible, active, disabled, loading, empty, error), DTCG design tokens, responsive layout contracts, and accessibility tree mapping.","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Fui-implementation\u002FSKILL.md",[],[],{"skillNo":104,"name":105,"nameZh":6,"description":106,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":107,"categories":108,"keywords":109,"publishedAt":19},"01M7EKQG3NVX6DPCYS6Q4PA71V","tui-editor-engine","Text buffer and editing semantics for a terminal code editor — index conversion, transaction-first editing, multi-cursor invariants, undo grouping, and large-file behaviour.","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Ftui-editor-engine\u002FSKILL.md",[],[],{"skillNo":111,"name":112,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":113,"categories":114,"keywords":115,"publishedAt":19},"01M7EKQEJ993JGC72FE2KFY3ZZ","tree-sitter-context-indexing","https:\u002F\u002Fgithub.com\u002Fraillen\u002Fdaisy-code-editor\u002Fblob\u002Fmain\u002F.ai\u002Fskills\u002Ftree-sitter-context-indexing\u002FSKILL.md",[],[]]