SYMBOL INDEX (654 symbols across 45 files) FILE: crates/ark-circom/src/circom.rs type CircomReduction (line 12) | pub struct CircomReduction; method instance_map_with_evaluation (line 16) | fn instance_map_with_evaluation>( method witness_map_from_matrices (line 23) | fn witness_map_from_matrices>( method h_query_scalars (line 90) | fn h_query_scalars>( FILE: crates/ark-circom/src/ethereum.rs type AffineError (line 12) | pub enum AffineError { type Inputs (line 19) | pub struct Inputs(pub Vec); method from (line 22) | fn from(src: &[Fr]) -> Self { type G1 (line 30) | pub struct G1 { method as_tuple (line 63) | pub fn as_tuple(&self) -> (U256, U256) { method from (line 69) | fn from(p: &G1Affine) -> Self { type Error (line 36) | type Error = AffineError; method try_from (line 38) | fn try_from(value: G1) -> Result { type G1Tup (line 60) | type G1Tup = (U256, U256); type G2 (line 78) | pub struct G2 { method as_tuple (line 118) | pub fn as_tuple(&self) -> G2Tup { method from (line 124) | fn from(p: &G2Affine) -> Self { type Error (line 84) | type Error = AffineError; method try_from (line 86) | fn try_from(src: G2) -> Result { type G2Tup (line 114) | type G2Tup = ([U256; 2], [U256; 2]); type Proof (line 133) | pub struct Proof { method as_tuple (line 140) | pub fn as_tuple(&self) -> (G1Tup, G2Tup, G1Tup) { method from (line 146) | fn from(proof: ark_groth16::Proof) -> Self { type Error (line 156) | type Error = AffineError; function try_from (line 158) | fn try_from(src: Proof) -> Result, AffineError> { type VerifyingKey (line 168) | pub struct VerifyingKey { method as_tuple (line 177) | pub fn as_tuple(&self) -> (G1Tup, G2Tup, G2Tup, G2Tup, Vec) { method from (line 189) | fn from(vk: ark_groth16::VerifyingKey) -> Self { type Error (line 201) | type Error = AffineError; function try_from (line 203) | fn try_from(src: VerifyingKey) -> Result(point: U256) -> F { function point_to_u256 (line 227) | fn point_to_u256(point: F) -> U256 { function fq (line 239) | fn fq() -> Fq { function fr (line 243) | fn fr() -> Fr { function g1 (line 247) | fn g1() -> G1Affine { function g2 (line 252) | fn g2() -> G2Affine { function convert_fq (line 258) | fn convert_fq() { function convert_fr (line 268) | fn convert_fr() { function convert_g1 (line 278) | fn convert_g1() { function convert_g2 (line 288) | fn convert_g2() { function convert_vk (line 298) | fn convert_vk() { function convert_proof (line 312) | fn convert_proof() { FILE: crates/ark-circom/src/zkey.rs type IoResult (line 16) | type IoResult = Result; type Section (line 19) | struct Section { function read_zkey (line 26) | pub fn read_zkey( type BinFile (line 36) | struct BinFile<'a, R> { function new (line 46) | fn new(reader: &'a mut R) -> IoResult { function proving_key (line 76) | fn proving_key(&mut self) -> IoResult> { function get_section (line 108) | fn get_section(&self, id: u32) -> Section { function groth_header (line 112) | fn groth_header(&mut self) -> IoResult { function ic (line 118) | fn ic(&mut self, n_public: usize) -> IoResult> { function matrices (line 124) | pub fn matrices(&mut self) -> IoResult> { function a_query (line 171) | fn a_query(&mut self, n_vars: usize) -> IoResult> { function b_g1_query (line 175) | fn b_g1_query(&mut self, n_vars: usize) -> IoResult> { function b_g2_query (line 179) | fn b_g2_query(&mut self, n_vars: usize) -> IoResult> { function l_query (line 183) | fn l_query(&mut self, n_vars: usize) -> IoResult> { function h_query (line 187) | fn h_query(&mut self, n_vars: usize) -> IoResult> { function g1_section (line 191) | fn g1_section(&mut self, num: usize, section_id: usize) -> IoResult IoResult(reader: &mut R) -> IoResult { type HeaderGroth (line 235) | struct HeaderGroth { method new (line 256) | fn new(reader: &mut R, section: &Section) -> IoResult<... method read (line 261) | fn read(mut reader: &mut R) -> IoResult { function deserialize_field_fr (line 295) | fn deserialize_field_fr(reader: &mut R) -> IoResult { function deserialize_field (line 301) | fn deserialize_field(reader: &mut R) -> IoResult { function deserialize_field2 (line 307) | pub fn deserialize_field2(reader: &mut R) -> IoResult { function deserialize_g1 (line 313) | fn deserialize_g1(reader: &mut R) -> IoResult { function deserialize_g2 (line 324) | fn deserialize_g2(reader: &mut R) -> IoResult { function deserialize_g1_vec (line 335) | fn deserialize_g1_vec(reader: &mut R, n_vars: u32) -> IoResult<... function deserialize_g2_vec (line 339) | fn deserialize_g2_vec(reader: &mut R, n_vars: u32) -> IoResult<... function fq_from_str (line 356) | fn fq_from_str(s: &str) -> Fq { function fq_buf (line 364) | fn fq_buf() -> Vec { function g1_buf (line 375) | fn g1_buf() -> Vec { function g2_buf (line 388) | fn g2_buf() -> Vec { function g1_one (line 401) | fn g1_one() -> G1Affine { function g2_one (line 409) | fn g2_one() -> G2Affine { function can_deser_fq (line 432) | fn can_deser_fq() { function can_deser_g1 (line 439) | fn can_deser_g1() { function can_deser_g1_vec (line 448) | fn can_deser_g1_vec() { function can_deser_g2 (line 462) | fn can_deser_g2() { function can_deser_g2_vec (line 472) | fn can_deser_g2_vec() { function header (line 486) | fn header() { function deser_key (line 512) | fn deser_key() { function deser_vk (line 732) | fn deser_vk() { function json_to_g1 (line 747) | fn json_to_g1(json: &Value, key: &str) -> G1Affine { function json_to_g1_vec (line 763) | fn json_to_g1_vec(json: &Value, key: &str) -> Vec { function json_to_g2 (line 790) | fn json_to_g2(json: &Value, key: &str) -> G2Affine { FILE: crates/ark-zkey/src/lib.rs type SerializableProvingKey (line 14) | pub struct SerializableProvingKey(pub ProvingKey); type SerializableMatrix (line 17) | pub struct SerializableMatrix { type SerializableConstraintMatrices (line 22) | pub struct SerializableConstraintMatrices { function read_arkzkey_from_bytes (line 35) | pub fn read_arkzkey_from_bytes( function read_proving_key_and_matrices_from_zkey (line 65) | pub fn read_proving_key_and_matrices_from_zkey( function convert_zkey (line 92) | pub fn convert_zkey( function test_read_arkzkey_from_bytes (line 120) | fn test_read_arkzkey_from_bytes() -> Result<()> { FILE: crates/circom-witness-rs/build.rs function main (line 3) | fn main() { FILE: crates/circom-witness-rs/include/witness.h type u64 (line 5) | typedef unsigned long long u64; type u32 (line 6) | typedef uint32_t u32; type u8 (line 7) | typedef uint8_t u8; type Circom_CalcWit (line 9) | struct Circom_CalcWit FILE: crates/circom-witness-rs/src/field.rs constant M (line 7) | pub const M: U256 = constant INV (line 10) | pub const INV: u64 = 14042775128853446655; constant R (line 12) | pub const R: U256 = uint!(0x0e0a77c19a07df2f666ea36f7879462e36fc76959f60... type FrElement (line 19) | pub struct FrElement(pub usize); function print_eval (line 21) | pub fn print_eval() { function get_graph (line 44) | pub fn get_graph() -> Vec { function get_values (line 48) | pub fn get_values() -> Vec { function undefined (line 52) | pub fn undefined() -> FrElement { function constant (line 56) | pub fn constant(c: U256) -> FrElement { function input (line 70) | pub fn input(i: usize, value: U256) -> FrElement { function binop (line 84) | fn binop(op: Operation, to: *mut FrElement, a: *const FrElement, b: *con... function Fr_mul (line 104) | pub fn Fr_mul(to: *mut FrElement, a: *const FrElement, b: *const FrEleme... function Fr_add (line 109) | pub unsafe fn Fr_add(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_sub (line 114) | pub unsafe fn Fr_sub(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_copy (line 119) | pub fn Fr_copy(to: *mut FrElement, a: *const FrElement) { function Fr_copyn (line 126) | pub fn Fr_copyn(to: *mut FrElement, a: *const FrElement, n: usize) { function create_vec (line 134) | pub fn create_vec(len: usize) -> Vec { function create_vec_u32 (line 138) | pub fn create_vec_u32(len: usize) -> Vec { function generate_position_array (line 142) | pub fn generate_position_array( function Fr_toInt (line 159) | pub unsafe fn Fr_toInt(a: *const FrElement) -> u64 { function print (line 172) | pub unsafe fn print(a: *const FrElement) { function Fr_isTrue (line 176) | pub fn Fr_isTrue(a: *mut FrElement) -> bool { function Fr_eq (line 189) | pub unsafe fn Fr_eq(to: *mut FrElement, a: *const FrElement, b: *const F... function Fr_neq (line 193) | pub unsafe fn Fr_neq(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_lt (line 197) | pub unsafe fn Fr_lt(to: *mut FrElement, a: *const FrElement, b: *const F... function Fr_gt (line 201) | pub unsafe fn Fr_gt(to: *mut FrElement, a: *const FrElement, b: *const F... function Fr_leq (line 205) | pub unsafe fn Fr_leq(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_geq (line 209) | pub unsafe fn Fr_geq(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_lor (line 213) | pub unsafe fn Fr_lor(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_shl (line 217) | pub unsafe fn Fr_shl(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_shr (line 221) | pub unsafe fn Fr_shr(to: *mut FrElement, a: *const FrElement, b: *const ... function Fr_band (line 225) | pub unsafe fn Fr_band(to: *mut FrElement, a: *const FrElement, b: *const... FILE: crates/circom-witness-rs/src/generate.rs type InputOutputList (line 16) | pub struct InputOutputList { type IODef (line 21) | pub struct IODef { type Circom_Component (line 28) | struct Circom_Component { type Circom_CalcWit (line 40) | struct Circom_CalcWit { function create_vec (line 52) | fn create_vec(len: usize) -> Vec; function create_vec_u32 (line 53) | fn create_vec_u32(len: usize) -> Vec; function generate_position_array (line 54) | fn generate_position_array( function Fr_mul (line 62) | unsafe fn Fr_mul(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_add (line 63) | unsafe fn Fr_add(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_sub (line 64) | unsafe fn Fr_sub(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_copy (line 65) | unsafe fn Fr_copy(to: *mut FrElement, a: *const FrElement); function Fr_copyn (line 66) | unsafe fn Fr_copyn(to: *mut FrElement, a: *const FrElement, n: usize); function Fr_shl (line 71) | unsafe fn Fr_shl(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_shr (line 72) | unsafe fn Fr_shr(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_band (line 73) | unsafe fn Fr_band(to: *mut FrElement, a: *const FrElement, b: *const FrE... function Fr_eq (line 77) | unsafe fn Fr_eq(to: *mut FrElement, a: *const FrElement, b: *const FrEle... function Fr_neq (line 78) | unsafe fn Fr_neq(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_lt (line 79) | unsafe fn Fr_lt(to: *mut FrElement, a: *const FrElement, b: *const FrEle... function Fr_gt (line 80) | unsafe fn Fr_gt(to: *mut FrElement, a: *const FrElement, b: *const FrEle... function Fr_leq (line 81) | unsafe fn Fr_leq(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_geq (line 82) | unsafe fn Fr_geq(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function Fr_isTrue (line 83) | unsafe fn Fr_isTrue(a: *mut FrElement) -> bool; function Fr_toInt (line 85) | unsafe fn Fr_toInt(a: *mut FrElement) -> u64; function Fr_lor (line 86) | unsafe fn Fr_lor(to: *mut FrElement, a: *const FrElement, b: *const FrEl... function print (line 87) | unsafe fn print(a: *mut FrElement); function run (line 96) | unsafe fn run(ctx: *mut Circom_CalcWit); function get_size_of_io_map (line 97) | fn get_size_of_io_map() -> u32; function get_total_signal_no (line 98) | fn get_total_signal_no() -> u32; function get_main_input_signal_no (line 99) | fn get_main_input_signal_no() -> u32; function get_main_input_signal_start (line 100) | fn get_main_input_signal_start() -> u32; function get_number_of_components (line 101) | fn get_number_of_components() -> u32; function get_size_of_constants (line 102) | fn get_size_of_constants() -> u32; function get_size_of_input_hashmap (line 103) | fn get_size_of_input_hashmap() -> u32; function get_size_of_witness (line 104) | fn get_size_of_witness() -> u32; constant DAT_BYTES (line 108) | const DAT_BYTES: &[u8] = include_bytes!("constants.dat"); function get_input_hash_map (line 110) | pub fn get_input_hash_map() -> Vec { function get_witness_to_signal (line 127) | pub fn get_witness_to_signal() -> Vec { function get_constants (line 138) | pub fn get_constants() -> Vec { function get_iosignals (line 165) | pub fn get_iosignals() -> Vec { function build_witness (line 210) | pub fn build_witness() -> color_color_eyre::Result<()> { FILE: crates/circom-witness-rs/src/graph.rs function ark_se (line 15) | fn ark_se(a: &A, s: S) -> Result function ark_de (line 25) | fn ark_de<'de, D, A: CanonicalDeserialize>(data: D) -> Result type Operation (line 35) | pub enum Operation { method eval (line 62) | pub fn eval(&self, a: U256, b: U256) -> U256 { method eval_fr (line 82) | pub fn eval_fr(&self, a: Fr, b: Fr) -> Fr { type Node (line 53) | pub enum Node { function compute_shl_uint (line 93) | fn compute_shl_uint(a: U256, b: U256) -> U256 { function compute_shr_uint (line 99) | fn compute_shr_uint(a: U256, b: U256) -> U256 { function assert_valid (line 106) | fn assert_valid(nodes: &[Node]) { function optimize (line 115) | pub fn optimize(nodes: &mut Vec, outputs: &mut [usize]) { function evaluate (line 125) | pub fn evaluate(nodes: &[Node], inputs: &[U256], outputs: &[usize]) -> V... function propagate (line 150) | pub fn propagate(nodes: &mut [Node]) { function tree_shake (line 177) | pub fn tree_shake(nodes: &mut Vec, outputs: &mut [usize]) { function random_eval (line 231) | fn random_eval(nodes: &mut [Node]) -> Vec { function value_numbering (line 262) | pub fn value_numbering(nodes: &mut [Node], outputs: &mut [usize]) { function constants (line 295) | pub fn constants(nodes: &mut [Node]) { function montgomery_form (line 317) | pub fn montgomery_form(nodes: &mut [Node]) { FILE: crates/circom-witness-rs/src/lib.rs type HashSignalInfo (line 15) | pub struct HashSignalInfo { type Graph (line 21) | pub struct Graph { function fnv1a (line 27) | fn fnv1a(s: &str) -> u64 { function init_graph (line 37) | pub fn init_graph(graph_bytes: &[u8]) -> color_eyre::Result { function get_inputs_size (line 49) | pub fn get_inputs_size(graph: &Graph) -> usize { function get_inputs_buffer (line 66) | pub fn get_inputs_buffer(size: usize) -> Vec { function get_input_mapping (line 73) | pub fn get_input_mapping(input_list: &Vec, graph: &Graph) -> Has... function populate_inputs (line 89) | pub fn populate_inputs( function calculate_witness (line 102) | pub fn calculate_witness( FILE: crates/hasher/src/lib.rs type Hasher (line 4) | pub trait Hasher { method hash_node (line 9) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash; type Hash (line 15) | pub trait Hash: Pod + Eq + Send + Sync {} FILE: crates/js/build.mjs function main (line 19) | async function main() { FILE: crates/js/src/lib.rs function compress_proof (line 12) | pub fn compress_proof( function decompress_proof (line 40) | pub fn decompress_proof( function from_vec (line 63) | fn from_vec(proof: Vec) -> Result<[U256; N], JsE... function to_js_array (line 81) | fn to_js_array(arr: [U256; N]) -> Array { FILE: crates/keccak/src/keccak.rs type Keccak256 (line 3) | pub struct Keccak256; type Hash (line 6) | type Hash = [u8; 32]; method hash_node (line 8) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash { FILE: crates/keccak/src/sha3.rs type Sha3_256 (line 4) | pub struct Sha3_256; type Hash (line 7) | type Hash = [u8; 32]; method hash_node (line 9) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash { FILE: crates/poseidon/src/lib.rs type Poseidon (line 7) | pub struct Poseidon; type Hash (line 10) | type Hash = U256; method hash_node (line 12) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash { FILE: crates/poseidon/src/poseidon.rs function hash1 (line 78) | pub fn hash1(value: U256) -> U256 { function hash2 (line 108) | pub fn hash2(left: U256, right: U256) -> U256 { function test_hash1 (line 143) | fn test_hash1() { function test_hash2 (line 151) | fn test_hash2() { FILE: crates/proof/src/ark.rs method from (line 8) | fn from(proof: ArkProof>) -> Self { type Error (line 16) | type Error = AffineError; function try_from (line 18) | fn try_from(proof: Proof) -> Result { FILE: crates/proof/src/compression.rs constant P (line 15) | pub const P: U256 = constant ONE (line 19) | pub const ONE: U256 = uint! { 1_U256 }; constant TWO (line 20) | pub const TWO: U256 = uint! { 2_U256 }; constant THREE (line 21) | pub const THREE: U256 = uint! { 3_U256 }; constant FOUR (line 22) | pub const FOUR: U256 = uint! { 4_U256 }; type CompressedProof (line 33) | pub struct CompressedProof(pub U256, pub (U256, U256), pub U256); method from_flat (line 36) | pub const fn from_flat(flat: [U256; 4]) -> Self { method flatten (line 42) | pub const fn flatten(self) -> [U256; 4] { function compress_proof (line 48) | pub fn compress_proof(proof: Proof) -> Option { function decompress_proof (line 65) | pub fn decompress_proof(compressed: CompressedProof) -> Option { function compress_g1 (line 84) | pub fn compress_g1((x, y): G1) -> Option { function decompress_g1 (line 101) | pub fn decompress_g1(c: U256) -> Option { function compress_g2 (line 122) | pub fn compress_g2(([x0, x1], [y0, y1]): G2) -> Option<(U256, U256)> { function decompress_g2 (line 166) | pub fn decompress_g2((c0, c1): (U256, U256)) -> Option { function sqrt_fp (line 203) | fn sqrt_fp(a: U256) -> Option { function sqrt_fp2 (line 212) | fn sqrt_fp2(a0: U256, a1: U256, hint: bool) -> Option<(U256, U256)> { function is_square_fp (line 232) | fn is_square_fp(a: U256) -> bool { function invert_fp (line 241) | fn invert_fp(a: U256) -> Option { function neg_fp (line 251) | fn neg_fp(a: U256) -> U256 { function inversion (line 260) | fn inversion() { function square_root_fp (line 269) | fn square_root_fp() { function square_root_fp_2 (line 278) | fn square_root_fp_2() { function proof_compression (line 329) | fn proof_compression() { function g1_compression (line 358) | fn g1_compression() { function g2_compression (line 376) | fn g2_compression() { function deser (line 400) | fn deser() { FILE: crates/proof/src/lib.rs type G1 (line 12) | pub type G1 = (U256, U256); type G2 (line 15) | pub type G2 = ([U256; 2], [U256; 2]); type Proof (line 19) | pub struct Proof(pub G1, pub G2, pub G1); method from_flat (line 22) | pub const fn from_flat(flat: [U256; 8]) -> Self { method flatten (line 27) | pub const fn flatten(self) -> [U256; 8] { function deser (line 38) | fn deser() { FILE: crates/proof/src/packing.rs type PackedProof (line 18) | pub struct PackedProof(pub [u8; 256]); method from (line 21) | fn from(proof: Proof) -> Self { method deserialize (line 78) | fn deserialize>(deserializer: D) -> Result Self { method fmt (line 53) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { type Err (line 64) | type Err = hex::FromHexError; method from_str (line 66) | fn from_str(s: &str) -> Result { method serialize (line 72) | fn serialize(&self, serializer: S) -> Result usize { function gen_supported_depths (line 21) | const fn gen_supported_depths() -> [usize; get_supported_depth_count()] { function get_supported_depths (line 44) | pub fn get_supported_depths() -> &'static [usize] { function get_depth_index (line 49) | pub const fn get_depth_index(depth: usize) -> Option { FILE: crates/semaphore-depth-macros/src/lib.rs function test_all_depths (line 43) | pub fn test_all_depths(_attr: TokenStream, item: TokenStream) -> TokenSt... type ArrayForDepthsInput (line 64) | struct ArrayForDepthsInput { type MacroArgs (line 70) | struct MacroArgs { method tokens (line 89) | fn tokens(&self) -> proc_macro2::TokenStream { method parse (line 75) | fn parse(input: ParseStream) -> syn::Result { type IdentReplacer (line 95) | struct IdentReplacer(Ident, syn::Expr); method visit_expr_mut (line 98) | fn visit_expr_mut(&mut self, expr: &mut syn::Expr) { method parse (line 120) | fn parse(input: ParseStream) -> syn::Result { function array_for_depths (line 147) | pub fn array_for_depths(input: TokenStream) -> TokenStream { FILE: crates/semaphore/benches/cascading_merkle_tree.rs type TreeValues (line 22) | struct TreeValues { function bench_cascading_proof_from_hash (line 28) | fn bench_cascading_proof_from_hash(criterion: &mut Criterion) { function bench_cascading_validate (line 52) | fn bench_cascading_validate(criterion: &mut Criterion) { function bench_cascading_create_dense_tree (line 82) | fn bench_cascading_create_dense_tree(criterion: &mut Criterion) { function bench_cascading_create_dense_mmap_tree (line 111) | fn bench_cascading_create_dense_mmap_tree(criterion: &mut Criterion) { function bench_cascading_restore_dense_mmap_tree (line 143) | fn bench_cascading_restore_dense_mmap_tree(criterion: &mut Criterion) { function bench_cascading_dense_tree_reads (line 183) | fn bench_cascading_dense_tree_reads(criterion: &mut Criterion) { function bench_cascading_dense_mmap_tree_reads (line 203) | fn bench_cascading_dense_mmap_tree_reads(criterion: &mut Criterion) { function bench_cascading_dense_tree_writes (line 225) | fn bench_cascading_dense_tree_writes(criterion: &mut Criterion) { function bench_cascading_dense_mmap_tree_writes (line 248) | fn bench_cascading_dense_mmap_tree_writes(criterion: &mut Criterion) { function create_values_for_tree (line 273) | fn create_values_for_tree(depth: usize) -> TreeValues { FILE: crates/semaphore/benches/lazy_merkle_tree.rs type TreeValues (line 19) | struct TreeValues { function bench_create_dense_tree (line 26) | fn bench_create_dense_tree(criterion: &mut Criterion) { function bench_create_dense_mmap_tree (line 55) | fn bench_create_dense_mmap_tree(criterion: &mut Criterion) { function bench_restore_dense_mmap_tree (line 90) | fn bench_restore_dense_mmap_tree(criterion: &mut Criterion) { function bench_dense_tree_reads (line 134) | fn bench_dense_tree_reads(criterion: &mut Criterion) { function bench_dense_mmap_tree_reads (line 154) | fn bench_dense_mmap_tree_reads(criterion: &mut Criterion) { function bench_dense_tree_writes (line 178) | fn bench_dense_tree_writes(criterion: &mut Criterion) { function bench_dense_mmap_tree_writes (line 201) | fn bench_dense_mmap_tree_writes(criterion: &mut Criterion) { function create_values_for_tree (line 228) | fn create_values_for_tree(depth: usize) -> TreeValues { FILE: crates/semaphore/build.rs constant SEMAPHORE_FILES_PATH (line 8) | const SEMAPHORE_FILES_PATH: &str = "semaphore_files"; constant SEMAPHORE_DOWNLOAD_URL (line 9) | const SEMAPHORE_DOWNLOAD_URL: &str = "https://www.trusted-setup-pse.org/... function download_and_store_binary (line 11) | fn download_and_store_binary(url: &str, path: impl AsRef) -> Resul... function create_arkzkey (line 23) | fn create_arkzkey(path: PathBuf) -> Result { function build_circuit (line 41) | fn build_circuit(depth: usize) -> Result<()> { function main (line 91) | fn main() -> Result<()> { FILE: crates/semaphore/examples/abort/main.rs function main (line 24) | async fn main() -> Result<()> { function run (line 45) | fn run() -> Result<()> { function run_test (line 56) | fn run_test(prefix: &str) -> Result { function cascade_init (line 87) | fn cascade_init() -> Result<()> { function cascade_restore (line 113) | fn cascade_restore() -> Result<()> { function lazy_init (line 127) | fn lazy_init() -> Result<()> { function lazy_restore (line 151) | fn lazy_restore() -> Result<()> { FILE: crates/semaphore/src/circuit.rs constant ZKEY_BYTES (line 10) | const ZKEY_BYTES: [&[u8]; get_supported_depth_count()] = constant GRAPH_BYTES (line 13) | const GRAPH_BYTES: [&[u8]; get_supported_depth_count()] = function zkey (line 23) | pub fn zkey(depth: usize) -> &'static (ProvingKey, ConstraintMatr... function graph (line 29) | pub fn graph(depth: usize) -> &'static [u8] { FILE: crates/semaphore/src/field.rs type Field (line 8) | pub type Field = U256; constant MODULUS (line 11) | pub const MODULUS: Field = function hash_to_field (line 20) | pub fn hash_to_field(data: &[u8]) -> Field { FILE: crates/semaphore/src/hash.rs type Hash (line 13) | pub struct Hash(pub [u8; 32]); method from_bytes_be (line 17) | pub const fn from_bytes_be(bytes: [u8; 32]) -> Self { method as_bytes_be (line 22) | pub const fn as_bytes_be(&self) -> &[u8; 32] { method from (line 36) | fn from(u256: U256) -> Self { method from (line 43) | fn from(vec: Vec) -> Self { method deserialize (line 102) | fn deserialize>(deserializer: D) -> Result Self { method from (line 52) | fn from(hash: Hash) -> Self { method from (line 58) | fn from(hash: &Hash) -> Self { method fmt (line 64) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { method fmt (line 72) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { type Err (line 83) | type Err = hex::FromHexError; method from_str (line 85) | fn from_str(s: &str) -> Result { method serialize (line 93) | fn serialize(&self, serializer: S) -> Result Self { method from_secret (line 44) | pub fn from_secret(secret: &mut [u8], trapdoor_seed: Option<&[u8]>) ->... method from_hashed_secret (line 52) | pub fn from_hashed_secret(secret_hex: &mut [u8; 64], trapdoor_seed: Op... method secret_hash (line 62) | pub fn secret_hash(&self) -> Field { method commitment (line 67) | pub fn commitment(&self) -> Field { function derive_field (line 16) | fn derive_field(seed_hex: &[u8; 64], suffix: &[u8]) -> Field { function seed_hex (line 23) | pub fn seed_hex(seed: &[u8]) -> [u8; 64] { FILE: crates/semaphore/src/lib.rs function test_field_serde (line 29) | fn test_field_serde() { function test_end_to_end (line 36) | fn test_end_to_end( function test_auth_flow (line 76) | fn test_auth_flow(depth: usize) { function test_single_impl (line 105) | fn test_single_impl(depth: usize) { function test_parallel_impl (line 112) | fn test_parallel_impl(depth: usize) { FILE: crates/semaphore/src/poseidon_tree.rs type PoseidonTree (line 7) | pub type PoseidonTree = MerkleTree; type LazyPoseidonTree (line 9) | pub type LazyPoseidonTree = LazyMerkleTree; type Branch (line 10) | pub type Branch = semaphore_rs_trees::Branch<::Hash>; type Proof (line 11) | pub type Proof = semaphore_rs_trees::InclusionProof; FILE: crates/semaphore/src/protocol/authentication.rs function empty_hashes (line 9) | fn empty_hashes(depth: usize) -> Vec { function authentication_merkle_proof (line 21) | fn authentication_merkle_proof(depth: usize) -> InclusionProof Field { function generate_proof (line 29) | pub fn generate_proof( function verify_proof (line 39) | pub fn verify_proof( function test_round_trip (line 68) | fn test_round_trip(depth: usize) { FILE: crates/semaphore/src/protocol/mod.rs function warmup_for_verification (line 37) | pub fn warmup_for_verification(tree_depth: usize) { function merkle_proof_to_vec (line 43) | fn merkle_proof_to_vec(proof: &InclusionProof) -> Vec { function generate_nullifier_hash (line 55) | pub fn generate_nullifier_hash(identity: &Identity, external_nullifier: ... type ProofError (line 60) | pub enum ProofError { function generate_proof (line 78) | pub fn generate_proof( function generate_proof_rng (line 98) | pub fn generate_proof_rng( function generate_proof_rs (line 115) | fn generate_proof_rs( function generate_witness (line 142) | pub fn generate_witness( function path_index (line 173) | pub fn path_index(proof: &InclusionProof) -> Vec { function verify_proof (line 190) | pub fn verify_proof( function arb_proof (line 226) | fn arb_proof(seed: u64, depth: usize) -> Proof { function test_proof_cast_roundtrip (line 258) | fn test_proof_cast_roundtrip(depth: usize) { function test_proof_serialize (line 266) | fn test_proof_serialize(depth: usize) { FILE: crates/storage/src/lib.rs type GenericStorage (line 3) | pub trait GenericStorage: method push (line 6) | fn push(&mut self, value: T); method extend_from_slice (line 8) | fn extend_from_slice(&mut self, slice: &[T]); method clear (line 10) | fn clear(&mut self); function push (line 14) | fn push(&mut self, value: T) { function extend_from_slice (line 18) | fn extend_from_slice(&mut self, slice: &[T]) { function clear (line 22) | fn clear(&mut self) { FILE: crates/storage/src/native/mmap_vec.rs constant META_SIZE (line 9) | const META_SIZE: usize = std::mem::size_of::(); type MmapVec (line 11) | pub struct MmapVec { function create_from_path (line 27) | pub unsafe fn create_from_path(file_path: impl AsRef) -> color_eyr... function create (line 46) | pub unsafe fn create(file: File) -> color_eyre::Result { function restore_from_path (line 62) | pub unsafe fn restore_from_path(file_path: impl AsRef) -> color_ey... function restore (line 82) | pub unsafe fn restore(file: File) -> color_eyre::Result { function clear (line 121) | pub fn clear(&mut self) { function push (line 125) | pub fn push(&mut self, v: T) { function extend_from_slice (line 138) | pub fn extend_from_slice(&mut self, slice: &[T]) { function resize (line 151) | pub fn resize(&mut self, new_capacity: usize) { function set_storage_len (line 183) | fn set_storage_len(&mut self, new_len: usize) { function storage_len (line 189) | fn storage_len(&self) -> usize { function capacity_slice (line 193) | fn capacity_slice(&self) -> &[T] { function capacity_slice_mut (line 197) | fn capacity_slice_mut(&mut self) -> &mut [T] { function extend (line 206) | fn extend>(&mut self, iter: I) { type Target (line 217) | type Target = [T]; method deref (line 219) | fn deref(&self) -> &Self::Target { method deref_mut (line 228) | fn deref_mut(&mut self) -> &mut Self::Target { function fmt (line 238) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { function test_capacity_push (line 255) | fn test_capacity_push() { function test_capacity_extend (line 304) | fn test_capacity_extend() { function test_capacity_create (line 339) | fn test_capacity_create() { function test_capacity_create_from_path (line 367) | fn test_capacity_create_from_path() { function test_capacity_restore (line 395) | fn test_capacity_restore() { function test_capacity_restore_from_path (line 423) | fn test_capacity_restore_from_path() { function test_mmap_vec (line 450) | fn test_mmap_vec() { FILE: crates/storage/src/native/mod.rs function push (line 8) | fn push(&mut self, value: T) { function extend_from_slice (line 12) | fn extend_from_slice(&mut self, slice: &[T]) { function clear (line 16) | fn clear(&mut self) { FILE: crates/trees/src/cascading/mod.rs type CascadingMerkleTree (line 41) | pub struct CascadingMerkleTree::Hash>> function restore (line 60) | pub fn restore( function restore_unchecked (line 75) | pub fn restore_unchecked( function new (line 117) | pub fn new(storage: S, depth: usize, empty_value: &H::Hash) -> Cascading... function new_with_leaves (line 123) | pub fn new_with_leaves( function depth (line 153) | pub const fn depth(&self) -> usize { function empty_value (line 159) | pub const fn empty_value(&self) -> H::Hash { function root (line 165) | pub const fn root(&self) -> H::Hash { function num_leaves (line 174) | pub fn num_leaves(&self) -> usize { function set_leaf (line 182) | pub fn set_leaf(&mut self, leaf: usize, value: H::Hash) { function push (line 203) | pub fn push(&mut self, leaf: H::Hash) -> Result<()> { function proof (line 243) | pub fn proof(&self, leaf: usize) -> InclusionProof { function proof_from_hash (line 273) | pub fn proof_from_hash(&self, leaf: H::Hash) -> Option> { function verify (line 280) | pub fn verify(&self, value: H::Hash, proof: &InclusionProof) -> bool { function get_node (line 290) | pub fn get_node(&self, depth: usize, offset: usize) -> H::Hash { function get_leaf (line 307) | pub fn get_leaf(&self, leaf: usize) -> H::Hash { function get_leaf_from_hash (line 314) | pub fn get_leaf_from_hash(&self, hash: H::Hash) -> Option { function leaves (line 341) | pub fn leaves(&self) -> impl Iterator + '_ { function sparse_column (line 350) | fn sparse_column(depth: usize, empty_value: &H::Hash) -> Vec { function recompute_root (line 362) | fn recompute_root(&mut self) -> H::Hash { function compute_from_storage_tip (line 370) | fn compute_from_storage_tip(&self, depth: usize) -> H::Hash { function validate (line 382) | pub fn validate(&self) -> Result<()> { function extend_from_slice (line 401) | pub fn extend_from_slice(&mut self, leaves: &[H::Hash]) { type TestHasher (line 502) | pub struct TestHasher; type Hash (line 504) | type Hash = usize; method hash_node (line 506) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash { function debug_tree (line 511) | pub fn debug_tree(tree: &CascadingMerkleTree) function debug_storage (line 521) | pub fn debug_storage(storage: &S) function test_index_from_leaf (line 544) | fn test_index_from_leaf() { function test_index_height_offset (line 555) | fn test_index_height_offset() { function test_parent (line 583) | fn test_parent() { function test_sibling (line 610) | fn test_sibling() { function test_children (line 638) | fn test_children() { function test_invalid_storage (line 665) | fn test_invalid_storage() { function test_hash_too_small (line 677) | fn test_hash_too_small() { function test_min_sized_tree (line 692) | fn test_min_sized_tree() { function test_set_leaf (line 702) | fn test_set_leaf() { function test_set_leaf_extend (line 717) | fn test_set_leaf_extend() { function test_zero_depth_tree (line 733) | fn test_zero_depth_tree() { function test_odd_leaves (line 742) | fn test_odd_leaves() { function test_even_leaves (line 760) | fn test_even_leaves() { function test_no_leaves (line 779) | fn test_no_leaves() { function test_sparse_column (line 797) | fn test_sparse_column() { function test_compute_root (line 815) | fn test_compute_root() { function test_get_node (line 834) | fn test_get_node() { function test_get_leaf_from_hash (line 865) | fn test_get_leaf_from_hash() { function test_row_indices (line 881) | fn test_row_indices() { function test_row (line 911) | fn test_row() { function test_proof_from_hash (line 935) | fn test_proof_from_hash() { function test_leaves (line 1005) | fn test_leaves() { type Hash (line 1033) | type Hash = ::Hash; function test_extend_from_slice_keccak (line 1036) | fn test_extend_from_slice_keccak() -> color_eyre::Result<()> { function test_push_beyond_depth (line 1065) | fn test_push_beyond_depth() { function test_init_beyond_depth (line 1075) | fn test_init_beyond_depth() { function test_extend_beyond_depth (line 1081) | fn test_extend_beyond_depth() { function test_push (line 1088) | fn test_push() { function test_extend_from_slice (line 1101) | fn test_extend_from_slice() { function test_extend_from_slice_2 (line 1116) | fn test_extend_from_slice_2() { function test_vec_realloc_speed (line 1140) | fn test_vec_realloc_speed() { function test_mmap_realloc_speed (line 1157) | fn test_mmap_realloc_speed() { function test_restore_from_cache (line 1184) | fn test_restore_from_cache() -> color_eyre::Result<()> { FILE: crates/trees/src/cascading/storage_ops.rs type StorageOps (line 12) | pub trait StorageOps: method populate_with_leaves (line 24) | fn populate_with_leaves( method leaves (line 57) | fn leaves(&self) -> impl Iterator + '_ { method row_indices (line 63) | fn row_indices(&self, height: usize) -> impl Iterator + ... method row (line 74) | fn row(&self, height: usize) -> impl Iterator + Send +... method storage_root (line 79) | fn storage_root(&self) -> H::Hash { method storage_depth (line 84) | fn storage_depth(&self) -> usize { method set_num_leaves (line 89) | fn set_num_leaves(&mut self, amount: usize) { method num_leaves (line 94) | fn num_leaves(&self) -> usize { method increment_num_leaves (line 99) | fn increment_num_leaves(&mut self, amount: usize) { method propagate_up (line 105) | fn propagate_up(&mut self, mut index: usize) -> Option<()> { method validate_const (line 120) | fn validate_const(&self) -> Result<()> { method validate (line 133) | fn validate(&self, empty_value: &H::Hash) -> Result<()> { function subtree_depth (line 182) | pub fn subtree_depth(storage_slice: &[H]) -> usize { function sibling (line 191) | pub fn sibling(i: usize) -> Branch { function parent (line 209) | pub fn parent(i: usize) -> usize { function index_from_leaf (line 220) | pub fn index_from_leaf(leaf: usize) -> usize { function leaf_from_index (line 224) | pub fn leaf_from_index(index: usize) -> usize { function index_height_offset (line 230) | pub fn index_height_offset(height: usize, offset: usize) -> usize { function children (line 241) | pub fn children(i: usize) -> Option<(usize, usize)> { function init_subtree_with_leaves (line 285) | pub fn init_subtree_with_leaves( function extend_subtree_with_leaves (line 337) | pub fn extend_subtree_with_leaves( function propagate_partial_subtree (line 382) | pub fn propagate_partial_subtree(subtree: &mut [H::Hash], mut range: ... function sparse_fill_partial_subtree (line 437) | pub fn sparse_fill_partial_subtree( function row_indices (line 470) | fn row_indices(height: usize) -> impl Iterator + Send { function subtree_depth_width (line 488) | pub fn subtree_depth_width(storage_slice: &[H]) -> (usize, usize) { function test_is_storage_ops (line 508) | fn test_is_storage_ops(_s: &S) function test_mmap_vec_is_storage_ops (line 516) | fn test_mmap_vec_is_storage_ops(s: MmapVec<::Hash>) { function test_sparse_fill_partial_subtree (line 521) | fn test_sparse_fill_partial_subtree() { function test_propagate_partial_subtree_noop_on_empty_range (line 530) | fn test_propagate_partial_subtree_noop_on_empty_range() { function test_sparse_fill_partial_subtree_noop_on_empty_range (line 538) | fn test_sparse_fill_partial_subtree_noop_on_empty_range() { FILE: crates/trees/src/imt/mod.rs type MerkleTree (line 17) | pub struct MerkleTree function parent (line 33) | const fn parent(index: usize) -> Option { function left_child (line 42) | const fn left_child(index: usize) -> usize { function depth (line 46) | const fn depth(index: usize) -> usize { function new (line 64) | pub fn new(depth: usize, initial_leaf: H::Hash) -> Self { function num_leaves (line 89) | pub fn num_leaves(&self) -> usize { function root (line 94) | pub fn root(&self) -> H::Hash { function set (line 98) | pub fn set(&mut self, leaf: usize, hash: H::Hash) { function set_range (line 102) | pub fn set_range>(&mut self, start: usiz... function update_nodes (line 117) | fn update_nodes(&mut self, start: usize, end: usize) { function proof (line 129) | pub fn proof(&self, leaf: usize) -> Option> { function verify (line 148) | pub fn verify(&self, hash: H::Hash, proof: &InclusionProof) -> bool { function leaves (line 153) | pub fn leaves(&self) -> &[H::Hash] { function leaf_index (line 161) | pub fn leaf_index(&self) -> usize { function root (line 170) | pub fn root(&self, hash: H::Hash) -> H::Hash { function parent_of (line 196) | fn parent_of(index: usize) -> Option { function left_child_of (line 204) | fn left_child_of(index: usize) -> usize { function depth_of (line 213) | fn depth_of(index: usize) -> usize { function empty_keccak (line 218) | fn empty_keccak(depth: usize) -> [u8; 32] { function simple_poseidon (line 225) | fn simple_poseidon() { FILE: crates/trees/src/lazy/mod.rs type VersionMarker (line 16) | pub trait VersionMarker {} type Canonical (line 18) | pub struct Canonical; type Derived (line 21) | pub struct Derived; type LazyMerkleTree (line 38) | pub struct LazyMerkleTree { function new (line 51) | pub fn new(depth: usize, empty_value: H::Hash) -> LazyMerkleTree usize { function root (line 141) | pub fn root(&self) -> H::Hash { function update (line 149) | pub fn update(&self, index: usize, value: &H::Hash) -> LazyMerkleTree InclusionProof { function verify (line 166) | pub fn verify(&self, value: H::Hash, proof: &InclusionProof) -> bool { function get_leaf (line 172) | pub fn get_leaf(&self, index: usize) -> H::Hash { function leaves (line 177) | pub fn leaves(&self) -> impl Iterator + '_ { function update_with_mutation (line 204) | pub fn update_with_mutation(self, index: usize, value: &H::Hash) -> Self { function derived (line 214) | pub fn derived(&self) -> LazyMerkleTree { method clone (line 227) | fn clone(&self) -> Self { type AnyTree (line 235) | enum AnyTree { function new (line 247) | fn new(depth: usize, empty_value: H::Hash) -> Self { function new_with_dense_prefix_with_initial_values (line 251) | fn new_with_dense_prefix_with_initial_values( function new_with_dense_prefix (line 269) | fn new_with_dense_prefix(depth: usize, prefix_depth: usize, empty_value:... function new_mmapped_with_dense_prefix_with_init_values (line 283) | fn new_mmapped_with_dense_prefix_with_init_values( function try_restore_dense_mmap_tree_state (line 303) | fn try_restore_dense_mmap_tree_state( function depth (line 323) | const fn depth(&self) -> usize { function root (line 332) | fn root(&self) -> H::Hash { function proof (line 341) | fn proof(&self, index: usize) -> InclusionProof { function write_proof (line 354) | fn write_proof(&self, index: usize, path: &mut Vec>) { function update_with_mutation_condition (line 363) | fn update_with_mutation_condition( function get_leaf (line 385) | fn get_leaf(&self, index: usize) -> H::Hash { method clone (line 400) | fn clone(&self) -> Self { function from (line 411) | fn from(tree: EmptyTree) -> Self { function from (line 417) | fn from(tree: SparseTree) -> Self { function from (line 423) | fn from(tree: DenseTree) -> Self { function from (line 429) | fn from(tree: DenseMMapTree) -> Self { type EmptyTree (line 434) | struct EmptyTree { method clone (line 440) | fn clone(&self) -> Self { function new (line 454) | fn new(depth: usize, empty_value: H::Hash) -> Self { function write_proof (line 467) | fn write_proof(&self, index: usize, path: &mut Vec>) { function update_with_mutation_condition (line 480) | fn update_with_mutation_condition( function alloc_sparse (line 491) | fn alloc_sparse(&self) -> SparseTree { function alloc_dense (line 504) | fn alloc_dense(&self) -> DenseTree { function root (line 523) | fn root(&self) -> H::Hash { function get_leaf (line 527) | fn get_leaf(&self) -> H::Hash { type Children (line 532) | struct Children { method clone (line 538) | fn clone(&self) -> Self { type SparseTree (line 546) | struct SparseTree { type Turn (line 553) | enum Turn { function get_turn_at_depth (line 558) | const fn get_turn_at_depth(index: usize, depth: usize) -> Turn { function clear_turn_at_depth (line 566) | const fn clear_turn_at_depth(index: usize, depth: usize) -> usize { function from (line 575) | fn from(children: Children) -> Self { method clone (line 597) | fn clone(&self) -> Self { function new (line 611) | fn new(left: AnyTree, right: AnyTree) -> Self { function new_leaf (line 620) | const fn new_leaf(value: H::Hash) -> Self { function write_proof (line 628) | fn write_proof(&self, index: usize, path: &mut Vec>) { function update_with_mutation_condition (line 642) | fn update_with_mutation_condition( function root (line 675) | fn root(&self) -> H::Hash { function get_leaf (line 679) | fn get_leaf(&self, index: usize) -> H::Hash { type DenseTree (line 695) | struct DenseTree { method clone (line 702) | fn clone(&self) -> Self { function vec_from_values (line 716) | fn vec_from_values(values: &[H::Hash], empty_value: &H::Hash, depth: usi... function new_with_values (line 747) | fn new_with_values(values: &[H::Hash], empty_value: &H::Hash, depth: usi... function with_ref (line 757) | fn with_ref(&self, fun: F) -> R function write_proof (line 771) | fn write_proof(&self, index: usize, path: &mut Vec>) { function get_leaf (line 775) | fn get_leaf(&self, index: usize) -> H::Hash { function update_with_mutation_condition (line 782) | fn update_with_mutation_condition( function update_with_mutation (line 796) | fn update_with_mutation(&self, index: usize, value: &H::Hash) { function root (line 809) | fn root(&self) -> H::Hash { type DenseTreeRef (line 814) | struct DenseTreeRef<'a, H: Hasher> { function from (line 822) | fn from(value: DenseTreeRef) -> Self { function from (line 832) | fn from(value: DenseTreeRef) -> Self { function root (line 842) | fn root(&self) -> H::Hash { function left (line 846) | const fn left(&self) -> DenseTreeRef<'_, H> { function right (line 855) | const fn right(&self) -> DenseTreeRef<'_, H> { function write_proof (line 864) | fn write_proof(&self, index: usize, path: &mut Vec>) { function update (line 878) | fn update(&self, index: usize, hash: &H::Hash) -> SparseTree { type DenseMMapTree (line 913) | struct DenseMMapTree { method clone (line 920) | fn clone(&self) -> Self { function new_with_values (line 940) | fn new_with_values( function attempt_restore (line 973) | fn attempt_restore( function with_ref (line 992) | fn with_ref(&self, fun: F) -> R function write_proof (line 1006) | fn write_proof(&self, index: usize, path: &mut Vec>) { function get_leaf (line 1010) | fn get_leaf(&self, index: usize) -> H::Hash { function update_with_mutation_condition (line 1017) | fn update_with_mutation_condition( function update_with_mutation (line 1031) | fn update_with_mutation(&self, index: usize, value: &H::Hash) { function root (line 1044) | fn root(&self) -> H::Hash { type DenseTreeMMapRef (line 1049) | struct DenseTreeMMapRef<'a, H: Hasher> { function from (line 1057) | fn from(value: DenseTreeMMapRef) -> Self { function from (line 1067) | fn from(value: DenseTreeMMapRef) -> Self { function root (line 1077) | fn root(&self) -> H::Hash { function left (line 1081) | const fn left(&self) -> DenseTreeMMapRef<'_, H> { function right (line 1090) | const fn right(&self) -> DenseTreeMMapRef<'_, H> { function write_proof (line 1099) | fn write_proof(&self, index: usize, path: &mut Vec>) { function update (line 1113) | fn update(&self, index: usize, hash: &H::Hash) -> SparseTree { type MmapMutWrapper (line 1148) | pub struct MmapMutWrapper { function new_from_storage (line 1172) | pub fn new_from_storage( function attempt_restore (line 1225) | pub fn attempt_restore( type Target (line 1265) | type Target = [H::Hash]; method deref (line 1267) | fn deref(&self) -> &Self::Target { method deref_mut (line 1277) | fn deref_mut(&mut self) -> &mut Self::Target { type DenseMMapError (line 1283) | pub enum DenseMMapError { type TestHasher (line 1304) | struct TestHasher; type Hash (line 1307) | type Hash = u64; method hash_node (line 1309) | fn hash_node(left: &Self::Hash, right: &Self::Hash) -> Self::Hash { function test_updates_in_sparse (line 1315) | fn test_updates_in_sparse() { function test_updates_in_dense (line 1328) | fn test_updates_in_dense() { function test_mutable_updates_in_dense (line 1341) | fn test_mutable_updates_in_dense() { function test_mutable_updates_in_dense_with_dense_prefix (line 1386) | fn test_mutable_updates_in_dense_with_dense_prefix() { function test_proof (line 1432) | fn test_proof() { function test_giant_tree_with_initial_vals (line 1464) | fn test_giant_tree_with_initial_vals() { function test_giant_trees (line 1488) | fn test_giant_trees() { function test_dense_mmap_tree (line 1527) | fn test_dense_mmap_tree() { FILE: crates/trees/src/proof.rs type InclusionProof (line 12) | pub struct InclusionProof(pub Vec>) type Branch (line 18) | pub enum Branch { method serialize (line 31) | fn serialize(&self, serializer: S) -> Result function deserialize (line 44) | fn deserialize(deserializer: D) -> Result function into_inner (line 56) | pub fn into_inner(self) -> T { method fmt (line 65) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { FILE: crates/trees/tests/equivalent.rs constant DEPTH (line 8) | const DEPTH: usize = 20; constant DENSE_PREFIX (line 9) | const DENSE_PREFIX: usize = 16; constant NUM_LEAVES (line 11) | const NUM_LEAVES: usize = 100; type HashType (line 13) | type HashType = Poseidon; constant EMPTY_VALUE (line 14) | const EMPTY_VALUE: U256 = U256::ZERO; function equivalent (line 17) | fn equivalent() { FILE: crates/utils/src/lib.rs function keccak256 (line 11) | pub fn keccak256(bytes: &[u8]) -> [u8; 32] { function bytes_to_hex (line 19) | pub fn bytes_to_hex(bytes: &[u8; N]) -> ... function serialize_bytes (line 30) | pub fn serialize_bytes( function bytes_from_hex (line 50) | pub fn bytes_from_hex(s: &str) -> Result<[u8; N], hex::F... function trim_hex_prefix (line 58) | fn trim_hex_prefix(str: &str) -> &str { function deserialize_bytes (line 63) | pub fn deserialize_bytes<'de, const N: usize, D: Deserializer<'de>>( function test_serialize_bytes_hex (line 113) | fn test_serialize_bytes_hex() { function test_serialize_bytes_bin (line 122) | fn test_serialize_bytes_bin() {