Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.HashQualifiedPrime

Synopsis

data HashQualified n
- = NameOnly n
- | HashQualified n ShortHash
type HQSegment = HashQualified NameSegment
toHQ :: HashQualified n -> HashQualified n
type HashOrHQ n = Either ShortHash (HashQualified n)
fromHQ :: HashQualified n -> HashOrHQ n
toName :: HashQualified n -> n
nameLength :: (Name -> Text) -> HashQualified Name -> Int
take :: Int -> HashQualified n -> HashQualified n
toHash :: HashQualified n -> Maybe ShortHash
toTextWith :: (n -> Text) -> HashQualified n -> Text
fromNamedReferent :: n -> Referent -> HashQualified n
fromNamedReference :: n -> Reference -> HashQualified n
fromName :: n -> HashQualified n
matchesNamedReferent :: Eq n => n -> Referent -> HashQualified n -> Bool
matchesNamedReference :: Eq n => n -> Reference -> HashQualified n -> Bool
requalify :: HashQualified Name -> Referent -> HashQualified Name
searchBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> Relation Name ref -> Set ref
filterBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> Relation Name ref -> Relation Name ref
searchUnconflictedBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> BiMultimap ref Name -> Set ref
filterUnconflictedBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> BiMultimap ref Name -> BiMultimap ref Name

Documentation

data HashQualified n Source #

Like Unison.HashQualified, but doesn't support a HashOnly variant

Constructors

NameOnly n
HashQualified n ShortHash

Instances

Instances details

Foldable HashQualified Source #
Instance details Defined in Unison.HashQualifiedPrime Methods fold :: Monoid m => HashQualified m -> m # foldMap :: Monoid m => (a -> m) -> HashQualified a -> m # foldMap' :: Monoid m => (a -> m) -> HashQualified a -> m # foldr :: (a -> b -> b) -> b -> HashQualified a -> b # foldr' :: (a -> b -> b) -> b -> HashQualified a -> b # foldl :: (b -> a -> b) -> b -> HashQualified a -> b # foldl' :: (b -> a -> b) -> b -> HashQualified a -> b # foldr1 :: (a -> a -> a) -> HashQualified a -> a # foldl1 :: (a -> a -> a) -> HashQualified a -> a # toList :: HashQualified a -> [a] # null :: HashQualified a -> Bool # length :: HashQualified a -> Int # elem :: Eq a => a -> HashQualified a -> Bool # maximum :: Ord a => HashQualified a -> a # minimum :: Ord a => HashQualified a -> a # sum :: Num a => HashQualified a -> a # product :: Num a => HashQualified a -> a #
Traversable HashQualified Source #
Instance details Defined in Unison.HashQualifiedPrime Methods traverse :: Applicative f => (a -> f b) -> HashQualified a -> f (HashQualified b) # sequenceA :: Applicative f => HashQualified (f a) -> f (HashQualified a) # mapM :: Monad m => (a -> m b) -> HashQualified a -> m (HashQualified b) # sequence :: Monad m => HashQualified (m a) -> m (HashQualified a) #
Functor HashQualified Source #
Instance details Defined in Unison.HashQualifiedPrime Methods fmap :: (a -> b) -> HashQualified a -> HashQualified b # (<$) :: a -> HashQualified b -> HashQualified a #
Generic (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime Associated Types type Rep (HashQualified n) :: Type -> Type # Methods from :: HashQualified n -> Rep (HashQualified n) x # to :: Rep (HashQualified n) x -> HashQualified n #
Show n => Show (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime Methods showsPrec :: Int -> HashQualified n -> ShowS # show :: HashQualified n -> String # showList :: [HashQualified n] -> ShowS #
Eq n => Eq (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime Methods (==) :: HashQualified n -> HashQualified n -> Bool # (/=) :: HashQualified n -> HashQualified n -> Bool #
Ord n => Ord (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime Methods compare :: HashQualified n -> HashQualified n -> Ordering # (<) :: HashQualified n -> HashQualified n -> Bool # (<=) :: HashQualified n -> HashQualified n -> Bool # (>) :: HashQualified n -> HashQualified n -> Bool # (>=) :: HashQualified n -> HashQualified n -> Bool # max :: HashQualified n -> HashQualified n -> HashQualified n # min :: HashQualified n -> HashQualified n -> HashQualified n #
Alphabetical n => Alphabetical (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime Methods compareAlphabetical :: HashQualified n -> HashQualified n -> Ordering #
type Rep (HashQualified n) Source #
Instance details Defined in Unison.HashQualifiedPrime type Rep (HashQualified n) = D1 ('MetaData "HashQualified" "Unison.HashQualifiedPrime" "unison-core1-0.0.0-81K0NP5FQX63ztzOFtUCNN" 'False) (C1 ('MetaCons "NameOnly" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 n)) :+: C1 ('MetaCons "HashQualified" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 n) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ShortHash)))

type HQSegment = HashQualified NameSegment Source #

toHQ :: HashQualified n -> HashQualified n Source #

type HashOrHQ n = Either ShortHash (HashQualified n) Source #

fromHQ :: HashQualified n -> HashOrHQ n Source #

If the HashQualified is just a ShortHash, return it on the Left, otherwise return a HashQualified on the Right.

toName :: HashQualified n -> n Source #

nameLength :: (Name -> Text) -> HashQualified Name -> Int Source #

take :: Int -> HashQualified n -> HashQualified n Source #

toHash :: HashQualified n -> Maybe ShortHash Source #

toTextWith :: (n -> Text) -> HashQualified n -> Text Source #

fromNamedReferent :: n -> Referent -> HashQualified n Source #

fromNamedReference :: n -> Reference -> HashQualified n Source #

fromName :: n -> HashQualified n Source #

matchesNamedReferent :: Eq n => n -> Referent -> HashQualified n -> Bool Source #

matchesNamedReference :: Eq n => n -> Reference -> HashQualified n -> Bool Source #

requalify :: HashQualified Name -> Referent -> HashQualified Name Source #

searchBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> Relation Name ref -> Set ref Source #

Like searchBySuffix, but uses a hash-qualified name to search instead.

The name *and* the hash are used to determine whether something is an exact match. For example, in namespace {foo#foo, hello.foo#bar}, searching for foo#bar will return the singleton set {hello.foo#bar}, because even though there is an exact name match on foo, its hash doesn't match so we fall back to "suffix" matches. This probably isn't a very important detail in practice, but the other possible implementation (do name-only search, *then* filter result down to matching hashes) seems worse.

filterBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> Relation Name ref -> Relation Name ref Source #

Like searchBySuffix, but also keeps the names around.

searchUnconflictedBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> BiMultimap ref Name -> Set ref Source #

filterUnconflictedBySuffix :: forall ref. Ord ref => (ref -> ShortHash) -> HashQualified Name -> BiMultimap ref Name -> BiMultimap ref Name Source #