change name on module

sirixdb · Nov 1, 2023 · 7077f8c · 7077f8c
1 parent deabddd
commit 7077f8c
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/lib/src/main/java/fsst/SymbolMap.java b/lib/src/main/java/fsst/SymbolMap.java
@@ -66,7 +66,7 @@ void clear() {
     int load() {
         int ret = 0;
         for (int i = 0; i < hashTabSize; i++)
-            ret += Utils.boolToInt(hashTab[i].gcl < FSST_GCL_FREE);
+            ret += Utils.booleanToInt(hashTab[i].gcl < FSST_GCL_FREE);
         return ret;
     }
 

diff --git a/lib/src/main/java/fsst/SymbolTable.java b/lib/src/main/java/fsst/SymbolTable.java
@@ -242,7 +242,7 @@ int compressCount(SymbolTable symbolTable, Counters counters, Integer[] line, in
                 int start = cur;
                 int code2 = 255, code1 = symbolTable.findLongestSymbol((byte) cur, (byte) end);
                 cur += symbolTable.symbols[code1].length();
-                gain += (int) (symbolTable.symbols[code1].length() - (1 + Utils.boolToInt(isEscapeCode(code1))));
+                gain += (int) (symbolTable.symbols[code1].length() - (1 + Utils.booleanToInt(isEscapeCode(code1))));
                 while (true) {
                     // count single symbol (i.e. an option is not extending it)
                     // TODO: Double check which boolean flag we need for our specific implementation
@@ -293,7 +293,7 @@ int compressCount(SymbolTable symbolTable, Counters counters, Integer[] line, in
                     }
 
                     // compute compressed output size
-                    gain += ((int) (cur - start)) - (1 + Utils.boolToInt(isEscapeCode(code2)));
+                    gain += ((int) (cur - start)) - (1 + Utils.booleanToInt(isEscapeCode(code2)));
 
                     // now count the subsequent two symbols we encode as an extension codesibility
                     if (sampleFrac < 128) { // no need to count pairs in final round