Home
last modified time | relevance | path

Searched refs:Ns (Results 126 – 150 of 5568) sorted by relevance

12345678910>>...223

/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/hashicorp/consul/vendor/github.com/miekg/dns/
H A Dupdate.go67 if u.Ns == nil {
68 u.Ns = make([]RR, 0, len(rr))
72 u.Ns = append(u.Ns, r)
78 if u.Ns == nil {
79 u.Ns = make([]RR, 0, len(rr))
88 if u.Ns == nil {
89 u.Ns = make([]RR, 0, len(rr))
92 …u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: Cla…
98 if u.Ns == nil {
99 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/prometheus/prometheus/vendor/github.com/miekg/dns/
H A Dupdate.go67 if u.Ns == nil {
68 u.Ns = make([]RR, 0, len(rr))
72 u.Ns = append(u.Ns, r)
78 if u.Ns == nil {
79 u.Ns = make([]RR, 0, len(rr))
88 if u.Ns == nil {
89 u.Ns = make([]RR, 0, len(rr))
92 …u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: Cla…
98 if u.Ns == nil {
99 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/sysutils/serf/serf-0.8.5/vendor/github.com/miekg/dns/
H A Dupdate.go67 if u.Ns == nil {
68 u.Ns = make([]RR, 0, len(rr))
72 u.Ns = append(u.Ns, r)
78 if u.Ns == nil {
79 u.Ns = make([]RR, 0, len(rr))
88 if u.Ns == nil {
89 u.Ns = make([]RR, 0, len(rr))
92 …u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: Cla…
98 if u.Ns == nil {
99 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/miekg/dns/
H A Dupdate.go67 if u.Ns == nil {
68 u.Ns = make([]RR, 0, len(rr))
72 u.Ns = append(u.Ns, r)
78 if u.Ns == nil {
79 u.Ns = make([]RR, 0, len(rr))
88 if u.Ns == nil {
89 u.Ns = make([]RR, 0, len(rr))
92 …u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: r.Header().Name, Ttl: 0, Rrtype: TypeANY, Class: Cla…
98 if u.Ns == nil {
99 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/taotuple/vtkmtaotuple/include/tao/seq/
H A Dinclusive_scan.hpp17 template< typename T, T... Ns >
19 : plus< exclusive_scan_t< T, Ns... >, integer_sequence< T, Ns... > >
23 template< typename T, T... Ns >
24 struct inclusive_scan< integer_sequence< T, Ns... > >
25 : plus< exclusive_scan_t< integer_sequence< T, Ns... > >, integer_sequence< T, Ns... > >
29 template< typename T, T... Ns >
30 using inclusive_scan_t = typename inclusive_scan< T, Ns... >::type;
/dports/games/traingame/traingame-cb6513e/engines/saddle/
H A Dsaddle.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
66 Ns 100.0
75 Ns 100.0
84 Ns 100.0
[all …]
/dports/games/traingame/traingame-cb6513e/engines/tank/
H A Dtank.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
66 Ns 100.0
75 Ns 100.0
84 Ns 100.0
[all …]
/dports/www/gitea/gitea-1.16.5/vendor/github.com/miekg/dns/
H A Dupdate.go71 if u.Ns == nil {
72 u.Ns = make([]RR, 0, len(rr))
76 u.Ns = append(u.Ns, r)
82 if u.Ns == nil {
83 u.Ns = make([]RR, 0, len(rr))
87 u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: h.Name, Ttl: 0, Rrtype: h.Rrtype, Class: ClassANY}})
93 if u.Ns == nil {
94 u.Ns = make([]RR, 0, len(rr))
103 if u.Ns == nil {
104 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/net/traefik/traefik-2.6.1/vendor/github.com/miekg/dns/
H A Dupdate.go71 if u.Ns == nil {
72 u.Ns = make([]RR, 0, len(rr))
76 u.Ns = append(u.Ns, r)
82 if u.Ns == nil {
83 u.Ns = make([]RR, 0, len(rr))
87 u.Ns = append(u.Ns, &ANY{Hdr: RR_Header{Name: h.Name, Ttl: 0, Rrtype: h.Rrtype, Class: ClassANY}})
93 if u.Ns == nil {
94 u.Ns = make([]RR, 0, len(rr))
103 if u.Ns == nil {
104 u.Ns = make([]RR, 0, len(rr))
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/elmerice/UserFunctions/
H A DUSF_ShapeFactor.F9096 INTEGER :: Ns, Nb local
169 Ns = 1
181 Ns = Ns + n - 1
192 ALLOCATE ( zs(Ns), ts(2,Ns), xs(Ns), xb(Nb), zb(Nb) )
193 ALLOCATE (z2s(Ns), z2b(Ns), ts2x(Ns), ts2y(Ns) )
194 ALLOCATE ( NodesOnSurface(Ns), NodesOnBed(Nb), TempS(Ns), TempB(Nb) )
195 IF (Computed) ALLOCATE( para(Ns), para2(Ns) )
202 Ns = 0
219 Ns = Ns + 1
242 ALLOCATE (ind(Ns))
[all …]
/dports/science/PETSc/petsc-3.14.1/src/dm/dt/space/impls/tensor/
H A Dspacetensor.c35 if (Ns > 1) { in PetscSpaceSetFromOptions_Tensor()
39 for (i = 1; i < Ns; i++) { in PetscSpaceSetFromOptions_Tensor()
46 Ns = (Ns == PETSC_DEFAULT) ? PetscMax(Nv,1) : Ns; in PetscSpaceSetFromOptions_Tensor()
100 n = uniform ? 1 : Ns; in PetscSpaceTensorView_Ascii()
133 Ns = Nv; in PetscSpaceSetUp_Tensor()
136 if (!Ns) { in PetscSpaceSetUp_Tensor()
245 PetscInt Ns; in PetscSpaceEvaluate_Tensor() local
489 PetscInt Ns; in PetscSpaceTensorSetNumSubspaces_Tensor() local
496 if (Ns >= 0) { in PetscSpaceTensorSetNumSubspaces_Tensor()
519 PetscInt Ns; in PetscSpaceTensorSetSubspace_Tensor() local
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/security/sandbox/chromium/base/
H A Dtuple.h42 template <size_t... Ns>
45 template <size_t... Ns>
46 struct MakeIndexSequenceImpl<0, Ns...> {
47 using Type = IndexSequence<Ns...>;
50 template <size_t N, size_t... Ns>
51 struct MakeIndexSequenceImpl<N, Ns...>
52 : MakeIndexSequenceImpl<N - 1, N - 1, Ns...> {};
76 IndexSequence<Ns...>) {
90 template <typename Function, typename Tuple, size_t... Ns>
93 IndexSequence<Ns...>) {
[all …]
/dports/science/chrono/chrono-7.0.1/data/vehicle/hmmwv/
H A Dhmmwv_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 96.078443
95 Ns 96.078443
/dports/biology/primer3/primer3-2.3.6/test/
H A Dprimer_boundary_output26 PRIMER_LEFT_EXPLAIN=considered 10, too many Ns 9, ok 1
27 PRIMER_RIGHT_EXPLAIN=considered 10, too many Ns 9, ok 1
57 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
58 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
88 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
89 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
120 PRIMER_LEFT_EXPLAIN=considered 4, too many Ns 3, ok 1
121 PRIMER_RIGHT_EXPLAIN=considered 4, too many Ns 3, ok 1
132 PRIMER_LEFT_EXPLAIN=considered 10, too many Ns 9, ok 1
146 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
[all …]
H A Dprimer_boundary1_output19 PRIMER_LEFT_EXPLAIN=considered 10, too many Ns 9, ok 1
20 PRIMER_RIGHT_EXPLAIN=considered 10, too many Ns 9, ok 1
50 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
51 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
81 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 4, ok 1
82 PRIMER_RIGHT_EXPLAIN=considered 5, too many Ns 4, ok 1
113 PRIMER_LEFT_EXPLAIN=considered 4, too many Ns 3, ok 1
114 PRIMER_RIGHT_EXPLAIN=considered 4, too many Ns 3, ok 1
125 PRIMER_LEFT_EXPLAIN=considered 10, too many Ns 9, ok 1
139 PRIMER_LEFT_EXPLAIN=considered 5, too many Ns 3, ok 2
[all …]
/dports/science/PETSc/petsc-3.14.1/src/dm/dt/space/impls/sum/
H A Dspacesum.c161 if (Ns >= 0) { in PetscSpaceSumSetNumSubspaces_Sum()
163 for (s=0; s<Ns; ++s) { in PetscSpaceSumSetNumSubspaces_Sum()
238 Ns = (Ns == PETSC_DEFAULT) ? 1 : Ns; in PetscSpaceSetFromOptions_Sum()
246 …if (Ns < 0 || (Nv > 0 && Ns == 0)) SETERRQ1(PetscObjectComm((PetscObject)sp),PETSC_ERR_ARG_OUTOFRA… in PetscSpaceSetFromOptions_Sum()
251 for (i=0; i<Ns; ++i) { in PetscSpaceSetFromOptions_Sum()
289 if (Ns == PETSC_DEFAULT) { in PetscSpaceSetUp_Sum()
290 Ns = 1; in PetscSpaceSetUp_Sum()
295 for (i=0; i<Ns; ++i) { in PetscSpaceSetUp_Sum()
342 for (i=0; i<Ns; ++i) { in PetscSpaceSumView_Ascii()
370 for (i=0; i<Ns; ++i) { in PetscSpaceDestroy_Sum()
[all …]
/dports/math/g2o/g2o-20201223_git/EXTERNAL/ceres/
H A Dparameter_dims.h66 template <bool IsDynamic, int... Ns>
69 using Parameters = integer_sequence<int, Ns...>;
80 static constexpr int kNumParameterBlocks = sizeof...(Ns);
85 Sum<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...>;
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/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/llvm11/llvm-11.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/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/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/llvm90/llvm-9.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/llvm10/llvm-10.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/lang/rust/rustc-1.58.1-src/src/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-compiler-rt12/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/wasi-compiler-rt13/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 …]

12345678910>>...223