From f95c843fc2b78fa1a4f8c4f4f6d7ab9d8ce38bee Mon Sep 17 00:00:00 2001 From: J-B Orfila Date: Wed, 8 Mar 2023 18:45:43 +0100 Subject: [PATCH] doc(fft): readme updates --- README.md | 6 +++--- benches/fft.rs | 12 ++++++------ 2 files changed, 9 insertions(+), 9 deletions(-) diff --git a/README.md b/README.md index 4b32456..f5d5e22 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ Concrete-FFT is a pure Rust high performance fast Fourier transform library that processes vectors of sizes that are powers of two. It was made to be used -as a backend in Zama's `concrete` library. +as a backend in Zama's [TFHE-rs](https://docs.zama.ai/tfhe-rs) library. This library provides two FFT modules: - The ordered module FFT applies a forward/inverse FFT that takes its input in standard @@ -66,7 +66,7 @@ for (actual, expected) in transformed_inv.iter().map(|z| z / N as f64).zip(data) ## Links - [Zama](https://www.zama.ai/) - - [Concrete](https://github.com/zama-ai/concrete) + - [TFHE-rs Sources](https://github.com/zama-ai/tfhe-rs) ## License @@ -74,7 +74,7 @@ This software is distributed under the BSD-3-Clause-Clear license with an exemption that gives rights to use our patents for research, evaluation and prototyping purposes, as well as for your personal projects. -If you want to use Concrete in a commercial product however, you will need to +If you want to use concrete-fft in a commercial product however, you will need to purchase a separate commercial licence. If you have any questions, please contact us at `hello@zama.ai.` diff --git a/benches/fft.rs b/benches/fft.rs index 341925e..b2f43d5 100644 --- a/benches/fft.rs +++ b/benches/fft.rs @@ -120,13 +120,13 @@ pub fn criterion_benchmark(c: &mut Criterion) { let (mut dst, stack) = stack.rb_mut().make_aligned_with::(n, 64, |_| z); let (mut src, mut stack) = stack.make_aligned_with::(n, 64, |_| z); - c.bench_function(&format!("rustfft-fwd-{}", n), |b| { + c.bench_function(&format!("rustfft-fwd-{n}"), |b| { let mut planner = FftPlannerAvx::::new().unwrap(); let fwd_rustfft = planner.plan_fft_forward(n); b.iter(|| fwd_rustfft.process_outofplace_with_scratch(&mut src, &mut dst, &mut scratch)) }); - c.bench_function(&format!("fftw-fwd-{}", n), |b| { + c.bench_function(&format!("fftw-fwd-{n}"), |b| { let fwd_fftw = PlanInterleavedC64::new(n, Sign::Forward); b.iter(|| { fwd_fftw.execute(&mut src, &mut dst); @@ -138,19 +138,19 @@ pub fn criterion_benchmark(c: &mut Criterion) { concrete_fft::ordered::Method::Measure(bench_duration), ); - c.bench_function(&format!("concrete-fwd-{}", n), |b| { + c.bench_function(&format!("concrete-fwd-{n}"), |b| { b.iter(|| ordered.fwd(&mut dst, stack.rb_mut())) }); } - c.bench_function(&format!("unordered-fwd-{}", n), |b| { + c.bench_function(&format!("unordered-fwd-{n}"), |b| { b.iter(|| unordered.fwd(&mut dst, stack.rb_mut())); }); - c.bench_function(&format!("unordered-inv-{}", n), |b| { + c.bench_function(&format!("unordered-inv-{n}"), |b| { b.iter(|| unordered.inv(&mut dst, stack.rb_mut())); }); // memcpy - c.bench_function(&format!("memcpy-{}", n), |b| { + c.bench_function(&format!("memcpy-{n}"), |b| { b.iter(|| unsafe { std::ptr::copy_nonoverlapping(src.as_ptr(), dst.as_mut_ptr(), n); })