Home
last modified time | relevance | path

Searched refs:replaceVertex (Results 1 – 25 of 85) sorted by relevance

1234

/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/
H A DAPI.hs127 , replaceVertex :: forall a. c a => a -> a -> g a -> g a
205 , replaceVertex = AM.replaceVertex function
281 , replaceVertex = G.replaceVertex function
330 , replaceVertex = UG.replaceVertex function
396 , replaceVertex = coerce AIM.replaceVertex function
466 , replaceVertex = R.replaceVertex function
537 , replaceVertex = SR.replaceVertex function
593 , replaceVertex = LG.replaceVertex function
651 , replaceVertex = LAM.replaceVertex function
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/client/include/world/bsp/
H A Dlinesegment.h550 void replaceVertex(int to, Vertex &newVertex);
552 inline void replaceFrom(Vertex &newVertex) { replaceVertex(From, newVertex); } in replaceFrom()
553 inline void replaceTo (Vertex &newVertex) { replaceVertex(To , newVertex); } in replaceTo()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/Relation/
H A DSymmetric.hs37 removeVertex, removeEdge, replaceVertex, mergeVertices, gmap, induce, induceJust,
564 replaceVertex :: Ord a => a -> a -> Relation a -> Relation a
565 replaceVertex = coerce R.replaceVertex function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/NonEmpty/
H A DAdjacencyMap.hs44 removeVertex1, removeEdge, replaceVertex, mergeVertices, transpose, gmap,
563 replaceVertex :: Ord a => a -> a -> AdjacencyMap a -> AdjacencyMap a
564 replaceVertex = coerce AM.replaceVertex function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/
H A DUndirected.hs47 removeVertex, removeEdge, replaceVertex, mergeVertices, induce, induceJust,
750 replaceVertex :: Eq a => a -> a -> Graph a -> Graph a
751 replaceVertex = coerce21 G.replaceVertex function
H A DAdjacencyIntMap.hs39 removeVertex, removeEdge, replaceVertex, mergeVertices, transpose, gmap,
695 replaceVertex :: Int -> Int -> AdjacencyIntMap -> AdjacencyIntMap
696 replaceVertex u v = gmap $ \w -> if w == u then v else w function
H A DAdjacencyMap.hs40 removeVertex, removeEdge, replaceVertex, mergeVertices, transpose, gmap,
679 replaceVertex :: Ord a => a -> a -> AdjacencyMap a -> AdjacencyMap a
680 replaceVertex u v = gmap $ \w -> if w == u then v else w function
H A DLabelled.hs33 removeVertex, removeEdge, replaceVertex, replaceEdge, transpose, emap,
433 replaceVertex :: Eq a => a -> a -> Graph e a -> Graph e a
434 replaceVertex u v = fmap $ \w -> if w == u then v else w function
H A DRelation.hs35 removeVertex, removeEdge, replaceVertex, mergeVertices, transpose, gmap,
650 replaceVertex :: Ord a => a -> a -> Relation a -> Relation a
651 replaceVertex u v = gmap $ \w -> if w == u then v else w function
H A DNonEmpty.hs49 removeVertex1, removeEdge, replaceVertex, mergeVertices, splitVertex1,
769 replaceVertex :: Eq a => a -> a -> Graph a -> Graph a
770 replaceVertex u v = fmap $ \w -> if w == u then v else w function
/dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/
H A DInbetweenEdge.cpp327 beforePath_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
328 afterPath_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
329 beforeCycle_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
330 afterCycle_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
331 startAnimatedVertex_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
332 endAnimatedVertex_.replaceVertex(oldVertex,newVertex); in updateBoundary_impl()
H A DAnimatedVertex.h70 void replaceVertex(KeyVertex * oldVertex, KeyVertex * newVertex);
H A DPath.h92 void replaceVertex(KeyVertex * oldVertex, KeyVertex * newVertex);
H A DCycle.h88 void replaceVertex(KeyVertex * oldVertex, KeyVertex * newVertex);
H A DAnimatedCycle.h128 void replaceVertex(KeyVertex * oldVertex, KeyVertex * newVertex);
H A DAnimatedVertex.cpp101 void AnimatedVertex::replaceVertex(KeyVertex * , KeyVertex * ) in replaceVertex() function in VectorAnimationComplex::AnimatedVertex
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/HigherKinded/
H A DClass.hs52 removeVertex, replaceVertex, mergeVertices, splitVertex, induce
501 replaceVertex :: (Eq a, Graph g) => a -> a -> g a -> g a
502 replaceVertex u v = fmap $ \w -> if w == u then v else w function
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/client/src/world/bsp/
H A Dlinesegment.cpp363 void replaceVertex(int edge, Vertex &newVertex) in DENG2_PIMPL()
416 void LineSegment::replaceVertex(int to, Vertex &newVertex) in replaceVertex() function in world::bsp::LineSegment
418 d->replaceVertex(to, newVertex); in replaceVertex()
/dports/cad/ldview/ldview-4.4/TRE/
H A DTREVertexArray.h28 virtual bool replaceVertex(const TREVertex &vertex, unsigned int index);
H A DTREVertexArray.cpp148 bool TREVertexArray::replaceVertex(const TREVertex &vertex, unsigned int index) in replaceVertex() function in TREVertexArray
/dports/math/fcl/fcl-0.7.0/include/fcl/geometry/bvh/
H A DBVH_model.h119 int replaceVertex(const Vector3<S>& p);
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/NonEmpty/
H A DGraph.hs565 replaceVertex x x y == y
568 replaceVertex x y (vertex x) == vertex y
571 replaceVertex x y z == mergeVertices (== x) y z
578 mergeVertices (== x) y z == replaceVertex x y z
591 splitVertex1 x [y] z == replaceVertex x y z
H A DAdjacencyMap.hs488 replaceVertex x x y == y
491 replaceVertex x y (vertex x) == vertex y
494 replaceVertex x y z == mergeVertices (== x) y z
501 mergeVertices (== x) y z == replaceVertex x y z
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/Labelled/
H A DAdjacencyMap.hs58 test "replaceVertex" $ \x y z -> consistent (replaceVertex x y z :: LAS)
328 replaceVertex x x y == (y :: LAS)
331 replaceVertex x y (vertex x) == (vertex y :: LAS)
334 replaceVertex x y z == gmap (\v -> if v == x then y else v) z
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/Labelled/
H A DAdjacencyMap.hs35 removeVertex, removeEdge, replaceVertex, replaceEdge, transpose, gmap,
498 replaceVertex :: (Eq e, Monoid e, Ord a) => a -> a -> AdjacencyMap e a -> AdjacencyMap e a
499 replaceVertex u v = gmap $ \w -> if w == u then v else w function

1234