/external/opencv/cxcore/include/ |
H A D | cxcore.h | 1171 are not connected or return pointer to already existing edge 1173 Functions return 1 if a new edge was created, 0 otherwise */ 1176 const CvGraphEdge* edge CV_DEFAULT(NULL), 1181 const CvGraphEdge* edge CV_DEFAULT(NULL), 1184 /* Remove edge connecting two vertices */ 1189 /* Find edge connecting two vertices */ 1212 /* Retrieves index of a graph edge given its pointer */ 1213 #define cvGraphEdgeIdx( graph, edge ) ((edge)->flags & CV_SET_ELEM_IDX_MASK) 1234 #define CV_IS_GRAPH_EDGE_VISITED(edge) \ 1243 CvGraphEdge* edge; /* current edge */ member in struct:CvGraphScanner [all...] |
H A D | cxtypes.h | 1270 outcoming edge (or 0 if isolated vertex)). Edges are stored in another set. 1273 Each edge consists of 1282 next[0] points to the next edge in the vtx[0] adjacency list and 1283 next[1] points to the next edge in the vtx[1] adjacency list. 1617 /* Return next graph edge for given vertex: */ 1618 #define CV_NEXT_GRAPH_EDGE( edge, vertex ) \ 1619 (assert((edge)->vtx[0] == (vertex) || (edge)->vtx[1] == (vertex)), \ 1620 (edge)->next[(edge) [all...] |
/external/opencv/cxcore/src/ |
H A D | cxdatastructs.cpp | 2979 CvGraphEdge *edge = vtx->first; local 2980 if( !edge ) 2982 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] ); 3014 CvGraphEdge *edge = vtx->first; local 3017 if( !edge ) 3019 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] ); 3030 /* Find a graph edge given pointers to the ending vertices: */ 3036 CvGraphEdge *edge local 3075 CvGraphEdge *edge = 0; local 3107 CvGraphEdge *edge = 0; local 3211 CvGraphEdge *edge, *next_edge, *prev_edge; local 3294 CvGraphEdge *edge; local 3321 CvGraphEdge *edge; local 3350 CvGraphEdge* edge; member in struct:CvGraphItem 3528 CvGraphEdge* edge; local 3734 CvGraphEdge* edge = (CvGraphEdge*)reader.ptr; local [all...] |
H A D | cxdrawing.cpp | 995 edge[2]; 1065 edge[0].idx = edge[1].idx = imin; 1067 edge[0].ye = edge[1].ye = y = ymin; 1068 edge[0].di = 1; 1069 edge[1].di = npts - 1; 1079 if( y >= edge[i].ye ) 1081 int idx = edge[i].idx, di = edge[ 1167 CvPolyEdge edge; local [all...] |
H A D | cxpersistence.cpp | 4558 // alignment of user part of the edge data following 2if 4580 CvGraphEdge* edge = (CvGraphEdge*)reader.ptr; local 4582 ((int*)src_ptr)[0] = edge->vtx[0]->flags; 4583 ((int*)src_ptr)[1] = edge->vtx[1]->flags; 4584 *(float*)(src_ptr + sizeof(int)*2) = edge->weight; 4589 memcpy( src_ptr2, edge + 1, elem_size - sizeof(CvGraphEdge) ); 4701 // alignment of user part of the edge data following 2if 4773 CvGraphEdge* edge = 0; local 4784 vtx_buf[vtx1], vtx_buf[vtx2], 0, &edge )); 4787 CV_ERROR( CV_StsBadArg, "Duplicated edge ha [all...] |
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |
/external/pdfium/fxjs/xfa/ |
H A D | cjx_object.cpp | 1362 CXFA_Edge* edge = border->GetEdgeIfExists(i); local 1363 if (edge) 1364 edge->SetColor(rgb); 1370 CXFA_Edge* edge = border->GetEdgeIfExists(0); local 1371 FX_ARGB color = edge ? edge->GetColor() : CXFA_Edge::kDefaultColor; 1386 CXFA_Edge* edge = border->GetEdgeIfExists(0); local 1388 edge ? edge->GetMSThickness() : CXFA_Measurement(0.5, XFA_Unit::Pt); 1395 CXFA_Edge* edge local [all...] |
/external/pdfium/third_party/lcms/src/ |
H A D | cmssm.c | 248 if (sN < 0.0) { // sc < 0 => the s=0 edge is visible 254 else if (sN > sD) { // sc > 1 => the s=1 edge is visible 261 if (tN < 0.0) { // tc < 0 => the t=0 edge is visible 264 // recompute sc for this edge 274 else if (tN > tD) { // tc > 1 => the t=1 edge is visible 278 // recompute sc for this edge 483 cmsLine edge; local 520 LineOf2Points(&edge, &a1, &a2); 523 ClosestLineToLine(&temp, &ray, &edge);
|
/external/pdfium/xfa/fwl/theme/ |
H A D | cfwl_edittp.cpp | 30 CXFA_Edge* edge = borderUI->GetEdgeIfExists(0); local 31 if (edge) { 32 cr = edge->GetColor(); 33 fWidth = edge->GetThickness();
|
/external/pdfium/xfa/fxfa/ |
H A D | cxfa_ffline.cpp | 101 CXFA_Edge* edge = line->GetEdgeIfExists(); local 102 if (edge && !edge->IsVisible()) 105 if (edge) { 106 lineColor = edge->GetColor(); 107 iStrokeType = edge->GetStrokeType(); 108 fLineWidth = edge->GetThickness(); 109 iCap = edge->GetCapType();
|
H A D | cxfa_ffpushbutton.cpp | 125 CXFA_Edge* edge = border->GetEdgeIfExists(0); local 126 return edge ? edge->GetThickness() : 0;
|
/external/pdfium/xfa/fxfa/parser/ |
H A D | cxfa_box.cpp | 162 CXFA_Edge* edge; local 164 edge = JSObject()->GetOrCreateProperty<CXFA_Edge>(i, XFA_Element::Edge); 166 edge = JSObject()->GetProperty<CXFA_Edge>(i, XFA_Element::Edge); 169 // with a null edge in the first position. 170 if (edge || i == 0) { 171 strokes[j] = edge; 224 CXFA_Edge* edge = GetEdgeIfExists(0); local 225 float fThickness = std::fmax(0.0, edge ? edge->GetThickness() : 0); 275 CXFA_Edge* edge local [all...] |
/external/python/cpython2/Demo/turtle/ |
H A D | tdemo_fractalcurves.py | 52 edge = 2 * rad * math.sin(math.pi / n) 58 self.fractal(edge, lev, dir)
|
/external/python/cpython2/Lib/test/ |
H A D | test_bigmem.py | 473 edge = '-' * size 474 s = ''.join([edge, '%s', edge]) 475 del edge 589 edge = '-' * (size // 2) 590 s = ''.join([edge, SUBSTR, edge]) 591 del edge
|
H A D | test_set.py | 1744 for edge in g.values(): 1745 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1747 self.assertEqual(vertices1, vertices2) # edge vertices in original set 1767 othervertices = set(edge for edges in cuboctahedron.values() for edge in edges) 1768 self.assertEqual(vertices, othervertices) # edge vertices in original set 1778 edge = vertex # Cuboctahedron vertices are edges in Cube 1779 self.assertEqual(len(edge), 2) # Two cube vertices define an edge 1780 for cubevert in edge [all...] |
/external/python/cpython2/Modules/_ctypes/libffi/ |
H A D | texinfo.tex | 832 % \vadjust-items are inserted at the left edge of the type. So 3426 % edge of all pages.
|
/external/python/cpython3/Lib/test/ |
H A D | test_bigmem.py | 535 edge = _('-') * (size // 2) 536 s = _('').join([edge, SUBSTR, edge]) 537 del edge 666 edge = '-' * size 667 s = ''.join([edge, '%s', edge]) 668 del edge
|
H A D | test_set.py | 1860 for edge in g.values(): 1861 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1863 self.assertEqual(vertices1, vertices2) # edge vertices in original set 1883 othervertices = set(edge for edges in cuboctahedron.values() for edge in edges) 1884 self.assertEqual(vertices, othervertices) # edge vertices in original set 1894 edge = vertex # Cuboctahedron vertices are edges in Cube 1895 self.assertEqual(len(edge), 2) # Two cube vertices define an edge 1896 for cubevert in edge [all...] |
/external/python/cpython3/Lib/turtledemo/ |
H A D | fractalcurves.py | 52 edge = 2 * rad * math.sin(math.pi / n) 58 self.fractal(edge, lev, dir)
|
/external/python/cpython3/Modules/_ctypes/libffi/ |
H A D | texinfo.tex | 832 % \vadjust-items are inserted at the left edge of the type. So 3426 % edge of all pages.
|
/external/replicaisland/tools/ |
H A D | ExtractPoints.js | 27 * edge calculation for debugging purposes. 75 var edge = new Object; 77 edge.startX = firstPoint.anchor[0]; 78 edge.startY = firstPoint.anchor[1]; 80 edge.endX = lastPoint.anchor[0]; 81 edge.endY = lastPoint.anchor[1]; 83 var normalX = -(edge.endY - edge.startY); 84 var normalY = edge.endX - edge [all...] |
/external/robolectric/v1/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |
/external/robolectric/v1/lib/test/ |
H A D | mockito-core-1.8.5.jar | META-INF/ META-INF/MANIFEST.MF org/ org/mockito/ org/mockito/asm/ org/mockito/asm/signature/ ... |
/external/robolectric/v3/runtime/ |
H A D | android-all-4.1.2_r1-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |
H A D | android-all-4.2.2_r1.2-robolectric-0.jar | META-INF/ META-INF/MANIFEST.MF android/ android/accessibilityservice/ android/accessibilityservice/AccessibilityService$1.class ... |