Data.Dependency

Functions

resolveDependencies :: PackageSet Dependency -> [Dependency] -> DepM [[Dependency]]

Heuristics:

1. Always use a newer version when possible
2. Obey constraints
3. Specify an error for circular dependencies
4. Specify an error for overconstrained builds
5. Specify an error if a package is not present

This doesn't do any package resolution beyond versioning.

buildSequence :: [Dependency] -> [[Dependency]]

satisfies :: Ord a => Constraint a -> a -> Bool

compatible :: Ord a => Constraint a -> Constraint a -> Bool

Types

data Dependency

Constructors

Dependency

Fields

• _libName :: String
• _libDependencies :: [(String, Constraint Version)]
• _libVersion :: Version

Instances

Eq Dependency

Methods

(==) :: Dependency -> Dependency -> Bool

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

Ord Dependency

Methods

compare :: Dependency -> Dependency -> Ordering

(<) :: Dependency -> Dependency -> Bool

(<=) :: Dependency -> Dependency -> Bool

(>) :: Dependency -> Dependency -> Bool

(>=) :: Dependency -> Dependency -> Bool

max :: Dependency -> Dependency -> Dependency

min :: Dependency -> Dependency -> Dependency

Show Dependency

Methods

showsPrec :: Int -> Dependency -> ShowS

show :: Dependency -> String

showList :: [Dependency] -> ShowS

Generic Dependency

Associated Types

type Rep Dependency :: * -> *

Methods

from :: Dependency -> Rep Dependency x

to :: Rep Dependency x -> Dependency

NFData Dependency

Methods

rnf :: Dependency -> ()

type Rep Dependency

type Rep Dependency = D1 * (MetaData "Dependency" "Data.Dependency.Type" "dependency-0.1.0.9-1nc6be5HQ20N6N0tffMmN" False) (C1 * (MetaCons "Dependency" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "_libName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * String)) ((:*:) * (S1 * (MetaSel (Just Symbol "_libDependencies") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * [(String, Constraint Version)])) (S1 * (MetaSel (Just Symbol "_libVersion") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Version)))))

newtype PackageSet a

Constructors

PackageSet (Map String (Set a))

Instances

Foldable PackageSet

Methods

fold :: Monoid m => PackageSet m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> PackageSet a -> a

foldl1 :: (a -> a -> a) -> PackageSet a -> a

toList :: PackageSet a -> [a]

null :: PackageSet a -> Bool

length :: PackageSet a -> Int

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

maximum :: Ord a => PackageSet a -> a

minimum :: Ord a => PackageSet a -> a

sum :: Num a => PackageSet a -> a

product :: Num a => PackageSet a -> a

Eq a => Eq (PackageSet a)

Methods

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

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

Ord a => Ord (PackageSet a)

Methods

compare :: PackageSet a -> PackageSet a -> Ordering

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

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

(>) :: PackageSet a -> PackageSet a -> Bool

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

max :: PackageSet a -> PackageSet a -> PackageSet a

min :: PackageSet a -> PackageSet a -> PackageSet a

Generic (PackageSet a)

Associated Types

type Rep (PackageSet a) :: * -> *

Methods

from :: PackageSet a -> Rep (PackageSet a) x

to :: Rep (PackageSet a) x -> PackageSet a

Binary a => Binary (PackageSet a)

Methods

put :: PackageSet a -> Put

get :: Get (PackageSet a)

putList :: [PackageSet a] -> Put

type Rep (PackageSet a)

type Rep (PackageSet a) = D1 * (MetaData "PackageSet" "Data.Dependency.Type" "dependency-0.1.0.9-1nc6be5HQ20N6N0tffMmN" True) (C1 * (MetaCons "PackageSet" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Map String (Set a)))))

newtype Version

Constructors

Version [Integer]

Instances

Eq Version

Methods

(==) :: Version -> Version -> Bool

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

Ord Version

Methods

compare :: Version -> Version -> Ordering

(<) :: Version -> Version -> Bool

(<=) :: Version -> Version -> Bool

(>) :: Version -> Version -> Bool

(>=) :: Version -> Version -> Bool

max :: Version -> Version -> Version

min :: Version -> Version -> Version

Show Version

Methods

showsPrec :: Int -> Version -> ShowS

show :: Version -> String

showList :: [Version] -> ShowS

Generic Version

Associated Types

type Rep Version :: * -> *

Methods

from :: Version -> Rep Version x

to :: Rep Version x -> Version

Binary Version

Methods

put :: Version -> Put

get :: Get Version

putList :: [Version] -> Put

NFData Version

Methods

rnf :: Version -> ()

type Rep Version

type Rep Version = D1 * (MetaData "Version" "Data.Dependency.Type" "dependency-0.1.0.9-1nc6be5HQ20N6N0tffMmN" True) (C1 * (MetaCons "Version" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * [Integer])))

type DepM = Either ResolveError

data ResolveError

An error that can occur during package resolution.

Constructors

InternalError

NotPresent String

Conflict [String] String

Instances

Eq ResolveError

Methods

(==) :: ResolveError -> ResolveError -> Bool

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

Show ResolveError

Methods

showsPrec :: Int -> ResolveError -> ShowS

show :: ResolveError -> String

showList :: [ResolveError] -> ShowS

Generic ResolveError

Associated Types

type Rep ResolveError :: * -> *

Methods

from :: ResolveError -> Rep ResolveError x

to :: Rep ResolveError x -> ResolveError

Pretty ResolveError

Methods

pretty :: ResolveError -> Doc

prettyList :: [ResolveError] -> Doc

NFData ResolveError

Methods

rnf :: ResolveError -> ()

type Rep ResolveError

type Rep ResolveError = D1 * (MetaData "ResolveError" "Data.Dependency.Error" "dependency-0.1.0.9-1nc6be5HQ20N6N0tffMmN" False) ((:+:) * (C1 * (MetaCons "InternalError" PrefixI False) (U1 *)) ((:+:) * (C1 * (MetaCons "NotPresent" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * String))) (C1 * (MetaCons "Conflict" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * [String])) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * String))))))

data Constraint a

Constructors

LessThanEq a

GreaterThanEq a

Eq a

Bounded (Constraint a) (Constraint a)

None

Instances

Functor Constraint

Methods

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

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

Eq a => Eq (Constraint a)

Methods

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

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

Ord a => Ord (Constraint a)

Methods

compare :: Constraint a -> Constraint a -> Ordering

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

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

(>) :: Constraint a -> Constraint a -> Bool

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

max :: Constraint a -> Constraint a -> Constraint a

min :: Constraint a -> Constraint a -> Constraint a

Show a => Show (Constraint a)

Methods

showsPrec :: Int -> Constraint a -> ShowS

show :: Constraint a -> String

showList :: [Constraint a] -> ShowS

Generic (Constraint a)

Associated Types

type Rep (Constraint a) :: * -> *

Methods

from :: Constraint a -> Rep (Constraint a) x

to :: Rep (Constraint a) x -> Constraint a

Semigroup (Constraint a)

Methods

(<>) :: Constraint a -> Constraint a -> Constraint a

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

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

Monoid (Constraint a)

Methods

mempty :: Constraint a

mappend :: Constraint a -> Constraint a -> Constraint a

mconcat :: [Constraint a] -> Constraint a

Pretty a => Pretty (Constraint a)

Methods

pretty :: Constraint a -> Doc

prettyList :: [Constraint a] -> Doc

NFData a => NFData (Constraint a)

Methods

rnf :: Constraint a -> ()

Recursive (Constraint a)

Methods

project :: Constraint a -> Base (Constraint a) (Constraint a)

cata :: (Base (Constraint a) a -> a) -> Constraint a -> a

para :: (Base (Constraint a) (Constraint a, a) -> a) -> Constraint a -> a

gpara :: (Corecursive (Constraint a), Comonad w) => (forall b. Base (Constraint a) (w b) -> w (Base (Constraint a) b)) -> (Base (Constraint a) (EnvT (Constraint a) w a) -> a) -> Constraint a -> a

prepro :: Corecursive (Constraint a) => (forall b. Base (Constraint a) b -> Base (Constraint a) b) -> (Base (Constraint a) a -> a) -> Constraint a -> a

gprepro :: (Corecursive (Constraint a), Comonad w) => (forall b. Base (Constraint a) (w b) -> w (Base (Constraint a) b)) -> (forall c. Base (Constraint a) c -> Base (Constraint a) c) -> (Base (Constraint a) (w a) -> a) -> Constraint a -> a

Corecursive (Constraint a)

Methods

embed :: Base (Constraint a) (Constraint a) -> Constraint a

ana :: (a -> Base (Constraint a) a) -> a -> Constraint a

apo :: (a -> Base (Constraint a) (Either (Constraint a) a)) -> a -> Constraint a

postpro :: Recursive (Constraint a) => (forall b. Base (Constraint a) b -> Base (Constraint a) b) -> (a -> Base (Constraint a) a) -> a -> Constraint a

gpostpro :: (Recursive (Constraint a), Monad m) => (forall b. m (Base (Constraint a) b) -> Base (Constraint a) (m b)) -> (forall c. Base (Constraint a) c -> Base (Constraint a) c) -> (a -> Base (Constraint a) (m a)) -> a -> Constraint a

type Rep (Constraint a)

type Rep (Constraint a) = D1 * (MetaData "Constraint" "Data.Dependency.Type" "dependency-0.1.0.9-1nc6be5HQ20N6N0tffMmN" False) ((:+:) * ((:+:) * (C1 * (MetaCons "LessThanEq" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "GreaterThanEq" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))) ((:+:) * (C1 * (MetaCons "Eq" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "Bounded" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Constraint a))) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Constraint a))))) (C1 * (MetaCons "None" PrefixI False) (U1 *)))))

type Base (Constraint a)

type Base (Constraint a)

newtype ResolveStateM m a

Constructors

ResolveStateM

Fields

• unResolve :: TardisT Mod ResMap m a

Instances

MonadTrans ResolveStateM

Methods

lift :: Monad m => m a -> ResolveStateM m a

MonadFix m => Monad (ResolveStateM m)

Methods

(>>=) :: ResolveStateM m a -> (a -> ResolveStateM m b) -> ResolveStateM m b

(>>) :: ResolveStateM m a -> ResolveStateM m b -> ResolveStateM m b

return :: a -> ResolveStateM m a

fail :: String -> ResolveStateM m a

MonadFix m => Functor (ResolveStateM m)

Methods

fmap :: (a -> b) -> ResolveStateM m a -> ResolveStateM m b

(<$) :: a -> ResolveStateM m b -> ResolveStateM m a

MonadFix m => MonadFix (ResolveStateM m)

Methods

mfix :: (a -> ResolveStateM m a) -> ResolveStateM m a

MonadFix m => Applicative (ResolveStateM m)

Methods

pure :: a -> ResolveStateM m a

(<*>) :: ResolveStateM m (a -> b) -> ResolveStateM m a -> ResolveStateM m b

liftA2 :: (a -> b -> c) -> ResolveStateM m a -> ResolveStateM m b -> ResolveStateM m c

(*>) :: ResolveStateM m a -> ResolveStateM m b -> ResolveStateM m b

(<*) :: ResolveStateM m a -> ResolveStateM m b -> ResolveStateM m a

type ResolveState = ResolveStateM (Either ResolveError)

type ResMap = Map String Dependency