| /dports/biology/iqtree/IQ-TREE-2.0.6/pll/ |
| H A D | fastDNAparsimony.c | 841 t_N = t_N | t_A[k]; in newviewParsimonyIterativeFast()
844 t_N = ~t_N; in newviewParsimonyIterativeFast()
882 t_N = t_N | t_A[k]; in newviewParsimonyIterativeFast()
885 t_N = ~t_N; in newviewParsimonyIterativeFast()
934 t_N, in evaluateParsimonyIterativeFast() local
965 t_N, in evaluateParsimonyIterativeFast() local
995 t_N, in evaluateParsimonyIterativeFast() local
1012 t_N = t_N | t_A; in evaluateParsimonyIterativeFast()
1015 t_N = ~t_N; in evaluateParsimonyIterativeFast()
1047 t_N = t_N | t_A; in evaluateParsimonyIterativeFast()
[all …]
|
| /dports/net-im/convey/convey-src-0.3/src/org/convey/ |
| H A D | FittedCurveGraphic.java | 43 double[] t_N = new double[N]; in createFittedCurve() local
47 t_N[i] = (double)i / (double)N; in createFittedCurve()
54 FT_4_N[1][i] = F_N_4[i][1] = t_N[i]; in createFittedCurve()
55 FT_4_N[2][i] = F_N_4[i][2] = Math.pow(t_N[i], 2); in createFittedCurve()
56 FT_4_N[3][i] = F_N_4[i][3] = Math.pow(t_N[i], 3); in createFittedCurve()
|
| /dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/externals/fetk/mc/src/aprx/ |
| H A D | estim.c | 184 TT t, t_N; in Aprx_estNonlinResid() local
254 Gem_buildVolumeTrans(thee->gm,sm_N,&t_N); in Aprx_estNonlinResid()
258 vxn_N[0] = t_N.vid[vmapF[face_N][0]]; in Aprx_estNonlinResid()
259 vxn_N[1] = t_N.vid[vmapF[face_N][1]]; in Aprx_estNonlinResid()
260 vxn_N[2] = t_N.vid[vmapF[face_N][2]]; in Aprx_estNonlinResid()
310 Aprx_buildFunc(thee,re,&t_N,m_N,face_N,u,ud,xm_N,U_N,dU_N); in Aprx_estNonlinResid()
324 t_N.stype,t_N.gchart,t_N.vx,&t_N); in Aprx_estNonlinResid()
325 thee->pde->initPoint(thee->pde,0,t_N.gchart,xm_N,U_N,dU_N); in Aprx_estNonlinResid()
|
| H A D | estim-old.c | 179 TT t, t_N; in Aprx_estNonlinResid() local
241 Gem_buildVolumeTrans(thee->gm,sm_N,&t_N); in Aprx_estNonlinResid()
254 Aprx_buildFunc(thee,re,&t_N,m_N,face_N,u,ud,xm_N,U_N,dU_N); in Aprx_estNonlinResid()
268 t_N.stype,t_N.gchart,t_N.vx,sm_N); in Aprx_estNonlinResid()
269 thee->pde->initPoint(thee->pde,0,t_N.gchart,xm_N,U_N,dU_N); in Aprx_estNonlinResid()
|
| /dports/science/chrono/chrono-7.0.1/src/chrono/geometry/ |
| H A D | ChTriangleMeshConnected.cpp | 1624 auto t_N = mlist.back(); in RefineMeshEdges() local
1632 … std::pair<int, int> ie_verts = this->GetTriangleEdgeIndexes(m_face_v_indices, t_N, ie, true); in RefineMeshEdges()
1640 t_N1 = tri_map[t_N][1 + ie]; // neighbour triangle in RefineMeshEdges()
1662 … SplitEdge(t_N, -1, edge_N, 0, itA_1, itA_2, itB_1, itB_2, tri_map, aux_data_double, aux_data_int, in RefineMeshEdges()
1666 if (t_N < marked_tris_flagged.size() && marked_tris_flagged[t_N] == true) { in RefineMeshEdges()
1694 if (t_shared == t_N) { in RefineMeshEdges()
1699 … SplitEdge(t_N, t_N1, edge_N, edge_N1, itA_1, itA_2, itB_1, itB_2, tri_map, aux_data_double, in RefineMeshEdges()
1703 if (t_N < marked_tris_flagged.size() && marked_tris_flagged[t_N] == true) { in RefineMeshEdges()
|
| /dports/math/openturns/openturns-1.18/python/src/ |
| H A D | Fehlberg_doc.i.in | 24 at a given set of locations :math:`t_0,\dots,t_N` by first building an
25 approximation over an adapted grid :math:`\tau_0=t_0,\dots,\tau_M=t_N` with a
|
| /dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/doc/ |
| H A D | adapt-concept.tex | 559 \|u(t_N) - U_N\| &\leq&
575 $C_i$ depend on the time $t_N$ and the size of the last time step:
576 $C_i = C_i(\log(\frac{t_N}{\tau_N}))$.
|
| /dports/textproc/hevea/hevea-2.34/bugs/008/ |
| H A D | Chapter_6.tex | 574 …ντας την αλυσίδα $N$ φορές, παίρνοντας $N$ ανεξάρτητα δείγματα $t_1,\ldots,t_N$ του χρόνου επιστρο…
577 Ε_N=\frac{t_1+t_2+\cdots+t_N}{N}
|
| /dports/games/nazghul/nazghul-0.7.1/worlds/haxima-1.002/ |
| H A D | terrains.scm | 201 (list 't_N "an N" pclass-wall s_N trn 0 nil)
|
| /dports/math/gap/gap-4.11.0/lib/ |
| H A D | cyclotom.gd | 451 ## <Index Key="t_N"><M>t_N</M> (irrational value)</Index>
|
| /dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/ |
| H A D | abi-internal.md | 66 = align(offset(S, N) + sizeof(t_N), alignof(S))
|
| /dports/math/octave-forge-queueing/queueing/doc/ |
| H A D | markovchains.texi | 610 vector @math{{\bf t} = [t_1, @dots{}, t_N]} can be computed from the
|
| /dports/math/adol-c/ADOL-C-2.7.2/ADOL-C/doc/ |
| H A D | adolc-manual.tex | 3023 time $t_i$ for a given time grid $t_0,\ldots,t_N$ with $t_0=0$ and
3024 $t_N=T$. The operator $F : {\bf R}^n \times {\bf R}^m \times {\bf R} \mapsto {\bf R}^n$
|
| /dports/math/gap/gap-4.11.0/doc/ref/ |
| H A D | main.ind | 4829 \item $t_N$ (irrational value), \hyperpage{243}
|
| /dports/lang/ghc/ghc-8.10.7/docs/users_guide/ |
| H A D | glasgow_exts.rst | 329 (# t_1 | t_2 | ... | t_N #)
331 where ``t_1`` ... ``t_N`` are types (which can be unlifted, including unboxed
|
| /dports/math/py-theano/Theano-1.0.5/theano/sandbox/tests/ |
| H A D | multinomial_test_graph.pkl | 628 …t_N^\x8bw\xd4\x0c\xb0@7\xf0\x1fH\x9b\t\xb8B\x82+\x96\x1d\x1b\x96\x7fJp\xdf\xfa-\xech\x03QAY\x8cS4@…
|
| /dports/devel/gettext-tools/gettext-0.21/gettext-tools/tests/ |
| H A D | mm-viet.comp.po | 14795 " upgrade \t_Nâng cập_ \n"
14800 " dist-upgrade \t_Nâng cấp bản phân phối_,\n"
|
| /dports/devel/gettext-runtime/gettext-0.21/gettext-tools/tests/ |
| H A D | mm-viet.comp.po | 14795 " upgrade \t_Nâng cập_ \n"
14800 " dist-upgrade \t_Nâng cấp bản phân phối_,\n"
|
| /dports/devel/gettext-po-mode/gettext-0.21/gettext-tools/tests/ |
| H A D | mm-viet.comp.po | 14795 " upgrade \t_Nâng cập_ \n"
14800 " dist-upgrade \t_Nâng cấp bản phân phối_,\n"
|
| /dports/devel/libtextstyle/gettext-0.21/gettext-tools/tests/ |
| H A D | mm-viet.comp.po | 14795 " upgrade \t_Nâng cập_ \n"
14800 " dist-upgrade \t_Nâng cấp bản phân phối_,\n"
|
| /dports/security/hashcat-legacy/hashcat-legacy-2.00/salts/ |
| H A D | brute-vbulletin.salt | 764132 t_N
|