Bump version and update Changes

diff --git a/Changes b/Changes
index 8ee7e6e66a970494376ec7bcdbc83c7a9d0faf55..15a739b74ed908e2bee5e9f60f912df466507184 100644 (file)
--- a/Changes
+++ b/Changes
@@ -1,5 +1,12 @@
 Revision history for Perl extension Algorithm::BIT::XS.
 
+0.003 2017-06-17T22:04+03:00
+ - Fix segmentation fault
+ - Fix lack of destructors
+ - Fix off-by-one errors in argument validation
+ - Improve test suite
+ - Make XS slightly shorter
+
 0.002 2017-06-10T21:33+01:00
  - Add support for 2D binary indexed trees
 

diff --git a/README b/README
index d7c984de9ad55008668f2c61ade8457a659d5cab..f4aea99769652e300226e7d75b1a8a0e34873f2e 100644 (file)
--- a/README
+++ b/README
@@ -1,4 +1,4 @@
-Algorithm-BIT-XS version 0.002
+Algorithm-BIT-XS version 0.003
 ==============================
 
 A binary indexed tree is a data structure similar to an array of integers.

diff --git a/lib/Algorithm/BIT/XS.pm b/lib/Algorithm/BIT/XS.pm
index a0e02557545454cdcd736dc7f0ba19542b95df27..61fd3d585d7f01eb50b9ace8920207a3a10e2919 100644 (file)
--- a/lib/Algorithm/BIT/XS.pm
+++ b/lib/Algorithm/BIT/XS.pm
@@ -4,7 +4,7 @@ use 5.014000;
 use strict;
 use warnings;
 
-our $VERSION = '0.002';
+our $VERSION = '0.003';
 
 require XSLoader;
 XSLoader::load('Algorithm::BIT::XS', $VERSION);

diff --git a/lib/Algorithm/BIT2D/XS.pm b/lib/Algorithm/BIT2D/XS.pm
index 00fa82f3b540907a99ff8bbfd13f2cf8e048fbec..e0b6afd0c89cf94907294966e2a303dacb565745 100644 (file)
--- a/lib/Algorithm/BIT2D/XS.pm
+++ b/lib/Algorithm/BIT2D/XS.pm
@@ -4,7 +4,7 @@ use 5.014000;
 use strict;
 use warnings;
 
-our $VERSION = '0.002';
+our $VERSION = '0.003';
 
 use Algorithm::BIT::XS;