diff options
author | Ulrich Bauer <mail@ulrich-bauer.org> | 2016-09-16 21:44:07 +0200 |
---|---|---|
committer | Ulrich Bauer <mail@ulrich-bauer.org> | 2016-09-16 21:44:07 +0200 |
commit | 970b30307b5bee8037167aa7a7101de9b9eda6a0 (patch) | |
tree | 5f5959ec6e53f682405c96f1cb3c7767fe80ab61 | |
parent | 5b29a041208520afcd97d513f9528db6e1633409 (diff) | |
parent | 7d5c7bb72b11f145190fa329949f478f987ceb4f (diff) |
Merge branch 'dev' of https://bitbucket.org/ubauer/ripser into dev
* 'dev' of https://bitbucket.org/ubauer/ripser:
updated version number in readme
explicit word sizes for index_t and coefficient_t
-rw-r--r-- | README.md | 2 | ||||
-rw-r--r-- | ripser.cpp | 4 |
2 files changed, 3 insertions, 3 deletions
@@ -34,7 +34,7 @@ Ripser's efficiency is based on a few important concepts and principles: ### Version -[Latest release][latest-release]: 1.0 (July 2016) +[Latest release][latest-release]: 1.0.1 (September 2016) ### Building @@ -46,8 +46,8 @@ template <class Key, class T> class hash_map : public std::unordered_map<Key, T> typedef float value_t; // typedef uint16_t value_t; -typedef long index_t; -typedef short coefficient_t; +typedef int64_t index_t; +typedef int16_t coefficient_t; class binomial_coeff_table { std::vector<std::vector<index_t>> B; |