OK, so I'll give you two results. Here's the run with dbg/1 using information:
% depth: 1-node2_leaf
% on
% depth: 1-node(leaf,10-value10,leaf)
% two3tree_insert_1: success (in 0.00029869099999979554 seconds)
% depth: 1-node3_leaf
% depth: 1-node(leaf,10-value10,leaf,20-value20,leaf)
% two3tree_insert_2: success (in 0.0002536849999996704 seconds)And here's the run with dbg/1 using debug on the same test results:
% on
% two3tree_insert_1: success (in 0.00033641100000014745 seconds)
% two3tree_insert_2: success (in 0.00021322999999995318 seconds)
The dbg/1 messages vanish if configured for
debug but are visible if configured for information. In both cases the current_logtalk_flag (displayed using print_message/3 using information always) is on.
Most testing frameworks set my teeth on edge and make me avoid writing tests until I have to.
And I have no idea what an Allure is, so ... no.
... or just open https://infradig.github.io/trealla/
%
% tests started at 2021-09-10, 23:37:45
%
% running tests from object tests
% file: /home/michael/src/Playthings/Prolog/Logtalk/two3tree/tests.lgt
%
% two3tree_new: success (in 0.0001542940000001103 seconds)
% two3tree_insert_1: success (in 0.00011241300000008891 seconds)
% two3tree_insert_2: success (in 0.0001055439999997354 seconds)
% two3tree_insert_3: success (in 0.0004157660000001506 seconds)
% two3tree_insert_4: success (in 0.0001568519999999296 seconds)
% two3tree_insert_5: success (in 0.00012946400000002356 seconds)
% two3tree_insert_6: success (in 0.00017247299999967325 seconds)
% two3tree_insert_7: success (in 0.00018493100000016582 seconds)
%
% 8 tests: 0 skipped, 8 passed, 0 failed (0 flaky)
% completed tests from object tests
%
% no code coverage information collected
% tests ended at 2021-09-10, 23:37:45
%
(assuming that
two3tree is the name of the object being tested)
%
% tests started at 2021-09-10, 23:42:04
%
% running tests from object tests
% file: /home/michael/src/Playthings/Prolog/Logtalk/two3tree/tests.lgt
%
% two3tree_new: success (in 0.0001543320000001458 seconds)
% two3tree_insert_1: success (in 0.00010364400000018037 seconds)
% two3tree_insert_2: success (in 0.00011810099999998158 seconds)
% two3tree_insert_3: success (in 0.0004362789999996508 seconds)
% two3tree_insert_4: success (in 0.00013675199999996224 seconds)
% two3tree_insert_5: success (in 0.00012492799999996862 seconds)
% two3tree_insert_6: success (in 0.00015842699999968346 seconds)
% two3tree_insert_7: success (in 0.0001948069999997415 seconds)
%
% 8 tests: 0 skipped, 8 passed, 0 failed (0 flaky)
% completed tests from object tests
%
%
% clause coverage ratio and covered clauses per entity predicate
%
% two3tree: empty/1 - 1/1 - (all)
% two3tree: insert/4 - 4/4 - (all)
% two3tree: new/1 - 1/1 - (all)
% two3tree: node4/1 - 0/1 - []
% two3tree: 6 out of 7 clauses covered, 85.714286% coverage
%
% 1 entity declared as covered containing 7 clauses
% 1 out of 1 entity covered, 100.000000% entity coverage
% 6 out of 7 clauses covered, 85.714286% clause coverage
%
% tests ended at 2021-09-10, 23:42:04
%
Better?
Good coverage. You can also easily generate a report for that. E.g. https://logtalk.org/diagrams/coverage_report.html
So the coverage is always going to be one or two clauses uncovered at most.
I wish I had more time to do Logtalk.
This is a whole lot more fun than C. About in the same league as Ada, but for entirely different reasons.
After that the low-hanging fruit of searches, iteration, etc. is in the cards. That should be trivial. (I've done most of the work needed in the tester helpers for validating the tree structure.)
Once that's done, the Big One: deletion.
That's a real pig of an operation in 2-3 trees.
A lot of libraries that do 2-3 trees don't do deletion, but I suspect it will be easier in a declarative language than an imperative.
:- object(two3tree, implements(dictionaryp),
extends(term)).
…
With the
debug flag turned off, I call tests::run. No debug messages. I turn of the flag, run the tests again and get debug messages. Tried with dbg/1 calls from cleanup/0, tests, and test auxiliary predicates.