| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.BTree.Primitives.Key
Documentation
class (Ord k, Value k) => Key k where #
Minimal complete definition
Nothing
Methods
Given two keys a, b such that 'a < b' compute two new keys a2,
b2 such that 'a <= a2 < b2 <= b'. Obviously this always holds for 'a2
== a' and 'b2 = b' but for ByteStrings we can potentially find smaller
a2 and b2. If a equals b, the behaviour is undefined.
Instances
| Key Bool # | |
| Key Double # | |
| Key Float # | |
| Key Int8 # | |
| Key Int16 # | |
| Key Int32 # | |
| Key Int64 # | |
| Key Integer # | |
| Key Word8 # | |
| Key Word16 # | |
| Key Word32 # | |
| Key Word64 # | |
| Key () # | |
Defined in Data.BTree.Primitives.Key | |
| Key ByteString # | |
Defined in Data.BTree.Primitives.Key Methods narrow :: ByteString -> ByteString -> (ByteString, ByteString) # | |
| Key Text # | |
| Key TxId # | |
| Key PageId # | |
| (Key a, Key b) => Key (a, b) # | |
Defined in Data.BTree.Primitives.Key | |