SYMBOL INDEX (129 symbols across 10 files)

FILE: benches/packed.rs
  function bench_100_shamir (line 18) | pub fn bench_100_shamir(b: &mut Bencher) {
  function bench_100_packed (line 33) | pub fn bench_100_packed(b: &mut Bencher) {
  function bench_large_secret_count (line 54) | pub fn bench_large_secret_count(b: &mut Bencher) {
  function bench_large_share_count (line 64) | pub fn bench_large_share_count(b: &mut Bencher) {
  function bench_large_reconstruct (line 72) | pub fn bench_large_reconstruct(b: &mut Bencher) {

FILE: examples/homomorphic.rs
  function main (line 10) | fn main() {

FILE: examples/shamir.rs
  function main (line 10) | fn main() {

FILE: src/fields/fft.rs
  function fft2 (line 21) | pub fn fft2<F: Field>(zp: &F, data: &mut [F::U], omega: F::U) {
  function fft2_inverse (line 34) | pub fn fft2_inverse<F: Field>(zp: &F, data: &mut [F::U], omega: F::U) {
  function fft2_in_place_rearrange (line 44) | fn fft2_in_place_rearrange<F: Field>(_zp: &F, data: &mut [F::U]) {
  function fft2_in_place_compute (line 59) | fn fft2_in_place_compute<F: Field>(zp: &F, data: &mut [F::U], omega: F::...
  function trigits_len (line 82) | fn trigits_len(n: usize) -> usize {
  function fft3_in_place_rearrange (line 92) | fn fft3_in_place_rearrange<F: Field>(_zp: &F, data: &mut [F::U]) {
  function fft3_in_place_compute (line 114) | fn fft3_in_place_compute<F: Field>(zp: &F, data: &mut [F::U], omega: F::...
  function fft3 (line 152) | pub fn fft3<F: Field>(zp: &F, data: &mut [F::U], omega: F::U) {
  function fft3_inverse (line 165) | pub fn fft3_inverse<F: Field>(zp: &F, data: &mut [F::U], omega: F::U) {
  function from (line 179) | pub fn from<F: Field>(zp: &F, data: &[u64]) -> Vec<F::U> {
  function back (line 183) | pub fn back<F: Field>(zp: &F, data: &[F::U]) -> Vec<u64> {
  function test_fft2 (line 187) | pub fn test_fft2<F: Field>() {
  function test_fft2_inverse (line 197) | pub fn test_fft2_inverse<F: Field>() {
  function test_fft2_big (line 207) | pub fn test_fft2_big<F: Field>() {
  function test_fft3 (line 218) | pub fn test_fft3<F: Field>() {
  function test_fft3_inverse (line 228) | pub fn test_fft3_inverse<F: Field>() {
  function test_fft3_big (line 238) | pub fn test_fft3_big<F: Field>() {

FILE: src/fields/mod.rs
  type Field (line 18) | pub trait Field {
    method new (line 25) | fn new(prime: u64) -> Self;
    method modulus (line 28) | fn modulus(&self) -> u64;
    method from_u64 (line 31) | fn from_u64(&self, a: u64) -> Self::U;
    method to_u64 (line 34) | fn to_u64(&self, a: Self::U) -> u64;
    method from_i64 (line 37) | fn from_i64(&self, a: i64) -> Self::U {
    method to_i64 (line 47) | fn to_i64(&self, a: Self::U) -> i64 {
    method zero (line 57) | fn zero(&self) -> Self::U {
    method one (line 62) | fn one(&self) -> Self::U {
    method add (line 67) | fn add(&self, a: Self::U, b: Self::U) -> Self::U;
    method sub (line 70) | fn sub(&self, a: Self::U, b: Self::U) -> Self::U;
    method mul (line 73) | fn mul(&self, a: Self::U, b: Self::U) -> Self::U;
    method inv (line 76) | fn inv(&self, a: Self::U) -> Self::U;
    method qpow (line 81) | fn qpow(&self, mut x: Self::U, mut e: u32) -> Self::U {
  function test_convert (line 121) | pub fn test_convert<F: Field>() {
  function test_add (line 128) | pub fn test_add<F: Field>() {
  function test_sub (line 134) | pub fn test_sub<F: Field>() {
  function test_mul (line 141) | pub fn test_mul<F: Field>() {
  function test_qpow (line 149) | pub fn test_qpow<F: Field>() {

FILE: src/fields/montgomery.rs
  type Value (line 15) | pub struct Value(u32);
  type MontgomeryField32 (line 27) | pub struct MontgomeryField32 {
    method new (line 35) | pub fn new(prime: u32) -> MontgomeryField32 {
    method redc (line 58) | fn redc(&self, a: u64) -> Value {
  type U (line 66) | type U = Value;
  method modulus (line 68) | fn modulus(&self) -> u64 {
  method add (line 72) | fn add(&self, a: Self::U, b: Self::U) -> Self::U {
  method sub (line 81) | fn sub(&self, a: Self::U, b: Self::U) -> Self::U {
  method mul (line 89) | fn mul(&self, a: Self::U, b: Self::U) -> Self::U {
  method inv (line 93) | fn inv(&self, a: Self::U) -> Self::U {
  method new (line 98) | fn new(prime: u64) -> MontgomeryField32 {
  method from_u64 (line 102) | fn from_u64(&self, a: u64) -> Self::U {
  method to_u64 (line 106) | fn to_u64(&self, a: Self::U) -> u64 {

FILE: src/fields/native.rs
  type Value (line 15) | pub struct Value(i64);
  type NativeField (line 25) | pub struct NativeField(i64);
  type U (line 28) | type U = Value;
  method new (line 30) | fn new(prime: u64) -> NativeField {
  method modulus (line 34) | fn modulus(&self) -> u64 {
  method from_u64 (line 38) | fn from_u64(&self, a: u64) -> Self::U {
  method to_u64 (line 42) | fn to_u64(&self, a: Self::U) -> u64 {
  method add (line 46) | fn add(&self, a: Self::U, b: Self::U) -> Self::U {
  method sub (line 50) | fn sub(&self, a: Self::U, b: Self::U) -> Self::U {
  method mul (line 59) | fn mul(&self, a: Self::U, b: Self::U) -> Self::U {
  method inv (line 63) | fn inv(&self, a: Self::U) -> Self::U {

FILE: src/numtheory.rs
  function gcd (line 13) | pub fn gcd(a: i64, b: i64) -> (i64, i64, i64) {
  function test_gcd (line 25) | fn test_gcd() {
  function mod_inverse (line 31) | pub fn mod_inverse(k: i64, prime: i64) -> i64 {
  function test_mod_inverse (line 42) | fn test_mod_inverse() {
  function mod_pow (line 48) | pub fn mod_pow(mut x: i64, mut e: u32, prime: i64) -> i64 {
  function test_mod_pow (line 65) | fn test_mod_pow() {
  function fft2 (line 82) | pub fn fft2(a_coef: &[i64], omega: i64, prime: i64) -> Vec<i64> {
  function fft2_inverse (line 92) | pub fn fft2_inverse(a_point: &[i64], omega: i64, prime: i64) -> Vec<i64> {
  function test_fft2 (line 102) | fn test_fft2() {
  function test_fft2_inverse (line 114) | fn test_fft2_inverse() {
  function fft3 (line 129) | pub fn fft3(a_coef: &[i64], omega: i64, prime: i64) -> Vec<i64> {
  function fft3_inverse (line 140) | pub fn fft3_inverse(a_point: &[i64], omega: i64, prime: i64) -> Vec<i64> {
  function test_fft3 (line 150) | fn test_fft3() {
  function test_fft3_inverse (line 161) | fn test_fft3_inverse() {
  function lagrange_interpolation_at_zero (line 181) | pub fn lagrange_interpolation_at_zero(points: &[i64], values: &[i64], pr...
  type NewtonPolynomial (line 203) | pub struct NewtonPolynomial<'a> {
  function newton_interpolation_general (line 212) | pub fn newton_interpolation_general<'a>(points: &'a [i64],
  function test_newton_interpolation_general (line 224) | fn test_newton_interpolation_general() {
  function newton_evaluate (line 243) | pub fn newton_evaluate(poly: &NewtonPolynomial, point: i64, prime: i64) ...
  function compute_newton_coefficients (line 259) | fn compute_newton_coefficients(points: &[i64], values: &[i64], prime: i6...
  function test_compute_newton_coefficients (line 289) | fn test_compute_newton_coefficients() {
  function positivise (line 299) | pub fn positivise(values: &[i64], n: i64) -> Vec<i64> {
  function mod_evaluate_polynomial (line 323) | pub fn mod_evaluate_polynomial(coefficients: &[i64], point: i64, prime: ...
  function test_mod_evaluate_polynomial (line 334) | fn test_mod_evaluate_polynomial() {

FILE: src/packed.rs
  type PackedSecretSharing (line 41) | pub struct PackedSecretSharing {
    method reconstruct_limit (line 112) | pub fn reconstruct_limit(&self) -> usize {
    method share (line 120) | pub fn share(&self, secrets: &[i64]) -> Vec<i64> {
    method sample_polynomial (line 138) | fn sample_polynomial(&self, secrets: &[i64]) -> Vec<i64> {
    method recover_polynomial (line 152) | fn recover_polynomial(&self, secrets: &[i64], randomness: Vec<i64>) ->...
    method evaluate_polynomial (line 165) | fn evaluate_polynomial(&self, coefficients: Vec<i64>) -> Vec<i64> {
    method reconstruct (line 178) | pub fn reconstruct(&self, indices: &[usize], shares: &[i64]) -> Vec<i6...
    method new (line 480) | pub fn new(threshold: usize,
    method new_with_min_size (line 489) | pub fn new_with_min_size(threshold: usize,
  function test_recover_polynomial (line 212) | fn test_recover_polynomial() {
  function test_evaluate_polynomial (line 225) | fn test_evaluate_polynomial() {
  function test_share (line 241) | fn test_share() {
  function test_large_share (line 267) | fn test_large_share() {
  function test_share_reconstruct (line 275) | fn test_share_reconstruct() {
  function test_share_additive_homomorphism (line 295) | fn test_share_additive_homomorphism() {
  function test_share_multiplicative_homomorphism (line 318) | fn test_share_multiplicative_homomorphism() {
  function check_prime_form (line 352) | fn check_prime_form(min_p: usize, n: usize, m: usize, p: usize) -> bool {
  function test_check_prime_form (line 367) | fn test_check_prime_form() {
  function factor (line 371) | fn factor(p: usize) -> Vec<usize> {
  function test_factor (line 384) | fn test_factor() {
  function find_field (line 389) | fn find_field(min_p: usize, n: usize, m: usize) -> Option<(i64, i64)> {
  function test_find_field (line 411) | fn test_find_field() {
  function find_roots (line 425) | fn find_roots(n: usize, m: usize, p: i64, g: i64) -> (i64, i64) {
  function test_find_roots (line 433) | fn test_find_roots() {
  function generate_parameters (line 439) | pub fn generate_parameters(min_size: usize, n: usize, m: usize) -> (i64,...
  function test_generate_parameters (line 447) | fn test_generate_parameters() {
  function is_power_of (line 454) | fn is_power_of(x: usize, e: usize) -> bool {
  function test_is_power_of (line 460) | fn test_is_power_of() {
  function test_new (line 515) | fn test_new() {

FILE: src/shamir.rs
  type ShamirSecretSharing (line 45) | pub struct ShamirSecretSharing {
    method reconstruct_limit (line 65) | pub fn reconstruct_limit(&self) -> usize {
    method share (line 70) | pub fn share(&self, secret: i64) -> Vec<i64> {
    method reconstruct (line 80) | pub fn reconstruct(&self, indices: &[usize], shares: &[i64]) -> i64 {
    method sample_polynomial (line 88) | fn sample_polynomial(&self, zero_value: i64) -> Vec<i64> {
    method evaluate_polynomial (line 102) | fn evaluate_polynomial(&self, coefficients: &[i64]) -> Vec<i64> {
  function test_evaluate_polynomial (line 112) | fn test_evaluate_polynomial() {
  function wikipedia_example (line 121) | fn wikipedia_example() {
  function test_shamir (line 137) | fn test_shamir() {