[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M73C2PTS2PVHEJB7R5SN72G0":3,"skill-same:01M73C2PTS2PVHEJB7R5SN72G0":47},{"skillNo":4,"name":5,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":28,"ownerHtmlUrl":29,"ownerBlogUrl":30,"ownerDescription":31,"updatedAt":32,"install":33,"resources":46},"01M73C2PTS2PVHEJB7R5SN72G0","high-perf-data-algorithms",null,"Horonomos-laps\u002FYana-AI","Horonomos-laps","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F355299122?v=4","01M76B3QPXE88ET2SQPDPVATZT"," Horonomos-laps","01M72ZQRJPCYPSSWT4D00VJR2A",13,"Apache-2.0","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fhigh-perf-data-algorithms\u002FSKILL.md",[],[],"2026-11-11 15:11:14",false,"---\nname: high-perf-data-algorithms\ndescription: High-performance data processing patterns from 5 repos. O(n log n) array algorithms, lazy evaluation chains, statistical computation on raw data, streaming JSON parsing for large files, and concurrent async queue management. Sources: d3\u002Fd3-array, lodash\u002Flodash, simple-statistics\u002Fsimple-statistics, vitorperes\u002Fjson-stream, sindresorhus\u002Fp-queue.\norigin: yana-ai — synthesized from d3\u002Fd3-array, lodash\u002Flodash, simple-statistics\u002Fsimple-statistics, vitorperes\u002Fjson-stream (jsonstream), sindresorhus\u002Fp-queue\nlicense: Apache-2.0\nversion: 1.0.0\ncompatibility: yana-ai >= 1.3.38\n---\n\n# \u002Fhigh-perf-data-algorithms\n\n## When to Use\n\n- Processing arrays of 100k+ items (sort, bin, group, roll-up)\n- Chaining multiple transforms without intermediate array allocations\n- Computing statistics (mean, stddev, regression) without a heavy lib\n- Parsing JSON files > 100MB without loading them into RAM\n- Throttling concurrent API calls \u002F DB queries to avoid overload\n\n## Do NOT use for\n\n- Arrays \u003C 1000 items (readability > optimization)\n- Streaming non-JSON formats (use line-reader or csv-parse instead)\n\n---\n\n## Array Algorithms (d3-array)\n\n```javascript\nimport { bin, rollup, group, extent, bisectLeft, sort } from 'd3-array'\n\n\u002F\u002F Histogram binning — O(n) after sort\nconst bins = bin()\n  .value(d => d.score)\n  .thresholds(20)\n  (data)\n\n\u002F\u002F Rollup: group + aggregate in one pass — O(n)\nconst byRegion = rollup(\n  sales,\n  rows => rows.reduce((s, r) => s + r.revenue, 0),\n  d => d.region,\n  d => d.quarter,\n)\n\u002F\u002F → Map { 'APAC' → Map { 'Q1' → 4200000, ... } }\n\n\u002F\u002F Binary search in sorted array — O(log n)\nconst idx = bisectLeft(sortedScores, targetScore)\n```\n\n---\n\n## Lazy Evaluation Chain (lodash)\n\n```javascript\nimport _ from 'lodash'\n\n\u002F\u002F Eager (bad for large arrays — 3 full passes):\nconst result = data.filter(isActive).map(toSummary).slice(0, 100)\n\n\u002F\u002F Lazy chain (good — stops after collecting 100 results):\nconst result = _(data)\n  .filter(isActive)    \u002F\u002F deferred\n  .map(toSummary)      \u002F\u002F deferred\n  .take(100)           \u002F\u002F triggers execution, exits early\n  .value()\n\n\u002F\u002F Rule: lazy chain pays off at > 200 items; under that, native array is faster\n\u002F\u002F Rule: never call .value() inside a loop — exit the chain first\n```\n\n---\n\n## Statistics on Raw Data (simple-statistics)\n\n```javascript\nimport {\n  mean, median, standardDeviation,\n  linearRegression, linearRegressionLine,\n  quantile, interquartileRange,\n} from 'simple-statistics'\n\nconst values = [12, 45, 67, 23, 89, 34, 56]\n\n\u002F\u002F Descriptive — all O(n) except median which sorts O(n log n)\nconsole.log(mean(values))               \u002F\u002F 46.57\nconsole.log(standardDeviation(values))  \u002F\u002F 27.3\nconsole.log(quantile(values, 0.75))     \u002F\u002F 75th percentile (P75)\nconsole.log(interquartileRange(values)) \u002F\u002F IQR = P75 - P25\n\n\u002F\u002F Linear regression — O(n)\nconst pairs = values.map((y, x) => [x, y])\nconst { m, b } = linearRegression(pairs)\nconst predict = linearRegressionLine({ m, b })\npredict(10)  \u002F\u002F extrapolate at x=10\n```\n\n---\n\n## Streaming JSON Parser (JSONStream)\n\n```javascript\nimport JSONStream from 'JSONStream'\nimport fs from 'fs'\n\n\u002F\u002F Parse 1GB JSON file in 512MB RAM — never loads full file\n\u002F\u002F File: { \"users\": [ {...}, {...}, ... ] }\nfs.createReadStream('data\u002Fusers-1gb.json')\n  .pipe(JSONStream.parse('users.*'))   \u002F\u002F stream each user object\n  .on('data', user => {\n    processUser(user)                  \u002F\u002F handle one at a time\n  })\n  .on('end', () => console.log('done'))\n\n\u002F\u002F For newline-delimited JSON (NDJSON): parse each line separately\nfs.createReadStream('events.ndjson')\n  .pipe(JSONStream.parse())\n  .on('data', event => queue.add(() => ingest(event)))\n```\n\n---\n\n## Concurrent Async Queue (p-queue)\n\n```javascript\nimport PQueue from 'p-queue'\n\n\u002F\u002F Hard limit: never exceed 5 concurrent API calls\nconst queue = new PQueue({ concurrency: 5 })\n\n\u002F\u002F Throttled rate limit: 10 calls per second\nconst rateLimited = new PQueue({ concurrency: 10, intervalCap: 10, interval: 1000 })\n\n\u002F\u002F Batch 10k items without spawning 10k promises at once\nconst results = await Promise.all(\n  records.map(rec => queue.add(() => fetchEnrichedData(rec)))\n)\n\n\u002F\u002F Priority queue — urgent tasks jump the line\nawait queue.add(() => criticalSync(), { priority: 10 })\nawait queue.add(() => backgroundBackfill(), { priority: 1 })\n\n\u002F\u002F Monitor queue health\nqueue.on('active', () => console.log(`Queue size: ${queue.size}, pending: ${queue.pending}`))\n```\n\n---\n\n## Complexity Quick Reference\n\n```\nd3 bin()            O(n log n)  — sorts before binning\nd3 rollup()         O(n)        — single pass\nd3 bisectLeft()     O(log n)    — binary search (array must be sorted)\nlodash lazy chain   O(n\u002Fk)      — early exit after take(k)\nsimple-statistics   O(n)        — most; median O(n log n)\nJSONStream parse    O(1) space  — streaming, no full parse\np-queue add()       O(1)        — constant enqueue\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ Calling .value() inside a .map() callback (cancels lazy eval)\n❌ JSONStream on NDJSON using 'users.*' path (wrong parser for flat streams)\n❌ p-queue without concurrency cap (default = Infinity = thundering herd)\n❌ mean() on unsorted data expecting sorted output (it's unordered)\n❌ Rolling statistics inside a nested loop instead of single-pass rollup\n❌ Binary search (bisectLeft) on unsorted array (silently wrong result)\n```\n","# \u002Fhigh-perf-data-algorithms\n\n## When to Use\n\n- Processing arrays of 100k+ items (sort, bin, group, roll-up)\n- Chaining multiple transforms without intermediate array allocations\n- Computing statistics (mean, stddev, regression) without a heavy lib\n- Parsing JSON files > 100MB without loading them into RAM\n- Throttling concurrent API calls \u002F DB queries to avoid overload\n\n## Do NOT use for\n\n- Arrays \u003C 1000 items (readability > optimization)\n- Streaming non-JSON formats (use line-reader or csv-parse instead)\n\n---\n\n## Array Algorithms (d3-array)\n\n```javascript\nimport { bin, rollup, group, extent, bisectLeft, sort } from 'd3-array'\n\n\u002F\u002F Histogram binning — O(n) after sort\nconst bins = bin()\n  .value(d => d.score)\n  .thresholds(20)\n  (data)\n\n\u002F\u002F Rollup: group + aggregate in one pass — O(n)\nconst byRegion = rollup(\n  sales,\n  rows => rows.reduce((s, r) => s + r.revenue, 0),\n  d => d.region,\n  d => d.quarter,\n)\n\u002F\u002F → Map { 'APAC' → Map { 'Q1' → 4200000, ... } }\n\n\u002F\u002F Binary search in sorted array — O(log n)\nconst idx = bisectLeft(sortedScores, targetScore)\n```\n\n---\n\n## Lazy Evaluation Chain (lodash)\n\n```javascript\nimport _ from 'lodash'\n\n\u002F\u002F Eager (bad for large arrays — 3 full passes):\nconst result = data.filter(isActive).map(toSummary).slice(0, 100)\n\n\u002F\u002F Lazy chain (good — stops after collecting 100 results):\nconst result = _(data)\n  .filter(isActive)    \u002F\u002F deferred\n  .map(toSummary)      \u002F\u002F deferred\n  .take(100)           \u002F\u002F triggers execution, exits early\n  .value()\n\n\u002F\u002F Rule: lazy chain pays off at > 200 items; under that, native array is faster\n\u002F\u002F Rule: never call .value() inside a loop — exit the chain first\n```\n\n---\n\n## Statistics on Raw Data (simple-statistics)\n\n```javascript\nimport {\n  mean, median, standardDeviation,\n  linearRegression, linearRegressionLine,\n  quantile, interquartileRange,\n} from 'simple-statistics'\n\nconst values = [12, 45, 67, 23, 89, 34, 56]\n\n\u002F\u002F Descriptive — all O(n) except median which sorts O(n log n)\nconsole.log(mean(values))               \u002F\u002F 46.57\nconsole.log(standardDeviation(values))  \u002F\u002F 27.3\nconsole.log(quantile(values, 0.75))     \u002F\u002F 75th percentile (P75)\nconsole.log(interquartileRange(values)) \u002F\u002F IQR = P75 - P25\n\n\u002F\u002F Linear regression — O(n)\nconst pairs = values.map((y, x) => [x, y])\nconst { m, b } = linearRegression(pairs)\nconst predict = linearRegressionLine({ m, b })\npredict(10)  \u002F\u002F extrapolate at x=10\n```\n\n---\n\n## Streaming JSON Parser (JSONStream)\n\n```javascript\nimport JSONStream from 'JSONStream'\nimport fs from 'fs'\n\n\u002F\u002F Parse 1GB JSON file in 512MB RAM — never loads full file\n\u002F\u002F File: { \"users\": [ {...}, {...}, ... ] }\nfs.createReadStream('data\u002Fusers-1gb.json')\n  .pipe(JSONStream.parse('users.*'))   \u002F\u002F stream each user object\n  .on('data', user => {\n    processUser(user)                  \u002F\u002F handle one at a time\n  })\n  .on('end', () => console.log('done'))\n\n\u002F\u002F For newline-delimited JSON (NDJSON): parse each line separately\nfs.createReadStream('events.ndjson')\n  .pipe(JSONStream.parse())\n  .on('data', event => queue.add(() => ingest(event)))\n```\n\n---\n\n## Concurrent Async Queue (p-queue)\n\n```javascript\nimport PQueue from 'p-queue'\n\n\u002F\u002F Hard limit: never exceed 5 concurrent API calls\nconst queue = new PQueue({ concurrency: 5 })\n\n\u002F\u002F Throttled rate limit: 10 calls per second\nconst rateLimited = new PQueue({ concurrency: 10, intervalCap: 10, interval: 1000 })\n\n\u002F\u002F Batch 10k items without spawning 10k promises at once\nconst results = await Promise.all(\n  records.map(rec => queue.add(() => fetchEnrichedData(rec)))\n)\n\n\u002F\u002F Priority queue — urgent tasks jump the line\nawait queue.add(() => criticalSync(), { priority: 10 })\nawait queue.add(() => backgroundBackfill(), { priority: 1 })\n\n\u002F\u002F Monitor queue health\nqueue.on('active', () => console.log(`Queue size: ${queue.size}, pending: ${queue.pending}`))\n```\n\n---\n\n## Complexity Quick Reference\n\n```\nd3 bin()            O(n log n)  — sorts before binning\nd3 rollup()         O(n)        — single pass\nd3 bisectLeft()     O(log n)    — binary search (array must be sorted)\nlodash lazy chain   O(n\u002Fk)      — early exit after take(k)\nsimple-statistics   O(n)        — most; median O(n log n)\nJSONStream parse    O(1) space  — streaming, no full parse\np-queue add()       O(1)        — constant enqueue\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ Calling .value() inside a .map() callback (cancels lazy eval)\n❌ JSONStream on NDJSON using 'users.*' path (wrong parser for flat streams)\n❌ p-queue without concurrency cap (default = Infinity = thundering herd)\n❌ mean() on unsorted data expecting sorted output (it's unordered)\n❌ Rolling statistics inside a nested loop instead of single-pass rollup\n❌ Binary search (bisectLeft) on unsorted array (silently wrong result)\n```\n",{},"main","481dcd7dd2e288b9d627a2bd017db70e64e6c6fa","core\u002Fskills\u002Fhigh-perf-data-algorithms",2,"https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI","https:\u002F\u002Fyana.vutam.link\u002F","https:\u002F\u002Fgithub.com\u002FHoronomos-laps","https:\u002F\u002Fyana.vutam.link","An open-source governed runtime & execution environment for multi-agent AI systems.","2026-11-14 13:24:09",{"source":7,"skillName":5,"commands":34,"prompt":44,"zipAvailable":45},[35,38,41],{"tool":36,"command":37},"npx","npx skills add Horonomos-laps\u002FYana-AI --skill high-perf-data-algorithms",{"tool":39,"command":40},"bunx","bunx skills add Horonomos-laps\u002FYana-AI --skill high-perf-data-algorithms",{"tool":42,"command":43},"pnpm","pnpm dlx skills add Horonomos-laps\u002FYana-AI --skill high-perf-data-algorithms","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fhigh-perf-data-algorithms\u002FSKILL.md",true,[],[48,56,63,71,79,87],{"skillNo":49,"name":50,"nameZh":6,"description":51,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":52,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":18},"01M735GKET5YVYKAY62W2P5YXB","openai--sentry--sentry","Use when the user asks to inspect Sentry issues or events, summarize recent production errors, or pull basic Sentry health data via the Sentry API; perform read-only queries with the bundled script and require `SENTRY_AUTH_TOKEN`.","MIT","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fopenai--sentry--sentry\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":18},"01M73DCAP83T17HY7SMGK7MGFE","ito-basket-compare","Compare Itô prediction-market baskets against a user's knowledge base, portfolio notes, financial context, watchlist, or research thesis. Use for read-only basket comparison and gap analysis without investment advice or live trading.","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fito-basket-compare\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":67,"sourceHtmlUrl":68,"categories":69,"keywords":70,"publishedAt":18},"01M734CYEMZFDR3KH6SW0JP8TD","implementing-network-traffic-baselining","Build network traffic baselines from NetFlow\u002FIPFIX data using Python pandas for statistical analysis, z-score anomaly detection, and hourly\u002Fdaily traffic pattern profiling","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FSKILL.md",[],[],{"skillNo":72,"name":73,"nameZh":6,"description":74,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":75,"sourceHtmlUrl":76,"categories":77,"keywords":78,"publishedAt":18},"01M73ASZ6NJRJM44Z2P84NGQ3Q","detecting-evasion-techniques-in-endpoint-logs","Detects defense evasion techniques used by adversaries in endpoint logs including log tampering, timestomping, process injection, and security tool disabling. Use when investigating suspicious endpoint behavior, building detection rules for evasion tactics, or conducting threat hunting for stealthy adversary activity. Activates for requests involving evasion detection, defense evasion analysis, log tampering detection, or MITRE ATT&CK TA0005.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FSKILL.md",[],[],{"skillNo":80,"name":81,"nameZh":6,"description":82,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":83,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M734AFNXD06Z78QRK0VKGT7Q","implementing-microsegmentation-with-guardicore","Implementing microsegmentation using Akamai Guardicore Segmentation to map application dependencies, create granular network policies, visualize east-west traffic flows, and enforce least-privilege communication between workloads across data centers and cloud.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":90,"categories":91,"keywords":92,"publishedAt":18},"01M736TK27QMCXK0DVCH25SJN5","ramdisk-tmpfs-patterns","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Framdisk-tmpfs-patterns\u002FSKILL.md",[],[]]