update changelog

CHANGELOG.md

@@ -1,9 +1,11 @@
 # Changelog
 
-- v0.1.0
-    - first version.
-    - The speed is no ideal as the data structures and backtrace algorithm are inefficient.
+- v0.2.1
+    - fix missing of bounds checking in adaptive reduction.
 - v0.2.0
     - rewrite the whole package.
     - more accurate.
     - 2X faster than v0.1.0, lower memory.
+- v0.1.0
+    - first version.
+    - The speed is no ideal as the data structures and backtrace algorithm are inefficient.

wfa_wavefront.go

@@ -133,7 +133,7 @@ func (wf *WaveFront) Increase(k int, delta uint32) {
 
 // Get returns offset, wfaType, existed.
 func (wf *WaveFront) Get(k int) (uint32, uint32, bool) {
-	if !(k >= wf.Lo && k <= wf.Hi) { // check k range
+	if k < wf.Lo || k > wf.Hi { // check k range
 		return 0, 0, false
 	}
 	offset := wf.Offsets[k2i(k)]
@@ -142,7 +142,7 @@ func (wf *WaveFront) Get(k int) (uint32, uint32, bool) {
 
 // GetRaw returns "offset<<wfaTypeBits |  wfaType", existed.
 func (wf *WaveFront) GetRaw(k int) (uint32, bool) {
-	if !(k >= wf.Lo && k <= wf.Hi) { // check k range
+	if k < wf.Lo || k > wf.Hi { // check k range
 		return 0, false
 	}
 	offset := wf.Offsets[k2i(k)]
@@ -151,7 +151,7 @@ func (wf *WaveFront) GetRaw(k int) (uint32, bool) {
 
 // Delete delete an offset of a k.
 func (wf *WaveFront) Delete(k int) {
-	if !(k >= wf.Lo && k <= wf.Hi) { // check k range
+	if k < wf.Lo || k > wf.Hi { // check k range
 		return
 	}
 	wf.Offsets[k2i(k)] = 0