summaryrefslogtreecommitdiff
path: root/readme.txt
diff options
context:
space:
mode:
authorJed Barber <jjbarber@y7mail.com>2017-02-13 06:31:09 +1100
committerJed Barber <jjbarber@y7mail.com>2017-02-13 06:31:09 +1100
commit835c2dffc539e277812925469c82662482e1bbc5 (patch)
treed964f03e28597afe28a842df627288cb72de79e7 /readme.txt
parentf9658404967d5fd39d22980d953dd49c72795da6 (diff)
Removed all Haskell and other old code, updated readme/notes
Diffstat (limited to 'readme.txt')
-rw-r--r--readme.txt22
1 files changed, 1 insertions, 21 deletions
diff --git a/readme.txt b/readme.txt
index 88c01f4..18641f7 100644
--- a/readme.txt
+++ b/readme.txt
@@ -7,7 +7,7 @@ algorithm on it to calculate election outcomes.
To compile this program, the following dependencies are needed:
- ghc (of course)
+ gnat (of course)
gnu make
Note however that make isn't strictly necessary if you have a look in the
@@ -15,19 +15,6 @@ makefile to see the compilation commands required.
-Aside from base, the cabal packages required to compile this program are:
-
- directory
- either-unwrap
- either
- transformers
- parsec
- vector
- array
- time
-
-
-
Compilation is done by 'make all'. Further instruction on how to use this
program can be obtained from the '--help' switch, once compiled.
@@ -55,10 +42,3 @@ elect candidates. On the other hand, the AEC program is also a lot more
verbose on the distribution of preferences, and doesn't do bulk exclusions.
-
-Finally, be aware that processing STV data takes a long time. It also takes a
-lot of memory for the larger datasets. If you want to be sure that progress is
-happening, either turn on the '--verbose' switch or monitor the output log
-directory.
-
-