initial span

@@ -0,0 +8,4 @@
+ * This file provides the basis for processing "indexed bits" (i.e. every bit has an index).
+ * The main purpose of this file is to define how bits are indexed within a memory buffer.
+ * This is necessary, because there are many different ways to do it. For example, is the first bit
+ * the least or most significant bit and how does endianness affect the bit order.

@@ -0,0 +83,4 @@
+class BitRef {
+ private:
+  /** Points to the integer that the bit is in. */
+  const BitInt *data_;

@@ -0,0 +199,4 @@
+
+  /**
+   * Does the same as #set, but does not use a branch. This is faster when the input value is
+   * unpredictable for the CPU branch predictor (worst case is a uniform random distribution with

@@ -0,0 +59,4 @@
+};
+
+/**
+ * Similar to #Span, but references a range of bits instead of normal C++ types (which are at least

@@ -0,0 +204,4 @@
+  }
+
+  /** Sets all referenced bits to 1. */
+  void set()