Rose trees with cached and accumulating monoidal annotations
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. This is used as the core data structure underlying the diagrams framework, but potentially has other applications as well.
| System | Target | Derivation | Build status |
|---|---|---|---|
| x86_64-linux | /gnu/store/5h4n2ylhhz6n8jka1klwzc2dgvfir332-ghc-dual-tree-0.2.2.1.drv | ||
| mips64el-linux | /gnu/store/b78h20p72pm5573xdm60ys1hl1fpy590-ghc-dual-tree-0.2.2.1.drv | ||
| i686-linux | /gnu/store/wiyq6kl051ba992g5dcav89c6iphmyj9-ghc-dual-tree-0.2.2.1.drv | ||
| armhf-linux | /gnu/store/la8iyk7q7ysnl3z9kak5390wrj2gdwv6-ghc-dual-tree-0.2.2.1.drv | ||
| aarch64-linux | /gnu/store/bjdii93mapznddz2x19srid21z15vj97-ghc-dual-tree-0.2.2.1.drv |
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||