Volodymyr Agafonkin
Volodymyr Agafonkin
Still get the warning with Beefy 2 #40: ``` 200 2ms 20.78KB /debug/img/[email protected] (node) warning: possible EventEmitter memory leak detected. 11 listeners added. Use emitter.setMaxListeners() to increase limit. Trace at...
To illustrate what I would want to achieve: ``` js var points = [[10, 10], [25, 7], [15, 12], [12, 16], ...]; var xValues = points.map(p => p[0]); // [10,...
@rreusser nope, so far I've been using a custom quicksort for that which swaps elements in multiple typed arrays in parallel. It's usually fast enough. Here's a recent example https://github.com/mourner/flatbush/blob/master/index.js#L199
@rreusser this looks great! I also recommend looking into Hilbert curves ([fast 3D algorithm here](http://threadlocalmutex.com/?p=149)) — they may be slower to calculate, but are much better suited for bottom-up packing...
Skimming through the code, I also recommend: - Using flat arrays for points — e.g. `[x, y, x, y, ...` instead of `[[x, y], [x, y], ...`. - Avoiding array...
Sorry, completely missed that issue. The fastest was a simple array-based (BSArray).
I'm not sure if there's a way around this. Can we modify the CSP dynamically in the bookmarklet, or would that be a bad thing to do security-wise?
Interesting! Might be an issue on https://github.com/padolsey/findAndReplaceDOMText side but worth investigating.
The most simple approach I guess would be to separate the list into sure-fire bullshit and everything else, and only mark words from the second list if a particular threshold...