From 072377dc11d04f51ef76c34aabdb92d01e5b5fd6 Mon Sep 17 00:00:00 2001
From: Barry DeZonia <bdezonia@gmail.com>
Date: Wed, 4 May 2022 23:35:01 -0500
Subject: [PATCH] version 1.9.8

---
 pom.xml                                                       | 2 +-
 src/main/java/nom/bdezonia/zorbage/algorithm/InvFFT2D.java    | 1 -
 .../java/nom/bdezonia/zorbage/datasource/FFTDataSource.java   | 4 ++++
 3 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/pom.xml b/pom.xml
index ba2ae9595..3cb0eb8d1 100644
--- a/pom.xml
+++ b/pom.xml
@@ -6,7 +6,7 @@
   <modelVersion>4.0.0</modelVersion>
   <groupId>io.github.bdezonia</groupId>
   <artifactId>zorbage</artifactId>
-  <version>1.9.8-SNAPSHOT</version>
+  <version>1.9.8</version>
   <packaging>jar</packaging>
   <name>Zorbage</name>
   <description>Algebraic data types and algorithms for use in numeric processing</description>
diff --git a/src/main/java/nom/bdezonia/zorbage/algorithm/InvFFT2D.java b/src/main/java/nom/bdezonia/zorbage/algorithm/InvFFT2D.java
index bc8116588..c8e75761a 100644
--- a/src/main/java/nom/bdezonia/zorbage/algorithm/InvFFT2D.java
+++ b/src/main/java/nom/bdezonia/zorbage/algorithm/InvFFT2D.java
@@ -144,7 +144,6 @@ DimensionedDataSource<U> compute(T complexAlg, V realAlg, DimensionedDataSource<
 			InvFFT.compute(complexAlg, realAlg, inPiped, tmpCol);
 		}
 		
-		
 		// for each row of temp data do a 1-d FFT and store as a row in output
 		
 		for (long r = 0; r < sz; r++) {
diff --git a/src/main/java/nom/bdezonia/zorbage/datasource/FFTDataSource.java b/src/main/java/nom/bdezonia/zorbage/datasource/FFTDataSource.java
index 7b3b9911b..b6786ee0e 100644
--- a/src/main/java/nom/bdezonia/zorbage/datasource/FFTDataSource.java
+++ b/src/main/java/nom/bdezonia/zorbage/datasource/FFTDataSource.java
@@ -57,6 +57,8 @@ public StorageConstruction storageType() {
 		return data.storageType();
 	}
 
+	// TODO: this routine is never out of bounds in my testing. Why?
+	
 	@Override
 	public void set(long index, N value) {
 
@@ -66,6 +68,8 @@ public void set(long index, N value) {
 		}
 	}
 
+	// TODO: this routine is never out of bounds in my testing. Why?
+	
 	@Override
 	public void get(long index, N value) {