From: Marius Gavrilescu <marius@ieval.ro>
Date: Sat, 17 Jun 2017 19:04:04 +0000 (+0300)
Subject: Bump version and update Changes
X-Git-Tag: 0.003^0
X-Git-Url: http://git.ieval.ro/?p=algorithm-bit-xs.git;a=commitdiff_plain;h=43fc37ce459edca461c03fcb55848a26b2c12a08

Bump version and update Changes
---

diff --git a/Changes b/Changes
index 8ee7e6e..15a739b 100644
--- 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 d7c984d..f4aea99 100644
--- 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 a0e0255..61fd3d5 100644
--- 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 00fa82f..e0b6afd 100644
--- 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;