Update to version v5.12.1

Author: MadSchemas

bindings/consts.go

@@ -2,7 +2,7 @@ package bindings
 
 const CInt32Max = int(^uint32(0) >> 1)
 
-const ReindexerVersion = "v5.12.0"
+const ReindexerVersion = "v5.12.1"
 
 // public go consts from type_consts.h and reindexer_ctypes.h
 const (

changelog.md

@@ -1,13 +1,27 @@
+# Version 5.12.1 (03.04.2026)
+## Core
+- [fix] Fixed crash during error handling in `IndexUpdate` when PK is missing
+- [fix] Fixed `composite` values validation in `ALLSET` operator
+- [fix] Fixed `composite` indexes error handling in [equal_position](readme.md#search-in-array-fields-with-matching-indexes)
+- [fix] Fixed negative radius validation in `DWithin` condition for [geo index](readme.md#geometry)
+
+## Vector indexes
+- [fix] Fixed disk ANN cache for `composite` primary keys. Previously it could lead to crash on startup
+- [fix] Fixed KNN search with radius for [quantized HNSW index](float_vector.md#quantization-configuration-for-hnsw-index)
+
+## Go connector
+- [fix] Fixed type tags handling for empty slices
+
 # Version 5.12.0 (20.03.2026)
 ## Core
 - [fea] Added [now()-function](readme.md#nowunit) support into `WHERE`-clause. Now it may be used both in `UPDATE SET` and `WHERE` clauses
 - [fea] Added [flat_array_len()-function](readme.md#flat_array_lenfield_name) into `UPDATE SET`. Now it may be used both in `UPDATE SET` and `WHERE` clauses
 - [fea] Added `checksum` field into `#memstats`-namespaces as better alternative for `datahash`
 - [fea] Changed [grouping logic for equal_position](readme.md#search-in-array-fields-with-matching-indexes-using-grouping). New syntax/logic has better match with standard json-paths and also supports nested arrays in explicit way
-- [fix] Fixed possible memory leak during `composite`-indexes substitution inside WHERE-clauses (in cases, when `int`->`string` convertion was performed before `composite` substitution)
+- [fix] Fixed possible memory leak during `composite`-indexes substitution inside WHERE-clauses (in cases, when `int`->`string` conversion was performed before `composite` substitution)
 - [fix] Fixed SQL parsing for queries with combination of `or inner join(...)` and `left join(...)`
 - [fix] Fixed storage data migration, when Primary key index was changed
-- [fix] Fixed `2D points` convertion on WHERE-clause (perviously it could led to crashes on assertion)
+- [fix] Fixed `2D points` conversion on WHERE-clause (previously it could lead to crashes on assertion)
 - [fix] Added explicit check for `rtree` Primary keys. [Geo-indexes](readme.md#geometry) can not be PK anymore
 - [fix] Fixed [forced sort](readme.md#forced-sort) errors handling for [KNN-queries](float_vector.md), when query has `LIMIT` and `OFFSET`
 - [fix] Fixed `UUID`->`string` conversions for nested arrays on `UUID`-index deletion
@@ -64,7 +78,7 @@
 - [fix] Fixed storage data migration after `Primary key` index update
 
 ## Fulltext
-- [fea] Changed indexing structure for [typos handling](fulltext.md#typos-algorithm). New structure has noticeably less memory consumation
+- [fea] Changed indexing structure for [typos handling](fulltext.md#typos-algorithm). New structure has noticeably less memory consumption
 - [fea] Added support for `ORDER BY ft_composite` created over non-indexed fields
 - [fix] Fixed few incorrect interactions between `UPDATE`-queries and `text composite` index with `null`/missing fields
 
@@ -91,7 +105,7 @@
 - [fix] Fixed multiple issues with `collate numeric` [index option](readme.md#index-types-and-their-capabilities): `null`-values handling and space characters handling
 - [fix] Fixed original strings content preservation for `collate ascii` and `collate utf-8` (previously those strings could be normalized)
 - [fix] Disabled invalid config with multiple `jsonpaths` for [geo indexes](readme.md#geometry)
-- [fix] Fixed `update drop` for heterogenious arrays with `sparse`-indexes
+- [fix] Fixed `update drop` for heterogeneous arrays with `sparse`-indexes
 - [fix] Fixed array fields rollback for unsuccessful [update-queries](readme.md#update-queries) in some corner cases
 
 ## Fulltext
@@ -248,7 +262,7 @@
 - [fea] Added proxying for UPDATE and DELETE queries with subqueries and inner joins
 
 ## Reindexer tool
-- [fea] Added [storage convertion tool](cpp_src/readme.md#converting-storage-type-for-existing-database)
+- [fea] Added [storage conversion tool](cpp_src/readme.md#converting-storage-type-for-existing-database)
 
 ## Deploy
 - [upd] Added deployment for `debian:13` (trixie)

cjson/decoder.go

@@ -375,6 +375,10 @@ func (dec *Decoder) decodeSlice(pl *payloadIface, rdser *Serializer, v *reflect.
 		}
 	}
 
+	if count == 0 {
+		return
+	}
+
 	if subtag != TAG_OBJECT {
 		k := v.Type().Elem().Kind()
 		isPtr := false

cpp_src/cluster/config.cc

@@ -31,7 +31,6 @@ Error NodeData::FromJSON(std::span<char> json) {
 	} catch (const Error& err) {
 		return err;
 	}
-	return {};
 }
 
 Error NodeData::FromJSON(const gason::JsonNode& root) {
@@ -67,7 +66,6 @@ Error RaftInfo::FromJSON(std::span<char> json) {
 	} catch (const Error& err) {
 		return err;
 	}
-	return {};
 }
 
 Error RaftInfo::FromJSON(const gason::JsonNode& root) {
@@ -1003,7 +1001,7 @@ Error ShardingConfig::FromJSON(const gason::JsonNode& root) {
 	} catch (const Error& err) {
 		return err;
 	} catch (const gason::Exception& ex) {
-		return Error(errParseJson, "NodeData: {}", ex.what());
+		return Error(errParseJson, "ShardingConfig: {}", ex.what());
 	}
 	return Validate();
 }

cpp_src/cluster/replication/replicationthread.cc

@@ -772,6 +772,7 @@ Error ReplThread<BehaviourParamT>::syncNamespace(Node& node, const NamespaceName
 			} else if (requiredLsn.LSN() == localLsn.LSN() && !followerState.dataHash.IsEqualByAnyVersionTo(localState.dataHash)) {
 				logWarn("{}:{}:{} Datahash missmatch. Expected: {}, actual: {}", serverId_, node.uid, nsName, localState.dataHash,
 						followerState.dataHash);
+				assertrx_dbg(0 && "Does not expect checksum missmatch in debug build");
 				requiredLsn = ExtendedLsn();
 			}
 		}

cpp_src/cmd/reindexer_server/contrib/Dockerfile

@@ -31,7 +31,7 @@ RUN mkdir build && \
 
 FROM alpine:3.22
 
-ARG RX_VERSION=v5.12.0
+ARG RX_VERSION=v5.12.1
 
 COPY --from=build /usr/local /usr/local
 COPY --from=build /entrypoint.sh /entrypoint.sh

cpp_src/cmd/reindexer_tool/readme.md

@@ -1,7 +1,7 @@
 # Reindexer command line tool
-Reindexer command line tool is an client utility to work with database.
+Reindexer command line tool is a client utility to work with the database.
 
-## Table of Content
+## Table of contents
 
 - [Features](#features)
 - [Usage](#usage)
@@ -13,7 +13,7 @@ Reindexer command line tool is an client utility to work with database.
 - Backup whole database into text file or console.
 - Make queries to database
 - Modify documents and DB metadata
-- Both standalone and embeded(builtin) modes are supported
+- Both standalone and embedded (builtin) modes are supported
 
 ## Usage
 
@@ -69,9 +69,9 @@ Options
 
 ### Dump modes
 
-There are few different dump modes to interract with sharded databases:
+There are a few different dump modes to interact with sharded databases:
 1. full_node - Default mode. Dumps all data of chosen node, including sharded namespaces. However, does not dump data from other shards.
-2. sharded_only - Dumps data from sharded namespaces only (including the data from all other shards). May be usefull for resharding.
+2. sharded_only - Dumps data from sharded namespaces only (including the data from all other shards). May be useful for resharding.
 3. local_only - Dumps data from local namespaces, excluding sharded namespaces.
 
 Dump mode is saved in the output file and will be used during restoration process.

cpp_src/core/cjson/readme.md

@@ -1,6 +1,6 @@
 
-`CJSON` (Compact JSON) is binary internal reindexer format for transparently representing JSON data.
-Each field of CJSON is encoded to `ctag` - varuint, which encodes type and name of field, and `data` binary representation of field data in format dependent of type.
+`CJSON` (Compact JSON) is a binary internal Reindexer format for transparently representing JSON data.
+Each field of CJSON is encoded to `ctag` — a varuint that encodes the type and name of the field, and `data`, the binary representation of field data in a format dependent on the type.
 
 
 ## Ctag format

cpp_src/core/expressiontree.md

@@ -18,8 +18,8 @@ class ExpressionTree;
 * `Ts...` - types of the expression arguments.
 
 `ExpressionTree` does not support operator precedence.
-You can support it manually as it done in `QueryEntries` and `SelectIteratorContainer`, or by enclosing higher priority operators in brackets as it done in `SortExpression`.
-Here is not used the traditional way for constructing trees with inheritance of nodes, allocations of separate nodes and holding  pointers to them.
+You can support it manually as is done in `QueryEntries` and `SelectIteratorContainer`, or by enclosing higher priority operators in brackets as is done in `SortExpression`.
+The traditional way of constructing trees with inheritance of nodes, allocations of separate nodes, and holding pointers to them is not used here.
 `ExpressionTree` holds all nodes by value in a vector (`container_`) sequentially in type `Node` based on `variant`.
 
 Subtree is stored in `container_` just behind its head (`SubTree`) which holds occupied space. For details see examples.
@@ -39,7 +39,7 @@ would be stored like
 
 Every cell holds an operator (here `+` or `-`) and payload.
 
-Lets see cells 4-5: they correspond to subexpression `-(D + E)`.
+Let's look at cells 4-5: they correspond to subexpression `-(D + E)`.
 * Cell 4 is a head of subtree: `-` - operator before the bracket and `3` - count of cells occupied by subtree (from 4 to 6).
 * Cell 5 holds default operator `+` and value `D`.
 * Cell 6 holds operator `+` and value `E`.
@@ -50,7 +50,7 @@ This structure provides effective forward iteration and doesn't allow to iterate
 
 Default building process of ExpressionTree is to append elements from beginning to end by using methods `Append()`, `OpenBracket()` and `CloseBracket()`.
 `activeBrackets_` - list of cells of heads of open brackets which sizes should be incremented when new element is added.
-Lets trace evolution of `container_` and `activeBrackets_` during construction expression `(A + B) - (C + (D - E) + F) - G`:
+Let's trace the evolution of `container_` and `activeBrackets_` while constructing the expression `(A + B) - (C + (D - E) + F) - G`:
 1. `OpenBracket(+)`. Constructed expression: `(`
 
 |  0   |

cpp_src/core/index/float_vector/float_vector_index.cc

@@ -277,4 +277,27 @@ void FloatVectorIndex::WriterBase::writePK(IdType id) {
 	}
 }
 
+IdType FloatVectorIndex::LoaderBase::readPKEncodedData(void* destBuf, Serializer& ser, std::string_view name, std::string_view idxType) {
+	Variant key;
+	if (!isCompositePK_) {
+		key = ser.GetVariant();
+	} else {
+		VariantArray keyParts;
+		const auto len = ser.GetVarUInt();
+		if (!len) [[unlikely]] {
+			throw Error(errLogic, "{}::LoadIndexCache:{}: serialized PK array is empty", idxType, name);
+		}
+		keyParts.reserve(len);
+		for (size_t i = 0; i < len; ++i) {
+			keyParts.emplace_back(ser.GetVariant());
+		}
+		key = Variant(keyParts);
+	}
+	const IdType itemID = getVectorData_(std::move(key), destBuf);
+	if (!itemID.IsValid()) [[unlikely]] {
+		throw Error(errLogic, "{}::LoadIndexCache:{}: unable to find indexed item with requested PK", idxType, name);
+	}
+	return itemID;
+}
+
 }  // namespace reindexer