Home
last modified time | relevance | path

Searched refs:curr_n (Results 1 – 8 of 8) sorted by relevance

/dports/devel/emscripten/emscripten-2.0.3/system/lib/standalone/
H A Dstandalone.c107 size_t curr_n = n; in emscripten_memcpy_big() local
108 if (curr_n > CHUNK) curr_n = CHUNK; in emscripten_memcpy_big()
109 memcpy(d, s, curr_n); in emscripten_memcpy_big()
112 n -= curr_n; in emscripten_memcpy_big()
/dports/biology/infernal/infernal-1.1.3/hmmer/src/
H A Dfm_ssv.c40 int curr_n; in FM_mergeSeeds() local
58 curr_n = next.n; in FM_mergeSeeds()
61 curr_end = curr_n + curr_len - 1; in FM_mergeSeeds()
71 … && next.n + next.length < curr_n + curr_len + ssv_length //overlapping, or close to it in FM_mergeSeeds()
79 curr_len = curr_end - curr_n + 1; in FM_mergeSeeds()
83 diags[j].n = curr_n; in FM_mergeSeeds()
85 diags[j].length = curr_end - curr_n + 1; in FM_mergeSeeds()
90 curr_n = next.n; in FM_mergeSeeds()
93 curr_end = curr_n + curr_len - 1; in FM_mergeSeeds()
101 diags[j].n = curr_n; in FM_mergeSeeds()
[all …]
/dports/biology/hmmer/hmmer-3.3/src/
H A Dfm_ssv.c40 int curr_n; in FM_mergeSeeds() local
58 curr_n = next.n; in FM_mergeSeeds()
61 curr_end = curr_n + curr_len - 1; in FM_mergeSeeds()
71 … && next.n + next.length < curr_n + curr_len + ssv_length //overlapping, or close to it in FM_mergeSeeds()
79 curr_len = curr_end - curr_n + 1; in FM_mergeSeeds()
83 diags[j].n = curr_n; in FM_mergeSeeds()
85 diags[j].length = curr_end - curr_n + 1; in FM_mergeSeeds()
90 curr_n = next.n; in FM_mergeSeeds()
93 curr_end = curr_n + curr_len - 1; in FM_mergeSeeds()
101 diags[j].n = curr_n; in FM_mergeSeeds()
[all …]
/dports/biology/wise/wise2.4.1/src/other_programs/
H A Dorthoset.dy80 OrthoNode * curr_n;
92 curr_n = start;
96 if( curr->left == curr_n ) {
97 curr_n = curr->right;
99 curr_n = curr->left;
105 w->node = curr_n;
116 if( curr_n->len < 2 ) {
127 if( curr_n->len > 2 ) {
132 for(i=0;i<curr_n->len;i++) {
137 next = curr_n->link[i];
[all …]
/dports/science/py-nibabel/nibabel-3.2.1/nibabel/nicom/
H A Dascconv.py135 curr_n = len(root)
137 if curr_n > index:
140 root += [None] * (index - curr_n) + [obj]
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/src/render/
H A Dfrustum.cpp387 float *prev_n, *curr_n, *next_n; in Frustum_IsPolyVisible() local
403 curr_n = frustum->planes + 4*(frustum->vertex_count-1); in Frustum_IsPolyVisible()
404 prev_n = curr_n - 4; in Frustum_IsPolyVisible()
410 dist[0] = vec3_plane_dist(curr_n, prev_v->position); in Frustum_IsPolyVisible()
414 dist[1] = vec3_plane_dist(curr_n, curr_v->position); in Frustum_IsPolyVisible()
428 vec3_ray_plane_intersect(prev_v->position, dir, curr_n, T, t) in Frustum_IsPolyVisible()
453 prev_n = curr_n; in Frustum_IsPolyVisible()
454 curr_n = next_n; in Frustum_IsPolyVisible()
/dports/biology/phyml/phyml-3.3.20200621/src/
H A Dgeo.c688 t_node *curr_n,*prev_n,*v1,*v2; in GEO_Lk() local
696 curr_n = NULL; in GEO_Lk()
702 curr_n = t->sorted_nd[i]; // current node in GEO_Lk()
704 GEO_Update_Rmat(curr_n,t,tree); // NOTE: don't need to do that every time. Add check later. in GEO_Lk()
706 R = GEO_Total_Migration_Rate(curr_n,t); // Total migration rate calculated at node n in GEO_Lk()
741 if(curr_n->v[j] != curr_n->anc && curr_n->b[j] != tree->e_root) in GEO_Lk()
743 if(!v1) v1 = curr_n->v[j]; in GEO_Lk()
744 else v2 = curr_n->v[j]; in GEO_Lk()
747 dep = t->idx_loc[curr_n->num]; // departure location in GEO_Lk()
749 (t->idx_loc[v1->num] == t->idx_loc[curr_n->num] ? in GEO_Lk()
[all …]
H A Dutilities.c7450 t_node *root,*curr_n,**internal_nodes, **external_nodes; in Generate_Random_Tree_From_Scratch() local
7528 curr_n = root; in Generate_Random_Tree_From_Scratch()
7546 curr_n->v[1] = tree->a_nodes[n1]; in Generate_Random_Tree_From_Scratch()
7547 curr_n->v[2] = tree->a_nodes[n2]; in Generate_Random_Tree_From_Scratch()
7548 tree->a_nodes[n1]->v[0] = curr_n; in Generate_Random_Tree_From_Scratch()
7549 tree->a_nodes[n2]->v[0] = curr_n; in Generate_Random_Tree_From_Scratch()
7551 tree->times->nd_t[curr_n->num] = t[n_connected/2]; in Generate_Random_Tree_From_Scratch()
7555 if(available_nodes[i] == curr_n->num) in Generate_Random_Tree_From_Scratch()
7563 curr_n = tree->a_nodes[available_nodes[new_n]]; in Generate_Random_Tree_From_Scratch()