@based/db 0.0.71 → 0.1.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1.  Definitions.
+
+    "License" shall mean the terms and conditions for use, reproduction,
+    and distribution as defined by Sections 1 through 9 of this document.
+
+    "Licensor" shall mean the copyright owner or entity authorized by
+    the copyright owner that is granting the License.
+
+    "Legal Entity" shall mean the union of the acting entity and all
+    other entities that control, are controlled by, or are under common
+    control with that entity. For the purposes of this definition,
+    "control" means (i) the power, direct or indirect, to cause the
+    direction or management of such entity, whether by contract or
+    otherwise, or (ii) ownership of fifty percent (50%) or more of the
+    outstanding shares, or (iii) beneficial ownership of such entity.
+
+    "You" (or "Your") shall mean an individual or Legal Entity
+    exercising permissions granted by this License.
+
+    "Source" form shall mean the preferred form for making modifications,
+    including but not limited to software source code, documentation
+    source, and configuration files.
+
+    "Object" form shall mean any form resulting from mechanical
+    transformation or translation of a Source form, including but
+    not limited to compiled object code, generated documentation,
+    and conversions to other media types.
+
+    "Work" shall mean the work of authorship, whether in Source or
+    Object form, made available under the License, as indicated by a
+    copyright notice that is included in or attached to the work
+    (an example is provided in the Appendix below).
+
+    "Derivative Works" shall mean any work, whether in Source or Object
+    form, that is based on (or derived from) the Work and for which the
+    editorial revisions, annotations, elaborations, or other modifications
+    represent, as a whole, an original work of authorship. For the purposes
+    of this License, Derivative Works shall not include works that remain
+    separable from, or merely link (or bind by name) to the interfaces of,
+    the Work and Derivative Works thereof.
+
+    "Contribution" shall mean any work of authorship, including
+    the original version of the Work and any modifications or additions
+    to that Work or Derivative Works thereof, that is intentionally
+    submitted to Licensor for inclusion in the Work by the copyright owner
+    or by an individual or Legal Entity authorized to submit on behalf of
+    the copyright owner. For the purposes of this definition, "submitted"
+    means any form of electronic, verbal, or written communication sent
+    to the Licensor or its representatives, including but not limited to
+    communication on electronic mailing lists, source code control systems,
+    and issue tracking systems that are managed by, or on behalf of, the
+    Licensor for the purpose of discussing and improving the Work, but
+    excluding communication that is conspicuously marked or otherwise
+    designated in writing by the copyright owner as "Not a Contribution."
+
+    "Contributor" shall mean Licensor and any individual or Legal Entity
+    on behalf of whom a Contribution has been received by Licensor and
+    subsequently incorporated within the Work.
+
+2.  Grant of Copyright License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    copyright license to reproduce, prepare Derivative Works of,
+    publicly display, publicly perform, sublicense, and distribute the
+    Work and such Derivative Works in Source or Object form.
+
+3.  Grant of Patent License. Subject to the terms and conditions of
+    this License, each Contributor hereby grants to You a perpetual,
+    worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+    (except as stated in this section) patent license to make, have made,
+    use, offer to sell, sell, import, and otherwise transfer the Work,
+    where such license applies only to those patent claims licensable
+    by such Contributor that are necessarily infringed by their
+    Contribution(s) alone or by combination of their Contribution(s)
+    with the Work to which such Contribution(s) was submitted. If You
+    institute patent litigation against any entity (including a
+    cross-claim or counterclaim in a lawsuit) alleging that the Work
+    or a Contribution incorporated within the Work constitutes direct
+    or contributory patent infringement, then any patent licenses
+    granted to You under this License for that Work shall terminate
+    as of the date such litigation is filed.
+
+4.  Redistribution. You may reproduce and distribute copies of the
+    Work or Derivative Works thereof in any medium, with or without
+    modifications, and in Source or Object form, provided that You
+    meet the following conditions:
+
+    (a) You must give any other recipients of the Work or
+    Derivative Works a copy of this License; and
+
+    (b) You must cause any modified files to carry prominent notices
+    stating that You changed the files; and
+
+    (c) You must retain, in the Source form of any Derivative Works
+    that You distribute, all copyright, patent, trademark, and
+    attribution notices from the Source form of the Work,
+    excluding those notices that do not pertain to any part of
+    the Derivative Works; and
+
+    (d) If the Work includes a "NOTICE" text file as part of its
+    distribution, then any Derivative Works that You distribute must
+    include a readable copy of the attribution notices contained
+    within such NOTICE file, excluding those notices that do not
+    pertain to any part of the Derivative Works, in at least one
+    of the following places: within a NOTICE text file distributed
+    as part of the Derivative Works; within the Source form or
+    documentation, if provided along with the Derivative Works; or,
+    within a display generated by the Derivative Works, if and
+    wherever such third-party notices normally appear. The contents
+    of the NOTICE file are for informational purposes only and
+    do not modify the License. You may add Your own attribution
+    notices within Derivative Works that You distribute, alongside
+    or as an addendum to the NOTICE text from the Work, provided
+    that such additional attribution notices cannot be construed
+    as modifying the License.
+
+    You may add Your own copyright statement to Your modifications and
+    may provide additional or different license terms and conditions
+    for use, reproduction, or distribution of Your modifications, or
+    for any such Derivative Works as a whole, provided Your use,
+    reproduction, and distribution of the Work otherwise complies with
+    the conditions stated in this License.
+
+5.  Submission of Contributions. Unless You explicitly state otherwise,
+    any Contribution intentionally submitted for inclusion in the Work
+    by You to the Licensor shall be under the terms and conditions of
+    this License, without any additional terms or conditions.
+    Notwithstanding the above, nothing herein shall supersede or modify
+    the terms of any separate license agreement you may have executed
+    with Licensor regarding such Contributions.
+
+6.  Trademarks. This License does not grant permission to use the trade
+    names, trademarks, service marks, or product names of the Licensor,
+    except as required for reasonable and customary use in describing the
+    origin of the Work and reproducing the content of the NOTICE file.
+
+7.  Disclaimer of Warranty. Unless required by applicable law or
+    agreed to in writing, Licensor provides the Work (and each
+    Contributor provides its Contributions) on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+    implied, including, without limitation, any warranties or conditions
+    of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+    PARTICULAR PURPOSE. You are solely responsible for determining the
+    appropriateness of using or redistributing the Work and assume any
+    risks associated with Your exercise of permissions under this License.
+
+8.  Limitation of Liability. In no event and under no legal theory,
+    whether in tort (including negligence), contract, or otherwise,
+    unless required by applicable law (such as deliberate and grossly
+    negligent acts) or agreed to in writing, shall any Contributor be
+    liable to You for damages, including any direct, indirect, special,
+    incidental, or consequential damages of any character arising as a
+    result of this License or out of the use or inability to use the
+    Work (including but not limited to damages for loss of goodwill,
+    work stoppage, computer failure or malfunction, or any and all
+    other commercial damages or losses), even if such Contributor
+    has been advised of the possibility of such damages.
+
+9.  Accepting Warranty or Additional Liability. While redistributing
+    the Work or Derivative Works thereof, You may choose to offer,
+    and charge a fee for, acceptance of support, warranty, indemnity,
+    or other liability obligations and/or rights consistent with this
+    License. However, in accepting such obligations, You may act only
+    on Your own behalf and on Your sole responsibility, not on behalf
+    of any other Contributor, and only if You agree to indemnify,
+    defend, and hold each Contributor harmless for any liability
+    incurred by, or claims asserted against, such Contributor by reason
+    of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+Copyright 2025 Saulx B.V.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/README.md

@@ -1,16 +1,29 @@
 # BasedDb
 
-BasedDb is a powerful database solution that supports various data types, references, edges, and operations. It also offers concurrency handling, client-server architecture support, and more.
+BasedDb is a powerful node graph based database solution that supports various
+data types, references, edges, and operations. It also offers concurrency
+handling, client-server architecture support, and more.
 
 ## Features
 
 - Schema definition and management
 - Data creation, querying, updating, and deletion
-- Support for strings, numbers, booleans, binaries, aliases, enums, and cardinality
-- Edges and references for advanced data modeling
+- Supported field types
+  - `string`
+  - `text`, locale aware multi-language [text](./README_Text.md)
+  - `binary` strings
+  - `timestamp`
+  - numeric types: `number` (double-precision floating-point), `int8`, `uint8`, `int16`, `uint16`, `int32`, `uint64`
+  - `boolean`
+  - `alias`
+  - `enum`
+  - row and columnar vectors: `vector` and `colvec`
+  - `cardinality` set
+- References and edge properties for advanced data modeling
 - Concurrency support for high-load scenarios
 - Client-server design for distributed systems
 - Checksum, analytics, and expiration features
+- Async block based backups, i.e. only dirty blocks needs to be written on save
 
 ## Install
 
@@ -121,7 +134,7 @@ await db.setSchema({
         profilePicture: 'binary', // Raw binary data (Uint8Array)
         settings: 'json', // JSON object/array
         visits: 'cardinality', // HyperLogLog counter for unique values
-        embedding: { type: 'vector', size: 5 }, // Fixed-size float vector (size from test)
+        embedding: { type: 'vector', size: 5, baseType: 'float32' }, // Fixed-size float vector (size from test)
         status: ['pending', 'active', 'inactive'], // Enum type
         countryCode: { type: 'string', maxBytes: 2 }, // String with max byte length
         nestedData: {
@@ -178,7 +191,77 @@ const userWithFriendId = await db.create('user', {
 const dialogFi = await db.create('dialog', { fun: 'hauskaa' }, { locale: 'fi' })
 ```
 
-### Read (Query)
+### Update
+
+```typescript
+// Update specific fields
+await db.update('user', userId, { age: 31, isActive: false })
+
+// Update using payload.id
+await db.update('user', { id: userId, age: 32 })
+
+// Atomic increment/decrement (number/timestamp)
+await db.update('user', userId, {
+  age: { increment: 1 },
+  score: { decrement: 0.5 },
+})
+
+// Update references (single)
+await db.update('user', userWithFriendId, { bestFriend: userId })
+
+// Update references (list) - add, delete, update edge props
+await db.update('user', userWithFriendId, {
+  friends: {
+    add: [userId],
+    delete: [friendId],
+    update: [{ id: userId, $friendshipLevel: 10 }],
+  },
+})
+
+// Replace references (list)
+await db.update('user', userWithFriendId, { friends: [userId] }) // Replaces entire list
+
+// Clear references
+await db.update('user', userWithFriendId, { friends: null, bestFriend: null })
+
+// Update cardinality field
+await db.update('user', userId, { visits: 'newSession' }) // Adds 'newSession' if unique
+
+// Update root properties
+await db.update({ siteName: 'My Awesome Site V2' })
+
+// Update text with specific locale
+await db.update(
+  'dialog',
+  dialogFi,
+  { fun: 'vielä hauskempaa' },
+  { locale: 'fi' },
+)
+
+// Update timestamp with string parsing
+await db.update('user', userId, { updatedAt: 'now + 1h' }) // Relative time
+```
+
+### Upsert
+
+Update if alias exists, otherwise create.
+
+```typescript
+await db.upsert('user', {
+  alias: 'alice@example.com', // The alias to match
+  name: 'Alice Smith', // Field to update or set on create
+  age: 33, // Another field
+})
+```
+
+### Delete
+
+```typescript
+// Delete a node by ID
+await db.delete('user', userId)
+```
+
+### Query
 
 The \`query\` method starts building a request to retrieve data.
 
@@ -235,7 +318,7 @@ Operators:
 - \`<\`: Less than (numbers, timestamps).
 - \`>=\`: Greater than or equal to.
 - \`<=\`: Less than or equal to.
-- \`has\`: Contains substring (case-insensitive by default for \`string\`, \`text\`).
+- \`has\`: Contains substring (case sensitive by default for \`string\`, \`text\`, could be case insentive passing option argument).
 - \`like\`: Fuzzy search / similarity (for \`string\`, \`text\`, \`vector\`).
 
 **Filter Examples:**
@@ -405,6 +488,21 @@ await db.query('article').sort('email', 'desc').get()
 await db.query('event').sort('startTime').get()
 ```
 
+The following data types doesnt support sort:
+
+- Reference / References (you can if you use branched queries / nested include sintax) like
+
+  ```js await db
+  .query('actor')
+  .include('*')
+  .include((q) => q('movies').include('*').sort('name', 'desc'), '*')
+  .sort('name', 'asc')
+  .get()
+  ```
+
+- Vector
+- Binary
+
 #### \`.range(offset, limit)\`
 
 Paginates the results.
@@ -484,76 +582,6 @@ const specificUsers = await db
   .then((res) => res.toObject()) // Get plain objects
 ```
 
-### Update
-
-```typescript
-// Update specific fields
-await db.update('user', userId, { age: 31, isActive: false })
-
-// Update using payload.id
-await db.update('user', { id: userId, age: 32 })
-
-// Atomic increment/decrement (number/timestamp)
-await db.update('user', userId, {
-  age: { increment: 1 },
-  score: { decrement: 0.5 },
-})
-
-// Update references (single)
-await db.update('user', userWithFriendId, { bestFriend: userId })
-
-// Update references (list) - add, delete, update edge props
-await db.update('user', userWithFriendId, {
-  friends: {
-    add: [userId],
-    delete: [friendId],
-    update: [{ id: userId, $friendshipLevel: 10 }],
-  },
-})
-
-// Replace references (list)
-await db.update('user', userWithFriendId, { friends: [userId] }) // Replaces entire list
-
-// Clear references
-await db.update('user', userWithFriendId, { friends: null, bestFriend: null })
-
-// Update cardinality field
-await db.update('user', userId, { visits: 'newSession' }) // Adds 'newSession' if unique
-
-// Update root properties
-await db.update({ siteName: 'My Awesome Site V2' })
-
-// Update text with specific locale
-await db.update(
-  'dialog',
-  dialogFi,
-  { fun: 'vielä hauskempaa' },
-  { locale: 'fi' },
-)
-
-// Update timestamp with string parsing
-await db.update('user', userId, { updatedAt: 'now + 1h' }) // Relative time
-```
-
-### Upsert
-
-Update if alias exists, otherwise create.
-
-```typescript
-await db.upsert('user', {
-  alias: 'alice@example.com', // The alias to match
-  name: 'Alice Smith', // Field to update or set on create
-  age: 33, // Another field
-})
-```
-
-### Delete
-
-```typescript
-// Delete a node by ID
-await db.delete('user', userId)
-```
-
 ### Persistence & Control
 
 ```typescript
@@ -626,4 +654,4 @@ await clientDb.setSchema({
 ### Aggregations
 
 BasedDb support aggregate functions such as `sum('prop1','prop2')`, `count()`, etc and operations such as `groupBY('prop')`.
-See the specific doc [Aggregations](./README_Aggregate.md) for a detailed guide on its usage and features.
+See the specific README [Aggregations](./README_Aggregate.md) for a detailed information on its usage and features.

package/dist/lib/darwin_aarch64/include/libdeflate.h

@@ -212,6 +212,29 @@ libdeflate_decompress_ex(struct libdeflate_decompressor *decompressor,
 				 size_t *actual_in_nbytes_ret,
 				 size_t *actual_out_nbytes_ret);
 
+/**
+ * Decompress a small number of bytes into out.
+ * The size of the output buffer doesn't need to align with the block size of
+ * the compressed input, unlike with the block decompression API. The downside
+ * of this decompression function is that it's much slower for longer output
+ * sizes. However, it can be much faster to use this function to extract a
+ * small number of bytes (e.g. 16 bytes) rather than decompressing a full block
+ * and then extracting a few bytes from it. This is interesting also because a
+ * deflate block can be at least theoretically be extremely long, and they
+ * are typically >= 1kB in size in the wild. Whereas, with this function the
+ * output buffer can be even fitted in the stack as it's small and it's size
+ * can be hard-coded.
+ * @param in is a pointer to the compressed data.
+ * @param in_nbytes is the size of in.
+ * @param out_nbytes_avail is the size of the out buffer.
+ * @param actual_out_nbytes_ret returns the actual number of bytes decompressed.
+ */
+LIBDEFLATEEXPORT enum libdeflate_result
+libdeflate_decompress_short(struct libdeflate_decompressor *decompressor,
+			      const void *in, size_t in_nbytes,
+			      void *out, size_t out_nbytes_avail,
+			      size_t *actual_out_nbytes_ret);
+
 /**
  * ctrl libdeflate_decompress_block() stop condition
  */

package/dist/lib/darwin_aarch64/include/selva/db.h

@@ -292,47 +292,6 @@ struct SelvaNode *selva_prev_node(struct SelvaTypeEntry *type, struct SelvaNode
 SELVA_EXPORT
 struct SelvaNode *selva_next_node(struct SelvaTypeEntry *type, struct SelvaNode *node) __attribute__((nonnull));
 
-/**
- * \addtogroup db_cursor
- * @{
- */
-
-/**
- * Create a new cursor pointing to node.
- * If the node is deleted later then the cursor is updated to point to the next
- * node using selva_next_node().
- */
-SELVA_EXPORT
-cursor_id_t selva_cursor_new(struct SelvaTypeEntry *type, struct SelvaNode *node) __attribute__((nonnull));
-
-/**
- * Get a pointer to the node from a cursor.
- */
-SELVA_EXPORT
-struct SelvaNode *selva_cursor_get(struct SelvaTypeEntry *type, cursor_id_t id) __attribute__((nonnull));
-
-/**
- * Update a cursor to point to a new node.
- */
-SELVA_EXPORT
-int selva_cursor_update(struct SelvaTypeEntry *type, cursor_id_t id, struct SelvaNode *node) __attribute__((nonnull));
-
-/**
- * Delete a cursor.
- */
-SELVA_EXPORT
-void selva_cursor_del(struct SelvaTypeEntry *type, cursor_id_t id) __attribute__((nonnull));
-
-/**
- * Total count of cursors of type.
- */
-SELVA_EXPORT
-size_t selva_cursor_count(const struct SelvaTypeEntry *type) __attribute__((nonnull));
-
-/**
- * @}
- */
-
 /**
  * Total count of nodes of type.
  */

package/dist/lib/darwin_aarch64/include/selva/fast_linear_search.h

@@ -8,7 +8,8 @@
 #include "selva/types.h"
 
 struct SelvaNode;
-struct SelvaNodeReference;
+struct SelvaNodeSmallReference;
+struct SelvaNodeLargeReference;
 
 SELVA_EXPORT
 ssize_t fast_linear_search_uint32(const uint32_t arr[], size_t len, uint32_t x);
@@ -20,4 +21,7 @@ SELVA_EXPORT
 ssize_t fast_linear_search_node(const struct SelvaNode *arr[], size_t len, const struct SelvaNode *x);
 
 SELVA_EXPORT
-ssize_t fast_linear_search_references(const struct SelvaNodeReference *arr, size_t len, const struct SelvaNode *x);
+ssize_t fast_linear_search_references_small(const struct SelvaNodeSmallReference *arr, size_t len, const struct SelvaNode *x);
+
+SELVA_EXPORT
+ssize_t fast_linear_search_references_large(const struct SelvaNodeLargeReference *arr, size_t len, const struct SelvaNode *x);