Copy cycles for all variables of a circuit in CSR (flat) form. More...

#include <permutation_lib.hpp>

Public Member Functions
size_t	size () const

std::span< const cycle_node >	operator[] (size_t i) const

Public Attributes
std::vector< uint32_t >	offsets

std::vector< cycle_node >	nodes

Detailed Description

Copy cycles for all variables of a circuit in CSR (flat) form.

One cycle per real variable; cycle i occupies nodes[offsets[i] .. offsets[i+1]). A flat layout avoids materializing one heap-allocated vector per variable (hundreds of thousands per circuit).

Definition at line 49 of file permutation_lib.hpp.

Member Function Documentation

◆ operator[]()

std::span< const cycle_node > bb::CopyCycles::operator[] ( size_t i ) const

inline

Definition at line 54 of file permutation_lib.hpp.

◆ size()

size_t bb::CopyCycles::size ( ) const

inline

Definition at line 53 of file permutation_lib.hpp.

Member Data Documentation

◆ nodes

std::vector<cycle_node> bb::CopyCycles::nodes

Definition at line 51 of file permutation_lib.hpp.

◆ offsets

std::vector<uint32_t> bb::CopyCycles::offsets

Definition at line 50 of file permutation_lib.hpp.

The documentation for this struct was generated from the following file:

src/barretenberg/honk/composer/permutation_lib.hpp

Public Member Functions