Eiffeldoc : BACKTRACKING

+

Point of view

ANY

deferred class BACKTRACKING

Summary

Overview

exported features

set_current_node (node: BACKTRACKING_NODE)

Set the next node of the BACKTRACKING_NODE graph to be evaluated.
push_and (node: BACKTRACKING_NODE)

Pushes 'node' in front of the continuation path.
push_and_list (list: BACKTRACKING_NODE_AND_LIST)

Pushes 'list' in front of the continuation path.
push_or (node: BACKTRACKING_NODE)

Pushes 'node' in front of the possible alternatives.
push_or_list (list: BACKTRACKING_NODE_OR_LIST)

Pushes 'list' in front of the possible alternatives.

Common client features

search_first

Resets all and searchs the first solution.
search_next

Searchs the next solution.
search_is_success: BOOLEAN

True when search is successfull
is_off: BOOLEAN

True when search is finished
clear

Clears the current state to nothing.
is_cleared: BOOLEAN

True if no partial data remain in the current state

Control of the exploration

push_sequence (sequence: ABSTRACT_BACKTRACKING_SEQUENCE)

Pushs the 'sequence' in front of the continuation path.
push_alternative (alternative: ABSTRACT_BACKTRACKING_ALTERNATIVE)

Pushs the 'alternative' before the continuation path.
continue

Continues the exploration of the current path.
backtrack

Stops the exploration of the current path and tries to explore the next alternative path.
push_cut_point

Inserts a cut point into the continuation path.
cut

Removes the alternatives until the one recorded by the next cut point in the continuation path.
cut_all

Cuts all alternatives.

pool_of_cut_points: ABSTRACT_BACKTRACKING_POOL_OF_CUT_POINT

Bank of cut points

the pools

set_current_node (node: BACKTRACKING_NODE)

effective procedure

Set the next node of the BACKTRACKING_NODE graph to be evaluated.

push_and (node: BACKTRACKING_NODE)

effective procedure

Pushes 'node' in front of the continuation path.

push_and_list (list: BACKTRACKING_NODE_AND_LIST)

effective procedure

Pushes 'list' in front of the continuation path.

push_or (node: BACKTRACKING_NODE)

effective procedure

Pushes 'node' in front of the possible alternatives.

push_or_list (list: BACKTRACKING_NODE_OR_LIST)

effective procedure

Pushes 'list' in front of the possible alternatives.

search_first

effective procedure

Resets all and searchs the first solution.

search_next

effective procedure

Searchs the next solution.

search_is_success: BOOLEAN

writable attribute

True when search is successfull

is_off: BOOLEAN

effective function

True when search is finished

clear

effective procedure

Clears the current state to nothing.

is_cleared: BOOLEAN

effective function

True if no partial data remain in the current state

push_sequence (sequence: ABSTRACT_BACKTRACKING_SEQUENCE)

effective procedure

Pushs the 'sequence' in front of the continuation path.

push_alternative (alternative: ABSTRACT_BACKTRACKING_ALTERNATIVE)

effective procedure

Pushs the 'alternative' before the continuation path.

continue

effective procedure

Continues the exploration of the current path.

backtrack

effective procedure

Stops the exploration of the current path and tries to explore the next alternative path.

push_cut_point

effective procedure

Inserts a cut point into the continuation path.

cut

effective procedure

Removes the alternatives until the one recorded by the next cut point in the continuation path.

cut_all

effective procedure

Cuts all alternatives.

pool_of_cut_points: ABSTRACT_BACKTRACKING_POOL_OF_CUT_POINT

once function

Bank of cut points

pool_of_sequence: BACKTRACKING_POOL_OF_SEQUENCE

once function

pool_of_sequence_list: BACKTRACKING_POOL_OF_SEQUENCE_LIST

once function

pool_of_alternative: BACKTRACKING_POOL_OF_ALTERNATIVE

once function

pool_of_alternative_list: BACKTRACKING_POOL_OF_ALTERNATIVE_LIST

once function