Home Page
Site Map
Login/out
Message Board
Download(c) 2005-2025 XLOG Technologies AG
/**
* Warranty & Liability
* To the extent permitted by applicable law and unless explicitly
* otherwise agreed upon, XLOG Technologies AG makes no warranties
* regarding the provided information. XLOG Technologies AG assumes
* no liability that any problems might be solved with the information
* provided by XLOG Technologies AG.
*
* Rights & License
* All industrial property rights regarding the information - copyright
* and patent rights in particular - are the sole property of XLOG
* Technologies AG. If the company was not the originator of some
* excerpts, XLOG Technologies AG has at least obtained the right to
* reproduce, change and translate the information.
*
* Reproduction is restricted to the whole unaltered document. Reproduction
* of the information is only allowed for non-commercial uses. Selling,
* giving away or letting of the execution of the library is prohibited.
* The library can be distributed as part of your applications and libraries
* for execution provided this comment remains unchanged.
*
* Restrictions
* Only to be distributed with programs that add significant and primary
* functionality to the library. Not to be distributed with additional
* software intended to replace any components of the library.
*
* Trademarks
* Jekejeke is a registered trademark of XLOG Technologies AG.
*/
runner_file(calculate, tree, 'XLOG 1.6 tree').
/* tree_enum(S, T) */
runner_pred(tree_enum, 2, calculate, tree, 'XLOG 1.6.1').
runner_case(tree_enum, 2, calculate, tree, 'XLOG 1.6.1, XLOG 1') :-
tree_pairs(H, [a-9,b-8,a-7]),
findall(P, tree_enum(H, P), [Q|_]),
Q == a-7.
runner_case(tree_enum, 2, calculate, tree, 'XLOG 1.6.1, XLOG 2') :-
tree_pairs(H, [a-9,b-8,a-7]),
findall(P, tree_enum(H, P), [_,Q|_]),
Q == b-8.
runner_case(tree_enum, 2, calculate, tree, 'XLOG 1.6.1, XLOG 3') :-
tree_pairs(H, [a-9,b-8,a-7]),
findall(P, tree_enum(H, P), [_,_]).
/* tree_pairs(S, T) */
runner_pred(tree_pairs, 2, calculate, tree, 'XLOG 1.6.2').
runner_case(tree_pairs, 2, calculate, tree, 'XLOG 1.6.2, XLOG 1') :-
tree_new(H),
tree_pairs(H, X),
X == [].
runner_case(tree_pairs, 2, calculate, tree, 'XLOG 1.6.2, XLOG 2') :-
tree_new(H),
tree_set(H, a, 1),
tree_set(H, b, 2),
tree_pairs(H, X),
X == [a-1, b-2].
runner_case(tree_pairs, 2, calculate, tree, 'XLOG 1.6.2, XLOG 3') :-
tree_pairs(H, [a-9,b-8,a-7]),
tree_current(H, a, Y),
Y == 7,
tree_current(H, b, Z),
Z == 8.
runner_case(tree_pairs, 2, calculate, tree, 'XLOG 1.6.2, XLOG 4') :-
tree_pairs(H, [a-9]),
\+ tree_current(H, b, _).
/* tree_size(S, T) */
runner_pred(tree_size, 2, calculate, tree, 'XLOG 1.6.3').
runner_case(tree_size, 2, calculate, tree, 'XLOG 1.6.3, XLOG 1') :-
tree_pairs(H, []),
tree_size(H, X),
X == 0.
runner_case(tree_size, 2, calculate, tree, 'XLOG 1.6.3, XLOG 2') :-
tree_pairs(H, [a-9,b-8,a-7]),
tree_size(H, X),
X == 2.
runner_case(tree_size, 2, calculate, tree, 'XLOG 1.6.3, XLOG 3') :-
tree_pairs(H, [a-9]),
tree_size(H, X),
X == 1.
/* tree_current(T, K, V) */
runner_pred(tree_current, 3, calculate, tree, 'XLOG 1.6.4').
runner_case(tree_current, 3, calculate, tree, 'XLOG 1.6.4, XLOG 1') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_current(H, foo, X),
X == [1, 2, 3].
runner_case(tree_current, 3, calculate, tree, 'XLOG 1.6.4, XLOG 2') :-
tree_pairs(H, [foo-[1,2,3],bar-baz,jack-{b:1,a:2}]),
tree_current(H, bar, X),
X == baz.
runner_case(tree_current, 3, calculate, tree, 'XLOG 1.6.4, XLOG 3') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
\+ tree_current(H, jack, _).
runner_case(tree_current, 3, calculate, tree, 'XLOG 1.6.4, XLOG 4') :-
tree_pairs(H, []),
\+ tree_current(H, bar, _).
runner_case(tree_current, 3, calculate, tree, 'XLOG 1.6.4, XLOG 5') :-
tree_pairs(H, [jack-{b:1,a:2}]),
tree_current(H, jack, X),
X == {b:1,a:2}.
/* tree_set(T, K, V) */
runner_pred(tree_set, 3, calculate, tree, 'XLOG 1.6.5').
runner_case(tree_set, 3, calculate, tree, 'XLOG 1.6.5, XLOG 1') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_set(H, jack, {b:1,a:2}),
tree_pairs(H, X),
X == [bar-baz, foo-[1, 2, 3], jack-{b:1, a:2}].
runner_case(tree_set, 3, calculate, tree, 'XLOG 1.6.5, XLOG 2') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_set(H, bar, [4,5,6]),
tree_pairs(H, X),
X == [bar-[4, 5, 6], foo-[1, 2, 3]].
runner_case(tree_set, 3, calculate, tree, 'XLOG 1.6.5, XLOG 3') :-
tree_pairs(H, []),
tree_set(H, bar, baz),
tree_pairs(H, X),
X == [bar-baz].
runner_case(tree_set, 3, calculate, tree, 'XLOG 1.6.5, XLOG 4') :-
tree_pairs(H, [jack-{b:1,a:2}]),
tree_set(H, jack, jeff),
tree_pairs(H, X),
X == [jack-jeff].
/* tree_add(T, K, V) */
runner_pred(tree_add, 3, calculate, tree, 'XLOG 1.6.6').
runner_case(tree_add, 3, calculate, tree, 'XLOG 1.6.6, XLOG 1') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_add(H, jack, {b:1,a:2}),
tree_pairs(H, X),
X == [bar-baz, foo-[1, 2, 3], jack-{b:1, a:2}].
runner_case(tree_add, 3, calculate, tree, 'XLOG 1.6.6, XLOG 2') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
\+ tree_add(H, bar, [4,5,6]).
runner_case(tree_add, 3, calculate, tree, 'XLOG 1.6.6, XLOG 3') :-
tree_pairs(H, []),
tree_add(H, bar, baz),
tree_pairs(H, X),
X == [bar-baz].
runner_case(tree_add, 3, calculate, tree, 'XLOG 1.6.6, XLOG 4') :-
tree_pairs(H, [jack-{b:1,a:2}]),
\+ tree_add(H, jack, jeff).
/* tree_set(T, K, V, S) */
runner_pred(tree_set, 4, calculate, tree, 'XLOG 1.6.7').
runner_case(tree_set, 4, calculate, tree, 'XLOG 1.6.7, XLOG 1') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_set(H, jack, {b:1,a:2}, H2),
tree_pairs(H2, X),
X == [bar-baz, foo-[1, 2, 3], jack-{b:1, a:2}].
runner_case(tree_set, 4, calculate, tree, 'XLOG 1.6.7, XLOG 2') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_set(H, bar, [4,5,6], H2),
tree_pairs(H2, X),
X == [bar-[4, 5, 6], foo-[1, 2, 3]].
runner_case(tree_set, 4, calculate, tree, 'XLOG 1.6.7, XLOG 3') :-
tree_pairs(H, []),
tree_set(H, bar, baz, H2),
tree_pairs(H2, X),
X == [bar-baz].
runner_case(tree_set, 4, calculate, tree, 'XLOG 1.6.7, XLOG 4') :-
tree_pairs(H, [jack-{b:1,a:2}]),
tree_set(H, jack, jeff, H2),
tree_pairs(H2, X),
X == [jack-jeff].
/* tree_add(T, K, V, S) */
runner_pred(tree_add, 4, calculate, tree, 'XLOG 1.6.8').
runner_case(tree_add, 4, calculate, tree, 'XLOG 1.6.8, XLOG 1') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
tree_add(H, jack, {b:1,a:2}, H2),
tree_pairs(H2, X),
X == [bar-baz, foo-[1, 2, 3], jack-{b:1, a:2}].
runner_case(tree_add, 4, calculate, tree, 'XLOG 1.6.8, XLOG 2') :-
tree_pairs(H, [foo-[1,2,3],bar-baz]),
\+ tree_add(H, bar, [4,5,6], _).
runner_case(tree_add, 4, calculate, tree, 'XLOG 1.6.8, XLOG 3') :-
tree_pairs(H, []),
tree_add(H, bar, baz, H2),
tree_pairs(H2, X),
X == [bar-baz].
runner_case(tree_add, 4, calculate, tree, 'XLOG 1.6.8, XLOG 4') :-
tree_pairs(H, [jack-{b:1,a:2}]),
\+ tree_add(H, jack, jeff, _).