Safe Haskell	None
Language	Haskell2010

Debug.RecoverRTTI.Util

Contents

Synopsis

data Some (f :: k -> Type) where
- Some :: forall f a. f a -> Some f
elimKnownSymbol :: String -> (forall n. KnownSymbol n => Proxy n -> r) -> r
keepRedundantConstraint :: c => proxy c -> ()
checkEmptyTraversable :: Traversable t => t a -> Either a (t Void)
dropEnds :: forall a. [a] -> Maybe (a, [a], a)
data VerifiedSize (n :: Nat) (a :: Type) where
- VerifiedSize :: forall n a (xs :: [Type]). (SListI xs, Length xs ~ n) => NP (K a) xs -> VerifiedSize n a
verifySize :: Sing n -> [a] -> Maybe (VerifiedSize n a)

Existentials

data Some (f :: k -> Type) where Source #

Constructors

Some :: forall f a. f a -> Some f

Instances details

Show (Some Classified) Source #
Instance details Defined in Debug.RecoverRTTI.Classify Methods showsPrec :: Int -> Some Classified -> ShowS # show :: Some Classified -> String # showList :: [Some Classified] -> ShowS #

Constraints

Can be used to silence individual "redundant constraint" warnings

foo :: ConstraintUsefulForDebugging => ...
foo =
    ..
  where
    _ = keepRedundantConstraint (Proxy @ConstraintUsefulForDebugging))

Check if a traversable data structure is empty

Returns evidence: an element of the data-structure if it's non-empty, or evidence that it is empty otherwise.

dropEnds :: forall a. [a] -> Maybe (a, [a], a) Source #

Drop the ends of a list

dropEnds "abcde" == Just ('a',"bcd",'e')

data VerifiedSize (n :: Nat) (a :: Type) where Source #

Constructors

VerifiedSize :: forall n a (xs :: [Type]). (SListI xs, Length xs ~ n) => NP (K a) xs -> VerifiedSize n a