Safe Haskell	None
Language	Haskell2010

Spark.Core.Internal.Paths

Synopsis

Documentation

class HasNodeName v where Source #

Minimal complete definition

getNodeName, assignPath

Methods

getNodeName :: v -> NodeName Source #

assignPath :: v -> NodePath -> v Source #

data PathEdge Source #

The types of edges for the calculation of paths. - same level parent -> the node should have the same prefix as its parents - inner edge -> the parent defines the scope of this node

Constructors

SameLevelEdge
InnerEdge

Instances

Eq PathEdge Source #
Methods (==) :: PathEdge -> PathEdge -> Bool # (/=) :: PathEdge -> PathEdge -> Bool #
Show PathEdge Source #
Methods showsPrec :: Int -> PathEdge -> ShowS # show :: PathEdge -> String # showList :: [PathEdge] -> ShowS #

computePaths :: (HasCallStack, HasNodeName v) => ComputeDag v PathEdge -> Try (Map VertexId NodePath) Source #

assignPaths' :: (HasCallStack, HasNodeName v) => Map VertexId NodePath -> ComputeDag v e -> ComputeDag v e Source #

type Scopes = Map (Maybe VertexId) (Set VertexId) Source #

data ParentSplit a Source #

Constructors

ParentSplit
Fields psLogical :: ![Vertex a] psInner :: ![Vertex a]

Instances

Show a => Show (ParentSplit a) Source #
Methods showsPrec :: Int -> ParentSplit a -> ShowS # show :: ParentSplit a -> String # showList :: [ParentSplit a] -> ShowS #

mergeScopes :: Scopes -> Scopes -> Scopes Source #

gatherPaths :: Scopes -> Map VertexId [[VertexId]] Source #

iGetScopes0 :: forall a. Show a => [Vertex a] -> (Vertex a -> ParentSplit a) -> Scopes Source #