delta-trace-db 0.0.18.post1__tar.gz

delta_trace_db-0.0.18.post1/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 [yyyy] [name of copyright owner]
+
+   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.

delta_trace_db-0.0.18.post1/PKG-INFO

@@ -0,0 +1,120 @@
+Metadata-Version: 2.4
+Name: delta_trace_db
+Version: 0.0.18.post1
+Summary: The NoSQL in-memory database with class-based functionality and detailed operation history tracking.
+Author: Masahide Mori
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/MasahideMori-SimpleAppli/delta_trace_db_py
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: file-state-manager>=2.0.0
+Dynamic: license-file
+
+# delta_trace_db_py
+
+Python implementation of DeltaTraceDB.
+
+## Usage
+
+Please refer to the [Dart version](https://github.com/MasahideMori-SimpleAppli/delta_trace_db).  
+There are some differences,   
+such as arguments being snake case by default and an underscore being added after the variable name   
+if there is a namespace conflict with a standard function, but the usage is the same.
+
+## Speed
+
+This package is an in-memory database, so it is generally fast.  
+Currently, there is no mechanism to speed it up, but it works almost the same as a for loop in a program,  
+so there is usually no problem with around 100,000 records.  
+I recommend that you test it in an actual environment using speed_test.dart in the test folder.  
+However, since it consumes RAM capacity according to the amount of data,  
+if you need an extremely large database, consider using a general database.  
+For reference, below are the results of a speed test (test/speed_test.dart) run on a slightly  
+older PC equipped with a Ryzen 3600 CPU.  
+The test conditions were chosen to take a sufficiently long time, but I think it will rarely
+cause   
+any problems in practical use.
+Please note that speeds also depend on the amount of data, so if you have a lot of large data, it will be slower.
+
+```text
+tests/test_speed.py speed test for 100000 records
+start add
+end add: 339 ms
+start getAll (with object convert)
+end getAll: 659 ms
+returnsLength: 100000
+start save (with json string convert)
+end save: 467 ms
+start load (with json string convert)
+end load: 557 ms
+start search (with object convert)
+end search: 818 ms
+returnsLength: 100000
+start search paging, half limit pre search (with object convert)
+end search paging: 379 ms
+returnsLength: 50000
+start update at half index and last index object
+end update: 96 ms
+start updateOne of half index object
+end updateOne: 31 ms
+start conformToTemplate
+end conformToTemplate: 79 ms
+start delete half object (with object convert)
+end delete: 562 ms
+returnsLength: 50000
+start deleteOne for last object (with object convert)
+end deleteOne: 22 ms
+returnsLength: 1
+```
+
+## Future plans
+
+It is possible to speed up the database, but this is a low priority, so I think that improving
+usability and creating peripheral tools will take priority.
+
+## Support
+
+There is essentially no support at this time, but bugs will likely be fixed.  
+If you find any issues, please open an issue on Github.
+
+## About version control
+
+The C part will be changed at the time of version upgrade.  
+However, versions less than 1.0.0 may change the file structure regardless of the following rules.
+
+- Changes such as adding variables, structure change that cause problems when reading previous
+  files.
+    - C.X.X
+- Adding methods, etc.
+    - X.C.X
+- Minor changes and bug fixes.
+    - X.X.C
+
+## License
+
+This software is released under the Apache-2.0 License, see LICENSE file.
+
+Copyright 2025 Masahide Mori
+
+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.
+
+## Copyright notice
+
+The “Dart” name and “Flutter” name are trademarks of Google LLC.  
+*The developer of this package is not Google LLC.
+
+## Trademarks
+
+The "Python" name is a trademark of the Python Software Foundation.
+*The developer of this package is not affiliated with the Python Software Foundation.

delta_trace_db-0.0.18.post1/README.md

@@ -0,0 +1,107 @@
+# delta_trace_db_py
+
+Python implementation of DeltaTraceDB.
+
+## Usage
+
+Please refer to the [Dart version](https://github.com/MasahideMori-SimpleAppli/delta_trace_db).  
+There are some differences,   
+such as arguments being snake case by default and an underscore being added after the variable name   
+if there is a namespace conflict with a standard function, but the usage is the same.
+
+## Speed
+
+This package is an in-memory database, so it is generally fast.  
+Currently, there is no mechanism to speed it up, but it works almost the same as a for loop in a program,  
+so there is usually no problem with around 100,000 records.  
+I recommend that you test it in an actual environment using speed_test.dart in the test folder.  
+However, since it consumes RAM capacity according to the amount of data,  
+if you need an extremely large database, consider using a general database.  
+For reference, below are the results of a speed test (test/speed_test.dart) run on a slightly  
+older PC equipped with a Ryzen 3600 CPU.  
+The test conditions were chosen to take a sufficiently long time, but I think it will rarely
+cause   
+any problems in practical use.
+Please note that speeds also depend on the amount of data, so if you have a lot of large data, it will be slower.
+
+```text
+tests/test_speed.py speed test for 100000 records
+start add
+end add: 339 ms
+start getAll (with object convert)
+end getAll: 659 ms
+returnsLength: 100000
+start save (with json string convert)
+end save: 467 ms
+start load (with json string convert)
+end load: 557 ms
+start search (with object convert)
+end search: 818 ms
+returnsLength: 100000
+start search paging, half limit pre search (with object convert)
+end search paging: 379 ms
+returnsLength: 50000
+start update at half index and last index object
+end update: 96 ms
+start updateOne of half index object
+end updateOne: 31 ms
+start conformToTemplate
+end conformToTemplate: 79 ms
+start delete half object (with object convert)
+end delete: 562 ms
+returnsLength: 50000
+start deleteOne for last object (with object convert)
+end deleteOne: 22 ms
+returnsLength: 1
+```
+
+## Future plans
+
+It is possible to speed up the database, but this is a low priority, so I think that improving
+usability and creating peripheral tools will take priority.
+
+## Support
+
+There is essentially no support at this time, but bugs will likely be fixed.  
+If you find any issues, please open an issue on Github.
+
+## About version control
+
+The C part will be changed at the time of version upgrade.  
+However, versions less than 1.0.0 may change the file structure regardless of the following rules.
+
+- Changes such as adding variables, structure change that cause problems when reading previous
+  files.
+    - C.X.X
+- Adding methods, etc.
+    - X.C.X
+- Minor changes and bug fixes.
+    - X.X.C
+
+## License
+
+This software is released under the Apache-2.0 License, see LICENSE file.
+
+Copyright 2025 Masahide Mori
+
+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.
+
+## Copyright notice
+
+The “Dart” name and “Flutter” name are trademarks of Google LLC.  
+*The developer of this package is not Google LLC.
+
+## Trademarks
+
+The "Python" name is a trademark of the Python Software Foundation.
+*The developer of this package is not affiliated with the Python Software Foundation.

delta_trace_db-0.0.18.post1/delta_trace_db/__init__.py

@@ -0,0 +1 @@
+

delta_trace_db-0.0.18.post1/delta_trace_db/db/__init__.py

@@ -0,0 +1 @@
+

delta_trace_db-0.0.18.post1/delta_trace_db/db/delta_trace_db_collection.py

@@ -0,0 +1,222 @@
+# coding: utf-8
+import functools
+from typing import Any, Callable, Dict, List, Set
+from file_state_manager.cloneable_file import CloneableFile
+from delta_trace_db.db.util_copy import UtilCopy
+from delta_trace_db.query.nodes.query_node import QueryNode
+from delta_trace_db.query.query import Query
+from delta_trace_db.query.query_result import QueryResult
+
+
+class Collection(CloneableFile):
+    class_name = "Collection"
+    version = "7"
+
+    def __init__(self):
+        super().__init__()
+        self._data: List[Dict[str, Any]] = []
+        self.listeners: Set[Callable[[], None]] = set()
+        self._is_transaction_mode: bool = False
+        self.run_notify_listeners_in_transaction: bool = False
+
+    def change_transaction_mode(self, is_transaction_mode: bool):
+        self._is_transaction_mode = is_transaction_mode
+        self.run_notify_listeners_in_transaction = False
+
+    @classmethod
+    def from_dict(cls, src: Dict[str, Any]) -> "Collection":
+        instance = cls()
+        instance._data = UtilCopy.jsonable_deep_copy(src.get("data", []))
+        return instance
+
+    def to_dict(self) -> Dict[str, Any]:
+        return {
+            "className": self.class_name,
+            "version": self.version,
+            "data": UtilCopy.jsonable_deep_copy(self._data)
+        }
+
+    def clone(self) -> "Collection":
+        return Collection.from_dict(self.to_dict())
+
+    @property
+    def raw(self) -> List[Dict[str, Any]]:
+        return self._data
+
+    @property
+    def length(self) -> int:
+        return len(self._data)
+
+    def add_listener(self, cb: Callable[[], None]):
+        self.listeners.add(cb)
+
+    def remove_listener(self, cb: Callable[[], None]):
+        self.listeners.discard(cb)
+
+    def notify_listeners(self):
+        if not self._is_transaction_mode:
+            for cb in self.listeners:
+                cb()
+        else:
+            self.run_notify_listeners_in_transaction = True
+
+    def _evaluate(self, record: Dict[str, Any], node: QueryNode) -> bool:
+        return node.evaluate(record)
+
+    def add_all(self, q: Query) -> QueryResult:
+        add_data = UtilCopy.jsonable_deep_copy(q.add_data)
+        self._data.extend(add_data)
+        self.notify_listeners()
+        return QueryResult(True, q.type, [], len(self._data), len(add_data), 0)
+
+    def update(self, q: Query, is_single_target: bool) -> QueryResult:
+        if q.return_data:
+            r = []
+            for item in self._data:
+                if self._evaluate(item, q.query_node):
+                    item.update(UtilCopy.jsonable_deep_copy(q.override_data))
+                    r.append(item)
+                    if is_single_target:
+                        break
+            if r:
+                # 要素が空ではないなら通知を発行。
+                self.notify_listeners()
+            return QueryResult(True, q.type, UtilCopy.jsonable_deep_copy(r), len(self._data), len(r), len(r))
+        else:
+            count = 0
+            for item in self._data:
+                if self._evaluate(item, q.query_node):
+                    item.update(UtilCopy.jsonable_deep_copy(q.override_data))
+                    count += 1
+                    if is_single_target:
+                        break
+            if count > 0:
+                self.notify_listeners()
+            return QueryResult(True, q.type, [], len(self._data), count, count)
+
+    def delete(self, q: Query) -> QueryResult:
+        if q.return_data:
+            deleted_items = [item for item in self._data if self._evaluate(item, q.query_node)]
+            self._data = [item for item in self._data if not self._evaluate(item, q.query_node)]
+            if deleted_items:
+                self.notify_listeners()
+            return QueryResult(True, q.type, UtilCopy.jsonable_deep_copy(deleted_items), len(self._data),
+                               len(deleted_items),
+                               len(deleted_items))
+        else:
+            count = sum(1 for item in self._data if self._evaluate(item, q.query_node))
+            self._data = [item for item in self._data if not self._evaluate(item, q.query_node)]
+            if count > 0:
+                self.notify_listeners()
+            return QueryResult(True, q.type, [], len(self._data), count, count)
+
+    def delete_one(self, q: Query) -> QueryResult:
+        deleted_items = []
+        for i, item in enumerate(self._data):
+            if self._evaluate(item, q.query_node):
+                deleted_items.append(item)
+                del self._data[i]
+                break
+        if deleted_items:
+            self.notify_listeners()
+        return QueryResult(True, q.type, UtilCopy.jsonable_deep_copy(deleted_items), len(self._data),
+                           len(deleted_items),
+                           len(deleted_items))
+
+    def search(self, q: Query) -> QueryResult:
+        r: List[Dict[str, Any]] = []
+        # 検索
+        for item in self._data:
+            if self._evaluate(item, q.query_node):
+                r.append(item)
+        hit_count = len(r)
+        # ソートやページングのオプション
+        if q.sort_obj is not None:
+            sorted_list = list(r)
+            sorted_list.sort(key=functools.cmp_to_key(q.sort_obj.get_comparator()))
+            r = sorted_list
+            if q.offset is not None:
+                if q.offset > 0:
+                    r = r[q.offset:]
+            else:
+                if q.start_after is not None:
+                    try:
+                        index = r.index(q.start_after)
+                        if index != -1 and index + 1 < len(r):
+                            r = r[index + 1:]
+                        elif index != -1 and index + 1 >= len(r):
+                            r = []
+                    except ValueError:
+                        pass
+                elif q.end_before is not None:
+                    try:
+                        index = r.index(q.end_before)
+                        if index != -1:
+                            r = r[:index]
+                    except ValueError:
+                        pass
+        if q.limit is not None:
+            if q.offset is None and q.start_after is None and q.end_before is not None:
+                r = r[-q.limit:] if len(r) > q.limit else r
+            else:
+                r = r[:q.limit]
+        return QueryResult(
+            is_success=True,
+            type_=q.type,
+            result=UtilCopy.jsonable_deep_copy(r),
+            db_length=len(self._data),
+            update_count=0,
+            hit_count=hit_count,
+        )
+
+    def get_all(self, q: Query) -> QueryResult:
+        r = UtilCopy.jsonable_deep_copy(self._data)
+        if q.sort_obj:
+            r.sort(key=q.sort_obj.get_comparator())
+        return QueryResult(True, q.type, r, len(self._data), 0, len(r))
+
+    def conform_to_template(self, q: Query) -> QueryResult:
+        for item in self._data:
+            keys_to_remove = [k for k in item.keys() if k not in q.template]
+            for k in keys_to_remove:
+                item.pop(k)
+            for k, v in q.template.items():
+                if k not in item:
+                    item[k] = UtilCopy.jsonable_deep_copy(v)
+        self.notify_listeners()
+        return QueryResult(True, q.type, [], len(self._data), len(self._data), len(self._data))
+
+    def rename_field(self, q: Query) -> QueryResult:
+        r = []
+        for item in self._data:
+            if q.rename_before not in item:
+                return QueryResult(False, q.type, [], len(self._data), 0, 0,
+                                   f'The target key does not exist. key:{q.rename_before}')
+            if q.rename_after in item:
+                return QueryResult(False, q.type, [], len(self._data), 0, 0,
+                                   f'An existing key was specified as the new key. key:{q.rename_after}')
+        update_count = 0
+        for item in self._data:
+            item[q.rename_after] = item[q.rename_before]
+            del item[q.rename_before]
+            update_count += 1
+            if q.return_data:
+                r.append(item)
+        self.notify_listeners()
+        return QueryResult(True, q.type, UtilCopy.jsonable_deep_copy(r), len(self._data), update_count, update_count)
+
+    def count(self, q: Query) -> QueryResult:
+        return QueryResult(True, q.type, [], len(self._data), 0, len(self._data))
+
+    def clear(self, q: Query) -> QueryResult:
+        pre_len = len(self._data)
+        self._data.clear()
+        self.notify_listeners()
+        return QueryResult(True, q.type, [], 0, pre_len, pre_len)
+
+    def clear_add(self, q: Query) -> QueryResult:
+        pre_len = len(self._data)
+        self._data.clear()
+        self._data.extend(UtilCopy.jsonable_deep_copy(q.add_data))
+        self.notify_listeners()
+        return QueryResult(True, q.type, [], len(self._data), pre_len, pre_len)