Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Binrep.CBLen
Documentation
Instances
IsCBLen Int16 Source # | |
IsCBLen Int32 Source # | |
IsCBLen Int64 Source # | |
IsCBLen Int8 Source # | |
IsCBLen Word16 Source # | |
IsCBLen Word32 Source # | |
IsCBLen Word64 Source # | |
IsCBLen Word8 Source # | |
IsCBLen DMagic Source # | |
IsCBLen () Source # | |
Defined in Binrep.CBLen | |
IsCBLen (Magic a :: Type) Source # | The byte length of a magic is known at compile time. |
IsCBLen (NullPadded n a :: Type) Source # | |
Defined in Binrep.Type.NullPadded Associated Types type CBLen (NullPadded n a) :: Natural Source # | |
IsCBLen (SizePrefixed pfx a :: Type) Source # | |
Defined in Binrep.Type.Prefix.Size Associated Types type CBLen (SizePrefixed pfx a) :: Natural Source # | |
IsCBLen (Sized n a :: Type) Source # | |
IsCBLen a => IsCBLen (ByteOrdered end a :: Type) Source # | |
Defined in Binrep.CBLen Associated Types type CBLen (ByteOrdered end a) :: Natural Source # | |
(IsCBLen l, IsCBLen r) => IsCBLen ((l, r) :: Type) Source # | |
Defined in Binrep.CBLen | |
IsCBLen (CountPrefixed pfx f a :: Type) Source # | We can know byte length at compile time _if_ we know it for the prefix and the list-like. This is extremely unlikely, because then what counting are we even performing for the list-like? But it's a valid instance. |
Defined in Binrep.Type.Prefix.Count Associated Types type CBLen (CountPrefixed pfx f a) :: Natural Source # |