/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/ |
H A D | BitMatrix.pm | 15 my @V = $g->vertices; 111 sub vertices { subroutine 137 $a->vertices() 173 Return true if the bit matrix has a "one bit" between the vertices 179 Set the bit between the vertices $u and $v; in other words, connect 180 the vertices $u and $v by an edge. The change does not get mirrored 185 Unset the bit between the vertices $u and $v; in other words, disconnect 186 the vertices $u and $v by an edge. The change does not get mirrored 191 Test the row at vertex C<u> for the vertices C<v1>, C<v2>, ..., C<vn> 196 Sets the row at vertex C<u> for the vertices [all...] |
H A D | TransitiveClosure.pm | 23 ( vertices => [ $g->vertices ] ) : ( ) ); 33 for my $u ($tcg->vertices) { 35 for my $v ($tcg->vertices) { 112 (lengths and vertices) between vertices, and after that query the 113 transitiveness between vertices by using the C<is_reachable()> and
|
H A D | AdjacencyMatrix.pm | 18 my @V = $g->vertices; 92 sub vertices { subroutine 133 my @V = $am->vertices(); 139 query the adjacencyness between vertices by using the C<is_adjacent()> 140 method, or query the distance between vertices by using the 193 Return the distance between the vertices $u and $v, or C<undef> if 194 the vertices are not adjacent. 200 =item vertices 202 Return the list of vertices (useful for indexing the adjacency matrix).
|
H A D | Traversal.pm | 12 $self->{ unseen } = { map { $_ => $_ } $self->{ graph }->vertices }; 481 $u and $v are vertices, and the $self is the traversal object itself. 529 Called for vertices in preorder. 536 Called for vertices in postorder. 543 reference with the unseen vertices as keys. 550 the unseen vertices as keys. If you want only the first reachable 559 Set this to true if you want the vertices to be processed in 564 Set this to true if you want the vertices to be processed in 583 Return the unseen vertices in random order. 587 Return the seen vertices i [all...] |
H A D | Matrix.pm | 10 my @V = $g->vertices;
|
H A D | UnionFind.pm | 95 # Add the vertices to the data structure. 99 # Join the partitions of the vertices. 102 # Find the partitions the vertices belong to 125 vertices once you have 'unioned' them. This means that if you 144 Add the edge u-v to the union-find. Also implicitly adds the vertices. 169 Return true of the vertices belong to the same union-find partition
|
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Graph/ |
H A D | BitMatrix.pm | 15 my @V = $g->vertices; 111 sub vertices { subroutine 137 $a->vertices() 173 Return true if the bit matrix has a "one bit" between the vertices 179 Set the bit between the vertices $u and $v; in other words, connect 180 the vertices $u and $v by an edge. The change does not get mirrored 185 Unset the bit between the vertices $u and $v; in other words, disconnect 186 the vertices $u and $v by an edge. The change does not get mirrored 191 Test the row at vertex C<u> for the vertices C<v1>, C<v2>, ..., C<vn> 196 Sets the row at vertex C<u> for the vertices [all...] |
H A D | TransitiveClosure.pm | 25 ( vertices => [ $g->vertices ] ) : ( ) ); 35 for my $u ($tcg->vertices) { 37 for my $v ($tcg->vertices) { 114 (lengths and vertices) between vertices, and after that query the 115 transitiveness between vertices by using the C<is_reachable()> and
|
H A D | AdjacencyMatrix.pm | 18 my @V = $g->vertices; 92 sub vertices { subroutine 133 my @V = $am->vertices(); 139 query the adjacencyness between vertices by using the C<is_adjacent()> 140 method, or query the distance between vertices by using the 193 Return the distance between the vertices $u and $v, or C<undef> if 194 the vertices are not adjacent. 200 =item vertices 202 Return the list of vertices (useful for indexing the adjacency matrix).
|
H A D | Traversal.pm | 12 $self->{ unseen } = { map { $_ => $_ } $self->{ graph }->vertices }; 481 $u and $v are vertices, and the $self is the traversal object itself. 529 Called for vertices in preorder. 536 Called for vertices in postorder. 543 reference with the unseen vertices as keys. 550 the unseen vertices as keys. If you want only the first reachable 559 Set this to true if you want the vertices to be processed in 564 Set this to true if you want the vertices to be processed in 571 next vertices as keys. Use this to provide a custom ordering for 572 choosing vertices, a [all...] |
H A D | Matrix.pm | 10 my @V = $g->vertices;
|
H A D | UnionFind.pm | 95 # Add the vertices to the data structure. 99 # Join the partitions of the vertices. 102 # Find the partitions the vertices belong to 125 vertices once you have 'unioned' them. This means that if you 144 Add the edge u-v to the union-find. Also implicitly adds the vertices. 169 Return true of the vertices belong to the same union-find partition
|
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/blackberry/ |
H A D | LayerUtilities.h | 230 Vector<UnprojectionVertex, 4> vertices(bounds.size()); 232 vertices[i].xy = bounds[i]; 233 vertices[i].w = ws[i]; 234 vertices[i].uv = toFloatSize(texCoords[i]); 238 std::sort(vertices.begin(), vertices.end(), compareManhattanDistanceToViewport); 244 const FloatPoint& p0 = vertices[i0].xy; 245 float w0 = vertices[i0].w; 246 FloatSize uv0 = vertices[i0].uv; 251 for (size_t di = 1; di + 1 < vertices [all...] |
H A D | EGLImageLayerWebKitThread.cpp | 205 static float vertices[] = { -1, -1, -1, 1, 1, 1, 1, -1 }; local 210 glVertexAttribPointer(GLES2Program::PositionAttributeIndex, 2, GL_FLOAT, GL_FALSE, 0, vertices);
|
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/filters/ |
H A D | CustomFilterMesh.cpp | 55 m_context->bufferData(GraphicsContext3D::ARRAY_BUFFER, generator.vertices().size() * sizeof(float), generator.vertices().data(), GraphicsContext3D::STATIC_DRAW);
|
H A D | CustomFilterMeshGenerator.h | 45 // and 'columns' number of columns with a total of 'rows + 1' * 'columns + 1' vertices. 50 const Vector<float>& vertices() const { return m_vertices; } function in class:WebCore::CustomFilterMeshGenerator
|
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/gpu/ |
H A D | LoopBlinnMathUtils.h | 51 // vertices a, b, and c. This test defines that points exactly on an 105 bool isConvex(const FloatPoint* vertices, int nVertices);
|
H A D | LoopBlinnPathCache.h | 53 // vertices in the mesh. 54 const float* vertices() const function in class:WebCore::LoopBlinnPathCache 64 // there are no vertices in the mesh. 81 // Base pointer to the interior vertices; two coordinates per 83 // are no interior vertices in the mesh. 97 // The number of interior edge vertices 99 // Base pointer to the interior vertices; two coordinates per 101 // no interior edge vertices in the mesh. 107 // The two-dimensional vertices of the triangle mesh.
|
/macosx-10.9.5/WebCore-7537.78.1/rendering/shapes/ |
H A D | Shape.cpp | 63 static PassOwnPtr<Shape> createPolygonShape(PassOwnPtr<Vector<FloatPoint> > vertices, WindRule fillRule) argument 65 return adoptPtr(new PolygonShape(vertices, fillRule)); 161 OwnPtr<Vector<FloatPoint> > vertices = adoptPtr(new Vector<FloatPoint>(valuesSize / 2)); local 166 (*vertices)[i / 2] = physicalPointToLogical(vertex, logicalBoxSize.height(), writingMode); 169 shape = createPolygonShape(vertices.release(), polygon->windRule());
|
H A D | PolygonShape.h | 86 PolygonShape(PassOwnPtr<Vector<FloatPoint> > vertices, WindRule fillRule) argument 88 , m_polygon(vertices, fillRule)
|
H A D | PolygonShape.cpp | 111 static inline void appendArc(Vector<FloatPoint>& vertices, const FloatPoint& arcCenter, float arcRadius, const FloatPoint& startArcVertex, const FloatPoint& endArcVertex, bool padding) argument 124 vertices.append(startArcVertex); 127 vertices.append(arcCenter + FloatPoint(cos(angle) * arcRadius, sin(angle) * arcRadius)); 129 vertices.append(endArcVertex); 132 static inline void snapVerticesToLayoutUnitGrid(Vector<FloatPoint>& vertices) argument 134 for (unsigned i = 0; i < vertices.size(); ++i) 135 vertices[i].set(LayoutUnit(vertices[i].x()).toFloat(), LayoutUnit(vertices[i].y()).toFloat());
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/math/ |
H A D | optimize.tcl | 665 set vertices [list $startx] 674 lappend vertices [lreplace $startx $i $i $x1] 683 lappend vertices [lreplace $startx $i $i [expr { $x0 + $s }]] 691 foreach x $vertices { 704 # Loop adjusting the simplex in the 'vertices' array. 760 foreach v $vertices { 780 foreach x0 [lindex $vertices $iTop] x1 $centroid { 813 lset vertices $iTop $trial2 820 lset vertices $iTop $trial 830 lset vertices [all...] |
/macosx-10.9.5/CPANInternal-140/Graph/lib/Graph/TransitiveClosure/ |
H A D | Matrix.pm | 11 my @V = $g->vertices; 286 sub vertices { subroutine 358 $tcm->vertices 364 paths (lengths and vertices) between vertices, and after that query 365 the transitiveness between vertices by using the C<is_reachable()> and 436 Return the minimum path (as a list of vertices) from the vertex $u to 442 Return true if the transitive closure matrix has all the listed vertices, 450 =item vertices 452 Return the list of vertices i [all...] |
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Graph/TransitiveClosure/ |
H A D | Matrix.pm | 11 my @V = $g->vertices; 286 sub vertices { subroutine 360 my @v = $tcm->vertices 366 paths (lengths and vertices) between vertices, and after that query 367 the transitiveness between vertices by using the C<is_reachable()> and 438 Return the minimum path (as a list of vertices) from the vertex $u to 444 Return true if the transitive closure matrix has all the listed vertices, 452 =item vertices 454 Return the list of vertices i [all...] |
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/ |
H A D | FloatPolygon.h | 52 FloatPolygon(PassOwnPtr<Vector<FloatPoint> > vertices, WindRule fillRule); 130 // is defined by 3 or more colinear vertices, index2 can be the the index of the last colinear vertex.
|