>Is it really that difficult? Fiberglass handles are now standard on splitting mauls (for this reason). Rotten hearts, or driving wedges. It is easy to miss a swing by an inch or two when fatigued. Edit: I also broke my…
[flagged]
_Daily_ hit pieces on Elon Musk (or Musk companies), going for something like a decade. These have petered out somewhat since he left DOGE. But they started way back before he should have had that much notoriety.
MS makes "Times New Roman" available (at no cost), but not "Calibri".
`_mm_alignr_epi8` is a compile-time known shuffle that gets optimized well by LLVM [1]. If you need the exact behavior of `pshufb` you can use asm or the llvm intrinsic [2]. iirc, I once got the compiler to emit a…
> health services in the area Massena Hospital is a 25-bed hospital. Might have to go to Canton or Ogdensburg for a family doctor (45 minutes by car). Most things serious get referred to Syracuse or Burlington (3 hours…
Alcoa (Aluminum Smelter, *cheap electricity*) was the major industry in the area. Massena plant now produces 85% less aluminum compared to ~15 years ago (AFAICT), leading to something of a ghost town (and cheap housing).
Limited internet connections (speed and/or data-caps). Something like Hughesnet (satellite ISP) couldn't stream more than 240p from youtube during peek times. The data-cap coerced users to do downloads between 2am to…
> “regular” rejection sampling I was thinking naive: mask off unwanted bits then reject any value above the limit. It would seem like https://c-faq.com/lib/randrange.html would also move the multiply --or divide by…
A optimized version would use 64-bit accumulators (`psadbw` on SSE2, or some sort of horizontal adds on NEON). The `255` max constraint is pointless. Many programming languages/frameworks expose this operation as…
Why not use regular rejection sampling when `limit` is known at compile-time. Does fastrange[1] have fewer rejections due to any excess random bits[2]? [1] https://github.com/lemire/fastrange [2]…
That snippet would not reject bad chars, are non-digits rejected somewhere else? A simple scalar loop that multiplies an accumulator by 10, itoa() style, would be faster.
The methods in those articles could be slightly improved by picking better multipliers. https://stackoverflow.com/a/71594769
There are two digits for months. A check is required per-character to prevent bad chars (e.g 0x3A) from being laundered by the multiply. The '19' comes from fact that the first digit may be only 0 or 1, while the 2nd…
This was for a super optimizer.
One of the authors/contributors was looking into it: https://old.reddit.com/r/mainframe/comments/wevyvg/whats_the... I don't think this project was ready for a public announcement, yet.
The AVX2 version is using a 8 KiB table...? Even the range check is inefficient. I'd bet that the AVX2 version could be 50% faster.
related to IEEE 754 double-precision floating-point round-trips?
Any fine shows Walmart as liable. A free win for any $100mm civil lawsuit.
https://media.ccc.de/v/35c3-9788-memsad
www.central-boiler.co.uk ?
Outdoor wood furnaces (boilers) became very popular over the last 15 years. They are cheaper than fuel oil. A traditional wood stove has to be refilled every 2 hours (or so), and is also a major fire hazard. "Wood…
The algorithm used by ClickHouse was "inspired" by https://github.com/cyb70289/utf8/ ... Which is known to be slower than this new method from simdjson.
here you go: https://github.com/expr-fi/fastlwc "Beating wc with C"
how does this differ from here: https://github.com/lemire/simdjson/pull/365
>Is it really that difficult? Fiberglass handles are now standard on splitting mauls (for this reason). Rotten hearts, or driving wedges. It is easy to miss a swing by an inch or two when fatigued. Edit: I also broke my…
[flagged]
_Daily_ hit pieces on Elon Musk (or Musk companies), going for something like a decade. These have petered out somewhat since he left DOGE. But they started way back before he should have had that much notoriety.
MS makes "Times New Roman" available (at no cost), but not "Calibri".
`_mm_alignr_epi8` is a compile-time known shuffle that gets optimized well by LLVM [1]. If you need the exact behavior of `pshufb` you can use asm or the llvm intrinsic [2]. iirc, I once got the compiler to emit a…
> health services in the area Massena Hospital is a 25-bed hospital. Might have to go to Canton or Ogdensburg for a family doctor (45 minutes by car). Most things serious get referred to Syracuse or Burlington (3 hours…
Alcoa (Aluminum Smelter, *cheap electricity*) was the major industry in the area. Massena plant now produces 85% less aluminum compared to ~15 years ago (AFAICT), leading to something of a ghost town (and cheap housing).
Limited internet connections (speed and/or data-caps). Something like Hughesnet (satellite ISP) couldn't stream more than 240p from youtube during peek times. The data-cap coerced users to do downloads between 2am to…
> “regular” rejection sampling I was thinking naive: mask off unwanted bits then reject any value above the limit. It would seem like https://c-faq.com/lib/randrange.html would also move the multiply --or divide by…
A optimized version would use 64-bit accumulators (`psadbw` on SSE2, or some sort of horizontal adds on NEON). The `255` max constraint is pointless. Many programming languages/frameworks expose this operation as…
Why not use regular rejection sampling when `limit` is known at compile-time. Does fastrange[1] have fewer rejections due to any excess random bits[2]? [1] https://github.com/lemire/fastrange [2]…
That snippet would not reject bad chars, are non-digits rejected somewhere else? A simple scalar loop that multiplies an accumulator by 10, itoa() style, would be faster.
The methods in those articles could be slightly improved by picking better multipliers. https://stackoverflow.com/a/71594769
There are two digits for months. A check is required per-character to prevent bad chars (e.g 0x3A) from being laundered by the multiply. The '19' comes from fact that the first digit may be only 0 or 1, while the 2nd…
This was for a super optimizer.
One of the authors/contributors was looking into it: https://old.reddit.com/r/mainframe/comments/wevyvg/whats_the... I don't think this project was ready for a public announcement, yet.
The AVX2 version is using a 8 KiB table...? Even the range check is inefficient. I'd bet that the AVX2 version could be 50% faster.
related to IEEE 754 double-precision floating-point round-trips?
Any fine shows Walmart as liable. A free win for any $100mm civil lawsuit.
https://media.ccc.de/v/35c3-9788-memsad
www.central-boiler.co.uk ?
Outdoor wood furnaces (boilers) became very popular over the last 15 years. They are cheaper than fuel oil. A traditional wood stove has to be refilled every 2 hours (or so), and is also a major fire hazard. "Wood…
The algorithm used by ClickHouse was "inspired" by https://github.com/cyb70289/utf8/ ... Which is known to be slower than this new method from simdjson.
here you go: https://github.com/expr-fi/fastlwc "Beating wc with C"
how does this differ from here: https://github.com/lemire/simdjson/pull/365