Safe Bitfields in C++
In my cpp11-on-multicore project on GitHub, there’s a class that packs three 10-bit values into a 32-bit integer. I could have implemented it using traditional bitfields… struct Status { uint32_t readers : 10; uint32_t waitToRead : 10; uint32_t writers : 10; }; Or with some bit twiddling… uint32_t status = readers | (waitToRead << 10) | (writers << 20); Instead, I did what any overzealous C++ prog
How to Generate a Sequence of Unique Random Integers
Suppose we wish to generate a sequence of 10000000 random 32-bit integers with no repeats. How can we do it? I faced this problem recently, and considered several options before finally implementing a custom, non-repeating pseudo-random number generator which runs in O(1) time, requires just 8 bytes of storage, and has pretty good distribution. I thought I’d share the details here. Approaches Cons
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
