GF2++
Loading...
Searching...
No Matches
gf2.h
Go to the documentation of this file.
1#pragma once
2// SPDX-FileCopyrightText: 2025 Nessan Fitzmaurice <nzznfitz+gh@icloud.com>
3// SPDX-License-Identifier: MIT
4
7
8#pragma once
9
10// Utilities.
11#include <gf2/assert.h>
12#include <gf2/Unsigned.h>
13
14// The vector-like types & the bit-store concept they all satisfy.
15#include <gf2/BitStore.h>
16#include <gf2/BitArray.h>
17#include <gf2/BitVector.h>
18#include <gf2/BitSpan.h>
19
20// The bit reference type to access individual bits
21#include <gf2/BitRef.h>
22
23// Iterators over bit-stores: `Bits`, `SetBits`, `UnsetBits`, `Words`
24#include <gf2/Iterators.h>
25
26// The polynomial type
27#include <gf2/BitPolynomial.h>
28
29// The matrix types & helpers
30#include <gf2/BitMatrix.h>
31#include <gf2/BitLU.h>
32#include <gf2/BitGauss.h>
Fixed-size vectors over GF(2) with compactly stored bit-elements in a standard array of primitive uns...
A Gaussian elimination solver for systems of linear equations over GF(2). See the BitGauss page for...
The LU decomposition for square bit-matrices. See the BitLU page for more details.
Matrices over over GF(2) – bit-matrices. See the BitMatrix page for more details.
Polynomials over GF(2). See the BitPolynomial page for more details.
A BitRef is a proxy type that references a single bit in a bit-store. See the BitRef page for more ...
Non-owning views of a range of bits from some underlying contiguous unsigned words....
A concept for types that can access individual bits packed into contiguous primitive unsigned words,...
Vectors over GF(2) with compactly stored bit-elements in a standard vector of primitive unsigned word...
Five bit-store iterators that serve different purposes. See the Iterators page for more details.
Utility functions that work on primitive unsigned word types. See the Unsigned page for more detail...
Macros that improve on standard assert. See the Assertions page for all the details.