Skip to content

Commit 3ef4c59

Browse files
Cleaning up .cabal file
1 parent e3d349b commit 3ef4c59

File tree

1 file changed

+6
-10
lines changed

1 file changed

+6
-10
lines changed

efficient-implied-alignment.cabal

Lines changed: 6 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -3,11 +3,11 @@ category: Algorithms
33
build-type: Simple
44

55
name: efficient-implied-alignment
6-
version: 0.1.0
6+
version: 1.0.0
77

88
author: Alex Washburn
99
maintainer: [email protected]
10-
copyright: 2018 Alex Washburn
10+
copyright: 2020 Alex Washburn
1111
license: BSD-3-Clause
1212
license-file: LICENSE
1313

@@ -16,21 +16,21 @@ synopsis: Proof of concept of efficient multiple string alignment
1616
description: Using a commutative, binary string alignment operator and a
1717
binary tree with strings on the leaf nodes, we can efficiently
1818
derive the a multiple string alignment of the implied by the
19-
binary tree. Requires a pot-order then preorder traversal.
19+
binary tree. Requires a post-order then preorder traversal.
2020
Post-order traversal should be worst case /O(n*k^2)/, average
2121
case /O(n*k*log(k))/ and the pre-order traversal should be
2222
/O(n*k)/.
2323

24-
homepage: https://github.com/githubuser/efficient-implied-alignment#readme
25-
bug-reports: https://github.com/githubuser/efficient-implied-alignment/issues
24+
homepage: https://github.com/recursion-ninja/efficient-implied-alignment#readme
25+
bug-reports: https://github.com/recursion-ninja/efficient-implied-alignment/issues
2626

2727
extra-source-files:
2828
ChangeLog.md
2929
README.md
3030

3131
source-repository head
3232
type: git
33-
location: https://github.com/githubuser/efficient-implied-alignment
33+
location: https://github.com/recursion-ninja/efficient-implied-alignment
3434

3535

3636
-- A litany of GHC warnings designed to alert us during the build of any common
@@ -94,15 +94,13 @@ library
9494
base >=4.7 && <5
9595
, bimap
9696
, case-insensitive
97-
-- >=0.5.8 Required for Data.Map.restrictKeys
9897
, containers >=0.5.8
9998
, deepseq
10099
, dlist
101100
, hashable
102101
, integer-gmp
103102
, keys
104103
, lens
105-
-- , matrix
106104
, matrices
107105
, megaparsec >=8.0
108106
, monad-loops
@@ -118,7 +116,6 @@ library
118116
, transformers
119117
, validation
120118
, vector
121-
-- >=3.4 required for corrected definition of (!) & index
122119
, vector-instances >=3.4
123120

124121
exposed-modules:
@@ -129,7 +126,6 @@ library
129126
Data.BTree
130127
Data.Decoration
131128
Data.DecTree
132-
-- Data.Matrix.ZeroIndexed
133129
Data.SymbolString
134130
Data.TCM
135131
Data.UserInput

0 commit comments

Comments
 (0)