MemoTrie 0.4.8 → 0.4.9
raw patch · 2 files changed
+28/−2 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.MemoTrie: instance (HasTrie a) => Applicative ((:->:) a)
- Data.MemoTrie: instance (HasTrie a) => Functor ((:->:) a)
- Data.MemoTrie: instance (HasTrie a) => Monad ((:->:) a)
- Data.MemoTrie: instance (HasTrie x) => HasTrie [x]
+ Data.MemoTrie: instance HasTrie a => Applicative ((:->:) a)
+ Data.MemoTrie: instance HasTrie a => Functor ((:->:) a)
+ Data.MemoTrie: instance HasTrie a => Monad ((:->:) a)
+ Data.MemoTrie: instance HasTrie x => HasTrie [x]
- Data.MemoTrie: domain :: (HasTrie a) => [a]
+ Data.MemoTrie: domain :: HasTrie a => [a]
- Data.MemoTrie: enumerate :: (HasTrie a) => (a :->: b) -> [(a, b)]
+ Data.MemoTrie: enumerate :: HasTrie a => (a :->: b) -> [(a, b)]
- Data.MemoTrie: idTrie :: (HasTrie a) => a :->: a
+ Data.MemoTrie: idTrie :: HasTrie a => a :->: a
- Data.MemoTrie: memo :: (HasTrie t) => (t -> a) -> (t -> a)
+ Data.MemoTrie: memo :: HasTrie t => (t -> a) -> (t -> a)
- Data.MemoTrie: mup :: (HasTrie t) => (b -> c) -> (t -> b) -> (t -> c)
+ Data.MemoTrie: mup :: HasTrie t => (b -> c) -> (t -> b) -> (t -> c)
- Data.MemoTrie: trie :: (HasTrie a) => (a -> b) -> (a :->: b)
+ Data.MemoTrie: trie :: HasTrie a => (a -> b) -> (a :->: b)
- Data.MemoTrie: untrie :: (HasTrie a) => (a :->: b) -> (a -> b)
+ Data.MemoTrie: untrie :: HasTrie a => (a :->: b) -> (a -> b)
Files
- COPYING +25/−0
- MemoTrie.cabal +3/−2
+ COPYING view
@@ -0,0 +1,25 @@+Copyright (c) 2009 Conal Elliott+All rights reserved.++Redistribution and use in source and binary forms, with or without+modification, are permitted provided that the following conditions+are met:+1. Redistributions of source code must retain the above copyright+ notice, this list of conditions and the following disclaimer.+2. Redistributions in binary form must reproduce the above copyright+ notice, this list of conditions and the following disclaimer in the+ documentation and/or other materials provided with the distribution.+3. The names of the authors may not be used to endorse or promote products+ derived from this software without specific prior written permission.++THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES+OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.+IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.+
MemoTrie.cabal view
@@ -1,5 +1,5 @@ Name: MemoTrie-Version: 0.4.8+Version: 0.4.9 Cabal-Version: >= 1.2 Synopsis: Trie-based memo functions Category: Data@@ -9,13 +9,14 @@ . Project wiki page: <http://haskell.org/haskellwiki/MemoTrie> .- © 2008 by Conal Elliott; BSD3 license.+ © 2008,2009,2010 by Conal Elliott; BSD3 license. Author: Conal Elliott Maintainer: conal@conal.net Homepage: http://haskell.org/haskellwiki/MemoTrie Package-Url: http://code.haskell.org/MemoTrie Copyright: (c) 2008 by Conal Elliott License: BSD3+License-File: COPYING Stability: experimental build-type: Simple