modele
Class ArbreExec

java.lang.Object
  modele.ArbreExec

public class ArbreExec
extends java.lang.Object

To do like an ArbrePalindrome and NoeudPalindrome of Origin, tree of execution of algorithms.

Since:

September 1, 2008

Author:

Gabriel Chandesris (2008)

See Also:

ArbrePalindrome, NoeudPalindrome

Field Summary

private NoeudArbreExec	current
private PalindromeListeListe	structures Structures (default is instanciate as a new Vector).

Constructor Summary

ArbreExec()

Method Summary

void	actualiser() To set the structureS to be "in good mood".
void	descendre(int i) To get down in the tree : change current node to a choosen son of current node.
NoeudArbreExec	getCurrentNode()
Palindrome	getPalindrome(int i, int j)
PalindromeListe	getStructure(int i)
PalindromeListeListe	getStructures()
NoeudArbreExecListe	les_feuilles() Leaves of the root node.
private static void	les_feuilles(NoeudArbreExecListe feuilles, NoeudArbreExec n) Leaves of the given node are put in the NoeudArbreExecListe.
private static void	recuperation(PalindromeListeListe resultat, Palindrome[] tabPal, NoeudArbreExec n) "Recuperation" This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.
void	remonter() To get up in the tree : change current node to the father of current node.
void	setCurrentNode(NoeudArbreExec currentNode)
void	setStructures(PalindromeListeListe structures)
private PalindromeListeListe	tous_les_palindromes() "All Palindromes" This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.
void	trier_structures() Sorting the structureS.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

structures

private PalindromeListeListe structures

Structures (default is instanciate as a new Vector). To be a vector of tables of palindromes (Vector of PalindromeCible[]).

current

private NoeudArbreExec current

Constructor Detail

ArbreExec

public ArbreExec()

Method Detail

getStructures

public PalindromeListeListe getStructures()

getStructure

public PalindromeListe getStructure(int i)

getPalindrome

public Palindrome getPalindrome(int i,
                                int j)

setStructures

public void setStructures(PalindromeListeListe structures)

getCurrentNode

public NoeudArbreExec getCurrentNode()

setCurrentNode

public void setCurrentNode(NoeudArbreExec currentNode)

actualiser

public void actualiser()

To set the structureS to be "in good mood".
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

See Also:

tous_les_palindromes(), recuperation(PalindromeListeListe, Palindrome[], NoeudArbreExec), AlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean), AlgorithmsStefan.recherche_Pseudonoeud(Sequence, Base[], Sequence[], boolean, int, int), OtherAlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean), OtherAlgorithmsStefan.recherche_Pseudonoeud(Sequence, Base[], Sequence[], boolean, int, int)

tous_les_palindromes

private PalindromeListeListe tous_les_palindromes()

"All Palindromes"
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

Returns:

(PalindromeListeListe)

See Also:

actualiser(), recuperation(PalindromeListeListe, Palindrome[], NoeudArbreExec)

recuperation

private static void recuperation(PalindromeListeListe resultat,
                                 Palindrome[] tabPal,
                                 NoeudArbreExec n)

"Recuperation"
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

Parameters:

resultat - (PalindromeListeListe)

tabPal - (Palindrome1cible[]

n - (NoeudArbreExec)

See Also:

tous_les_palindromes(), AlgoStefanConverter.fusion_Palindrome(Palindrome[], Palindrome[]), OtherAlgoStefanConverter.fusion_Palindrome(Palindrome[], Palindrome[])

trier_structures

public void trier_structures()

Sorting the structureS.
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

See Also:

AlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean), AlgorithmsStefan.resultat_commun(PalindromeListeListe), OtherAlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean), OtherAlgorithmsStefan.resultat_commun(PalindromeListeListe)

les_feuilles

public NoeudArbreExecListe les_feuilles()

Leaves of the root node.
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

Returns:

(Vector) Vector of NoeudPalindrome's

See Also:

AlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean), OtherAlgorithmsStefan.calcul_Resultat(Sequence, Sequence[], int, boolean, boolean)

les_feuilles

private static void les_feuilles(NoeudArbreExecListe feuilles,
                                 NoeudArbreExec n)

Leaves of the given node are put in the NoeudArbreExecListe.
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

Parameters:

feuilles - (Vector) Vector of NoeudPalindrome's

n - (NoeudPalindrome) root of the tree

See Also:

les_feuilles()

remonter

public void remonter()

To get up in the tree : change current node to the father of current node.
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

See Also:

AlgorithmsStefan.recherche_Palindrome(Sequence, int, int, int, Sequence[], int, int, boolean, int), OtherAlgorithmsStefan.recherche_Palindrome(Sequence, int, int, int, Sequence[], int, int, boolean, int)

descendre

public void descendre(int i)

To get down in the tree : change current node to a choosen son of current node.
This method to keep compatibility with algorithms' implementation of Stefan Engelen and its conversion.

Parameters:

i - (int)

See Also:

AlgorithmsStefan.recherche_Palindrome(Sequence, int, int, int, Sequence[], int, int, boolean, int), OtherAlgorithmsStefan.recherche_Palindrome(Sequence, int, int, int, Sequence[], int, int, boolean, int)