banner
lexboere.bsky.social
@lexboere.bsky.social
🏢 🛗 ⚙️ Digital architect 🧠 Holistic troubleshooter
⏱️ Systems Performance 🕺 Ecstatic about simplicity
💭 Still clueless how to box thoughts ☕ Prefers Java over coffee
You obviously did not configure the partitions correctly. For an unknown distro, I usually first 'proofrun' auto install, carefully write down how it did the partitioning and then do a manual install, to make it fit my own preferences.
September 4, 2025 at 11:46 PM
www.congress.gov
July 9, 2025 at 5:29 PM
The above posting I made 5 month ago. now read this: SEC. 17. Duties on countries that purchase Russian-origin oil, uranium, and petroleum products. ... .. increase the rate of duty for all goods or services imported ....to a rate of not less than the equivalent of 500 percent ad valorem.
July 9, 2025 at 5:28 PM
The ministry of truth.
March 8, 2025 at 7:24 PM
Did it come with their famous key?
January 13, 2025 at 9:55 AM
The amount of text or comments is easily adjusted in your prompt. But the code quality tends to get worse, whatever you add to the prompt.
December 12, 2024 at 1:33 AM
Try sudo ntfs-3g -o remove_hiberfile /dev/<your device name> /mnt
November 17, 2024 at 8:33 PM
Easiest is to boot from a live USB linux version and run gparted or kde partition manager to just remove the NTFS partition (at least, if this doesn't contain useful data...)
November 17, 2024 at 8:06 PM
The screen reports the last Windows session on the NTFS drive was not finished. This happens after shutdown. It is prevented by using restart and powering down as soon as Windows restarts.
November 17, 2024 at 8:29 PM
For L1 and L2 cache, avoid walking large collections exceeding typical cache sizes. Also be aware that thread switching in generally leads to restocking the caches, a single thread dedicated to local data may outperform multiple threads. Also mind the effect of warmup (C1 and C2 compilation).
November 17, 2024 at 8:29 PM
Using performance measurement with JMH is the way to go (also to see if any change is relevant), but mind that results may depend heavily on the platform. With respect to 'aligned in heap data structures', mind that in the latest Java release the object overhead will be greatly reduced.
November 17, 2024 at 8:29 PM
For so little data linear scan is definitely faster. If there are never more than 64 elements, you could however use bit logic instead, e.g. use a long[] with the long elements having a bit per piece, instead of a Map.
November 17, 2024 at 8:29 PM
Depending on the data, adding a Map<Color,List<Piece>> might be a lot faster (and take some more heap space).
November 17, 2024 at 8:29 PM