compare package:radix-tree

compare :: (a -> b -> Bool) -> Patricia a -> Patricia b -> PartialOrdering
radix-tree Data.Patricia.Word.Lazy Data.Patricia.Word.Strict
Compare two trees with respect to set inclusion, using the given equality function for intersecting keys. If any intersecting keys hold unequal values, the trees are Incomparable.
compare :: (a -> b -> Bool) -> Radix1Tree a -> Radix1Tree b -> PartialOrdering
radix-tree Data.Radix1Tree.Word8.Lazy Data.Radix1Tree.Word8.Strict
Compare two trees with respect to set inclusion, using the given equality function for intersecting keys. If any intersecting keys hold unequal values, the trees are Incomparable.
compare :: (a -> b -> Bool) -> RadixTree a -> RadixTree b -> PartialOrdering
radix-tree Data.RadixTree.Word8.Lazy Data.RadixTree.Word8.Strict
Compare two trees with respect to set inclusion, using the given equality function for intersecting keys. If any intersecting keys hold unequal values, the trees are Incomparable.
compare :: Color -> Zebra -> Zebra -> PartialOrdering
radix-tree Data.Zebra.Word
Compare two trees with respect to set inclusion over the given color.