duckdb 0.5.2-dev1090.0 → 0.5.2-dev1096.0

package/package.json

@@ -2,7 +2,7 @@
   "name": "duckdb",
   "main": "./lib/duckdb.js",
   "types": "./lib/duckdb.d.ts",
-  "version": "0.5.2-dev1090.0",
+  "version": "0.5.2-dev1096.0",
   "description": "DuckDB node.js API",
   "gypfile": true,
   "dependencies": {

package/src/duckdb.cpp

@@ -86205,7 +86205,7 @@ void RadixPartitionedHashTable::GetData(ExecutionContext &context, DataChunk &ch
 			state.finished = true;
 			return;
 		}
-		D_ASSERT(state.ht_index < gstate.finalized_hts.size());
+		D_ASSERT(ht_index < gstate.finalized_hts.size());
 		D_ASSERT(state.ht_scan_states);
 		auto &ht = gstate.finalized_hts[ht_index];
 		auto &scan_state = state.ht_scan_states[ht_index];
@@ -114079,12 +114079,11 @@ static idx_t LevenshteinDistance(const string_t &txt, const string_t &tgt) {
 	auto txt_len = txt.GetSize();
 	auto tgt_len = tgt.GetSize();
 
-	if (txt_len < 1) {
-		throw InvalidInputException("Levenshtein Function: 1st argument too short");
-	}
-
-	if (tgt_len < 1) {
-		throw InvalidInputException("Levenshtein Function: 2nd argument too short");
+	// If one string is empty, the distance equals the length of the other string
+	if (txt_len == 0) {
+		return tgt_len;
+	} else if (tgt_len == 0) {
+		return txt_len;
 	}
 
 	auto txt_str = txt.GetDataUnsafe();

package/src/duckdb.hpp

@@ -11,8 +11,8 @@ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLI
 #pragma once
 #define DUCKDB_AMALGAMATION 1
 #define DUCKDB_AMALGAMATION_EXTENDED 1
-#define DUCKDB_SOURCE_ID "a0ce35f0b"
-#define DUCKDB_VERSION "v0.5.2-dev1090"
+#define DUCKDB_SOURCE_ID "efa7dfa64"
+#define DUCKDB_VERSION "v0.5.2-dev1096"
 //===----------------------------------------------------------------------===//
 //                         DuckDB
 //