tree-diff
@
0.3
Common diff algorithm works on list structures: This package works on trees. This package also provides a way to diff arbitrary ADTs, using Generics-derivable helpers. This package differs from gdiff, in a two ways: tree-diff doesn't have patch function, and the "edit-script" is a tree itself, which is useful for pretty-printing.
Published
Indexed
Dependencies
32
32
Loading...
Readme
Loading...
Dependencies
-
QuickCheck
>=2.14.2 && <2.15 -
aeson
>=1.4.6.0 && <1.5 || >=1.5.6.0 && <1.6 || >=2.0.0.0 && <2.1 || >=2.1.0.0 && <2.2 -
ansi-terminal
>=0.10 && <0.12 -
ansi-wl-pprint
>=0.6.8.2 && <0.7 -
base
>=4.5 && <4.18 -
base-compat
>=0.10.5 && <0.11 || >=0.11.0 && <0.13 -
bytestring
>=0.9.2.1 && <0.10 || >=0.10.0.2 && <0.11 || >=0.11.0.0 && <0.12 -
bytestring-builder
>=0.10.8.2.0 && <0.11 -
containers
>=0.4.2.1 && <0.5 || >=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7 -
data-array-byte
>=0.1.0.1 && <0.2 -
deepseq
>=1.3.0.0 && <1.4 || >=1.4.0.0 && <1.5 -
generic-deriving
>=1.13.1 && <1.15 -
ghc-prim
* -
hashable
>=1.2.7.0 && <1.3 || >=1.3.0.0 && <1.4 || >=1.4.0.1 && <1.5 -
nats
>=1.1.2 && <1.2 -
parsec
>=3.1.13.0 && <3.2 -
parsers
>=0.12.10 && <0.13 -
pretty
>=1.1.1.0 && <1.2 -
primitive
>=0.7.1.0 && <0.8 -
scientific
>=0.3.6.2 && <0.4 -
semialign
>=1.2.0.1 && <1.3 -
semigroups
>=0.19.1 && <0.21 -
strict
>=0.4.0.1 && <0.5 -
tagged
>=0.8.6 && <0.9 -
text
>=1.2.3.0 && <1.3 || >=2.0 && <2.1 -
these
>=1.1.1.1 && <1.2 -
time
>=1.4 && <1.5 || >=1.5.0.1 && <1.6 || >=1.6.0.1 && <1.7 || >=1.8.0.2 && <1.9 || >=1.9.3 && <1.13 -
transformers
>=0.3.0.0 && <0.4 || >=0.4.2.0 && <0.5 || >=0.5.2.0 && <0.6 -
unordered-containers
>=0.2.8.0 && <0.3 -
uuid-types
>=1.0.3 && <1.1 -
vector
>=0.12.0.0 && <0.13 || >=0.13.0.0 && <0.14 -
void
>=0.7.3 && <0.8
Links
| Registry | hackage.haskell.org |
| Download | Download |
| JSON API | View JSON |
| CodeMeta | codemeta.json |