Home
last modified time | relevance | path

Searched refs:Ns (Results 151 – 175 of 5568) sorted by relevance

12345678910>>...223

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/unittests/ADT/
H A DSimpleIListTest.cpp421 Node Ns[10]; in TEST() local
451 for (Node &N : Ns) in TEST()
459 Node Ns[5]; in TEST() local
514 Node Ns[4]; in TEST() local
535 for (Node &N : Ns) in TEST()
550 Node Ns[10]; in TEST() local
554 L.push_back(Ns[I]); in TEST()
564 for (Node &N : Ns) in TEST()
571 Node Ns[10]; in TEST() local
581 L.push_back(Ns[I]); in TEST()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/unittests/ADT/
H A DSimpleIListTest.cpp421 Node Ns[10]; in TEST() local
451 for (Node &N : Ns) in TEST()
459 Node Ns[5]; in TEST() local
514 Node Ns[4]; in TEST() local
535 for (Node &N : Ns) in TEST()
550 Node Ns[10]; in TEST() local
554 L.push_back(Ns[I]); in TEST()
564 for (Node &N : Ns) in TEST()
571 Node Ns[10]; in TEST() local
581 L.push_back(Ns[I]); in TEST()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/unittests/ADT/
H A DSimpleIListTest.cpp420 Node Ns[10]; in TEST() local
450 for (Node &N : Ns) in TEST()
458 Node Ns[5]; in TEST() local
513 Node Ns[4]; in TEST() local
534 for (Node &N : Ns) in TEST()
549 Node Ns[10]; in TEST() local
553 L.push_back(Ns[I]); in TEST()
563 for (Node &N : Ns) in TEST()
570 Node Ns[10]; in TEST() local
580 L.push_back(Ns[I]); in TEST()
[all …]
/dports/graphics/blender/blender-2.91.0/extern/ceres/include/ceres/internal/
H A Dparameter_dims.h66 template <bool IsDynamic, int... Ns>
69 using Parameters = std::integer_sequence<int, Ns...>;
80 static constexpr int kNumParameterBlocks = sizeof...(Ns);
85 Sum<std::integer_sequence<int, Ns...>>::Value;
105 static constexpr std::array<int, kNumParameterBlocks> params_{Ns...};
111 template <bool IsDynamic, int... Ns>
112 constexpr std::array<int, ParameterDims<IsDynamic, Ns...>::kNumParameterBlocks>
113 ParameterDims<IsDynamic, Ns...>::params_;
117 template <int... Ns>
118 using StaticParameterDims = ParameterDims<false, Ns...>;
H A Dinteger_sequence_algorithm.h63 template <typename T, T N, T... Ns>
64 struct SumImpl<std::integer_sequence<T, N, Ns...>> {
69 template <typename T, T N1, T N2, T... Ns>
70 struct SumImpl<std::integer_sequence<T, N1, N2, Ns...>> {
72 N1 + N2 + SumImpl<std::integer_sequence<T, Ns...>>::Value;
76 template <typename T, T N1, T N2, T N3, T N4, T... Ns>
77 struct SumImpl<std::integer_sequence<T, N1, N2, N3, N4, Ns...>> {
79 N1 + N2 + N3 + N4 + SumImpl<std::integer_sequence<T, Ns...>>::Value;
131 template <typename T, T Sum, T N, T... Ns, T... Rs>
132 struct ExclusiveScanImpl<T, Sum, std::integer_sequence<T, N, Ns...>,
[all …]
/dports/math/ceres-solver/ceres-solver-2.0.0/include/ceres/internal/
H A Dparameter_dims.h66 template <bool IsDynamic, int... Ns>
69 using Parameters = std::integer_sequence<int, Ns...>;
80 static constexpr int kNumParameterBlocks = sizeof...(Ns);
85 Sum<std::integer_sequence<int, Ns...>>::Value;
105 static constexpr std::array<int, kNumParameterBlocks> params_{Ns...};
111 template <bool IsDynamic, int... Ns>
112 constexpr std::array<int, ParameterDims<IsDynamic, Ns...>::kNumParameterBlocks>
113 ParameterDims<IsDynamic, Ns...>::params_;
117 template <int... Ns>
118 using StaticParameterDims = ParameterDims<false, Ns...>;
H A Dinteger_sequence_algorithm.h63 template <typename T, T N, T... Ns>
64 struct SumImpl<std::integer_sequence<T, N, Ns...>> {
66 N + SumImpl<std::integer_sequence<T, Ns...>>::Value;
70 template <typename T, T N1, T N2, T... Ns>
71 struct SumImpl<std::integer_sequence<T, N1, N2, Ns...>> {
73 N1 + N2 + SumImpl<std::integer_sequence<T, Ns...>>::Value;
77 template <typename T, T N1, T N2, T N3, T N4, T... Ns>
78 struct SumImpl<std::integer_sequence<T, N1, N2, N3, N4, Ns...>> {
132 template <typename T, T Sum, T N, T... Ns, T... Rs>
135 std::integer_sequence<T, N, Ns...>,
[all …]
/dports/cad/ngspice_rework/ngspice-35/examples/TransmissionLines/
H A Dltra1_4_line.sp123 vdd 1 0 PULSE (0 5 0Ns 0.1Ns 0.1Ns 600Ns 800Ns)
124 v3 3 0 PULSE (0 5 0Ns 0.1Ns 0.1Ns 600Ns 800Ns)
134 VS1 2 0 PULSE (0 5 15.9Ns 0.2Ns 0.2Ns 15.8Ns 32Ns)
135 VS2 4 0 PULSE (0 5 15.9Ns 0.2Ns 0.2Ns 15.8Ns 32Ns)
/dports/science/chrono/chrono-7.0.1/data/vehicle/uaz/
H A Duaz469_chassis.mtl5 Ns 96.078443
15 Ns 96.078443
25 Ns 96.078443
35 Ns 96.078443
45 Ns 96.078443
55 Ns 96.078443
65 Ns 96.078443
75 Ns 96.078443
85 Ns 56.250000
/dports/science/chrono/chrono-7.0.1/data/vehicle/MAN_Kat1/meshes/
H A DMAN_10t_chassis.mtl5 Ns 94.117647
15 Ns 94.117647
25 Ns 94.117647
35 Ns 94.117647
45 Ns 94.117647
55 Ns 94.117647
65 Ns 94.117647
75 Ns 94.117647
85 Ns 94.117647
H A DMAN_5t_chassis.mtl5 Ns 94.117647
15 Ns 94.117647
25 Ns 94.117647
35 Ns 94.117647
45 Ns 94.117647
55 Ns 94.117647
65 Ns 94.117647
75 Ns 94.117647
85 Ns 94.117647
H A DMAN_7t_chassis.mtl5 Ns 94.117647
15 Ns 94.117647
25 Ns 94.117647
35 Ns 94.117647
45 Ns 94.117647
55 Ns 94.117647
65 Ns 94.117647
75 Ns 94.117647
85 Ns 94.117647
/dports/www/firefox-legacy/firefox-52.8.0esr/security/sandbox/chromium/base/
H A Dtuple.h45 template <size_t... Ns>
98 template <size_t... Ns>
99 struct MakeIndexSequenceImpl<0, Ns...> {
100 using Type = IndexSequence<Ns...>;
103 template <size_t N, size_t... Ns>
104 struct MakeIndexSequenceImpl<N, Ns...>
105 : MakeIndexSequenceImpl<N - 1, N - 1, Ns...> {};
166 template <size_t... Ns, typename... Ts>
167 struct TupleBaseImpl<IndexSequence<Ns...>, Ts...> : TupleLeaf<Ns, Ts>... {
168 TupleBaseImpl() : TupleLeaf<Ns, Ts>()... {}
[all …]
/dports/math/g2o/g2o-20201223_git/EXTERNAL/ceres/
H A Dinteger_sequence_algorithm.h63 template <typename T, T N, T... Ns>
64 struct SumImpl<integer_sequence<T, N, Ns...>> {
69 template <typename T, T N1, T N2, T... Ns>
70 struct SumImpl<integer_sequence<T, N1, N2, Ns...>> {
72 N1 + N2 + SumImpl<integer_sequence<T, Ns...>>::Value;
76 template <typename T, T N1, T N2, T N3, T N4, T... Ns>
77 struct SumImpl<integer_sequence<T, N1, N2, N3, N4, Ns...>> {
79 N1 + N2 + N3 + N4 + SumImpl<integer_sequence<T, Ns...>>::Value;
131 template <typename T, T Sum, T N, T... Ns, T... Rs>
132 struct ExclusiveScanImpl<T, Sum, integer_sequence<T, N, Ns...>,
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/signal/
H A Dfirfilter.c130 if (outsize == FULL) {Os[0] = Ns[0]+Nwin[0]-1; Os[1] = Ns[1]+Nwin[1]-1;} in pylab_convolve_2d()
131 else if (outsize == SAME) {Os[0] = Ns[0]; Os[1] = Ns[1];} in pylab_convolve_2d()
132 else if (outsize == VALID) {Os[0] = Ns[0]-Nwin[0]+1; Os[1] = Ns[1]-Nwin[1]+1;} in pylab_convolve_2d()
168 else if (boundary == CIRCULAR) ind0 = Ns[0] + ind0; in pylab_convolve_2d()
171 else if (ind0 >= Ns[0]) { in pylab_convolve_2d()
172 if (boundary == REFLECT) ind0 = Ns[0]+Ns[0]-1-ind0; in pylab_convolve_2d()
173 else if (boundary == CIRCULAR) ind0 = ind0 - Ns[0]; in pylab_convolve_2d()
189 else if (boundary == CIRCULAR) ind1 = Ns[1] + ind1; in pylab_convolve_2d()
192 else if (ind1 >= Ns[1]) { in pylab_convolve_2d()
193 if (boundary == REFLECT) ind1 = Ns[1]+Ns[1]-1-ind1; in pylab_convolve_2d()
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/taotuple/vtkmtaotuple/include/tao/seq/
H A Dpartial_sum.hpp22 template< std::size_t I, typename T, T... Ns, std::size_t... Is >
23 struct partial_sum< I, integer_sequence< T, Ns... >, index_sequence< Is... > >
24 : seq::sum< T, ( ( Is < I ) ? Ns : 0 )... >
31 template< std::size_t I, typename T, T... Ns >
33 : impl::partial_sum< I, integer_sequence< T, Ns... > >
37 template< std::size_t I, typename T, T... Ns >
38 struct partial_sum< I, integer_sequence< T, Ns... > >
39 : impl::partial_sum< I, integer_sequence< T, Ns... > >
H A Dmake_integer_sequence.hpp38 template< typename T, T M, T N, std::size_t S, T... Ns >
39 using f = integer_sequence< T, Ns... >;
45 template< typename T, T M, T N, std::size_t S, T... Ns >
46 using f = integer_sequence< T, Ns..., S >;
53 template< typename T, T M, T N, std::size_t S, T... Ns >
54 …< ( N & ( M / 2 ) ) != 0, ( M / 2 ) == 0 >::template f< T, M / 2, N, 2 * S, Ns..., ( Ns + S )... >;
60 template< typename T, T M, T N, std::size_t S, T... Ns >
61 … M / 2 ) ) != 0, ( M / 2 ) == 0 >::template f< T, M / 2, N, 2 * S + 1, Ns..., ( Ns + S )..., 2 * S…
/dports/x11-wm/fvwm3/fvwm3-1.0.4/modules/FvwmConsole/
H A DFvwmConsole.c37 int Ns = -1; /* socket handles */ variable
48 if (Ns != -1) in clean_up()
50 close(Ns); in clean_up()
51 Ns = -1; in clean_up()
239 if (Ns < 0) in server()
246 fvwm_send(Ns, C_BEG, strlen(C_BEG), 0); in server()
253 fvwm_send(Ns, "\n", 1, 0); in server()
260 fvwm_send(Ns, ver, strlen(ver), 0); in server()
261 fvwm_send(Ns, "\n\n", 2, 0); in server()
266 FD_SET(Ns, &fdset); in server()
[all …]
/dports/science/tfel/tfel-3.4.0/docs/gallery/behaviours/plasticity/
H A DIwan.mfront22 @IntegerConstant Ns = 12 ;
27 @StateVariable real p[Ns];
30 @AuxiliaryStateVariable Stensor X[Ns];
34 @LocalVariable stress Y[Ns];
36 @LocalVariable stress C[Ns];
38 @LocalVariable Stensor n[Ns];
40 @LocalVariable bool status[Ns];
52 real ltau[Ns+1]; // tau
60 for(unsigned short i=0;i!=Ns;++i){
69 for(unsigned short i=0;i!=Ns;++i){
[all …]
/dports/science/tfel-edf/tfel-3.2.1/docs/gallery/behaviours/plasticity/
H A DIwan.mfront22 @IntegerConstant Ns = 12 ;
27 @StateVariable real p[Ns];
30 @AuxiliaryStateVariable Stensor X[Ns];
34 @LocalVariable stress Y[Ns];
36 @LocalVariable stress C[Ns];
38 @LocalVariable Stensor n[Ns];
40 @LocalVariable bool status[Ns];
52 real ltau[Ns+1]; // tau
60 for(unsigned short i=0;i!=Ns;++i){
69 for(unsigned short i=0;i!=Ns;++i){
[all …]

12345678910>>...223