Data.Greskell.Graph

This module defines types and functions about TinkerPop graph structure API.

Element

class ElementData e => Element e

org.apache.tinkerpop.gremlin.structure.Element interface in a TinkerPop graph.

Since greskell-1.0.0.0, ElementData is a super-class of Element.

Associated Types

type ElementProperty e :: * -> *

Property type of the Element. It should be of Property class.

type ElementPropertyContainer e :: * -> *

Container type of the properties of the Element. It should be of NonEmptyLike class.

Since: 1.0.0.0

Instances

Element AEdge

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty AEdge :: Type -> Type

type ElementPropertyContainer AEdge :: Type -> Type

Element AVertex

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty AVertex :: Type -> Type

type ElementPropertyContainer AVertex :: Type -> Type

Element (AVertexProperty v)

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty (AVertexProperty v) :: Type -> Type

type ElementPropertyContainer (AVertexProperty v) :: Type -> Type

class ElementData e where

Types that keep reference to TinkerPop graph Elements.

Since: 1.0.0.0

Methods

elementId :: e -> ElementID e

ID of this Element.

elementLabel :: e -> Text

Label of this Element.

Instances

ElementData AEdge

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AEdge -> ElementID AEdge

elementLabel :: AEdge -> Text

ElementData AVertex

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AVertex -> ElementID AVertex

elementLabel :: AVertex -> Text

ElementData (AVertexProperty v)

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AVertexProperty v -> ElementID (AVertexProperty v)

elementLabel :: AVertexProperty v -> Text

newtype ElementID e

ID of a graph element e (vertex, edge and vertex property).

Since: 1.0.0.0

Constructors

ElementID

Fields

• unElementID :: GValue

  Although it's exposed, it is recommended NOT to rely on the internal of ElementID. That's because it depends on graph implementation.

Instances

Functor ElementID

Unsafely convert the element type.

Defined in Data.Greskell.Graph

Methods

fmap :: (a -> b) -> ElementID a -> ElementID b

(<$) :: a -> ElementID b -> ElementID a

Eq (ElementID e)

Defined in Data.Greskell.Graph

Methods

(==) :: ElementID e -> ElementID e -> Bool

(/=) :: ElementID e -> ElementID e -> Bool

Show (ElementID e)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> ElementID e -> ShowS

show :: ElementID e -> String

showList :: [ElementID e] -> ShowS

Generic (ElementID e)

Defined in Data.Greskell.Graph

Associated Types

type Rep (ElementID e) :: Type -> Type

Methods

from :: ElementID e -> Rep (ElementID e) x

to :: Rep (ElementID e) x -> ElementID e

Hashable (ElementID e)

Defined in Data.Greskell.Graph

Methods

hashWithSalt :: Int -> ElementID e -> Int

hash :: ElementID e -> Int

ToJSON (ElementID e)

Defined in Data.Greskell.Graph

Methods

toJSON :: ElementID e -> Value

toEncoding :: ElementID e -> Encoding

toJSONList :: [ElementID e] -> Value

toEncodingList :: [ElementID e] -> Encoding

FromJSON (ElementID e)

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser (ElementID e)

parseJSONList :: Value -> Parser [ElementID e]

FromGraphSON (ElementID e)

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser (ElementID e)

type Rep (ElementID e)

Defined in Data.Greskell.Graph

type Rep (ElementID e) = D1 (MetaData "ElementID" "Data.Greskell.Graph" "greskell-1.1.0.3-FPFCjtlN1JF4GTIpDeb64d" True) (C1 (MetaCons "ElementID" PrefixI True) (S1 (MetaSel (Just "unElementID") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 GValue)))

unsafeCastElementID :: ElementID a -> ElementID b

Unsafely cast the phantom type of ElementID.

Since: 1.0.0.0

class Element v => Vertex v

org.apache.tinkerpop.gremlin.structure.Vertex interface in a TinkerPop graph.

Instances

Vertex AVertex

Defined in Data.Greskell.Graph

class Element e => Edge e

org.apache.tinkerpop.gremlin.structure.Edge interface in a TinkerPop graph.

Instances

Edge AEdge

Defined in Data.Greskell.Graph

Property

class Property p where

org.apache.tinkerpop.gremlin.structure.Property interface in a TinkerPop graph.

Methods

propertyKey :: p v -> Text

Get key of this property.

propertyValue :: p v -> v

Get value of this property.

Instances

Property AVertexProperty

Defined in Data.Greskell.Graph

Methods

propertyKey :: AVertexProperty v -> Text

propertyValue :: AVertexProperty v -> v

Property AProperty

Defined in Data.Greskell.Graph

Methods

propertyKey :: AProperty v -> Text

propertyValue :: AProperty v -> v

T Enum

data T a b

org.apache.tinkerpop.gremlin.structure.T enum.

T is a token to get data b from an Element a.

Instances

ProjectionLike (Greskell (T s e))

Defined in Data.Greskell.GTraversal

Associated Types

type ProjectionLikeStart (Greskell (T s e)) :: Type

type ProjectionLikeEnd (Greskell (T s e)) :: Type

GraphSONTyped (T a b)

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: T a b -> Text

type ProjectionLikeStart (Greskell (T s e))

Defined in Data.Greskell.GTraversal

type ProjectionLikeStart (Greskell (T s e)) = s

type ProjectionLikeEnd (Greskell (T s e))

Defined in Data.Greskell.GTraversal

type ProjectionLikeEnd (Greskell (T s e)) = e

tId :: Element a => Greskell (T a (ElementID a))

T.id token.

tKey :: (Element (p v), Property p) => Greskell (T (p v) Text)

T.key token.

tLabel :: Element a => Greskell (T a Text)

T.label token.

tValue :: (Element (p v), Property p) => Greskell (T (p v) v)

T.value token.

Cardinality Enum

data Cardinality

org.apache.tinkerpop.gremlin.structure.VertexProperty.Cardinality enum.

Since: 0.2.0.0

cList :: Greskell Cardinality

list Cardinality.

>>> toGremlin cList
"list"

Since: 0.2.0.0

cSet :: Greskell Cardinality

set Cardinality.

Since: 0.2.0.0

cSingle :: Greskell Cardinality

single Cardinality.

Since: 0.2.0.0

Typed Key (accessor of a Property)

newtype Key a b

A property key accessing value b in an Element a. In Gremlin, it's just a String type.

>>> toGremlin ("age" :: Key AVertex Int)
"\"age\""
>>> toGremlin (key "created_at" :: Key AEdge Text)
"\"created_at\""
>>> keyText ("name" :: Key AVertex Text)
"name"

Since greskell-1.0.0.0, Key is newtype of Text. Before that, it was newtype of Greskell Text.

Constructors

Key

Fields

• unKey :: Text

Instances

Functor (Key a)

Unsafely convert the value type b.

Defined in Data.Greskell.Graph

Methods

fmap :: (a0 -> b) -> Key a a0 -> Key a b

(<$) :: a0 -> Key a b -> Key a a0

Eq (Key a b)

Defined in Data.Greskell.Graph

Methods

(==) :: Key a b -> Key a b -> Bool

(/=) :: Key a b -> Key a b -> Bool

Show (Key a b)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> Key a b -> ShowS

show :: Key a b -> String

showList :: [Key a b] -> ShowS

IsString (Key a b)

Defined in Data.Greskell.Graph

Methods

fromString :: String -> Key a b

ToGreskell (Key a b)

Return Gremlin String literal.

Defined in Data.Greskell.Graph

Associated Types

type GreskellReturn (Key a b) :: Type

Methods

toGreskell :: Key a b -> Greskell (GreskellReturn (Key a b))

PMapKey (Key a b)

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Associated Types

type PMapValue (Key a b) :: Type

Methods

keyText :: Key a b -> Text

ProjectionLike (Key s e)

Defined in Data.Greskell.GTraversal

Associated Types

type ProjectionLikeStart (Key s e) :: Type

type ProjectionLikeEnd (Key s e) :: Type

type GreskellReturn (Key a b)

Defined in Data.Greskell.Graph

type GreskellReturn (Key a b) = Text

type PMapValue (Key a b)

Defined in Data.Greskell.Graph

type PMapValue (Key a b) = b

type ProjectionLikeStart (Key s e)

Defined in Data.Greskell.GTraversal

type ProjectionLikeStart (Key s e) = s

type ProjectionLikeEnd (Key s e)

Defined in Data.Greskell.GTraversal

type ProjectionLikeEnd (Key s e) = e

key :: Text -> Key a b

Create a Key a text.

unsafeCastKey :: Key a1 b1 -> Key a2 b2

Unsafely cast the type signature of the Key.

Since: 1.0.0.0

Key-value pair

data KeyValue a where

Pair of Key and its value. Mainly used for writing properties into the database.

Type a is the type of Element that keeps the KeyValue pair. It drops the type of the value, so that you can construct a heterogeneous list of key-value pairs for a given Element.

Since: 0.2.0.0

Constructors

KeyValue :: Key a b -> Greskell b -> KeyValue a

Key and value

KeyNoValue :: Key a b -> KeyValue a

Key without value

Since: 1.0.0.0

(=:) :: Key a b -> Greskell b -> KeyValue a

Constructor operator of KeyValue.

Since: 0.2.0.0

Heterogeneous list of keys

data Keys a where

Heterogeneous list of Keys. It keeps the parent type a, but discards the value type b.

Since: 1.0.0.0

Constructors

KeysNil :: Keys a

Empty Keys.

KeysCons :: Key a b -> Keys a -> Keys a

Add a Key to Keys.

Instances

Semigroup (Keys a)

Defined in Data.Greskell.Graph

Methods

(<>) :: Keys a -> Keys a -> Keys a

sconcat :: NonEmpty (Keys a) -> Keys a

stimes :: Integral b => b -> Keys a -> Keys a

Monoid (Keys a)

Defined in Data.Greskell.Graph

Methods

mempty :: Keys a

mappend :: Keys a -> Keys a -> Keys a

mconcat :: [Keys a] -> Keys a

singletonKeys :: Key a b -> Keys a

Keys with a single Key.

Since: 1.0.0.0

(-:) :: Key a b -> Keys a -> Keys a infixr 5

Prepend a Key to Keys.

Since: 1.0.0.0

Path

newtype Path a

org.apache.tinkerpop.gremlin.process.traversal.Path interface.

Since: 1.1.0.0

Constructors

Path

Fields

• unPath :: [PathEntry a]

Instances

Functor Path

Defined in Data.Greskell.Graph

Methods

fmap :: (a -> b) -> Path a -> Path b

(<$) :: a -> Path b -> Path a

Foldable Path

Defined in Data.Greskell.Graph

Methods

fold :: Monoid m => Path m -> m

foldMap :: Monoid m => (a -> m) -> Path a -> m

foldr :: (a -> b -> b) -> b -> Path a -> b

foldr' :: (a -> b -> b) -> b -> Path a -> b

foldl :: (b -> a -> b) -> b -> Path a -> b

foldl' :: (b -> a -> b) -> b -> Path a -> b

foldr1 :: (a -> a -> a) -> Path a -> a

foldl1 :: (a -> a -> a) -> Path a -> a

toList :: Path a -> [a]

null :: Path a -> Bool

length :: Path a -> Int

elem :: Eq a => a -> Path a -> Bool

maximum :: Ord a => Path a -> a

minimum :: Ord a => Path a -> a

sum :: Num a => Path a -> a

product :: Num a => Path a -> a

Traversable Path

Defined in Data.Greskell.Graph

Methods

traverse :: Applicative f => (a -> f b) -> Path a -> f (Path b)

sequenceA :: Applicative f => Path (f a) -> f (Path a)

mapM :: Monad m => (a -> m b) -> Path a -> m (Path b)

sequence :: Monad m => Path (m a) -> m (Path a)

Eq a => Eq (Path a)

Defined in Data.Greskell.Graph

Methods

(==) :: Path a -> Path a -> Bool

(/=) :: Path a -> Path a -> Bool

Ord a => Ord (Path a)

Defined in Data.Greskell.Graph

Methods

compare :: Path a -> Path a -> Ordering

(<) :: Path a -> Path a -> Bool

(<=) :: Path a -> Path a -> Bool

(>) :: Path a -> Path a -> Bool

(>=) :: Path a -> Path a -> Bool

max :: Path a -> Path a -> Path a

min :: Path a -> Path a -> Path a

Show a => Show (Path a)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> Path a -> ShowS

show :: Path a -> String

showList :: [Path a] -> ShowS

Semigroup (Path a)

Defined in Data.Greskell.Graph

Methods

(<>) :: Path a -> Path a -> Path a

sconcat :: NonEmpty (Path a) -> Path a

stimes :: Integral b => b -> Path a -> Path a

Monoid (Path a)

Defined in Data.Greskell.Graph

Methods

mempty :: Path a

mappend :: Path a -> Path a -> Path a

mconcat :: [Path a] -> Path a

FromGraphSON a => FromJSON (Path a)

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser (Path a)

parseJSONList :: Value -> Parser [Path a]

AsIterator (Path a)

Path is an Iterable that emits its objects of type a.

Defined in Data.Greskell.Graph

Associated Types

type IteratorItem (Path a) :: Type

FromGraphSON a => FromGraphSON (Path a)

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser (Path a)

GraphSONTyped (Path a)

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: Path a -> Text

type IteratorItem (Path a)

Defined in Data.Greskell.Graph

type IteratorItem (Path a) = a

data PathEntry a

An entry in a Path.

Since: 1.1.0.0

Constructors

PathEntry

Fields

• peLabels :: HashSet (AsLabel a)
• peObject :: a

Instances

Functor PathEntry

Defined in Data.Greskell.Graph

Methods

fmap :: (a -> b) -> PathEntry a -> PathEntry b

(<$) :: a -> PathEntry b -> PathEntry a

Foldable PathEntry

Defined in Data.Greskell.Graph

Methods

fold :: Monoid m => PathEntry m -> m

foldMap :: Monoid m => (a -> m) -> PathEntry a -> m

foldr :: (a -> b -> b) -> b -> PathEntry a -> b

foldr' :: (a -> b -> b) -> b -> PathEntry a -> b

foldl :: (b -> a -> b) -> b -> PathEntry a -> b

foldl' :: (b -> a -> b) -> b -> PathEntry a -> b

foldr1 :: (a -> a -> a) -> PathEntry a -> a

foldl1 :: (a -> a -> a) -> PathEntry a -> a

toList :: PathEntry a -> [a]

null :: PathEntry a -> Bool

length :: PathEntry a -> Int

elem :: Eq a => a -> PathEntry a -> Bool

maximum :: Ord a => PathEntry a -> a

minimum :: Ord a => PathEntry a -> a

sum :: Num a => PathEntry a -> a

product :: Num a => PathEntry a -> a

Traversable PathEntry

Defined in Data.Greskell.Graph

Methods

traverse :: Applicative f => (a -> f b) -> PathEntry a -> f (PathEntry b)

sequenceA :: Applicative f => PathEntry (f a) -> f (PathEntry a)

mapM :: Monad m => (a -> m b) -> PathEntry a -> m (PathEntry b)

sequence :: Monad m => PathEntry (m a) -> m (PathEntry a)

Eq a => Eq (PathEntry a)

Defined in Data.Greskell.Graph

Methods

(==) :: PathEntry a -> PathEntry a -> Bool

(/=) :: PathEntry a -> PathEntry a -> Bool

Ord a => Ord (PathEntry a)

Defined in Data.Greskell.Graph

Methods

compare :: PathEntry a -> PathEntry a -> Ordering

(<) :: PathEntry a -> PathEntry a -> Bool

(<=) :: PathEntry a -> PathEntry a -> Bool

(>) :: PathEntry a -> PathEntry a -> Bool

(>=) :: PathEntry a -> PathEntry a -> Bool

max :: PathEntry a -> PathEntry a -> PathEntry a

min :: PathEntry a -> PathEntry a -> PathEntry a

Show a => Show (PathEntry a)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> PathEntry a -> ShowS

show :: PathEntry a -> String

showList :: [PathEntry a] -> ShowS

pathToPMap :: Path a -> PMap Multi a

Convert a Path into PMap.

In the result PMap, the keys are the labels in the Path, and the values are the objects associated with the labels. The values are stored in the same order in the Path. Objects without any label are discarded.

Since: 1.1.0.0

makePathEntry

Arguments

:: [AsLabel a]

labels

-> a

object

-> PathEntry a

Make a PathEntry.

Since: 1.1.0.0

Concrete data types

Graph structure data types based on Aeson.

You can use those types directly in your programs. You can also define your own graph types by wrapping those with newtype. See README.md for detail.

Historical note:

• Since version 1.0.0.0, the concrete data types don't keep properties, and IDs are of ElementID type.
• In version 0.1.1.0 and before, these conrete data types were based on GraphSON Value. In version 0.2.0.0, this was changed to GValue, so that it can parse nested data structures encoded in GraphSON.

Vertex

data AVertex

General vertex type you can use for Vertex class.

Constructors

AVertex

Fields

• avId :: ElementID AVertex

  ID of this vertex

• avLabel :: Text

  Label of this vertex

Instances

Eq AVertex

Defined in Data.Greskell.Graph

Methods

(==) :: AVertex -> AVertex -> Bool

(/=) :: AVertex -> AVertex -> Bool

Show AVertex

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> AVertex -> ShowS

show :: AVertex -> String

showList :: [AVertex] -> ShowS

FromJSON AVertex

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser AVertex

parseJSONList :: Value -> Parser [AVertex]

FromGraphSON AVertex

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser AVertex

GraphSONTyped AVertex

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: AVertex -> Text

Vertex AVertex

Defined in Data.Greskell.Graph

Element AVertex

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty AVertex :: Type -> Type

type ElementPropertyContainer AVertex :: Type -> Type

ElementData AVertex

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AVertex -> ElementID AVertex

elementLabel :: AVertex -> Text

type ElementProperty AVertex

Defined in Data.Greskell.Graph

type ElementProperty AVertex = AVertexProperty

type ElementPropertyContainer AVertex

Defined in Data.Greskell.Graph

type ElementPropertyContainer AVertex = Multi

Edge

data AEdge

General edge type you can use for Edge class.

Constructors

AEdge

Fields

• aeId :: ElementID AEdge

  ID of this edge.

• aeLabel :: Text

  Label of this edge.

Instances

Eq AEdge

Defined in Data.Greskell.Graph

Methods

(==) :: AEdge -> AEdge -> Bool

(/=) :: AEdge -> AEdge -> Bool

Show AEdge

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> AEdge -> ShowS

show :: AEdge -> String

showList :: [AEdge] -> ShowS

FromJSON AEdge

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser AEdge

parseJSONList :: Value -> Parser [AEdge]

FromGraphSON AEdge

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser AEdge

GraphSONTyped AEdge

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: AEdge -> Text

Edge AEdge

Defined in Data.Greskell.Graph

Element AEdge

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty AEdge :: Type -> Type

type ElementPropertyContainer AEdge :: Type -> Type

ElementData AEdge

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AEdge -> ElementID AEdge

elementLabel :: AEdge -> Text

type ElementProperty AEdge

Defined in Data.Greskell.Graph

type ElementProperty AEdge = AProperty

type ElementPropertyContainer AEdge

Defined in Data.Greskell.Graph

type ElementPropertyContainer AEdge = Single

VertexProperty

data AVertexProperty v

General vertex property type you can use for VertexProperty.

If you are not sure about the type v, just use GValue.

Constructors

AVertexProperty

Fields

• avpId :: ElementID (AVertexProperty v)

  ID of this vertex property.

• avpLabel :: Text

  Label and key of this vertex property.

• avpValue :: v

  Value of this vertex property.

Instances

Functor AVertexProperty

Map the property value.

Defined in Data.Greskell.Graph

Methods

fmap :: (a -> b) -> AVertexProperty a -> AVertexProperty b

(<$) :: a -> AVertexProperty b -> AVertexProperty a

Foldable AVertexProperty

Defined in Data.Greskell.Graph

Methods

fold :: Monoid m => AVertexProperty m -> m

foldMap :: Monoid m => (a -> m) -> AVertexProperty a -> m

foldr :: (a -> b -> b) -> b -> AVertexProperty a -> b

foldr' :: (a -> b -> b) -> b -> AVertexProperty a -> b

foldl :: (b -> a -> b) -> b -> AVertexProperty a -> b

foldl' :: (b -> a -> b) -> b -> AVertexProperty a -> b

foldr1 :: (a -> a -> a) -> AVertexProperty a -> a

foldl1 :: (a -> a -> a) -> AVertexProperty a -> a

toList :: AVertexProperty a -> [a]

null :: AVertexProperty a -> Bool

length :: AVertexProperty a -> Int

elem :: Eq a => a -> AVertexProperty a -> Bool

maximum :: Ord a => AVertexProperty a -> a

minimum :: Ord a => AVertexProperty a -> a

sum :: Num a => AVertexProperty a -> a

product :: Num a => AVertexProperty a -> a

Traversable AVertexProperty

Traverse the property value.

Defined in Data.Greskell.Graph

Methods

traverse :: Applicative f => (a -> f b) -> AVertexProperty a -> f (AVertexProperty b)

sequenceA :: Applicative f => AVertexProperty (f a) -> f (AVertexProperty a)

mapM :: Monad m => (a -> m b) -> AVertexProperty a -> m (AVertexProperty b)

sequence :: Monad m => AVertexProperty (m a) -> m (AVertexProperty a)

Property AVertexProperty

Defined in Data.Greskell.Graph

Methods

propertyKey :: AVertexProperty v -> Text

propertyValue :: AVertexProperty v -> v

Eq v => Eq (AVertexProperty v)

Defined in Data.Greskell.Graph

Methods

(==) :: AVertexProperty v -> AVertexProperty v -> Bool

(/=) :: AVertexProperty v -> AVertexProperty v -> Bool

Show v => Show (AVertexProperty v)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> AVertexProperty v -> ShowS

show :: AVertexProperty v -> String

showList :: [AVertexProperty v] -> ShowS

FromGraphSON v => FromJSON (AVertexProperty v)

In version 0.1.1.0 and before, the constraint was FromJSON v. This has changed.

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser (AVertexProperty v)

parseJSONList :: Value -> Parser [AVertexProperty v]

FromGraphSON v => FromGraphSON (AVertexProperty v)

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser (AVertexProperty v)

GraphSONTyped (AVertexProperty v)

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: AVertexProperty v -> Text

Element (AVertexProperty v)

Defined in Data.Greskell.Graph

Associated Types

type ElementProperty (AVertexProperty v) :: Type -> Type

type ElementPropertyContainer (AVertexProperty v) :: Type -> Type

ElementData (AVertexProperty v)

Since: 1.0.0.0

Defined in Data.Greskell.Graph

Methods

elementId :: AVertexProperty v -> ElementID (AVertexProperty v)

elementLabel :: AVertexProperty v -> Text

FromGraphSON v => FromGraphSONWithKey (AVertexProperty v)

Defined in Data.Greskell.Graph.PropertyMap

Methods

parseGraphSONWithKey :: Text -> GValue -> Parser (AVertexProperty v)

type ElementProperty (AVertexProperty v)

Defined in Data.Greskell.Graph

type ElementProperty (AVertexProperty v) = AProperty

type ElementPropertyContainer (AVertexProperty v)

Defined in Data.Greskell.Graph

type ElementPropertyContainer (AVertexProperty v) = Single

Property

data AProperty v

General simple property type you can use for Property class.

If you are not sure about the type v, just use GValue.

Constructors

AProperty

Fields

• apKey :: Text
• apValue :: v

Instances

Functor AProperty

Defined in Data.Greskell.Graph

Methods

fmap :: (a -> b) -> AProperty a -> AProperty b

(<$) :: a -> AProperty b -> AProperty a

Foldable AProperty

Defined in Data.Greskell.Graph

Methods

fold :: Monoid m => AProperty m -> m

foldMap :: Monoid m => (a -> m) -> AProperty a -> m

foldr :: (a -> b -> b) -> b -> AProperty a -> b

foldr' :: (a -> b -> b) -> b -> AProperty a -> b

foldl :: (b -> a -> b) -> b -> AProperty a -> b

foldl' :: (b -> a -> b) -> b -> AProperty a -> b

foldr1 :: (a -> a -> a) -> AProperty a -> a

foldl1 :: (a -> a -> a) -> AProperty a -> a

toList :: AProperty a -> [a]

null :: AProperty a -> Bool

length :: AProperty a -> Int

elem :: Eq a => a -> AProperty a -> Bool

maximum :: Ord a => AProperty a -> a

minimum :: Ord a => AProperty a -> a

sum :: Num a => AProperty a -> a

product :: Num a => AProperty a -> a

Traversable AProperty

Defined in Data.Greskell.Graph

Methods

traverse :: Applicative f => (a -> f b) -> AProperty a -> f (AProperty b)

sequenceA :: Applicative f => AProperty (f a) -> f (AProperty a)

mapM :: Monad m => (a -> m b) -> AProperty a -> m (AProperty b)

sequence :: Monad m => AProperty (m a) -> m (AProperty a)

Property AProperty

Defined in Data.Greskell.Graph

Methods

propertyKey :: AProperty v -> Text

propertyValue :: AProperty v -> v

Eq v => Eq (AProperty v)

Defined in Data.Greskell.Graph

Methods

(==) :: AProperty v -> AProperty v -> Bool

(/=) :: AProperty v -> AProperty v -> Bool

Ord v => Ord (AProperty v)

Defined in Data.Greskell.Graph

Methods

compare :: AProperty v -> AProperty v -> Ordering

(<) :: AProperty v -> AProperty v -> Bool

(<=) :: AProperty v -> AProperty v -> Bool

(>) :: AProperty v -> AProperty v -> Bool

(>=) :: AProperty v -> AProperty v -> Bool

max :: AProperty v -> AProperty v -> AProperty v

min :: AProperty v -> AProperty v -> AProperty v

Show v => Show (AProperty v)

Defined in Data.Greskell.Graph

Methods

showsPrec :: Int -> AProperty v -> ShowS

show :: AProperty v -> String

showList :: [AProperty v] -> ShowS

FromGraphSON v => FromJSON (AProperty v)

Parse Property of GraphSON 1.0.

In version 0.1.1.0 and before, the constraint was FromJSON v. This has changed.

Defined in Data.Greskell.Graph

Methods

parseJSON :: Value -> Parser (AProperty v)

parseJSONList :: Value -> Parser [AProperty v]

FromGraphSON v => FromGraphSON (AProperty v)

Parse Property of GraphSON 1.0.

Defined in Data.Greskell.Graph

Methods

parseGraphSON :: GValue -> Parser (AProperty v)

GraphSONTyped (AProperty v)

Defined in Data.Greskell.Graph

Methods

gsonTypeFor :: AProperty v -> Text

FromGraphSON v => FromGraphSONWithKey (AProperty v)

Defined in Data.Greskell.Graph.PropertyMap

Methods

parseGraphSONWithKey :: Text -> GValue -> Parser (AProperty v)