Robert Nagy
Robert Nagy
@blexrob @jasnell @addaleax @anonrig @lemire C++ experts PTAL
@ShenHongFei Any chance I can get a full repro? It's interesting since both the slow and fast path should behave similarly now. If you don't want to share publicly you...
@ShenHongFei can you try again with your project. I think I might have found the issue.
For future reference: Simple fuzzing: ```js const assert = require('node:assert') const crypto = require('node:crypto') for (let i = 0; i < 1e6; i++) { const len = Math.floor(Math.random() * 128)...
https://ci.nodejs.org/view/Node.js%20benchmark/job/benchmark-node-micro-benchmarks/1626/
@metcoder95
We did it like this: https://github.com/nxtedition/nxt-undici/blob/main/lib/interceptor/dns.js https://github.com/nxtedition/nxt-undici/blob/main/lib/interceptor/lookup.js Where our default lookup function is: ```js function defaultLookup(origin, opts, callback) { callback(null, Array.isArray(origin) ? origin[Math.floor(Math.random() * origin.length)] : origin) } ``` The...
I would prefer to just use regular expressions. Seems like a good balance between performance and maintainability.
WIP https://github.com/nodejs/undici/pull/3408
Sorry, I don't understand. What is the problem?