Home
last modified time | relevance | path

Searched refs:Ns2 (Results 1 – 25 of 95) sorted by relevance

1234

/dports/security/tfhe/tfhe-1.0.1-30-ga085efe/src/libtfhe/fft_processors/fftw/
H A Dlagrangehalfc_impl.cpp46 const int32_t Ns2 = reps1->proc->Ns2; in LagrangeHalfCPolynomialClear() local
47 for (int32_t i=0; i<Ns2; i++) in LagrangeHalfCPolynomialClear()
53 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetTorusConstant() local
56 for (int32_t j=0; j<Ns2; j++) in LagrangeHalfCPolynomialSetTorusConstant()
62 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddTorusConstant() local
65 for (int32_t j=0; j<Ns2; j++) in LagrangeHalfCPolynomialAddTorusConstant()
71 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetXaiMinusOne() local
84 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialMul() local
99 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddMul() local
115 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSubMul() local
[all …]
H A Dfft_processor_fftw.cpp10 FFT_Processor_fftw::FFT_Processor_fftw(const int32_t N): _2N(2*N),N(N),Ns2(N/2) { in FFT_Processor_fftw()
36 for (int32_t i=0; i<Ns2; i++) res[i]=rev_out_cplx[2*i+1]; in execute_reverse_int()
37 for (int32_t i=0; i<=Ns2; i++) assert(abs(rev_out_cplx[2*i])<1e-20); in execute_reverse_int()
46 for (int32_t i=0; i<Ns2; i++) res[i]=rev_out_cplx[2*i+1]; in execute_reverse_torus32()
47 for (int32_t i=0; i<=Ns2; i++) assert(abs(rev_out_cplx[2*i])<1e-20); in execute_reverse_torus32()
53 for (int32_t i=0; i<=Ns2; i++) in_cplx[2*i]=0; in execute_direct_Torus32()
54 for (int32_t i=0; i<Ns2; i++) in_cplx[2*i+1]=a[i]; in execute_direct_Torus32()
/dports/security/tfhe/tfhe-1.0.1-30-ga085efe/src/libtfhe/fft_processors/nayuki/
H A Dlagrangehalfc_impl.cpp44 const int32_t Ns2 = reps1->proc->Ns2; in LagrangeHalfCPolynomialClear() local
45 for (int32_t i=0; i<Ns2; i++) in LagrangeHalfCPolynomialClear()
51 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetTorusConstant() local
54 for (int32_t j=0; j<Ns2; j++) in LagrangeHalfCPolynomialSetTorusConstant()
60 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddTorusConstant() local
63 for (int32_t j=0; j<Ns2; j++) in LagrangeHalfCPolynomialAddTorusConstant()
69 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetXaiMinusOne() local
82 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialMul() local
97 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddMul() local
113 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSubMul() local
[all …]
H A Dfft_processor_nayuki.cpp8 FFT_Processor_nayuki::FFT_Processor_nayuki(const int32_t N): _2N(2*N),N(N),Ns2(N/2) { in FFT_Processor_nayuki()
45 for (int32_t i=0; i<Ns2; i++) { in execute_reverse_int()
59 for (int32_t i=0; i<Ns2; i++) res[i]=cplx(real_inout[2*i+1],imag_inout[2*i+1]); in execute_reverse_torus32()
69 for (int32_t i=0; i<Ns2; i++) real_inout[2*i+1]=real(a[i]); in execute_direct_torus32()
70 for (int32_t i=0; i<Ns2; i++) imag_inout[2*i+1]=imag(a[i]); in execute_direct_torus32()
71 for (int32_t i=0; i<Ns2; i++) real_inout[_2N-1-2*i]=real(a[i]); in execute_direct_torus32()
72 for (int32_t i=0; i<Ns2; i++) imag_inout[_2N-1-2*i]=-imag(a[i]); in execute_direct_torus32()
76 for (int32_t i=0; i<Ns2; i++) assert(real_inout[2*i+1]==real(a[i])); in execute_direct_torus32()
77 for (int32_t i=0; i<Ns2; i++) assert(imag_inout[2*i+1]==imag(a[i])); in execute_direct_torus32()
78 for (int32_t i=0; i<Ns2; i++) assert(real_inout[_2N-1-2*i]==real(a[i])); in execute_direct_torus32()
[all …]
/dports/security/tfhe/tfhe-1.0.1-30-ga085efe/src/libtfhe/fft_processors/spqlios/
H A Dlagrangehalfc_impl.cpp73 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetTorusConstant() local
75 double *c = b + Ns2; in LagrangeHalfCPolynomialSetTorusConstant()
86 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetTorusConstant() local
88 double* c = b+Ns2; in LagrangeHalfCPolynomialSetTorusConstant()
89 double* d = c+Ns2; in LagrangeHalfCPolynomialSetTorusConstant()
116 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddTorusConstant() local
124 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialAddTorusConstant() local
126 double* c = b+Ns2; in LagrangeHalfCPolynomialAddTorusConstant()
149 const int32_t Ns2 = result1->proc->Ns2; in LagrangeHalfCPolynomialSetXaiMinusOne() local
155 double *c = b + Ns2; in LagrangeHalfCPolynomialSetXaiMinusOne()
[all …]
H A Dfft_processor_spqlios.cpp17 FFT_Processor_Spqlios::FFT_Processor_Spqlios(const int32_t N) : _2N(2 * N), N(N), Ns2(N / 2) { in FFT_Processor_Spqlios()
21 imag_inout_direct = real_inout_direct + Ns2; in FFT_Processor_Spqlios()
23 imag_inout_rev = real_inout_rev + Ns2; in FFT_Processor_Spqlios()
24 reva = new int32_t[Ns2]; in FFT_Processor_Spqlios()
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/devel/boost-docs/boost_1_72_0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/devel/boost-python-libs/boost_1_72_0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/devel/boost-libs/boost_1_72_0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/devel/hyperscan/boost_1_75_0/boost/test/data/
H A Dindex_sequence.hpp36 template <std::size_t... Ns1, std::size_t... Ns2>
37 struct merge_index_sequence<index_sequence<Ns1...>, index_sequence<Ns2...>> {
38 typedef index_sequence<Ns1..., Ns2...> type;
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm12/llvm-project-12.0.1.src/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm11/llvm-11.0.1.src/tools/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm90/llvm-9.0.1.src/tools/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/test/SemaCXX/
H A Dqualified-id-lookup.cpp15 namespace Ns2 { namespace
21 namespace Ns2 { namespace
25 namespace Ns2 { namespace

1234