| Safe Haskell | Safe-Inferred |
|---|
Text.LDIF.Tree
Description
LDIF representation in Data.Tree structure
- toTree :: LDIF -> Bool -> Tree LDIFRecord
- fromTree :: Tree LDIFRecord -> LDIF
- sortTreeByName :: Tree LDIFRecord -> Tree LDIFRecord
Documentation
toTree :: LDIF -> Bool -> Tree LDIFRecordSource
Convert LDIF to Tree of Records using their DNs. Can insert dummy parents.
fromTree :: Tree LDIFRecord -> LDIFSource
Flatten Tree of Records to LDIF
sortTreeByName :: Tree LDIFRecord -> Tree LDIFRecordSource
Sort recursively children Records by DNs