lbug 0.12.3-dev.3 → 0.12.3-dev.5

package/lbug-source/CMakeLists.txt

@@ -1,6 +1,6 @@
 cmake_minimum_required(VERSION 3.15)
 
-project(Lbug VERSION 0.12.3.3 LANGUAGES CXX C)
+project(Lbug VERSION 0.12.3.5 LANGUAGES CXX C)
 
 option(SINGLE_THREADED "Single-threaded mode" FALSE)
 if(SINGLE_THREADED)

package/lbug-source/src/include/storage/storage_version_info.h

@@ -13,13 +13,7 @@ using storage_version_t = uint64_t;
 
 struct StorageVersionInfo {
     static std::unordered_map<std::string, storage_version_t> getStorageVersionInfo() {
-        return {{"0.11.1", 39}, {"0.11.0", 39}, {"0.10.0", 38}, {"0.9.0", 37}, {"0.8.0", 36},
-            {"0.7.1.1", 35}, {"0.7.0", 34}, {"0.6.0.6", 33}, {"0.6.0.5", 32}, {"0.6.0.2", 31},
-            {"0.6.0.1", 31}, {"0.6.0", 28}, {"0.5.0", 28}, {"0.4.2", 27}, {"0.4.1", 27},
-            {"0.4.0", 27}, {"0.3.2", 26}, {"0.3.1", 26}, {"0.3.0", 26}, {"0.2.1", 25},
-            {"0.2.0", 25}, {"0.1.0", 24}, {"0.0.12.3", 24}, {"0.0.12.2", 24}, {"0.0.12.1", 24},
-            {"0.0.12", 23}, {"0.0.11", 23}, {"0.0.10", 23}, {"0.0.9", 23}, {"0.0.8", 17},
-            {"0.0.7", 15}, {"0.0.6", 9}, {"0.0.5", 8}, {"0.0.4", 7}, {"0.0.3", 1}};
+        return {{"0.12.0", 40}, {"0.12.2", 40}};
     }
 
     static LBUG_API storage_version_t getStorageVersion();

package/lbug-source/src/main/query_result/materialized_query_result.cpp

@@ -79,8 +79,8 @@ std::string MaterializedQueryResult::toString() const {
     result += "\n";
     auto tuple_ = FlatTuple(this->columnTypes);
     auto iterator_ = FactorizedTableIterator(*table);
-    while (iterator->hasNext()) {
-        iterator->getNext(tuple_);
+    while (iterator_.hasNext()) {
+        iterator_.getNext(tuple_);
         result += tuple_.toString();
     }
     return result;

package/lbug-source/test/api/api_test.cpp

@@ -488,6 +488,24 @@ TEST_F(ApiTest, CloseDatabaseBeforeQueryResultWithMultipleStatements) {
     inMemoryDatabase.reset();
 }
 
+TEST_F(ApiTest, ToStringDoesNotModifyIterator) {
+    auto result = conn->query("MATCH (p:person) RETURN p.ID ORDER BY p.ID");
+    ASSERT_TRUE(result->isSuccess());
+    ASSERT_TRUE(result->hasNext()); // Iterator should be at the beginning
+    auto str = result->toString();  // This should not modify the iterator
+    ASSERT_TRUE(result->hasNext()); // Iterator should still be at the beginning
+    // Now iterate through the results
+    std::vector<int64_t> ids;
+    while (result->hasNext()) {
+        auto tuple = result->getNext();
+        ids.push_back(tuple->getValue(0)->getValue<int64_t>());
+    }
+    ASSERT_EQ(ids.size(), 8u); // Assuming 8 persons in the test data
+    ASSERT_EQ(ids[0], 0);
+    ASSERT_EQ(ids[1], 2);
+    // etc., but just check the count for now
+}
+
 TEST_F(ApiTest, EmptyDBFile) {
     if (inMemMode) {
         GTEST_SKIP();

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "lbug",
-  "version": "0.12.3-dev.3",
+  "version": "0.12.3-dev.5",
   "description": "An in-process property graph database management system built for query speed and scalability.",
   "main": "index.js",
   "module": "./index.mjs",