Mirror of forum.nim-lang.org

13791 :: BitNest - naming the bits of your integers

• icedquinn (orginal) [2026-03-15T00:39:44+01:00] view original

  I decided I didn't like calculating masks and offsets anymore. You can come along too.

  https://codeberg.org/IcedQuinn/bitnest

---

• Araq (orginal) [2026-03-15T12:18:58+01:00] view original

  The generated accessors should have the .inline directive or else you better use LTO.

---

• nitro (orginal) [2026-03-15T15:11:18+01:00] view original

  A simple solution I use when I don't need named bits is to just make small helper functions for std/bitops so you can access bits like an array. Thoughts?

  
  var v = 0
  v[2 .. 6] = 0b10101
  
  assert v == 0b0101_0100
  
  assert v[2] == true
  
  assert 0b1010[0 .. 2] == 0b010
  Run

---

• icedquinn (orginal) [2026-03-16T15:10:06+01:00] view original

  sure, patched.

---

• icedquinn (orginal) [2026-03-16T15:41:33+01:00] view original

  if there is one and only one place you are doing that particular thing, it's probably fine. it is very easy for "we do this just once" to become "i copy and pasted it in six places" and now its a maintenance hazard.

---