automerge-rb 0.1.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +7 -0
- data/LICENSE.txt +22 -0
- data/README.md +175 -0
- data/ext/automerge_ext/automerge_ext.c +1805 -0
- data/ext/automerge_ext/extconf.rb +132 -0
- data/lib/automerge/version.rb +6 -0
- data/lib/automerge.rb +110 -0
- data/rust-toolchain.toml +4 -0
- data/vendor/automerge-rust/Cargo.lock +1909 -0
- data/vendor/automerge-rust/Cargo.toml +15 -0
- data/vendor/automerge-rust/automerge/Cargo.toml +78 -0
- data/vendor/automerge-rust/automerge/README.md +5 -0
- data/vendor/automerge-rust/automerge/benches/load_save.rs +102 -0
- data/vendor/automerge-rust/automerge/benches/map.rs +260 -0
- data/vendor/automerge-rust/automerge/benches/range.rs +37 -0
- data/vendor/automerge-rust/automerge/benches/sync.rs +95 -0
- data/vendor/automerge-rust/automerge/examples/README.md +7 -0
- data/vendor/automerge-rust/automerge/examples/quickstart.rs +57 -0
- data/vendor/automerge-rust/automerge/examples/watch.rs +94 -0
- data/vendor/automerge-rust/automerge/fuzz/Cargo.toml +29 -0
- data/vendor/automerge-rust/automerge/fuzz/fuzz_targets/load.rs +37 -0
- data/vendor/automerge-rust/automerge/src/autocommit.rs +1286 -0
- data/vendor/automerge-rust/automerge/src/automerge/current_state.rs +546 -0
- data/vendor/automerge-rust/automerge/src/automerge/tests.rs +2023 -0
- data/vendor/automerge-rust/automerge/src/automerge.rs +2071 -0
- data/vendor/automerge-rust/automerge/src/autoserde.rs +128 -0
- data/vendor/automerge-rust/automerge/src/change.rs +357 -0
- data/vendor/automerge-rust/automerge/src/change_graph.rs +1215 -0
- data/vendor/automerge-rust/automerge/src/change_queue.rs +46 -0
- data/vendor/automerge-rust/automerge/src/clock.rs +206 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/boolean.rs +83 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/delta.rs +148 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/generic/group.rs +138 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/generic/simple.rs +76 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/generic.rs +93 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/key.rs +272 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/obj_id.rs +202 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/opid_list.rs +329 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/raw.rs +38 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/rle.rs +216 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range/value.rs +547 -0
- data/vendor/automerge-rust/automerge/src/columnar/column_range.rs +17 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/boolean.rs +197 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/col_error.rs +88 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/column_decoder.rs +133 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/decodable_impls.rs +175 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/delta.rs +96 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/encodable_impls.rs +200 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/leb128.rs +82 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/properties.rs +178 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/raw.rs +101 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding/rle.rs +239 -0
- data/vendor/automerge-rust/automerge/src/columnar/encoding.rs +67 -0
- data/vendor/automerge-rust/automerge/src/columnar/splice_error.rs +47 -0
- data/vendor/automerge-rust/automerge/src/columnar.rs +14 -0
- data/vendor/automerge-rust/automerge/src/convert.rs +112 -0
- data/vendor/automerge-rust/automerge/src/cursor.rs +296 -0
- data/vendor/automerge-rust/automerge/src/decoding.rs +475 -0
- data/vendor/automerge-rust/automerge/src/error.rs +159 -0
- data/vendor/automerge-rust/automerge/src/exid.rs +238 -0
- data/vendor/automerge-rust/automerge/src/hydrate/list.rs +140 -0
- data/vendor/automerge-rust/automerge/src/hydrate/map.rs +132 -0
- data/vendor/automerge-rust/automerge/src/hydrate/tests.rs +40 -0
- data/vendor/automerge-rust/automerge/src/hydrate/text.rs +89 -0
- data/vendor/automerge-rust/automerge/src/hydrate.rs +368 -0
- data/vendor/automerge-rust/automerge/src/indexed_cache.rs +113 -0
- data/vendor/automerge-rust/automerge/src/iter/doc.rs +603 -0
- data/vendor/automerge-rust/automerge/src/iter/keys.rs +93 -0
- data/vendor/automerge-rust/automerge/src/iter/list_range.rs +433 -0
- data/vendor/automerge-rust/automerge/src/iter/map_range.rs +316 -0
- data/vendor/automerge-rust/automerge/src/iter/spans.rs +601 -0
- data/vendor/automerge-rust/automerge/src/iter/tools.rs +427 -0
- data/vendor/automerge-rust/automerge/src/iter/values.rs +36 -0
- data/vendor/automerge-rust/automerge/src/iter.rs +25 -0
- data/vendor/automerge-rust/automerge/src/legacy/mod.rs +364 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/actor_id.rs +25 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/change_hash.rs +29 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/element_id.rs +27 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/mod.rs +31 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/object_id.rs +36 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/op.rs +668 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/op_type.rs +26 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/opid.rs +25 -0
- data/vendor/automerge-rust/automerge/src/legacy/serde_impls/scalar_value.rs +63 -0
- data/vendor/automerge-rust/automerge/src/legacy/utility_impls/element_id.rs +66 -0
- data/vendor/automerge-rust/automerge/src/legacy/utility_impls/key.rs +49 -0
- data/vendor/automerge-rust/automerge/src/legacy/utility_impls/mod.rs +4 -0
- data/vendor/automerge-rust/automerge/src/legacy/utility_impls/object_id.rs +74 -0
- data/vendor/automerge-rust/automerge/src/legacy/utility_impls/opid.rs +68 -0
- data/vendor/automerge-rust/automerge/src/lib.rs +315 -0
- data/vendor/automerge-rust/automerge/src/marks.rs +478 -0
- data/vendor/automerge-rust/automerge/src/op_set2/change/batch.rs +2002 -0
- data/vendor/automerge-rust/automerge/src/op_set2/change/collector.rs +974 -0
- data/vendor/automerge-rust/automerge/src/op_set2/change.rs +332 -0
- data/vendor/automerge-rust/automerge/src/op_set2/columns.rs +714 -0
- data/vendor/automerge-rust/automerge/src/op_set2/meta.rs +174 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op.rs +1363 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/elems.rs +43 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/found_op.rs +60 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/index.rs +197 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/insert.rs +179 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/mark_index.rs +292 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/marks.rs +86 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/op_iter.rs +1295 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/op_query.rs +82 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/top_op.rs +50 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set/visible.rs +290 -0
- data/vendor/automerge-rust/automerge/src/op_set2/op_set.rs +1793 -0
- data/vendor/automerge-rust/automerge/src/op_set2/parents.rs +133 -0
- data/vendor/automerge-rust/automerge/src/op_set2/skip_list.rs +714 -0
- data/vendor/automerge-rust/automerge/src/op_set2/types.rs +769 -0
- data/vendor/automerge-rust/automerge/src/op_set2.rs +18 -0
- data/vendor/automerge-rust/automerge/src/patches/patch.rs +95 -0
- data/vendor/automerge-rust/automerge/src/patches/patch_builder.rs +382 -0
- data/vendor/automerge-rust/automerge/src/patches/patch_log.rs +584 -0
- data/vendor/automerge-rust/automerge/src/patches.rs +7 -0
- data/vendor/automerge-rust/automerge/src/query/list_state.rs +230 -0
- data/vendor/automerge-rust/automerge/src/query/seek_mark.rs +142 -0
- data/vendor/automerge-rust/automerge/src/read.rs +326 -0
- data/vendor/automerge-rust/automerge/src/sequence_tree.rs +662 -0
- data/vendor/automerge-rust/automerge/src/storage/bundle/builder.rs +942 -0
- data/vendor/automerge-rust/automerge/src/storage/bundle/error.rs +42 -0
- data/vendor/automerge-rust/automerge/src/storage/bundle/meta.rs +23 -0
- data/vendor/automerge-rust/automerge/src/storage/bundle/storage.rs +146 -0
- data/vendor/automerge-rust/automerge/src/storage/bundle.rs +210 -0
- data/vendor/automerge-rust/automerge/src/storage/change/change_actors.rs +311 -0
- data/vendor/automerge-rust/automerge/src/storage/change/change_op_columns.rs +621 -0
- data/vendor/automerge-rust/automerge/src/storage/change/compressed.rs +51 -0
- data/vendor/automerge-rust/automerge/src/storage/change/op_with_change_actors.rs +1 -0
- data/vendor/automerge-rust/automerge/src/storage/change.rs +523 -0
- data/vendor/automerge-rust/automerge/src/storage/chunk.rs +312 -0
- data/vendor/automerge-rust/automerge/src/storage/columns/column.rs +42 -0
- data/vendor/automerge-rust/automerge/src/storage/columns/column_builder.rs +199 -0
- data/vendor/automerge-rust/automerge/src/storage/columns/column_specification.rs +340 -0
- data/vendor/automerge-rust/automerge/src/storage/columns/raw_column.rs +286 -0
- data/vendor/automerge-rust/automerge/src/storage/columns.rs +355 -0
- data/vendor/automerge-rust/automerge/src/storage/document/compression.rs +362 -0
- data/vendor/automerge-rust/automerge/src/storage/document.rs +411 -0
- data/vendor/automerge-rust/automerge/src/storage/load/change_collector.rs +15 -0
- data/vendor/automerge-rust/automerge/src/storage/load.rs +136 -0
- data/vendor/automerge-rust/automerge/src/storage/parse/leb128.rs +302 -0
- data/vendor/automerge-rust/automerge/src/storage/parse.rs +619 -0
- data/vendor/automerge-rust/automerge/src/storage/save/document.rs +27 -0
- data/vendor/automerge-rust/automerge/src/storage.rs +26 -0
- data/vendor/automerge-rust/automerge/src/sync/bloom.rs +161 -0
- data/vendor/automerge-rust/automerge/src/sync/message_builder.rs +118 -0
- data/vendor/automerge-rust/automerge/src/sync/state.rs +214 -0
- data/vendor/automerge-rust/automerge/src/sync/v1_compat_test/bloom.rs +162 -0
- data/vendor/automerge-rust/automerge/src/sync/v1_compat_test/mod.rs +625 -0
- data/vendor/automerge-rust/automerge/src/sync/v1_compat_test/state.rs +120 -0
- data/vendor/automerge-rust/automerge/src/sync.rs +2482 -0
- data/vendor/automerge-rust/automerge/src/text_diff/LICENSE +201 -0
- data/vendor/automerge-rust/automerge/src/text_diff/myers.rs +332 -0
- data/vendor/automerge-rust/automerge/src/text_diff/replace.rs +139 -0
- data/vendor/automerge-rust/automerge/src/text_diff/utils.rs +119 -0
- data/vendor/automerge-rust/automerge/src/text_diff.rs +515 -0
- data/vendor/automerge-rust/automerge/src/text_value.rs +276 -0
- data/vendor/automerge-rust/automerge/src/transaction/commit.rs +34 -0
- data/vendor/automerge-rust/automerge/src/transaction/inner.rs +1403 -0
- data/vendor/automerge-rust/automerge/src/transaction/manual_transaction.rs +147 -0
- data/vendor/automerge-rust/automerge/src/transaction/owned_transaction.rs +266 -0
- data/vendor/automerge-rust/automerge/src/transaction/result.rs +21 -0
- data/vendor/automerge-rust/automerge/src/transaction/transactable.rs +203 -0
- data/vendor/automerge-rust/automerge/src/transaction.rs +513 -0
- data/vendor/automerge-rust/automerge/src/types.rs +749 -0
- data/vendor/automerge-rust/automerge/src/validation.rs +29 -0
- data/vendor/automerge-rust/automerge/src/value.rs +763 -0
- data/vendor/automerge-rust/automerge/tests/batch_insert.rs +1034 -0
- data/vendor/automerge-rust/automerge/tests/block_tests.rs +887 -0
- data/vendor/automerge-rust/automerge/tests/convert_string_to_text.rs +72 -0
- data/vendor/automerge-rust/automerge/tests/diff_marks.rs +1508 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/64bit_obj_id_change.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/64bit_obj_id_doc.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/counter_value_has_incorrect_meta.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/counter_value_is_ok.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/counter_value_is_overlong.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/two_change_chunks.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/two_change_chunks_compressed.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fixtures/two_change_chunks_out_of_order.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/action-is-48.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/crash-da39a3ee5e6b4b0d3255bfef95601890afd80709 +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/incorrect_max_op.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/invalid_deflate_stream.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/missing_actor.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/overflow_in_length.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/too_many_deps.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/fuzz-crashers/too_many_ops.automerge +0 -0
- data/vendor/automerge-rust/automerge/tests/test.rs +2668 -0
- data/vendor/automerge-rust/automerge/tests/test_mark_patches.rs +41 -0
- data/vendor/automerge-rust/automerge/tests/test_save_load_orphans.rs +84 -0
- data/vendor/automerge-rust/automerge/tests/text.rs +1098 -0
- data/vendor/automerge-rust/automerge/tests/text_encoding.rs +640 -0
- data/vendor/automerge-rust/automerge-c/CMakeLists.txt +439 -0
- data/vendor/automerge-rust/automerge-c/Cargo.toml +22 -0
- data/vendor/automerge-rust/automerge-c/README.md +233 -0
- data/vendor/automerge-rust/automerge-c/build.rs +21 -0
- data/vendor/automerge-rust/automerge-c/cbindgen.toml +48 -0
- data/vendor/automerge-rust/automerge-c/cmake/Cargo.toml.in +22 -0
- data/vendor/automerge-rust/automerge-c/cmake/automerge-c-config.cmake.in +99 -0
- data/vendor/automerge-rust/automerge-c/cmake/cbindgen.toml.in +48 -0
- data/vendor/automerge-rust/automerge-c/cmake/config.h.in +58 -0
- data/vendor/automerge-rust/automerge-c/cmake/enum-string-functions-gen.cmake +183 -0
- data/vendor/automerge-rust/automerge-c/cmake/file-regex-replace.cmake +33 -0
- data/vendor/automerge-rust/automerge-c/cmake/file-touch.cmake +35 -0
- data/vendor/automerge-rust/automerge-c/docs/CMakeLists.txt +39 -0
- data/vendor/automerge-rust/automerge-c/docs/img/brandmark.png +0 -0
- data/vendor/automerge-rust/automerge-c/examples/CMakeLists.txt +42 -0
- data/vendor/automerge-rust/automerge-c/examples/README.md +9 -0
- data/vendor/automerge-rust/automerge-c/examples/quickstart.c +131 -0
- data/vendor/automerge-rust/automerge-c/include/automerge-c/utils/result.h +30 -0
- data/vendor/automerge-rust/automerge-c/include/automerge-c/utils/stack.h +130 -0
- data/vendor/automerge-rust/automerge-c/include/automerge-c/utils/stack_callback_data.h +53 -0
- data/vendor/automerge-rust/automerge-c/include/automerge-c/utils/string.h +29 -0
- data/vendor/automerge-rust/automerge-c/src/actor_id.rs +193 -0
- data/vendor/automerge-rust/automerge-c/src/byte_span.rs +227 -0
- data/vendor/automerge-rust/automerge-c/src/change.rs +356 -0
- data/vendor/automerge-rust/automerge-c/src/cursor.rs +168 -0
- data/vendor/automerge-rust/automerge-c/src/doc/list.rs +636 -0
- data/vendor/automerge-rust/automerge-c/src/doc/map.rs +556 -0
- data/vendor/automerge-rust/automerge-c/src/doc/mark.rs +296 -0
- data/vendor/automerge-rust/automerge-c/src/doc/utils.rs +46 -0
- data/vendor/automerge-rust/automerge-c/src/doc.rs +1009 -0
- data/vendor/automerge-rust/automerge-c/src/index.rs +84 -0
- data/vendor/automerge-rust/automerge-c/src/item.rs +2177 -0
- data/vendor/automerge-rust/automerge-c/src/items.rs +401 -0
- data/vendor/automerge-rust/automerge-c/src/lib.rs +11 -0
- data/vendor/automerge-rust/automerge-c/src/obj.rs +216 -0
- data/vendor/automerge-rust/automerge-c/src/result.rs +653 -0
- data/vendor/automerge-rust/automerge-c/src/sync/have.rs +42 -0
- data/vendor/automerge-rust/automerge-c/src/sync/message.rs +146 -0
- data/vendor/automerge-rust/automerge-c/src/sync/state.rs +262 -0
- data/vendor/automerge-rust/automerge-c/src/sync.rs +7 -0
- data/vendor/automerge-rust/automerge-c/src/utils/result.c +33 -0
- data/vendor/automerge-rust/automerge-c/src/utils/stack.c +106 -0
- data/vendor/automerge-rust/automerge-c/src/utils/stack_callback_data.c +9 -0
- data/vendor/automerge-rust/automerge-c/src/utils/string.c +46 -0
- data/vendor/automerge-rust/automerge-c/test/CMakeLists.txt +67 -0
- data/vendor/automerge-rust/automerge-c/test/actor_id_tests.c +140 -0
- data/vendor/automerge-rust/automerge-c/test/base_state.c +17 -0
- data/vendor/automerge-rust/automerge-c/test/base_state.h +39 -0
- data/vendor/automerge-rust/automerge-c/test/byte_span_tests.c +119 -0
- data/vendor/automerge-rust/automerge-c/test/cmocka_utils.c +91 -0
- data/vendor/automerge-rust/automerge-c/test/cmocka_utils.h +42 -0
- data/vendor/automerge-rust/automerge-c/test/cursor_tests.c +263 -0
- data/vendor/automerge-rust/automerge-c/test/doc_state.c +27 -0
- data/vendor/automerge-rust/automerge-c/test/doc_state.h +17 -0
- data/vendor/automerge-rust/automerge-c/test/doc_tests.c +335 -0
- data/vendor/automerge-rust/automerge-c/test/enum_string_tests.c +148 -0
- data/vendor/automerge-rust/automerge-c/test/files/brave-ape-49.automerge +0 -0
- data/vendor/automerge-rust/automerge-c/test/item_tests.c +313 -0
- data/vendor/automerge-rust/automerge-c/test/list_tests.c +544 -0
- data/vendor/automerge-rust/automerge-c/test/macro_utils.c +38 -0
- data/vendor/automerge-rust/automerge-c/test/macro_utils.h +23 -0
- data/vendor/automerge-rust/automerge-c/test/main.c +33 -0
- data/vendor/automerge-rust/automerge-c/test/map_tests.c +1610 -0
- data/vendor/automerge-rust/automerge-c/test/mark_tests.c +124 -0
- data/vendor/automerge-rust/automerge-c/test/ported_wasm/basic_tests.c +1642 -0
- data/vendor/automerge-rust/automerge-c/test/ported_wasm/cursor_tests.c +108 -0
- data/vendor/automerge-rust/automerge-c/test/ported_wasm/suite.c +17 -0
- data/vendor/automerge-rust/automerge-c/test/ported_wasm/sync_tests.c +1280 -0
- data/vendor/automerge-rust/automerge-c/test/str_utils.c +15 -0
- data/vendor/automerge-rust/automerge-c/test/str_utils.h +17 -0
- data/vendor/automerge-rust/automerge-test/Cargo.toml +17 -0
- data/vendor/automerge-rust/automerge-test/README.md +3 -0
- data/vendor/automerge-rust/automerge-test/src/lib.rs +487 -0
- data/vendor/automerge-rust/hexane/CHANGELOG.md +34 -0
- data/vendor/automerge-rust/hexane/Cargo.toml +47 -0
- data/vendor/automerge-rust/hexane/README.md +292 -0
- data/vendor/automerge-rust/hexane/RESULTS.txt +20 -0
- data/vendor/automerge-rust/hexane/TODO +18 -0
- data/vendor/automerge-rust/hexane/benches/insert.rs +82 -0
- data/vendor/automerge-rust/hexane/benches/seek.rs +77 -0
- data/vendor/automerge-rust/hexane/benches/splice.rs +82 -0
- data/vendor/automerge-rust/hexane/src/aggregate.rs +288 -0
- data/vendor/automerge-rust/hexane/src/boolean.rs +478 -0
- data/vendor/automerge-rust/hexane/src/columndata.rs +2540 -0
- data/vendor/automerge-rust/hexane/src/cursor.rs +756 -0
- data/vendor/automerge-rust/hexane/src/delta.rs +793 -0
- data/vendor/automerge-rust/hexane/src/encoder.rs +639 -0
- data/vendor/automerge-rust/hexane/src/leb128.rs +82 -0
- data/vendor/automerge-rust/hexane/src/lib.rs +95 -0
- data/vendor/automerge-rust/hexane/src/pack.rs +325 -0
- data/vendor/automerge-rust/hexane/src/raw.rs +314 -0
- data/vendor/automerge-rust/hexane/src/rle.rs +928 -0
- data/vendor/automerge-rust/hexane/src/slab/tree.rs +1373 -0
- data/vendor/automerge-rust/hexane/src/slab/writer.rs +535 -0
- data/vendor/automerge-rust/hexane/src/slab.rs +224 -0
- data/vendor/automerge-rust/hexane/src/test.rs +108 -0
- data/vendor/bundle/ruby/3.3.0/bin/rake +29 -0
- data/vendor/bundle/ruby/3.3.0/bin/rake-compiler +29 -0
- data/vendor/bundle/ruby/3.3.0/bin/rake-compiler-dock +29 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/History.rdoc +1732 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/Manifest.txt +32 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/README.rdoc +845 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/Rakefile +97 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/design_rationale.rb +54 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/hoe/minitest.rb +30 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/assertions.rb +850 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/autorun.rb +6 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/benchmark.rb +452 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/compress.rb +94 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/error_on_warning.rb +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/expectations.rb +321 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/hell.rb +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/manual_plugins.rb +16 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/mock.rb +327 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/parallel.rb +72 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/pride.rb +4 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/pride_plugin.rb +135 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/spec.rb +353 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/test.rb +238 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/test_task.rb +324 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest/unit.rb +42 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/lib/minitest.rb +1250 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/metametameta.rb +150 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_assertions.rb +1677 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_benchmark.rb +137 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_mock.rb +1213 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_reporter.rb +437 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_spec.rb +1159 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_test.rb +1374 -0
- data/vendor/bundle/ruby/3.3.0/gems/minitest-5.27.0/test/minitest/test_minitest_test_task.rb +57 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/History.rdoc +2454 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/MIT-LICENSE +21 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/README.rdoc +155 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/command_line_usage.rdoc +171 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/example/Rakefile1 +38 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/example/Rakefile2 +35 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/example/a.c +6 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/example/b.c +6 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/example/main.c +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/glossary.rdoc +42 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/jamis.rb +592 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/proto_rake.rdoc +127 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/rake.1 +156 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/rakefile.rdoc +635 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/doc/rational.rdoc +151 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/exe/rake +27 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/application.rb +847 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/backtrace.rb +25 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/clean.rb +78 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/cloneable.rb +17 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/cpu_counter.rb +122 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/default_loader.rb +15 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/dsl_definition.rb +196 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/early_time.rb +22 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/ext/core.rb +26 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/ext/string.rb +176 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/file_creation_task.rb +25 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/file_list.rb +435 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/file_task.rb +58 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/file_utils.rb +137 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/file_utils_ext.rb +135 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/invocation_chain.rb +57 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/invocation_exception_mixin.rb +17 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/late_time.rb +18 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/linked_list.rb +112 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/loaders/makefile.rb +54 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/multi_task.rb +14 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/name_space.rb +38 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/options.rb +31 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/packagetask.rb +222 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/phony.rb +16 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/private_reader.rb +21 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/promise.rb +100 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/pseudo_status.rb +30 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/rake_module.rb +67 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/rake_test_loader.rb +27 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/rule_recursion_overflow_error.rb +20 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/scope.rb +43 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/task.rb +434 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/task_argument_error.rb +8 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/task_arguments.rb +113 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/task_manager.rb +333 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/tasklib.rb +12 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/testtask.rb +192 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/thread_history_display.rb +49 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/thread_pool.rb +157 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/trace_output.rb +23 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/version.rb +10 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake/win32.rb +17 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/lib/rake.rb +69 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-13.4.2/rake.gemspec +102 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/Gemfile +8 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/History.md +695 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/LICENSE.txt +20 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/README.md +476 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/Rakefile +15 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/appveyor.yml +22 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/bin/rake-compiler +24 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/cucumber.yml +4 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/compile.feature +79 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/cross-compile.feature +23 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/cross-package-multi.feature +15 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/cross-package.feature +14 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/java-compile.feature +22 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/java-no-native-compile.feature +33 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/java-package.feature +24 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/package.feature +40 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/compilation.rb +70 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/cross_compilation.rb +27 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/execution.rb +52 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/folders.rb +32 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/gem.rb +46 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/step_definitions/java_compilation.rb +7 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/support/env.rb +10 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/support/file_template_helpers.rb +137 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/support/generator_helpers.rb +123 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/features/support/platform_extension_helpers.rb +27 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/lib/rake/baseextensiontask.rb +90 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/lib/rake/compiler_config.rb +38 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/lib/rake/extensioncompiler.rb +51 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/lib/rake/extensiontask.rb +589 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/lib/rake/javaextensiontask.rb +321 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/bin/cross-ruby.rake +189 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/bootstrap.rake +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/common.rake +10 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/cucumber.rake +23 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/gem.rake +15 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-1.3.1/tasks/rspec.rake +9 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/CHANGELOG.md +446 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/CONTRIBUTING.md +109 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/Dockerfile.jruby +79 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/Dockerfile.mri.erb +282 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/Gemfile +8 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/LICENSE.txt +22 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/README.md +447 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/Rakefile +246 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/bin/rake-compiler-dock +18 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/buildkitd.toml +2 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/gem_helper.rb +54 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/mk_i686.rb +18 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/mk_musl_cross.sh +37 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/mk_osxcross.sh +45 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/mk_pkg_config.sh +24 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/parallel_docker_build.rb +169 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/patches/rake-compiler-1.3.1/0004-Enable-build-of-static-libruby.patch +38 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/patches/rake-compiler-1.3.1/0005-build-miniruby-first.patch +16 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/patches/rake-compiler-1.3.1/0006-ruby-4-rubyspec-capiext.patch +16 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/rcd-env.sh +6 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/runas +7 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/sigfw.c +45 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/strip_wrapper_codesign +17 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/strip_wrapper_vbox +30 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/build/sudoers +1 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock/colors.rb +43 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock/docker_check.rb +356 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock/predefined_user_group.rb +5 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock/starter.rb +206 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock/version.rb +4 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/lib/rake_compiler_dock.rb +151 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/mingw64-ucrt/Dockerfile +66 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/mingw64-ucrt/README.md +14 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/mingw64-ucrt/binutils-mingw-w64-ignore-check-errors.patch +13 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/mingw64-ucrt/gcc-mingw-w64-only-c-c++.patch +13 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/mingw64-ucrt/mingw-w64-enable-ucrt.patch +22 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/rake-compiler-dock.gemspec +34 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/env/Dockerfile.alpine +17 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/env/Dockerfile.debian +24 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/fixtures/mig_test_rpc.defs +8 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/Gemfile +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/Rakefile +97 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/ext/java/RcdTestExtService.java +19 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/ext/java/RubyRcdTest.java +16 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/ext/mri/extconf.rb +111 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/ext/mri/rcd_test_ext.c +65 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/ext/mri/rcd_test_ext.h +11 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/lib/rcd_test.rb +6 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/rcd_test.gemspec +28 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/rcd_test/test/test_basic.rb +49 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_environment_variables.rb +108 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_mig.rb +18 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_parallel_docker_build.rb +95 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_rubygems_plugins.rb +12 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_starter.rb +158 -0
- data/vendor/bundle/ruby/3.3.0/gems/rake-compiler-dock-1.12.0/test/test_versions.rb +82 -0
- data/vendor/bundle/ruby/3.3.0/specifications/minitest-5.27.0.gemspec +32 -0
- data/vendor/bundle/ruby/3.3.0/specifications/rake-13.4.2.gemspec +26 -0
- data/vendor/bundle/ruby/3.3.0/specifications/rake-compiler-1.3.1.gemspec +33 -0
- data/vendor/bundle/ruby/3.3.0/specifications/rake-compiler-dock-1.12.0.gemspec +28 -0
- metadata +584 -0
|
@@ -0,0 +1,1280 @@
|
|
|
1
|
+
#include <setjmp.h>
|
|
2
|
+
#include <stdarg.h>
|
|
3
|
+
#include <stddef.h>
|
|
4
|
+
#include <stdint.h>
|
|
5
|
+
#include <stdlib.h>
|
|
6
|
+
|
|
7
|
+
/* third-party */
|
|
8
|
+
#include <cmocka.h>
|
|
9
|
+
|
|
10
|
+
/* local */
|
|
11
|
+
#include <automerge-c/automerge.h>
|
|
12
|
+
#include <automerge-c/utils/stack_callback_data.h>
|
|
13
|
+
#include "../base_state.h"
|
|
14
|
+
#include "../cmocka_utils.h"
|
|
15
|
+
|
|
16
|
+
typedef struct {
|
|
17
|
+
BaseState* base_state;
|
|
18
|
+
AMdoc* n1;
|
|
19
|
+
AMdoc* n2;
|
|
20
|
+
AMsyncState* s1;
|
|
21
|
+
AMsyncState* s2;
|
|
22
|
+
} TestState;
|
|
23
|
+
|
|
24
|
+
static int setup(void** state) {
|
|
25
|
+
TestState* test_state = test_calloc(1, sizeof(TestState));
|
|
26
|
+
setup_base((void**)&test_state->base_state);
|
|
27
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
28
|
+
AMactorId const* actor_id;
|
|
29
|
+
assert_true(AMitemToActorId(
|
|
30
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("01234567")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
31
|
+
&actor_id));
|
|
32
|
+
assert_true(
|
|
33
|
+
AMitemToDoc(AMstackItem(stack_ptr, AMcreate(actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)), &test_state->n1));
|
|
34
|
+
assert_true(AMitemToActorId(
|
|
35
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("89abcdef")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
36
|
+
&actor_id));
|
|
37
|
+
assert_true(
|
|
38
|
+
AMitemToDoc(AMstackItem(stack_ptr, AMcreate(actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)), &test_state->n2));
|
|
39
|
+
assert_true(AMitemToSyncState(
|
|
40
|
+
AMstackItem(stack_ptr, AMsyncStateInit(), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_STATE)), &test_state->s1));
|
|
41
|
+
assert_true(AMitemToSyncState(
|
|
42
|
+
AMstackItem(stack_ptr, AMsyncStateInit(), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_STATE)), &test_state->s2));
|
|
43
|
+
*state = test_state;
|
|
44
|
+
return 0;
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
static int teardown(void** state) {
|
|
48
|
+
TestState* test_state = *state;
|
|
49
|
+
teardown_base((void**)&test_state->base_state);
|
|
50
|
+
test_free(test_state);
|
|
51
|
+
return 0;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
static void sync(AMdoc* a, AMdoc* b, AMsyncState* a_sync_state, AMsyncState* b_sync_state) {
|
|
55
|
+
static size_t const MAX_ITER = 10;
|
|
56
|
+
|
|
57
|
+
AMsyncMessage const* a2b_msg = NULL;
|
|
58
|
+
AMsyncMessage const* b2a_msg = NULL;
|
|
59
|
+
size_t iter = 0;
|
|
60
|
+
do {
|
|
61
|
+
AMresult* a2b_msg_result = AMgenerateSyncMessage(a, a_sync_state);
|
|
62
|
+
AMresult* b2a_msg_result = AMgenerateSyncMessage(b, b_sync_state);
|
|
63
|
+
AMitem* item = AMresultItem(a2b_msg_result);
|
|
64
|
+
switch (AMitemValType(item)) {
|
|
65
|
+
case AM_VAL_TYPE_SYNC_MESSAGE: {
|
|
66
|
+
AMitemToSyncMessage(item, &a2b_msg);
|
|
67
|
+
AMstackResult(NULL, AMreceiveSyncMessage(b, b_sync_state, a2b_msg), cmocka_cb,
|
|
68
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
69
|
+
break;
|
|
70
|
+
}
|
|
71
|
+
case AM_VAL_TYPE_VOID: {
|
|
72
|
+
a2b_msg = NULL;
|
|
73
|
+
break;
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
item = AMresultItem(b2a_msg_result);
|
|
77
|
+
switch (AMitemValType(item)) {
|
|
78
|
+
case AM_VAL_TYPE_SYNC_MESSAGE: {
|
|
79
|
+
AMitemToSyncMessage(item, &b2a_msg);
|
|
80
|
+
AMstackResult(NULL, AMreceiveSyncMessage(a, a_sync_state, b2a_msg), cmocka_cb,
|
|
81
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
82
|
+
break;
|
|
83
|
+
}
|
|
84
|
+
case AM_VAL_TYPE_VOID: {
|
|
85
|
+
b2a_msg = NULL;
|
|
86
|
+
break;
|
|
87
|
+
}
|
|
88
|
+
}
|
|
89
|
+
if (++iter > MAX_ITER) {
|
|
90
|
+
fail_msg(
|
|
91
|
+
"Did not synchronize within %d iterations. "
|
|
92
|
+
"Do you have a bug causing an infinite loop?",
|
|
93
|
+
MAX_ITER);
|
|
94
|
+
}
|
|
95
|
+
} while (a2b_msg || b2a_msg);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
static time_t const TIME_0 = 0;
|
|
99
|
+
|
|
100
|
+
/**
|
|
101
|
+
* \brief should send a sync message implying no local data
|
|
102
|
+
*/
|
|
103
|
+
static void test_should_send_a_sync_message_implying_no_local_data(void** state) {
|
|
104
|
+
/* const doc = create()
|
|
105
|
+
const s1 = initSyncState() */
|
|
106
|
+
TestState* test_state = *state;
|
|
107
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
108
|
+
/* const m1 = doc.generateSyncMessage(s1)
|
|
109
|
+
if (m1 === null) { throw new RangeError("message should not be null") } */
|
|
110
|
+
AMsyncMessage const* m1;
|
|
111
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
112
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
113
|
+
&m1));
|
|
114
|
+
/* const message: DecodedSyncMessage = decodeSyncMessage(m1)
|
|
115
|
+
assert.deepStrictEqual(message.heads, []) */
|
|
116
|
+
AMitems heads = AMstackItems(stack_ptr, AMsyncMessageHeads(m1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
117
|
+
assert_int_equal(AMitemsSize(&heads), 0);
|
|
118
|
+
/* assert.deepStrictEqual(message.need, []) */
|
|
119
|
+
AMitems needs = AMstackItems(stack_ptr, AMsyncMessageNeeds(m1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
120
|
+
assert_int_equal(AMitemsSize(&needs), 0);
|
|
121
|
+
/* assert.deepStrictEqual(message.have.length, 1) */
|
|
122
|
+
AMitems haves = AMstackItems(stack_ptr, AMsyncMessageHaves(m1), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_HAVE));
|
|
123
|
+
assert_int_equal(AMitemsSize(&haves), 1);
|
|
124
|
+
/* assert.deepStrictEqual(message.have[0].lastSync, []) */
|
|
125
|
+
AMsyncHave const* have0;
|
|
126
|
+
assert_true(AMitemToSyncHave(AMitemsNext(&haves, 1), &have0));
|
|
127
|
+
AMitems last_sync =
|
|
128
|
+
AMstackItems(stack_ptr, AMsyncHaveLastSync(have0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
129
|
+
assert_int_equal(AMitemsSize(&last_sync), 0);
|
|
130
|
+
/* assert.deepStrictEqual(message.have[0].bloom.byteLength, 0)
|
|
131
|
+
assert.deepStrictEqual(message.changes, []) */
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
/**
|
|
135
|
+
* \brief should not reply if we have no data as well after the first round
|
|
136
|
+
*/
|
|
137
|
+
static void test_should_not_reply_if_we_have_no_data_as_well_after_the_first_round(void** state) {
|
|
138
|
+
/* const n1 = create(), n2 = create()
|
|
139
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
140
|
+
TestState* test_state = *state;
|
|
141
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
142
|
+
/* let m1 = n1.generateSyncMessage(s1)
|
|
143
|
+
if (m1 === null) { throw new RangeError("message should not be null") } */
|
|
144
|
+
AMsyncMessage const* m1;
|
|
145
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
146
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
147
|
+
&m1));
|
|
148
|
+
/* n2.receiveSyncMessage(s2, m1) */
|
|
149
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, m1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
150
|
+
/* let m2 = n2.generateSyncMessage(s2)
|
|
151
|
+
// We should always send a message on the first round to advertise our heads
|
|
152
|
+
assert.notStrictEqual(m2, null) */
|
|
153
|
+
AMsyncMessage const* m2;
|
|
154
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
155
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
156
|
+
&m2));
|
|
157
|
+
/* n2.receiveSyncMessage(s2, m2!) */
|
|
158
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, m2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
159
|
+
/*
|
|
160
|
+
// now make a change on n1 so we generate another sync message to send
|
|
161
|
+
n1.put("_root", "x", 1) */
|
|
162
|
+
AMstackItem(NULL, AMmapPutInt(test_state->n1, AM_ROOT, AMstr("x"), 1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
163
|
+
/* m1 = n1.generateSyncMessage(s1) */
|
|
164
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
165
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
166
|
+
&m1));
|
|
167
|
+
/* n2.receiveSyncMessage(s2, m2!) */
|
|
168
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, m2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
169
|
+
/*
|
|
170
|
+
m2 = n2.generateSyncMessage(s2)
|
|
171
|
+
assert.deepStrictEqual(m2, null) */
|
|
172
|
+
assert_false(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
173
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_VOID)),
|
|
174
|
+
&m2));
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
/**
|
|
178
|
+
* \brief repos with equal heads do not need a reply message after the first
|
|
179
|
+
* round
|
|
180
|
+
*/
|
|
181
|
+
static void test_repos_with_equal_heads_do_not_need_a_reply_message_after_the_first_round(void** state) {
|
|
182
|
+
/* const n1 = create(), n2 = create()
|
|
183
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
184
|
+
TestState* test_state = *state;
|
|
185
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
186
|
+
/*
|
|
187
|
+
// make two nodes with the same changes
|
|
188
|
+
const list = n1.putObject("_root", "n", []) */
|
|
189
|
+
AMobjId const* const list =
|
|
190
|
+
AMitemObjId(AMstackItem(stack_ptr, AMmapPutObject(test_state->n1, AM_ROOT, AMstr("n"), AM_OBJ_TYPE_LIST),
|
|
191
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_OBJ_TYPE)));
|
|
192
|
+
/* n1.commit("", 0) */
|
|
193
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
194
|
+
/* for (let i = 0; i < 10; i++) { */
|
|
195
|
+
for (size_t i = 0; i != 10; ++i) {
|
|
196
|
+
/* n1.insert(list, i, i) */
|
|
197
|
+
AMstackItem(NULL, AMlistPutUint(test_state->n1, list, i, true, i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
198
|
+
/* n1.commit("", 0) */
|
|
199
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
200
|
+
/* } */
|
|
201
|
+
}
|
|
202
|
+
/* n2.applyChanges(n1.getChanges([])) */
|
|
203
|
+
AMitems const items =
|
|
204
|
+
AMstackItems(stack_ptr, AMgetChanges(test_state->n1, NULL), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
205
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n2, &items), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
206
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
207
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
208
|
+
/*
|
|
209
|
+
// generate a naive sync message
|
|
210
|
+
let m1 = n1.generateSyncMessage(s1)
|
|
211
|
+
if (m1 === null) { throw new RangeError("message should not be null") } */
|
|
212
|
+
AMsyncMessage const* m1;
|
|
213
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
214
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
215
|
+
&m1));
|
|
216
|
+
/* assert.deepStrictEqual(s1.lastSentHeads, n1.getHeads()) */
|
|
217
|
+
AMitems const last_sent_heads =
|
|
218
|
+
AMstackItems(stack_ptr, AMsyncStateLastSentHeads(test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
219
|
+
AMitems const heads =
|
|
220
|
+
AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
221
|
+
assert_true(AMitemsEqual(&last_sent_heads, &heads));
|
|
222
|
+
/*
|
|
223
|
+
// process the first response (which is always generated so we know the other ends heads)
|
|
224
|
+
n2.receiveSyncMessage(s2, m1) */
|
|
225
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, m1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
226
|
+
/* const m2 = n2.generateSyncMessage(s2) */
|
|
227
|
+
AMsyncMessage const* m2;
|
|
228
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
229
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
230
|
+
&m2));
|
|
231
|
+
/* n1.receiveSyncMessage(s1, m2!) */
|
|
232
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, m2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
233
|
+
/*
|
|
234
|
+
// heads are equal so this message should be null
|
|
235
|
+
m1 = n1.generateSyncMessage(s2)
|
|
236
|
+
assert.strictEqual(m1, null) */
|
|
237
|
+
assert_false(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s2),
|
|
238
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_VOID)),
|
|
239
|
+
&m1));
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
/**
|
|
243
|
+
* \brief n1 should offer all changes to n2 when starting from nothing
|
|
244
|
+
*/
|
|
245
|
+
static void test_n1_should_offer_all_changes_to_n2_when_starting_from_nothing(void** state) {
|
|
246
|
+
/* const n1 = create(), n2 = create() */
|
|
247
|
+
TestState* test_state = *state;
|
|
248
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
249
|
+
/*
|
|
250
|
+
// make changes for n1 that n2 should request
|
|
251
|
+
const list = n1.putObject("_root", "n", []) */
|
|
252
|
+
AMobjId const* const list =
|
|
253
|
+
AMitemObjId(AMstackItem(stack_ptr, AMmapPutObject(test_state->n1, AM_ROOT, AMstr("n"), AM_OBJ_TYPE_LIST),
|
|
254
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_OBJ_TYPE)));
|
|
255
|
+
/* n1.commit("", 0) */
|
|
256
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
257
|
+
/* for (let i = 0; i < 10; i++) { */
|
|
258
|
+
for (size_t i = 0; i != 10; ++i) {
|
|
259
|
+
/* n1.insert(list, i, i) */
|
|
260
|
+
AMstackItem(NULL, AMlistPutUint(test_state->n1, list, i, true, i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
261
|
+
/* n1.commit("", 0) */
|
|
262
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
263
|
+
/* } */
|
|
264
|
+
}
|
|
265
|
+
/*
|
|
266
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
267
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
268
|
+
/* sync(n1, n2) */
|
|
269
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
270
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
271
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
272
|
+
}
|
|
273
|
+
|
|
274
|
+
/**
|
|
275
|
+
* \brief should sync peers where one has commits the other does not
|
|
276
|
+
*/
|
|
277
|
+
static void test_should_sync_peers_where_one_has_commits_the_other_does_not(void** state) {
|
|
278
|
+
/* const n1 = create(), n2 = create() */
|
|
279
|
+
TestState* test_state = *state;
|
|
280
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
281
|
+
/*
|
|
282
|
+
// make changes for n1 that n2 should request
|
|
283
|
+
const list = n1.putObject("_root", "n", []) */
|
|
284
|
+
AMobjId const* const list =
|
|
285
|
+
AMitemObjId(AMstackItem(stack_ptr, AMmapPutObject(test_state->n1, AM_ROOT, AMstr("n"), AM_OBJ_TYPE_LIST),
|
|
286
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_OBJ_TYPE)));
|
|
287
|
+
/* n1.commit("", 0) */
|
|
288
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
289
|
+
/* for (let i = 0; i < 10; i++) { */
|
|
290
|
+
for (size_t i = 0; i != 10; ++i) {
|
|
291
|
+
/* n1.insert(list, i, i) */
|
|
292
|
+
AMstackItem(NULL, AMlistPutUint(test_state->n1, list, i, true, i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
293
|
+
/* n1.commit("", 0) */
|
|
294
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
295
|
+
/* } */
|
|
296
|
+
}
|
|
297
|
+
/*
|
|
298
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
299
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
300
|
+
/* sync(n1, n2) */
|
|
301
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
302
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
303
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
304
|
+
}
|
|
305
|
+
|
|
306
|
+
/**
|
|
307
|
+
* \brief should work with prior sync state
|
|
308
|
+
*/
|
|
309
|
+
static void test_should_work_with_prior_sync_state(void** state) {
|
|
310
|
+
/* // create & synchronize two nodes
|
|
311
|
+
const n1 = create(), n2 = create()
|
|
312
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
313
|
+
TestState* test_state = *state;
|
|
314
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
315
|
+
/*
|
|
316
|
+
for (let i = 0; i < 5; i++) { */
|
|
317
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
318
|
+
/* n1.put("_root", "x", i) */
|
|
319
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
320
|
+
/* n1.commit("", 0) */
|
|
321
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
322
|
+
/* } */
|
|
323
|
+
}
|
|
324
|
+
/*
|
|
325
|
+
sync(n1, n2, s1, s2)
|
|
326
|
+
*/
|
|
327
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
328
|
+
/*
|
|
329
|
+
// modify the first node further
|
|
330
|
+
for (let i = 5; i < 10; i++) { */
|
|
331
|
+
for (size_t i = 5; i != 10; ++i) {
|
|
332
|
+
/* n1.put("_root", "x", i) */
|
|
333
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
334
|
+
/* n1.commit("", 0) */
|
|
335
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
336
|
+
/* } */
|
|
337
|
+
}
|
|
338
|
+
/*
|
|
339
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
340
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
341
|
+
/* sync(n1, n2, s1, s2) */
|
|
342
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
343
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
344
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
345
|
+
}
|
|
346
|
+
|
|
347
|
+
/**
|
|
348
|
+
* \brief should not generate messages once synced
|
|
349
|
+
*/
|
|
350
|
+
static void test_should_not_generate_messages_once_synced(void** state) {
|
|
351
|
+
/* // create & synchronize two nodes
|
|
352
|
+
const n1 = create({ actor: 'abc123'}), n2 = create({ actor: 'def456'})
|
|
353
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
354
|
+
TestState* test_state = *state;
|
|
355
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
356
|
+
AMactorId const* actor_id;
|
|
357
|
+
assert_true(AMitemToActorId(
|
|
358
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("abc123")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
359
|
+
&actor_id));
|
|
360
|
+
AMstackItem(NULL, AMsetActorId(test_state->n1, actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
361
|
+
assert_true(AMitemToActorId(
|
|
362
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("def456")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
363
|
+
&actor_id));
|
|
364
|
+
AMstackItem(NULL, AMsetActorId(test_state->n2, actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
365
|
+
/*
|
|
366
|
+
let message */
|
|
367
|
+
AMsyncMessage const* message = NULL;
|
|
368
|
+
/* for (let i = 0; i < 5; i++) { */
|
|
369
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
370
|
+
/* n1.put("_root", "x", i) */
|
|
371
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
372
|
+
/* n1.commit("", 0) */
|
|
373
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
374
|
+
/* } */
|
|
375
|
+
}
|
|
376
|
+
/* for (let i = 0; i < 5; i++) { */
|
|
377
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
378
|
+
/* n2.put("_root", "y", i) */
|
|
379
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("y"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
380
|
+
/* n2.commit("", 0) */
|
|
381
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
382
|
+
/* } */
|
|
383
|
+
}
|
|
384
|
+
/*
|
|
385
|
+
// n1 reports what it has
|
|
386
|
+
message = n1.generateSyncMessage(s1)
|
|
387
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
388
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
389
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
390
|
+
&message));
|
|
391
|
+
/*
|
|
392
|
+
// n2 receives that message and sends changes along with what it has
|
|
393
|
+
n2.receiveSyncMessage(s2, message) */
|
|
394
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, message), cmocka_cb,
|
|
395
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
396
|
+
/* message = n2.generateSyncMessage(s2)
|
|
397
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
398
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
399
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
400
|
+
&message));
|
|
401
|
+
/* assert(decodeSyncMessage(message).changes.length > 0)
|
|
402
|
+
//assert.deepStrictEqual(patch, null) // no changes arrived
|
|
403
|
+
|
|
404
|
+
// n1 receives the changes and replies with the changes it now knows that n2 needs
|
|
405
|
+
n1.receiveSyncMessage(s1, message) */
|
|
406
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, message), cmocka_cb,
|
|
407
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
408
|
+
/* message = n1.generateSyncMessage(s1)
|
|
409
|
+
if (message == null) { throw new RangeError("message should not be null") } */
|
|
410
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
411
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
412
|
+
&message));
|
|
413
|
+
/* assert(decodeSyncMessage(message).changes.length > 0)
|
|
414
|
+
|
|
415
|
+
// n2 applies the changes and sends confirmation ending the exchange
|
|
416
|
+
n2.receiveSyncMessage(s2, message) */
|
|
417
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, message), cmocka_cb,
|
|
418
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
419
|
+
/* message = n2.generateSyncMessage(s2)
|
|
420
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
421
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
422
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
423
|
+
&message));
|
|
424
|
+
/*
|
|
425
|
+
// n1 receives the message and has nothing more to say
|
|
426
|
+
n1.receiveSyncMessage(s1, message) */
|
|
427
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, message), cmocka_cb,
|
|
428
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
429
|
+
/* message = n1.generateSyncMessage(s1)
|
|
430
|
+
assert.deepStrictEqual(message, null)
|
|
431
|
+
//assert.deepStrictEqual(patch, null) // no changes arrived */
|
|
432
|
+
AMstackItem(NULL, AMgenerateSyncMessage(test_state->n1, test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
433
|
+
/*
|
|
434
|
+
// n2 also has nothing left to say
|
|
435
|
+
message = n2.generateSyncMessage(s2)
|
|
436
|
+
assert.deepStrictEqual(message, null) */
|
|
437
|
+
assert_false(AMitemToSyncMessage(
|
|
438
|
+
AMstackItem(NULL, AMgenerateSyncMessage(test_state->n2, test_state->s2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID)),
|
|
439
|
+
&message));
|
|
440
|
+
}
|
|
441
|
+
|
|
442
|
+
/**
|
|
443
|
+
* \brief should allow simultaneous messages during synchronization
|
|
444
|
+
*/
|
|
445
|
+
static void test_should_allow_simultaneous_messages_during_synchronization(void** state) {
|
|
446
|
+
/* // create & synchronize two nodes
|
|
447
|
+
const n1 = create({ actor: 'abc123'}), n2 = create({ actor: 'def456'})
|
|
448
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
449
|
+
TestState* test_state = *state;
|
|
450
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
451
|
+
AMactorId const* actor_id;
|
|
452
|
+
assert_true(AMitemToActorId(
|
|
453
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("abc123")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
454
|
+
&actor_id));
|
|
455
|
+
AMstackItem(NULL, AMsetActorId(test_state->n1, actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
456
|
+
assert_true(AMitemToActorId(
|
|
457
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("def456")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
458
|
+
&actor_id));
|
|
459
|
+
AMstackItem(NULL, AMsetActorId(test_state->n2, actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
460
|
+
/*
|
|
461
|
+
for (let i = 0; i < 5; i++) { */
|
|
462
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
463
|
+
/* n1.put("_root", "x", i) */
|
|
464
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
465
|
+
/* n1.commit("", 0) */
|
|
466
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
467
|
+
/* } */
|
|
468
|
+
}
|
|
469
|
+
/* for (let i = 0; i < 5; i++) { */
|
|
470
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
471
|
+
/* n2.put("_root", "y", i) */
|
|
472
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("y"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
473
|
+
/* n2.commit("", 0) */
|
|
474
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
475
|
+
/* } */
|
|
476
|
+
}
|
|
477
|
+
/*
|
|
478
|
+
const head1 = n1.getHeads()[0], head2 = n2.getHeads()[0] */
|
|
479
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
480
|
+
AMbyteSpan head1;
|
|
481
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&heads1, 1), &head1));
|
|
482
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
483
|
+
AMbyteSpan head2;
|
|
484
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&heads2, 1), &head2));
|
|
485
|
+
/*
|
|
486
|
+
// both sides report what they have but have no shared peer state
|
|
487
|
+
let msg1to2, msg2to1 */
|
|
488
|
+
AMsyncMessage const* msg1to2;
|
|
489
|
+
AMsyncMessage const* msg2to1;
|
|
490
|
+
/* msg1to2 = n1.generateSyncMessage(s1)
|
|
491
|
+
msg2to1 = n2.generateSyncMessage(s2)
|
|
492
|
+
if (msg1to2 === null) { throw new RangeError("message should not be null") }
|
|
493
|
+
if (msg2to1 === null) { throw new RangeError("message should not be null") } */
|
|
494
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
495
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
496
|
+
&msg1to2));
|
|
497
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
498
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
499
|
+
&msg2to1));
|
|
500
|
+
/* assert.deepStrictEqual(decodeSyncMessage(msg1to2).changes.length, 0)
|
|
501
|
+
assert.deepStrictEqual(decodeSyncMessage(msg1to2).have[0].lastSync.length, 0) */
|
|
502
|
+
AMitems msg1to2_haves =
|
|
503
|
+
AMstackItems(stack_ptr, AMsyncMessageHaves(msg1to2), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_HAVE));
|
|
504
|
+
AMsyncHave const* msg1to2_have;
|
|
505
|
+
assert_true(AMitemToSyncHave(AMitemsNext(&msg1to2_haves, 1), &msg1to2_have));
|
|
506
|
+
AMitems msg1to2_last_sync =
|
|
507
|
+
AMstackItems(stack_ptr, AMsyncHaveLastSync(msg1to2_have), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
508
|
+
assert_int_equal(AMitemsSize(&msg1to2_last_sync), 0);
|
|
509
|
+
/* assert.deepStrictEqual(decodeSyncMessage(msg2to1).changes.length, 0)
|
|
510
|
+
assert.deepStrictEqual(decodeSyncMessage(msg2to1).have[0].lastSync.length, 0) */
|
|
511
|
+
AMitems msg2to1_haves =
|
|
512
|
+
AMstackItems(stack_ptr, AMsyncMessageHaves(msg2to1), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_HAVE));
|
|
513
|
+
AMsyncHave const* msg2to1_have;
|
|
514
|
+
assert_true(AMitemToSyncHave(AMitemsNext(&msg2to1_haves, 1), &msg2to1_have));
|
|
515
|
+
AMitems msg2to1_last_sync =
|
|
516
|
+
AMstackItems(stack_ptr, AMsyncHaveLastSync(msg2to1_have), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
517
|
+
assert_int_equal(AMitemsSize(&msg2to1_last_sync), 0);
|
|
518
|
+
/*
|
|
519
|
+
// n1 and n2 receive that message and update sync state but make no patch
|
|
520
|
+
n1.receiveSyncMessage(s1, msg2to1) */
|
|
521
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, msg2to1), cmocka_cb,
|
|
522
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
523
|
+
/* n2.receiveSyncMessage(s2, msg1to2) */
|
|
524
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, msg1to2), cmocka_cb,
|
|
525
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
526
|
+
/*
|
|
527
|
+
// now both reply with their local changes the other lacks
|
|
528
|
+
// (standard warning that 1% of the time this will result in a "need" message)
|
|
529
|
+
msg1to2 = n1.generateSyncMessage(s1)
|
|
530
|
+
if (msg1to2 === null) { throw new RangeError("message should not be null") } */
|
|
531
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
532
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
533
|
+
&msg1to2));
|
|
534
|
+
/* assert(decodeSyncMessage(msg1to2).changes.length > 0)
|
|
535
|
+
msg2to1 = n2.generateSyncMessage(s2)
|
|
536
|
+
if (msg2to1 === null) { throw new RangeError("message should not be null") } */
|
|
537
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
538
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
539
|
+
&msg2to1));
|
|
540
|
+
/* assert(decodeSyncMessage(msg2to1).changes.length > 0)
|
|
541
|
+
|
|
542
|
+
// both should now apply the changes and update the frontend
|
|
543
|
+
n1.receiveSyncMessage(s1, msg2to1) */
|
|
544
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, msg2to1), cmocka_cb,
|
|
545
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
546
|
+
/* assert.deepStrictEqual(n1.getMissingDeps(), []) */
|
|
547
|
+
AMitems missing_deps =
|
|
548
|
+
AMstackItems(stack_ptr, AMgetMissingDeps(test_state->n1, NULL), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
549
|
+
assert_int_equal(AMitemsSize(&missing_deps), 0);
|
|
550
|
+
/* //assert.notDeepStrictEqual(patch1, null)
|
|
551
|
+
assert.deepStrictEqual(n1.materialize(), { x: 4, y: 4 }) */
|
|
552
|
+
uint64_t uint;
|
|
553
|
+
assert_true(AMitemToUint(AMstackItem(stack_ptr, AMmapGet(test_state->n1, AM_ROOT, AMstr("x"), NULL), cmocka_cb,
|
|
554
|
+
AMexpect(AM_VAL_TYPE_UINT)),
|
|
555
|
+
&uint));
|
|
556
|
+
assert_int_equal(uint, 4);
|
|
557
|
+
assert_true(AMitemToUint(AMstackItem(stack_ptr, AMmapGet(test_state->n1, AM_ROOT, AMstr("y"), NULL), cmocka_cb,
|
|
558
|
+
AMexpect(AM_VAL_TYPE_UINT)),
|
|
559
|
+
&uint));
|
|
560
|
+
assert_int_equal(uint, 4);
|
|
561
|
+
/*
|
|
562
|
+
n2.receiveSyncMessage(s2, msg1to2) */
|
|
563
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, msg1to2), cmocka_cb,
|
|
564
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
565
|
+
/* assert.deepStrictEqual(n2.getMissingDeps(), []) */
|
|
566
|
+
missing_deps =
|
|
567
|
+
AMstackItems(stack_ptr, AMgetMissingDeps(test_state->n2, NULL), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
568
|
+
assert_int_equal(AMitemsSize(&missing_deps), 0);
|
|
569
|
+
/* //assert.notDeepStrictEqual(patch2, null)
|
|
570
|
+
assert.deepStrictEqual(n2.materialize(), { x: 4, y: 4 }) */
|
|
571
|
+
assert_true(AMitemToUint(AMstackItem(stack_ptr, AMmapGet(test_state->n2, AM_ROOT, AMstr("x"), NULL), cmocka_cb,
|
|
572
|
+
AMexpect(AM_VAL_TYPE_UINT)),
|
|
573
|
+
&uint));
|
|
574
|
+
assert_int_equal(uint, 4);
|
|
575
|
+
assert_true(AMitemToUint(AMstackItem(stack_ptr, AMmapGet(test_state->n2, AM_ROOT, AMstr("y"), NULL), cmocka_cb,
|
|
576
|
+
AMexpect(AM_VAL_TYPE_UINT)),
|
|
577
|
+
&uint));
|
|
578
|
+
assert_int_equal(uint, 4);
|
|
579
|
+
/*
|
|
580
|
+
// The response acknowledges the changes received and sends no further changes
|
|
581
|
+
msg1to2 = n1.generateSyncMessage(s1)
|
|
582
|
+
if (msg1to2 === null) { throw new RangeError("message should not be null") } */
|
|
583
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
584
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
585
|
+
&msg1to2));
|
|
586
|
+
/* assert.deepStrictEqual(decodeSyncMessage(msg1to2).changes.length, 0)
|
|
587
|
+
msg2to1 = n2.generateSyncMessage(s2)
|
|
588
|
+
if (msg2to1 === null) { throw new RangeError("message should not be null") } */
|
|
589
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
590
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
591
|
+
&msg2to1));
|
|
592
|
+
/* assert.deepStrictEqual(decodeSyncMessage(msg2to1).changes.length, 0)
|
|
593
|
+
|
|
594
|
+
// After receiving acknowledgements, their shared heads should be equal
|
|
595
|
+
n1.receiveSyncMessage(s1, msg2to1) */
|
|
596
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n1, test_state->s1, msg2to1), cmocka_cb,
|
|
597
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
598
|
+
/* n2.receiveSyncMessage(s2, msg1to2) */
|
|
599
|
+
AMstackItem(NULL, AMreceiveSyncMessage(test_state->n2, test_state->s2, msg1to2), cmocka_cb,
|
|
600
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
601
|
+
/* assert.deepStrictEqual(s1.sharedHeads, [head1, head2].sort()) */
|
|
602
|
+
AMitems s1_shared_heads =
|
|
603
|
+
AMstackItems(stack_ptr, AMsyncStateSharedHeads(test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
604
|
+
AMbyteSpan s1_shared_change_hash;
|
|
605
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&s1_shared_heads, 1), &s1_shared_change_hash));
|
|
606
|
+
assert_memory_equal(s1_shared_change_hash.src, head1.src, head1.count);
|
|
607
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&s1_shared_heads, 1), &s1_shared_change_hash));
|
|
608
|
+
assert_memory_equal(s1_shared_change_hash.src, head2.src, head2.count);
|
|
609
|
+
/* assert.deepStrictEqual(s2.sharedHeads, [head1, head2].sort()) */
|
|
610
|
+
AMitems s2_shared_heads =
|
|
611
|
+
AMstackItems(stack_ptr, AMsyncStateSharedHeads(test_state->s2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
612
|
+
AMbyteSpan s2_shared_change_hash;
|
|
613
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&s2_shared_heads, 1), &s2_shared_change_hash));
|
|
614
|
+
assert_memory_equal(s2_shared_change_hash.src, head1.src, head1.count);
|
|
615
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&s2_shared_heads, 1), &s2_shared_change_hash));
|
|
616
|
+
assert_memory_equal(s2_shared_change_hash.src, head2.src, head2.count);
|
|
617
|
+
/* //assert.deepStrictEqual(patch1, null)
|
|
618
|
+
//assert.deepStrictEqual(patch2, null)
|
|
619
|
+
|
|
620
|
+
// We're in sync, no more messages required
|
|
621
|
+
msg1to2 = n1.generateSyncMessage(s1)
|
|
622
|
+
msg2to1 = n2.generateSyncMessage(s2)
|
|
623
|
+
assert.deepStrictEqual(msg1to2, null)
|
|
624
|
+
assert.deepStrictEqual(msg2to1, null) */
|
|
625
|
+
assert_false(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
626
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_VOID)),
|
|
627
|
+
&msg1to2));
|
|
628
|
+
assert_false(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n2, test_state->s2),
|
|
629
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_VOID)),
|
|
630
|
+
&msg2to1));
|
|
631
|
+
/*
|
|
632
|
+
// If we make one more change and start another sync then its lastSync should be updated
|
|
633
|
+
n1.put("_root", "x", 5) */
|
|
634
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), 5), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
635
|
+
/* msg1to2 = n1.generateSyncMessage(s1)
|
|
636
|
+
if (msg1to2 === null) { throw new RangeError("message should not be null") } */
|
|
637
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
638
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
639
|
+
&msg1to2));
|
|
640
|
+
/* assert.deepStrictEqual(decodeSyncMessage(msg1to2).have[0].lastSync, [head1, head2].sort()) */
|
|
641
|
+
msg1to2_haves = AMstackItems(stack_ptr, AMsyncMessageHaves(msg1to2), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_HAVE));
|
|
642
|
+
assert_true(AMitemToSyncHave(AMitemsNext(&msg1to2_haves, 1), &msg1to2_have));
|
|
643
|
+
msg1to2_last_sync =
|
|
644
|
+
AMstackItems(stack_ptr, AMsyncHaveLastSync(msg1to2_have), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
645
|
+
AMbyteSpan msg1to2_last_sync_next;
|
|
646
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&msg1to2_last_sync, 1), &msg1to2_last_sync_next));
|
|
647
|
+
assert_int_equal(msg1to2_last_sync_next.count, head1.count);
|
|
648
|
+
assert_memory_equal(msg1to2_last_sync_next.src, head1.src, head1.count);
|
|
649
|
+
assert_true(AMitemToChangeHash(AMitemsNext(&msg1to2_last_sync, 1), &msg1to2_last_sync_next));
|
|
650
|
+
assert_int_equal(msg1to2_last_sync_next.count, head2.count);
|
|
651
|
+
assert_memory_equal(msg1to2_last_sync_next.src, head2.src, head2.count);
|
|
652
|
+
}
|
|
653
|
+
|
|
654
|
+
/**
|
|
655
|
+
* \brief should assume sent changes were received until we hear otherwise
|
|
656
|
+
*/
|
|
657
|
+
static void test_should_assume_sent_changes_were_received_until_we_hear_otherwise(void** state) {
|
|
658
|
+
/* const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
659
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
660
|
+
TestState* test_state = *state;
|
|
661
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
662
|
+
/* let message = null
|
|
663
|
+
|
|
664
|
+
const items = n1.putObject("_root", "items", []) */
|
|
665
|
+
AMobjId const* const items =
|
|
666
|
+
AMitemObjId(AMstackItem(stack_ptr, AMmapPutObject(test_state->n1, AM_ROOT, AMstr("items"), AM_OBJ_TYPE_LIST),
|
|
667
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_OBJ_TYPE)));
|
|
668
|
+
/* n1.commit("", 0) */
|
|
669
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
670
|
+
/*
|
|
671
|
+
sync(n1, n2, s1, s2) */
|
|
672
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
673
|
+
/*
|
|
674
|
+
n1.push(items, "x") */
|
|
675
|
+
AMstackItem(NULL, AMlistPutStr(test_state->n1, items, SIZE_MAX, true, AMstr("x")), cmocka_cb,
|
|
676
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
677
|
+
/* n1.commit("", 0) */
|
|
678
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
679
|
+
/* message = n1.generateSyncMessage(s1)
|
|
680
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
681
|
+
AMsyncMessage const* message;
|
|
682
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
683
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
684
|
+
&message));
|
|
685
|
+
/* assert.deepStrictEqual(decodeSyncMessage(message).changes.length, 1)
|
|
686
|
+
|
|
687
|
+
n1.push(items, "y") */
|
|
688
|
+
AMstackItem(NULL, AMlistPutStr(test_state->n1, items, SIZE_MAX, true, AMstr("y")), cmocka_cb,
|
|
689
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
690
|
+
/* n1.commit("", 0) */
|
|
691
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
692
|
+
/* message = n1.generateSyncMessage(s1)
|
|
693
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
694
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
695
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
696
|
+
&message));
|
|
697
|
+
/* assert.deepStrictEqual(decodeSyncMessage(message).changes.length, 1)
|
|
698
|
+
|
|
699
|
+
n1.push(items, "z") */
|
|
700
|
+
AMstackItem(NULL, AMlistPutStr(test_state->n1, items, SIZE_MAX, true, AMstr("z")), cmocka_cb,
|
|
701
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
702
|
+
/* n1.commit("", 0) */
|
|
703
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
704
|
+
/*
|
|
705
|
+
message = n1.generateSyncMessage(s1)
|
|
706
|
+
if (message === null) { throw new RangeError("message should not be null") } */
|
|
707
|
+
assert_true(AMitemToSyncMessage(AMstackItem(stack_ptr, AMgenerateSyncMessage(test_state->n1, test_state->s1),
|
|
708
|
+
cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_MESSAGE)),
|
|
709
|
+
&message));
|
|
710
|
+
/* assert.deepStrictEqual(decodeSyncMessage(message).changes.length, 1) */
|
|
711
|
+
}
|
|
712
|
+
|
|
713
|
+
/**
|
|
714
|
+
* \brief should work regardless of who initiates the exchange
|
|
715
|
+
*/
|
|
716
|
+
static void test_should_work_regardless_of_who_initiates_the_exchange(void** state) {
|
|
717
|
+
/* // create & synchronize two nodes
|
|
718
|
+
const n1 = create(), n2 = create()
|
|
719
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
720
|
+
TestState* test_state = *state;
|
|
721
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
722
|
+
/*
|
|
723
|
+
for (let i = 0; i < 5; i++) { */
|
|
724
|
+
for (size_t i = 0; i != 5; ++i) {
|
|
725
|
+
/* n1.put("_root", "x", i) */
|
|
726
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
727
|
+
/* n1.commit("", 0) */
|
|
728
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
729
|
+
/* } */
|
|
730
|
+
}
|
|
731
|
+
/*
|
|
732
|
+
sync(n1, n2, s1, s2) */
|
|
733
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
734
|
+
/*
|
|
735
|
+
// modify the first node further
|
|
736
|
+
for (let i = 5; i < 10; i++) { */
|
|
737
|
+
for (size_t i = 5; i != 10; ++i) {
|
|
738
|
+
/* n1.put("_root", "x", i) */
|
|
739
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
740
|
+
/* n1.commit("", 0) */
|
|
741
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
742
|
+
/* } */
|
|
743
|
+
}
|
|
744
|
+
/*
|
|
745
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
746
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
747
|
+
/* sync(n1, n2, s1, s2) */
|
|
748
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
749
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
750
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
751
|
+
}
|
|
752
|
+
|
|
753
|
+
/**
|
|
754
|
+
* \brief should work without prior sync state
|
|
755
|
+
*/
|
|
756
|
+
static void test_should_work_without_prior_sync_state(void** state) {
|
|
757
|
+
/* // Scenario: ,-- c10 <-- c11 <-- c12 <-- c13 <-- c14
|
|
758
|
+
// c0 <-- c1 <-- c2 <-- c3 <-- c4 <-- c5 <-- c6 <-- c7 <-- c8 <-- c9 <-+
|
|
759
|
+
// `-- c15 <-- c16 <-- c17
|
|
760
|
+
// lastSync is undefined.
|
|
761
|
+
|
|
762
|
+
// create two peers both with divergent commits
|
|
763
|
+
const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
764
|
+
//const s1 = initSyncState(), s2 = initSyncState() */
|
|
765
|
+
TestState* test_state = *state;
|
|
766
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
767
|
+
/*
|
|
768
|
+
for (let i = 0; i < 10; i++) { */
|
|
769
|
+
for (size_t i = 0; i != 10; ++i) {
|
|
770
|
+
/* n1.put("_root", "x", i) */
|
|
771
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
772
|
+
/* n1.commit("", 0) */
|
|
773
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
774
|
+
/* } */
|
|
775
|
+
}
|
|
776
|
+
/*
|
|
777
|
+
sync(n1, n2) */
|
|
778
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
779
|
+
/*
|
|
780
|
+
for (let i = 10; i < 15; i++) { */
|
|
781
|
+
for (size_t i = 10; i != 15; ++i) {
|
|
782
|
+
/* n1.put("_root", "x", i) */
|
|
783
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
784
|
+
/* n1.commit("", 0) */
|
|
785
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
786
|
+
/* } */
|
|
787
|
+
}
|
|
788
|
+
/*
|
|
789
|
+
for (let i = 15; i < 18; i++) { */
|
|
790
|
+
for (size_t i = 15; i != 18; ++i) {
|
|
791
|
+
/* n2.put("_root", "x", i) */
|
|
792
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
793
|
+
/* n2.commit("", 0) */
|
|
794
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
795
|
+
/* } */
|
|
796
|
+
}
|
|
797
|
+
/*
|
|
798
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
799
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
800
|
+
/* sync(n1, n2) */
|
|
801
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
802
|
+
/* assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
803
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
804
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
805
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
806
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
807
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
808
|
+
}
|
|
809
|
+
|
|
810
|
+
/**
|
|
811
|
+
* \brief should work with prior sync state
|
|
812
|
+
*/
|
|
813
|
+
static void test_should_work_with_prior_sync_state_2(void** state) {
|
|
814
|
+
/* // Scenario: ,-- c10 <-- c11 <-- c12 <-- c13 <-- c14
|
|
815
|
+
// c0 <-- c1 <-- c2 <-- c3 <-- c4 <-- c5 <-- c6 <-- c7 <-- c8 <-- c9 <-+
|
|
816
|
+
// `-- c15 <-- c16 <-- c17
|
|
817
|
+
// lastSync is c9.
|
|
818
|
+
|
|
819
|
+
// create two peers both with divergent commits
|
|
820
|
+
const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
821
|
+
let s1 = initSyncState(), s2 = initSyncState() */
|
|
822
|
+
TestState* test_state = *state;
|
|
823
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
824
|
+
/*
|
|
825
|
+
for (let i = 0; i < 10; i++) { */
|
|
826
|
+
for (size_t i = 0; i != 10; ++i) {
|
|
827
|
+
/* n1.put("_root", "x", i) */
|
|
828
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
829
|
+
/* n1.commit("", 0) */
|
|
830
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
831
|
+
/* } */
|
|
832
|
+
}
|
|
833
|
+
/*
|
|
834
|
+
sync(n1, n2, s1, s2) */
|
|
835
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
836
|
+
/*
|
|
837
|
+
for (let i = 10; i < 15; i++) { */
|
|
838
|
+
for (size_t i = 10; i != 15; ++i) {
|
|
839
|
+
/* n1.put("_root", "x", i) */
|
|
840
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
841
|
+
/* n1.commit("", 0) */
|
|
842
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
843
|
+
/* } */
|
|
844
|
+
}
|
|
845
|
+
/* for (let i = 15; i < 18; i++) { */
|
|
846
|
+
for (size_t i = 15; i != 18; ++i) {
|
|
847
|
+
/* n2.put("_root", "x", i) */
|
|
848
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
849
|
+
/* n2.commit("", 0) */
|
|
850
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
851
|
+
/* } */
|
|
852
|
+
}
|
|
853
|
+
/*
|
|
854
|
+
s1 = decodeSyncState(encodeSyncState(s1)) */
|
|
855
|
+
AMbyteSpan encoded;
|
|
856
|
+
assert_true(AMitemToBytes(
|
|
857
|
+
AMstackItem(stack_ptr, AMsyncStateEncode(test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_BYTES)), &encoded));
|
|
858
|
+
AMsyncState* s1;
|
|
859
|
+
assert_true(AMitemToSyncState(AMstackItem(stack_ptr, AMsyncStateDecode(encoded.src, encoded.count), cmocka_cb,
|
|
860
|
+
AMexpect(AM_VAL_TYPE_SYNC_STATE)),
|
|
861
|
+
&s1));
|
|
862
|
+
/* s2 = decodeSyncState(encodeSyncState(s2)) */
|
|
863
|
+
assert_true(AMitemToBytes(
|
|
864
|
+
AMstackItem(stack_ptr, AMsyncStateEncode(test_state->s2), cmocka_cb, AMexpect(AM_VAL_TYPE_BYTES)), &encoded));
|
|
865
|
+
AMsyncState* s2;
|
|
866
|
+
assert_true(AMitemToSyncState(AMstackItem(stack_ptr, AMsyncStateDecode(encoded.src, encoded.count), cmocka_cb,
|
|
867
|
+
AMexpect(AM_VAL_TYPE_SYNC_STATE)),
|
|
868
|
+
&s2));
|
|
869
|
+
/*
|
|
870
|
+
assert.notDeepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
871
|
+
assert_false(AMequal(test_state->n1, test_state->n2));
|
|
872
|
+
/* sync(n1, n2, s1, s2) */
|
|
873
|
+
sync(test_state->n1, test_state->n2, s1, s2);
|
|
874
|
+
/* assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
875
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
876
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
877
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
878
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
879
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
880
|
+
}
|
|
881
|
+
|
|
882
|
+
/**
|
|
883
|
+
* \brief should ensure non-empty state after sync
|
|
884
|
+
*/
|
|
885
|
+
static void test_should_ensure_non_empty_state_after_sync(void** state) {
|
|
886
|
+
/* const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
887
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
888
|
+
TestState* test_state = *state;
|
|
889
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
890
|
+
/*
|
|
891
|
+
for (let i = 0; i < 3; i++) { */
|
|
892
|
+
for (size_t i = 0; i != 3; ++i) {
|
|
893
|
+
/* n1.put("_root", "x", i) */
|
|
894
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
895
|
+
/* n1.commit("", 0) */
|
|
896
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
897
|
+
/* } */
|
|
898
|
+
}
|
|
899
|
+
/*
|
|
900
|
+
sync(n1, n2, s1, s2) */
|
|
901
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
902
|
+
/*
|
|
903
|
+
assert.deepStrictEqual(s1.sharedHeads, n1.getHeads()) */
|
|
904
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
905
|
+
AMitems shared_heads1 =
|
|
906
|
+
AMstackItems(stack_ptr, AMsyncStateSharedHeads(test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
907
|
+
assert_true(AMitemsEqual(&shared_heads1, &heads1));
|
|
908
|
+
/* assert.deepStrictEqual(s2.sharedHeads, n1.getHeads()) */
|
|
909
|
+
AMitems shared_heads2 =
|
|
910
|
+
AMstackItems(stack_ptr, AMsyncStateSharedHeads(test_state->s2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
911
|
+
assert_true(AMitemsEqual(&shared_heads2, &heads1));
|
|
912
|
+
}
|
|
913
|
+
|
|
914
|
+
/**
|
|
915
|
+
* \brief should re-sync after one node crashed with data loss
|
|
916
|
+
*/
|
|
917
|
+
static void test_should_resync_after_one_node_crashed_with_data_loss(void** state) {
|
|
918
|
+
/* // Scenario: (r) (n2) (n1)
|
|
919
|
+
// c0 <-- c1 <-- c2 <-- c3 <-- c4 <-- c5 <-- c6 <-- c7 <-- c8
|
|
920
|
+
// n2 has changes {c0, c1, c2}, n1's lastSync is c5, and n2's lastSync is c2.
|
|
921
|
+
// we want to successfully sync (n1) with (r), even though (n1) believes it's talking to (n2)
|
|
922
|
+
const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
923
|
+
let s1 = initSyncState()
|
|
924
|
+
const s2 = initSyncState() */
|
|
925
|
+
TestState* test_state = *state;
|
|
926
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
927
|
+
/*
|
|
928
|
+
// n1 makes three changes, which we sync to n2
|
|
929
|
+
for (let i = 0; i < 3; i++) { */
|
|
930
|
+
for (size_t i = 0; i != 3; ++i) {
|
|
931
|
+
/* n1.put("_root", "x", i) */
|
|
932
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
933
|
+
/* n1.commit("", 0) */
|
|
934
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
935
|
+
/* } */
|
|
936
|
+
}
|
|
937
|
+
/*
|
|
938
|
+
sync(n1, n2, s1, s2) */
|
|
939
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
940
|
+
/*
|
|
941
|
+
// save a copy of n2 as "r" to simulate recovering from a crash
|
|
942
|
+
let r
|
|
943
|
+
let rSyncState
|
|
944
|
+
;[r, rSyncState] = [n2.clone(), s2.clone()] */
|
|
945
|
+
AMdoc* r;
|
|
946
|
+
assert_true(AMitemToDoc(AMstackItem(stack_ptr, AMclone(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)), &r));
|
|
947
|
+
AMbyteSpan encoded_s2;
|
|
948
|
+
assert_true(
|
|
949
|
+
AMitemToBytes(AMstackItem(stack_ptr, AMsyncStateEncode(test_state->s2), cmocka_cb, AMexpect(AM_VAL_TYPE_BYTES)),
|
|
950
|
+
&encoded_s2));
|
|
951
|
+
AMsyncState* sync_state_r;
|
|
952
|
+
assert_true(AMitemToSyncState(AMstackItem(stack_ptr, AMsyncStateDecode(encoded_s2.src, encoded_s2.count), cmocka_cb,
|
|
953
|
+
AMexpect(AM_VAL_TYPE_SYNC_STATE)),
|
|
954
|
+
&sync_state_r));
|
|
955
|
+
/*
|
|
956
|
+
// sync another few commits
|
|
957
|
+
for (let i = 3; i < 6; i++) { */
|
|
958
|
+
for (size_t i = 3; i != 6; ++i) {
|
|
959
|
+
/* n1.put("_root", "x", i) */
|
|
960
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
961
|
+
/* n1.commit("", 0) */
|
|
962
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
963
|
+
/* } */
|
|
964
|
+
}
|
|
965
|
+
/*
|
|
966
|
+
sync(n1, n2, s1, s2) */
|
|
967
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
968
|
+
/*
|
|
969
|
+
// everyone should be on the same page here
|
|
970
|
+
assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
971
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
972
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
973
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
974
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
975
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
976
|
+
/*
|
|
977
|
+
// now make a few more changes and then attempt to sync the fully up-to-date n1 with with the confused r
|
|
978
|
+
for (let i = 6; i < 9; i++) { */
|
|
979
|
+
for (size_t i = 6; i != 9; ++i) {
|
|
980
|
+
/* n1.put("_root", "x", i) */
|
|
981
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
982
|
+
/* n1.commit("", 0) */
|
|
983
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
984
|
+
/* } */
|
|
985
|
+
}
|
|
986
|
+
/*
|
|
987
|
+
s1 = decodeSyncState(encodeSyncState(s1)) */
|
|
988
|
+
AMbyteSpan encoded_s1;
|
|
989
|
+
assert_true(
|
|
990
|
+
AMitemToBytes(AMstackItem(stack_ptr, AMsyncStateEncode(test_state->s1), cmocka_cb, AMexpect(AM_VAL_TYPE_BYTES)),
|
|
991
|
+
&encoded_s1));
|
|
992
|
+
AMsyncState* s1;
|
|
993
|
+
assert_true(AMitemToSyncState(AMstackItem(stack_ptr, AMsyncStateDecode(encoded_s1.src, encoded_s1.count), cmocka_cb,
|
|
994
|
+
AMexpect(AM_VAL_TYPE_SYNC_STATE)),
|
|
995
|
+
&s1));
|
|
996
|
+
/* rSyncState = decodeSyncState(encodeSyncState(rSyncState)) */
|
|
997
|
+
AMbyteSpan encoded_r;
|
|
998
|
+
assert_true(AMitemToBytes(
|
|
999
|
+
AMstackItem(stack_ptr, AMsyncStateEncode(sync_state_r), cmocka_cb, AMexpect(AM_VAL_TYPE_BYTES)), &encoded_r));
|
|
1000
|
+
assert_true(AMitemToSyncState(AMstackItem(stack_ptr, AMsyncStateDecode(encoded_r.src, encoded_r.count), cmocka_cb,
|
|
1001
|
+
AMexpect(AM_VAL_TYPE_SYNC_STATE)),
|
|
1002
|
+
&sync_state_r));
|
|
1003
|
+
/*
|
|
1004
|
+
assert.notDeepStrictEqual(n1.getHeads(), r.getHeads()) */
|
|
1005
|
+
heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1006
|
+
AMitems heads_r = AMstackItems(stack_ptr, AMgetHeads(r), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1007
|
+
assert_false(AMitemsEqual(&heads1, &heads_r));
|
|
1008
|
+
/* assert.notDeepStrictEqual(n1.materialize(), r.materialize()) */
|
|
1009
|
+
assert_false(AMequal(test_state->n1, r));
|
|
1010
|
+
/* assert.deepStrictEqual(n1.materialize(), { x: 8 }) */
|
|
1011
|
+
uint64_t uint;
|
|
1012
|
+
assert_true(AMitemToUint(AMstackItem(stack_ptr, AMmapGet(test_state->n1, AM_ROOT, AMstr("x"), NULL), cmocka_cb,
|
|
1013
|
+
AMexpect(AM_VAL_TYPE_UINT)),
|
|
1014
|
+
&uint));
|
|
1015
|
+
assert_int_equal(uint, 8);
|
|
1016
|
+
/* assert.deepStrictEqual(r.materialize(), { x: 2 }) */
|
|
1017
|
+
assert_true(AMitemToUint(
|
|
1018
|
+
AMstackItem(stack_ptr, AMmapGet(r, AM_ROOT, AMstr("x"), NULL), cmocka_cb, AMexpect(AM_VAL_TYPE_UINT)), &uint));
|
|
1019
|
+
assert_int_equal(uint, 2);
|
|
1020
|
+
/* sync(n1, r, s1, rSyncState) */
|
|
1021
|
+
sync(test_state->n1, r, test_state->s1, sync_state_r);
|
|
1022
|
+
/* assert.deepStrictEqual(n1.getHeads(), r.getHeads()) */
|
|
1023
|
+
heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1024
|
+
heads_r = AMstackItems(stack_ptr, AMgetHeads(r), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1025
|
+
assert_true(AMitemsEqual(&heads1, &heads_r));
|
|
1026
|
+
/* assert.deepStrictEqual(n1.materialize(), r.materialize()) */
|
|
1027
|
+
assert_true(AMequal(test_state->n1, r));
|
|
1028
|
+
/* r = null */
|
|
1029
|
+
r = NULL;
|
|
1030
|
+
}
|
|
1031
|
+
|
|
1032
|
+
/**
|
|
1033
|
+
* \brief should re-sync after one node experiences data loss without disconnecting
|
|
1034
|
+
*/
|
|
1035
|
+
static void test_should_resync_after_one_node_experiences_data_loss_without_disconnecting(void** state) {
|
|
1036
|
+
/* const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'})
|
|
1037
|
+
const s1 = initSyncState(), s2 = initSyncState() */
|
|
1038
|
+
TestState* test_state = *state;
|
|
1039
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
1040
|
+
/*
|
|
1041
|
+
// n1 makes three changes, which we sync to n2
|
|
1042
|
+
for (let i = 0; i < 3; i++) { */
|
|
1043
|
+
for (size_t i = 0; i != 3; ++i) {
|
|
1044
|
+
/* n1.put("_root", "x", i) */
|
|
1045
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1046
|
+
/* n1.commit("", 0) */
|
|
1047
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1048
|
+
/* } */
|
|
1049
|
+
}
|
|
1050
|
+
/*
|
|
1051
|
+
sync(n1, n2, s1, s2) */
|
|
1052
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
1053
|
+
/*
|
|
1054
|
+
assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
1055
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1056
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1057
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
1058
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
1059
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
1060
|
+
/*
|
|
1061
|
+
const n2AfterDataLoss = create({ actor: '89abcdef'}) */
|
|
1062
|
+
AMactorId const* actor_id;
|
|
1063
|
+
assert_true(AMitemToActorId(
|
|
1064
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("89abcdef")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
1065
|
+
&actor_id));
|
|
1066
|
+
AMdoc* n2_after_data_loss;
|
|
1067
|
+
assert_true(AMitemToDoc(AMstackItem(stack_ptr, AMcreate(actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)),
|
|
1068
|
+
&n2_after_data_loss));
|
|
1069
|
+
/*
|
|
1070
|
+
// "n2" now has no data, but n1 still thinks it does. Note we don't do
|
|
1071
|
+
// decodeSyncState(encodeSyncState(s1)) in order to simulate data loss without disconnecting
|
|
1072
|
+
sync(n1, n2AfterDataLoss, s1, initSyncState()) */
|
|
1073
|
+
AMsyncState* s2_after_data_loss;
|
|
1074
|
+
assert_true(AMitemToSyncState(
|
|
1075
|
+
AMstackItem(stack_ptr, AMsyncStateInit(), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_STATE)), &s2_after_data_loss));
|
|
1076
|
+
sync(test_state->n1, n2_after_data_loss, test_state->s1, s2_after_data_loss);
|
|
1077
|
+
/* assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
1078
|
+
heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1079
|
+
heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1080
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
1081
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
1082
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
1083
|
+
}
|
|
1084
|
+
|
|
1085
|
+
/**
|
|
1086
|
+
* \brief should handle changes concurrent to the last sync heads
|
|
1087
|
+
*/
|
|
1088
|
+
static void test_should_handle_changes_concurrrent_to_the_last_sync_heads(void** state) {
|
|
1089
|
+
/* const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'}), n3 = create({ actor: 'fedcba98'}) */
|
|
1090
|
+
TestState* test_state = *state;
|
|
1091
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
1092
|
+
AMactorId const* actor_id;
|
|
1093
|
+
assert_true(AMitemToActorId(
|
|
1094
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("fedcba98")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
1095
|
+
&actor_id));
|
|
1096
|
+
AMdoc* n3;
|
|
1097
|
+
assert_true(AMitemToDoc(AMstackItem(stack_ptr, AMcreate(actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)), &n3));
|
|
1098
|
+
/* const s12 = initSyncState(), s21 = initSyncState(), s23 = initSyncState(), s32 = initSyncState() */
|
|
1099
|
+
AMsyncState* s12 = test_state->s1;
|
|
1100
|
+
AMsyncState* s21 = test_state->s2;
|
|
1101
|
+
AMsyncState* s23;
|
|
1102
|
+
assert_true(AMitemToSyncState(
|
|
1103
|
+
AMstackItem(stack_ptr, AMsyncStateInit(), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_STATE)), &s23));
|
|
1104
|
+
AMsyncState* s32;
|
|
1105
|
+
assert_true(AMitemToSyncState(
|
|
1106
|
+
AMstackItem(stack_ptr, AMsyncStateInit(), cmocka_cb, AMexpect(AM_VAL_TYPE_SYNC_STATE)), &s32));
|
|
1107
|
+
/*
|
|
1108
|
+
// Change 1 is known to all three nodes
|
|
1109
|
+
//n1 = Automerge.change(n1, {time: 0}, doc => doc.x = 1)
|
|
1110
|
+
n1.put("_root", "x", 1); n1.commit("", 0) */
|
|
1111
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), 1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1112
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1113
|
+
/*
|
|
1114
|
+
sync(n1, n2, s12, s21) */
|
|
1115
|
+
sync(test_state->n1, test_state->n2, s12, s21);
|
|
1116
|
+
/* sync(n2, n3, s23, s32) */
|
|
1117
|
+
sync(test_state->n2, n3, s23, s32);
|
|
1118
|
+
/*
|
|
1119
|
+
// Change 2 is known to n1 and n2
|
|
1120
|
+
n1.put("_root", "x", 2); n1.commit("", 0) */
|
|
1121
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), 2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1122
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1123
|
+
/*
|
|
1124
|
+
sync(n1, n2, s12, s21) */
|
|
1125
|
+
sync(test_state->n1, test_state->n2, s12, s21);
|
|
1126
|
+
/*
|
|
1127
|
+
// Each of the three nodes makes one change (changes 3, 4, 5)
|
|
1128
|
+
n1.put("_root", "x", 3); n1.commit("", 0) */
|
|
1129
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), 3), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1130
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1131
|
+
/* n2.put("_root", "x", 4); n2.commit("", 0) */
|
|
1132
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("x"), 4), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1133
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1134
|
+
/* n3.put("_root", "x", 5); n3.commit("", 0) */
|
|
1135
|
+
AMstackItem(NULL, AMmapPutUint(n3, AM_ROOT, AMstr("x"), 5), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1136
|
+
AMstackItem(NULL, AMcommit(n3, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1137
|
+
/*
|
|
1138
|
+
// Apply n3's latest change to n2. If running in Node, turn the Uint8Array into a Buffer, to
|
|
1139
|
+
// simulate transmission over a network (see https://github.com/automerge/automerge/pull/362)
|
|
1140
|
+
let change = n3.getLastLocalChange()
|
|
1141
|
+
if (change === null) throw new RangeError("no local change") */
|
|
1142
|
+
AMitems changes = AMstackItems(stack_ptr, AMgetLastLocalChange(n3), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1143
|
+
/* //ts-ignore
|
|
1144
|
+
if (typeof Buffer === 'function') change = Buffer.from(change)
|
|
1145
|
+
if (change === undefined) { throw new RangeError("last local change failed") }
|
|
1146
|
+
n2.applyChanges([change]) */
|
|
1147
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n2, &changes), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1148
|
+
/*
|
|
1149
|
+
// Now sync n1 and n2. n3's change is concurrent to n1 and n2's last sync heads
|
|
1150
|
+
sync(n1, n2, s12, s21) */
|
|
1151
|
+
sync(test_state->n1, test_state->n2, s12, s21);
|
|
1152
|
+
/* assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
1153
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1154
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1155
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
1156
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
1157
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
1158
|
+
}
|
|
1159
|
+
|
|
1160
|
+
/**
|
|
1161
|
+
* \brief should handle histories with lots of branching and merging
|
|
1162
|
+
*/
|
|
1163
|
+
static void test_should_handle_histories_with_lots_of_branching_and_merging(void** state) {
|
|
1164
|
+
/* const n1 = create({ actor: '01234567'}), n2 = create({ actor: '89abcdef'}), n3 = create({ actor: 'fedcba98'}) */
|
|
1165
|
+
TestState* test_state = *state;
|
|
1166
|
+
AMstack** stack_ptr = &test_state->base_state->stack;
|
|
1167
|
+
AMactorId const* actor_id;
|
|
1168
|
+
assert_true(AMitemToActorId(
|
|
1169
|
+
AMstackItem(stack_ptr, AMactorIdFromStr(AMstr("fedcba98")), cmocka_cb, AMexpect(AM_VAL_TYPE_ACTOR_ID)),
|
|
1170
|
+
&actor_id));
|
|
1171
|
+
AMdoc* n3;
|
|
1172
|
+
assert_true(AMitemToDoc(AMstackItem(stack_ptr, AMcreate(actor_id), cmocka_cb, AMexpect(AM_VAL_TYPE_DOC)), &n3));
|
|
1173
|
+
/* n1.put("_root", "x", 0); n1.commit("", 0) */
|
|
1174
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("x"), 0), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1175
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1176
|
+
/* const change1 = n1.getLastLocalChange()
|
|
1177
|
+
if (change1 === null) throw new RangeError("no local change") */
|
|
1178
|
+
AMitems change1 =
|
|
1179
|
+
AMstackItems(stack_ptr, AMgetLastLocalChange(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1180
|
+
/* n2.applyChanges([change1]) */
|
|
1181
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n2, &change1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1182
|
+
/* const change2 = n1.getLastLocalChange()
|
|
1183
|
+
if (change2 === null) throw new RangeError("no local change") */
|
|
1184
|
+
AMitems change2 =
|
|
1185
|
+
AMstackItems(stack_ptr, AMgetLastLocalChange(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1186
|
+
/* n3.applyChanges([change2]) */
|
|
1187
|
+
AMstackItem(NULL, AMapplyChanges(n3, &change2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1188
|
+
/* n3.put("_root", "x", 1); n3.commit("", 0) */
|
|
1189
|
+
AMstackItem(NULL, AMmapPutUint(n3, AM_ROOT, AMstr("x"), 1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1190
|
+
AMstackItem(NULL, AMcommit(n3, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1191
|
+
/*
|
|
1192
|
+
// - n1c1 <------ n1c2 <------ n1c3 <-- etc. <-- n1c20 <------ n1c21
|
|
1193
|
+
// / \/ \/ \/
|
|
1194
|
+
// / /\ /\ /\
|
|
1195
|
+
// c0 <---- n2c1 <------ n2c2 <------ n2c3 <-- etc. <-- n2c20 <------ n2c21
|
|
1196
|
+
// \ /
|
|
1197
|
+
// ---------------------------------------------- n3c1 <-----
|
|
1198
|
+
for (let i = 1; i < 20; i++) { */
|
|
1199
|
+
for (size_t i = 1; i != 20; ++i) {
|
|
1200
|
+
/* n1.put("_root", "n1", i); n1.commit("", 0) */
|
|
1201
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n1, AM_ROOT, AMstr("n1"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1202
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1203
|
+
/* n2.put("_root", "n2", i); n2.commit("", 0) */
|
|
1204
|
+
AMstackItem(NULL, AMmapPutUint(test_state->n2, AM_ROOT, AMstr("n2"), i), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1205
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1206
|
+
/* const change1 = n1.getLastLocalChange()
|
|
1207
|
+
if (change1 === null) throw new RangeError("no local change") */
|
|
1208
|
+
AMitems change1 =
|
|
1209
|
+
AMstackItems(stack_ptr, AMgetLastLocalChange(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1210
|
+
/* const change2 = n2.getLastLocalChange()
|
|
1211
|
+
if (change2 === null) throw new RangeError("no local change") */
|
|
1212
|
+
AMitems change2 =
|
|
1213
|
+
AMstackItems(stack_ptr, AMgetLastLocalChange(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1214
|
+
/* n1.applyChanges([change2]) */
|
|
1215
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n1, &change2), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1216
|
+
/* n2.applyChanges([change1]) */
|
|
1217
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n2, &change1), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1218
|
+
/* } */
|
|
1219
|
+
}
|
|
1220
|
+
/*
|
|
1221
|
+
const s1 = initSyncState(), s2 = initSyncState()
|
|
1222
|
+
sync(n1, n2, s1, s2) */
|
|
1223
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
1224
|
+
/*
|
|
1225
|
+
// Having n3's last change concurrent to the last sync heads forces us into the slower code path
|
|
1226
|
+
const change3 = n2.getLastLocalChange()
|
|
1227
|
+
if (change3 === null) throw new RangeError("no local change") */
|
|
1228
|
+
AMitems change3 = AMstackItems(stack_ptr, AMgetLastLocalChange(n3), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE));
|
|
1229
|
+
/* n2.applyChanges([change3]) */
|
|
1230
|
+
AMstackItem(NULL, AMapplyChanges(test_state->n2, &change3), cmocka_cb, AMexpect(AM_VAL_TYPE_VOID));
|
|
1231
|
+
/* n1.put("_root", "n1", "final"); n1.commit("", 0) */
|
|
1232
|
+
AMstackItem(NULL, AMmapPutStr(test_state->n1, AM_ROOT, AMstr("n1"), AMstr("final")), cmocka_cb,
|
|
1233
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
1234
|
+
AMstackItem(NULL, AMcommit(test_state->n1, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1235
|
+
/* n2.put("_root", "n2", "final"); n2.commit("", 0) */
|
|
1236
|
+
AMstackItem(NULL, AMmapPutStr(test_state->n2, AM_ROOT, AMstr("n2"), AMstr("final")), cmocka_cb,
|
|
1237
|
+
AMexpect(AM_VAL_TYPE_VOID));
|
|
1238
|
+
AMstackItem(NULL, AMcommit(test_state->n2, AMstr(""), &TIME_0), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1239
|
+
/*
|
|
1240
|
+
sync(n1, n2, s1, s2) */
|
|
1241
|
+
sync(test_state->n1, test_state->n2, test_state->s1, test_state->s2);
|
|
1242
|
+
/* assert.deepStrictEqual(n1.getHeads(), n2.getHeads()) */
|
|
1243
|
+
AMitems heads1 = AMstackItems(stack_ptr, AMgetHeads(test_state->n1), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1244
|
+
AMitems heads2 = AMstackItems(stack_ptr, AMgetHeads(test_state->n2), cmocka_cb, AMexpect(AM_VAL_TYPE_CHANGE_HASH));
|
|
1245
|
+
assert_true(AMitemsEqual(&heads1, &heads2));
|
|
1246
|
+
/* assert.deepStrictEqual(n1.materialize(), n2.materialize()) */
|
|
1247
|
+
assert_true(AMequal(test_state->n1, test_state->n2));
|
|
1248
|
+
}
|
|
1249
|
+
|
|
1250
|
+
int run_ported_wasm_sync_tests(void) {
|
|
1251
|
+
const struct CMUnitTest tests[] = {
|
|
1252
|
+
cmocka_unit_test_setup_teardown(test_should_send_a_sync_message_implying_no_local_data, setup, teardown),
|
|
1253
|
+
cmocka_unit_test_setup_teardown(test_should_not_reply_if_we_have_no_data_as_well_after_the_first_round, setup,
|
|
1254
|
+
teardown),
|
|
1255
|
+
cmocka_unit_test_setup_teardown(test_repos_with_equal_heads_do_not_need_a_reply_message_after_the_first_round,
|
|
1256
|
+
setup, teardown),
|
|
1257
|
+
cmocka_unit_test_setup_teardown(test_n1_should_offer_all_changes_to_n2_when_starting_from_nothing, setup,
|
|
1258
|
+
teardown),
|
|
1259
|
+
cmocka_unit_test_setup_teardown(test_should_sync_peers_where_one_has_commits_the_other_does_not, setup,
|
|
1260
|
+
teardown),
|
|
1261
|
+
cmocka_unit_test_setup_teardown(test_should_work_with_prior_sync_state, setup, teardown),
|
|
1262
|
+
cmocka_unit_test_setup_teardown(test_should_not_generate_messages_once_synced, setup, teardown),
|
|
1263
|
+
cmocka_unit_test_setup_teardown(test_should_allow_simultaneous_messages_during_synchronization, setup,
|
|
1264
|
+
teardown),
|
|
1265
|
+
cmocka_unit_test_setup_teardown(test_should_assume_sent_changes_were_received_until_we_hear_otherwise, setup,
|
|
1266
|
+
teardown),
|
|
1267
|
+
cmocka_unit_test_setup_teardown(test_should_work_regardless_of_who_initiates_the_exchange, setup, teardown),
|
|
1268
|
+
cmocka_unit_test_setup_teardown(test_should_work_without_prior_sync_state, setup, teardown),
|
|
1269
|
+
cmocka_unit_test_setup_teardown(test_should_work_with_prior_sync_state_2, setup, teardown),
|
|
1270
|
+
cmocka_unit_test_setup_teardown(test_should_ensure_non_empty_state_after_sync, setup, teardown),
|
|
1271
|
+
cmocka_unit_test_setup_teardown(test_should_resync_after_one_node_crashed_with_data_loss, setup, teardown),
|
|
1272
|
+
cmocka_unit_test_setup_teardown(test_should_resync_after_one_node_experiences_data_loss_without_disconnecting,
|
|
1273
|
+
setup, teardown),
|
|
1274
|
+
cmocka_unit_test_setup_teardown(test_should_handle_changes_concurrrent_to_the_last_sync_heads, setup, teardown),
|
|
1275
|
+
cmocka_unit_test_setup_teardown(test_should_handle_histories_with_lots_of_branching_and_merging, setup,
|
|
1276
|
+
teardown),
|
|
1277
|
+
};
|
|
1278
|
+
|
|
1279
|
+
return cmocka_run_group_tests(tests, NULL, NULL);
|
|
1280
|
+
}
|