/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/objects/taxon1/ |
H A D | ctreecont.cpp | 46 for(CTreeContNodeBase* pN= m_node->m_parent; pN != 0; pN= pN->m_parent) { in BelongSubtree() local 74 m_node= pN; in GoAncestor() 133 pN= pN->m_sibling ); in MoveNode() 165 while((pN= pN->m_sibling) != 0); in MoveChildren() 184 delete pN; in DelNodeInternal() 203 pN= pN->m_sibling); in DeleteSubtree() 212 m_node= pN; in DeleteSubtree() 243 pN= pN->m_sibling); in Merge() 536 for(const CTreeContNodeBase* pN= m_node->m_parent; pN != 0; in BelongSubtree() local 537 pN= pN->m_parent) { in BelongSubtree() [all …]
|
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/objects/taxon1/ |
H A D | ctreecont.cpp | 46 for(CTreeContNodeBase* pN= m_node->m_parent; pN != 0; pN= pN->m_parent) { in BelongSubtree() local 74 m_node= pN; in GoAncestor() 133 pN= pN->m_sibling ); in MoveNode() 165 while((pN= pN->m_sibling) != 0); in MoveChildren() 184 delete pN; in DelNodeInternal() 203 pN= pN->m_sibling); in DeleteSubtree() 212 m_node= pN; in DeleteSubtree() 243 pN= pN->m_sibling); in Merge() 536 for(const CTreeContNodeBase* pN= m_node->m_parent; pN != 0; in BelongSubtree() local 537 pN= pN->m_parent) { in BelongSubtree() [all …]
|
/dports/math/fricas/fricas-1.3.7/src/graph/view3D/ |
H A D | msort3d.c | 97 linkThing *returnVal,*current,*pN,*qN; in merge() local 105 pN = p->next; in merge() 109 pN = p; in merge() 114 while ((pN != NULL) && (qN != NULL)) { in merge() 115 if (compare(pN,qN) <= 0) { /* pN <= qN */ in merge() 116 current->next = pN; in merge() 117 current = pN; in merge() 118 pN = pN->next; in merge() 127 if (pN == NULL) current->next = qN; in merge() 128 else current->next = pN; in merge()
|
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/simulation/sim_ecosystems_hugget/ |
H A D | Hugget_03.cpp | 133 CSG_Grid *pDEM, *pN, N_1, S[8]; in On_Execute() local 148 pN = Parameters("NSTORE" )->asGrid(); in On_Execute() 149 pN->Assign(N_Init); in On_Execute() 151 DataObject_Set_Colors(pN, 11, SG_COLORS_YELLOW_GREEN); in On_Execute() 153 N_1.Create(pN, SG_DATATYPE_Float); in On_Execute() 164 DataObject_Update(pN, pN->Get_Min(), pN->Get_Max(), true); in On_Execute() 168 Step(S, pN, &N_1, N_Rain, dTime); in On_Execute() 171 pN->Assign(&N_1); in On_Execute() 248 dN += s * pN->asDouble(x, y); in Step() 252 dN += s * pN->asDouble(Get_xTo(i, x), Get_yTo(i, y)); in Step() [all …]
|
/dports/math/asl/solvers/ |
H A D | avltree.c | 135 if (pN) in AVL_vfind() 144 if (pN) in AVL_vfind() 145 *pN = 0; in AVL_vfind() 169 if (pN) in AVL_vfirst_ge() 196 if (pN) in AVL_vlast_le() 403 if (pN) in AVL_vinsert() 460 *pN = 0; in AVL_delnode() 545 if (pN) in AVL_first() 559 if (pN) in AVL_last() 569 N = *pN; in AVL_next() [all …]
|
/dports/databases/cego/cego-2.47.11/src/ |
H A D | CegoQueryCache.cc | 248 Element *pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() local 251 pCacheInfo->addContent(pN); in getCacheInfo() 253 pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() 256 pCacheInfo->addContent(pN); in getCacheInfo() 258 pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() 261 pCacheInfo->addContent(pN); in getCacheInfo() 264 pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() 267 pCacheInfo->addContent(pN); in getCacheInfo() 281 Element *pN = new Element(XML_CACHE_ELEMENT); in getCacheList() local 286 pN->setAttribute(XML_ID_ATTR, pCE->getQueryId()); in getCacheList() [all …]
|
H A D | CegoOrderCursor.cc | 37 CegoOrderNode* pN = _pAVL->First(); in getFirst() local 39 if ( pN ) in getFirst() 44 CegoFieldValue* pV = pN->getTuple().First(); in getFirst() 49 pV = pN->getTuple().Next(); in getFirst() 58 CegoOrderNode* pN = _pAVL->Next(); in getNext() local 60 if ( pN ) in getNext() 65 CegoFieldValue* pV = pN->getTuple().First(); in getNext() 70 pV = pN->getTuple().Next(); in getNext()
|
H A D | CegoTableCache.cc | 210 Element *pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() local 212 pN->setAttribute(XML_VALUE_ATTR, Chain(_maxEntry)); in getCacheInfo() 213 pCacheInfo->addContent(pN); in getCacheInfo() 215 pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() 217 pN->setAttribute(XML_VALUE_ATTR, Chain(_maxSize)); in getCacheInfo() 218 pCacheInfo->addContent(pN); in getCacheInfo() 220 pN = new Element(XML_CACHE_ELEMENT); in getCacheInfo() 222 pN->setAttribute(XML_VALUE_ATTR, Chain(_usedSize)); in getCacheInfo() 223 pCacheInfo->addContent(pN); in getCacheInfo() 236 Element *pN = new Element(XML_CACHE_ELEMENT); in getCacheList() local [all …]
|
H A D | CegoGroupCursor.cc | 48 CegoGroupNode *pN = _pAVL->First(); in getFirst() local 50 if ( pN ) in getFirst() 52 fl = pN->getKey() + pN->getGrouping(); in getFirst() 72 CegoGroupNode *pN = _pAVL->Next(); in getNext() local 74 if ( pN ) in getNext() 76 fl = pN->getKey() + pN->getGrouping(); in getNext()
|
/dports/sysutils/perp/perp-2.07/lasagna/buf/ |
H A D | buf_rndx.c | 13 const uchar_t *pN = 0; in buf_rndx() local 17 if (!n) break; if (*p == ch) pN = p; ++p; --n; in buf_rndx() 18 if (!n) break; if (*p == ch) pN = p; ++p; --n; in buf_rndx() 19 if (!n) break; if (*p == ch) pN = p; ++p; --n; in buf_rndx() 20 if (!n) break; if (*p == ch) pN = p; ++p; --n; in buf_rndx() 22 if (!pN) pN = p; in buf_rndx() 24 return (size_t)((uchar_t *)pN - (uchar_t *)b); in buf_rndx()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/qadic/ |
H A D | norm_analytic.c | 29 fmpz_t pN, tru; in _qadic_norm_analytic() local 33 fmpz_init(pN); in _qadic_norm_analytic() 37 fmpz_pow_ui(pN, p, N); in _qadic_norm_analytic() 39 _qadic_log(lg, y, v, len, a, j, lena, p, N, pN); in _qadic_norm_analytic() 41 _qadic_trace(tru, lg, d, a, j, lena, pN); in _qadic_norm_analytic() 47 fmpz_mod(rop, rop, pN); in _qadic_norm_analytic() 54 fmpz_clear(pN); in _qadic_norm_analytic() 73 fmpz_t pN; in qadic_norm_analytic() local 76 alloc = _padic_ctx_pow_ui(pN, N - d * op->val, (&ctx->pctx)); in qadic_norm_analytic() 78 fmpz_powm_ui(padic_unit(rop), op->coeffs + 0, d, pN); in qadic_norm_analytic() [all …]
|
H A D | norm_resultant.c | 55 fmpz_mod(a + p*n + i, s, pN); in _fmpz_mod_mat_det() 64 fmpz_mod(A + t, s, pN); in _fmpz_mod_mat_det() 71 fmpz_mod(F + p, F + p, pN); in _fmpz_mod_mat_det() 87 fmpz_mod(rop, rop, pN); in _fmpz_mod_mat_det() 102 fmpz_t pN; in _qadic_norm_resultant() local 104 fmpz_init(pN); in _qadic_norm_resultant() 105 fmpz_pow_ui(pN, p, N); in _qadic_norm_resultant() 109 fmpz_powm_ui(rop, op + 0, d, pN); in _qadic_norm_resultant() 135 _fmpz_mod_mat_det(rop, M, n, pN); in _qadic_norm_resultant() 152 fmpz_mod(rop, rop, pN); in _qadic_norm_resultant() [all …]
|
/dports/math/e-antic/flint2-ae7ec89/qadic/ |
H A D | norm_analytic.c | 29 fmpz_t pN, tru; in _qadic_norm_analytic() local 33 fmpz_init(pN); in _qadic_norm_analytic() 37 fmpz_pow_ui(pN, p, N); in _qadic_norm_analytic() 39 _qadic_log(lg, y, v, len, a, j, lena, p, N, pN); in _qadic_norm_analytic() 41 _qadic_trace(tru, lg, d, a, j, lena, pN); in _qadic_norm_analytic() 47 fmpz_mod(rop, rop, pN); in _qadic_norm_analytic() 54 fmpz_clear(pN); in _qadic_norm_analytic() 73 fmpz_t pN; in qadic_norm_analytic() local 76 alloc = _padic_ctx_pow_ui(pN, N - d * op->val, (&ctx->pctx)); in qadic_norm_analytic() 78 fmpz_powm_ui(padic_unit(rop), op->coeffs + 0, d, pN); in qadic_norm_analytic() [all …]
|
H A D | norm_resultant.c | 55 fmpz_mod(a + p*n + i, s, pN); in _fmpz_mod_mat_det() 64 fmpz_mod(A + t, s, pN); in _fmpz_mod_mat_det() 71 fmpz_mod(F + p, F + p, pN); in _fmpz_mod_mat_det() 87 fmpz_mod(rop, rop, pN); in _fmpz_mod_mat_det() 102 fmpz_t pN; in _qadic_norm_resultant() local 104 fmpz_init(pN); in _qadic_norm_resultant() 105 fmpz_pow_ui(pN, p, N); in _qadic_norm_resultant() 109 fmpz_powm_ui(rop, op + 0, d, pN); in _qadic_norm_resultant() 135 _fmpz_mod_mat_det(rop, M, n, pN); in _qadic_norm_resultant() 152 fmpz_mod(rop, rop, pN); in _qadic_norm_resultant() [all …]
|
/dports/math/flint2/flint-2.8.4/qadic/ |
H A D | norm_analytic.c | 29 fmpz_t pN, tru; in _qadic_norm_analytic() local 33 fmpz_init(pN); in _qadic_norm_analytic() 37 fmpz_pow_ui(pN, p, N); in _qadic_norm_analytic() 39 _qadic_log(lg, y, v, len, a, j, lena, p, N, pN); in _qadic_norm_analytic() 41 _qadic_trace(tru, lg, d, a, j, lena, pN); in _qadic_norm_analytic() 47 fmpz_mod(rop, rop, pN); in _qadic_norm_analytic() 54 fmpz_clear(pN); in _qadic_norm_analytic() 73 fmpz_t pN; in qadic_norm_analytic() local 76 alloc = _padic_ctx_pow_ui(pN, N - d * op->val, (&ctx->pctx)); in qadic_norm_analytic() 78 fmpz_powm_ui(padic_unit(rop), op->coeffs + 0, d, pN); in qadic_norm_analytic() [all …]
|
H A D | norm_resultant.c | 55 fmpz_mod(a + p*n + i, s, pN); in _fmpz_mod_mat_det() 64 fmpz_mod(A + t, s, pN); in _fmpz_mod_mat_det() 71 fmpz_mod(F + p, F + p, pN); in _fmpz_mod_mat_det() 87 fmpz_mod(rop, rop, pN); in _fmpz_mod_mat_det() 102 fmpz_t pN; in _qadic_norm_resultant() local 104 fmpz_init(pN); in _qadic_norm_resultant() 105 fmpz_pow_ui(pN, p, N); in _qadic_norm_resultant() 109 fmpz_powm_ui(rop, op + 0, d, pN); in _qadic_norm_resultant() 135 _fmpz_mod_mat_det(rop, M, n, pN); in _qadic_norm_resultant() 152 fmpz_mod(rop, rop, pN); in _qadic_norm_resultant() [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/kokkos/core/unit_test/incremental/ |
H A D | Test13b_ParallelRed_TeamVectorRange.hpp | 59 void run(const int pN, const int sX) { in run() 64 viewDataType v("Vector", pN); in run() 67 "Team", team_policy(pN, Kokkos::AUTO), in run() 87 for (int i = 0; i < pN; ++i) { in run() 89 ref += ((sX + i * pN) * (sX + i * pN - 1) - (i * pN * (i * pN - 1))) / 2; in run()
|
H A D | Test13a_ParallelRed_TeamThreadRange.hpp | 61 void run(const int pN, const int sX) { in run() 66 viewDataType v("Vector", pN); in run() 69 "Team", team_policy(pN, Kokkos::AUTO), in run() 89 for (int i = 0; i < pN; ++i) { in run() 92 (sX + i * pN) * (sX + i * pN - 1) / 2 - ((i * pN) * (i * pN - 1) / 2); in run()
|
/dports/devel/kokkos/kokkos-3.4.01/core/unit_test/incremental/ |
H A D | Test13a_ParallelRed_TeamThreadRange.hpp | 61 void run(const int pN, const int sX) { in run() 66 viewDataType v("Vector", pN); in run() 69 "Team", team_policy(pN, Kokkos::AUTO), in run() 89 for (int i = 0; i < pN; ++i) { in run() 92 (sX + i * pN) * (sX + i * pN - 1) / 2 - ((i * pN) * (i * pN - 1) / 2); in run()
|
H A D | Test13b_ParallelRed_TeamVectorRange.hpp | 59 void run(const int pN, const int sX) { in run() 64 viewDataType v("Vector", pN); in run() 67 "Team", team_policy(pN, Kokkos::AUTO), in run() 87 for (int i = 0; i < pN; ++i) { in run() 89 ref += ((sX + i * pN) * (sX + i * pN - 1) - (i * pN * (i * pN - 1))) / 2; in run()
|
/dports/science/sparta/sparta-20Oct2021/lib/kokkos/core/unit_test/incremental/ |
H A D | Test13a_ParallelRed_TeamThreadRange.hpp | 61 void run(const int pN, const int sX) { in run() 66 viewDataType v("Vector", pN); in run() 69 "Team", team_policy(pN, Kokkos::AUTO), in run() 89 for (int i = 0; i < pN; ++i) { in run() 92 (sX + i * pN) * (sX + i * pN - 1) / 2 - ((i * pN) * (i * pN - 1) / 2); in run()
|
H A D | Test13b_ParallelRed_TeamVectorRange.hpp | 59 void run(const int pN, const int sX) { in run() 64 viewDataType v("Vector", pN); in run() 67 "Team", team_policy(pN, Kokkos::AUTO), in run() 87 for (int i = 0; i < pN; ++i) { in run() 89 ref += ((sX + i * pN) * (sX + i * pN - 1) - (i * pN * (i * pN - 1))) / 2; in run()
|
/dports/lang/mono/mono-5.10.1.57/external/corert/src/System.Private.Interop/src/Shared/ |
H A D | StringPool.cs | 54 fixed (byte* pN = m_typeNames) in GetString() 60 if (pN[nameIdx] == Unicode_Mark) // Check for UNICODE mark in GetString() 67 for (byte* p = pN + nameIdx; ; p++) in GetString() 104 for (byte* p = pN + nameIdx; ; p++) in GetString() 179 fixed (byte* pN = m_typeNames) in StableStringHash() 185 if (pN[nameIdx] == Unicode_Mark) in StableStringHash() 191 for (byte* p = pN + nameIdx; ; p++) in StableStringHash() 245 byte* pN = pNBlob + nameIdx; in IsStringEqual() 247 for (; ; pN++) in IsStringEqual() 249 int c = *pN; in IsStringEqual() [all …]
|
/dports/databases/spatialite-tools/spatialite-tools-5.0.1/ |
H A D | spatialite_network.c | 201 while (pN) in graph_free() 218 free (pN); in graph_free() 219 pN = pNn; in graph_free() 321 pN = pN->next; in sort_nodes() 331 pN = pN->next; in sort_nodes() 422 if (pN) in process_node() 425 if (pN->x == DBL_MAX && pN->y == DBL_MAX) in process_node() 427 pN->x = x; in process_node() 428 pN->y = y; in process_node() 432 if (pN->x == x && pN->y == y) in process_node() [all …]
|
/dports/databases/spatialite_gui/spatialite_gui-1.7.1/ |
H A D | Network.cpp | 719 NetNode *pN; in CreateNetwork() local 1273 while (pN) in ~Network() 1369 if (pN) in ProcessNode() 1372 if (pN->GetX() == DBL_MAX && pN->GetY() == DBL_MAX) in ProcessNode() 1378 if (pN->GetX() == x && pN->GetY() == y) in ProcessNode() 1397 if (pN) in ProcessNode() 1406 if (pN->GetX() == x && pN->GetY() == y) in ProcessNode() 1506 while (pN) in Sort() 1509 pN = pN->GetNext(); in Sort() 1516 while (pN) in Sort() [all …]
|