/dports/editors/mg/mg-6.9/ |
H A D | graph2.c | 121 graph->verts[i].r_edge = unused; in graph2_hash() 133 if (v->r_edge != unused) in graph2_hash() 134 graph->edges[v->r_edge].r_prev = i; in graph2_hash() 135 graph->edges[i].r_next = v->r_edge; in graph2_hash() 137 v->r_edge = i; in graph2_hash() 155 if (v->l_edge != unused && v->r_edge != unused) in graph2_remove_vertex() 157 if (v->l_edge == unused && v->r_edge == unused) in graph2_remove_vertex() 167 v2->r_edge = e->r_next; in graph2_remove_vertex() 174 e = &graph->edges[v->r_edge]; in graph2_remove_vertex() 177 v->r_edge = unused; /* No other elements possible! */ in graph2_remove_vertex()
|
H A D | graph3.c | 128 graph->verts[i].r_edge = unused; in graph3_hash() 147 if (v->r_edge != unused) in graph3_hash() 148 graph->edges[v->r_edge].r_prev = i; in graph3_hash() 149 graph->edges[i].r_next = v->r_edge; in graph3_hash() 151 v->r_edge = i; in graph3_hash() 170 if (v->l_edge != unused && v->r_edge != unused) in graph3_remove_vertex() 172 if (v->m_edge != unused && v->r_edge != unused) in graph3_remove_vertex() 174 if (v->l_edge == unused && v->m_edge == unused && v->r_edge == unused) in graph3_remove_vertex() 186 if (v->r_edge == unused) in graph3_remove_vertex() 188 e = &graph->edges[v->r_edge]; in graph3_remove_vertex() [all …]
|
H A D | graph2.h | 41 uint32_t l_edge, r_edge; member
|
H A D | graph3.h | 41 uint32_t l_edge, m_edge, r_edge; member
|
/dports/graphics/opencv/opencv-4.5.3/modules/imgproc/src/opencl/ |
H A D | filterSepRow.cl | 51 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (l_edge) : (i)) 52 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (r_edge)-1 : (addr)) 57 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i)-1 : (i)) 58 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-1+((r_edge)<<1) : (addr)) 63 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i) : (i)) 64 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-2+((r_edge)<<1) : (addr)) 69 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (i)+(r_edge) : (i)) 70 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (i)-(r_edge) : (addr)) 75 #define ELEM(i,l_edge,r_edge,elem1,elem2) (i)<(l_edge) | (i) >= (r_edge) ? (elem1) : (elem2) 115 #define ELEM(i,l_edge,r_edge,elem1,elem2) (i)<(l_edge) | (i) >= (r_edge) ? (elem1) : (elem2)
|
H A D | filter2DSmall.cl | 45 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (l_edge) : (i)) 46 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (r_edge)-1 : (addr)) 53 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i)-1 : (i)) 54 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-1+((r_edge)<<1) : (addr)) 61 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i) : (i)) 62 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-2+((r_edge)<<1) : (addr)) 70 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (i)+(r_edge) : (i)) 71 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (i)-(r_edge) : (addr))
|
H A D | filterSmall.cl | 10 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (l_edge) : (i)) 11 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (r_edge)-1 : (addr)) 18 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i)-1 : (i)) 19 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-1+((r_edge)<<1) : (addr)) 26 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? -(i) : (i)) 27 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? -(i)-2+((r_edge)<<1) : (addr)) 35 #define ADDR_L(i, l_edge, r_edge) ((i) < (l_edge) ? (i)+(r_edge) : (i)) 36 #define ADDR_R(i, r_edge, addr) ((i) >= (r_edge) ? (i)-(r_edge) : (addr))
|
H A D | laplacian5.cl | 92 #define ELEM(_x,_y,r_edge,t_edge,const_v) (_x)<0 | (_x) >= (r_edge) | (_y)<0 | (_y) >= (t_edge) ? (… 94 #define ELEM(_x,_y,r_edge,t_edge,const_v) SRC((_x),(_y))
|
H A D | filterSep_singlePass.cl | 93 #define ELEM(_x,_y,r_edge,t_edge,const_v) (_x)<0 | (_x) >= (r_edge) | (_y)<0 | (_y) >= (t_edge) ? (… 95 #define ELEM(_x,_y,r_edge,t_edge,const_v) SRC((_x),(_y))
|
H A D | covardata.cl | 47 #define ELEM(_x,_y,r_edge,t_edge,const_v) (_x)<0 | (_x) >= (r_edge) | (_y)<0 | (_y) >= (t_edge) ? (… 49 #define ELEM(_x,_y,r_edge,t_edge,const_v) SRC((_x),(_y))
|
H A D | morph.cl | 105 #define ELEM(i, l_edge, r_edge, elem1, elem2) (i) < (l_edge) | (i) >= (r_edge) ? (elem1) : (elem2)
|
/dports/devel/libcdb/libcdb-a187cec/src/ |
H A D | cdbw.c | 298 uint32_t l_edge, m_edge, r_edge; member 332 if (v->l_edge != unused && v->r_edge != unused) in remove_vertex() 334 if (v->m_edge != unused && v->r_edge != unused) in remove_vertex() 348 if (v->r_edge == unused) in remove_vertex() 350 e = &state->edges[v->r_edge]; in remove_vertex() 376 vr->r_edge = e->r_next; in remove_vertex() 419 v->r_edge = unused; in build_graph() 439 if (v->r_edge != unused) in build_graph() 440 state->edges[v->r_edge].r_prev = i; in build_graph() 441 e->r_next = v->r_edge; in build_graph() [all …]
|
/dports/misc/rump/buildrump.sh-b914579/src/lib/libc/cdb/ |
H A D | cdbw.c | 284 uint32_t l_edge, m_edge, r_edge; member 318 if (v->l_edge != unused && v->r_edge != unused) in remove_vertex() 320 if (v->m_edge != unused && v->r_edge != unused) in remove_vertex() 334 if (v->r_edge == unused) in remove_vertex() 336 e = &state->edges[v->r_edge]; in remove_vertex() 362 vr->r_edge = e->r_next; in remove_vertex() 405 v->r_edge = unused; in build_graph() 425 if (v->r_edge != unused) in build_graph() 426 state->edges[v->r_edge].r_prev = i; in build_graph() 427 e->r_next = v->r_edge; in build_graph() [all …]
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/rgbd/src/ |
H A D | nonrigid_icp.cpp | 213 Vec3f r_edge = transformedChild + nodePos - (childTranslation + childPos); in estimateWarpNodes() local 215 if(norm(r_edge) > 0.01) continue; in estimateWarpNodes() 217 float robustWeight = huberWeight(r_edge, reg_sigma); in estimateWarpNodes() 222 Vec3f v1 = transformedChild.cross(r_edge); in estimateWarpNodes() 229 b_reg(parentIndex+3) += -w * r_edge[0]; in estimateWarpNodes() 230 b_reg(parentIndex+4) += -w * r_edge[1]; in estimateWarpNodes() 231 b_reg(parentIndex+5) += -w * r_edge[2]; in estimateWarpNodes() 234 Vec3f v2 = childTranslation.cross(r_edge); in estimateWarpNodes() 238 b_reg(childIndex+3) += w * r_edge[0]; in estimateWarpNodes() 239 b_reg(childIndex+4) += w * r_edge[1]; in estimateWarpNodes() [all …]
|
/dports/math/py-PyWavelets/pywt-1.2.0/pywt/ |
H A D | _dwt.py | 487 r_edge = npad_l + vsize_nonpad - 1 493 while r_edge <= vp.size: 494 segment_slice = slice(r_edge + 1, 495 min(r_edge + 1 + seg_width, vp.size)) 498 r_edge += seg_width
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | cdderivedmesh.c | 112 static void cdDM_getEdge(DerivedMesh *dm, int index, MEdge *r_edge) in cdDM_getEdge() argument 115 *r_edge = cddm->medge[index]; in cdDM_getEdge() 130 static void cdDM_copyEdgeArray(DerivedMesh *dm, MEdge *r_edge) in cdDM_copyEdgeArray() argument 133 memcpy(r_edge, cddm->medge, sizeof(*r_edge) * dm->numEdgeData); in cdDM_copyEdgeArray()
|
/dports/math/vtk6/VTK-6.2.0/Filters/StatisticsGnuR/Testing/Cxx/ |
H A D | TestRInterface.cxx | 195 …vtkDoubleArray* r_edge = vtkDoubleArray::SafeDownCast(rint->AssignRVariableToVTKDataArray("edge")); in TestRInterface() local 197 for ( int i = 0; i< r_edge->GetNumberOfTuples(); i++) in TestRInterface() 199 double * a = r_edge->GetTuple(i); in TestRInterface()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/ |
H A D | BKE_DerivedMesh.h | 166 void (*getEdge)(DerivedMesh *dm, int index, struct MEdge *r_edge); 184 void (*copyEdgeArray)(DerivedMesh *dm, struct MEdge *r_edge);
|
/dports/graphics/blender/blender-2.91.0/release/scripts/addons/mesh_snap_utilities_line/ |
H A D | op_line.py | 39 r_edge = None 65 r_edge = edge 67 return r_edge
|
/dports/science/py-gpaw/gpaw-21.6.0/gpaw/point_groups/ |
H A D | groups.py | 242 r_edge = np.cos(np.pi / 5) * a 252 ((r_edge**2 + r_cap**2) - r_captoedge**2) / 253 (2 * r_edge * r_cap)) * 180. / np.pi 255 ((r_edge**2 + r_cap**2) - r_height**2) / 256 (2 * r_edge * r_cap)) * 180. / np.pi 645 r_edge = np.cos(np.pi / 5) * a 655 ((r_edge**2 + r_cap**2) - r_captoedge**2) / 656 (2 * r_edge * r_cap)) * 180. / np.pi 658 ((r_edge**2 + r_cap**2) - r_height**2) / 659 (2 * r_edge * r_cap)) * 180. / np.pi
|
/dports/biology/iqtree/IQ-TREE-2.0.6/booster/ |
H A D | tree.c | 542 Edge *e_to_remove, *r_edge; in remove_taxon() local 628 r_edge = connect_node->br[0]; in remove_taxon() 630 r_edge_global_index = r_edge->id; in remove_taxon() 651 free_edge(r_edge); in remove_taxon() 786 Edge *r_edge = connect_node->br[1]; in remove_single_node() local 787 int r_edge_global_index = r_edge->id; in remove_single_node() 791 Node *r_node = (r_edge->left == connect_node) ? r_edge->right : r_edge->left; in remove_single_node() 879 free_edge(r_edge); in remove_single_node()
|
/dports/print/lilypond-devel/lilypond-2.23.5/lily/ |
H A D | slur-configuration.cc | 248 bool r_edge = j == state.encompass_infos_.size () - 1; in score_encompass() local 249 bool edge = l_edge || r_edge; in score_encompass() 295 || (r_edge && state.dir_ == DOWN)) in score_encompass()
|
/dports/print/lilypond/lilypond-2.22.1/lily/ |
H A D | slur-configuration.cc | 248 bool r_edge = j == state.encompass_infos_.size () - 1; in score_encompass() local 249 bool edge = l_edge || r_edge; in score_encompass() 295 || (r_edge && state.dir_ == DOWN)) in score_encompass()
|
/dports/games/quake2lnx/quake2-r0.16.2/src/rhapsody/ |
H A D | makefile | 27 …IR)/r_aclip.o $(ODIR)/r_alias.o $(ODIR)/r_bsp.o $(ODIR)/r_draw.o $(ODIR)/r_edge.o $(ODIR)/r_efrag.… 188 $(ODIR)/r_edge.o : ref_soft/r_edge.c
|
/dports/games/quake2-source/quake2-r0.16.2/src/rhapsody/ |
H A D | makefile | 27 …IR)/r_aclip.o $(ODIR)/r_alias.o $(ODIR)/r_bsp.o $(ODIR)/r_draw.o $(ODIR)/r_edge.o $(ODIR)/r_efrag.… 188 $(ODIR)/r_edge.o : ref_soft/r_edge.c
|