From 814fccf1f4587fd18014740028a0b0534d7c8a76 Mon Sep 17 00:00:00 2001
From: nessan <nessan.fitzmaurice@me.com>
Date: Mon, 29 Jul 2024 11:04:36 +0100
Subject: [PATCH] Built site for gh-pages

---
 .nojekyll                                     |    2 +-
 content/faq/index.html                        |    8 +-
 content/gauss/access.html                     |   10 +-
 content/gauss/constructors.html               |   10 +-
 content/gauss/functor.html                    |   10 +-
 content/gauss/index.html                      |   10 +-
 content/gauss/queries.html                    |   10 +-
 content/gauss/solve.html                      |    8 +-
 content/index.html                            |   10 +-
 content/lu/access.html                        |   10 +-
 content/lu/constructors.html                  |   10 +-
 content/lu/functor.html                       |   10 +-
 content/lu/index.html                         |   10 +-
 content/lu/invert.html                        |   10 +-
 content/lu/permute.html                       |   10 +-
 content/lu/queries.html                       |   10 +-
 content/matrix/access.html                    |   14 +-
 content/matrix/add-pop.html                   |   10 +-
 content/matrix/all.html                       |   12 +-
 content/matrix/append.html                    |   10 +-
 content/matrix/capacity.html                  |   10 +-
 content/matrix/characteristic_polynomial.html |   12 +-
 content/matrix/clear.html                     |   10 +-
 content/matrix/companion.html                 |   10 +-
 content/matrix/constructors.html              |   10 +-
 content/matrix/count.html                     |   10 +-
 content/matrix/description.html               |   10 +-
 content/matrix/dot.html                       |   12 +-
 content/matrix/echelon.html                   |   10 +-
 content/matrix/from.html                      |   10 +-
 content/matrix/index.html                     |   20 +-
 content/matrix/invert.html                    |   12 +-
 content/matrix/is_special.html                |   10 +-
 content/matrix/logical-op-eq.html             |   12 +-
 content/matrix/logical-op.html                |   12 +-
 content/matrix/pow.html                       |   12 +-
 content/matrix/print.html                     |   10 +-
 content/matrix/probability.html               |   10 +-
 content/matrix/random.html                    |   10 +-
 content/matrix/replace.html                   |   12 +-
 content/matrix/resize.html                    |   10 +-
 content/matrix/set.html                       |   10 +-
 content/matrix/set_if.html                    |   10 +-
 content/matrix/shift.html                     |   10 +-
 content/matrix/shrink_to_fit.html             |   10 +-
 content/matrix/size.html                      |   10 +-
 content/matrix/specials.html                  |   10 +-
 content/matrix/stream.html                    |   10 +-
 content/matrix/sub.html                       |   12 +-
 content/matrix/swap.html                      |   12 +-
 content/matrix/to_string.html                 |   10 +-
 content/matrix/to_vector.html                 |   10 +-
 content/matrix/transpose.html                 |   10 +-
 content/matrix/triangle.html                  |   10 +-
 content/notes/danilevsky.html                 |   10 +-
 content/notes/design.html                     |   33 +-
 content/notes/gf2.html                        |   12 +-
 content/notes/index.html                      |   10 +-
 content/notes/reduction.html                  |   14 +-
 content/polynomial/access.html                |   14 +-
 content/polynomial/arithmetic.html            |   10 +-
 content/polynomial/constructors.html          |   10 +-
 content/polynomial/count.html                 |   10 +-
 content/polynomial/degree.html                |   10 +-
 content/polynomial/evaluation.html            |   12 +-
 content/polynomial/formatter.html             |   10 +-
 content/polynomial/index.html                 |   20 +-
 content/polynomial/monic.html                 |   10 +-
 content/polynomial/power.html                 |   10 +-
 content/polynomial/random.html                |   10 +-
 content/polynomial/reduce.html                |   10 +-
 content/polynomial/reference.html             |   10 +-
 content/polynomial/shrink_to_fit.html         |   10 +-
 content/polynomial/size.html                  |   10 +-
 content/polynomial/special.html               |   10 +-
 content/polynomial/split.html                 |   10 +-
 content/polynomial/squared.html               |   10 +-
 content/polynomial/stream.html                |   10 +-
 content/polynomial/sub.html                   |   10 +-
 content/polynomial/times_x.html               |   10 +-
 content/polynomial/to_string.html             |   10 +-
 content/vector/access.html                    |   14 +-
 content/vector/all.html                       |   12 +-
 content/vector/append.html                    |   10 +-
 content/vector/blocks.html                    |   10 +-
 content/vector/capacity.html                  |   10 +-
 content/vector/clear.html                     |   10 +-
 content/vector/constructors.html              |   10 +-
 content/vector/convolution.html               |   10 +-
 content/vector/copy.html                      |   10 +-
 content/vector/count.html                     |   10 +-
 content/vector/description.html               |   10 +-
 content/vector/diff.html                      |   12 +-
 content/vector/dot.html                       |   12 +-
 content/vector/first_set.html                 |   10 +-
 content/vector/formatter.html                 |   10 +-
 content/vector/from.html                      |   10 +-
 content/vector/if_set_call.html               |   10 +-
 content/vector/index.html                     |   26 +-
 content/vector/indices.html                   |   10 +-
 content/vector/join.html                      |   10 +-
 content/vector/logical-op-eq.html             |   12 +-
 content/vector/logical-op.html                |   12 +-
 content/vector/polynomial_mod.html            |   10 +-
 content/vector/push-pop.html                  |   10 +-
 content/vector/random.html                    |   10 +-
 content/vector/reference.html                 |   10 +-
 content/vector/replace.html                   |   12 +-
 content/vector/reserve.html                   |   10 +-
 content/vector/resize.html                    |   10 +-
 content/vector/riffled.html                   |   10 +-
 content/vector/set.html                       |   12 +-
 content/vector/set_if.html                    |   10 +-
 content/vector/shift.html                     |   10 +-
 content/vector/size.html                      |   10 +-
 content/vector/specials.html                  |   10 +-
 content/vector/stream.html                    |   10 +-
 content/vector/sub.html                       |   12 +-
 content/vector/swap.html                      |   10 +-
 content/vector/swap_elements.html             |   12 +-
 content/vector/to_string.html                 |   10 +-
 content/vector/trimmed.html                   |   10 +-
 content/vector/unit_floor.html                |   10 +-
 content/verify/index.html                     | 1131 +++++++++++++++++
 index.html                                    |   10 +-
 search.json                                   |  108 +-
 sitemap.xml                                   |   58 +-
 127 files changed, 1871 insertions(+), 771 deletions(-)
 create mode 100644 content/verify/index.html

diff --git a/.nojekyll b/.nojekyll
index 4d069cc..3ea24eb 100644
--- a/.nojekyll
+++ b/.nojekyll
@@ -1 +1 @@
-741ee518
\ No newline at end of file
+968c8bee
\ No newline at end of file
diff --git a/content/faq/index.html b/content/faq/index.html
index bd67776..cc5ef0d 100644
--- a/content/faq/index.html
+++ b/content/faq/index.html
@@ -396,19 +396,19 @@ <h1 class="quarto-secondary-nav-title">FAQ</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
diff --git a/content/gauss/access.html b/content/gauss/access.html
index df2e5df..a877f0a 100644
--- a/content/gauss/access.html
+++ b/content/gauss/access.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::gauss</code> — Echelon Form
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::gauss</code> — Echelon Form Acc
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/gauss/constructors.html b/content/gauss/constructors.html
index db339c2..b4698fe 100644
--- a/content/gauss/constructors.html
+++ b/content/gauss/constructors.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::gauss</code> — Construction<
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::gauss</code> — Construction</h1
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/gauss/functor.html b/content/gauss/functor.html
index 41c7baa..242ba63 100644
--- a/content/gauss/functor.html
+++ b/content/gauss/functor.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::gauss</code> — Solution Acce
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::gauss</code> — Solution Access<
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/gauss/index.html b/content/gauss/index.html
index f5af692..7500a48 100644
--- a/content/gauss/index.html
+++ b/content/gauss/index.html
@@ -460,19 +460,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit::gauss</code> Class</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -574,7 +574,7 @@ <h1 class="title d-none d-lg-block">The <code>bit::gauss</code> Class</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/gauss/queries.html b/content/gauss/queries.html
index 4346c9f..34667f1 100644
--- a/content/gauss/queries.html
+++ b/content/gauss/queries.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::gauss</code> — System Querie
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::gauss</code> — System Queries</
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/gauss/solve.html b/content/gauss/solve.html
index 2161180..2f45ca4 100644
--- a/content/gauss/solve.html
+++ b/content/gauss/solve.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::solve</code> — Solver</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
diff --git a/content/index.html b/content/index.html
index 1c6c14b..aa08f31 100644
--- a/content/index.html
+++ b/content/index.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit</code>Library</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -571,7 +571,7 @@ <h1 class="title d-none d-lg-block">The <code>bit</code>Library</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/access.html b/content/lu/access.html
index e03870e..d26ad15 100644
--- a/content/lu/access.html
+++ b/content/lu/access.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Access</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Access</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/constructors.html b/content/lu/constructors.html
index d058c24..32b0d5f 100644
--- a/content/lu/constructors.html
+++ b/content/lu/constructors.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Constructors</h1
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Constructors</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/functor.html b/content/lu/functor.html
index 5e7e8bd..21a8a95 100644
--- a/content/lu/functor.html
+++ b/content/lu/functor.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Solutions</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Solutions</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/index.html b/content/lu/index.html
index 1594a1b..fe9dc2f 100644
--- a/content/lu/index.html
+++ b/content/lu/index.html
@@ -460,19 +460,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit::lu</code> Class</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -572,7 +572,7 @@ <h1 class="title d-none d-lg-block">The <code>bit::lu</code> Class</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/invert.html b/content/lu/invert.html
index 93152d0..b945aa8 100644
--- a/content/lu/invert.html
+++ b/content/lu/invert.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Invert a Bit-Mat
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Invert a Bit-Matrix
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/permute.html b/content/lu/permute.html
index ae9fa96..0bb219e 100644
--- a/content/lu/permute.html
+++ b/content/lu/permute.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Row Permutations
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Row Permutations</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/lu/queries.html b/content/lu/queries.html
index 2b1003a..52bfe91 100644
--- a/content/lu/queries.html
+++ b/content/lu/queries.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::lu</code> — Queries</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::lu</code> — Queries</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/access.html b/content/matrix/access.html
index c7c8176..dc1c1f6 100644
--- a/content/matrix/access.html
+++ b/content/matrix/access.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Element Acce
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Element Access<
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -632,7 +632,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Element Access<
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>In general, these methods do <em>not</em> check whether an index is in bounds, and if it isn’t, the behavior is undefined (but bound to be wrong!) Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>In general, these methods do <em>not</em> check whether an index is in bounds, and if it isn’t, the behavior is undefined (but bound to be wrong!) Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
@@ -668,7 +668,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Element Access<
 <section id="see-also" class="level3">
 <h3 class="anchored" data-anchor-id="see-also">See Also</h3>
 <p><a href="../../content/vector/reference.html"><code>vector::reference</code></a><br>
-<a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></p>
+<a href="../../content/verify/index.html"><code>bit_verify</code></a></p>
 
 
 </section>
diff --git a/content/matrix/add-pop.html b/content/matrix/add-pop.html
index 959d24d..23943d4 100644
--- a/content/matrix/add-pop.html
+++ b/content/matrix/add-pop.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Add &amp; Re
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Add &amp; Remov
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/all.html b/content/matrix/all.html
index 4754e78..5fd479f 100644
--- a/content/matrix/all.html
+++ b/content/matrix/all.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Check on Set
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Check on Set Bi
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -600,7 +600,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Check on Set Bi
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>Calling these methods for an empty bit-matrix is likely an error — if you set the <code>BIT_DEBUG</code> flag at compile time, we throw an exception with a helpful message. If the <code>BIT_DEBUG</code> flag is not set, <code>all()</code> and <code>none()</code> <em>both</em> return <code>true</code> while <code>any()</code> will return <code>false</code>.</p>
+<p>Calling these methods for an empty bit-matrix is likely an error — if you set the <code>BIT_VERIFY</code> flag at compile time, we throw an exception with a helpful message. If the <code>BIT_VERIFY</code> flag is not set, <code>all()</code> and <code>none()</code> <em>both</em> return <code>true</code> while <code>any()</code> will return <code>false</code>.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/append.html b/content/matrix/append.html
index 1087d8e..d228fe4 100644
--- a/content/matrix/append.html
+++ b/content/matrix/append.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Append to a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Append to a Bit
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/capacity.html b/content/matrix/capacity.html
index 009f4b7..8547a3c 100644
--- a/content/matrix/capacity.html
+++ b/content/matrix/capacity.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Capacity Que
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Capacity Querie
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/characteristic_polynomial.html b/content/matrix/characteristic_polynomial.html
index d1fb874..3a9884b 100644
--- a/content/matrix/characteristic_polynomial.html
+++ b/content/matrix/characteristic_polynomial.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Characterist
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Characteristic
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -614,7 +614,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Characteristic
 <div class="sourceCode" id="annotated-cell-4"><pre class="sourceCode cpp code-annotation-code code-with-copy code-annotated"><code class="sourceCode cpp"><span id="annotated-cell-4-1"><a href="#annotated-cell-4-1" aria-hidden="true" tabindex="-1"></a><span class="pp">#include </span><span class="im">&lt;bit/bit.h&gt;</span></span>
 <span id="annotated-cell-4-2"><a href="#annotated-cell-4-2" aria-hidden="true" tabindex="-1"></a><span class="dt">int</span> main<span class="op">()</span></span>
 <span id="annotated-cell-4-3"><a href="#annotated-cell-4-3" aria-hidden="true" tabindex="-1"></a><span class="op">{</span></span>
-<span id="annotated-cell-4-4"><a href="#annotated-cell-4-4" aria-hidden="true" tabindex="-1"></a>    <span class="co">// For this example - turn off BIT_DEBUG and enable optimization here!</span></span>
+<span id="annotated-cell-4-4"><a href="#annotated-cell-4-4" aria-hidden="true" tabindex="-1"></a>    <span class="co">// For this example - turn off BIT_VERIFY and enable optimization here!</span></span>
 <a class="code-annotation-anchor" data-target-cell="annotated-cell-4" data-target-annotation="1" onclick="event.preventDefault();">1</a><span id="annotated-cell-4-5" class="code-annotation-target"><a href="#annotated-cell-4-5" aria-hidden="true" tabindex="-1"></a>    <span class="kw">auto</span> M <span class="op">=</span> bit<span class="op">::</span>matrix<span class="op">&lt;&gt;::</span>random<span class="op">(</span><span class="dv">512</span><span class="op">);</span></span>
 <span id="annotated-cell-4-6"><a href="#annotated-cell-4-6" aria-hidden="true" tabindex="-1"></a>    <span class="kw">auto</span> p <span class="op">=</span> bit<span class="op">::</span>characteristic_polynomial<span class="op">(</span>M<span class="op">);</span></span>
 <span id="annotated-cell-4-7"><a href="#annotated-cell-4-7" aria-hidden="true" tabindex="-1"></a>    <span class="bu">std::</span>cout <span class="op">&lt;&lt;</span> <span class="st">"Characteristic polynomial:</span><span class="sc">\n</span><span class="st">"</span> <span class="op">&lt;&lt;</span> p <span class="op">&lt;&lt;</span> <span class="st">"</span><span class="sc">\n\n</span><span class="st">"</span><span class="op">;</span></span>
diff --git a/content/matrix/clear.html b/content/matrix/clear.html
index 90d012f..bc6ab0a 100644
--- a/content/matrix/clear.html
+++ b/content/matrix/clear.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Clear out a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Clear out a Bit
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/companion.html b/content/matrix/companion.html
index d705111..e3141e6 100644
--- a/content/matrix/companion.html
+++ b/content/matrix/companion.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> - Companion/Frob
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -567,7 +567,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> - Companion/Frobeni
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/constructors.html b/content/matrix/constructors.html
index ecebf06..8b85b89 100644
--- a/content/matrix/constructors.html
+++ b/content/matrix/constructors.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Construction
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -564,7 +564,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Construction</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/count.html b/content/matrix/count.html
index be39ed7..6dc27a5 100644
--- a/content/matrix/count.html
+++ b/content/matrix/count.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Bit Counts</
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Bit Counts</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/description.html b/content/matrix/description.html
index b82fb95..85e72ca 100644
--- a/content/matrix/description.html
+++ b/content/matrix/description.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Descriptive
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Descriptive Mat
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/dot.html b/content/matrix/dot.html
index d314a75..bf6092b 100644
--- a/content/matrix/dot.html
+++ b/content/matrix/dot.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Bit-Matrix M
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Bit-Matrix Mult
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -620,7 +620,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Bit-Matrix Mult
 </div>
 <div class="callout-body-container callout-body">
 <p>The function arguments must have compatible sizes.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/echelon.html b/content/matrix/echelon.html
index ecb2689..6c82009 100644
--- a/content/matrix/echelon.html
+++ b/content/matrix/echelon.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Echelon Form
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -566,7 +566,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Echelon Forms</
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/from.html b/content/matrix/from.html
index 23445b0..1b48c08 100644
--- a/content/matrix/from.html
+++ b/content/matrix/from.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Construction
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Construction fr
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/index.html b/content/matrix/index.html
index 6464168..f10e09d 100644
--- a/content/matrix/index.html
+++ b/content/matrix/index.html
@@ -460,19 +460,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit::matrix</code> Class</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -584,7 +584,7 @@ <h1 class="title d-none d-lg-block">The <code>bit::matrix</code> Class</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -1160,16 +1160,12 @@ <h3 class="anchored" data-anchor-id="debugging">Debugging</h3>
 </thead>
 <tbody>
 <tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>BIT_DEBUG</code></a></td>
+<td><a href="../../content/verify/index.html"><code>BIT_VERIFY</code></a></td>
 <td>This compile-time flag enables extra safety checks.</td>
 </tr>
 <tr class="even">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_debug_assertion</code></a></td>
-<td>These assertions are only checked if the <code>BIT_DEBUG</code> flag is set at compile time.</td>
-</tr>
-<tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></td>
-<td>Use this form for checks that must always be performed.</td>
+<td><a href="../../content/verify/index.html"><code>bit_verify</code></a></td>
+<td>These checks are only performed if the <code>BIT_VERIFY</code> flag is set at compile time.</td>
 </tr>
 </tbody>
 </table>
diff --git a/content/matrix/invert.html b/content/matrix/invert.html
index 741c7c5..c9e68c5 100644
--- a/content/matrix/invert.html
+++ b/content/matrix/invert.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Bit-Matrix I
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Bit-Matrix Inve
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -600,7 +600,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Bit-Matrix Inve
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The input matrix must be square, and the <a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a> macro checks that pre-condition.</p>
+<p>The input matrix must be square, and, if the <code>BIT_VERIFY</code> flag is set at compile time, the <a href="../../content/verify/index.html"><code>bit_verify</code></a> macro checks that pre-condition.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/is_special.html b/content/matrix/is_special.html
index 92b412b..200e81c 100644
--- a/content/matrix/is_special.html
+++ b/content/matrix/is_special.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Is a Bit-Mat
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Is a Bit-Matrix
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/logical-op-eq.html b/content/matrix/logical-op-eq.html
index 9c043e6..4c34912 100644
--- a/content/matrix/logical-op-eq.html
+++ b/content/matrix/logical-op-eq.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — In-place Log
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — In-place Logica
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -619,7 +619,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — In-place Logica
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The two bit-matrices in question must have the same dimensions. Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>The two bit-matrices in question must have the same dimensions. Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p>There is one other bit-twiddling method:</p>
diff --git a/content/matrix/logical-op.html b/content/matrix/logical-op.html
index fbb7635..652c9cb 100644
--- a/content/matrix/logical-op.html
+++ b/content/matrix/logical-op.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Logical Oper
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Logical Operato
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -626,7 +626,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Logical Operato
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The two bit-matrices in question must have the same dimensions. Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>The two bit-matrices in question must have the same dimensions. Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/pow.html b/content/matrix/pow.html
index f4d32e8..db8ab4f 100644
--- a/content/matrix/pow.html
+++ b/content/matrix/pow.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Powers of a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Powers of a Bit
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -602,7 +602,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Powers of a Bit
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The input matrix must be square, and the <a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a> macro checks that pre-condition.</p>
+<p>The input matrix must be square, and, if the <code>BIT_VERIFY</code> flag is set at compile time, the <a href="../../content/verify/index.html"><code>bit_verify</code></a> macro checks that pre-condition.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/print.html b/content/matrix/print.html
index 11a4818..1ca4eb2 100644
--- a/content/matrix/print.html
+++ b/content/matrix/print.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Side-by-Side
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -565,7 +565,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Side-by-Side Pr
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/probability.html b/content/matrix/probability.html
index a028aea..d14c81d 100644
--- a/content/matrix/probability.html
+++ b/content/matrix/probability.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Probability
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Probability of
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/random.html b/content/matrix/random.html
index 389bfe5..500b629 100644
--- a/content/matrix/random.html
+++ b/content/matrix/random.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Random Fill<
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Random Fill</h1
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/replace.html b/content/matrix/replace.html
index 6c6e6d3..8264117 100644
--- a/content/matrix/replace.html
+++ b/content/matrix/replace.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Replace Some
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Replace Some Co
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -605,7 +605,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Replace Some Co
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The sub-matrix <code>with</code> we are copying from must fit inside the existing bit-matrix! Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>The sub-matrix <code>with</code> we are copying from must fit inside the existing bit-matrix! Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p>These methods return a reference to <code>*this</code> so they can be chained with other calls.</p>
diff --git a/content/matrix/resize.html b/content/matrix/resize.html
index df9ea77..c89003f 100644
--- a/content/matrix/resize.html
+++ b/content/matrix/resize.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Resize a Bit
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Resize a Bit-Ma
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/set.html b/content/matrix/set.html
index 239a3c5..a7fcaf3 100644
--- a/content/matrix/set.html
+++ b/content/matrix/set.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Alter Elemen
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Alter Elements<
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/set_if.html b/content/matrix/set_if.html
index 99e2bdb..3a8d5de 100644
--- a/content/matrix/set_if.html
+++ b/content/matrix/set_if.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Conditional
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Conditional Set
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/shift.html b/content/matrix/shift.html
index a4ac524..387cfc5 100644
--- a/content/matrix/shift.html
+++ b/content/matrix/shift.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Logical Shif
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Logical Shift O
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/shrink_to_fit.html b/content/matrix/shrink_to_fit.html
index 44d8286..c0f65b2 100644
--- a/content/matrix/shrink_to_fit.html
+++ b/content/matrix/shrink_to_fit.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Minimize the
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Minimize the Sp
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/size.html b/content/matrix/size.html
index efb90a9..2bff394 100644
--- a/content/matrix/size.html
+++ b/content/matrix/size.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Size Queries
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Size Queries</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/specials.html b/content/matrix/specials.html
index 327dc7d..229252e 100644
--- a/content/matrix/specials.html
+++ b/content/matrix/specials.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Create Speci
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Create Special
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/stream.html b/content/matrix/stream.html
index 6e75fd3..32d804c 100644
--- a/content/matrix/stream.html
+++ b/content/matrix/stream.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Stream Opera
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Stream Operator
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/sub.html b/content/matrix/sub.html
index 5d3cd49..1bfc97b 100644
--- a/content/matrix/sub.html
+++ b/content/matrix/sub.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Extract a Su
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Extract a Sub-B
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -605,7 +605,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Extract a Sub-B
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p><code>(i0, j0)</code> has to be a valid index pair, and the requested dimensions must fit as a valid sub-matrix. Set the <code>BIT_DEBUG</code> flag at compile time to check these conditions — any violation will cause the program to abort with a helpful message.</p>
+<p><code>(i0, j0)</code> has to be a valid index pair, and the requested dimensions must fit as a valid sub-matrix. Set the <code>BIT_VERIFY</code> flag at compile time to check these conditions — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/swap.html b/content/matrix/swap.html
index 0df71d8..b458c83 100644
--- a/content/matrix/swap.html
+++ b/content/matrix/swap.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Swap Two Row
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Swap Two Rows/C
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -596,7 +596,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Swap Two Rows/C
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>Generally, these methods do <em>not</em> check whether the indices are in bounds. If they aren’t, the behavior is undefined (but bound to be wrong!) All of them will perform range checking if you set the <code>BIT_DEBUG</code> at compile time. See <a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a>.</p>
+<p>Generally, these methods do <em>not</em> check whether the indices are in bounds. If they aren’t, the behavior is undefined (but bound to be wrong!) All of them will perform range checking if you set the <code>BIT_VERIFY</code> at compile time. See <a href="../../content/verify/index.html"><code>bit_verify</code></a>.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/matrix/to_string.html b/content/matrix/to_string.html
index ffa6246..39f7af8 100644
--- a/content/matrix/to_string.html
+++ b/content/matrix/to_string.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Encode as a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Encode as a Str
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/to_vector.html b/content/matrix/to_vector.html
index 7e75957..92abade 100644
--- a/content/matrix/to_vector.html
+++ b/content/matrix/to_vector.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Convert to a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Convert to a Bi
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/transpose.html b/content/matrix/transpose.html
index e887e96..9dbfcd9 100644
--- a/content/matrix/transpose.html
+++ b/content/matrix/transpose.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Transpose a
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Transpose a Bit
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/matrix/triangle.html b/content/matrix/triangle.html
index e50aa29..80e930c 100644
--- a/content/matrix/triangle.html
+++ b/content/matrix/triangle.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::matrix</code> — Upper &amp;
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::matrix</code> — Upper &amp; Low
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/notes/danilevsky.html b/content/notes/danilevsky.html
index 01c8b02..e3ab4e3 100644
--- a/content/notes/danilevsky.html
+++ b/content/notes/danilevsky.html
@@ -429,19 +429,19 @@ <h1 class="quarto-secondary-nav-title">Danilevsky’s Algorithm</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -546,7 +546,7 @@ <h1 class="title d-none d-lg-block">Danilevsky’s Algorithm</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/notes/design.html b/content/notes/design.html
index 5332183..64a3951 100644
--- a/content/notes/design.html
+++ b/content/notes/design.html
@@ -461,19 +461,19 @@ <h1 class="quarto-secondary-nav-title">Library Design Notes</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -542,7 +542,7 @@ <h2 id="toc-title">On this page</h2>
   <ul class="collapse">
   <li><a href="#alternative-ideas" id="toc-alternative-ideas" class="nav-link" data-scroll-target="#alternative-ideas">Alternative Ideas</a></li>
   </ul></li>
-  <li><a href="#assertions" id="toc-assertions" class="nav-link" data-scroll-target="#assertions">Assertions</a></li>
+  <li><a href="#bounds-checking" id="toc-bounds-checking" class="nav-link" data-scroll-target="#bounds-checking">Bounds checking</a></li>
   </ul>
 <div class="toc-actions"><ul><li><a href="https://github.com/nessan/bit/edit/main/docs/content/notes/design.qmd" class="toc-action"><i class="bi bi-github"></i>Edit this page</a></li><li><a href="https://github.com/nessan/bit/issues/new/choose" class="toc-action"><i class="bi empty"></i>Report an issue</a></li></ul></div></nav>
     </div>
@@ -576,7 +576,7 @@ <h1 class="title d-none d-lg-block">Library Design Notes</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -743,25 +743,10 @@ <h3 class="anchored" data-anchor-id="alternative-ideas">Alternative Ideas</h3>
 <p>Apart from using column-major versus row-major mode, the other potentially sensible idea would be to base the whole library on bit-matrices where bit-vectors are either <span class="math inline">\(n \times 1\)</span> or <span class="math inline">\(1 \times n\)</span> bit-matrices.</p>
 </section>
 </section>
-<section id="assertions" class="level2">
-<h2 class="anchored" data-anchor-id="assertions">Assertions</h2>
+<section id="bounds-checking" class="level2">
+<h2 class="anchored" data-anchor-id="bounds-checking">Bounds checking</h2>
 <p>In the development cycle, it can be helpful to confirm that indices are in bounds and perform other range checks. However, those checks are expensive and can slow down numerical code by orders of magnitude. We don’t want those verifications accidentally left “on” in our production code.</p>
-<p>For this reason, we include our versions of the standard [<code>std::assert</code>] macro.</p>
-<div class="callout callout-style-default callout-tip callout-titled">
-<div class="callout-header d-flex align-content-center">
-<div class="callout-icon-container">
-<i class="callout-icon"></i>
-</div>
-<div class="callout-title-container flex-fill">
-Assertions have messages
-</div>
-</div>
-<div class="callout-body-container callout-body">
-<p>Our assertions come with the ability to print an explanation of what caused any failure.</p>
-</div>
-</div>
-<p>The most commonly used form in the library is <code>bit_debug_assertion(...)</code>. This form expands to nothing <em>unless</em> the programmer sets the <code>BIT_DEBUG</code> flag at compile time. That is typically done automatically <em>only</em> for debug software builds and is <em>never</em> done for release/optimized builds.</p>
-<p>There is also a version <code>bit_assertion(...)</code> that is very similar to the [<code>std::assert</code>] macro with the addition of a message. Typically these are for assertions where the cost of the check is cheap compared to the cost of the work done in the method. This form expands to nothing <em>only if</em> the <code>NDEBUG</code> flag is set a compile time.</p>
+<p>For this reason, we include the <a href="../../content/verify/index.html"><code>bit_verify</code></a> macro. The macro expands to nothing <em>unless</em> the programmer sets the <code>BIT_VERIFY</code> flag at compile time. That is typically done automatically <em>only</em> for debug software builds and is <em>never</em> done for release/optimized builds.</p>
 
 
 </section>
diff --git a/content/notes/gf2.html b/content/notes/gf2.html
index 66d6054..be73a3d 100644
--- a/content/notes/gf2.html
+++ b/content/notes/gf2.html
@@ -429,19 +429,19 @@ <h1 class="quarto-secondary-nav-title">Working in GF(2)</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -536,7 +536,7 @@ <h1 class="title d-none d-lg-block">Working in GF(2)</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -629,7 +629,7 @@ <h2 class="anchored" data-anchor-id="some-things-are-simpler">Some things are si
 <section id="gaussian-elimination-in-ff" class="level2">
 <h2 class="anchored" data-anchor-id="gaussian-elimination-in-ff">Gaussian Elimination in <span class="math inline">\(\FF\)</span></h2>
 <p>Suppose that <span class="math inline">\(A\)</span> is an <span class="math inline">\(n \times n\)</span> matrix over <span class="math inline">\(\FF\)</span> and <span class="math inline">\(b\)</span> is a compatibly sized bit-vector where we are interested in finding an <span class="math inline">\(x\)</span> satisfying <span class="math inline">\(A \cdot x = b\)</span>. Then the pseudocode for Gaussian elimination looks like:</p>
-<div id="alg-ge" class="pseudocode-container quarto-float" data-pseudocode-number="1" data-line-number="true" data-comment-delimiter="//" data-caption-prefix="Algorithm" data-no-end="false" data-indent-size="1.2em" data-line-number-punc=":">
+<div id="alg-ge" class="pseudocode-container quarto-float" data-pseudocode-number="1" data-line-number="true" data-no-end="false" data-indent-size="1.2em" data-caption-prefix="Algorithm" data-comment-delimiter="//" data-line-number-punc=":">
 <div class="pseudocode">
 \begin{algorithm} \caption{Gaussian Elimination in $F_2$} \begin{algorithmic} \Procedure{Solve}{$A, b, n$} \For {$j = 0$ \To $n - 1$} \State $s = j$ \While {$A(s,j) = 0$} \State $s = s + 1$ \EndWhile \If {$s &gt; n$} \Continue \EndIf \If {$ s \ne j$} \State swap rows $s$ and $j$ in the matrix $A$ \State swap elements $s$ and $j$ in the vector $b$ \EndIf \For {$i = j+1$ \To $n$} \If {$A(i,j) == 1$} \State replace row $i$ in $A$ with the sum of rows $i$ and $j$ \State replace element $i$ in $b$ with the sum of elements $i$ and $j$ \EndIf \EndFor \EndFor \EndProcedure \end{algorithmic} \end{algorithm}
 </div>
diff --git a/content/notes/index.html b/content/notes/index.html
index 39df78f..e3bbf9b 100644
--- a/content/notes/index.html
+++ b/content/notes/index.html
@@ -426,19 +426,19 @@ <h1 class="quarto-secondary-nav-title">Technical Notes</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -530,7 +530,7 @@ <h1 class="title d-none d-lg-block">Technical Notes</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/notes/reduction.html b/content/notes/reduction.html
index 260c467..3132c08 100644
--- a/content/notes/reduction.html
+++ b/content/notes/reduction.html
@@ -428,19 +428,19 @@ <h1 class="quarto-secondary-nav-title">Modular Reduction of <span class="math in
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -683,7 +683,7 @@ <h2 class="anchored" data-anchor-id="a-multiply-square-technique-for-xn-mod-px">
 </table>
 </div>
 <p>With those in place we can proceed as follows (this is just a sketch):</p>
-<div id="multiply_and_square" class="pseudocode-container quarto-float" data-caption-prefix="Algorithm" data-pseudocode-number="1">
+<div id="multiply_and_square" class="pseudocode-container quarto-float" data-pseudocode-number="1" data-caption-prefix="Algorithm">
 <div class="pseudocode">
 \begin{algorithm} \caption{Modular Reduction of $x^N$} \begin{algorithmic} \Require $\mathbf{p}$, a bit-vector of size $n$, where $P(x) = x^n + p(x)$ and $\mathbf{p} \sim p(x)$. Unchanged on output. \Require $\mathbf{r}$, a destination bit-vector of size $n$. On output $\mathbf{r} \sim r(x) = x^N \mid P(x)$. \Procedure{reduce}{$N$, $\mathbf{p}$} \State $\mathbf{r} \gets \mathbf{0}$ \State $r_1 = 1$ \While{$N &gt; 0$} \If{$N \text{ mod } 2 = 1$} \State \Call{MultiplyStep}{$\mathbf{r}$} \EndIf \State \Call{SquareStep}{$\mathbf{r}$} \State $N \gets N \gg 1$ \EndWhile \EndProcedure \end{algorithmic} \end{algorithm}
 </div>
@@ -696,7 +696,7 @@ <h3 class="anchored" data-anchor-id="the-multiply-step">The Multiply Step</h3>
 \]</span> then the following procedure performs the step <span class="math display">\[
     q(x) \gets x q(x) \mod P(x),
 \]</span> where <span class="math inline">\(q(x)\)</span> is represented by the bit-vector of its <span class="math inline">\(n\)</span> coefficients <span class="math inline">\(\bold{q} = [q_0, q_1, \ldots, q_{n-1}]\)</span>.</p>
-<div id="MultiplyStep" class="pseudocode-container quarto-float" data-caption-prefix="Algorithm" data-pseudocode-number="2">
+<div id="MultiplyStep" class="pseudocode-container quarto-float" data-pseudocode-number="2" data-caption-prefix="Algorithm">
 <div class="pseudocode">
 \begin{algorithm} \caption{The step: $q(x) \gets x q(x) \mid P(x)$.} \begin{algorithmic} \Require $\mathbf{p} \sim p(x)$ is a known bit-vector of size $n$, where $P(x) = x^n + p(x)$. \Require $\mathbf{q}$ is a bit-vector of size $n &gt; 0$. \Procedure{MultiplyStep}{$\mathbf{q}$} \State $tmp \gets q_{n-1}$ \State $\mathbf{q} \gets \mathbf{q} \gg 1$ \If {$tmp$} \State $\mathbf{q} \gets \mathbf{q} \wedge \mathbf{p}$ \EndIf \EndProcedure \end{algorithmic} \end{algorithm}
 </div>
@@ -734,7 +734,7 @@ <h3 class="anchored" data-anchor-id="the-square-step">The Square Step</h3>
     \bold{x}^0 = \bold{p}.
 \]</span> With that starting point, we can easily fill in bit vectors <span class="math inline">\(\bold{x}^i\)</span> for <span class="math inline">\(i = 1, \ldots, n-1\)</span> by using <a href="#MultiplyStep" class="quarto-xref">Algorithm 2</a>.</p>
 <p>The squaring step looks like the following:</p>
-<div id="SquareStep" class="pseudocode-container quarto-float" data-caption-prefix="Algorithm" data-pseudocode-number="3">
+<div id="SquareStep" class="pseudocode-container quarto-float" data-pseudocode-number="3" data-caption-prefix="Algorithm">
 <div class="pseudocode">
 \begin{algorithm} \caption{The step: $q(x) \gets q(x)^2 \mid P(x)$.} \begin{algorithmic} \Require $\mathbf{p} \sim p(x)$ is a known bit-vector of size $n$, where $P(x) = x^n + p(x)$. \Require $\mathbf{x}^i$ are known bit-vectors, where $\mathbf{x}^i \sim x^{n+i} \mid P(x)$. \Require $\mathbf{s}, \mathbf{l}$ and $\mathbf{h}$ are available workspace bit-vectors. \Require $\mathbf{q}$ is a bit-vector of size $n &gt; 0$. \Procedure{SquareStep}{$\mathbf{q}$} \State // \textit{Riffle $\mathbf{q}$ into $\mathbf{s}$.} \State \Call{riffle}{$\mathbf{q}$, $\mathbf{s}$} \State // \textit{Fill $\mathbf{l}$ with a copy of the first $n$ elements from $\mathbf{s}$ and $\mathbf{h}$ with the rest.} \State \Call{split}{$\mathbf{s}$, $n$, $\mathbf{l}$, $\mathbf{h}$} \State $\mathbf{q} \gets \mathbf{l}$ \For {$i \gets 0, n-1$} \If{$h_i$} \State $\mathbf{q} \gets \mathbf{q} \wedge \mathbf{x}^i$ \EndIf \EndFor \EndProcedure \end{algorithmic} \end{algorithm}
 </div>
diff --git a/content/polynomial/access.html b/content/polynomial/access.html
index af3e8a0..c67c2fb 100644
--- a/content/polynomial/access.html
+++ b/content/polynomial/access.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Coeffici
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Coefficient
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -638,7 +638,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Coefficient
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>Generally, the methods do <em>not</em> check whether the index <code>i</code> is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>Generally, the methods do <em>not</em> check whether the index <code>i</code> is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p>The <code>vector_type</code> is simply a <a href="../../content/vector/index.html"><code>bit::vector</code></a> with the appropriate <code>Block</code> and <code>Allocator</code> template parameters.</p>
@@ -683,7 +683,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Coefficient
 <h3 class="anchored" data-anchor-id="see-also">See Also</h3>
 <p><a href="../../content/polynomial/reference.html"><code>polynomial::reference</code></a><br>
 <a href="../../content/polynomial/size.html"><code>polynomial::size</code></a><br>
-<a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></p>
+<a href="../../content/verify/index.html"><code>bit_verify</code></a></p>
 
 
 </section>
diff --git a/content/polynomial/arithmetic.html b/content/polynomial/arithmetic.html
index 8982025..a5f91e9 100644
--- a/content/polynomial/arithmetic.html
+++ b/content/polynomial/arithmetic.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Arithmet
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -566,7 +566,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Arithmetic<
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/constructors.html b/content/polynomial/constructors.html
index 39b49d6..28ed0b0 100644
--- a/content/polynomial/constructors.html
+++ b/content/polynomial/constructors.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Construc
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Constructio
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/count.html b/content/polynomial/count.html
index a6bc213..6b9afff 100644
--- a/content/polynomial/count.html
+++ b/content/polynomial/count.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Coeffici
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Coefficient
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/degree.html b/content/polynomial/degree.html
index 08cab77..306d4e8 100644
--- a/content/polynomial/degree.html
+++ b/content/polynomial/degree.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Polynomi
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -567,7 +567,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Polynomial
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/evaluation.html b/content/polynomial/evaluation.html
index 40699d8..dc10333 100644
--- a/content/polynomial/evaluation.html
+++ b/content/polynomial/evaluation.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Polynomi
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -567,7 +567,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Polynomial
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -629,7 +629,7 @@ <h2 class="anchored" data-anchor-id="matrix-arguments">Matrix Arguments</h2>
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>The input matrix must be square, and the <a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a> macro checks that pre-condition.</p>
+<p>The input matrix must be square, and, if the <code>BIT_VERIFY</code> flag is set at compile time, the <a href="../../content/verify/index.html"><code>bit_verify</code></a> macro checks that pre-condition.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/polynomial/formatter.html b/content/polynomial/formatter.html
index c8b496f..96badfc 100644
--- a/content/polynomial/formatter.html
+++ b/content/polynomial/formatter.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Custom F
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Custom Form
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/index.html b/content/polynomial/index.html
index a44fa05..59ea28f 100644
--- a/content/polynomial/index.html
+++ b/content/polynomial/index.html
@@ -460,19 +460,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit::polynomial</code> Class</h
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -582,7 +582,7 @@ <h1 class="title d-none d-lg-block">The <code>bit::polynomial</code> Class</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -1010,16 +1010,12 @@ <h3 class="anchored" data-anchor-id="debugging">Debugging</h3>
 </thead>
 <tbody>
 <tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>BIT_DEBUG</code></a></td>
+<td><a href="../../content/verify/index.html"><code>BIT_VERIFY</code></a></td>
 <td>This compile-time flag enables extra safety checks.</td>
 </tr>
 <tr class="even">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_debug_assertion</code></a></td>
-<td>These assertions are <strong>only</strong> checked if you set the <code>BIT_DEBUG</code> flag at compile time.</td>
-</tr>
-<tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></td>
-<td>These assertions are always checked.</td>
+<td><a href="../../content/verify/index.html"><code>bit_verify</code></a></td>
+<td>These checks are <strong>only</strong> done if you set the <code>BIT_VERIFY</code> flag at compile time.</td>
 </tr>
 </tbody>
 </table>
diff --git a/content/polynomial/monic.html b/content/polynomial/monic.html
index d36cc8d..b90a5c9 100644
--- a/content/polynomial/monic.html
+++ b/content/polynomial/monic.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Monic</h
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Monic</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/power.html b/content/polynomial/power.html
index 2847232..d64aa91 100644
--- a/content/polynomial/power.html
+++ b/content/polynomial/power.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Power Po
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Power Polyn
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/random.html b/content/polynomial/random.html
index 526a658..cc16407 100644
--- a/content/polynomial/random.html
+++ b/content/polynomial/random.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Random P
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Random Poly
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/reduce.html b/content/polynomial/reduce.html
index fc4bc0d..ac88fa8 100644
--- a/content/polynomial/reduce.html
+++ b/content/polynomial/reduce.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Reductio
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Reduction</
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/reference.html b/content/polynomial/reference.html
index 101e536..c10f983 100644
--- a/content/polynomial/reference.html
+++ b/content/polynomial/reference.html
@@ -425,19 +425,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial::reference</code> 
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -532,7 +532,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial::reference</code> —
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/shrink_to_fit.html b/content/polynomial/shrink_to_fit.html
index 8cbe7a5..be5c273 100644
--- a/content/polynomial/shrink_to_fit.html
+++ b/content/polynomial/shrink_to_fit.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Memory R
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Memory Redu
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/size.html b/content/polynomial/size.html
index 81d3b78..63903ff 100644
--- a/content/polynomial/size.html
+++ b/content/polynomial/size.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Polynomi
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -568,7 +568,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Polynomial
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/special.html b/content/polynomial/special.html
index 9dfccde..efd7092 100644
--- a/content/polynomial/special.html
+++ b/content/polynomial/special.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Is the P
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Is the Poly
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/split.html b/content/polynomial/split.html
index fa99712..c6effba 100644
--- a/content/polynomial/split.html
+++ b/content/polynomial/split.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Polynomi
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Polynomial
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/squared.html b/content/polynomial/squared.html
index 56fbe10..3ac013b 100644
--- a/content/polynomial/squared.html
+++ b/content/polynomial/squared.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Efficien
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Efficient S
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/stream.html b/content/polynomial/stream.html
index c342f64..891df91 100644
--- a/content/polynomial/stream.html
+++ b/content/polynomial/stream.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Stream O
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Stream Oper
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/sub.html b/content/polynomial/sub.html
index bab1880..fe65bb8 100644
--- a/content/polynomial/sub.html
+++ b/content/polynomial/sub.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Sub-poly
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Sub-polynom
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/times_x.html b/content/polynomial/times_x.html
index 26e892c..9f0a061 100644
--- a/content/polynomial/times_x.html
+++ b/content/polynomial/times_x.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — Multipli
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Multiplicat
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/polynomial/to_string.html b/content/polynomial/to_string.html
index 56ab120..3739e18 100644
--- a/content/polynomial/to_string.html
+++ b/content/polynomial/to_string.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::polynomial</code> — String F
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — String Form
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/access.html b/content/vector/access.html
index d65ff0c..4aa0510 100644
--- a/content/vector/access.html
+++ b/content/vector/access.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Element Acce
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Element Access<
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -628,7 +628,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Element Access<
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>Generally, these methods do <em>not</em> check whether the index <code>i</code> is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p>Generally, these methods do <em>not</em> check whether the index <code>i</code> is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
@@ -672,7 +672,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Element Access<
 <h3 class="anchored" data-anchor-id="see-also">See Also</h3>
 <p><a href="../../content/vector/reference.html"><code>vector::reference</code></a><br>
 <a href="../../content/vector/size.html"><code>vector::size</code></a><br>
-<a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></p>
+<a href="../../content/verify/index.html"><code>bit_verify</code></a></p>
 
 
 </section>
diff --git a/content/vector/all.html b/content/vector/all.html
index ad094f0..8a3834f 100644
--- a/content/vector/all.html
+++ b/content/vector/all.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — State Querie
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — State Queries</
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -599,7 +599,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — State Queries</
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p>Calling these methods for an empty bit-vector is likely an error — if you set the <code>BIT_DEBUG</code> flag at compile time, we throw an exception with a helpful message. If the <code>BIT_DEBUG</code> flag is not set, <code>all()</code> and <code>none()</code> <em>both</em> return <code>true</code> while <code>any()</code> will return <code>false</code>.</p>
+<p>Calling these methods for an empty bit-vector is likely an error — if you set the <code>BIT_VERIFY</code> flag at compile time, we throw an exception with a helpful message. If the <code>BIT_VERIFY</code> flag is not set, <code>all()</code> and <code>none()</code> <em>both</em> return <code>true</code> while <code>any()</code> will return <code>false</code>.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/append.html b/content/vector/append.html
index 69deb8a..064c6eb 100644
--- a/content/vector/append.html
+++ b/content/vector/append.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Appending El
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -564,7 +564,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Appending Eleme
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/blocks.html b/content/vector/blocks.html
index f80dde3..638809b 100644
--- a/content/vector/blocks.html
+++ b/content/vector/blocks.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Access the B
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -566,7 +566,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Access the Bloc
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/capacity.html b/content/vector/capacity.html
index 31b70c0..a85035c 100644
--- a/content/vector/capacity.html
+++ b/content/vector/capacity.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Storage Capa
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Storage Capacit
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/clear.html b/content/vector/clear.html
index 4cccfa0..360dfb9 100644
--- a/content/vector/clear.html
+++ b/content/vector/clear.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Clear</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Clear</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/constructors.html b/content/vector/constructors.html
index 3c45861..2deb12f 100644
--- a/content/vector/constructors.html
+++ b/content/vector/constructors.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Construction
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -571,7 +571,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Construction</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/convolution.html b/content/vector/convolution.html
index f4b2c89..d27b837 100644
--- a/content/vector/convolution.html
+++ b/content/vector/convolution.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Convolutions
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Convolutions</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/copy.html b/content/vector/copy.html
index d69a3a6..cc68b18 100644
--- a/content/vector/copy.html
+++ b/content/vector/copy.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Copying Bits
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -569,7 +569,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Copying Bits</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/count.html b/content/vector/count.html
index 166b3e1..14c1ede 100644
--- a/content/vector/count.html
+++ b/content/vector/count.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Bit Counts</
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Bit Counts</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/description.html b/content/vector/description.html
index 320eb35..dfc0ade 100644
--- a/content/vector/description.html
+++ b/content/vector/description.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Descriptive
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Descriptive Dat
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/diff.html b/content/vector/diff.html
index c0e34e0..b516b1c 100644
--- a/content/vector/diff.html
+++ b/content/vector/diff.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Logical Diff
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Differe
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -594,7 +594,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Differe
 </div>
 <div class="callout-body-container callout-body">
 <p>The two vectors in question must be of the same size.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/dot.html b/content/vector/dot.html
index ea8df51..972d284 100644
--- a/content/vector/dot.html
+++ b/content/vector/dot.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Dot Product
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Dot Product for
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -599,7 +599,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Dot Product for
 </div>
 <div class="callout-body-container callout-body">
 <p>The two vectors in question must be of the same size.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/first_set.html b/content/vector/first_set.html
index ad107c1..634784a 100644
--- a/content/vector/first_set.html
+++ b/content/vector/first_set.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Iteration Ov
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Iteration Over
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/formatter.html b/content/vector/formatter.html
index 6ed26e9..c71ac9b 100644
--- a/content/vector/formatter.html
+++ b/content/vector/formatter.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Custom Forma
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -568,7 +568,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Custom Formatti
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/from.html b/content/vector/from.html
index 0a018be..a4b8ad8 100644
--- a/content/vector/from.html
+++ b/content/vector/from.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Factory Cons
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -569,7 +569,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Factory Constru
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/if_set_call.html b/content/vector/if_set_call.html
index 98abdaa..80f5622 100644
--- a/content/vector/if_set_call.html
+++ b/content/vector/if_set_call.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Iterate over
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Iterate over th
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/index.html b/content/vector/index.html
index ec61e79..6b15569 100644
--- a/content/vector/index.html
+++ b/content/vector/index.html
@@ -460,19 +460,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit::vector</code> Class</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -582,7 +582,7 @@ <h1 class="title d-none d-lg-block">The <code>bit::vector</code> Class</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -1210,7 +1210,7 @@ <h3 class="anchored" data-anchor-id="other-instance-methods">Other Instance Meth
 </section>
 <section id="debugging" class="level3">
 <h3 class="anchored" data-anchor-id="debugging">Debugging</h3>
-<p>You can set a compile-time flag <a href="../../content/bit_assertion/index.html"><code>BIT_DEBUG</code></a> to enable range checking and other assertions. These checks can have a substantial performance impact so typically are only used during development.</p>
+<p>You can set a compile-time flag <a href="../../content/verify/index.html"><code>BIT_VERIFY</code></a> to enable range checking and other assertions. These checks can have a substantial performance impact so typically are only used during development.</p>
 <div class="table-responsive">
 <table class="table-bordered table-striped table-hover caption-top table">
 <colgroup>
@@ -1225,20 +1225,12 @@ <h3 class="anchored" data-anchor-id="debugging">Debugging</h3>
 </thead>
 <tbody>
 <tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>BIT_DEBUG</code></a></td>
+<td><a href="../../content/verify/index.html"><code>BIT_VERIFY</code></a></td>
 <td>This compile-time flag enables extra safety checks at the cost of performance.</td>
 </tr>
 <tr class="even">
-<td><a href="../../content/bit_assertion/index.html"><code>NDEBUG</code></a></td>
-<td>This compile-time flag disables all our safety checks — even the cheap ones.</td>
-</tr>
-<tr class="odd">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_debug_assertion</code></a></td>
-<td>These assertions are <strong>only</strong> checked if you set the <code>BIT_DEBUG</code> flag at compile time.</td>
-</tr>
-<tr class="even">
-<td><a href="../../content/bit_assertion/index.html"><code>bit_assertion</code></a></td>
-<td>These assertions are checked **unless* you set the <code>NDEBUG</code> flag at compile time.</td>
+<td><a href="../../content/verify/index.html"><code>bit_verify</code></a></td>
+<td>These checks are <strong>only</strong> performed if you set the <code>BIT_VERIFY</code> flag at compile time.</td>
 </tr>
 </tbody>
 </table>
diff --git a/content/vector/indices.html b/content/vector/indices.html
index ca94b06..5f7dc00 100644
--- a/content/vector/indices.html
+++ b/content/vector/indices.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Index Locati
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Index Locations
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/join.html b/content/vector/join.html
index b61dee0..7461c4b 100644
--- a/content/vector/join.html
+++ b/content/vector/join.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Join Bit-Vec
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Join Bit-Vector
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/logical-op-eq.html b/content/vector/logical-op-eq.html
index bd3d8f9..b0c7d42 100644
--- a/content/vector/logical-op-eq.html
+++ b/content/vector/logical-op-eq.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Logical Op=
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Op= Ope
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -620,7 +620,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Op= Ope
 </div>
 <div class="callout-body-container callout-body">
 <p>The two vectors in question must be of the same size.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <div class="sourceCode" id="annotated-cell-2"><pre class="sourceCode cpp code-annotation-code code-with-copy code-annotated"><code class="sourceCode cpp"><a class="code-annotation-anchor" data-target-cell="annotated-cell-2" data-target-annotation="1" onclick="event.preventDefault();">1</a><span id="annotated-cell-2-1" class="code-annotation-target"><a href="#annotated-cell-2-1" aria-hidden="true" tabindex="-1"></a><span class="kw">constexpr</span> bit<span class="op">::</span>vector <span class="kw">operator</span><span class="op">~()</span> <span class="at">const</span><span class="op">;</span></span><div class="code-annotation-gutter-bg"></div><div class="code-annotation-gutter"></div></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
diff --git a/content/vector/logical-op.html b/content/vector/logical-op.html
index 9d9d139..e418cb6 100644
--- a/content/vector/logical-op.html
+++ b/content/vector/logical-op.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Logical Op O
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Op Oper
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -627,7 +627,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Logical Op Oper
 </div>
 <div class="callout-body-container callout-body">
 <p>The two vectors in question must be of the same size.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/polynomial_mod.html b/content/vector/polynomial_mod.html
index 24ee81a..da64677 100644
--- a/content/vector/polynomial_mod.html
+++ b/content/vector/polynomial_mod.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Computing <s
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -557,7 +557,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Computing <span
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/push-pop.html b/content/vector/push-pop.html
index 83793ea..a80fca0 100644
--- a/content/vector/push-pop.html
+++ b/content/vector/push-pop.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Add/Remove E
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Add/Remove Elem
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/random.html b/content/vector/random.html
index 5876a17..60e0669 100644
--- a/content/vector/random.html
+++ b/content/vector/random.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Random Fills
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Random Fills</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/reference.html b/content/vector/reference.html
index 6b1a615..e196890 100644
--- a/content/vector/reference.html
+++ b/content/vector/reference.html
@@ -425,19 +425,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector::reference</code> — P
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -532,7 +532,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector::reference</code> — Prox
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/replace.html b/content/vector/replace.html
index f717284..4b9b8c5 100644
--- a/content/vector/replace.html
+++ b/content/vector/replace.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Replace Elem
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Replace Element
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -596,7 +596,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Replace Element
 </div>
 <div class="callout-body-container callout-body">
 <p>The sub-vector <code>with</code> we are copying from must fit inside the existing bit-vector!<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p>Both methods return a reference to <code>*this</code> so can be chained with other calls.</p>
diff --git a/content/vector/reserve.html b/content/vector/reserve.html
index 78b4162..c69f6f7 100644
--- a/content/vector/reserve.html
+++ b/content/vector/reserve.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Change the C
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Change the Capa
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/resize.html b/content/vector/resize.html
index 99c7cf7..756a5db 100644
--- a/content/vector/resize.html
+++ b/content/vector/resize.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Resize a Bit
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Resize a Bit-Ve
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/riffled.html b/content/vector/riffled.html
index a66f131..c5f433f 100644
--- a/content/vector/riffled.html
+++ b/content/vector/riffled.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Riffling</h1
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Riffling</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/set.html b/content/vector/set.html
index 494e8de..35f2e0b 100644
--- a/content/vector/set.html
+++ b/content/vector/set.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Change All E
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Change All Elem
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -609,7 +609,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Change All Elem
 </div>
 <div class="callout-body-container callout-body">
 <p>The <code>len</code> elements starting at <code>first</code> must fit in the valid range for the bit-vector.<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p>These methods return a reference to <code>*this</code>, so they can be chained with other calls.</p>
diff --git a/content/vector/set_if.html b/content/vector/set_if.html
index 0cb7ad7..2d474df 100644
--- a/content/vector/set_if.html
+++ b/content/vector/set_if.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Conditional
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Conditional Cha
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/shift.html b/content/vector/shift.html
index 865e67c..8672623 100644
--- a/content/vector/shift.html
+++ b/content/vector/shift.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Binary Shift
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Binary Shift Op
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/size.html b/content/vector/size.html
index 5f17c61..bde0cf1 100644
--- a/content/vector/size.html
+++ b/content/vector/size.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Size Queries
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Size Queries</h
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/specials.html b/content/vector/specials.html
index 630678d..bfc3f86 100644
--- a/content/vector/specials.html
+++ b/content/vector/specials.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Some Special
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Some Special Bi
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/stream.html b/content/vector/stream.html
index 0878456..9a566f1 100644
--- a/content/vector/stream.html
+++ b/content/vector/stream.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Stream Opera
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -568,7 +568,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Stream Operator
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/sub.html b/content/vector/sub.html
index b9e994e..bbef0dc 100644
--- a/content/vector/sub.html
+++ b/content/vector/sub.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Extract a Su
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Extract a Sub-V
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -595,7 +595,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Extract a Sub-V
 </div>
 </div>
 <div class="callout-body-container callout-body">
-<p><code>begin</code> has to be a valid index, and <code>abs(len)</code> elements must be available for copying. Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+<p><code>begin</code> has to be a valid index, and <code>abs(len)</code> elements must be available for copying. Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/swap.html b/content/vector/swap.html
index ed6fd22..cf77139 100644
--- a/content/vector/swap.html
+++ b/content/vector/swap.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Swap All Con
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Swap All Conten
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/swap_elements.html b/content/vector/swap_elements.html
index ee41072..e0a928a 100644
--- a/content/vector/swap_elements.html
+++ b/content/vector/swap_elements.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Swap Element
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Swap Elements</
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
@@ -591,7 +591,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Swap Elements</
 </div>
 <div class="callout-body-container callout-body">
 <p>By default, the method does <em>not</em> check whether the indices are in bounds, and if they aren’t, the behavior is undefined (but bound to be bad)!<br>
-Set the <code>BIT_DEBUG</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
+Set the <code>BIT_VERIFY</code> flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.</p>
 </div>
 </div>
 <p><span class="bt">Example</span></p>
diff --git a/content/vector/to_string.html b/content/vector/to_string.html
index 8805f36..71ede75 100644
--- a/content/vector/to_string.html
+++ b/content/vector/to_string.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — String Encod
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -574,7 +574,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — String Encoding
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/trimmed.html b/content/vector/trimmed.html
index 187960a..4f57767 100644
--- a/content/vector/trimmed.html
+++ b/content/vector/trimmed.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Trim Trailin
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Trim Trailing/L
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/vector/unit_floor.html b/content/vector/unit_floor.html
index 4eaaec1..83a29f6 100644
--- a/content/vector/unit_floor.html
+++ b/content/vector/unit_floor.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title"><code>bit::vector</code> — Special Unit
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="../../content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -563,7 +563,7 @@ <h1 class="title d-none d-lg-block"><code>bit::vector</code> — Special Unit Bi
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/content/verify/index.html b/content/verify/index.html
new file mode 100644
index 0000000..cd7f025
--- /dev/null
+++ b/content/verify/index.html
@@ -0,0 +1,1131 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"><head>
+
+<meta charset="utf-8">
+<meta name="generator" content="quarto-1.4.555">
+
+<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
+
+
+<title>Linear Algebra over GF(2) - Verification Checks</title>
+<style>
+code{white-space: pre-wrap;}
+span.smallcaps{font-variant: small-caps;}
+div.columns{display: flex; gap: min(4vw, 1.5em);}
+div.column{flex: auto; overflow-x: auto;}
+div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
+ul.task-list{list-style: none;}
+ul.task-list li input[type="checkbox"] {
+  width: 0.8em;
+  margin: 0 0.8em 0.2em -1em; /* quarto-specific, see https://github.com/quarto-dev/quarto-cli/issues/4556 */ 
+  vertical-align: middle;
+}
+/* CSS for syntax highlighting */
+pre > code.sourceCode { white-space: pre; position: relative; }
+pre > code.sourceCode > span { line-height: 1.25; }
+pre > code.sourceCode > span:empty { height: 1.2em; }
+.sourceCode { overflow: visible; }
+code.sourceCode > span { color: inherit; text-decoration: inherit; }
+div.sourceCode { margin: 1em 0; }
+pre.sourceCode { margin: 0; }
+@media screen {
+div.sourceCode { overflow: auto; }
+}
+@media print {
+pre > code.sourceCode { white-space: pre-wrap; }
+pre > code.sourceCode > span { text-indent: -5em; padding-left: 5em; }
+}
+pre.numberSource code
+  { counter-reset: source-line 0; }
+pre.numberSource code > span
+  { position: relative; left: -4em; counter-increment: source-line; }
+pre.numberSource code > span > a:first-child::before
+  { content: counter(source-line);
+    position: relative; left: -1em; text-align: right; vertical-align: baseline;
+    border: none; display: inline-block;
+    -webkit-touch-callout: none; -webkit-user-select: none;
+    -khtml-user-select: none; -moz-user-select: none;
+    -ms-user-select: none; user-select: none;
+    padding: 0 4px; width: 4em;
+  }
+pre.numberSource { margin-left: 3em;  padding-left: 4px; }
+div.sourceCode
+  {   }
+@media screen {
+pre > code.sourceCode > span > a:first-child::before { text-decoration: underline; }
+}
+</style>
+
+
+<script src="../../site_libs/quarto-nav/quarto-nav.js"></script>
+<script src="../../site_libs/clipboard/clipboard.min.js"></script>
+<script src="../../site_libs/quarto-search/autocomplete.umd.js"></script>
+<script src="../../site_libs/quarto-search/fuse.min.js"></script>
+<script src="../../site_libs/quarto-search/quarto-search.js"></script>
+<meta name="quarto:offset" content="../../">
+<link href="../../content/verify/index.qmd#compiler-flags" rel="next">
+<link href="../../assets/images/logo.jpg" rel="icon" type="image/jpeg">
+<script src="../../site_libs/quarto-html/quarto.js"></script>
+<script src="../../site_libs/quarto-html/popper.min.js"></script>
+<script src="../../site_libs/quarto-html/tippy.umd.min.js"></script>
+<script src="../../site_libs/quarto-html/anchor.min.js"></script>
+<link href="../../site_libs/quarto-html/tippy.css" rel="stylesheet">
+<link href="../../site_libs/quarto-html/quarto-syntax-highlighting.css" rel="stylesheet" id="quarto-text-highlighting-styles">
+<script src="../../site_libs/bootstrap/bootstrap.min.js"></script>
+<link href="../../site_libs/bootstrap/bootstrap-icons.css" rel="stylesheet">
+<link href="../../site_libs/bootstrap/bootstrap.min.css" rel="stylesheet" id="quarto-bootstrap" data-mode="light">
+<script id="quarto-search-options" type="application/json">{
+  "location": "navbar",
+  "copy-button": false,
+  "collapse-after": 3,
+  "panel-placement": "end",
+  "type": "overlay",
+  "limit": 50,
+  "keyboard-shortcut": [
+    "f",
+    "/",
+    "s"
+  ],
+  "show-item-context": false,
+  "language": {
+    "search-no-results-text": "No results",
+    "search-matching-documents-text": "matching documents",
+    "search-copy-link-title": "Copy link to search",
+    "search-hide-matches-text": "Hide additional matches",
+    "search-more-match-text": "more match in this document",
+    "search-more-matches-text": "more matches in this document",
+    "search-clear-button-title": "Clear",
+    "search-text-placeholder": "",
+    "search-detached-cancel-button-title": "Cancel",
+    "search-submit-button-title": "Submit",
+    "search-label": "Search"
+  }
+}</script>
+<script async="" src="https://www.googletagmanager.com/gtag/js?id=G-V57HYKPDW8"></script>
+
+<script type="text/javascript">
+
+window.dataLayer = window.dataLayer || [];
+function gtag(){dataLayer.push(arguments);}
+gtag('js', new Date());
+gtag('config', 'G-V57HYKPDW8', { 'anonymize_ip': true});
+</script>
+
+  <script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
+  <script src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml-full.js" type="text/javascript"></script>
+
+<script type="text/javascript">
+const typesetMath = (el) => {
+  if (window.MathJax) {
+    // MathJax Typeset
+    window.MathJax.typeset([el]);
+  } else if (window.katex) {
+    // KaTeX Render
+    var mathElements = el.getElementsByClassName("math");
+    var macros = [];
+    for (var i = 0; i < mathElements.length; i++) {
+      var texText = mathElements[i].firstChild;
+      if (mathElements[i].tagName == "SPAN") {
+        window.katex.render(texText.data, mathElements[i], {
+          displayMode: mathElements[i].classList.contains('display'),
+          throwOnError: false,
+          macros: macros,
+          fleqn: false
+        });
+      }
+    }
+  }
+}
+window.Quarto = {
+  typesetMath
+};
+</script>
+
+<meta property="og:title" content="Linear Algebra over GF(2) - Verification Checks">
+<meta property="og:description" content="">
+<meta property="og:image" content="https://nessan.github.io/bit/content/verify/assets/images/logo.jpg">
+<meta property="og:site_name" content="Linear Algebra over GF(2)">
+<meta name="twitter:title" content="Linear Algebra over GF(2) - Verification Checks">
+<meta name="twitter:description" content="">
+<meta name="twitter:image" content="https://nessan.github.io/bit/content/verify/assets/images/logo.jpg">
+<meta name="twitter:card" content="summary_large_image">
+</head>
+
+<body class="nav-sidebar floating nav-fixed">
+
+<div id="quarto-search-results"></div>
+  <header id="quarto-header" class="headroom fixed-top">
+    <nav class="navbar navbar-expand-lg " data-bs-theme="dark">
+      <div class="navbar-container container-fluid">
+      <div class="navbar-brand-container mx-auto">
+    <a href="../../index.html" class="navbar-brand navbar-brand-logo">
+    <img src="../../assets/images/logo.jpg" alt="The bit library logo" class="navbar-logo">
+    </a>
+    <a class="navbar-brand" href="../../index.html">
+    <span class="navbar-title">bit</span>
+    </a>
+  </div>
+            <div id="quarto-search" class="" title="Search"></div>
+          <button class="navbar-toggler" type="button" data-bs-toggle="collapse" data-bs-target="#navbarCollapse" aria-controls="navbarCollapse" aria-expanded="false" aria-label="Toggle navigation" onclick="if (window.quartoToggleHeadroom) { window.quartoToggleHeadroom(); }">
+  <span class="navbar-toggler-icon"></span>
+</button>
+          <div class="collapse navbar-collapse" id="navbarCollapse">
+            <ul class="navbar-nav navbar-nav-scroll me-auto">
+  <li class="nav-item">
+    <a class="nav-link active" href="../../index.html" aria-current="page"> 
+<span class="menu-text">Home</span></a>
+  </li>  
+  <li class="nav-item">
+    <a class="nav-link" href="../../content/vector/index.html"> 
+<span class="menu-text">Vectors</span></a>
+  </li>  
+  <li class="nav-item">
+    <a class="nav-link" href="../../content/matrix/index.html"> 
+<span class="menu-text">Matrices</span></a>
+  </li>  
+  <li class="nav-item">
+    <a class="nav-link" href="../../content/polynomial/index.html"> 
+<span class="menu-text">Polynomials</span></a>
+  </li>  
+  <li class="nav-item">
+    <a class="nav-link" href="../../content/notes/index.html"> 
+<span class="menu-text">Tech Notes</span></a>
+  </li>  
+  <li class="nav-item dropdown ">
+    <a class="nav-link dropdown-toggle" href="#" id="nav-menu-more" role="button" data-bs-toggle="dropdown" aria-expanded="false">
+ <span class="menu-text">More</span>
+    </a>
+    <ul class="dropdown-menu" aria-labelledby="nav-menu-more">    
+        <li>
+    <a class="dropdown-item" href="https://github.com/nessan/bit"><i class="bi bi-github" role="img">
+</i> 
+ <span class="dropdown-text">Project Repo</span></a>
+  </li>  
+        <li>
+    <a class="dropdown-item" href="https://github.com/nessan/bit/issues"><i class="bi bi-bug" role="img">
+</i> 
+ <span class="dropdown-text">Report a Bug</span></a>
+  </li>  
+        <li>
+    <a class="dropdown-item" href="https://github.com/nessan/bit/discussions"><i class="bi bi-chat-right-text" role="img">
+</i> 
+ <span class="dropdown-text">Ask a Question</span></a>
+  </li>  
+    </ul>
+  </li>
+</ul>
+          </div> <!-- /navcollapse -->
+          <div class="quarto-navbar-tools">
+    <a href="https://github.com/nessan/bit" title="GitHub repo" class="quarto-navigation-tool px-1" aria-label="GitHub repo"><i class="bi bi-github"></i></a>
+    <a href="https://twitter.com/nezzan" title="" class="quarto-navigation-tool px-1" aria-label="Twitter"><i class="bi bi-twitter"></i></a>
+</div>
+      </div> <!-- /container-fluid -->
+    </nav>
+  <nav class="quarto-secondary-nav">
+    <div class="container-fluid d-flex">
+      <button type="button" class="quarto-btn-toggle btn" data-bs-toggle="collapse" data-bs-target=".quarto-sidebar-collapse-item" aria-controls="quarto-sidebar" aria-expanded="false" aria-label="Toggle sidebar navigation" onclick="if (window.quartoToggleHeadroom) { window.quartoToggleHeadroom(); }">
+        <i class="bi bi-layout-text-sidebar-reverse"></i>
+      </button>
+        <a class="flex-grow-1 no-decor" role="button" data-bs-toggle="collapse" data-bs-target=".quarto-sidebar-collapse-item" aria-controls="quarto-sidebar" aria-expanded="false" aria-label="Toggle sidebar navigation" onclick="if (window.quartoToggleHeadroom) { window.quartoToggleHeadroom(); }">      
+          <h1 class="quarto-secondary-nav-title">Verification Checks</h1>
+        </a>     
+    </div>
+  </nav>
+</header>
+<!-- content -->
+<div id="quarto-content" class="quarto-container page-columns page-rows-contents page-layout-article page-navbar">
+<!-- sidebar -->
+  <nav id="quarto-sidebar" class="sidebar collapse collapse-horizontal quarto-sidebar-collapse-item sidebar-navigation floating overflow-auto">
+    <div class="sidebar-menu-container"> 
+    <ul class="list-unstyled mt-1">
+        <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Overview</span></a>
+  </div>
+</li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-1" aria-expanded="true">
+ <span class="menu-text">Bit-Vectors</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-1" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-1" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/vector/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/vector/index.html#declaration" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Declaration</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/vector/index.html#class-constants-and-types" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Class Constants &amp; Types</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/vector/index.html#instance-methods" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Instance Methods</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/vector/index.html#non-member-functions" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Non-member Functions</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-2" aria-expanded="true">
+ <span class="menu-text">Bit-Matrices</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-2" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-2" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/matrix/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/matrix/index.html#declaration" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Declaration</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/matrix/index.html#class-types" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Class Types</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/matrix/index.html#instance-methods" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Instance Methods</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/matrix/index.html#non-member-functions" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Non-member Functions</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-3" aria-expanded="true">
+ <span class="menu-text">Gaussian Elimination</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-3" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-3" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/gauss/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/gauss/index.html#declaration" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Declaration</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/gauss/index.html#class-types" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Class Types</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/gauss/index.html#instance-methods" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Instance Methods</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/gauss/index.html#non-member-functions" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Non-member Functions</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-4" aria-expanded="true">
+ <span class="menu-text">LU Decomposition</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-4" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-4" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/lu/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/lu/index.html#declaration" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Declaration</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/lu/index.html#class-types" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Class Types</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/lu/index.html#instance-methods" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Instance Methods</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-5" aria-expanded="true">
+ <span class="menu-text">Bit-Polynomials</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-5" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-5" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/polynomial/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/polynomial/index.html#declaration" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Declaration</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/polynomial/index.html#class-constants-and-types" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Class Constants &amp; Types</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/polynomial/index.html#instance-methods" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Instance Methods</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/polynomial/index.html#non-member-functions" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Non-member Functions</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-6" aria-expanded="true">
+ <span class="menu-text">Debugging</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-6" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/verify/index.html" class="sidebar-item-text sidebar-link active">
+ <span class="menu-text">Verifications</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Compiler Flags</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Design Rationale</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="px-0"><hr class="sidebar-divider hi "></li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-7" aria-expanded="true">
+ <span class="menu-text">Technical Notes</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-7" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-7" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/notes/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Introduction</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/notes/gf2.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Working in GF(2)</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/notes/design.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Library Design</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/notes/danilevsky.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Danilevsky’s Method</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../content/notes/reduction.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Polynomial Reduction</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+    </ul>
+    </div>
+</nav>
+<div id="quarto-sidebar-glass" class="quarto-sidebar-collapse-item" data-bs-toggle="collapse" data-bs-target=".quarto-sidebar-collapse-item"></div>
+<!-- margin-sidebar -->
+    <div id="quarto-margin-sidebar" class="sidebar margin-sidebar">
+        <nav id="TOC" role="doc-toc" class="toc-active" data-toc-expanded="99">
+    <h2 id="toc-title">On this page</h2>
+   
+  <ul>
+  <li><a href="#introduction" id="toc-introduction" class="nav-link active" data-scroll-target="#introduction">Introduction</a></li>
+  <li><a href="#compiler-flags" id="toc-compiler-flags" class="nav-link" data-scroll-target="#compiler-flags">Compiler Flags</a></li>
+  <li><a href="#examples" id="toc-examples" class="nav-link" data-scroll-target="#examples">Examples</a></li>
+  <li><a href="#design-rationale" id="toc-design-rationale" class="nav-link" data-scroll-target="#design-rationale">Design Rationale</a>
+  <ul class="collapse">
+  <li><a href="#see-also" id="toc-see-also" class="nav-link" data-scroll-target="#see-also">See Also</a></li>
+  </ul></li>
+  </ul>
+<div class="toc-actions"><ul><li><a href="https://github.com/nessan/bit/edit/main/docs/content/verify/index.qmd" class="toc-action"><i class="bi bi-github"></i>Edit this page</a></li><li><a href="https://github.com/nessan/bit/issues/new/choose" class="toc-action"><i class="bi empty"></i>Report an issue</a></li></ul></div></nav>
+    </div>
+<!-- main -->
+<main class="content" id="quarto-document-content">
+
+<header id="title-block-header" class="quarto-title-block default">
+<div class="quarto-title">
+<h1 class="title d-none d-lg-block">Verification Checks</h1>
+</div>
+
+
+
+<div class="quarto-title-meta">
+
+    
+  
+    
+  </div>
+  
+
+
+</header>
+
+
+<!-- Shortcuts and links used throughout the documentation -->
+<!-- Some math shortcuts we use frequently in the documentation -->
+<div class="hidden">
+<p><span class="math display">\[
+\newcommand{\FF}{\mathbb{F}_2}
+\newcommand{\R}{\mathbb{R}}
+\]</span></p>
+</div>
+<!-- Our verify macro and compiler flag that controls it -->
+<!-- Formatted links to the pages for the bit::vector class -->
+<!-- Formatted links to the pages for the bit::matrix class -->
+<!-- Formatted links to the pages for the bit::gauss class -->
+<!-- Formatted links to the pages for the bit::lu class -->
+<!-- Formatted links to the pages for the bit::polynomial class -->
+<!-- Formatted links to the pages for items in the standard library -->
+<!--Links to other software tools we reference -->
+<!-- Pages and Wikipedia articles referenced in the documentation -->
+<section id="introduction" class="level2">
+<h2 class="anchored" data-anchor-id="introduction">Introduction</h2>
+<p>We have a macro that is used to check a condition and, on failures, cause the program to exit with a customizable message.</p>
+<div class="sourceCode" id="cb1"><pre class="sourceCode cpp code-with-copy"><code class="sourceCode cpp"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a>bit_verify<span class="op">(</span>condition<span class="op">,</span> <span class="op">...)</span></span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>If the <code>BIT_VERIFY</code> flag is set at compile time then <code>condition</code> is checked and if it fails the program exits with a custom message synthesized from the rest of the arguments. If the <code>BIT_VERIFY</code> flag is <em>not</em> set then the macro expands to a no-op.</p>
+<p>Assuming a check is “on”, if <code>condition</code> evaluates to <code>false</code> then <code>bit_verify</code> calls</p>
+<div class="sourceCode" id="cb2"><pre class="sourceCode cpp code-with-copy"><code class="sourceCode cpp"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a>bit_exit<span class="op">(</span>message<span class="op">)</span></span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>The <code>bit_exit(message)</code> macro passes the <code>message</code> and the source code location of the failure to <code>bit::exit(...)</code>. That function prints the source code location of the failure along with the <code>message</code> payload and then <strong>exits</strong> the program.</p>
+<p>The <code>bit::exit</code> function needs source code location parameters (the filename, the line number, and the function name), and the <code>bit_exit</code> macro automatically adds those. You typically use the <code>message</code> argument to print the values of the variables that triggered the failure. The message can be anything that can be formatted using the facilities in <a href="https://en.cppreference.com/w/cpp/utility/format/format"><code>std::format</code></a>.</p>
+<div class="callout callout-style-default callout-tip callout-titled">
+<div class="callout-header d-flex align-content-center">
+<div class="callout-icon-container">
+<i class="callout-icon"></i>
+</div>
+<div class="callout-title-container flex-fill">
+Microsoft compiler
+</div>
+</div>
+<div class="callout-body-container callout-body">
+<p>Microsoft’s old traditional preprocessor is not happy with these macros, but their newer cross-platform compatible one is fine. Add the <code>/Zc:preprocessor</code> flag to use that upgrade at compile time. Our <code>CMake</code> module <code>compiler_init</code> does that automatically for you.</p>
+</div>
+</div>
+</section>
+<section id="compiler-flags" class="level2">
+<h2 class="anchored" data-anchor-id="compiler-flags">Compiler Flags</h2>
+<div class="sourceCode" id="cb3"><pre class="sourceCode cpp code-with-copy"><code class="sourceCode cpp"><span id="cb3-1"><a href="#cb3-1" aria-hidden="true" tabindex="-1"></a>BIT_VERIFY</span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>If you set the <code>BIT_VERIFY</code> flag, the library will perform demanding but potentially useful safety assertions on indices, size equality checks, etc. Otherwise, all the <code>bit_verify</code> calls are no-ops</p>
+</section>
+<section id="examples" class="level2">
+<h2 class="anchored" data-anchor-id="examples">Examples</h2>
+<p><span class="bt">Example — Snippet from the <code>bit::vector&lt;&gt;::set</code> method</span></p>
+<div class="sourceCode" id="cb4"><pre class="sourceCode cpp code-with-copy"><code class="sourceCode cpp"><span id="cb4-1"><a href="#cb4-1" aria-hidden="true" tabindex="-1"></a><span class="co">/// </span><span class="an">@brief</span><span class="co"> Set the element at index `i` to 1.</span></span>
+<span id="cb4-2"><a href="#cb4-2" aria-hidden="true" tabindex="-1"></a><span class="kw">constexpr</span> bit<span class="op">::</span>vector <span class="op">&amp;</span>set<span class="op">(</span><span class="bu">std::</span>size_t i<span class="op">)</span></span>
+<span id="cb4-3"><a href="#cb4-3" aria-hidden="true" tabindex="-1"></a><span class="op">{</span></span>
+<span id="cb4-4"><a href="#cb4-4" aria-hidden="true" tabindex="-1"></a>    bit_verify<span class="op">(</span>i <span class="op">&lt;</span> <span class="va">m_size</span><span class="op">,</span> <span class="st">"index `i` = "</span> <span class="op">&lt;&lt;</span> i <span class="op">&lt;&lt;</span> <span class="st">" must be &lt; `m_size` which is "</span> <span class="op">&lt;&lt;</span> <span class="va">m_size</span><span class="op">);</span></span>
+<span id="cb4-5"><a href="#cb4-5" aria-hidden="true" tabindex="-1"></a>    <span class="op">...</span></span>
+<span id="cb4-6"><a href="#cb4-6" aria-hidden="true" tabindex="-1"></a><span class="op">}</span></span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>Here <code>m_size</code> is holds the size of the vector — so we must have <code>i &lt; m_size</code></p>
+<p>To check every element access, set the <code>BIT_VERIFY</code> flag during compiles. If the assertion fails, the program exits with an error message that gives the offending values.</p>
+<p>The <code>bit_verify</code> line expands to <em>nothing</em> if the <code>BIT_VERIFY</code> flag is not set during compiles.</p>
+<p><span class="bt">Example — Message from an assertion failure</span></p>
+<div class="sourceCode" id="annotated-cell-5"><pre class="sourceCode cpp code-annotation-code code-with-copy code-annotated"><code class="sourceCode cpp"><a class="code-annotation-anchor" data-target-cell="annotated-cell-5" data-target-annotation="1" onclick="event.preventDefault();">1</a><span id="annotated-cell-5-1" class="code-annotation-target"><a href="#annotated-cell-5-1" aria-hidden="true" tabindex="-1"></a><span class="pp">#define BIT_VERIFY</span></span>
+<span id="annotated-cell-5-2"><a href="#annotated-cell-5-2" aria-hidden="true" tabindex="-1"></a><span class="pp">#include </span><span class="im">&lt;bit/bit.h&gt;</span></span>
+<span id="annotated-cell-5-3"><a href="#annotated-cell-5-3" aria-hidden="true" tabindex="-1"></a><span class="dt">int</span> main<span class="op">()</span></span>
+<span id="annotated-cell-5-4"><a href="#annotated-cell-5-4" aria-hidden="true" tabindex="-1"></a><span class="op">{</span></span>
+<a class="code-annotation-anchor" data-target-cell="annotated-cell-5" data-target-annotation="2" onclick="event.preventDefault();">2</a><span id="annotated-cell-5-5" class="code-annotation-target"><a href="#annotated-cell-5-5" aria-hidden="true" tabindex="-1"></a>    <span class="bu">std::</span>size_t n <span class="op">=</span> <span class="dv">12</span><span class="op">;</span></span>
+<span id="annotated-cell-5-6"><a href="#annotated-cell-5-6" aria-hidden="true" tabindex="-1"></a>    bit<span class="op">::</span>vector<span class="op">&lt;&gt;</span> v<span class="op">(</span>n<span class="op">);</span></span>
+<a class="code-annotation-anchor" data-target-cell="annotated-cell-5" data-target-annotation="3" onclick="event.preventDefault();">3</a><span id="annotated-cell-5-7" class="code-annotation-target"><a href="#annotated-cell-5-7" aria-hidden="true" tabindex="-1"></a>    v<span class="op">.</span>set<span class="op">(</span>n<span class="op">);</span></span>
+<span id="annotated-cell-5-8"><a href="#annotated-cell-5-8" aria-hidden="true" tabindex="-1"></a>    <span class="bu">std::</span>cout <span class="op">&lt;&lt;</span> v <span class="op">&lt;&lt;</span> <span class="st">"</span><span class="sc">\n</span><span class="st">"</span><span class="op">;</span></span>
+<span id="annotated-cell-5-9"><a href="#annotated-cell-5-9" aria-hidden="true" tabindex="-1"></a><span class="op">}</span></span><div class="code-annotation-gutter-bg"></div><div class="code-annotation-gutter"></div></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<dl class="code-annotation-container-grid">
+<dt data-target-cell="annotated-cell-5" data-target-annotation="1">1</dt>
+<dd>
+<span data-code-cell="annotated-cell-5" data-code-lines="1" data-code-annotation="1">For the sake of the example we added code to make sure the <code>bit_verify</code> is triggered. In normal usage, the flag is passed through the compiler command line.</span>
+</dd>
+<dt data-target-cell="annotated-cell-5" data-target-annotation="2">2</dt>
+<dd>
+<span data-code-cell="annotated-cell-5" data-code-lines="5" data-code-annotation="2">Construct a vector of size 12 and then attempt to set the “last” element.</span>
+</dd>
+<dt data-target-cell="annotated-cell-5" data-target-annotation="3">3</dt>
+<dd>
+<span data-code-cell="annotated-cell-5" data-code-lines="7" data-code-annotation="3">A deliberate but typical <em>off-by-one</em> index error as the valid indices are from 0 to <code>n-1</code>, which is 11.</span>
+</dd>
+</dl>
+<p><span class="bt">Output</span></p>
+<div class="sourceCode" id="cb5"><pre class="sourceCode sh code-with-copy"><code class="sourceCode bash"><span id="cb5-1"><a href="#cb5-1" aria-hidden="true" tabindex="-1"></a><span class="ex">BIT</span> VERIFY FAILED:</span>
+<span id="cb5-2"><a href="#cb5-2" aria-hidden="true" tabindex="-1"></a><span class="ex">Function</span> <span class="st">'set'</span> <span class="er">(</span><span class="ex">vector.h,</span> line 911<span class="kw">)</span><span class="bu">:</span></span>
+<span id="cb5-3"><a href="#cb5-3" aria-hidden="true" tabindex="-1"></a><span class="ex">Statement</span> <span class="st">'i &lt; m_size'</span> is NOT true: Index i = 12 must be <span class="op">&lt;</span> <span class="kw">`</span><span class="ex">m_size</span><span class="kw">`</span> = 12</span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>The program will then exit.</p>
+</section>
+<section id="design-rationale" class="level2">
+<h2 class="anchored" data-anchor-id="design-rationale">Design Rationale</h2>
+<p>In the development cycle, it can be helpful to range-check indices and so on. However, those checks are expensive and can slow down numerical code by orders of magnitude. Therefore, we don’t want there to be any chance that those verifications are accidentally left “on” in the production code. Our <code>bit_verify(...)</code> macro covers this type of verification. Turning on the checks requires the programmer to take a specific action — namely, she must set the <code>BIT_VERIFY</code> flag during compile time.</p>
+<p>For example, here is a pre-condition from a hypothetical <code>dot(Vector u, Vector v)</code> function:</p>
+<div class="sourceCode" id="cb6"><pre class="sourceCode cpp code-with-copy"><code class="sourceCode cpp"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a>bit_verify<span class="op">(</span>u<span class="op">.</span>size<span class="op">()</span> <span class="op">==</span> v<span class="op">.</span>size<span class="op">(),</span> <span class="st">"Vector sizes </span><span class="sc">{}</span><span class="st"> and </span><span class="sc">{}</span><span class="st"> DO NOT match!"</span><span class="op">,</span> u<span class="op">.</span>size<span class="op">(),</span> v<span class="op">.</span>size<span class="op">());</span></span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<p>This code checks that the two vector arguments have equal length — a necessary constraint for the dot product operation to make sense. If the requirement is not satisfied, the code will exit with an informative message that includes the size of the two vectors.</p>
+<p>The check here is <strong>off</strong> by default, and you need to do something special (i.e., define the <code>BIT_VERIFY</code> flag at compile time) to enable it. The idea is that production code may do many of these dot products, and we do not generally want to pay for the check. However, enabling these sorts of checks may be very useful during development.</p>
+<p>The <code>bit_verify(...)</code> macro expands to nothing <strong>unless</strong> you set the <code>BIT_VERIFY</code> flag at compile time.</p>
+<div class="callout callout-style-default callout-note callout-titled">
+<div class="callout-header d-flex align-content-center">
+<div class="callout-icon-container">
+<i class="callout-icon"></i>
+</div>
+<div class="callout-title-container flex-fill">
+Macro-land
+</div>
+</div>
+<div class="callout-body-container callout-body">
+<p>We are in macro land here, so there are no namespaces. Typically, macros have names in caps, but the standard <code>assert</code> does not follow that custom, so neither does <code>bit_verify</code>.</p>
+</div>
+</div>
+<section id="see-also" class="level3">
+<h3 class="anchored" data-anchor-id="see-also">See Also</h3>
+<p><a href="https://www.cplusplus.com/reference/cassert/assert/"><code>assert</code></a></p>
+
+
+</section>
+</section>
+
+<a onclick="window.scrollTo(0, 0); return false;" role="button" id="quarto-back-to-top"><i class="bi bi-arrow-up"></i> Back to top</a></main> <!-- /main -->
+<script id="quarto-html-after-body" type="application/javascript">
+window.document.addEventListener("DOMContentLoaded", function (event) {
+  const toggleBodyColorMode = (bsSheetEl) => {
+    const mode = bsSheetEl.getAttribute("data-mode");
+    const bodyEl = window.document.querySelector("body");
+    if (mode === "dark") {
+      bodyEl.classList.add("quarto-dark");
+      bodyEl.classList.remove("quarto-light");
+    } else {
+      bodyEl.classList.add("quarto-light");
+      bodyEl.classList.remove("quarto-dark");
+    }
+  }
+  const toggleBodyColorPrimary = () => {
+    const bsSheetEl = window.document.querySelector("link#quarto-bootstrap");
+    if (bsSheetEl) {
+      toggleBodyColorMode(bsSheetEl);
+    }
+  }
+  toggleBodyColorPrimary();  
+  const icon = "";
+  const anchorJS = new window.AnchorJS();
+  anchorJS.options = {
+    placement: 'right',
+    icon: icon
+  };
+  anchorJS.add('.anchored');
+  const isCodeAnnotation = (el) => {
+    for (const clz of el.classList) {
+      if (clz.startsWith('code-annotation-')) {                     
+        return true;
+      }
+    }
+    return false;
+  }
+  const clipboard = new window.ClipboardJS('.code-copy-button', {
+    text: function(trigger) {
+      const codeEl = trigger.previousElementSibling.cloneNode(true);
+      for (const childEl of codeEl.children) {
+        if (isCodeAnnotation(childEl)) {
+          childEl.remove();
+        }
+      }
+      return codeEl.innerText;
+    }
+  });
+  clipboard.on('success', function(e) {
+    // button target
+    const button = e.trigger;
+    // don't keep focus
+    button.blur();
+    // flash "checked"
+    button.classList.add('code-copy-button-checked');
+    var currentTitle = button.getAttribute("title");
+    button.setAttribute("title", "Copied!");
+    let tooltip;
+    if (window.bootstrap) {
+      button.setAttribute("data-bs-toggle", "tooltip");
+      button.setAttribute("data-bs-placement", "left");
+      button.setAttribute("data-bs-title", "Copied!");
+      tooltip = new bootstrap.Tooltip(button, 
+        { trigger: "manual", 
+          customClass: "code-copy-button-tooltip",
+          offset: [0, -8]});
+      tooltip.show();    
+    }
+    setTimeout(function() {
+      if (tooltip) {
+        tooltip.hide();
+        button.removeAttribute("data-bs-title");
+        button.removeAttribute("data-bs-toggle");
+        button.removeAttribute("data-bs-placement");
+      }
+      button.setAttribute("title", currentTitle);
+      button.classList.remove('code-copy-button-checked');
+    }, 1000);
+    // clear code selection
+    e.clearSelection();
+  });
+    var localhostRegex = new RegExp(/^(?:http|https):\/\/localhost\:?[0-9]*\//);
+    var mailtoRegex = new RegExp(/^mailto:/);
+      var filterRegex = new RegExp("https:\/\/nessan\.github\.io\/bit");
+    var isInternal = (href) => {
+        return filterRegex.test(href) || localhostRegex.test(href) || mailtoRegex.test(href);
+    }
+    // Inspect non-navigation links and adorn them if external
+ 	var links = window.document.querySelectorAll('a[href]:not(.nav-link):not(.navbar-brand):not(.toc-action):not(.sidebar-link):not(.sidebar-item-toggle):not(.pagination-link):not(.no-external):not([aria-hidden]):not(.dropdown-item):not(.quarto-navigation-tool)');
+    for (var i=0; i<links.length; i++) {
+      const link = links[i];
+      if (!isInternal(link.href)) {
+        // undo the damage that might have been done by quarto-nav.js in the case of
+        // links that we want to consider external
+        if (link.dataset.originalHref !== undefined) {
+          link.href = link.dataset.originalHref;
+        }
+      }
+    }
+  function tippyHover(el, contentFn, onTriggerFn, onUntriggerFn) {
+    const config = {
+      allowHTML: true,
+      maxWidth: 500,
+      delay: 100,
+      arrow: false,
+      appendTo: function(el) {
+          return el.parentElement;
+      },
+      interactive: true,
+      interactiveBorder: 10,
+      theme: 'quarto',
+      placement: 'bottom-start',
+    };
+    if (contentFn) {
+      config.content = contentFn;
+    }
+    if (onTriggerFn) {
+      config.onTrigger = onTriggerFn;
+    }
+    if (onUntriggerFn) {
+      config.onUntrigger = onUntriggerFn;
+    }
+    window.tippy(el, config); 
+  }
+  const noterefs = window.document.querySelectorAll('a[role="doc-noteref"]');
+  for (var i=0; i<noterefs.length; i++) {
+    const ref = noterefs[i];
+    tippyHover(ref, function() {
+      // use id or data attribute instead here
+      let href = ref.getAttribute('data-footnote-href') || ref.getAttribute('href');
+      try { href = new URL(href).hash; } catch {}
+      const id = href.replace(/^#\/?/, "");
+      const note = window.document.getElementById(id);
+      if (note) {
+        return note.innerHTML;
+      } else {
+        return "";
+      }
+    });
+  }
+  const xrefs = window.document.querySelectorAll('a.quarto-xref');
+  const processXRef = (id, note) => {
+    // Strip column container classes
+    const stripColumnClz = (el) => {
+      el.classList.remove("page-full", "page-columns");
+      if (el.children) {
+        for (const child of el.children) {
+          stripColumnClz(child);
+        }
+      }
+    }
+    stripColumnClz(note)
+    if (id === null || id.startsWith('sec-')) {
+      // Special case sections, only their first couple elements
+      const container = document.createElement("div");
+      if (note.children && note.children.length > 2) {
+        container.appendChild(note.children[0].cloneNode(true));
+        for (let i = 1; i < note.children.length; i++) {
+          const child = note.children[i];
+          if (child.tagName === "P" && child.innerText === "") {
+            continue;
+          } else {
+            container.appendChild(child.cloneNode(true));
+            break;
+          }
+        }
+        if (window.Quarto?.typesetMath) {
+          window.Quarto.typesetMath(container);
+        }
+        return container.innerHTML
+      } else {
+        if (window.Quarto?.typesetMath) {
+          window.Quarto.typesetMath(note);
+        }
+        return note.innerHTML;
+      }
+    } else {
+      // Remove any anchor links if they are present
+      const anchorLink = note.querySelector('a.anchorjs-link');
+      if (anchorLink) {
+        anchorLink.remove();
+      }
+      if (window.Quarto?.typesetMath) {
+        window.Quarto.typesetMath(note);
+      }
+      // TODO in 1.5, we should make sure this works without a callout special case
+      if (note.classList.contains("callout")) {
+        return note.outerHTML;
+      } else {
+        return note.innerHTML;
+      }
+    }
+  }
+  for (var i=0; i<xrefs.length; i++) {
+    const xref = xrefs[i];
+    tippyHover(xref, undefined, function(instance) {
+      instance.disable();
+      let url = xref.getAttribute('href');
+      let hash = undefined; 
+      if (url.startsWith('#')) {
+        hash = url;
+      } else {
+        try { hash = new URL(url).hash; } catch {}
+      }
+      if (hash) {
+        const id = hash.replace(/^#\/?/, "");
+        const note = window.document.getElementById(id);
+        if (note !== null) {
+          try {
+            const html = processXRef(id, note.cloneNode(true));
+            instance.setContent(html);
+          } finally {
+            instance.enable();
+            instance.show();
+          }
+        } else {
+          // See if we can fetch this
+          fetch(url.split('#')[0])
+          .then(res => res.text())
+          .then(html => {
+            const parser = new DOMParser();
+            const htmlDoc = parser.parseFromString(html, "text/html");
+            const note = htmlDoc.getElementById(id);
+            if (note !== null) {
+              const html = processXRef(id, note);
+              instance.setContent(html);
+            } 
+          }).finally(() => {
+            instance.enable();
+            instance.show();
+          });
+        }
+      } else {
+        // See if we can fetch a full url (with no hash to target)
+        // This is a special case and we should probably do some content thinning / targeting
+        fetch(url)
+        .then(res => res.text())
+        .then(html => {
+          const parser = new DOMParser();
+          const htmlDoc = parser.parseFromString(html, "text/html");
+          const note = htmlDoc.querySelector('main.content');
+          if (note !== null) {
+            // This should only happen for chapter cross references
+            // (since there is no id in the URL)
+            // remove the first header
+            if (note.children.length > 0 && note.children[0].tagName === "HEADER") {
+              note.children[0].remove();
+            }
+            const html = processXRef(null, note);
+            instance.setContent(html);
+          } 
+        }).finally(() => {
+          instance.enable();
+          instance.show();
+        });
+      }
+    }, function(instance) {
+    });
+  }
+      let selectedAnnoteEl;
+      const selectorForAnnotation = ( cell, annotation) => {
+        let cellAttr = 'data-code-cell="' + cell + '"';
+        let lineAttr = 'data-code-annotation="' +  annotation + '"';
+        const selector = 'span[' + cellAttr + '][' + lineAttr + ']';
+        return selector;
+      }
+      const selectCodeLines = (annoteEl) => {
+        const doc = window.document;
+        const targetCell = annoteEl.getAttribute("data-target-cell");
+        const targetAnnotation = annoteEl.getAttribute("data-target-annotation");
+        const annoteSpan = window.document.querySelector(selectorForAnnotation(targetCell, targetAnnotation));
+        const lines = annoteSpan.getAttribute("data-code-lines").split(",");
+        const lineIds = lines.map((line) => {
+          return targetCell + "-" + line;
+        })
+        let top = null;
+        let height = null;
+        let parent = null;
+        if (lineIds.length > 0) {
+            //compute the position of the single el (top and bottom and make a div)
+            const el = window.document.getElementById(lineIds[0]);
+            top = el.offsetTop;
+            height = el.offsetHeight;
+            parent = el.parentElement.parentElement;
+          if (lineIds.length > 1) {
+            const lastEl = window.document.getElementById(lineIds[lineIds.length - 1]);
+            const bottom = lastEl.offsetTop + lastEl.offsetHeight;
+            height = bottom - top;
+          }
+          if (top !== null && height !== null && parent !== null) {
+            // cook up a div (if necessary) and position it 
+            let div = window.document.getElementById("code-annotation-line-highlight");
+            if (div === null) {
+              div = window.document.createElement("div");
+              div.setAttribute("id", "code-annotation-line-highlight");
+              div.style.position = 'absolute';
+              parent.appendChild(div);
+            }
+            div.style.top = top - 2 + "px";
+            div.style.height = height + 4 + "px";
+            div.style.left = 0;
+            let gutterDiv = window.document.getElementById("code-annotation-line-highlight-gutter");
+            if (gutterDiv === null) {
+              gutterDiv = window.document.createElement("div");
+              gutterDiv.setAttribute("id", "code-annotation-line-highlight-gutter");
+              gutterDiv.style.position = 'absolute';
+              const codeCell = window.document.getElementById(targetCell);
+              const gutter = codeCell.querySelector('.code-annotation-gutter');
+              gutter.appendChild(gutterDiv);
+            }
+            gutterDiv.style.top = top - 2 + "px";
+            gutterDiv.style.height = height + 4 + "px";
+          }
+          selectedAnnoteEl = annoteEl;
+        }
+      };
+      const unselectCodeLines = () => {
+        const elementsIds = ["code-annotation-line-highlight", "code-annotation-line-highlight-gutter"];
+        elementsIds.forEach((elId) => {
+          const div = window.document.getElementById(elId);
+          if (div) {
+            div.remove();
+          }
+        });
+        selectedAnnoteEl = undefined;
+      };
+        // Handle positioning of the toggle
+    window.addEventListener(
+      "resize",
+      throttle(() => {
+        elRect = undefined;
+        if (selectedAnnoteEl) {
+          selectCodeLines(selectedAnnoteEl);
+        }
+      }, 10)
+    );
+    function throttle(fn, ms) {
+    let throttle = false;
+    let timer;
+      return (...args) => {
+        if(!throttle) { // first call gets through
+            fn.apply(this, args);
+            throttle = true;
+        } else { // all the others get throttled
+            if(timer) clearTimeout(timer); // cancel #2
+            timer = setTimeout(() => {
+              fn.apply(this, args);
+              timer = throttle = false;
+            }, ms);
+        }
+      };
+    }
+      // Attach click handler to the DT
+      const annoteDls = window.document.querySelectorAll('dt[data-target-cell]');
+      for (const annoteDlNode of annoteDls) {
+        annoteDlNode.addEventListener('click', (event) => {
+          const clickedEl = event.target;
+          if (clickedEl !== selectedAnnoteEl) {
+            unselectCodeLines();
+            const activeEl = window.document.querySelector('dt[data-target-cell].code-annotation-active');
+            if (activeEl) {
+              activeEl.classList.remove('code-annotation-active');
+            }
+            selectCodeLines(clickedEl);
+            clickedEl.classList.add('code-annotation-active');
+          } else {
+            // Unselect the line
+            unselectCodeLines();
+            clickedEl.classList.remove('code-annotation-active');
+          }
+        });
+      }
+  const findCites = (el) => {
+    const parentEl = el.parentElement;
+    if (parentEl) {
+      const cites = parentEl.dataset.cites;
+      if (cites) {
+        return {
+          el,
+          cites: cites.split(' ')
+        };
+      } else {
+        return findCites(el.parentElement)
+      }
+    } else {
+      return undefined;
+    }
+  };
+  var bibliorefs = window.document.querySelectorAll('a[role="doc-biblioref"]');
+  for (var i=0; i<bibliorefs.length; i++) {
+    const ref = bibliorefs[i];
+    const citeInfo = findCites(ref);
+    if (citeInfo) {
+      tippyHover(citeInfo.el, function() {
+        var popup = window.document.createElement('div');
+        citeInfo.cites.forEach(function(cite) {
+          var citeDiv = window.document.createElement('div');
+          citeDiv.classList.add('hanging-indent');
+          citeDiv.classList.add('csl-entry');
+          var biblioDiv = window.document.getElementById('ref-' + cite);
+          if (biblioDiv) {
+            citeDiv.innerHTML = biblioDiv.innerHTML;
+          }
+          popup.appendChild(citeDiv);
+        });
+        return popup.innerHTML;
+      });
+    }
+  }
+});
+</script>
+<nav class="page-navigation">
+  <div class="nav-page nav-page-previous">
+  </div>
+  <div class="nav-page nav-page-next">
+      <a href="../../content/verify/index.html#compiler-flags" class="pagination-link" aria-label="Compiler Flags">
+        <span class="nav-page-text">Compiler Flags</span> <i class="bi bi-arrow-right-short"></i>
+      </a>
+  </div>
+</nav>
+</div> <!-- /content -->
+<footer class="footer">
+  <div class="nav-footer">
+    <div class="nav-footer-left">
+<p>Copyright (c) Nessan Fitzmaurice</p>
+</div>   
+    <div class="nav-footer-center">
+<p>Project is under the MIT License</p>
+<div class="toc-actions d-sm-block d-md-none"><ul><li><a href="https://github.com/nessan/bit/edit/main/docs/content/verify/index.qmd" class="toc-action"><i class="bi bi-github"></i>Edit this page</a></li><li><a href="https://github.com/nessan/bit/issues/new/choose" class="toc-action"><i class="bi empty"></i>Report an issue</a></li></ul></div></div>
+    <div class="nav-footer-right">
+      <ul class="footer-items list-unstyled">
+    <li class="nav-item compact">
+    <a class="nav-link" href="https://github.com/nessan/bit">
+      <i class="bi bi-github" role="img" aria-label="GitHub Repo">
+</i> 
+    </a>
+  </li>  
+    <li class="nav-item compact">
+    <a class="nav-link" href="https://twitter.com/nezzan">
+      <i class="bi bi-twitter" role="img" aria-label="Twitter">
+</i> 
+    </a>
+  </li>  
+</ul>
+    </div>
+  </div>
+</footer>
+
+
+
+
+</body></html>
\ No newline at end of file
diff --git a/index.html b/index.html
index 91bc6c3..f0774e9 100644
--- a/index.html
+++ b/index.html
@@ -459,19 +459,19 @@ <h1 class="quarto-secondary-nav-title">The <code>bit</code>Library</h1>
       <ul id="quarto-sidebar-section-6" class="collapse list-unstyled sidebar-section depth1 show">  
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="./content/bit_assertion/index.html" class="sidebar-item-text sidebar-link">
- <span class="menu-text">Assertions</span></a>
+  <a href="./content/verify/index.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Verifications</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="./content/bit_assertion/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
+  <a href="./content/verify/index.html#compiler-flags" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Compiler Flags</span></a>
   </div>
 </li>
           <li class="sidebar-item">
   <div class="sidebar-item-container"> 
-  <a href="./content/bit_assertion/index.html#design-rationale" class="sidebar-item-text sidebar-link">
+  <a href="./content/verify/index.html#design-rationale" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Design Rationale</span></a>
   </div>
 </li>
@@ -572,7 +572,7 @@ <h1 class="title d-none d-lg-block">The <code>bit</code>Library</h1>
 \newcommand{\R}{\mathbb{R}}
 \]</span></p>
 </div>
-<!-- Our assertion macros and compiler flags that control them -->
+<!-- Our verify macro and compiler flag that controls it -->
 <!-- Formatted links to the pages for the bit::vector class -->
 <!-- Formatted links to the pages for the bit::matrix class -->
 <!-- Formatted links to the pages for the bit::gauss class -->
diff --git a/search.json b/search.json
index fcc496a..30505e4 100644
--- a/search.json
+++ b/search.json
@@ -77,7 +77,7 @@
     "href": "content/matrix/logical-op.html",
     "title": "bit::matrix — Logical Operators",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nMethods to perform element-by-element binary AND, XOR, OR, +, -, * between two equal sized bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Alloc&gt;\nconstexpr bit::matrix&lt;Block, Alloc&gt;\noperator&(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n1          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator^(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n2          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator|(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n3          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator+(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n4          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator-(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n5          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator*(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n6          const bit::matrix&lt;Block, Alloc&gt; &rhs);\n\n1\n\nReturns a bit-matrix, the binary AND of rhs & lhs.\n\n2\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\n\n3\n\nReturns a bit-matrix, the binary OR of rhs & lhs.\n\n4\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\nIn \\(\\FF\\), addition corresponds to XOR.\n\n5\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\nIn \\(\\FF\\), subtraction corresponds to XOR.\n\n6\n\nReturns a bit-matrix, the binary AND of rhs & lhs.\nIn \\(\\FF\\), multiplication corresponds to AND.\n\n\n\n\n\n\n\n\nDimensions must match\n\n\n\nThe two bit-matrices in question must have the same dimensions. Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(4,[](std::size_t i, std::size_t j) { return (i + j) % 2; });\n    auto m2 = bit::matrix&lt;&gt;::ones(4);\n\n    std::cout &lt;&lt; \"m1:\\n\" &lt;&lt; m1  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m2:\\n\" &lt;&lt; m2  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 & m2:\\n\" &lt;&lt; (m1 & m2) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 | m2:\\n\" &lt;&lt; (m1 | m2) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 ^ m2:\\n\" &lt;&lt; (m1 ^ m2) &lt;&lt; '\\n';\n}\nOutput\nm1:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 & m2:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm1 | m2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 ^ m2:\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n\nSee Also\nmatrix::operator&=\nmatrix::operator|=\nmatrix::operator^=\nmatrix::operator+=\nmatrix::operator-=\nmatrix::operator*=\nmatrix::operator~\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nMethods to perform element-by-element binary AND, XOR, OR, +, -, * between two equal sized bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Alloc&gt;\nconstexpr bit::matrix&lt;Block, Alloc&gt;\noperator&(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n1          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator^(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n2          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator|(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n3          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator+(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n4          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator-(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n5          const bit::matrix&lt;Block, Alloc&gt; &rhs);\noperator*(const bit::matrix&lt;Block, Alloc&gt; &lhs,\n6          const bit::matrix&lt;Block, Alloc&gt; &rhs);\n\n1\n\nReturns a bit-matrix, the binary AND of rhs & lhs.\n\n2\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\n\n3\n\nReturns a bit-matrix, the binary OR of rhs & lhs.\n\n4\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\nIn \\(\\FF\\), addition corresponds to XOR.\n\n5\n\nReturns a bit-matrix, the binary XOR of rhs & lhs.\nIn \\(\\FF\\), subtraction corresponds to XOR.\n\n6\n\nReturns a bit-matrix, the binary AND of rhs & lhs.\nIn \\(\\FF\\), multiplication corresponds to AND.\n\n\n\n\n\n\n\n\nDimensions must match\n\n\n\nThe two bit-matrices in question must have the same dimensions. Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(4,[](std::size_t i, std::size_t j) { return (i + j) % 2; });\n    auto m2 = bit::matrix&lt;&gt;::ones(4);\n\n    std::cout &lt;&lt; \"m1:\\n\" &lt;&lt; m1  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m2:\\n\" &lt;&lt; m2  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 & m2:\\n\" &lt;&lt; (m1 & m2) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 | m2:\\n\" &lt;&lt; (m1 | m2) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 ^ m2:\\n\" &lt;&lt; (m1 ^ m2) &lt;&lt; '\\n';\n}\nOutput\nm1:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 & m2:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm1 | m2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 ^ m2:\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n\nSee Also\nmatrix::operator&=\nmatrix::operator|=\nmatrix::operator^=\nmatrix::operator+=\nmatrix::operator-=\nmatrix::operator*=\nmatrix::operator~\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/print.html",
@@ -105,14 +105,14 @@
     "href": "content/matrix/pow.html",
     "title": "bit::matrix — Powers of a Bit-Matrix",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods that raise a square bit-matrix to a power \\(n\\) or \\(2^n\\).\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr matrix&lt;Block, Allocator&gt;\n1pow(const matrix&lt;Block, Allocator&gt; &M, std::size_t n);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr matrix&lt;Block, Allocator&gt;\n2pow2(const matrix&lt;Block, Allocator&gt; &M, std::size_t n);\n\n1\n\nReturns \\(M^n\\).\n\n2\n\nReturns \\(M^{2^n}\\).\n\n\nFor example, we can raise \\(M\\) to the power \\(2^{128}\\), which is not representable as a typical std::size_t.\nWe use repeated squaring to compute the powers efficiently. It is also worth noting that all arithmetic in \\(\\FF\\) is mod 2, so there are no overflow issues even for large \\(n\\).\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and the bit_assertion macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto M = bit::matrix&lt;&gt;::random(4);\n    std::cout &lt;&lt; \"M:\\n\"             &lt;&lt; M            &lt;&lt; '\\n';\n1    std::cout &lt;&lt; \"M^2:\\n\"           &lt;&lt; pow(M,2)     &lt;&lt; '\\n';\n2    std::cout &lt;&lt; \"M^{256}:\\n\"       &lt;&lt; pow(M,256)   &lt;&lt; '\\n';\n3    std::cout &lt;&lt; \"M^{2^8}:\\n\"       &lt;&lt; pow2(M,8)    &lt;&lt; '\\n';\n4    std::cout &lt;&lt; \"M^{2^{100}}:\\n\"   &lt;&lt; pow2(M,100)  &lt;&lt; '\\n';\n}\n\n1\n\nSimple square of a small random bit-matrix.\n\n2\n\nRaise to the power \\(256\\) using pow.\n\n3\n\nRaise to the power \\(2^8 = 256\\) using pow2.\n\n4\n\nRaise to the power \\(2^{100} = 1,267,650,600,228,229,401,496,703,205,376\\).\n\n\nOutput\nM:\n│1 0 1 1│\n│1 1 0 1│\n│0 0 0 1│\n│1 1 1 1│\nM^2:\n│0 1 0 1│\n│1 0 0 1│\n│1 1 1 1│\n│1 0 0 0│\nM^{256}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\nM^{2^8}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\nM^{2^{100}}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods that raise a square bit-matrix to a power \\(n\\) or \\(2^n\\).\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr matrix&lt;Block, Allocator&gt;\n1pow(const matrix&lt;Block, Allocator&gt; &M, std::size_t n);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr matrix&lt;Block, Allocator&gt;\n2pow2(const matrix&lt;Block, Allocator&gt; &M, std::size_t n);\n\n1\n\nReturns \\(M^n\\).\n\n2\n\nReturns \\(M^{2^n}\\).\n\n\nFor example, we can raise \\(M\\) to the power \\(2^{128}\\), which is not representable as a typical std::size_t.\nWe use repeated squaring to compute the powers efficiently. It is also worth noting that all arithmetic in \\(\\FF\\) is mod 2, so there are no overflow issues even for large \\(n\\).\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and, if the BIT_VERIFY flag is set at compile time, the bit_verify macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto M = bit::matrix&lt;&gt;::random(4);\n    std::cout &lt;&lt; \"M:\\n\"             &lt;&lt; M            &lt;&lt; '\\n';\n1    std::cout &lt;&lt; \"M^2:\\n\"           &lt;&lt; pow(M,2)     &lt;&lt; '\\n';\n2    std::cout &lt;&lt; \"M^{256}:\\n\"       &lt;&lt; pow(M,256)   &lt;&lt; '\\n';\n3    std::cout &lt;&lt; \"M^{2^8}:\\n\"       &lt;&lt; pow2(M,8)    &lt;&lt; '\\n';\n4    std::cout &lt;&lt; \"M^{2^{100}}:\\n\"   &lt;&lt; pow2(M,100)  &lt;&lt; '\\n';\n}\n\n1\n\nSimple square of a small random bit-matrix.\n\n2\n\nRaise to the power \\(256\\) using pow.\n\n3\n\nRaise to the power \\(2^8 = 256\\) using pow2.\n\n4\n\nRaise to the power \\(2^{100} = 1,267,650,600,228,229,401,496,703,205,376\\).\n\n\nOutput\nM:\n│1 0 1 1│\n│1 1 0 1│\n│0 0 0 1│\n│1 1 1 1│\nM^2:\n│0 1 0 1│\n│1 0 0 1│\n│1 1 1 1│\n│1 0 0 0│\nM^{256}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\nM^{2^8}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\nM^{2^{100}}:\n│0 0 0 1│\n│1 1 0 1│\n│1 0 1 1│\n│0 1 0 1│\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/invert.html",
     "href": "content/matrix/invert.html",
     "title": "bit::matrix — Bit-Matrix Inversion",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have a non-member function that attempts to invert a square bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nstd::optional&lt;matrix&lt;Block, Allocator&gt;&gt;\nbit::invert(const matrix&lt;Block, Allocator&gt; &M);\nIf this method succeeds, it will return \\(M^{-1}\\) wrapped in a std::optional. If the input matrix \\(M\\) is singular, it will return std::nullopt instead.\n\n\n\n\n\n\nBit-matrices are often singular\n\n\n\nRandomly filled matrices over \\(\\FF\\) are likely to be singular. In fact, for matrices that are \\(10 \\times 10\\) or larger, there is a 71% chance the matrix is singular if the elements were set by flipping fair coins. Contrast that to matrices over the reals where, mathematically at least, matrices are almost surely invertible (though the numerics of the situation may not be so sure).\n\n\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and the bit_assertion macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto A = bit::matrix&lt;&gt;::rotate(8);\n    auto B = bit::invert(A);\n    if(B) {\n        std::cout &lt;&lt; \"bit::matrix, its inverse, their product:\\n\";\n        bit::print(A,*B, bit::dot(A,*B));\n    }\n    else {\n        std::cout &lt;&lt; \"bit::matrix:\\n\" &lt;&lt; A &lt;&lt; \"\\n\" &lt;&lt; \"Is singular!\\n\";\n    }\n}\n\n1\n\nThe product of A and any 8-element bit-vector will rotate the elements in the vector one place to the left — see matrix::rotate. Obviously, A is invertible, so B exists and acts on bit-vectors by rotating their elements one place to the right.\n\n\nOutput\nbit::matrix, its inverse, their product:\n00000001        01000000        10000000\n10000000        00100000        01000000\n01000000        00010000        00100000\n00100000        00001000        00010000\n00010000        00000100        00001000\n00001000        00000010        00000100\n00000100        00000001        00000010\n00000010        10000000        00000001\n\nSee Also\nmatrix::probability_invertible\nmatrix::probability_singular\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have a non-member function that attempts to invert a square bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nstd::optional&lt;matrix&lt;Block, Allocator&gt;&gt;\nbit::invert(const matrix&lt;Block, Allocator&gt; &M);\nIf this method succeeds, it will return \\(M^{-1}\\) wrapped in a std::optional. If the input matrix \\(M\\) is singular, it will return std::nullopt instead.\n\n\n\n\n\n\nBit-matrices are often singular\n\n\n\nRandomly filled matrices over \\(\\FF\\) are likely to be singular. In fact, for matrices that are \\(10 \\times 10\\) or larger, there is a 71% chance the matrix is singular if the elements were set by flipping fair coins. Contrast that to matrices over the reals where, mathematically at least, matrices are almost surely invertible (though the numerics of the situation may not be so sure).\n\n\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and, if the BIT_VERIFY flag is set at compile time, the bit_verify macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto A = bit::matrix&lt;&gt;::rotate(8);\n    auto B = bit::invert(A);\n    if(B) {\n        std::cout &lt;&lt; \"bit::matrix, its inverse, their product:\\n\";\n        bit::print(A,*B, bit::dot(A,*B));\n    }\n    else {\n        std::cout &lt;&lt; \"bit::matrix:\\n\" &lt;&lt; A &lt;&lt; \"\\n\" &lt;&lt; \"Is singular!\\n\";\n    }\n}\n\n1\n\nThe product of A and any 8-element bit-vector will rotate the elements in the vector one place to the left — see matrix::rotate. Obviously, A is invertible, so B exists and acts on bit-vectors by rotating their elements one place to the right.\n\n\nOutput\nbit::matrix, its inverse, their product:\n00000001        01000000        10000000\n10000000        00100000        01000000\n01000000        00010000        00100000\n00100000        00001000        00010000\n00010000        00000100        00001000\n00001000        00000010        00000100\n00000100        00000001        00000010\n00000010        10000000        00000001\n\nSee Also\nmatrix::probability_invertible\nmatrix::probability_singular\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/set_if.html",
@@ -133,7 +133,7 @@
     "href": "content/matrix/sub.html",
     "title": "bit::matrix — Extract a Sub-Bit-Matrix",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to extract a sub-matrix as a stand-alone, distinct copy of elements from this bit-matrix.\nconstexpr bit::matrix\n1sub(std::size_t i0, std::size_t j0, std::size_t r, std::size_t c) const;\n\nconstexpr bit::matrix\n2sub(std::size_t r, std::size_t c) const;\n\nconstexpr bit::matrix\n3sub(std::size_t n) const const;\n\n1\n\nReturns an r x c bit-matrix, a copy from this bit-matrix starting at (i0, j0)\n\n2\n\nReturns an r x c bit-matrix, a copy from this bit-matrix starting at (0, 0).\n\n3\n\nReturns an n x n square bit-matrix, a copy from this bit-matrix starting at (0, 0)\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\n(i0, j0) has to be a valid index pair, and the requested dimensions must fit as a valid sub-matrix. Set the BIT_DEBUG flag at compile time to check these conditions — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto m = bit::matrix&lt;&gt;::random(8);\n    std::cout &lt;&lt; \"m:                \\n\" &lt;&lt; m                &lt;&lt; \"\\n\";\n2    std::cout &lt;&lt; \"m.sub(4):         \\n\" &lt;&lt; m.sub(4)         &lt;&lt; \"\\n\";\n3    std::cout &lt;&lt; \"m.sub(2,4):       \\n\" &lt;&lt; m.sub(2,4)       &lt;&lt; \"\\n\";\n4    std::cout &lt;&lt; \"m.sub(5,5,3,3):   \\n\" &lt;&lt; m.sub(5,5,3,3)   &lt;&lt; \"\\n\";\n}\n\n1\n\nThis constructs an 8 x 8 bit-matrix a random fill.\n\n2\n\nExtract the 4 x 4 elements starting at index (0, 0).\n\n3\n\nExtract the 2 x 4 elements starting at index (0, 0).\n\n4\n\nExtract the 3 x 3 elements starting at index (5, 5).\n\n\nOutput\nm:\n│0 1 0 0 1 1 0 1│\n│1 0 1 1 0 0 1 1│\n│1 0 0 0 0 0 0 1│\n│0 0 0 0 1 0 1 1│\n│0 0 1 1 0 1 0 0│\n│0 0 0 1 0 0 0 0│\n│1 1 1 0 1 1 0 1│\n│1 1 1 1 1 0 0 1│\nm.sub(4):\n│0 1 0 0│\n│1 0 1 1│\n│1 0 0 0│\n│0 0 0 0│\nm.sub(2,4):\n│0 1 0 0│\n│1 0 1 1│\nm.sub(5,5,3,3):\n│0 0 0│\n│1 0 1│\n│0 0 1│\n\nSee Also\nmatrix::replace\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to extract a sub-matrix as a stand-alone, distinct copy of elements from this bit-matrix.\nconstexpr bit::matrix\n1sub(std::size_t i0, std::size_t j0, std::size_t r, std::size_t c) const;\n\nconstexpr bit::matrix\n2sub(std::size_t r, std::size_t c) const;\n\nconstexpr bit::matrix\n3sub(std::size_t n) const const;\n\n1\n\nReturns an r x c bit-matrix, a copy from this bit-matrix starting at (i0, j0)\n\n2\n\nReturns an r x c bit-matrix, a copy from this bit-matrix starting at (0, 0).\n\n3\n\nReturns an n x n square bit-matrix, a copy from this bit-matrix starting at (0, 0)\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\n(i0, j0) has to be a valid index pair, and the requested dimensions must fit as a valid sub-matrix. Set the BIT_VERIFY flag at compile time to check these conditions — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto m = bit::matrix&lt;&gt;::random(8);\n    std::cout &lt;&lt; \"m:                \\n\" &lt;&lt; m                &lt;&lt; \"\\n\";\n2    std::cout &lt;&lt; \"m.sub(4):         \\n\" &lt;&lt; m.sub(4)         &lt;&lt; \"\\n\";\n3    std::cout &lt;&lt; \"m.sub(2,4):       \\n\" &lt;&lt; m.sub(2,4)       &lt;&lt; \"\\n\";\n4    std::cout &lt;&lt; \"m.sub(5,5,3,3):   \\n\" &lt;&lt; m.sub(5,5,3,3)   &lt;&lt; \"\\n\";\n}\n\n1\n\nThis constructs an 8 x 8 bit-matrix a random fill.\n\n2\n\nExtract the 4 x 4 elements starting at index (0, 0).\n\n3\n\nExtract the 2 x 4 elements starting at index (0, 0).\n\n4\n\nExtract the 3 x 3 elements starting at index (5, 5).\n\n\nOutput\nm:\n│0 1 0 0 1 1 0 1│\n│1 0 1 1 0 0 1 1│\n│1 0 0 0 0 0 0 1│\n│0 0 0 0 1 0 1 1│\n│0 0 1 1 0 1 0 0│\n│0 0 0 1 0 0 0 0│\n│1 1 1 0 1 1 0 1│\n│1 1 1 1 1 0 0 1│\nm.sub(4):\n│0 1 0 0│\n│1 0 1 1│\n│1 0 0 0│\n│0 0 0 0│\nm.sub(2,4):\n│0 1 0 0│\n│1 0 1 1│\nm.sub(5,5,3,3):\n│0 0 0│\n│1 0 1│\n│0 0 1│\n\nSee Also\nmatrix::replace\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/size.html",
@@ -286,7 +286,7 @@
     "href": "content/polynomial/index.html#instance-methods",
     "title": "The bit::polynomial Class",
     "section": "Instance Methods",
-    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::constructors\nConstruct bit-polynomials in various ways.\n\n\npolynomial::power\nFactory method to generate the polynomial \\(p(x) = x^n\\).\n\n\npolynomial::random\nFactory method constructs a bit-polynomial with random coefficients.\n\n\n\n\n\n\nQueries\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::size\nHow many coefficients are there in this polynomial?\n\n\npolynomial::empty\nDoes this polynomial have no coefficients? This is treated as a form of the zero polynomial.\n\n\npolynomial::capacity\nHow many coefficients can the polynomial have without causing memory allocation.\n\n\npolynomial::zero\nIs this the zero polynomial \\(p(x) = 0\\)?\n\n\npolynomial::nonzero\nIs this polynomial nonzero?\n\n\npolynomial::one\nIs this polynomial \\(p(x) = 1\\)?\n\n\npolynomial::constant\nIs this a constant polynomial \\(p(x) = 0 \\text{ or } 1\\)?\n\n\npolynomial::degree\nReturns the degree of the polynomial.\n\n\npolynomial::monic\nIs this a monic polynomial (so no trailing zero coefficients).\n\n\npolynomial::count0\nHow many zero coefficients does this polynomial have?\n\n\npolynomial::count1\nHow many one coefficients does this polynomial have?\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::resize\nResizes the number of coefficients in the polynomial up or down. Any added coefficients are set to zero.\n\n\npolynomial::clear\nClears all the coefficients from the polynomial so that size() becomes 0.\n\n\npolynomial::make_monic\nEliminates any trailing zero coefficients to make the polynomial monic.\n\n\npolynomial::shrink_to_fit\nAttempts to free up any memory that is not used by the polynomial.\n\n\n\n\n\n\nCoefficient Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator[]\nAccess a particular polynomial coefficient naturally.\n\n\npolynomial::get\nRead-only access to a particular polynomial coefficient.\n\n\npolynomial::set\nWrite access to a particular polynomial coefficient or all of them at once.\n\n\npolynomial::reset\nWrite access to a particular polynomial coefficient or all of them at once.\n\n\npolynomial::coefficients\nRead-only access to the polynomial coefficients as a bit-vector.\n\n\npolynomial::set_coefficients\nWrite access to the polynomial coefficients as a bit-vector.\n\n\n\n\n\n\nPolynomial Evaluation\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator()\nEvaluate the polynomial for a scalar or bit-matrix argument.\n\n\n\n\n\n\nArithmetic\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator+=\nAdds another polynomial to this one.\n\n\npolynomial::operator-=\nSubtracts another polynomial from this one.\n\n\npolynomial::operator*=\nMultiplies this polynomial by another one.\n\n\npolynomial::times_x\nMultiplies this polynomial by a power of x.\n\n\npolynomial::squared\nReturns a new polynomial that is the square of this one.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::to_string\nReturns a string representation of the polynomial.\n\n\n\n\n\n\nOther Instance Methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::sub\nCreate a distinct sub-polynomial of this one.\n\n\npolynomial::split\nSplit polynomial \\(p(x)\\) into \\(p(x) = l(x) + x^n h(x)\\).\n\n\npolynomial::reduce\nReduces \\(x^e\\) by this polynomial (\\(e\\) can be very large).\n\n\n\n\n\n\nDebugging\nYou can set a compile-time flag to enable extra safety checks. These checks can have a severe performance penalty so typically are only turned on for development.\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_DEBUG\nThis compile-time flag enables extra safety checks.\n\n\nbit_debug_assertion\nThese assertions are only checked if you set the BIT_DEBUG flag at compile time.\n\n\nbit_assertion\nThese assertions are always checked.",
+    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::constructors\nConstruct bit-polynomials in various ways.\n\n\npolynomial::power\nFactory method to generate the polynomial \\(p(x) = x^n\\).\n\n\npolynomial::random\nFactory method constructs a bit-polynomial with random coefficients.\n\n\n\n\n\n\nQueries\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::size\nHow many coefficients are there in this polynomial?\n\n\npolynomial::empty\nDoes this polynomial have no coefficients? This is treated as a form of the zero polynomial.\n\n\npolynomial::capacity\nHow many coefficients can the polynomial have without causing memory allocation.\n\n\npolynomial::zero\nIs this the zero polynomial \\(p(x) = 0\\)?\n\n\npolynomial::nonzero\nIs this polynomial nonzero?\n\n\npolynomial::one\nIs this polynomial \\(p(x) = 1\\)?\n\n\npolynomial::constant\nIs this a constant polynomial \\(p(x) = 0 \\text{ or } 1\\)?\n\n\npolynomial::degree\nReturns the degree of the polynomial.\n\n\npolynomial::monic\nIs this a monic polynomial (so no trailing zero coefficients).\n\n\npolynomial::count0\nHow many zero coefficients does this polynomial have?\n\n\npolynomial::count1\nHow many one coefficients does this polynomial have?\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::resize\nResizes the number of coefficients in the polynomial up or down. Any added coefficients are set to zero.\n\n\npolynomial::clear\nClears all the coefficients from the polynomial so that size() becomes 0.\n\n\npolynomial::make_monic\nEliminates any trailing zero coefficients to make the polynomial monic.\n\n\npolynomial::shrink_to_fit\nAttempts to free up any memory that is not used by the polynomial.\n\n\n\n\n\n\nCoefficient Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator[]\nAccess a particular polynomial coefficient naturally.\n\n\npolynomial::get\nRead-only access to a particular polynomial coefficient.\n\n\npolynomial::set\nWrite access to a particular polynomial coefficient or all of them at once.\n\n\npolynomial::reset\nWrite access to a particular polynomial coefficient or all of them at once.\n\n\npolynomial::coefficients\nRead-only access to the polynomial coefficients as a bit-vector.\n\n\npolynomial::set_coefficients\nWrite access to the polynomial coefficients as a bit-vector.\n\n\n\n\n\n\nPolynomial Evaluation\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator()\nEvaluate the polynomial for a scalar or bit-matrix argument.\n\n\n\n\n\n\nArithmetic\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::operator+=\nAdds another polynomial to this one.\n\n\npolynomial::operator-=\nSubtracts another polynomial from this one.\n\n\npolynomial::operator*=\nMultiplies this polynomial by another one.\n\n\npolynomial::times_x\nMultiplies this polynomial by a power of x.\n\n\npolynomial::squared\nReturns a new polynomial that is the square of this one.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::to_string\nReturns a string representation of the polynomial.\n\n\n\n\n\n\nOther Instance Methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\npolynomial::sub\nCreate a distinct sub-polynomial of this one.\n\n\npolynomial::split\nSplit polynomial \\(p(x)\\) into \\(p(x) = l(x) + x^n h(x)\\).\n\n\npolynomial::reduce\nReduces \\(x^e\\) by this polynomial (\\(e\\) can be very large).\n\n\n\n\n\n\nDebugging\nYou can set a compile-time flag to enable extra safety checks. These checks can have a severe performance penalty so typically are only turned on for development.\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_VERIFY\nThis compile-time flag enables extra safety checks.\n\n\nbit_verify\nThese checks are only done if you set the BIT_VERIFY flag at compile time.",
     "crumbs": [
       "Home",
       "Bit-Polynomials",
@@ -359,7 +359,7 @@
     "href": "content/vector/logical-op.html",
     "title": "bit::vector — Logical Op Operators",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nThese are non-member functions to perform element-by-element binary AND, XOR, OR, DIFF between two equal-sized bit-vectors.\ntemplate&lt;std::unsigned_integral Block, typename Alloc&gt;\nconstexpr bit::vector&lt;Block, Alloc&gt;\noperator&(const bit::vector&lt;Block, Alloc&gt; &lhs,\n1          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator^(const bit::vector&lt;Block, Alloc&gt; &lhs,\n2          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator|(const bit::vector&lt;Block, Alloc&gt; &lhs,\n3          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator+(const bit::vector&lt;Block, Alloc&gt; &lhs,\n4          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator-(const bit::vector&lt;Block, Alloc&gt; &lhs,\n5          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator*(const bit::vector&lt;Block, Alloc&gt; &lhs,\n6          const bit::vector&lt;Block, Alloc&gt; &rhs);\n\n1\n\nReturns a bit-vector whose bits result from binary AND between the corresponding pairs of bits of rhs and lhs.\n\n2\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\n\n3\n\nReturns a bit-vector whose bits result from binary OR between the corresponding pairs of bits of rhs and lhs.\n\n4\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), addition corresponds to the logical XOR operation.\n\n5\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), subtraction corresponds to the logical XOR operation.\n\n6\n\nReturns a bit-vector whose bits result from binary AND between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), multiplication corresponds to the logical AND operation.\n\n\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::vector&lt;&gt; u(11, [&](size_t k) { return k % 2; });\n2    bit::vector&lt;&gt; v(11, [&](size_t k) { return (k + 1) % 2; });\n    std::cout &lt;&lt; u &lt;&lt; \" & \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u & v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u &lt;&lt; \" ^ \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u ^ v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u &lt;&lt; \" | \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u | v) &lt;&lt; '\\n';\n}\n\n1\n\nCreates a vector of size 11 by calling a lambda that sets all the even indices.\n\n2\n\nCreates a vector of size 11 by calling a lambda that sets all the odd indices.\n\n\nOutput\n[0 1 0 1 0 1 0 1 0 1 0] & [1 0 1 0 1 0 1 0 1 0 1] = [0 0 0 0 0 0 0 0 0 0 0]\n[0 1 0 1 0 1 0 1 0 1 0] ^ [1 0 1 0 1 0 1 0 1 0 1] = [1 1 1 1 1 1 1 1 1 1 1]\n[0 1 0 1 0 1 0 1 0 1 0] | [1 0 1 0 1 0 1 0 1 0 1] = [1 1 1 1 1 1 1 1 1 1 1]\n\nSee Also\nvector::operator&=\nvector::operator|=\nvector::operator^=\nvector::operator+=\nvector::operator-=\nvector::operator*=\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nThese are non-member functions to perform element-by-element binary AND, XOR, OR, DIFF between two equal-sized bit-vectors.\ntemplate&lt;std::unsigned_integral Block, typename Alloc&gt;\nconstexpr bit::vector&lt;Block, Alloc&gt;\noperator&(const bit::vector&lt;Block, Alloc&gt; &lhs,\n1          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator^(const bit::vector&lt;Block, Alloc&gt; &lhs,\n2          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator|(const bit::vector&lt;Block, Alloc&gt; &lhs,\n3          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator+(const bit::vector&lt;Block, Alloc&gt; &lhs,\n4          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator-(const bit::vector&lt;Block, Alloc&gt; &lhs,\n5          const bit::vector&lt;Block, Alloc&gt; &rhs);\noperator*(const bit::vector&lt;Block, Alloc&gt; &lhs,\n6          const bit::vector&lt;Block, Alloc&gt; &rhs);\n\n1\n\nReturns a bit-vector whose bits result from binary AND between the corresponding pairs of bits of rhs and lhs.\n\n2\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\n\n3\n\nReturns a bit-vector whose bits result from binary OR between the corresponding pairs of bits of rhs and lhs.\n\n4\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), addition corresponds to the logical XOR operation.\n\n5\n\nReturns a bit-vector whose bits result from binary XOR between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), subtraction corresponds to the logical XOR operation.\n\n6\n\nReturns a bit-vector whose bits result from binary AND between the corresponding pairs of bits of rhs and lhs.\nIn GF(2), multiplication corresponds to the logical AND operation.\n\n\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::vector&lt;&gt; u(11, [&](size_t k) { return k % 2; });\n2    bit::vector&lt;&gt; v(11, [&](size_t k) { return (k + 1) % 2; });\n    std::cout &lt;&lt; u &lt;&lt; \" & \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u & v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u &lt;&lt; \" ^ \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u ^ v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u &lt;&lt; \" | \" &lt;&lt; v &lt;&lt; \" = \" &lt;&lt; (u | v) &lt;&lt; '\\n';\n}\n\n1\n\nCreates a vector of size 11 by calling a lambda that sets all the even indices.\n\n2\n\nCreates a vector of size 11 by calling a lambda that sets all the odd indices.\n\n\nOutput\n[0 1 0 1 0 1 0 1 0 1 0] & [1 0 1 0 1 0 1 0 1 0 1] = [0 0 0 0 0 0 0 0 0 0 0]\n[0 1 0 1 0 1 0 1 0 1 0] ^ [1 0 1 0 1 0 1 0 1 0 1] = [1 1 1 1 1 1 1 1 1 1 1]\n[0 1 0 1 0 1 0 1 0 1 0] | [1 0 1 0 1 0 1 0 1 0 1] = [1 1 1 1 1 1 1 1 1 1 1]\n\nSee Also\nvector::operator&=\nvector::operator|=\nvector::operator^=\nvector::operator+=\nvector::operator-=\nvector::operator*=\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/swap.html",
@@ -380,7 +380,7 @@
     "href": "content/vector/replace.html",
     "title": "bit::vector — Replace Elements",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nDefines methods that replace some of this bit-vector’s values with those of another.\n1constexpr bit::vector &replace(std::size_t i0, const bit::vector &with);\n2constexpr bit::vector &replace(const bit::vector &with);\n\n1\n\nStarting at element i0, replace the bit-vector values with those from the bit-vector with.\n\n2\n\nStarting at element 0, replace the bit-vector values with those from the bit-vector with.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe sub-vector with we are copying from must fit inside the existing bit-vector!\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nBoth methods return a reference to *this so can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto u = bit::vector&lt;&gt;::zeros(3);\n    auto v = bit::vector&lt;&gt;::ones(10);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n1    v.replace(7,u);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n2    v.replace(u);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n}\n\n1\n\nReplace the final three elements of v with those from u.\n\n2\n\nReplace the first three elements of v with those from u.\n\n\nOutput\nv: [1 1 1 1 1 1 1 1 1 1]\nv: [1 1 1 1 1 1 1 0 0 0]\nv: [0 0 0 1 1 1 1 0 0 0]\n\nSee Also\nvector::sub\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nDefines methods that replace some of this bit-vector’s values with those of another.\n1constexpr bit::vector &replace(std::size_t i0, const bit::vector &with);\n2constexpr bit::vector &replace(const bit::vector &with);\n\n1\n\nStarting at element i0, replace the bit-vector values with those from the bit-vector with.\n\n2\n\nStarting at element 0, replace the bit-vector values with those from the bit-vector with.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe sub-vector with we are copying from must fit inside the existing bit-vector!\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nBoth methods return a reference to *this so can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto u = bit::vector&lt;&gt;::zeros(3);\n    auto v = bit::vector&lt;&gt;::ones(10);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n1    v.replace(7,u);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n2    v.replace(u);\n    std::cout &lt;&lt; \"v: \" &lt;&lt; v &lt;&lt; '\\n';\n}\n\n1\n\nReplace the final three elements of v with those from u.\n\n2\n\nReplace the first three elements of v with those from u.\n\n\nOutput\nv: [1 1 1 1 1 1 1 1 1 1]\nv: [1 1 1 1 1 1 1 0 0 0]\nv: [0 0 0 1 1 1 1 0 0 0]\n\nSee Also\nvector::sub\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/set_if.html",
@@ -436,7 +436,7 @@
     "href": "content/vector/logical-op-eq.html",
     "title": "bit::vector — Logical Op= Operators",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nThese methods perform element-by-element binary AND, XOR, OR with another equal sized bit-vector.\n1constexpr bit::vector &operator&=(const bit::vector &other);\n2constexpr bit::vector &operator^=(const bit::vector &other);\n3constexpr bit::vector &operator|=(const bit::vector &other);\n4constexpr bit::vector &operator+=(const bit::vector &other);\n5constexpr bit::vector &operator-=(const bit::vector &other);\n6constexpr bit::vector &operator*=(const bit::vector &other);\n\n1\n\nSets this bit-vector’s bits to the result of binary AND between the corresponding pairs of bits of *this and other.\n\n2\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\n\n3\n\nSets this bit-vector’s bits to the result of binary OR between the corresponding pairs of bits of *this and other.\n\n4\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\nIn GF(2), addition corresponds to the logical XOR operation.\n\n5\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\nIn GF(2), subtraction corresponds to the logical XOR operation.\n\n6\n\nSets this bit-vector’s bits to the result of binary AND between the corresponding pairs of bits of *this and other.\nIn GF(2), multiplication corresponds to the logical AND operation.\n\n\nThese methods all return a reference to *this so they can be chained with other calls.\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\n1constexpr bit::vector operator~() const;\n\n1\n\nReturns a copy of the bit-vector with all the bits flipped\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::vector&lt;&gt; u(11, [&](size_t k) { return k % 2; });\n2    bit::vector&lt;&gt; v(11, [&](size_t k) { return (k + 1) % 2; });\n    std::cout &lt;&lt; \"u:        \" &lt;&lt; u &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v:        \" &lt;&lt; v &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u &= v): \" &lt;&lt; (u &= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u |= v): \" &lt;&lt; (u |= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u ^= v): \" &lt;&lt; (u ^= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"~u:       \" &lt;&lt; ~u &lt;&lt; '\\n';\n}\n\n1\n\nCreates a vector of size 11 by calling a lambda that sets all the even indices.\n\n2\n\nCreates a vector of size 11 by calling a lambda that sets all the odd indices.\n\n\nOutput\nu:        [0 1 0 1 0 1 0 1 0 1 0]\nv:        [1 0 1 0 1 0 1 0 1 0 1]\n(u &= v): [0 0 0 0 0 0 0 0 0 0 0]\n(u |= v): [1 0 1 0 1 0 1 0 1 0 1]\n(u ^= v): [0 0 0 0 0 0 0 0 0 0 0]\n~u:       [1 1 1 1 1 1 1 1 1 1 1]\n\nSee Also\nvector::operator&\nvector::operator|\nvector::operator^\nvector::operator+\nvector::operator-\nvector::operator*\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nThese methods perform element-by-element binary AND, XOR, OR with another equal sized bit-vector.\n1constexpr bit::vector &operator&=(const bit::vector &other);\n2constexpr bit::vector &operator^=(const bit::vector &other);\n3constexpr bit::vector &operator|=(const bit::vector &other);\n4constexpr bit::vector &operator+=(const bit::vector &other);\n5constexpr bit::vector &operator-=(const bit::vector &other);\n6constexpr bit::vector &operator*=(const bit::vector &other);\n\n1\n\nSets this bit-vector’s bits to the result of binary AND between the corresponding pairs of bits of *this and other.\n\n2\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\n\n3\n\nSets this bit-vector’s bits to the result of binary OR between the corresponding pairs of bits of *this and other.\n\n4\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\nIn GF(2), addition corresponds to the logical XOR operation.\n\n5\n\nSets this bit-vector’s bits to the result of binary XOR between the corresponding pairs of bits of *this and other.\nIn GF(2), subtraction corresponds to the logical XOR operation.\n\n6\n\nSets this bit-vector’s bits to the result of binary AND between the corresponding pairs of bits of *this and other.\nIn GF(2), multiplication corresponds to the logical AND operation.\n\n\nThese methods all return a reference to *this so they can be chained with other calls.\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\n1constexpr bit::vector operator~() const;\n\n1\n\nReturns a copy of the bit-vector with all the bits flipped\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::vector&lt;&gt; u(11, [&](size_t k) { return k % 2; });\n2    bit::vector&lt;&gt; v(11, [&](size_t k) { return (k + 1) % 2; });\n    std::cout &lt;&lt; \"u:        \" &lt;&lt; u &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v:        \" &lt;&lt; v &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u &= v): \" &lt;&lt; (u &= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u |= v): \" &lt;&lt; (u |= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"(u ^= v): \" &lt;&lt; (u ^= v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"~u:       \" &lt;&lt; ~u &lt;&lt; '\\n';\n}\n\n1\n\nCreates a vector of size 11 by calling a lambda that sets all the even indices.\n\n2\n\nCreates a vector of size 11 by calling a lambda that sets all the odd indices.\n\n\nOutput\nu:        [0 1 0 1 0 1 0 1 0 1 0]\nv:        [1 0 1 0 1 0 1 0 1 0 1]\n(u &= v): [0 0 0 0 0 0 0 0 0 0 0]\n(u |= v): [1 0 1 0 1 0 1 0 1 0 1]\n(u ^= v): [0 0 0 0 0 0 0 0 0 0 0]\n~u:       [1 1 1 1 1 1 1 1 1 1 1]\n\nSee Also\nvector::operator&\nvector::operator|\nvector::operator^\nvector::operator+\nvector::operator-\nvector::operator*\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/size.html",
@@ -450,21 +450,21 @@
     "href": "content/vector/diff.html",
     "title": "bit::vector — Logical Differences",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nCompute the logical DIFF of two equal-sized bit-vectors.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr bit::vector&lt;Block, Allocator&gt;\ndiff(const bit::vector&lt;Block, Allocator&gt; &u,\n1     const bit::vector&lt;Block, Allocator&gt; &v);\n\n1\n\nReturns a bit-vector w where w[i] = 1 if u[i] != v[i] and 0 otherwise.\n\n\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto u = bit::vector&lt;&gt;::ones(6);\n    auto v = bit::vector&lt;&gt;::checker_board(6);\n    std::cout &lt;&lt; \"diff(\" &lt;&lt; u.to_string() &lt;&lt; \", \"&lt;&lt; v.to_string() &lt;&lt; \") yields \"\n              &lt;&lt; bit::diff(u, v).to_string() &lt;&lt; '\\n';\n}\nOutput\ndiff(111111, 010101) yields 101010\n\nSee Also\nvector::append\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nCompute the logical DIFF of two equal-sized bit-vectors.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr bit::vector&lt;Block, Allocator&gt;\ndiff(const bit::vector&lt;Block, Allocator&gt; &u,\n1     const bit::vector&lt;Block, Allocator&gt; &v);\n\n1\n\nReturns a bit-vector w where w[i] = 1 if u[i] != v[i] and 0 otherwise.\n\n\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto u = bit::vector&lt;&gt;::ones(6);\n    auto v = bit::vector&lt;&gt;::checker_board(6);\n    std::cout &lt;&lt; \"diff(\" &lt;&lt; u.to_string() &lt;&lt; \", \"&lt;&lt; v.to_string() &lt;&lt; \") yields \"\n              &lt;&lt; bit::diff(u, v).to_string() &lt;&lt; '\\n';\n}\nOutput\ndiff(111111, 010101) yields 101010\n\nSee Also\nvector::append\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/dot.html",
     "href": "content/vector/dot.html",
     "title": "bit::vector — Dot Product for Bit-Vectors",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nCompute the dot product of two equal-sized bit-vectors.\n1constexpr bool dot(const bit::vector &v);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr bool\n2dot(const bit::vector&lt;Block, Allocator&gt; &u,\n    const bit::vector&lt;Block, Allocator&gt; &v);\n\n1\n\nInstance method that returns the dot product of this bit-vector with another equal-sized bit-vector v.\n\n2\n\nNon-member function that returns the dot product of two equal-sized bit-vectors u and v.\n\n\nThe dot product is defined by \\[\n\\mathbf{u} \\cdot \\mathbf{v} = \\sum_i u_i v_i.\n\\] In the case of bit-vectors, products are replaced by logical AND and sums by the logical XOR operation.\nThe dot product is a critical operation in linear algebra, so it is fortunate that AND’ing and XOR’ing for bit-vectors can be done efficiently over blocks of elements simultaneously.\nThe required result is just the one-liner (lhs & rhs).parity().\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; u(\"01111110\");\n    bit::vector&lt;&gt; v(\"10101010\");\n\n    auto u_str = u.to_string();\n    auto v_str = v.to_string();\n\n    std::cout &lt;&lt; \"bit::dot(\" &lt;&lt; u_str &lt;&lt; \", \" &lt;&lt; v_str &lt;&lt; \") = \" &lt;&lt; bit::dot(u, v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u_str &lt;&lt; \".dot(\" &lt;&lt; v_str &lt;&lt; \") = \" &lt;&lt; u.dot(v) &lt;&lt; '\\n';\n}\nOutput\nbit::dot(01111110, 10101010) = 1\n01111110.dot(10101010) = 1\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nCompute the dot product of two equal-sized bit-vectors.\n1constexpr bool dot(const bit::vector &v);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr bool\n2dot(const bit::vector&lt;Block, Allocator&gt; &u,\n    const bit::vector&lt;Block, Allocator&gt; &v);\n\n1\n\nInstance method that returns the dot product of this bit-vector with another equal-sized bit-vector v.\n\n2\n\nNon-member function that returns the dot product of two equal-sized bit-vectors u and v.\n\n\nThe dot product is defined by \\[\n\\mathbf{u} \\cdot \\mathbf{v} = \\sum_i u_i v_i.\n\\] In the case of bit-vectors, products are replaced by logical AND and sums by the logical XOR operation.\nThe dot product is a critical operation in linear algebra, so it is fortunate that AND’ing and XOR’ing for bit-vectors can be done efficiently over blocks of elements simultaneously.\nThe required result is just the one-liner (lhs & rhs).parity().\n\n\n\n\n\n\nSize checking\n\n\n\nThe two vectors in question must be of the same size.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; u(\"01111110\");\n    bit::vector&lt;&gt; v(\"10101010\");\n\n    auto u_str = u.to_string();\n    auto v_str = v.to_string();\n\n    std::cout &lt;&lt; \"bit::dot(\" &lt;&lt; u_str &lt;&lt; \", \" &lt;&lt; v_str &lt;&lt; \") = \" &lt;&lt; bit::dot(u, v) &lt;&lt; '\\n';\n    std::cout &lt;&lt; u_str &lt;&lt; \".dot(\" &lt;&lt; v_str &lt;&lt; \") = \" &lt;&lt; u.dot(v) &lt;&lt; '\\n';\n}\nOutput\nbit::dot(01111110, 10101010) = 1\n01111110.dot(10101010) = 1\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/access.html",
     "href": "content/vector/access.html",
     "title": "bit::vector — Element Access",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\n1constexpr bool      element(std::size_t i) const;\n2constexpr reference element(std::size_t i);\n\n3constexpr bool      operator[](std::size_t i) const;\nconstexpr reference operator[](std::size_t i);\n\n4constexpr bool      operator()(std::size_t i) const;\nconstexpr reference operator()(std::size_t i);\n\n5constexpr bool      test(std::size_t i) const;\n\n6constexpr bool      front() const;\nconstexpr reference front()\n\n7constexpr bool      back() const;\nconstexpr reference back()\n\n1\n\nAccesses the value for bit-vector element i.\n\n2\n\nReturns a vector::reference object — allows modification of the value at index i.\n\n3\n\nThe operator[] methods are synonyms for the element methods.\n\n4\n\nThe operator() methods are also synonyms for the element methods.\n\n5\n\nAnother way to access the value for element i.\n\n6\n\nAccess the element at index 0.\n\n7\n\nAccess the element at index size() - 1.\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, these methods do not check whether the index i is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 11;\n    bit::vector&lt;&gt; v(n);\n    std::cout &lt;&lt; \"Setting successive bits:\\n\";\n    std::cout &lt;&lt; v &lt;&lt; '\\n';\n    for (std::size_t i = 0; i &lt; n; ++i) {\n        v[i] = true;\n        std::cout &lt;&lt; v &lt;&lt; '\\n';\n    }\n    std::cout &lt;&lt; \"Resetting the front and back elements of v ...\\n\";\n    v.front() = 0;\n    v.back()  = 0;\n    std::cout &lt;&lt; v &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v.front(): \" &lt;&lt; v.front() &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v.back():  \" &lt;&lt; v.back()  &lt;&lt; '\\n';\n}\nOutput\nSetting successive bits:\n[0 0 0 0 0 0 0 0 0 0 0]\n[1 0 0 0 0 0 0 0 0 0 0]\n[1 1 0 0 0 0 0 0 0 0 0]\n[1 1 1 0 0 0 0 0 0 0 0]\n[1 1 1 1 0 0 0 0 0 0 0]\n[1 1 1 1 1 0 0 0 0 0 0]\n[1 1 1 1 1 1 0 0 0 0 0]\n[1 1 1 1 1 1 1 0 0 0 0]\n[1 1 1 1 1 1 1 1 0 0 0]\n[1 1 1 1 1 1 1 1 1 0 0]\n[1 1 1 1 1 1 1 1 1 1 0]\n[1 1 1 1 1 1 1 1 1 1 1]\nResetting the front and back elements of v ...\n[0 1 1 1 1 1 1 1 1 1 0]\nv.front(): 0\nv.back():  0\n\nSee Also\nvector::reference\nvector::size\nbit_assertion\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\n1constexpr bool      element(std::size_t i) const;\n2constexpr reference element(std::size_t i);\n\n3constexpr bool      operator[](std::size_t i) const;\nconstexpr reference operator[](std::size_t i);\n\n4constexpr bool      operator()(std::size_t i) const;\nconstexpr reference operator()(std::size_t i);\n\n5constexpr bool      test(std::size_t i) const;\n\n6constexpr bool      front() const;\nconstexpr reference front()\n\n7constexpr bool      back() const;\nconstexpr reference back()\n\n1\n\nAccesses the value for bit-vector element i.\n\n2\n\nReturns a vector::reference object — allows modification of the value at index i.\n\n3\n\nThe operator[] methods are synonyms for the element methods.\n\n4\n\nThe operator() methods are also synonyms for the element methods.\n\n5\n\nAnother way to access the value for element i.\n\n6\n\nAccess the element at index 0.\n\n7\n\nAccess the element at index size() - 1.\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, these methods do not check whether the index i is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 11;\n    bit::vector&lt;&gt; v(n);\n    std::cout &lt;&lt; \"Setting successive bits:\\n\";\n    std::cout &lt;&lt; v &lt;&lt; '\\n';\n    for (std::size_t i = 0; i &lt; n; ++i) {\n        v[i] = true;\n        std::cout &lt;&lt; v &lt;&lt; '\\n';\n    }\n    std::cout &lt;&lt; \"Resetting the front and back elements of v ...\\n\";\n    v.front() = 0;\n    v.back()  = 0;\n    std::cout &lt;&lt; v &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v.front(): \" &lt;&lt; v.front() &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"v.back():  \" &lt;&lt; v.back()  &lt;&lt; '\\n';\n}\nOutput\nSetting successive bits:\n[0 0 0 0 0 0 0 0 0 0 0]\n[1 0 0 0 0 0 0 0 0 0 0]\n[1 1 0 0 0 0 0 0 0 0 0]\n[1 1 1 0 0 0 0 0 0 0 0]\n[1 1 1 1 0 0 0 0 0 0 0]\n[1 1 1 1 1 0 0 0 0 0 0]\n[1 1 1 1 1 1 0 0 0 0 0]\n[1 1 1 1 1 1 1 0 0 0 0]\n[1 1 1 1 1 1 1 1 0 0 0]\n[1 1 1 1 1 1 1 1 1 0 0]\n[1 1 1 1 1 1 1 1 1 1 0]\n[1 1 1 1 1 1 1 1 1 1 1]\nResetting the front and back elements of v ...\n[0 1 1 1 1 1 1 1 1 1 0]\nv.front(): 0\nv.back():  0\n\nSee Also\nvector::reference\nvector::size\nbit_verify\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/join.html",
@@ -555,7 +555,7 @@
     "href": "content/vector/all.html",
     "title": "bit::vector — State Queries",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\n1constexpr bool all() const;\n2constexpr bool any() const;\n3constexpr bool none() const;\n\n1\n\nReturns true if all the elements in the bit-vector are 1; otherwise, returns false.\n\n2\n\nReturns true if any elements in the bit-vector are 1; otherwise, returns false.\n\n3\n\nReturns true if none of the elements in the bit-vector are 1; otherwise, returns false.\n\n\n\n\n\n\n\n\nEmpty bit-vectors\n\n\n\nCalling these methods for an empty bit-vector is likely an error — if you set the BIT_DEBUG flag at compile time, we throw an exception with a helpful message. If the BIT_DEBUG flag is not set, all() and none() both return true while any() will return false.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto v1 = bit::vector&lt;&gt;::zeros(4);\n    auto v2 = bit::vector&lt;&gt;::checker_board(4);\n    auto v3 = bit::vector&lt;&gt;::ones(4);\n\n    std::cout\n        &lt;&lt; \"vector\\t\\t\" &lt;&lt; \"all\\t\" &lt;&lt; \"any\\t\" &lt;&lt; \"none\\n\"\n        &lt;&lt; v1 &lt;&lt; '\\t' &lt;&lt; v1.all() &lt;&lt; '\\t' &lt;&lt; v1.any() &lt;&lt; '\\t' &lt;&lt; v1.none() &lt;&lt; '\\n'\n        &lt;&lt; v2 &lt;&lt; '\\t' &lt;&lt; v2.all() &lt;&lt; '\\t' &lt;&lt; v2.any() &lt;&lt; '\\t' &lt;&lt; v2.none() &lt;&lt; '\\n'\n        &lt;&lt; v3 &lt;&lt; '\\t' &lt;&lt; v3.all() &lt;&lt; '\\t' &lt;&lt; v3.any() &lt;&lt; '\\t' &lt;&lt; v3.none() &lt;&lt; '\\n';\n}\nOutput\nvector          all     any     none\n[0 0 0 0]       0       0       1\n[0 1 0 1]       0       1       0\n[1 1 1 1]       1       1       0\n\nSee Also\nvector::count\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\n1constexpr bool all() const;\n2constexpr bool any() const;\n3constexpr bool none() const;\n\n1\n\nReturns true if all the elements in the bit-vector are 1; otherwise, returns false.\n\n2\n\nReturns true if any elements in the bit-vector are 1; otherwise, returns false.\n\n3\n\nReturns true if none of the elements in the bit-vector are 1; otherwise, returns false.\n\n\n\n\n\n\n\n\nEmpty bit-vectors\n\n\n\nCalling these methods for an empty bit-vector is likely an error — if you set the BIT_VERIFY flag at compile time, we throw an exception with a helpful message. If the BIT_VERIFY flag is not set, all() and none() both return true while any() will return false.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto v1 = bit::vector&lt;&gt;::zeros(4);\n    auto v2 = bit::vector&lt;&gt;::checker_board(4);\n    auto v3 = bit::vector&lt;&gt;::ones(4);\n\n    std::cout\n        &lt;&lt; \"vector\\t\\t\" &lt;&lt; \"all\\t\" &lt;&lt; \"any\\t\" &lt;&lt; \"none\\n\"\n        &lt;&lt; v1 &lt;&lt; '\\t' &lt;&lt; v1.all() &lt;&lt; '\\t' &lt;&lt; v1.any() &lt;&lt; '\\t' &lt;&lt; v1.none() &lt;&lt; '\\n'\n        &lt;&lt; v2 &lt;&lt; '\\t' &lt;&lt; v2.all() &lt;&lt; '\\t' &lt;&lt; v2.any() &lt;&lt; '\\t' &lt;&lt; v2.none() &lt;&lt; '\\n'\n        &lt;&lt; v3 &lt;&lt; '\\t' &lt;&lt; v3.all() &lt;&lt; '\\t' &lt;&lt; v3.any() &lt;&lt; '\\t' &lt;&lt; v3.none() &lt;&lt; '\\n';\n}\nOutput\nvector          all     any     none\n[0 0 0 0]       0       0       1\n[0 1 0 1]       0       1       0\n[1 1 1 1]       1       1       0\n\nSee Also\nvector::count\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/clear.html",
@@ -907,63 +907,63 @@
     "text": "This eventually will be a list of FAQ’s\n\n\n\n Back to top"
   },
   {
-    "objectID": "content/bit_assertion/index.html",
-    "href": "content/bit_assertion/index.html",
-    "title": "Assertions",
+    "objectID": "content/verify/index.html",
+    "href": "content/verify/index.html",
+    "title": "Verification Checks",
     "section": "",
     "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]",
     "crumbs": [
       "Home",
       "Debugging",
-      "Assertions"
+      "Verifications"
     ]
   },
   {
-    "objectID": "content/bit_assertion/index.html#introduction",
-    "href": "content/bit_assertion/index.html#introduction",
-    "title": "Assertions",
+    "objectID": "content/verify/index.html#introduction",
+    "href": "content/verify/index.html#introduction",
+    "title": "Verification Checks",
     "section": "Introduction",
-    "text": "Introduction\nThe bit_assertion.h header has two replacements for the standard assert macro — they allow for an additional string output that you can use to print the values of the variables that triggered any failure.\n1bit_assertion(condition, message)\n2bit_debug_assertion(condition, message)\n\n1\n\nThis is very similar to the standard assert macro — the assertion is always checked unless the NDEBUG flag is set at compile time.\n\n2\n\nOn the other hand, this type of assertion is only checked if the DEBUG flag is set at compile time.\n\n\nAssuming a check is “on”, in all cases, if condition evaluates to false, these both call the macro:\nbit_exit(message)\nThe bit_exit(message) macro passes the message and the source code location of the failure to bit::exit(...). That function prints the source code location of the failure along with the message payload and then exits the program.\nThe bit::exit function needs source code location parameters (the filename, the line number, and the function name), and the bit_exit macro automatically adds those. You typically use the message argument to print the values of the variables that triggered the failure. The message can be anything that can be formatted using the facilities in std::format.\n\n\n\n\n\n\nMicrosoft compiler\n\n\n\nMicrosoft’s old traditional preprocessor is not happy with these macros, but their newer cross-platform compatible one is fine. Add the /Zc:preprocessor flag to use that upgrade at compile time. Our CMake module compiler_init does that automatically for you.",
+    "text": "Introduction\nWe have a macro that is used to check a condition and, on failures, cause the program to exit with a customizable message.\nbit_verify(condition, ...)\nIf the BIT_VERIFY flag is set at compile time then condition is checked and if it fails the program exits with a custom message synthesized from the rest of the arguments. If the BIT_VERIFY flag is not set then the macro expands to a no-op.\nAssuming a check is “on”, if condition evaluates to false then bit_verify calls\nbit_exit(message)\nThe bit_exit(message) macro passes the message and the source code location of the failure to bit::exit(...). That function prints the source code location of the failure along with the message payload and then exits the program.\nThe bit::exit function needs source code location parameters (the filename, the line number, and the function name), and the bit_exit macro automatically adds those. You typically use the message argument to print the values of the variables that triggered the failure. The message can be anything that can be formatted using the facilities in std::format.\n\n\n\n\n\n\nMicrosoft compiler\n\n\n\nMicrosoft’s old traditional preprocessor is not happy with these macros, but their newer cross-platform compatible one is fine. Add the /Zc:preprocessor flag to use that upgrade at compile time. Our CMake module compiler_init does that automatically for you.",
     "crumbs": [
       "Home",
       "Debugging",
-      "Assertions"
+      "Verifications"
     ]
   },
   {
-    "objectID": "content/bit_assertion/index.html#compiler-flags",
-    "href": "content/bit_assertion/index.html#compiler-flags",
-    "title": "Assertions",
+    "objectID": "content/verify/index.html#compiler-flags",
+    "href": "content/verify/index.html#compiler-flags",
+    "title": "Verification Checks",
     "section": "Compiler Flags",
-    "text": "Compiler Flags\n\n\n\n\n\n\n\n\nFlag\nDescription\n\n\n\n\nBIT_DEBUG\nIf you set the BIT_DEBUG flag, the library will perform demanding but potentially useful safety assertions on indices, size equality checks, etc. Otherwise, all the bit_debug_assertion calls are no-ops.\n\n\nNDEBUG\nThis works exactly like it does for the standard assert macro. If it is set then all bit_assertion calls are np-ops.\n\n\n\n\n\n\n\n\n\n\nCompiler Flag Consistency\n\n\n\nIf you set the NDEBUG flag, we make sure that the BIT_DEBUG flag is not set.",
+    "text": "Compiler Flags\nBIT_VERIFY\nIf you set the BIT_VERIFY flag, the library will perform demanding but potentially useful safety assertions on indices, size equality checks, etc. Otherwise, all the bit_verify calls are no-ops",
     "crumbs": [
       "Home",
       "Debugging",
-      "Assertions"
+      "Verifications"
     ]
   },
   {
-    "objectID": "content/bit_assertion/index.html#examples",
-    "href": "content/bit_assertion/index.html#examples",
-    "title": "Assertions",
+    "objectID": "content/verify/index.html#examples",
+    "href": "content/verify/index.html#examples",
+    "title": "Verification Checks",
     "section": "Examples",
-    "text": "Examples\nExample — Snippet from the bit::vector&lt;&gt;::set method\n/// @brief Set the element at index `i` to 1.\nconstexpr bit::vector &set(std::size_t i)\n{\n    bit_debug_assertion(i &lt; m_size, \"index `i` = \" &lt;&lt; i &lt;&lt; \" must be &lt; `m_size` which is \" &lt;&lt; m_size);\n    ...\n}\nHere m_size is holds the size of the vector — so we must have i &lt; m_size\nTo check every element access, set the BIT_DEBUG flag during compiles. If the assertion fails, the program exits with an error message that gives the offending values.\nThe bit_debug_assertion line expands to nothing if the BIT_DEBUG flag is not set during compiles.\nExample — Message from an assertion failure\n1#undef  NDEBUG\n#define BIT_DEBUG\n#include &lt;bit/bit.h&gt;\nint main()\n{\n2    std::size_t n = 12;\n    bit::vector&lt;&gt; v(n);\n3    v.set(n);\n    std::cout &lt;&lt; v &lt;&lt; \"\\n\";\n}\n\n1\n\nFor the sake of the example we added code lines to make sure the bit_assertion is triggered. In normal usage, these flags are passed through the compiler command line.\n\n2\n\nConstruct a vector of size 12 and then attempt to set the “last” element.\n\n3\n\nA deliberate but typical off-by-one index error as the valid indices are from 0 to n-1, which is 11.\n\n\nOutput\nBIT ASSERTION FAILURE:\nFunction 'set' (vector.h, line 910):\nStatement 'i &lt; m_size' is NOT true: Index i = 12 must be &lt; `m_size` = 12\nThe program will then exit.",
+    "text": "Examples\nExample — Snippet from the bit::vector&lt;&gt;::set method\n/// @brief Set the element at index `i` to 1.\nconstexpr bit::vector &set(std::size_t i)\n{\n    bit_verify(i &lt; m_size, \"index `i` = \" &lt;&lt; i &lt;&lt; \" must be &lt; `m_size` which is \" &lt;&lt; m_size);\n    ...\n}\nHere m_size is holds the size of the vector — so we must have i &lt; m_size\nTo check every element access, set the BIT_VERIFY flag during compiles. If the assertion fails, the program exits with an error message that gives the offending values.\nThe bit_verify line expands to nothing if the BIT_VERIFY flag is not set during compiles.\nExample — Message from an assertion failure\n1#define BIT_VERIFY\n#include &lt;bit/bit.h&gt;\nint main()\n{\n2    std::size_t n = 12;\n    bit::vector&lt;&gt; v(n);\n3    v.set(n);\n    std::cout &lt;&lt; v &lt;&lt; \"\\n\";\n}\n\n1\n\nFor the sake of the example we added code to make sure the bit_verify is triggered. In normal usage, the flag is passed through the compiler command line.\n\n2\n\nConstruct a vector of size 12 and then attempt to set the “last” element.\n\n3\n\nA deliberate but typical off-by-one index error as the valid indices are from 0 to n-1, which is 11.\n\n\nOutput\nBIT VERIFY FAILED:\nFunction 'set' (vector.h, line 911):\nStatement 'i &lt; m_size' is NOT true: Index i = 12 must be &lt; `m_size` = 12\nThe program will then exit.",
     "crumbs": [
       "Home",
       "Debugging",
-      "Assertions"
+      "Verifications"
     ]
   },
   {
-    "objectID": "content/bit_assertion/index.html#design-rationale",
-    "href": "content/bit_assertion/index.html#design-rationale",
-    "title": "Assertions",
+    "objectID": "content/verify/index.html#design-rationale",
+    "href": "content/verify/index.html#design-rationale",
+    "title": "Verification Checks",
     "section": "Design Rationale",
-    "text": "Design Rationale\n\nbit_debug_assertion\nIn the development cycle, it can be helpful to range-check indices and so on. However, those checks are expensive and can slow down numerical code by orders of magnitude. Therefore, we don’t want there to be any chance that those verifications are accidentally left “on” in the production code. The bit_debug_assertion(...) form covers this type of verification. Turning on these checks requires the programmer to take a specific action — namely, she must set the BIT_DEBUG flag during compile time.\nFor example, here is a pre-condition from a hypothetical dot(Vector u, Vector v) function:\nbit_debug_assertion(u.size() == v.size(), \"Vector sizes {} and {} DO NOT match!\", u.size(), v.size());\nThis code checks that the two vector arguments have equal length — a necessary constraint for the dot product operation to make sense. If the requirement is not satisfied, the code will exit with an informative message that includes the size of the two vectors.\nThe check here is off by default, and you need to do something special (i.e., define the BIT_DEBUG flag at compile time) to enable it. The idea is that production code may do many of these dot products, and we do not generally want to pay for the check. However, enabling these sorts of checks may be very useful during development.\nThe bit_debug_assertion(...) macro expands to nothing unless you set the BIT_DEBUG flag at compile time.\n\n\nbit_assertion\nOn the other hand, there are some checks where the cost of the assertion is slight when compared to the work of the function. Leaving these checks on in production is not likely to impose much of a performance penalty.\nFor example, a pre-condition for a matrix inversion method is that the input matrix must be square. Here is how we do that check in an invert(const Matrix& M) function:\nbit_assertion(M.is_square(), \"Cannot invert a {} x {} NON-square matrix!\", M.rows(), M.cols());\nWe can only invert square matrices. The M.is_square() call checks that condition and, on failure, exits the program with a helpful message. The check cost is very slight compared to the work done by the invert(...) method, so leaving it on even in production code is not a problem.\nThe check here is on by default, and you need to do something special (i.e., define the NDEBUG flag at compile time) to disable it.\nThe bit_assertion(...) macro expands to nothing only if you set the NDEBUG flag at compile time.\nThe decision to use one form vs. the other depends on the cost of doing the check versus the work done by the method in question. A primary use case for bit_debug_assertion is to do things like bounds checking on indices — from experience, this is vital during development. However, bounds-checking every index operation incurs a considerable performance penalty and can slow down numerical code by orders of magnitude. So it makes sense to have the checks in place for development but to ensure they are never there in release builds.\n\n\n\n\n\n\nMacro-land\n\n\n\nWe are in macro land here, so there are no namespaces. Typically, macros have names in caps, but the standard assert does not follow that custom, so neither do these bit_assertion macros.\n\n\n\n\nSee Also\nassert",
+    "text": "Design Rationale\nIn the development cycle, it can be helpful to range-check indices and so on. However, those checks are expensive and can slow down numerical code by orders of magnitude. Therefore, we don’t want there to be any chance that those verifications are accidentally left “on” in the production code. Our bit_verify(...) macro covers this type of verification. Turning on the checks requires the programmer to take a specific action — namely, she must set the BIT_VERIFY flag during compile time.\nFor example, here is a pre-condition from a hypothetical dot(Vector u, Vector v) function:\nbit_verify(u.size() == v.size(), \"Vector sizes {} and {} DO NOT match!\", u.size(), v.size());\nThis code checks that the two vector arguments have equal length — a necessary constraint for the dot product operation to make sense. If the requirement is not satisfied, the code will exit with an informative message that includes the size of the two vectors.\nThe check here is off by default, and you need to do something special (i.e., define the BIT_VERIFY flag at compile time) to enable it. The idea is that production code may do many of these dot products, and we do not generally want to pay for the check. However, enabling these sorts of checks may be very useful during development.\nThe bit_verify(...) macro expands to nothing unless you set the BIT_VERIFY flag at compile time.\n\n\n\n\n\n\nMacro-land\n\n\n\nWe are in macro land here, so there are no namespaces. Typically, macros have names in caps, but the standard assert does not follow that custom, so neither does bit_verify.\n\n\n\nSee Also\nassert",
     "crumbs": [
       "Home",
       "Debugging",
-      "Assertions"
+      "Verifications"
     ]
   },
   {
@@ -1078,11 +1078,11 @@
     ]
   },
   {
-    "objectID": "content/notes/design.html#assertions",
-    "href": "content/notes/design.html#assertions",
+    "objectID": "content/notes/design.html#bounds-checking",
+    "href": "content/notes/design.html#bounds-checking",
     "title": "Library Design Notes",
-    "section": "Assertions",
-    "text": "Assertions\nIn the development cycle, it can be helpful to confirm that indices are in bounds and perform other range checks. However, those checks are expensive and can slow down numerical code by orders of magnitude. We don’t want those verifications accidentally left “on” in our production code.\nFor this reason, we include our versions of the standard [std::assert] macro.\n\n\n\n\n\n\nAssertions have messages\n\n\n\nOur assertions come with the ability to print an explanation of what caused any failure.\n\n\nThe most commonly used form in the library is bit_debug_assertion(...). This form expands to nothing unless the programmer sets the BIT_DEBUG flag at compile time. That is typically done automatically only for debug software builds and is never done for release/optimized builds.\nThere is also a version bit_assertion(...) that is very similar to the [std::assert] macro with the addition of a message. Typically these are for assertions where the cost of the check is cheap compared to the cost of the work done in the method. This form expands to nothing only if the NDEBUG flag is set a compile time.",
+    "section": "Bounds checking",
+    "text": "Bounds checking\nIn the development cycle, it can be helpful to confirm that indices are in bounds and perform other range checks. However, those checks are expensive and can slow down numerical code by orders of magnitude. We don’t want those verifications accidentally left “on” in our production code.\nFor this reason, we include the bit_verify macro. The macro expands to nothing unless the programmer sets the BIT_VERIFY flag at compile time. That is typically done automatically only for debug software builds and is never done for release/optimized builds.",
     "crumbs": [
       "Home",
       "Technical Notes",
@@ -1189,7 +1189,7 @@
     "href": "content/vector/swap_elements.html",
     "title": "bit::vector — Swap Elements",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have a method to swap the values of two individual elements/bits in a bit-vector.\n1constexpr bit::vector &swap(std::size_t i, std::size_t j) const;\n\n1\n\nSwaps the values at element i and element j.\n\n\n\n\n\n\n\n\nRange checking\n\n\n\nBy default, the method does not check whether the indices are in bounds, and if they aren’t, the behavior is undefined (but bound to be bad)!\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; v(2);\n    v(0) = 0; v(1) = 1;\n    std::cout &lt;&lt; \"Before swap v = \" &lt;&lt; v &lt;&lt; \"\\n\";\n    v.swap_elements(0,1);\n    std::cout &lt;&lt; \"After  swap v = \" &lt;&lt; v &lt;&lt; \"\\n\";\n}\nOutput\nBefore swap v = [0 1]\nAfter  swap v = [1 0]\n\nSee Also\nvector::swap\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have a method to swap the values of two individual elements/bits in a bit-vector.\n1constexpr bit::vector &swap(std::size_t i, std::size_t j) const;\n\n1\n\nSwaps the values at element i and element j.\n\n\n\n\n\n\n\n\nRange checking\n\n\n\nBy default, the method does not check whether the indices are in bounds, and if they aren’t, the behavior is undefined (but bound to be bad)!\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; v(2);\n    v(0) = 0; v(1) = 1;\n    std::cout &lt;&lt; \"Before swap v = \" &lt;&lt; v &lt;&lt; \"\\n\";\n    v.swap_elements(0,1);\n    std::cout &lt;&lt; \"After  swap v = \" &lt;&lt; v &lt;&lt; \"\\n\";\n}\nOutput\nBefore swap v = [0 1]\nAfter  swap v = [1 0]\n\nSee Also\nvector::swap\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/stream.html",
@@ -1321,7 +1321,7 @@
     "href": "content/vector/index.html#instance-methods",
     "title": "The bit::vector Class",
     "section": "Instance Methods",
-    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::constructors\nConstruct bit-vectors in various ways.\n\n\nvector::random\nFactory method constructs a bit-vector with a random fill.\n\n\nvector::zeros\nFactory method to construct bit-vectors with all the bits set to 0.\n\n\nvector::ones\nFactory method to construct bit-vectors with all the bits set to 1.\n\n\nvector::unit\nFactory method to construct a unit bit-vector.\n\n\nvector::checker_board\nFactory method to construct bit-vectors with bits in a checker-board pattern 1010101…​ or 0101010…\n\n\nvector::from\nFactory methods that construct bit-vectors from the bits in an integer or from strings.\n\n\n\n\n\n\nElement Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::element\nAccess an element in a bit-vector.\n\n\nvector::operator()\nAccess an element in a bit-vector.\n\n\nvector::operator[]\nAccess an element in a bit-vector.\n\n\nvector::test\nCheck the status of a particular element in a bit-vector.\n\n\nvector::front\nAccess the first element of a bit-vector.\n\n\nvector::back\nAccess the final element of a bit-vector.\n\n\nvector::all\nAre all the bits in the bit-vector set to 1?\n\n\nvector::any\nAre any bits in the bit-vector set to 1?\n\n\nvector::none\nAre none of the bits in the bit-vector set to 1?\n\n\nvector::count\nCount the set bits in a bit-vector.\n\n\nvector::count0\nCount the unset bits in a bit-vector.\n\n\nvector::count1\nCount the set bits in a bit-vector.\n\n\nvector::parity\nParity is the number of set bits mod 2.\n\n\nvector::sub\nExtracts a sub-vector as a distinct copy of some of elements in a bit-vector.\n\n\nvector::blocks\nAccess the underlying block store as a std::vector&lt;Block&gt;.\n\n\nvector::allocator\nRead-only access to the underlying Allocator for the block store.\n\n\n\n\n\n\nBlock Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::bits_per_block\nThe number of bit-vector elements that can fit in one storage block.\n\n\nvector::block_store_type\nWe store the underlying blocks in this type of container.\n\n\nvector::blocks_needed\nComputes the number of blocks needed to store a particular bit-vector.\n\n\nvector::allocator\nThe memory manager for the block store.\n\n\nvector::block_count\nThe number of blocks in the block store.\n\n\nvector::block\nAccess an individual block.\n\n\nvector::block_index_for\nReturns the index of the block holding a particular bit-vector element.\n\n\nvector::bit_index_for\nReturns the specific bit inside that block where that particular bit-vector element resides.\n\n\nvector::blocks\nAccess the underlying block store as a block_store_type\n\n\nvector::clean\nThis sets any extra/junk bits in the last occupied block to 0.\n\n\nvector::block_constructor\nConstruct a bit::vector by copying or moving a prefilled block_store_type of blocks.\n\n\n\n\n\n\nIteration\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::if_set_call\nCalls a function for each set index.\n\n\nvector::first_set\nReturns the index location of the first set bit.\n\n\nvector::next_set\nReturns the index location of the next set bit.\n\n\nvector::final_set\nReturns the index location of the final set bit.\n\n\nvector::prev_set\nReturns the index location of the previous set bit.\n\n\nvector::set_indices\nReturns the index locations of the set bits.\n\n\nvector::unset_indices\nReturns the index locations of the unset bits.\n\n\n\n\n\n\nCapacity\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::size\nReturns the number of elements in the bit-vector\n\n\nvector::empty\nQueries whether the bit-vector is empty.\n\n\nvector::capacity\nHow many bits can a bit-vector hold before it resizes?\n\n\nvector::unused\nHow many bits can be added before a bit-vector resizes?\n\n\nvector::reserve\nReserves storage for a bit-vector without changing its size().\n\n\nvector::shrink_to_fit\nTries to reduce memory usage by freeing unused memory.\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::clear\nClears all the elements from the bit-vector so its size() becomes 0.\n\n\nvector::push\nPushes an element onto the end of the bit-vector.\n\n\nvector::pop\nRemoves the last element from the bit-vector\n\n\nvector::append\nAdds elements/bits from various sources to the end of the bit-vector.\n\n\nvector::resize\nResizes the bit-vector, padding out any added values with zeros.\n\n\nvector::swap_elements\nSwaps the values of two elements in the bit-vector.\n\n\nvector::swap\nSwaps the contents of the bit-vector with another.\n\n\nvector::replace\nMethods to replace some sub-vectors of the bit-vector with other values.\n\n\nvector::set\nSet various ranges of elements in the bit-vector to 1.\n\n\nvector::reset\nSet various ranges of elements in the bit-vector to 0.\n\n\nvector::flip\nFlip various ranges of elements in the bit-vector from 0 to 1 and vice versa.\n\n\nvector::set_if\nSets elements in a bit-vector based on the return value from a function of the element index.\n\n\nvector::flip_if\nFlips values in a bit-vector based on the return value from a function of the element index.\n\n\nvector::operator&=\nElement-by-element logical AND in-place between this bit-vector and another of equal size.\n\n\nvector::operator^=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator|=\nElement-by-element logical OR in-place between this bit-vector and another of equal size.\n\n\nvector::operator+=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator-=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator*=\nElement-by-element logical AND in-place between this bit-vector and another of equal size.\n\n\nvector::operator~\nFlips the values of all elements in this bit-vector.\n\n\nvector::operator&lt;&lt;=\nLeft shift the elements of this bit-vector in-place.\n\n\nvector::operator&gt;&gt;=\nRight shift the elements of this bit-vector in-place.\n\n\nvector::operator&lt;&lt;\nReturns a left-shifted copy of this bit-vector.\n\n\nvector::operator&gt;&gt;\nReturns a right-shifted copy of this bit-vector.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::to_string\nReturns a binary-string representation using configurable characters for set and unset elements. The elements are in vector order.\n\n\nvector::to_pretty_string\nReturns a formatted representation e.g. [1 1 0 1 0 1].\n\n\nvector::to_bit_order\nReturns a binary-string representation using configurable characters for set and unset elements. The least significant bit is on the right.\n\n\nvector::to_hex\nReturns a compact hex string representation of the bit-vector.\n\n\nvector::polynomial\nInterprets the elements of a bit-vector as the coefficients of a polynomial over \\(\\FF\\) and returns a string representation of that polynomial.\n\n\nvector::description\nWrites some descriptive data about the bit-vector to a stream.\n\n\n\n\n\n\nOther Instance Methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::trimmed_right\nReturns a copy of a bit-vector with any trailing zeros removed.\n\n\nvector::trimmed_left\nReturns a copy of a bit-vector with any leading zeros removed.\n\n\nvector::trimmed\nReturns a copy of a bit-vector with any leading or trailing zeros removed.\n\n\nvector::riffled\nReturns a copy of a bit-vector with any added interleaved zeros.\n\n\nvector::dot\nReturns the dot product of this bit-vector with another of equal size.\n\n\nvector::unit_floor\nReturns a unit bit-vector with its 1 at the location of our final set bit.\n\n\nvector::unit_ceil\nReturns a unit bit-vector with its 1 at the location one slot past our final set bit.\n\n\n\n\n\n\nDebugging\nYou can set a compile-time flag BIT_DEBUG to enable range checking and other assertions. These checks can have a substantial performance impact so typically are only used during development.\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_DEBUG\nThis compile-time flag enables extra safety checks at the cost of performance.\n\n\nNDEBUG\nThis compile-time flag disables all our safety checks — even the cheap ones.\n\n\nbit_debug_assertion\nThese assertions are only checked if you set the BIT_DEBUG flag at compile time.\n\n\nbit_assertion\nThese assertions are checked **unless* you set the NDEBUG flag at compile time.",
+    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::constructors\nConstruct bit-vectors in various ways.\n\n\nvector::random\nFactory method constructs a bit-vector with a random fill.\n\n\nvector::zeros\nFactory method to construct bit-vectors with all the bits set to 0.\n\n\nvector::ones\nFactory method to construct bit-vectors with all the bits set to 1.\n\n\nvector::unit\nFactory method to construct a unit bit-vector.\n\n\nvector::checker_board\nFactory method to construct bit-vectors with bits in a checker-board pattern 1010101…​ or 0101010…\n\n\nvector::from\nFactory methods that construct bit-vectors from the bits in an integer or from strings.\n\n\n\n\n\n\nElement Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::element\nAccess an element in a bit-vector.\n\n\nvector::operator()\nAccess an element in a bit-vector.\n\n\nvector::operator[]\nAccess an element in a bit-vector.\n\n\nvector::test\nCheck the status of a particular element in a bit-vector.\n\n\nvector::front\nAccess the first element of a bit-vector.\n\n\nvector::back\nAccess the final element of a bit-vector.\n\n\nvector::all\nAre all the bits in the bit-vector set to 1?\n\n\nvector::any\nAre any bits in the bit-vector set to 1?\n\n\nvector::none\nAre none of the bits in the bit-vector set to 1?\n\n\nvector::count\nCount the set bits in a bit-vector.\n\n\nvector::count0\nCount the unset bits in a bit-vector.\n\n\nvector::count1\nCount the set bits in a bit-vector.\n\n\nvector::parity\nParity is the number of set bits mod 2.\n\n\nvector::sub\nExtracts a sub-vector as a distinct copy of some of elements in a bit-vector.\n\n\nvector::blocks\nAccess the underlying block store as a std::vector&lt;Block&gt;.\n\n\nvector::allocator\nRead-only access to the underlying Allocator for the block store.\n\n\n\n\n\n\nBlock Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::bits_per_block\nThe number of bit-vector elements that can fit in one storage block.\n\n\nvector::block_store_type\nWe store the underlying blocks in this type of container.\n\n\nvector::blocks_needed\nComputes the number of blocks needed to store a particular bit-vector.\n\n\nvector::allocator\nThe memory manager for the block store.\n\n\nvector::block_count\nThe number of blocks in the block store.\n\n\nvector::block\nAccess an individual block.\n\n\nvector::block_index_for\nReturns the index of the block holding a particular bit-vector element.\n\n\nvector::bit_index_for\nReturns the specific bit inside that block where that particular bit-vector element resides.\n\n\nvector::blocks\nAccess the underlying block store as a block_store_type\n\n\nvector::clean\nThis sets any extra/junk bits in the last occupied block to 0.\n\n\nvector::block_constructor\nConstruct a bit::vector by copying or moving a prefilled block_store_type of blocks.\n\n\n\n\n\n\nIteration\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::if_set_call\nCalls a function for each set index.\n\n\nvector::first_set\nReturns the index location of the first set bit.\n\n\nvector::next_set\nReturns the index location of the next set bit.\n\n\nvector::final_set\nReturns the index location of the final set bit.\n\n\nvector::prev_set\nReturns the index location of the previous set bit.\n\n\nvector::set_indices\nReturns the index locations of the set bits.\n\n\nvector::unset_indices\nReturns the index locations of the unset bits.\n\n\n\n\n\n\nCapacity\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::size\nReturns the number of elements in the bit-vector\n\n\nvector::empty\nQueries whether the bit-vector is empty.\n\n\nvector::capacity\nHow many bits can a bit-vector hold before it resizes?\n\n\nvector::unused\nHow many bits can be added before a bit-vector resizes?\n\n\nvector::reserve\nReserves storage for a bit-vector without changing its size().\n\n\nvector::shrink_to_fit\nTries to reduce memory usage by freeing unused memory.\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::clear\nClears all the elements from the bit-vector so its size() becomes 0.\n\n\nvector::push\nPushes an element onto the end of the bit-vector.\n\n\nvector::pop\nRemoves the last element from the bit-vector\n\n\nvector::append\nAdds elements/bits from various sources to the end of the bit-vector.\n\n\nvector::resize\nResizes the bit-vector, padding out any added values with zeros.\n\n\nvector::swap_elements\nSwaps the values of two elements in the bit-vector.\n\n\nvector::swap\nSwaps the contents of the bit-vector with another.\n\n\nvector::replace\nMethods to replace some sub-vectors of the bit-vector with other values.\n\n\nvector::set\nSet various ranges of elements in the bit-vector to 1.\n\n\nvector::reset\nSet various ranges of elements in the bit-vector to 0.\n\n\nvector::flip\nFlip various ranges of elements in the bit-vector from 0 to 1 and vice versa.\n\n\nvector::set_if\nSets elements in a bit-vector based on the return value from a function of the element index.\n\n\nvector::flip_if\nFlips values in a bit-vector based on the return value from a function of the element index.\n\n\nvector::operator&=\nElement-by-element logical AND in-place between this bit-vector and another of equal size.\n\n\nvector::operator^=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator|=\nElement-by-element logical OR in-place between this bit-vector and another of equal size.\n\n\nvector::operator+=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator-=\nElement-by-element logical XOR in-place between this bit-vector and another of equal size.\n\n\nvector::operator*=\nElement-by-element logical AND in-place between this bit-vector and another of equal size.\n\n\nvector::operator~\nFlips the values of all elements in this bit-vector.\n\n\nvector::operator&lt;&lt;=\nLeft shift the elements of this bit-vector in-place.\n\n\nvector::operator&gt;&gt;=\nRight shift the elements of this bit-vector in-place.\n\n\nvector::operator&lt;&lt;\nReturns a left-shifted copy of this bit-vector.\n\n\nvector::operator&gt;&gt;\nReturns a right-shifted copy of this bit-vector.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::to_string\nReturns a binary-string representation using configurable characters for set and unset elements. The elements are in vector order.\n\n\nvector::to_pretty_string\nReturns a formatted representation e.g. [1 1 0 1 0 1].\n\n\nvector::to_bit_order\nReturns a binary-string representation using configurable characters for set and unset elements. The least significant bit is on the right.\n\n\nvector::to_hex\nReturns a compact hex string representation of the bit-vector.\n\n\nvector::polynomial\nInterprets the elements of a bit-vector as the coefficients of a polynomial over \\(\\FF\\) and returns a string representation of that polynomial.\n\n\nvector::description\nWrites some descriptive data about the bit-vector to a stream.\n\n\n\n\n\n\nOther Instance Methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nvector::trimmed_right\nReturns a copy of a bit-vector with any trailing zeros removed.\n\n\nvector::trimmed_left\nReturns a copy of a bit-vector with any leading zeros removed.\n\n\nvector::trimmed\nReturns a copy of a bit-vector with any leading or trailing zeros removed.\n\n\nvector::riffled\nReturns a copy of a bit-vector with any added interleaved zeros.\n\n\nvector::dot\nReturns the dot product of this bit-vector with another of equal size.\n\n\nvector::unit_floor\nReturns a unit bit-vector with its 1 at the location of our final set bit.\n\n\nvector::unit_ceil\nReturns a unit bit-vector with its 1 at the location one slot past our final set bit.\n\n\n\n\n\n\nDebugging\nYou can set a compile-time flag BIT_VERIFY to enable range checking and other assertions. These checks can have a substantial performance impact so typically are only used during development.\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_VERIFY\nThis compile-time flag enables extra safety checks at the cost of performance.\n\n\nbit_verify\nThese checks are only performed if you set the BIT_VERIFY flag at compile time.",
     "crumbs": [
       "Home",
       "Bit-Vectors",
@@ -1345,7 +1345,7 @@
     "href": "content/vector/sub.html",
     "title": "bit::vector — Extract a Sub-Vector",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to extract a sub-vector as a stand-alone, distinct copy of elements from this bit-vector.\n1constexpr bit::vector sub(std::size_t begin, std::size_t len) const;\n2constexpr bit::vector sub(int len) const;\n\n1\n\nReturns a bit-vector of size len, a copy of the elements starting at begin.\n\n2\n\nReturns a copy of the first len elements if len &gt; 0 or the final abs(len) elements if len &lt; 0.\n\n\n\n\n\n\n\n\nRange checking\n\n\n\nbegin has to be a valid index, and abs(len) elements must be available for copying. Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto v = bit::vector&lt;&gt;::random(12);\n    std::cout &lt;&lt; \"v:           \" &lt;&lt; v           &lt;&lt; \"\\n\";\n2    std::cout &lt;&lt; \"v.sub(0, 4): \" &lt;&lt; v.sub(0, 4) &lt;&lt; \"\\n\";\n3    std::cout &lt;&lt; \"v.sub(4):    \" &lt;&lt; v.sub(4)    &lt;&lt; \"\\n\";\n4    std::cout &lt;&lt; \"v.sub(-4):   \" &lt;&lt; v.sub(-4)   &lt;&lt; \"\\n\";\n5    std::cout &lt;&lt; \"v.sub(8, 4): \" &lt;&lt; v.sub(8, 4) &lt;&lt; \"\\n\";\n}\n\n1\n\nConstruct a vector of size 12 with a random fill.\n\n2\n\nExtract four elements starting at index 0.\n\n3\n\nDo the same thing using a shorthand notation.\n\n4\n\nExtract the final four elements using the shorthand notation.\n\n5\n\nDo the same thing by copying four elements starting at index 8.\n\n\nOutput\nv:           [0 1 0 0 1 0 1 0 0 1 1 0]\nv.sub(0, 4): [0 1 0 0]\nv.sub(4):    [0 1 0 0]\nv.sub(-4):   [0 1 1 0]\nv.sub(8, 4): [0 1 1 0]\n\nSee Also\nvector::replace\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to extract a sub-vector as a stand-alone, distinct copy of elements from this bit-vector.\n1constexpr bit::vector sub(std::size_t begin, std::size_t len) const;\n2constexpr bit::vector sub(int len) const;\n\n1\n\nReturns a bit-vector of size len, a copy of the elements starting at begin.\n\n2\n\nReturns a copy of the first len elements if len &gt; 0 or the final abs(len) elements if len &lt; 0.\n\n\n\n\n\n\n\n\nRange checking\n\n\n\nbegin has to be a valid index, and abs(len) elements must be available for copying. Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto v = bit::vector&lt;&gt;::random(12);\n    std::cout &lt;&lt; \"v:           \" &lt;&lt; v           &lt;&lt; \"\\n\";\n2    std::cout &lt;&lt; \"v.sub(0, 4): \" &lt;&lt; v.sub(0, 4) &lt;&lt; \"\\n\";\n3    std::cout &lt;&lt; \"v.sub(4):    \" &lt;&lt; v.sub(4)    &lt;&lt; \"\\n\";\n4    std::cout &lt;&lt; \"v.sub(-4):   \" &lt;&lt; v.sub(-4)   &lt;&lt; \"\\n\";\n5    std::cout &lt;&lt; \"v.sub(8, 4): \" &lt;&lt; v.sub(8, 4) &lt;&lt; \"\\n\";\n}\n\n1\n\nConstruct a vector of size 12 with a random fill.\n\n2\n\nExtract four elements starting at index 0.\n\n3\n\nDo the same thing using a shorthand notation.\n\n4\n\nExtract the final four elements using the shorthand notation.\n\n5\n\nDo the same thing by copying four elements starting at index 8.\n\n\nOutput\nv:           [0 1 0 0 1 0 1 0 0 1 1 0]\nv.sub(0, 4): [0 1 0 0]\nv.sub(4):    [0 1 0 0]\nv.sub(-4):   [0 1 1 0]\nv.sub(8, 4): [0 1 1 0]\n\nSee Also\nvector::replace\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/indices.html",
@@ -1394,7 +1394,7 @@
     "href": "content/vector/set.html",
     "title": "bit::vector — Change All Elements",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to set elements in a bit-vector to 1, reset them to 0, or flip them from 0 to 1 and vice versa. These methods can work on the entire bit-vector, on individual elements, or on blocks of contiguous elements.\n1constexpr bit::vector &set(std::size_t i);\nconstexpr bit::vector &reset(std::size_t i);\nconstexpr bit::vector &flip(std::size_t i);\n\n2constexpr bit::vector &set(std::size_t first,   std::size_t len);\nconstexpr bit::vector &reset(std::size_t first, std::size_t len);\nconstexpr bit::vector &flip(std::size_t first,   std::size_t len);\n\n3constexpr bit::vector &set();\nconstexpr bit::vector &reset();\nconstexpr bit::vector &flip();\n\n1\n\nSets, resets, or flips the value of the single element at index i.\n\n2\n\nSets, resets, or flips the value of len elements starting at index first.\n\n3\n\nSets, resets, or flips the elements’ values.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe len elements starting at first must fit in the valid range for the bit-vector.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThese methods return a reference to *this, so they can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 4;\n    std::size_t i = 0;\n\n    bit::vector&lt;&gt; v(n);\n\n    std::cout &lt;&lt; \"Setting ranges of elements to 1:\\n\";\n    v.reset();\n    std::cout &lt;&lt; \"Starting with vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.reset();\n            std::cout &lt;&lt; \"Setting \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.set(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    std::cout &lt;&lt; \"Setting ranges of elements to 0:\\n\";\n    v.set();\n    std::cout &lt;&lt; \"Starting with a vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.set();\n            std::cout &lt;&lt; \"Resetting \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.reset(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    std::cout &lt;&lt; \"Flipping ranges of elements from 1 to 0:\\n\";\n    v.set();\n    std::cout &lt;&lt; \"Starting with vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        // v.set();\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.set();\n            std::cout &lt;&lt; \"Flipping \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.flip(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    return 0;\n}\nOutput\nSetting ranges of elements to 1:\nStarting with a vector of size 4: [0 0 0 0]\nSetting 1 element(s) starting at position: 0: [1 0 0 0]\nSetting 2 element(s) starting at position: 0: [1 1 0 0]\nSetting 3 element(s) starting at position: 0: [1 1 1 0]\nSetting 4 element(s) starting at position: 0: [1 1 1 1]\nSetting 1 element(s) starting at position: 1: [0 1 0 0]\nSetting 2 element(s) starting at position: 1: [0 1 1 0]\nSetting 3 element(s) starting at position: 1: [0 1 1 1]\nSetting 1 element(s) starting at position: 2: [0 0 1 0]\nSetting 2 element(s) starting at position: 2: [0 0 1 1]\nSetting 1 element(s) starting at position: 3: [0 0 0 1]\n\nSetting ranges of elements to 0:\nStarting with a vector of size 4: [1 1 1 1]\nResetting 1 element(s) starting at position: 0: [0 1 1 1]\nResetting 2 element(s) starting at position: 0: [0 0 1 1]\nResetting 3 element(s) starting at position: 0: [0 0 0 1]\nResetting 4 element(s) starting at position: 0: [0 0 0 0]\nResetting 1 element(s) starting at position: 1: [1 0 1 1]\nResetting 2 element(s) starting at position: 1: [1 0 0 1]\nResetting 3 element(s) starting at position: 1: [1 0 0 0]\nResetting 1 element(s) starting at position: 2: [1 1 0 1]\nResetting 2 element(s) starting at position: 2: [1 1 0 0]\nResetting 1 element(s) starting at position: 3: [1 1 1 0]\n\nFlipping ranges of elements from 1 to 0:\nStarting with a vector of size 4: [1 1 1 1]\nFlipping 1 element(s) starting at position: 0: [0 1 1 1]\nFlipping 2 element(s) starting at position: 0: [0 0 1 1]\nFlipping 3 element(s) starting at position: 0: [0 0 0 1]\nFlipping 4 element(s) starting at position: 0: [0 0 0 0]\nFlipping 1 element(s) starting at position: 1: [1 0 1 1]\nFlipping 2 element(s) starting at position: 1: [1 0 0 1]\nFlipping 3 element(s) starting at position: 1: [1 0 0 0]\nFlipping 1 element(s) starting at position: 2: [1 1 0 1]\nFlipping 2 element(s) starting at position: 2: [1 1 0 0]\nFlipping 1 element(s) starting at position: 3: [1 1 1 0]\n\nSee Also\nvector::set_if\nvector::flip_if\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to set elements in a bit-vector to 1, reset them to 0, or flip them from 0 to 1 and vice versa. These methods can work on the entire bit-vector, on individual elements, or on blocks of contiguous elements.\n1constexpr bit::vector &set(std::size_t i);\nconstexpr bit::vector &reset(std::size_t i);\nconstexpr bit::vector &flip(std::size_t i);\n\n2constexpr bit::vector &set(std::size_t first,   std::size_t len);\nconstexpr bit::vector &reset(std::size_t first, std::size_t len);\nconstexpr bit::vector &flip(std::size_t first,   std::size_t len);\n\n3constexpr bit::vector &set();\nconstexpr bit::vector &reset();\nconstexpr bit::vector &flip();\n\n1\n\nSets, resets, or flips the value of the single element at index i.\n\n2\n\nSets, resets, or flips the value of len elements starting at index first.\n\n3\n\nSets, resets, or flips the elements’ values.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe len elements starting at first must fit in the valid range for the bit-vector.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThese methods return a reference to *this, so they can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 4;\n    std::size_t i = 0;\n\n    bit::vector&lt;&gt; v(n);\n\n    std::cout &lt;&lt; \"Setting ranges of elements to 1:\\n\";\n    v.reset();\n    std::cout &lt;&lt; \"Starting with vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.reset();\n            std::cout &lt;&lt; \"Setting \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.set(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    std::cout &lt;&lt; \"Setting ranges of elements to 0:\\n\";\n    v.set();\n    std::cout &lt;&lt; \"Starting with a vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.set();\n            std::cout &lt;&lt; \"Resetting \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.reset(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    std::cout &lt;&lt; \"Flipping ranges of elements from 1 to 0:\\n\";\n    v.set();\n    std::cout &lt;&lt; \"Starting with vector of size \" &lt;&lt; v.size() &lt;&lt; \": \" &lt;&lt; v &lt;&lt; '\\n';\n    for (i = 0; i &lt; v.size(); ++i) {\n        // v.set();\n        std::size_t len, maxLen = v.size() - i + 1;\n        for (len = 1; len &lt; maxLen; ++len) {\n            v.set();\n            std::cout &lt;&lt; \"Flipping \" &lt;&lt; len &lt;&lt; \" element(s) starting at position: \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; v.flip(i, len) &lt;&lt; '\\n';\n        }\n    }\n    std::cout &lt;&lt; '\\n';\n\n    return 0;\n}\nOutput\nSetting ranges of elements to 1:\nStarting with a vector of size 4: [0 0 0 0]\nSetting 1 element(s) starting at position: 0: [1 0 0 0]\nSetting 2 element(s) starting at position: 0: [1 1 0 0]\nSetting 3 element(s) starting at position: 0: [1 1 1 0]\nSetting 4 element(s) starting at position: 0: [1 1 1 1]\nSetting 1 element(s) starting at position: 1: [0 1 0 0]\nSetting 2 element(s) starting at position: 1: [0 1 1 0]\nSetting 3 element(s) starting at position: 1: [0 1 1 1]\nSetting 1 element(s) starting at position: 2: [0 0 1 0]\nSetting 2 element(s) starting at position: 2: [0 0 1 1]\nSetting 1 element(s) starting at position: 3: [0 0 0 1]\n\nSetting ranges of elements to 0:\nStarting with a vector of size 4: [1 1 1 1]\nResetting 1 element(s) starting at position: 0: [0 1 1 1]\nResetting 2 element(s) starting at position: 0: [0 0 1 1]\nResetting 3 element(s) starting at position: 0: [0 0 0 1]\nResetting 4 element(s) starting at position: 0: [0 0 0 0]\nResetting 1 element(s) starting at position: 1: [1 0 1 1]\nResetting 2 element(s) starting at position: 1: [1 0 0 1]\nResetting 3 element(s) starting at position: 1: [1 0 0 0]\nResetting 1 element(s) starting at position: 2: [1 1 0 1]\nResetting 2 element(s) starting at position: 2: [1 1 0 0]\nResetting 1 element(s) starting at position: 3: [1 1 1 0]\n\nFlipping ranges of elements from 1 to 0:\nStarting with a vector of size 4: [1 1 1 1]\nFlipping 1 element(s) starting at position: 0: [0 1 1 1]\nFlipping 2 element(s) starting at position: 0: [0 0 1 1]\nFlipping 3 element(s) starting at position: 0: [0 0 0 1]\nFlipping 4 element(s) starting at position: 0: [0 0 0 0]\nFlipping 1 element(s) starting at position: 1: [1 0 1 1]\nFlipping 2 element(s) starting at position: 1: [1 0 0 1]\nFlipping 3 element(s) starting at position: 1: [1 0 0 0]\nFlipping 1 element(s) starting at position: 2: [1 1 0 1]\nFlipping 2 element(s) starting at position: 2: [1 1 0 0]\nFlipping 1 element(s) starting at position: 3: [1 1 1 0]\n\nSee Also\nvector::set_if\nvector::flip_if\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/vector/description.html",
@@ -1485,7 +1485,7 @@
     "href": "content/polynomial/access.html",
     "title": "bit::polynomial — Coefficient Access",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to access the coefficients of the polynomial either individually or as a whole.\n1constexpr bool          operator[](std::size_t i) const;\n2constexpr reference     operator[](std::size_t i);\n\n3constexpr bool          get(std::size_t i) const;\n4constexpr polynomial&   set(std::size_t i, bool val=true)\n5constexpr polynomial&   reset(std::size_t i)\n\n6constexpr polynomial&   set()\n7constexpr polynomial&   reset()\n\n8constexpr const vector_type& coefficients() const;\n9constexpr polynomial& set_coefficients(vector_type&  c);\n10constexpr polynomial& set_coefficients(vector_type&& c);\n\n1\n\nRead-only access to coefficient i.\n\n2\n\nReturns a polynomial::reference object — allows modification of coefficient i.\n\n3\n\nAnother way to get read-only access to coefficient i..\n\n4\n\nSet the value of coefficient i to val.\n\n5\n\nSet the value of coefficient i to false.\n\n6\n\nSets all the polynomial coefficients to 1.\n\n7\n\nSets all the polynomial coefficients to 0.\n\n8\n\nRead-only access to all the polynomial coefficients as a bit-vector.\n\n9\n\nSets the polynomial coefficients by copying the passed-in bit-vector.\n\n10\n\nSets the polynomial coefficients by moving the passed-in bit-vector into place.\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, the methods do not check whether the index i is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThe vector_type is simply a bit::vector with the appropriate Block and Allocator template parameters.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::polynomial&lt;&gt; p{6};\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\", p, p.coefficients());\n\n    p[0] = p[3] = 1;\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\", p, p.coefficients());\n\n    p.reset(3);\n    p.set(5);\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\\n\", p, p.coefficients());\n\n    auto v = bit::vector&lt;&gt;::checker_board(10);\n    std::cout &lt;&lt; std::format(\"Before call v = {:p}\\n\", v);\n    p.set_coefficients(v);\n    std::cout &lt;&lt; std::format(\"p.set_coefficients(v) gives p = {}.\\n\", p);\n    std::cout &lt;&lt; std::format(\"After call v = {:p}\\n\\n\", v);\n\n    std::cout &lt;&lt; std::format(\"Before call v = {:p}\\n\", v);\n    p.set_coefficients(std::move(v));\n    std::cout &lt;&lt; std::format(\"p.set_coefficients(std::move(v)) gives p = {}.\\n\", p);\n    std::cout &lt;&lt; std::format(\"After call v = {:p}\\n\", v);\n}\nOutput\np(x) = 0 has coefficients [0 0 0 0 0 0]\np(x) = 1 + x^3 has coefficients [1 0 0 1 0 0]\np(x) = 1 + x^5 has coefficients [1 0 0 0 0 1]\n\nBefore call v = [1 0 1 0 1 0 1 0 1 0]\np.set_coefficients(v) gives p = 1 + x^2 + x^4 + x^6 + x^8.\nAfter call v = [1 0 1 0 1 0 1 0 1 0]\n\nBefore call v = [1 0 1 0 1 0 1 0 1 0]\np.set_coefficients(std::move(v)) gives p = 1 + x^2 + x^4 + x^6 + x^8.\nAfter call v = []\n\nSee Also\npolynomial::reference\npolynomial::size\nbit_assertion\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to access the coefficients of the polynomial either individually or as a whole.\n1constexpr bool          operator[](std::size_t i) const;\n2constexpr reference     operator[](std::size_t i);\n\n3constexpr bool          get(std::size_t i) const;\n4constexpr polynomial&   set(std::size_t i, bool val=true)\n5constexpr polynomial&   reset(std::size_t i)\n\n6constexpr polynomial&   set()\n7constexpr polynomial&   reset()\n\n8constexpr const vector_type& coefficients() const;\n9constexpr polynomial& set_coefficients(vector_type&  c);\n10constexpr polynomial& set_coefficients(vector_type&& c);\n\n1\n\nRead-only access to coefficient i.\n\n2\n\nReturns a polynomial::reference object — allows modification of coefficient i.\n\n3\n\nAnother way to get read-only access to coefficient i..\n\n4\n\nSet the value of coefficient i to val.\n\n5\n\nSet the value of coefficient i to false.\n\n6\n\nSets all the polynomial coefficients to 1.\n\n7\n\nSets all the polynomial coefficients to 0.\n\n8\n\nRead-only access to all the polynomial coefficients as a bit-vector.\n\n9\n\nSets the polynomial coefficients by copying the passed-in bit-vector.\n\n10\n\nSets the polynomial coefficients by moving the passed-in bit-vector into place.\n\n\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, the methods do not check whether the index i is in bounds. The behavior is undefined if it is out of bounds, but it will surely not be good! Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThe vector_type is simply a bit::vector with the appropriate Block and Allocator template parameters.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::polynomial&lt;&gt; p{6};\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\", p, p.coefficients());\n\n    p[0] = p[3] = 1;\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\", p, p.coefficients());\n\n    p.reset(3);\n    p.set(5);\n    std::cout &lt;&lt; std::format(\"p(x) = {} has coefficients {:p}\\n\\n\", p, p.coefficients());\n\n    auto v = bit::vector&lt;&gt;::checker_board(10);\n    std::cout &lt;&lt; std::format(\"Before call v = {:p}\\n\", v);\n    p.set_coefficients(v);\n    std::cout &lt;&lt; std::format(\"p.set_coefficients(v) gives p = {}.\\n\", p);\n    std::cout &lt;&lt; std::format(\"After call v = {:p}\\n\\n\", v);\n\n    std::cout &lt;&lt; std::format(\"Before call v = {:p}\\n\", v);\n    p.set_coefficients(std::move(v));\n    std::cout &lt;&lt; std::format(\"p.set_coefficients(std::move(v)) gives p = {}.\\n\", p);\n    std::cout &lt;&lt; std::format(\"After call v = {:p}\\n\", v);\n}\nOutput\np(x) = 0 has coefficients [0 0 0 0 0 0]\np(x) = 1 + x^3 has coefficients [1 0 0 1 0 0]\np(x) = 1 + x^5 has coefficients [1 0 0 0 0 1]\n\nBefore call v = [1 0 1 0 1 0 1 0 1 0]\np.set_coefficients(v) gives p = 1 + x^2 + x^4 + x^6 + x^8.\nAfter call v = [1 0 1 0 1 0 1 0 1 0]\n\nBefore call v = [1 0 1 0 1 0 1 0 1 0]\np.set_coefficients(std::move(v)) gives p = 1 + x^2 + x^4 + x^6 + x^8.\nAfter call v = []\n\nSee Also\npolynomial::reference\npolynomial::size\nbit_verify\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/polynomial/times_x.html",
@@ -1541,7 +1541,7 @@
     "href": "content/polynomial/evaluation.html#matrix-arguments",
     "title": "bit::polynomial — Polynomial Evaluation",
     "section": "Matrix Arguments",
-    "text": "Matrix Arguments\nIf M is a square bit-matrix then we can evaluate the sum: \\[\np(M) = p_0 I + p_1 M + p_2 M^2 + \\cdots + p_{n-1} M^{n-1}.\n\\] I is the identity matrix with identical dimensions to M. The sum uses Horner’s method.\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and the bit_assertion macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto M = bit::matrix&lt;&gt;::identity(6);\n    std::cout &lt;&lt; std::format(\"Bit-matrix M:\\n{}\\n\", M);\n\n    bit::polynomial p{16, [](size_t k) { return (k + 1) % 2; }};\n    std::cout &lt;&lt; std::format(\"p(M): {:M}\\n{}\\n\", p, p(M));\n\n    bit::polynomial q{17, [](size_t k) { return (k + 1) % 2; }};\n    std::cout &lt;&lt; std::format(\"q(M): {:M}\\n{}\\n\", q, q(M));\n}\nOutput\nBit-matrix M:\n100000\n010000\n001000\n000100\n000010\n000001\np(M): 1 + M^2 + M^4 + M^6 + M^8 + M^10 + M^12 + M^14\n000000\n000000\n000000\n000000\n000000\n000000\nq(M): 1 + M^2 + M^4 + M^6 + M^8 + M^10 + M^12 + M^14 + M^16\n100000\n010000\n001000\n000100\n000010\n000001\n\nSee Also\nmatrix::pow\nmatrix::pow2"
+    "text": "Matrix Arguments\nIf M is a square bit-matrix then we can evaluate the sum: \\[\np(M) = p_0 I + p_1 M + p_2 M^2 + \\cdots + p_{n-1} M^{n-1}.\n\\] I is the identity matrix with identical dimensions to M. The sum uses Horner’s method.\n\n\n\n\n\n\nThe bit-matrix argument must be square\n\n\n\nThe input matrix must be square, and, if the BIT_VERIFY flag is set at compile time, the bit_verify macro checks that pre-condition.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    auto M = bit::matrix&lt;&gt;::identity(6);\n    std::cout &lt;&lt; std::format(\"Bit-matrix M:\\n{}\\n\", M);\n\n    bit::polynomial p{16, [](size_t k) { return (k + 1) % 2; }};\n    std::cout &lt;&lt; std::format(\"p(M): {:M}\\n{}\\n\", p, p(M));\n\n    bit::polynomial q{17, [](size_t k) { return (k + 1) % 2; }};\n    std::cout &lt;&lt; std::format(\"q(M): {:M}\\n{}\\n\", q, q(M));\n}\nOutput\nBit-matrix M:\n100000\n010000\n001000\n000100\n000010\n000001\np(M): 1 + M^2 + M^4 + M^6 + M^8 + M^10 + M^12 + M^14\n000000\n000000\n000000\n000000\n000000\n000000\nq(M): 1 + M^2 + M^4 + M^6 + M^8 + M^10 + M^12 + M^14 + M^16\n100000\n010000\n001000\n000100\n000010\n000001\n\nSee Also\nmatrix::pow\nmatrix::pow2"
   },
   {
     "objectID": "content/polynomial/split.html",
@@ -1569,7 +1569,7 @@
     "href": "content/matrix/all.html",
     "title": "bit::matrix — Check on Set Bits",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nChecks whether all, any, or none of the elements in a bit-matrix are set (i.e. 1).\n1constexpr bool all() const;\n2constexpr bool any() const;\n3constexpr bool none() const;\n\n1\n\nReturn true if all the elements in the bit-matrix are 1; otherwise, false.\n\n2\n\nReturn true if any elements in the bit-matrix are 1; otherwise, false.\n\n3\n\nReturn true if none of the elements in the bit-matrix are 1; otherwise, false.\n\n\n\n\n\n\n\n\nEmpty bit-matrices\n\n\n\nCalling these methods for an empty bit-matrix is likely an error — if you set the BIT_DEBUG flag at compile time, we throw an exception with a helpful message. If the BIT_DEBUG flag is not set, all() and none() both return true while any() will return false.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(\"000 000 000\");\n    bit::matrix&lt;&gt; m2(\"010 101 010\");\n    bit::matrix&lt;&gt; m3(\"111 111 111\");\n\n    std::cout\n        &lt;&lt; \"matrix\\t\\t\" &lt;&lt; \"all\\t\" &lt;&lt; \"any\\t\" &lt;&lt; \"none\\n\"\n        &lt;&lt; m1 &lt;&lt; \"\\t\\t\" &lt;&lt; m1.all() &lt;&lt; '\\t' &lt;&lt; m1.any() &lt;&lt; '\\t' &lt;&lt; m1.none() &lt;&lt; \"\\n\\n\"\n        &lt;&lt; m2 &lt;&lt; \"\\t\\t\" &lt;&lt; m2.all() &lt;&lt; '\\t' &lt;&lt; m2.any() &lt;&lt; '\\t' &lt;&lt; m2.none() &lt;&lt; \"\\n\\n\"\n        &lt;&lt; m3 &lt;&lt; \"\\t\\t\" &lt;&lt; m3.all() &lt;&lt; '\\t' &lt;&lt; m3.any() &lt;&lt; '\\t' &lt;&lt; m3.none() &lt;&lt; \"\\n\";\n}\nOutput\nmatrix          all     any     none\n│0 0 0│\n│0 0 0│\n│0 0 0│         0       0       1\n\n│0 1 0│\n│1 0 1│\n│0 1 0│         0       1       0\n\n│1 1 1│\n│1 1 1│\n│1 1 1│         1       1       0\n\nSee Also\nmatrix::count\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nChecks whether all, any, or none of the elements in a bit-matrix are set (i.e. 1).\n1constexpr bool all() const;\n2constexpr bool any() const;\n3constexpr bool none() const;\n\n1\n\nReturn true if all the elements in the bit-matrix are 1; otherwise, false.\n\n2\n\nReturn true if any elements in the bit-matrix are 1; otherwise, false.\n\n3\n\nReturn true if none of the elements in the bit-matrix are 1; otherwise, false.\n\n\n\n\n\n\n\n\nEmpty bit-matrices\n\n\n\nCalling these methods for an empty bit-matrix is likely an error — if you set the BIT_VERIFY flag at compile time, we throw an exception with a helpful message. If the BIT_VERIFY flag is not set, all() and none() both return true while any() will return false.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(\"000 000 000\");\n    bit::matrix&lt;&gt; m2(\"010 101 010\");\n    bit::matrix&lt;&gt; m3(\"111 111 111\");\n\n    std::cout\n        &lt;&lt; \"matrix\\t\\t\" &lt;&lt; \"all\\t\" &lt;&lt; \"any\\t\" &lt;&lt; \"none\\n\"\n        &lt;&lt; m1 &lt;&lt; \"\\t\\t\" &lt;&lt; m1.all() &lt;&lt; '\\t' &lt;&lt; m1.any() &lt;&lt; '\\t' &lt;&lt; m1.none() &lt;&lt; \"\\n\\n\"\n        &lt;&lt; m2 &lt;&lt; \"\\t\\t\" &lt;&lt; m2.all() &lt;&lt; '\\t' &lt;&lt; m2.any() &lt;&lt; '\\t' &lt;&lt; m2.none() &lt;&lt; \"\\n\\n\"\n        &lt;&lt; m3 &lt;&lt; \"\\t\\t\" &lt;&lt; m3.all() &lt;&lt; '\\t' &lt;&lt; m3.any() &lt;&lt; '\\t' &lt;&lt; m3.none() &lt;&lt; \"\\n\";\n}\nOutput\nmatrix          all     any     none\n│0 0 0│\n│0 0 0│\n│0 0 0│         0       0       1\n\n│0 1 0│\n│1 0 1│\n│0 1 0│         0       1       0\n\n│1 1 1│\n│1 1 1│\n│1 1 1│         1       1       0\n\nSee Also\nmatrix::count\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/stream.html",
@@ -1597,21 +1597,21 @@
     "href": "content/matrix/characteristic_polynomial.html",
     "title": "bit::matrix — Characteristic Polynomial",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nFinds the characteristic polynomial of a square bit-matrix.\nbit::vector&lt;Block, Allocator&gt;\ncharacteristic_polynomial(const matrix&lt;Block, Allocator&gt;& A);\nReturns a bit-vector p where the characteristic polynomial for the bit-matrix \\(A\\) is given by \\[\np(\\lambda) = p_0  + p_1 \\lambda + p_2 \\lambda^2 + \\cdots\n\\] The bit-matrix must be non-empty and square; otherwise, the method throws a std::invalid_argument exception.\nDanilevsky’s algorithm is used to compute the characteristic polynomial. We coded the algorithm considering the nature of arithmetic over \\(\\FF\\), which means that the characteristic polynomial of large bit-matrices can be efficiently computed — even for those with millions of entries that would choke more naive implementations.\nExample — identity matrices\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    for(std::size_t i = 1; i &lt; 8; ++i) {\n        auto M = bit::matrix&lt;&gt;::identity(i);\n        auto p = bit::characteristic_polynomial(M);\n        std::cout &lt;&lt; \"Char-poly for the \"\n                  &lt;&lt; i &lt;&lt; \" x \" &lt;&lt; i &lt;&lt; \" identity: \" &lt;&lt; bit::polynomial(p) &lt;&lt; '\\n';\n    }\n}\n\n1\n\nWe generate identity matrices from 1 x 1 to 7 x 7 and get the characteristic polynomial in each case.\n\n\nOutput\nChar-poly for the 1 x 1 identity: 1 + x^1\nChar-poly for the 2 x 2 identity: 1 + x^2\nChar-poly for the 3 x 3 identity: 1 + x^1 + x^2 + x^3\nChar-poly for the 4 x 4 identity: 1 + x^4\nChar-poly for the 5 x 5 identity: 1 + x^1 + x^4 + x^5\nChar-poly for the 6 x 6 identity: 1 + x^2 + x^4 + x^6\nChar-poly for the 7 x 7 identity: 1 + x^1 + x^2 + x^3 + x^4 + x^5 + x^6 + x^7\nWe can easily verify these.\nFor example, if we consider the 7 x 7 identity matrix, it is clear that the characteristic polynomial is given by \\[\np(\\lambda) = (\\lambda - 1)^7 = \\lambda ^7-7 \\lambda ^6+21 \\lambda ^5-35 \\lambda ^4+35 \\lambda ^3-21 \\lambda ^2+7 \\lambda -1\n\\] In \\(\\FF\\), even coefficients are zero, and odd ones, whether positive or negative, are one, so \\(p(\\lambda)\\) becomes \\[\np(\\lambda) = \\lambda ^7 + \\lambda ^6 + \\lambda ^5 + \\lambda ^4 + \\lambda ^3 + \\lambda ^2 + \\lambda + 1\n\\] Therefore, we expect to get the \\(\\FF\\) coefficients as 11111111, which agrees with the output above.\nExample Bit-matrices should satisfy their characteristic polynomial\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    // For this example - turn off BIT_DEBUG and enable optimization here!\n1    auto M = bit::matrix&lt;&gt;::random(512);\n    auto p = bit::characteristic_polynomial(M);\n    std::cout &lt;&lt; \"Characteristic polynomial:\\n\" &lt;&lt; p &lt;&lt; \"\\n\\n\";\n2    auto C = p(M);\n    std::cout &lt;&lt; \"Does the bit-matrix satisfy its characteristic polynomial? \"\n              &lt;&lt; (C.none() ? \"YES\" : \"NO\") &lt;&lt; '\\n';\n}\n\n1\n\nPay attention to the comment! We can handle much larger matrices, but you must enable compiler optimizations.\n\n2\n\nAll matrices should satisfy their characteristic polynomial so \\(p(M)\\) should return the zero bit-matrix.\n\n\nOutput\nCharacteristic polynomial:\nx^1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^12 + x^15 + x^18 + x^20 + x^22 + x^24 + x^27 + x^29 + x^30 + x^31 + x^33 + x^34 + x^35 + x^37 + x^38 + x^39 + x^40 + x^41 + x^42 + x^43 + x^45 + x^46 + x^49 + x^50 + x^51 + x^52 + x^53 + x^54 + x^56 + x^57 + x^63 + x^64 + x^65 + x^66 + x^67 + x^70 + x^74 + x^75 + x^76 + x^77 + x^79 + x^81 + x^87 + x^90 + x^91 + x^93 + x^96 + x^97 + x^98 + x^101 + x^104 + x^105 + x^106 + x^111 + x^112 + x^115 + x^119 + x^120 + x^121 + x^122 + x^127 + x^128 + x^129 + x^130 + x^133 + x^135 + x^140 + x^142 + x^144 + x^145 + x^147 + x^148 + x^151 + x^153 + x^154 + x^157 + x^158 + x^159 + x^162 + x^163 + x^164 + x^165 + x^166 + x^171 + x^172 + x^176 + x^177 + x^178 + x^179 + x^180 + x^181 + x^182 + x^186 + x^188 + x^189 + x^191 + x^193 + x^194 + x^196 + x^197 + x^198 + x^201 + x^203 + x^206 + x^210 + x^211 + x^220 + x^221 + x^222 + x^226 + x^227 + x^228 + x^229 + x^230 + x^233 + x^235 + x^236 + x^238 + x^239 + x^240 + x^242 + x^247 + x^250 + x^251 + x^256 + x^257 + x^258 + x^260 + x^261 + x^262 + x^264 + x^265 + x^268 + x^269 + x^270 + x^273 + x^274 + x^278 + x^279 + x^280 + x^282 + x^283 + x^284 + x^285 + x^286 + x^289 + x^292 + x^293 + x^295 + x^296 + x^297 + x^298 + x^306 + x^307 + x^309 + x^314 + x^316 + x^320 + x^324 + x^326 + x^328 + x^330 + x^331 + x^334 + x^335 + x^336 + x^337 + x^341 + x^342 + x^343 + x^345 + x^347 + x^350 + x^351 + x^352 + x^357 + x^360 + x^365 + x^366 + x^369 + x^372 + x^373 + x^376 + x^377 + x^378 + x^379 + x^380 + x^381 + x^382 + x^383 + x^385 + x^386 + x^387 + x^388 + x^389 + x^393 + x^397 + x^400 + x^401 + x^402 + x^405 + x^406 + x^408 + x^409 + x^410 + x^412 + x^413 + x^414 + x^415 + x^417 + x^418 + x^429 + x^431 + x^434 + x^435 + x^436 + x^438 + x^439 + x^441 + x^443 + x^444 + x^445 + x^447 + x^450 + x^451 + x^452 + x^453 + x^455 + x^457 + x^458 + x^459 + x^460 + x^461 + x^463 + x^464 + x^465 + x^468 + x^470 + x^471 + x^472 + x^473 + x^475 + x^480 + x^481 + x^482 + x^483 + x^487 + x^488 + x^490 + x^492 + x^493 + x^498 + x^499 + x^501 + x^502 + x^503 + x^506 + x^509 + x^512\n\nDoes the bit-matrix satisfy its characteristic polynomial? YES\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nFinds the characteristic polynomial of a square bit-matrix.\nbit::vector&lt;Block, Allocator&gt;\ncharacteristic_polynomial(const matrix&lt;Block, Allocator&gt;& A);\nReturns a bit-vector p where the characteristic polynomial for the bit-matrix \\(A\\) is given by \\[\np(\\lambda) = p_0  + p_1 \\lambda + p_2 \\lambda^2 + \\cdots\n\\] The bit-matrix must be non-empty and square; otherwise, the method throws a std::invalid_argument exception.\nDanilevsky’s algorithm is used to compute the characteristic polynomial. We coded the algorithm considering the nature of arithmetic over \\(\\FF\\), which means that the characteristic polynomial of large bit-matrices can be efficiently computed — even for those with millions of entries that would choke more naive implementations.\nExample — identity matrices\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    for(std::size_t i = 1; i &lt; 8; ++i) {\n        auto M = bit::matrix&lt;&gt;::identity(i);\n        auto p = bit::characteristic_polynomial(M);\n        std::cout &lt;&lt; \"Char-poly for the \"\n                  &lt;&lt; i &lt;&lt; \" x \" &lt;&lt; i &lt;&lt; \" identity: \" &lt;&lt; bit::polynomial(p) &lt;&lt; '\\n';\n    }\n}\n\n1\n\nWe generate identity matrices from 1 x 1 to 7 x 7 and get the characteristic polynomial in each case.\n\n\nOutput\nChar-poly for the 1 x 1 identity: 1 + x^1\nChar-poly for the 2 x 2 identity: 1 + x^2\nChar-poly for the 3 x 3 identity: 1 + x^1 + x^2 + x^3\nChar-poly for the 4 x 4 identity: 1 + x^4\nChar-poly for the 5 x 5 identity: 1 + x^1 + x^4 + x^5\nChar-poly for the 6 x 6 identity: 1 + x^2 + x^4 + x^6\nChar-poly for the 7 x 7 identity: 1 + x^1 + x^2 + x^3 + x^4 + x^5 + x^6 + x^7\nWe can easily verify these.\nFor example, if we consider the 7 x 7 identity matrix, it is clear that the characteristic polynomial is given by \\[\np(\\lambda) = (\\lambda - 1)^7 = \\lambda ^7-7 \\lambda ^6+21 \\lambda ^5-35 \\lambda ^4+35 \\lambda ^3-21 \\lambda ^2+7 \\lambda -1\n\\] In \\(\\FF\\), even coefficients are zero, and odd ones, whether positive or negative, are one, so \\(p(\\lambda)\\) becomes \\[\np(\\lambda) = \\lambda ^7 + \\lambda ^6 + \\lambda ^5 + \\lambda ^4 + \\lambda ^3 + \\lambda ^2 + \\lambda + 1\n\\] Therefore, we expect to get the \\(\\FF\\) coefficients as 11111111, which agrees with the output above.\nExample Bit-matrices should satisfy their characteristic polynomial\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    // For this example - turn off BIT_VERIFY and enable optimization here!\n1    auto M = bit::matrix&lt;&gt;::random(512);\n    auto p = bit::characteristic_polynomial(M);\n    std::cout &lt;&lt; \"Characteristic polynomial:\\n\" &lt;&lt; p &lt;&lt; \"\\n\\n\";\n2    auto C = p(M);\n    std::cout &lt;&lt; \"Does the bit-matrix satisfy its characteristic polynomial? \"\n              &lt;&lt; (C.none() ? \"YES\" : \"NO\") &lt;&lt; '\\n';\n}\n\n1\n\nPay attention to the comment! We can handle much larger matrices, but you must enable compiler optimizations.\n\n2\n\nAll matrices should satisfy their characteristic polynomial so \\(p(M)\\) should return the zero bit-matrix.\n\n\nOutput\nCharacteristic polynomial:\nx^1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^12 + x^15 + x^18 + x^20 + x^22 + x^24 + x^27 + x^29 + x^30 + x^31 + x^33 + x^34 + x^35 + x^37 + x^38 + x^39 + x^40 + x^41 + x^42 + x^43 + x^45 + x^46 + x^49 + x^50 + x^51 + x^52 + x^53 + x^54 + x^56 + x^57 + x^63 + x^64 + x^65 + x^66 + x^67 + x^70 + x^74 + x^75 + x^76 + x^77 + x^79 + x^81 + x^87 + x^90 + x^91 + x^93 + x^96 + x^97 + x^98 + x^101 + x^104 + x^105 + x^106 + x^111 + x^112 + x^115 + x^119 + x^120 + x^121 + x^122 + x^127 + x^128 + x^129 + x^130 + x^133 + x^135 + x^140 + x^142 + x^144 + x^145 + x^147 + x^148 + x^151 + x^153 + x^154 + x^157 + x^158 + x^159 + x^162 + x^163 + x^164 + x^165 + x^166 + x^171 + x^172 + x^176 + x^177 + x^178 + x^179 + x^180 + x^181 + x^182 + x^186 + x^188 + x^189 + x^191 + x^193 + x^194 + x^196 + x^197 + x^198 + x^201 + x^203 + x^206 + x^210 + x^211 + x^220 + x^221 + x^222 + x^226 + x^227 + x^228 + x^229 + x^230 + x^233 + x^235 + x^236 + x^238 + x^239 + x^240 + x^242 + x^247 + x^250 + x^251 + x^256 + x^257 + x^258 + x^260 + x^261 + x^262 + x^264 + x^265 + x^268 + x^269 + x^270 + x^273 + x^274 + x^278 + x^279 + x^280 + x^282 + x^283 + x^284 + x^285 + x^286 + x^289 + x^292 + x^293 + x^295 + x^296 + x^297 + x^298 + x^306 + x^307 + x^309 + x^314 + x^316 + x^320 + x^324 + x^326 + x^328 + x^330 + x^331 + x^334 + x^335 + x^336 + x^337 + x^341 + x^342 + x^343 + x^345 + x^347 + x^350 + x^351 + x^352 + x^357 + x^360 + x^365 + x^366 + x^369 + x^372 + x^373 + x^376 + x^377 + x^378 + x^379 + x^380 + x^381 + x^382 + x^383 + x^385 + x^386 + x^387 + x^388 + x^389 + x^393 + x^397 + x^400 + x^401 + x^402 + x^405 + x^406 + x^408 + x^409 + x^410 + x^412 + x^413 + x^414 + x^415 + x^417 + x^418 + x^429 + x^431 + x^434 + x^435 + x^436 + x^438 + x^439 + x^441 + x^443 + x^444 + x^445 + x^447 + x^450 + x^451 + x^452 + x^453 + x^455 + x^457 + x^458 + x^459 + x^460 + x^461 + x^463 + x^464 + x^465 + x^468 + x^470 + x^471 + x^472 + x^473 + x^475 + x^480 + x^481 + x^482 + x^483 + x^487 + x^488 + x^490 + x^492 + x^493 + x^498 + x^499 + x^501 + x^502 + x^503 + x^506 + x^509 + x^512\n\nDoes the bit-matrix satisfy its characteristic polynomial? YES\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/access.html",
     "href": "content/matrix/access.html",
     "title": "bit::matrix — Element Access",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to access the rows, the columns, and the individual elements/bits in a bit-matrix.\nconstexpr bool\n1operator()(std::size_t i, std::size_t j);\n\nconstexpr bool\n2test(std::size_t i, std::size_t j) const;\n\nconstexpr bit::vector::reference\n3operator()(std::size_t i, std::size_t j);\n\nconstexpr const bit::vector&\n4row(std::size_t i) const;\n\nconstexpr bit::vector&\nrow(std::size_t i);\n\nconstexpr const bit::vector&\n5operator[](std::size_t i) const;\n\nconstexpr bit::vector&\noperator[](std::size_t i);\n\nconstexpr bit::vector\n6col(std::size_t j) const;\n\n1\n\nAccesses the element at (i, j).\n\n2\n\nAnother way to access element (i, j).\n\n3\n\nReturns an object of type vector::reference that lets you write to slot (i, j).\n\n4\n\nRead-only & read-write access to the elements in row i of a bit-matrix.\n\n5\n\nSynonyms for the row(i) methods to allow for alternate C style indexing a la matrix[i][j].\n\n6\n\nRead-only access to the elements in column i of a bit-matrix.\n\n\n\n\n\n\n\n\nRange checks\n\n\n\nIn general, these methods do not check whether an index is in bounds, and if it isn’t, the behavior is undefined (but bound to be wrong!) Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 4;\n    auto mat = bit::matrix&lt;&gt;::random(n);\n    std::cout &lt;&lt; \"bit::matrix:\\n\";\n    std::cout &lt;&lt; mat &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"By rows ...\\n\";\n    for (std::size_t i = 0; i &lt; n; ++i)\n        std::cout &lt;&lt; \"Row \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; mat[i] &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"By columns ...\\n\";\n    for (std::size_t i = 0; i &lt; n; ++i)\n        std::cout &lt;&lt; \"Col \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; mat.col(i) &lt;&lt; '\\n';\n}\nOutput\nbit::matrix:\n│0 1 1 0│\n│0 1 0 0│\n│0 1 1 0│\n│0 1 0 0│\nBy rows ...\nRow 0: [0 1 1 0]\nRow 1: [0 1 0 0]\nRow 2: [0 1 1 0]\nRow 3: [0 1 0 0]\nBy columns ...\nCol 0: [0 0 0 0]\nCol 1: [1 1 1 1]\nCol 2: [1 0 1 0]\n\nSee Also\nvector::reference\nbit_assertion\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods to access the rows, the columns, and the individual elements/bits in a bit-matrix.\nconstexpr bool\n1operator()(std::size_t i, std::size_t j);\n\nconstexpr bool\n2test(std::size_t i, std::size_t j) const;\n\nconstexpr bit::vector::reference\n3operator()(std::size_t i, std::size_t j);\n\nconstexpr const bit::vector&\n4row(std::size_t i) const;\n\nconstexpr bit::vector&\nrow(std::size_t i);\n\nconstexpr const bit::vector&\n5operator[](std::size_t i) const;\n\nconstexpr bit::vector&\noperator[](std::size_t i);\n\nconstexpr bit::vector\n6col(std::size_t j) const;\n\n1\n\nAccesses the element at (i, j).\n\n2\n\nAnother way to access element (i, j).\n\n3\n\nReturns an object of type vector::reference that lets you write to slot (i, j).\n\n4\n\nRead-only & read-write access to the elements in row i of a bit-matrix.\n\n5\n\nSynonyms for the row(i) methods to allow for alternate C style indexing a la matrix[i][j].\n\n6\n\nRead-only access to the elements in column i of a bit-matrix.\n\n\n\n\n\n\n\n\nRange checks\n\n\n\nIn general, these methods do not check whether an index is in bounds, and if it isn’t, the behavior is undefined (but bound to be wrong!) Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    std::size_t n = 4;\n    auto mat = bit::matrix&lt;&gt;::random(n);\n    std::cout &lt;&lt; \"bit::matrix:\\n\";\n    std::cout &lt;&lt; mat &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"By rows ...\\n\";\n    for (std::size_t i = 0; i &lt; n; ++i)\n        std::cout &lt;&lt; \"Row \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; mat[i] &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"By columns ...\\n\";\n    for (std::size_t i = 0; i &lt; n; ++i)\n        std::cout &lt;&lt; \"Col \" &lt;&lt; i &lt;&lt; \": \" &lt;&lt; mat.col(i) &lt;&lt; '\\n';\n}\nOutput\nbit::matrix:\n│0 1 1 0│\n│0 1 0 0│\n│0 1 1 0│\n│0 1 0 0│\nBy rows ...\nRow 0: [0 1 1 0]\nRow 1: [0 1 0 0]\nRow 2: [0 1 1 0]\nRow 3: [0 1 0 0]\nBy columns ...\nCol 0: [0 0 0 0]\nCol 1: [1 1 1 1]\nCol 2: [1 0 1 0]\n\nSee Also\nvector::reference\nbit_verify\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/dot.html",
     "href": "content/matrix/dot.html",
     "title": "bit::matrix — Bit-Matrix Multiplication",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nComputes the dot product of a bit-vector with a bit-matrix, a bit-matrix with a bit-vector, and a bit-matrix with another bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const vector&lt;Block, Allocator&gt;\n1dot(const matrix&lt;Block, Allocator&gt; &M, const vector&lt;Block, Allocator&gt; &v);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const vector&lt;Block, Allocator&gt;\n2dot(const vector&lt;Block, Allocator&gt; &v, const matrix&lt;Block, Allocator&gt; &M);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const matrix&lt;Block, Allocator&gt;\n3dot(const matrix&lt;Block, Allocator&gt; &M, const matrix&lt;Block, Allocator&gt; &N);\n\n1\n\nComputes \\(M \\cdot v\\)\nIf M is r x c, then v.size() must be c. The returned bit-vector will have size r.\n\n2\n\nComputes \\(v \\cdot M\\)\nIf M is r x c, then v.size() must be r. The returned bit-vector will have size c.\n\n3\n\nComputes \\(M \\cdot N\\)\nIf M is a x b, then N must be b x c for some c. The returned bit-matrix will be a x c.\n\n\nThese dot products are defined by: \\[\n\\begin{aligned}\n    \\left(M \\cdot v\\right)_i       &=  \\sum_j M_{ij} \\times v_j    \\\\\n    \\left(v \\cdot M\\right)_j       &=  \\sum_i v_i \\times M_{ij}    \\\\\n    \\left(M \\cdot N\\right)_{ij}    &=  \\sum_k M_{ik} \\times N_{kj}\n\\end{aligned}\n\\] In the case of \\(\\FF\\), the product is replaced by logical AND, and the sum by the logical XOR operation.\nThe dot product is a critical operation in linear algebra, so it is fortunate that AND’ing and XOR’ing for bit-matrices and bit-vectors can be done very efficiently over blocks of elements simultaneously.\n\n\n\n\n\n\nRange checking\n\n\n\nThe function arguments must have compatible sizes.\nSet the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; u(6, [](size_t k) { return k % 2; });\n    bit::vector&lt;&gt; v(8, [](size_t k) { return (k + 1)% 2; });\n\n    bit::matrix&lt;&gt; M(6, 8, [](size_t i, size_t j) { return i == j; });\n    bit::matrix&lt;&gt; N(8, 4, [](size_t i, size_t j) { return (i + j)%2; });\n\n    std::cout &lt;&lt; \"bit::matrix M:\\n\" &lt;&lt; M &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"bit::matrix N:\\n\" &lt;&lt; N &lt;&lt; \"\\n\\n\";\n\n    std::cout &lt;&lt; \"dot(\" &lt;&lt; u &lt;&lt; \", M)     = \" &lt;&lt; dot(u, M) &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"dot(M, \" &lt;&lt; v &lt;&lt; \") = \" &lt;&lt; dot(M, v) &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"dot(M, N):\\n\" &lt;&lt; dot(M, N) &lt;&lt; \"\\n\";\n}\nOutput\nbit::matrix M:\n│1 0 0 0 0 0 0 0│\n│0 1 0 0 0 0 0 0│\n│0 0 1 0 0 0 0 0│\n│0 0 0 1 0 0 0 0│\n│0 0 0 0 1 0 0 0│\n│0 0 0 0 0 1 0 0│\n\nbit::matrix N:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n\ndot([0 1 0 1 0 1], M)     = [0 1 0 1 0 1 0 0]\ndot(M, [1 0 1 0 1 0 1 0]) = [1 0 1 0 1 0]\n\ndot(M, N):\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nComputes the dot product of a bit-vector with a bit-matrix, a bit-matrix with a bit-vector, and a bit-matrix with another bit-matrix.\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const vector&lt;Block, Allocator&gt;\n1dot(const matrix&lt;Block, Allocator&gt; &M, const vector&lt;Block, Allocator&gt; &v);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const vector&lt;Block, Allocator&gt;\n2dot(const vector&lt;Block, Allocator&gt; &v, const matrix&lt;Block, Allocator&gt; &M);\n\ntemplate&lt;std::unsigned_integral Block, typename Allocator&gt;\nconstexpr const matrix&lt;Block, Allocator&gt;\n3dot(const matrix&lt;Block, Allocator&gt; &M, const matrix&lt;Block, Allocator&gt; &N);\n\n1\n\nComputes \\(M \\cdot v\\)\nIf M is r x c, then v.size() must be c. The returned bit-vector will have size r.\n\n2\n\nComputes \\(v \\cdot M\\)\nIf M is r x c, then v.size() must be r. The returned bit-vector will have size c.\n\n3\n\nComputes \\(M \\cdot N\\)\nIf M is a x b, then N must be b x c for some c. The returned bit-matrix will be a x c.\n\n\nThese dot products are defined by: \\[\n\\begin{aligned}\n    \\left(M \\cdot v\\right)_i       &=  \\sum_j M_{ij} \\times v_j    \\\\\n    \\left(v \\cdot M\\right)_j       &=  \\sum_i v_i \\times M_{ij}    \\\\\n    \\left(M \\cdot N\\right)_{ij}    &=  \\sum_k M_{ik} \\times N_{kj}\n\\end{aligned}\n\\] In the case of \\(\\FF\\), the product is replaced by logical AND, and the sum by the logical XOR operation.\nThe dot product is a critical operation in linear algebra, so it is fortunate that AND’ing and XOR’ing for bit-matrices and bit-vectors can be done very efficiently over blocks of elements simultaneously.\n\n\n\n\n\n\nRange checking\n\n\n\nThe function arguments must have compatible sizes.\nSet the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::vector&lt;&gt; u(6, [](size_t k) { return k % 2; });\n    bit::vector&lt;&gt; v(8, [](size_t k) { return (k + 1)% 2; });\n\n    bit::matrix&lt;&gt; M(6, 8, [](size_t i, size_t j) { return i == j; });\n    bit::matrix&lt;&gt; N(8, 4, [](size_t i, size_t j) { return (i + j)%2; });\n\n    std::cout &lt;&lt; \"bit::matrix M:\\n\" &lt;&lt; M &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"bit::matrix N:\\n\" &lt;&lt; N &lt;&lt; \"\\n\\n\";\n\n    std::cout &lt;&lt; \"dot(\" &lt;&lt; u &lt;&lt; \", M)     = \" &lt;&lt; dot(u, M) &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"dot(M, \" &lt;&lt; v &lt;&lt; \") = \" &lt;&lt; dot(M, v) &lt;&lt; \"\\n\\n\";\n    std::cout &lt;&lt; \"dot(M, N):\\n\" &lt;&lt; dot(M, N) &lt;&lt; \"\\n\";\n}\nOutput\nbit::matrix M:\n│1 0 0 0 0 0 0 0│\n│0 1 0 0 0 0 0 0│\n│0 0 1 0 0 0 0 0│\n│0 0 0 1 0 0 0 0│\n│0 0 0 0 1 0 0 0│\n│0 0 0 0 0 1 0 0│\n\nbit::matrix N:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n\ndot([0 1 0 1 0 1], M)     = [0 1 0 1 0 1 0 0]\ndot(M, [1 0 1 0 1 0 1 0]) = [1 0 1 0 1 0]\n\ndot(M, N):\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\n\nSee Also\npolynomial::operator()\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/index.html",
@@ -1666,7 +1666,7 @@
     "href": "content/matrix/index.html#instance-methods",
     "title": "The bit::matrix Class",
     "section": "Instance Methods",
-    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::constructors\nConstruct a bit-matrix in various ways.\n\n\nmatrix::random\nConstruct a bit-matrix with a random fill.\n\n\nmatrix::from\nConstruct a bit-matrix from a string.\n\n\nmatrix::ones\nCreate a bit-matrix with all the elements set to 1.\n\n\nmatrix::zeros\nCreate a bit-matrix with all the elements set to 0.\n\n\nmatrix::checker_board\nCreate a bit-matrix with the elements set to a checker-board pattern.\n\n\nmatrix::identity\nCreate an identity bit-matrix.\n\n\nmatrix::shift\nCreate a bit-matrix that shifts a bit-vector right or left.\n\n\nmatrix::rotate\nCreate a bit-matrix that rotates the elements of a bit-vector.\n\n\nmatrix::companion\nConstruct a companion matrix from its top-row only.\n\n\n\n\n\n\nQueries\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::is_zero\nIs this a zero bit-matrix?\n\n\nmatrix::is_ones\nIs this bit-matrix all ones?\n\n\nmatrix::is_identity\nIs this an identity bit-matrix?\n\n\nmatrix::is_square\nIs this bit-matrix square?\n\n\nmatrix::is_symmetric\nIs this bit-matrix symmetric?\n\n\n\n\n\n\nElement Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::operator()\nAccess a bit-matrix element, a whole row, or an entire column.\n\n\nmatrix::operator[]\nAccess a bit-matrix element, a whole row, or an entire column.\n\n\nmatrix::row\nRead-write access a bit-matrix row.\n\n\nmatrix::col\nRead only access a bit-matrix column.\n\n\nmatrix::test\nCheck the value of a bit-matrix element.\n\n\nmatrix::all\nCheck that all the bit-matrix elements are set.\n\n\nmatrix::any\nCheck if any bit-matrix elements are set.\n\n\nmatrix::all\nCheck that none of the bit-matrix elements are set.\n\n\nmatrix::count\nCounts the set elements in the bit-matrix.\n\n\nmatrix::count_diagonal\nCounts the set elements on the diagonal of the bit-matrix.\n\n\nmatrix::trace\nSum of the elements on the diagonal.\n\n\nmatrix::sub\nExtracts a bit-matrix as a distinct copy of some of the elements of this one. Note that views into a bit-matrix are not supported.\n\n\nmatrix::lower\nReturns a bit-matrix that is a copy of the lower triangular part of this bit-matrix.\n\n\nmatrix::upper\nReturns a bit-matrix that is a copy of the upper triangular part of this bit-matrix.\n\n\nmatrix::strictly_lower\nReturns a bit-matrix that is a copy of the strictly lower triangular part of this bit-matrix.\n\n\nmatrix::strictly_upper\nReturns a bit-matrix that is a copy of the strictly upper triangular part of this bit-matrix.\n\n\n\n\n\n\nCapacity\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::rows\nThe number of rows in this bit-matrix.\n\n\nmatrix::cols\nThe number of columns in this bit-matrix.\n\n\nmatrix::size\nThe number of elements in this bit-matrix.\n\n\nmatrix::empty\nCheck whether this matrix has no elements.\n\n\nmatrix::row_capacity\nHow many rows can be added to this bit-matrix without a fresh memory allocation?\n\n\nmatrix::col_capacity\nHow many columns can be added to this bit-matrix without a fresh memory allocation?\n\n\nmatrix::shrink_to_fit\nTries to reduce memory usage by freeing unused memory.\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::clear\nClears all the elements so rows(), cols(), and size() all become 0.\n\n\nmatrix::resize\nResizes the bit-matrix, padding out any added values with zeros.\n\n\nmatrix::add_row\nAdds a row to the end of the bit-matrix.\n\n\nmatrix::add_col\nAdds a column to the end of the bit-matrix.\n\n\nmatrix::pop_row\nRemoves the final row of the bit-matrix.\n\n\nmatrix::pop_col\nRemoves the final column of the bit-matrix.\n\n\nmatrix::append\nAugments the bit-matrix in-place by appending columns from a vector or another bit-matrix on the right.\n\n\nmatrix::swap_rows\nSwap two rows.\n\n\nmatrix::swap_cols\nSwap two columns.\n\n\nmatrix::transpose\nTranspose a square bit-matrix in-place.\n\n\nmatrix::replace\nReplace some of the contents of the bit-matrix with other values.\n\n\nmatrix::set\nSets all the elements to 1.\n\n\nmatrix::reset\nSets all the elements to 0.\n\n\nmatrix::flip\nFlips the 1 values to 0 and vice versa.\n\n\nmatrix::set_diagonal\nSets all the diagonal elements to 1.\n\n\nmatrix::reset_diagonal\nSets all the diagonal elements to 0.\n\n\nmatrix::set_if\nSets the values in a bit-matrix based on the return value from a function of each element index-pair.\n\n\nmatrix::flip_if\nFlips the values in a bit-matrix based on the return value from a function of each element index-pair.\n\n\nmatrix::operator&=\nIn-place element-by-element logical AND between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator^=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator|=\nIn-place element-by-element logical OR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator-=\nIn-place element-by-element logical DIFF between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator~\nFlip all the elements in this bit-matrix.\n\n\nmatrix::operator+=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator-=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator*=\nIn-place element-by-element logical AND between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator&lt;&lt;=\nIn-place left shift of the rows in this bit-matrix.\n\n\nmatrix::operator&gt;&gt;=\nIn-place right shift of the rows in this bit-matrix.\n\n\nmatrix::operator&lt;&lt;\nReturns a copy of this bit-matrix where the rows are all left shifted.\n\n\nmatrix::operator&gt;&gt;\nReturns a copy of this bit-matrix where the rows are all right shifted.\n\n\nmatrix::to_echelon_form\nChanges this bit-matrix in place to row-echelon form.\n\n\nmatrix::to_reduced_echelon_form\nChanges this bit-matrix in place to reduced row-echelon form.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::to_string\nReturns a binary string representation of this bit-matrix.\n\n\nmatrix::to_pretty_string\nReturns a formatted binary string representation of this bit-matrix.\n\n\nmatrix::to_hex\nReturns a hex string representation of this bit-matrix.\n\n\nmatrix::to_vector\nPacks this bit-matrix into a bit-vector.\n\n\nmatrix::description\nWrites some descriptive data about the bit-matrix to a stream.\n\n\n\n\n\n\nOther methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::probability_invertible\nReturns the probability that a “fair” square bit-matrix is invertible.\n\n\nmatrix::probability_singular\nReturns the probability that a “fair” square bit-matrix is singular.\n\n\n\n\n\n\nDebugging\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_DEBUG\nThis compile-time flag enables extra safety checks.\n\n\nbit_debug_assertion\nThese assertions are only checked if the BIT_DEBUG flag is set at compile time.\n\n\nbit_assertion\nUse this form for checks that must always be performed.",
+    "text": "Instance Methods\n\nConstruction\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::constructors\nConstruct a bit-matrix in various ways.\n\n\nmatrix::random\nConstruct a bit-matrix with a random fill.\n\n\nmatrix::from\nConstruct a bit-matrix from a string.\n\n\nmatrix::ones\nCreate a bit-matrix with all the elements set to 1.\n\n\nmatrix::zeros\nCreate a bit-matrix with all the elements set to 0.\n\n\nmatrix::checker_board\nCreate a bit-matrix with the elements set to a checker-board pattern.\n\n\nmatrix::identity\nCreate an identity bit-matrix.\n\n\nmatrix::shift\nCreate a bit-matrix that shifts a bit-vector right or left.\n\n\nmatrix::rotate\nCreate a bit-matrix that rotates the elements of a bit-vector.\n\n\nmatrix::companion\nConstruct a companion matrix from its top-row only.\n\n\n\n\n\n\nQueries\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::is_zero\nIs this a zero bit-matrix?\n\n\nmatrix::is_ones\nIs this bit-matrix all ones?\n\n\nmatrix::is_identity\nIs this an identity bit-matrix?\n\n\nmatrix::is_square\nIs this bit-matrix square?\n\n\nmatrix::is_symmetric\nIs this bit-matrix symmetric?\n\n\n\n\n\n\nElement Access\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::operator()\nAccess a bit-matrix element, a whole row, or an entire column.\n\n\nmatrix::operator[]\nAccess a bit-matrix element, a whole row, or an entire column.\n\n\nmatrix::row\nRead-write access a bit-matrix row.\n\n\nmatrix::col\nRead only access a bit-matrix column.\n\n\nmatrix::test\nCheck the value of a bit-matrix element.\n\n\nmatrix::all\nCheck that all the bit-matrix elements are set.\n\n\nmatrix::any\nCheck if any bit-matrix elements are set.\n\n\nmatrix::all\nCheck that none of the bit-matrix elements are set.\n\n\nmatrix::count\nCounts the set elements in the bit-matrix.\n\n\nmatrix::count_diagonal\nCounts the set elements on the diagonal of the bit-matrix.\n\n\nmatrix::trace\nSum of the elements on the diagonal.\n\n\nmatrix::sub\nExtracts a bit-matrix as a distinct copy of some of the elements of this one. Note that views into a bit-matrix are not supported.\n\n\nmatrix::lower\nReturns a bit-matrix that is a copy of the lower triangular part of this bit-matrix.\n\n\nmatrix::upper\nReturns a bit-matrix that is a copy of the upper triangular part of this bit-matrix.\n\n\nmatrix::strictly_lower\nReturns a bit-matrix that is a copy of the strictly lower triangular part of this bit-matrix.\n\n\nmatrix::strictly_upper\nReturns a bit-matrix that is a copy of the strictly upper triangular part of this bit-matrix.\n\n\n\n\n\n\nCapacity\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::rows\nThe number of rows in this bit-matrix.\n\n\nmatrix::cols\nThe number of columns in this bit-matrix.\n\n\nmatrix::size\nThe number of elements in this bit-matrix.\n\n\nmatrix::empty\nCheck whether this matrix has no elements.\n\n\nmatrix::row_capacity\nHow many rows can be added to this bit-matrix without a fresh memory allocation?\n\n\nmatrix::col_capacity\nHow many columns can be added to this bit-matrix without a fresh memory allocation?\n\n\nmatrix::shrink_to_fit\nTries to reduce memory usage by freeing unused memory.\n\n\n\n\n\n\nModifiers\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::clear\nClears all the elements so rows(), cols(), and size() all become 0.\n\n\nmatrix::resize\nResizes the bit-matrix, padding out any added values with zeros.\n\n\nmatrix::add_row\nAdds a row to the end of the bit-matrix.\n\n\nmatrix::add_col\nAdds a column to the end of the bit-matrix.\n\n\nmatrix::pop_row\nRemoves the final row of the bit-matrix.\n\n\nmatrix::pop_col\nRemoves the final column of the bit-matrix.\n\n\nmatrix::append\nAugments the bit-matrix in-place by appending columns from a vector or another bit-matrix on the right.\n\n\nmatrix::swap_rows\nSwap two rows.\n\n\nmatrix::swap_cols\nSwap two columns.\n\n\nmatrix::transpose\nTranspose a square bit-matrix in-place.\n\n\nmatrix::replace\nReplace some of the contents of the bit-matrix with other values.\n\n\nmatrix::set\nSets all the elements to 1.\n\n\nmatrix::reset\nSets all the elements to 0.\n\n\nmatrix::flip\nFlips the 1 values to 0 and vice versa.\n\n\nmatrix::set_diagonal\nSets all the diagonal elements to 1.\n\n\nmatrix::reset_diagonal\nSets all the diagonal elements to 0.\n\n\nmatrix::set_if\nSets the values in a bit-matrix based on the return value from a function of each element index-pair.\n\n\nmatrix::flip_if\nFlips the values in a bit-matrix based on the return value from a function of each element index-pair.\n\n\nmatrix::operator&=\nIn-place element-by-element logical AND between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator^=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator|=\nIn-place element-by-element logical OR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator-=\nIn-place element-by-element logical DIFF between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator~\nFlip all the elements in this bit-matrix.\n\n\nmatrix::operator+=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator-=\nIn-place element-by-element logical XOR between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator*=\nIn-place element-by-element logical AND between this bit-matrix and another of equal dimensions.\n\n\nmatrix::operator&lt;&lt;=\nIn-place left shift of the rows in this bit-matrix.\n\n\nmatrix::operator&gt;&gt;=\nIn-place right shift of the rows in this bit-matrix.\n\n\nmatrix::operator&lt;&lt;\nReturns a copy of this bit-matrix where the rows are all left shifted.\n\n\nmatrix::operator&gt;&gt;\nReturns a copy of this bit-matrix where the rows are all right shifted.\n\n\nmatrix::to_echelon_form\nChanges this bit-matrix in place to row-echelon form.\n\n\nmatrix::to_reduced_echelon_form\nChanges this bit-matrix in place to reduced row-echelon form.\n\n\n\n\n\n\nString Conversions\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::to_string\nReturns a binary string representation of this bit-matrix.\n\n\nmatrix::to_pretty_string\nReturns a formatted binary string representation of this bit-matrix.\n\n\nmatrix::to_hex\nReturns a hex string representation of this bit-matrix.\n\n\nmatrix::to_vector\nPacks this bit-matrix into a bit-vector.\n\n\nmatrix::description\nWrites some descriptive data about the bit-matrix to a stream.\n\n\n\n\n\n\nOther methods\n\n\n\n\n\n\n\n\nMethod\nDescription\n\n\n\n\nmatrix::probability_invertible\nReturns the probability that a “fair” square bit-matrix is invertible.\n\n\nmatrix::probability_singular\nReturns the probability that a “fair” square bit-matrix is singular.\n\n\n\n\n\n\nDebugging\n\n\n\n\n\n\n\n\nMacro\nDescription\n\n\n\n\nBIT_VERIFY\nThis compile-time flag enables extra safety checks.\n\n\nbit_verify\nThese checks are only performed if the BIT_VERIFY flag is set at compile time.",
     "crumbs": [
       "Home",
       "Bit-Matrices",
@@ -1711,7 +1711,7 @@
     "href": "content/matrix/logical-op-eq.html",
     "title": "bit::matrix — In-place Logical Operators",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nMethods to perform element-by-element binary AND, XOR, OR, +, -, * with another equal-sized bit-matrix.\n1constexpr bit::matrix &operator&=(const bit::matrix &other);\n2constexpr bit::matrix &operator^=(const bit::matrix &other);\n3constexpr bit::matrix &operator|=(const bit::matrix &other);\n4constexpr bit::matrix &operator+=(const bit::matrix &other);\n5constexpr bit::matrix &operator-=(const bit::matrix &other);\n6constexpr bit::matrix &operator*=(const bit::matrix &other);\n\n1\n\nIn-place binary AND between the elements of *this and other.\n\n2\n\nIn-place binary XOR between the elements of *this and other.\n\n3\n\nIn-place binary OR between the elements of *this and other.\n\n4\n\nIn-place binary XOR the elements of *this and other.\nIn \\(\\FF\\), addition corresponds to XOR.\n\n5\n\nIn-place binary XOR between the elements of *this and other.\nIn \\(\\FF\\), subtraction corresponds to XOR.\n\n6\n\nIn-place binary AND between the elements of *this and other.\nIn \\(\\FF\\), multiplication corresponds to AND.\n\n\nThese methods all return a reference to *this so they can be chained with other calls.\n\n\n\n\n\n\nDimensions must match\n\n\n\nThe two bit-matrices in question must have the same dimensions. Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThere is one other bit-twiddling method:\n7constexpr bit::matrix operator~() const;\n\n7\n\nReturns a copy of the bit-matrix with all the bits flipped\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(4,[](std::size_t i, std::size_t j) { return (i + j) % 2; });\n    auto m2 = bit::matrix&lt;&gt;::ones(4);\n\n    std::cout &lt;&lt; \"m1:\\n\" &lt;&lt; m1  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m2:\\n\" &lt;&lt; m2  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 &= m2:\\n\"  &lt;&lt; (m1 &= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 |= m2:\\n\"  &lt;&lt; (m1 |= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 ^= m2:\\n\"  &lt;&lt; (m1 ^= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"~m1:\\n\"       &lt;&lt; (~m1)        &lt;&lt; '\\n';\n}\nOutput\nm1:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 &= m2:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm1 |= m2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 ^= m2:\n│0 0 0 0│\n│0 0 0 0│\n│0 0 0 0│\n│0 0 0 0│\n~m1:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n\nSee Also\nmatrix::operator&\nmatrix::operator|\nmatrix::operator^\nmatrix::operator+\nmatrix::operator-\nmatrix::operator*\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nMethods to perform element-by-element binary AND, XOR, OR, +, -, * with another equal-sized bit-matrix.\n1constexpr bit::matrix &operator&=(const bit::matrix &other);\n2constexpr bit::matrix &operator^=(const bit::matrix &other);\n3constexpr bit::matrix &operator|=(const bit::matrix &other);\n4constexpr bit::matrix &operator+=(const bit::matrix &other);\n5constexpr bit::matrix &operator-=(const bit::matrix &other);\n6constexpr bit::matrix &operator*=(const bit::matrix &other);\n\n1\n\nIn-place binary AND between the elements of *this and other.\n\n2\n\nIn-place binary XOR between the elements of *this and other.\n\n3\n\nIn-place binary OR between the elements of *this and other.\n\n4\n\nIn-place binary XOR the elements of *this and other.\nIn \\(\\FF\\), addition corresponds to XOR.\n\n5\n\nIn-place binary XOR between the elements of *this and other.\nIn \\(\\FF\\), subtraction corresponds to XOR.\n\n6\n\nIn-place binary AND between the elements of *this and other.\nIn \\(\\FF\\), multiplication corresponds to AND.\n\n\nThese methods all return a reference to *this so they can be chained with other calls.\n\n\n\n\n\n\nDimensions must match\n\n\n\nThe two bit-matrices in question must have the same dimensions. Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThere is one other bit-twiddling method:\n7constexpr bit::matrix operator~() const;\n\n7\n\nReturns a copy of the bit-matrix with all the bits flipped\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n    bit::matrix&lt;&gt; m1(4,[](std::size_t i, std::size_t j) { return (i + j) % 2; });\n    auto m2 = bit::matrix&lt;&gt;::ones(4);\n\n    std::cout &lt;&lt; \"m1:\\n\" &lt;&lt; m1  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m2:\\n\" &lt;&lt; m2  &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 &= m2:\\n\"  &lt;&lt; (m1 &= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 |= m2:\\n\"  &lt;&lt; (m1 |= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"m1 ^= m2:\\n\"  &lt;&lt; (m1 ^= m2)   &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"~m1:\\n\"       &lt;&lt; (~m1)        &lt;&lt; '\\n';\n}\nOutput\nm1:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 &= m2:\n│0 1 0 1│\n│1 0 1 0│\n│0 1 0 1│\n│1 0 1 0│\nm1 |= m2:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\nm1 ^= m2:\n│0 0 0 0│\n│0 0 0 0│\n│0 0 0 0│\n│0 0 0 0│\n~m1:\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n│1 1 1 1│\n\nSee Also\nmatrix::operator&\nmatrix::operator|\nmatrix::operator^\nmatrix::operator+\nmatrix::operator-\nmatrix::operator*\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/shrink_to_fit.html",
@@ -1739,7 +1739,7 @@
     "href": "content/matrix/replace.html",
     "title": "bit::matrix — Replace Some Content",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods that replace some of the values in a bit-matrix with those of another.\nconstexpr bit::matrix&\n1replace(std::size_t i0, std::size_t j0, const bit::matrix &with);\n\nconstexpr bit::matrix&\n2replace(std::size_t i0, const bit::matrix &with);\n\nconstexpr bit::matrix&\n3replace(const bit::matrix &with);\n\n1\n\nStarting at index pair (i0,j0), replace the bit-matrix values with those from the bit-matrix with.\n\n2\n\nStarting at index pair (i0,i0), replace the bit-matrix values with those from the bit-matrix with.\n\n3\n\nStarting at index pair (0,0), replace the bit-matrix values with those from the bit-matrix with.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe sub-matrix with we are copying from must fit inside the existing bit-matrix! Set the BIT_DEBUG flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThese methods return a reference to *this so they can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto m = bit::matrix&lt;&gt;::ones(8);\n2    bit::matrix&lt;&gt; w(3);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n3    m.replace(w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n4    m.replace(5,w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n5    m.replace(5,0,w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n}\n\n1\n\nStart with an 8 x 8 bit-matrix m that is all ones.\n\n2\n\nThe replacement values will always be that 3 x 3 bit-matrix w that is all zeros.\n\n3\n\nReplaces 3 x 3 values in m starting at the upper left element (0,0).\n\n4\n\nReplaces 3 x 3 values in m starting at the element (5,5).\n\n5\n\nReplaces 3 x 3 values in m starting at the element (5,0).\n\n\nOutput\nm:\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 0 0 0│\n│1 1 1 1 1 0 0 0│\n│1 1 1 1 1 0 0 0│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│0 0 0 1 1 0 0 0│\n│0 0 0 1 1 0 0 0│\n│0 0 0 1 1 0 0 0│\n\nSee Also\nmatrix::sub\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nWe have methods that replace some of the values in a bit-matrix with those of another.\nconstexpr bit::matrix&\n1replace(std::size_t i0, std::size_t j0, const bit::matrix &with);\n\nconstexpr bit::matrix&\n2replace(std::size_t i0, const bit::matrix &with);\n\nconstexpr bit::matrix&\n3replace(const bit::matrix &with);\n\n1\n\nStarting at index pair (i0,j0), replace the bit-matrix values with those from the bit-matrix with.\n\n2\n\nStarting at index pair (i0,i0), replace the bit-matrix values with those from the bit-matrix with.\n\n3\n\nStarting at index pair (0,0), replace the bit-matrix values with those from the bit-matrix with.\n\n\n\n\n\n\n\n\nSizes must be compatible\n\n\n\nThe sub-matrix with we are copying from must fit inside the existing bit-matrix! Set the BIT_VERIFY flag at compile time to check this condition — any violation will cause the program to abort with a helpful message.\n\n\nThese methods return a reference to *this so they can be chained with other calls.\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    auto m = bit::matrix&lt;&gt;::ones(8);\n2    bit::matrix&lt;&gt; w(3);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n3    m.replace(w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n4    m.replace(5,w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n5    m.replace(5,0,w);\n    std::cout &lt;&lt; \"m:\\n\" &lt;&lt; m &lt;&lt; '\\n';\n}\n\n1\n\nStart with an 8 x 8 bit-matrix m that is all ones.\n\n2\n\nThe replacement values will always be that 3 x 3 bit-matrix w that is all zeros.\n\n3\n\nReplaces 3 x 3 values in m starting at the upper left element (0,0).\n\n4\n\nReplaces 3 x 3 values in m starting at the element (5,5).\n\n5\n\nReplaces 3 x 3 values in m starting at the element (5,0).\n\n\nOutput\nm:\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 0 0 0│\n│1 1 1 1 1 0 0 0│\n│1 1 1 1 1 0 0 0│\nm:\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│0 0 0 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│1 1 1 1 1 1 1 1│\n│0 0 0 1 1 0 0 0│\n│0 0 0 1 1 0 0 0│\n│0 0 0 1 1 0 0 0│\n\nSee Also\nmatrix::sub\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/add-pop.html",
@@ -1753,7 +1753,7 @@
     "href": "content/matrix/swap.html",
     "title": "bit::matrix — Swap Two Rows/Columns",
     "section": "",
-    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nSwap any two rows or columns in a bit-matrix — a standard operation in some matrix transformation algorithms.\n1constexpr bit::matrix &swap_rows(std::size_t i0, std::size_t i1);\n2constexpr bit::matrix &swap_cols(std::size_t j0, std::size_t j1);\n\n1\n\nSwap rows i0 and i1.\n\n2\n\nSwap columns j0 and j1.\n\n\nThese methods return a reference to *this, so can be chained with other calls.\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, these methods do not check whether the indices are in bounds. If they aren’t, the behavior is undefined (but bound to be wrong!) All of them will perform range checking if you set the BIT_DEBUG at compile time. See bit_assertion.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::matrix&lt;&gt; m(4, 8, [](std::size_t i, std::size_t j) { return (i + j)%2; });\n    std::cout &lt;&lt; \"Original:\\n\"              &lt;&lt; m &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"Swapped first 2 rows:\\n\"  &lt;&lt; m.swap_rows(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"And back:\\n\"              &lt;&lt; m.swap_rows(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"Swapped first 2 cols:\\n\"  &lt;&lt; m.swap_cols(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"And back:\\n\"              &lt;&lt; m.swap_cols(0,1) &lt;&lt; '\\n';\n}\n\n1\n\nSet up a bit-matrix with a checkerboard pattern of zeros and ones.\n\n\nOutput\nOriginal:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nSwapped first 2 rows:\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nAnd back:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nSwapped first 2 cols:\n│1 0 0 1 0 1 0 1│\n│0 1 1 0 1 0 1 0│\n│1 0 0 1 0 1 0 1│\n│0 1 1 0 1 0 1 0│\nAnd back:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n\nSee Also\nmatrix::replace\n\n\n\n\n Back to top"
+    "text": "\\[\n\\newcommand{\\FF}{\\mathbb{F}_2}\n\\newcommand{\\R}{\\mathbb{R}}\n\\]\n\n\n\n\n\n\n\n\n\n\nSwap any two rows or columns in a bit-matrix — a standard operation in some matrix transformation algorithms.\n1constexpr bit::matrix &swap_rows(std::size_t i0, std::size_t i1);\n2constexpr bit::matrix &swap_cols(std::size_t j0, std::size_t j1);\n\n1\n\nSwap rows i0 and i1.\n\n2\n\nSwap columns j0 and j1.\n\n\nThese methods return a reference to *this, so can be chained with other calls.\n\n\n\n\n\n\nBounds checking\n\n\n\nGenerally, these methods do not check whether the indices are in bounds. If they aren’t, the behavior is undefined (but bound to be wrong!) All of them will perform range checking if you set the BIT_VERIFY at compile time. See bit_verify.\n\n\nExample\n#include &lt;bit/bit.h&gt;\nint main()\n{\n1    bit::matrix&lt;&gt; m(4, 8, [](std::size_t i, std::size_t j) { return (i + j)%2; });\n    std::cout &lt;&lt; \"Original:\\n\"              &lt;&lt; m &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"Swapped first 2 rows:\\n\"  &lt;&lt; m.swap_rows(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"And back:\\n\"              &lt;&lt; m.swap_rows(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"Swapped first 2 cols:\\n\"  &lt;&lt; m.swap_cols(0,1) &lt;&lt; '\\n';\n    std::cout &lt;&lt; \"And back:\\n\"              &lt;&lt; m.swap_cols(0,1) &lt;&lt; '\\n';\n}\n\n1\n\nSet up a bit-matrix with a checkerboard pattern of zeros and ones.\n\n\nOutput\nOriginal:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nSwapped first 2 rows:\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nAnd back:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\nSwapped first 2 cols:\n│1 0 0 1 0 1 0 1│\n│0 1 1 0 1 0 1 0│\n│1 0 0 1 0 1 0 1│\n│0 1 1 0 1 0 1 0│\nAnd back:\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n│0 1 0 1 0 1 0 1│\n│1 0 1 0 1 0 1 0│\n\nSee Also\nmatrix::replace\n\n\n\n\n Back to top"
   },
   {
     "objectID": "content/matrix/set.html",
diff --git a/sitemap.xml b/sitemap.xml
index 3c08f38..738d81f 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -10,7 +10,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/logical-op.html</loc>
-    <lastmod>2024-05-13T13:49:44.717Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/print.html</loc>
@@ -26,11 +26,11 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/pow.html</loc>
-    <lastmod>2024-07-27T10:27:06.126Z</lastmod>
+    <lastmod>2024-07-29T09:40:48.358Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/invert.html</loc>
-    <lastmod>2024-07-27T10:27:06.126Z</lastmod>
+    <lastmod>2024-07-29T09:40:31.347Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/set_if.html</loc>
@@ -42,7 +42,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/sub.html</loc>
-    <lastmod>2024-05-13T13:49:44.720Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/size.html</loc>
@@ -98,7 +98,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/index.html</loc>
-    <lastmod>2024-07-27T10:27:06.126Z</lastmod>
+    <lastmod>2024-07-29T09:43:48.061Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/reduce.html</loc>
@@ -130,7 +130,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/logical-op.html</loc>
-    <lastmod>2024-05-13T13:49:44.728Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/swap.html</loc>
@@ -142,7 +142,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/replace.html</loc>
-    <lastmod>2024-05-13T13:49:44.730Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/set_if.html</loc>
@@ -158,7 +158,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/logical-op-eq.html</loc>
-    <lastmod>2024-05-13T13:49:44.728Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/size.html</loc>
@@ -166,15 +166,15 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/diff.html</loc>
-    <lastmod>2024-05-13T13:49:44.726Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.558Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/dot.html</loc>
-    <lastmod>2024-05-13T13:49:44.726Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.558Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/access.html</loc>
-    <lastmod>2024-07-27T10:27:24.721Z</lastmod>
+    <lastmod>2024-07-29T09:27:56.520Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/join.html</loc>
@@ -198,7 +198,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/all.html</loc>
-    <lastmod>2024-05-13T13:49:44.724Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/clear.html</loc>
@@ -249,8 +249,8 @@
     <lastmod>2024-05-13T13:49:44.708Z</lastmod>
   </url>
   <url>
-    <loc>https://nessan.github.io/bit/content/bit_assertion/index.html</loc>
-    <lastmod>2024-07-27T11:05:26.950Z</lastmod>
+    <loc>https://nessan.github.io/bit/content/verify/index.html</loc>
+    <lastmod>2024-07-29T10:02:18.600Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/index.html</loc>
@@ -270,7 +270,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/notes/design.html</loc>
-    <lastmod>2024-07-27T10:55:30.654Z</lastmod>
+    <lastmod>2024-07-29T09:42:39.452Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/notes/gf2.html</loc>
@@ -298,7 +298,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/swap_elements.html</loc>
-    <lastmod>2024-05-13T13:49:44.732Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.558Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/stream.html</loc>
@@ -334,11 +334,11 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/index.html</loc>
-    <lastmod>2024-07-27T10:58:25.243Z</lastmod>
+    <lastmod>2024-07-29T09:44:11.720Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/sub.html</loc>
-    <lastmod>2024-07-20T13:05:26.035Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.558Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/indices.html</loc>
@@ -366,7 +366,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/set.html</loc>
-    <lastmod>2024-05-13T13:49:44.730Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/vector/description.html</loc>
@@ -394,7 +394,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/access.html</loc>
-    <lastmod>2024-07-27T10:27:24.744Z</lastmod>
+    <lastmod>2024-07-29T09:27:56.521Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/times_x.html</loc>
@@ -406,7 +406,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/evaluation.html</loc>
-    <lastmod>2024-07-27T10:27:06.188Z</lastmod>
+    <lastmod>2024-07-29T09:42:59.310Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/polynomial/split.html</loc>
@@ -422,7 +422,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/all.html</loc>
-    <lastmod>2024-05-13T13:49:44.713Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/stream.html</loc>
@@ -438,19 +438,19 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/characteristic_polynomial.html</loc>
-    <lastmod>2024-07-17T16:20:24.466Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/access.html</loc>
-    <lastmod>2024-07-27T10:27:24.721Z</lastmod>
+    <lastmod>2024-07-29T09:27:56.521Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/dot.html</loc>
-    <lastmod>2024-07-17T16:20:35.127Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/index.html</loc>
-    <lastmod>2024-07-27T10:27:06.126Z</lastmod>
+    <lastmod>2024-07-29T09:45:02.039Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/companion.html</loc>
@@ -458,7 +458,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/logical-op-eq.html</loc>
-    <lastmod>2024-05-13T13:49:44.717Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/shrink_to_fit.html</loc>
@@ -474,7 +474,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/replace.html</loc>
-    <lastmod>2024-05-13T13:49:44.718Z</lastmod>
+    <lastmod>2024-07-29T09:24:37.280Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/add-pop.html</loc>
@@ -482,7 +482,7 @@
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/swap.html</loc>
-    <lastmod>2024-07-27T10:27:24.721Z</lastmod>
+    <lastmod>2024-07-29T09:27:56.520Z</lastmod>
   </url>
   <url>
     <loc>https://nessan.github.io/bit/content/matrix/set.html</loc>