[ Källkod: haskell-witherable ]
Paket: libghc-witherable-doc (0.4.2-2)
Länkar för libghc-witherable-doc
Debianresurser:
Hämta källkodspaketet haskell-witherable:
- [haskell-witherable_0.4.2-2.dsc]
- [haskell-witherable_0.4.2.orig.tar.gz]
- [haskell-witherable_0.4.2-2.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
- libghc-witherable-prof
- libghc-mono-traversable-instances-doc
- libghc-distributive-doc
- libghc-random-doc
- libghc-focuslist-doc
- libghc-mono-traversable-instances-dev
- libghc-xml-doc
- libghc-indexed-traversable-instances-doc
- libghc-mono-traversable-instances-prof
- libghc-generic-deriving-doc
- libghc-ordered-containers-doc
filterable traversable for Haskell; documentation
A stronger variant of `traverse` which can remove elements and generalised mapMaybe, catMaybes, and filter.
This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
Andra paket besläktade med libghc-witherable-doc
|
|
|
|
-
- dep: haddock-interface-38
- virtuellt paket som tillhandahålls av ghc
-
- dep: sgml-base (>= 1.28)
- SGML infrastructure and SGML catalog file support
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-hashable-doc
- class for types that can be converted to a hash value; documentation
-
- rec: libghc-indexed-traversable-doc
- Indexed Traversables for Haskell; documentation
-
- rec: libghc-unordered-containers-doc
- Efficient hashing-based container types; documentation
-
- rec: libghc-vector-doc
- Efficient Arrays for Haskell; documentation
-
- rec: libghc-witherable-dev
- filterable traversable for Haskell
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
-
- sug: libghc-witherable-prof
- filterable traversable for Haskell; profiling libraries
Hämta libghc-witherable-doc
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 85,7 kbyte | 1.582,0 kbyte | [filförteckning] |