Home
last modified time | relevance | path

Searched refs:Ns (Results 176 – 200 of 5568) sorted by relevance

12345678910>>...223

/dports/biology/primer3/primer3-2.3.6/test/
H A Dprimer_internal1_output29 PRIMER_LEFT_EXPLAIN=considered 35, too many Ns 33, ok 2
30 PRIMER_RIGHT_EXPLAIN=considered 35, too many Ns 33, ok 2
69 PRIMER_LEFT_EXPLAIN=considered 30, too many Ns 28, ok 2
70 PRIMER_RIGHT_EXPLAIN=considered 30, too many Ns 29, ok 1
109 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
110 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
152 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
153 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 3, ok 2
192 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
206 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
[all …]
H A Dprimer_internal_output28 PRIMER_LEFT_EXPLAIN=considered 35, too many Ns 33, ok 2
29 PRIMER_RIGHT_EXPLAIN=considered 35, too many Ns 33, ok 2
68 PRIMER_LEFT_EXPLAIN=considered 30, too many Ns 28, ok 2
69 PRIMER_RIGHT_EXPLAIN=considered 30, too many Ns 29, ok 1
108 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
109 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
151 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
152 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 3, ok 2
191 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
205 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
[all …]
/dports/graphics/nanort/nanort-b1feea8/examples/common/
H A Dcornellbox_suzanne_lucy.mtl5 Ns 0.000000
14 Ns 0.000000
24 Ns 0.000000
33 Ns 0.000000
42 Ns 96.078431
52 Ns 0.000000
61 Ns 0.000000
70 Ns 0.000000
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkmstd/
H A Dinteger_sequence.h38 template <typename T, T... Ns>
43 static constexpr std::size_t size() noexcept { return sizeof...(Ns); } in size()
46 template <std::size_t... Ns>
47 using index_sequence = integer_sequence<std::size_t, Ns...>;
75 template <typename T, T... Ns>
76 struct DoubleSequence<vtkmstd::integer_sequence<T, Ns...>>
78 using type = vtkmstd::integer_sequence<T, Ns..., T(sizeof...(Ns)) + Ns...>;
93 template <typename T, SeqSizeT Num, T... Ns>
94 struct ExpandSequence<true, Num, vtkmstd::integer_sequence<T, Ns...>>
96 static constexpr SeqSizeT OldSize = sizeof...(Ns);
[all …]
/dports/x11-wm/fvwm2/fvwm-2.6.9/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()
257 fvwm_send(Ns, C_END, strlen(C_END), 0); in server()
263 fvwm_send(Ns, ver, strlen(ver), 0); in server()
268 FD_SET(Ns, &fdset); in server()
[all …]
/dports/math/g2o/g2o-20201223_git/EXTERNAL/ceres/
H A Dinteger_sequence.h46 template <typename T, T... Ns>
47 using integer_sequence = std::integer_sequence<T, Ns...>;
59 template <typename T, T... Ns>
82 template <typename T, T CurIdx, T Total, T... Ns>
84 using type = typename make_integer_sequence_impl<T, CurIdx + 1, Total, Ns...,
90 template <typename T, T Total, T... Ns>
91 struct make_integer_sequence_impl<T, Total, Total, Ns...> {
92 using type = integer_sequence<T, Ns...>;
/dports/devel/vc/Vc-1.4.2/Vc/common/
H A Dindexsequence.h49 template <std::size_t Offset, std::size_t... Ns>
50 static index_sequence<Ns..., (Ns + Offset)...> join(std::false_type,
51 index_sequence<Ns...>);
52 template <std::size_t Offset, std::size_t... Ns>
53 static index_sequence<Ns..., Offset - 1, (Ns + Offset)...> join(
54 std::true_type, index_sequence<Ns...>);
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/taotuple/vtkmtaotuple/include/tao/seq/
H A Dexclusive_scan.hpp29 template< typename T, T... Ns >
31 : impl::exclusive_scan< integer_sequence< T, Ns... > >
35 template< typename T, T... Ns >
36 struct exclusive_scan< integer_sequence< T, Ns... > >
37 : impl::exclusive_scan< integer_sequence< T, Ns... > >
41 template< typename T, T... Ns >
42 using exclusive_scan_t = typename exclusive_scan< T, Ns... >::type;
/dports/games/traingame/traingame-cb6513e/engines/red/
H A Dtrain.mtl3 Ns 100.0
12 Ns 100.0
21 Ns 100.0
30 Ns 100.0
39 Ns 100.0
48 Ns 100.0
57 Ns 100.0
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/miekg/dns/
H A Dupdate.go63 u.Ns = make([]RR, len(rr))
65 u.Ns[i] = r
66 u.Ns[i].Header().Class = u.Question[0].Qclass
72 u.Ns = make([]RR, len(rr))
74 …u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: r.Header().Rrtype, Class: Cla…
80 u.Ns = make([]RR, len(rr))
82 u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: ClassANY}}
88 u.Ns = make([]RR, len(rr))
90 u.Ns[i] = r
91 u.Ns[i].Header().Class = ClassNONE
[all …]
/dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/docker/libnetwork/vendor/github.com/miekg/dns/
H A Dupdate.go63 u.Ns = make([]RR, len(rr))
65 u.Ns[i] = r
66 u.Ns[i].Header().Class = u.Question[0].Qclass
72 u.Ns = make([]RR, len(rr))
74 …u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: r.Header().Rrtype, Class: Cla…
80 u.Ns = make([]RR, len(rr))
82 u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: ClassANY}}
88 u.Ns = make([]RR, len(rr))
90 u.Ns[i] = r
91 u.Ns[i].Header().Class = ClassNONE
[all …]
/dports/security/vault/vault-1.8.2/vendor/github.com/docker/docker/vendor/github.com/miekg/dns/
H A Dupdate.go63 u.Ns = make([]RR, len(rr))
65 u.Ns[i] = r
66 u.Ns[i].Header().Class = u.Question[0].Qclass
72 u.Ns = make([]RR, len(rr))
74 …u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: r.Header().Rrtype, Class: Cla…
80 u.Ns = make([]RR, len(rr))
82 u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: ClassANY}}
88 u.Ns = make([]RR, len(rr))
90 u.Ns[i] = r
91 u.Ns[i].Header().Class = ClassNONE
[all …]
/dports/sysutils/helm/helm-3.5.2/vendor/github.com/docker/docker/vendor/github.com/miekg/dns/
H A Dupdate.go63 u.Ns = make([]RR, len(rr))
65 u.Ns[i] = r
66 u.Ns[i].Header().Class = u.Question[0].Qclass
72 u.Ns = make([]RR, len(rr))
74 …u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: r.Header().Rrtype, Class: Cla…
80 u.Ns = make([]RR, len(rr))
82 u.Ns[i] = &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: ClassANY}}
88 u.Ns = make([]RR, len(rr))
90 u.Ns[i] = r
91 u.Ns[i].Header().Class = ClassNONE
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/elmerice/UserFunctions/
H A DBuoyancy.F90218 IF(ALLOCATED(S)) DEALLOCATE(S,Ns)
301 Ns = 0.0_dp
341 Ns(i) = Ns(i) + (Normal(2,i)/Normal(3,i))**2.0_dp
343 Ns(i) = SQRT(Ns(i))
345 Ns(i) = -999.0
491 ALLOCATE( Ns( NumberOfNodesOnBoundary ))
495 Ns = 0.0_dp
525 Ns(i) = Ns(i) + (Normal(2,i)/Normal(3,i))**2.0_dp
527 Ns(i) = SQRT(Ns(i))
529 Ns(i) = -999.0
[all …]
/dports/cad/sumo/sumo-1.2.0/data/3D/
H A Dcar-microcargo-citrus.mtl5 Ns 96.078431
14 Ns 96.078431
23 Ns 96.078431
32 Ns 96.078431
41 Ns 96.078431
50 Ns 96.078431
59 Ns 96.078431
H A Dcar-minibus-citrus.mtl5 Ns 96.078431
14 Ns 96.078431
23 Ns 96.078431
32 Ns 96.078431
41 Ns 96.078431
50 Ns 96.078431
59 Ns 96.078431
H A Dcar-normal-citrus.mtl5 Ns 96.078431
14 Ns 96.078431
23 Ns 96.078431
32 Ns 96.078431
41 Ns 96.078431
50 Ns 96.078431
59 Ns 96.078431
/dports/audio/ardour6/Ardour-6.8.0/libs/canvas/test/
H A Dgtk_many.cc20 double Ns = sqrt (N); in main() local
24 for (int x = 0; x < Ns; ++x) { in main()
25 for (int y = 0; y < Ns; ++y) { in main()
27 r->set (Rect (x * max_x / Ns, y * max_y / Ns, (x + 1) * max_x / Ns, (y + 1) * max_y / Ns)); in main()
/dports/math/casadi/casadi-3.5.5/test/python/
H A Dcomplexity.py44 def checkOrders(self,Ns,ts): argument
59 Ns = log(Ns)
62 m = Ns.shape[0]
64 sigmaN = std(Ns)
68 cov = mean(ts*Ns)-mean(ts)*mean(Ns)
71 rho = (mean(ts*Ns)-mean(ts)*mean(Ns))/sigmaN/sigmaT
79 a = mean(ts) - b * mean(Ns)
105 a = mean(ts - order*Ns)
123 Ns = []
135 Ns.append(N)
[all …]
/dports/science/R-cran-Epi/Epi/vignettes/
H A Dflup.R194 ma <- glm( (lex.Xst=="Dead") ~ Ns(age,knots=a.kn),
213 formula = ~ Ns(age,knots=a.kn) )
269 form = ~ Ns(age,knots=a.kn)
270 + Ns(tfI,knots=i.kn)
305 Ns(tfI,knots=i.kn) + lex.Cst + sex,
421 formula = ~ Ns(age,knots=a.kn)
422 + Ns(tfI,knots=i.kn)
423 + lex.Cst:Ns(age,knots=a.kn):Ns(tfI,knots=i.kn)
455 formula = ~ Ns(age,knots=a.kn)
459 formula = ~ Ns(age,knots=a.kn)
[all …]
/dports/science/R-cran-Epi/Epi/inst/doc/
H A Dflup.R194 ma <- glm( (lex.Xst=="Dead") ~ Ns(age,knots=a.kn),
213 formula = ~ Ns(age,knots=a.kn) )
269 form = ~ Ns(age,knots=a.kn)
270 + Ns(tfI,knots=i.kn)
305 Ns(tfI,knots=i.kn) + lex.Cst + sex,
421 formula = ~ Ns(age,knots=a.kn)
422 + Ns(tfI,knots=i.kn)
423 + lex.Cst:Ns(age,knots=a.kn):Ns(tfI,knots=i.kn)
455 formula = ~ Ns(age,knots=a.kn)
459 formula = ~ Ns(age,knots=a.kn)
[all …]
/dports/audio/codec2/codec2-1.0.3/octave/
H A Dmag_to_phase.m14 Ns = length(Gdbfk); if Ns~=Nfft/2+1, error("confusion"); end variable
15 Sdb = [Gdbfk,Gdbfk(Ns-1:-1:2)]; % install negative-frequencies
20 tlerr = 100*norm(s(round(0.9*Ns:1.1*Ns)))/norm(s);
37 caliaserr = 100*norm(c(round(Ns*0.9:Ns*1.1)))/norm(c);
51 cf = [c(1), c(2:Ns-1)+c(Nfft:-1:Ns+1), c(Ns), zeros(1,Nfft-Ns)];
/dports/shells/elvish/elvish-0.17.0/pkg/mods/
H A Dmods.go18 ev.AddModule("math", math.Ns)
19 ev.AddModule("path", path.Ns)
20 ev.AddModule("platform", platform.Ns)
21 ev.AddModule("re", re.Ns)
22 ev.AddModule("str", str.Ns)
23 ev.AddModule("file", file.Ns)
/dports/audio/drumgizmo/drumgizmo-0.9.19/src/
H A Dnotifier.h55 template<int... Ns>
60 template<int N, int... Ns>
62 : gen_int_sequence<N-1, N-1, Ns...>
66 template<int... Ns>
67 struct gen_int_sequence<0, Ns...>
68 : int_sequence<Ns...>
159 template<typename F, typename O, int... Ns>
160 callback_type construct_mem_fn(const F& fn, O* p, aux::int_sequence<Ns...>) const
162 return std::bind(fn, p, aux::placeholder<Ns>{}...);
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/kernel/test/
H A Dpg2_SUITE.erl366 [] = Ns,
373 doit(N, C, Ps, Ns) ->
379 sane(Ns);
386 new_proc(N, P, Ps, Ns) ->
392 killit(N, P, Ps, Ns) ->
398 sane(Ns),
405 get_node(N, Ns) ->
429 sane(Ns) ->
445 wsane(Ns) ->
467 end || N <- Ns]
[all …]

12345678910>>...223