Learn to use bitwise operators to pack multiple states into a single byte, reducing memory bandwidth use.

Working with Bits

Replace slow logical operators with fast bitwise arithmetic. Learn how to filter data without branching, avoiding pipeline flushes and speeding up queries.

Fast Filtering and Branchless Logic

Trade CPU cycles for memory bandwidth by compressing data using bit packing, quantization, and delta encoding.

Quantization and Delta Encoding

Use bloom filters for fast rejection, hierarchical bitmasks for spatial skipping, and hardware intrinsics using C++20's `<bit>` library.

Advanced Bitwise Techniques

TODO Iterators, Ranges, and Views

Learn advanced bit-centric techniques including fast filtering, bit packing, and compression to maximize efficiency.

If you're completely new to programming or want a thorough introduction, we recommend starting with our introductory course:

New to Programming?

The Hardware Reality & Memory Model

Branchless Programming in C++

Branch predictor

Optimize C++ conditional logic using Boolean Algebra. We demonstrate why bitwise AND (&) is often faster than logical AND (&&) for random data due to branch misprediction, and apply this to our Entity System.

Fast Filtering and Branchless Logic

Understanding the Basics

Practical Applications

Common Mistakes

Next Steps

Additional Resources

Assessment Preparation

Working with Bits