import py
from prolog.interpreter.continuation import *
from prolog.interpreter.parsing import parse_query_term, get_engine
from prolog.interpreter.parsing import get_query_and_vars
from prolog.interpreter.error import UnificationFailed
from prolog.interpreter.test.tool import collect_all, assert_true, assert_false
from prolog.interpreter.term import Number

class CheckContinuation(Continuation):
    rule = None
    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module
    def is_done(self):
        return False
    def activate(self, fcont, heap):
        original_heap = heap
        # hack: use _dot to count size of tree
        seen = set()

        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(self.engine), original_heap

def test_cut():
    e = get_engine("""
        f(0).
        f(X) :- X>0, X0 is X - 1, !, f(X0).
        f(_).""")
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

@py.test.mark.xfail # bug introduced in aa127d31df0c
def test_exception():
    e = get_engine("""
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0)).""")
    query = Callable.build("g", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_call():
    e = get_engine("""
        g(0).
        g(X) :- X > 0, X0 is X - 1, call(g(X0)).""")
    query = Callable.build("g", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_map():
    e = get_engine("""
        add1(X, X1) :- X1 is X + 1.
        map(_, [], []).
        map(Pred, [H1 | T1], [H2 | T2]) :-
            C =.. [Pred, H1, H2],
            call(C),
            map(Pred, T1, T2).
        map(X) :- !.
        h(X) :- map(add1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 11, 12, 13], [X | _]).
    """)
    query = Callable.build("h", [Number(2)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_partition():
    e = get_engine("""
    partition([],_,[],[]).
    partition([X|L],Y,[X|L1],L2) :-
        X =< Y, !,
        partition(L,Y,L1,L2).
    partition([X|L],Y,L1,[X|L2]) :-
        partition(L,Y,L1,L2).
    i(X) :- partition([6, 6, 6, 6, 6, 6, 6, 1, 5, 1, 5, 7, 9,2,4, 3, 7, 9, 0, 10], 5, [X | _], _).
    """)
    query = Callable.build("i", [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_tak():
    e = get_engine("""
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """)
    query = Callable.build("j", [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_recurse_with_if():
    e = get_engine("""
    equal(0, 0). equal(X, X).
    f(X) :- equal(X, 0) -> true ; Y is X - 1, f(Y).
    """)
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_recurse_with_many_base_cases():
    e = get_engine("""
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- Y is X - 1, f(Y).
    """)
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_serialize():
    e = get_engine("""
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """)

    query = Callable.build("serialise")
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

4843aa07112e271fc9d2912ef7642416639f7556
<mask token>


class CheckContinuation(Continuation):
    rule = None

    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module

    def is_done(self):
        return False

    def activate(self, fcont, heap):
        original_heap = heap
        seen = set()
        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(
            self.engine), original_heap


<mask token>


@py.test.mark.xfail
def test_exception():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0))."""
        )
    query = Callable.build('g', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_tak():
    e = get_engine(
        """
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """
        )
    query = Callable.build('j', [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_serialize():
    e = get_engine(
        """
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """
        )
    query = Callable.build('serialise')
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

<mask token>


class CheckContinuation(Continuation):
    rule = None

    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module

    def is_done(self):
        return False

    def activate(self, fcont, heap):
        original_heap = heap
        seen = set()
        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(
            self.engine), original_heap


<mask token>


@py.test.mark.xfail
def test_exception():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0))."""
        )
    query = Callable.build('g', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_tak():
    e = get_engine(
        """
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """
        )
    query = Callable.build('j', [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_recurse_with_if():
    e = get_engine(
        """
    equal(0, 0). equal(X, X).
    f(X) :- equal(X, 0) -> true ; Y is X - 1, f(Y).
    """
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_serialize():
    e = get_engine(
        """
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """
        )
    query = Callable.build('serialise')
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

<mask token>


class CheckContinuation(Continuation):
    rule = None

    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module

    def is_done(self):
        return False

    def activate(self, fcont, heap):
        original_heap = heap
        seen = set()
        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(
            self.engine), original_heap


def test_cut():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, !, f(X0).
        f(_)."""
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


@py.test.mark.xfail
def test_exception():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0))."""
        )
    query = Callable.build('g', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_map():
    e = get_engine(
        """
        add1(X, X1) :- X1 is X + 1.
        map(_, [], []).
        map(Pred, [H1 | T1], [H2 | T2]) :-
            C =.. [Pred, H1, H2],
            call(C),
            map(Pred, T1, T2).
        map(X) :- !.
        h(X) :- map(add1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 11, 12, 13], [X | _]).
    """
        )
    query = Callable.build('h', [Number(2)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


<mask token>


def test_tak():
    e = get_engine(
        """
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """
        )
    query = Callable.build('j', [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_recurse_with_if():
    e = get_engine(
        """
    equal(0, 0). equal(X, X).
    f(X) :- equal(X, 0) -> true ; Y is X - 1, f(Y).
    """
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_recurse_with_many_base_cases():
    e = get_engine(
        """
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- Y is X - 1, f(Y).
    """
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_serialize():
    e = get_engine(
        """
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """
        )
    query = Callable.build('serialise')
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

<mask token>


class CheckContinuation(Continuation):
    rule = None

    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module

    def is_done(self):
        return False

    def activate(self, fcont, heap):
        original_heap = heap
        seen = set()
        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(
            self.engine), original_heap


def test_cut():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, !, f(X0).
        f(_)."""
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


@py.test.mark.xfail
def test_exception():
    e = get_engine(
        """
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0))."""
        )
    query = Callable.build('g', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_call():
    e = get_engine(
        """
        g(0).
        g(X) :- X > 0, X0 is X - 1, call(g(X0)).""")
    query = Callable.build('g', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_map():
    e = get_engine(
        """
        add1(X, X1) :- X1 is X + 1.
        map(_, [], []).
        map(Pred, [H1 | T1], [H2 | T2]) :-
            C =.. [Pred, H1, H2],
            call(C),
            map(Pred, T1, T2).
        map(X) :- !.
        h(X) :- map(add1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 11, 12, 13], [X | _]).
    """
        )
    query = Callable.build('h', [Number(2)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_partition():
    e = get_engine(
        """
    partition([],_,[],[]).
    partition([X|L],Y,[X|L1],L2) :-
        X =< Y, !,
        partition(L,Y,L1,L2).
    partition([X|L],Y,L1,[X|L2]) :-
        partition(L,Y,L1,L2).
    i(X) :- partition([6, 6, 6, 6, 6, 6, 6, 1, 5, 1, 5, 7, 9,2,4, 3, 7, 9, 0, 10], 5, [X | _], _).
    """
        )
    query = Callable.build('i', [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_tak():
    e = get_engine(
        """
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """
        )
    query = Callable.build('j', [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_recurse_with_if():
    e = get_engine(
        """
    equal(0, 0). equal(X, X).
    f(X) :- equal(X, 0) -> true ; Y is X - 1, f(Y).
    """
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_recurse_with_many_base_cases():
    e = get_engine(
        """
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- Y is X - 1, f(Y).
    """
        )
    query = Callable.build('f', [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))


def test_serialize():
    e = get_engine(
        """
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """
        )
    query = Callable.build('serialise')
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

import py
from prolog.interpreter.continuation import *
from prolog.interpreter.parsing import parse_query_term, get_engine
from prolog.interpreter.parsing import get_query_and_vars
from prolog.interpreter.error import UnificationFailed
from prolog.interpreter.test.tool import collect_all, assert_true, assert_false
from prolog.interpreter.term import Number

class CheckContinuation(Continuation):
    rule = None
    def __init__(self, engine, seen=10):
        self.engine = engine
        self.nextcont = None
        self._candiscard = True
        self.seen = seen
        self.module = self.engine.modulewrapper.user_module
    def is_done(self):
        return False
    def activate(self, fcont, heap):
        original_heap = heap
        # hack: use _dot to count size of tree
        seen = set()

        list(fcont._dot(seen))
        assert len(seen) < self.seen
        depth = 0
        while fcont.nextcont:
            depth += 1
            fcont = fcont.nextcont
        assert depth < self.seen
        depth = 0
        numvars = 0
        while heap:
            depth += 1
            numvars += heap.i
            heap = heap.prev
        assert depth < self.seen
        assert numvars < self.seen
        return DoneSuccessContinuation(self.engine), DoneFailureContinuation(self.engine), original_heap

def test_cut():
    e = get_engine("""
        f(0).
        f(X) :- X>0, X0 is X - 1, !, f(X0).
        f(_).""")
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

@py.test.mark.xfail # bug introduced in aa127d31df0c
def test_exception():
    e = get_engine("""
        f(0).
        f(X) :- X>0, X0 is X - 1, throw(continue(X0)).
        g(X) :- catch(f(X), continue(X0), g(X0)).""")
    query = Callable.build("g", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_call():
    e = get_engine("""
        g(0).
        g(X) :- X > 0, X0 is X - 1, call(g(X0)).""")
    query = Callable.build("g", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_map():
    e = get_engine("""
        add1(X, X1) :- X1 is X + 1.
        map(_, [], []).
        map(Pred, [H1 | T1], [H2 | T2]) :-
            C =.. [Pred, H1, H2],
            call(C),
            map(Pred, T1, T2).
        map(X) :- !.
        h(X) :- map(add1, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 6, 7, 8, 9, 10, 11, 12, 13], [X | _]).
    """)
    query = Callable.build("h", [Number(2)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_partition():
    e = get_engine("""
    partition([],_,[],[]).
    partition([X|L],Y,[X|L1],L2) :-
        X =< Y, !,
        partition(L,Y,L1,L2).
    partition([X|L],Y,L1,[X|L2]) :-
        partition(L,Y,L1,L2).
    i(X) :- partition([6, 6, 6, 6, 6, 6, 6, 1, 5, 1, 5, 7, 9,2,4, 3, 7, 9, 0, 10], 5, [X | _], _).
    """)
    query = Callable.build("i", [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_tak():
    e = get_engine("""
    tak(X,Y,Z,A) :-
            write(tak(X, Y, Z, A)), nl,
            X =< Y, !,
            write('succeeded'), nl,
            Z = A.
    tak(X,Y,Z,A) :-
            % X > Y,
            X1 is X - 1,
            tak(X1,Y,Z,A1),
            Y1 is Y - 1,
            tak(Y1,Z,X,A2),
            Z1 is Z - 1,
            tak(Z1,X,Y,A3),
            tak(A1,A2,A3,A).

    j(1) :- tak(18, 5, 5, _).
    """)
    query = Callable.build("j", [Number(1)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_recurse_with_if():
    e = get_engine("""
    equal(0, 0). equal(X, X).
    f(X) :- equal(X, 0) -> true ; Y is X - 1, f(Y).
    """)
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_recurse_with_many_base_cases():
    e = get_engine("""
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- X = 0.
    f(X) :- Y is X - 1, f(Y).
    """)
    query = Callable.build("f", [Number(100)])
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))

def test_serialize():
    e = get_engine("""
    
    serialise :- serialise([65, 66, 76, 69, 32, 87, 65, 83, 32, 32, 73, 32, 83, 65, 87, 32, 69, 76, 66, 65],_).

    serialise(L,R) :-
        pairlists(L,R,A),
        arrange(A,T),
        numbered(T,1,_).

    pairlists([X|L],[Y|R],[pair(X,Y)|A]) :- pairlists(L,R,A).
    pairlists([],[],[]).

    arrange([X|L],tree(T1,X,T2)) :-
        split(L,X,L1,L2),
        arrange(L1,T1),
        arrange(L2,T2).
    arrange([],void).

    split([X|L],X,L1,L2) :- !, split(L,X,L1,L2).
    split([X|L],Y,[X|L1],L2) :- before(X,Y), !, split(L,Y,L1,L2).
    split([X|L],Y,L1,[X|L2]) :- before(Y,X), !, split(L,Y,L1,L2).
    split([],_,[],[]).

    before(pair(X1,_),pair(X2,_)) :- X1 < X2.

    numbered(tree(T1,pair(_,N1),T2),N0,N) :-
        numbered(T1,N0,N1),
        N2 is N1+1,
        numbered(T2,N2,N).
    numbered(void,N,N).
    """)

    query = Callable.build("serialise")
    e.run_query(query, e.modulewrapper.user_module, CheckContinuation(e))
