homepage: https://github.com/iokasimov/tree
changelog-type: ''
hash: ca1f43bb382b284966e518857bf16fa5bb98c7ad3417194490264f8a69bc6bd1
test-bench-deps:
  semigroupoids: -any
  free: -any
  base: ==4.*
  comonad: -any
  hedgehog: -any
  lens: -any
  contravariant: -any
  apart: -any
maintainer: Murat Kasimov <iokasimov.m@gmail.com>
synopsis: Get all your structure and rip it apart.
changelog: ''
basic-deps:
  semigroupoids: -any
  free: -any
  base: ==4.*
  comonad: -any
  hedgehog: -any
  lens: -any
  contravariant: -any
  apart: -any
all-versions:
- '0.1.0'
author: Murat Kasimov
latest: '0.1.0'
description-type: haddock
description: ! 'The main idea: if you can describe your data structure via Cofree,
  with apart you can serialize, persistent or hash a segment of your structure!'
license-name: BSD3

Update from Hackage at 2018-06-04T20:02:11Z
Update from Hackage at 2018-06-04T20:02:11Z
