Written by: Christopher Andrews.
Licence: MIT*
This class provides an efficient and easy to use method of dealing with bits. The library is infact a drop-in replacement for a bool array. However, it has many more uses and is perfect for use on embedded systems or critical systems where performance and efficiency matters.
- Installation
- Basic Usage
- Advanced features
- Iterating a
BitBool - Selectively iterating a range of bits
- Customizing how a
BitBooltreats the data- Controlling the direction of bits and bytes
- Optimization using a look-up table
- Iterating a
- Licence information
You can download this library from within the IDE using the built in library manager. If you need to install this on an older IDE (pre 1.6.2) and need help installing, leave a message on the Arduino forum here for instructions. However if you know how to install a library all you need is BitBool.h & BitBool.cpp inside a folder named BitBool.
Just add BitBool.h and BitBool.cpp to your project.
To create a BitBool object, you simply need to provide how many bits you need. This is done using the template syntax (A number between angle brackets< & >). You can use a count of bits as large as you like.
To read or write the bits, you use the variable just like an array.
//Create a BitBool variable named 'bits'.
BiBool<8> bits;
//Write a bit
bits[0] = true;
//Read a bit
if( bits[1] ){
//Do something if a bit is 1, or true.
}
If you have a pre-existing variable, and you need to access its bits individually, there is now a function available to make this an easy task. Using the methods described below you can either create a copy of existing data, or reference it.
toBitBool( object )
This function accepts a single parameter which is the object you want to turn into aBitBool. Using C++11'sautospecifier, you can easily create a copy, or reference of the data.uint64_t largeNumber = 0xAFEED0FDEADBEEF; //A large hexidecimal number. //Create a new BitBool. This is effectively a copy of the data to use as a BitBool auto bits = toBitBool( largeNumber ); /* Reference the 'largeNumber' variable as a BitBool. Changes to 'ref' will be acutally changing 'largeNumber'. */ auto &ref = toBitBool( largeNumber );
If you have an object which contains a particualr bit you would like to modify easily, and it isn't a BitBool, you can use the method described below to access it easily. This is quite useful for repetitive tasks on the particular bit. If you already have a BitBool scroll down to the second example to see how you can achieve this.
toBitRef( object, bitIndex )
This function does not allow creating a reference type of your own as it is already a reference to existing data. Changing the bit value is by default changing the bit you originally referenced.
char data; //An object containing a bit we would like to access.
auto bit = toBitRef( data, 0 ); //Create a bit reference to the first bit.
bit = 0; //Write to the bit.
//Read the bit.
if( bit ){
//Bit is true or 1
}Note: If you already have a BitBool and would like to reference a single bit, you can use a similar method:
BitBool<8> bits;
auto bit = bits[0];
//Use bit or bits[0] to access the first bit.If you have a BitBool object it is quite easy to traverse its contents using a for loop. However BitBool also supports C++11 ranged-loops. See the example below for C++11 style loops.
BitBool<8> bits;
//To read each bit:
for( auto bit : bits ){
//Act on the contents of 'bit'.
}
//For read/write access, you'll need to use a reference.
for( auto &bit : bits ){
//Act on the contents of 'bit'.
}Similar to simple iteration of a BitBool this feature allows traversing a discrete range of bits using a ranged for loop in C++11. The BitBool object provides a function named iterate() which has a few different overloads.
iterate()
This version is equivalent to the methoed described in the previous section. It is provided simply for completeness.iterate( start )
This method takes a starting index. It will allow you to traverse theBitBoolfrom a specific offset finishing at the last bit.iterate( start, count )
This version allows selectively choosing a discrete range within aBitBool. The first parameter is the index to start traversing from, and the second is how many bits to traverse in total.
BitBool<8> bits;
//Traverse the last four bits.
for( auto bit : bits.iterate( 4 ) ){
//Will iterate bits 4, 5, 6, 7
}
//Traverse the four middle bits.
for( auto bit : bits.iterate( 2, 4 ) ){
//Will iterate bits 2, 3, 4, 5
}This product is provided under MIT licence and the only requirement I impose is to link to the original source here on GitHub and ensure my name is clearly noted as the Author.
https://github.com/Chris--A/BitBool/
The MIT License (MIT) Copyright (c) 2012-2016 Christopher Andrews
https://github.com/Chris--A/BitBool/
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.