View source code
Display the source code in std/bitmanip.d from which this
page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a
Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page.
Requires a signed-in GitHub account. This works well for small changes.
If you'd like to make larger changes you may want to consider using
local clone.
Function std.bitmanip.BitArray.bitsSet
Return a lazy range of the indices of set bits.
auto bitsSet();
Example
import std .algorithm .comparison : equal;
auto b1 = BitArray([0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1]);
assert(b1 .bitsSet .equal([4, 5, 6, 7, 12, 13, 14, 15]));
BitArray b2;
b2 .length = 1000;
b2[333] = true;
b2[666] = true;
b2[999] = true;
assert(b2 .bitsSet .equal([333, 666, 999]));
Authors
Walter Bright, Andrei Alexandrescu, Jonathan M Davis, Alex Rønne Petersen, Damian Ziemba, Amaury SECHET
License
Copyright © 1999-2022 by the D Language Foundation | Page generated by ddox.