org.qedeq.kernel.bo.common
Interface NodeBo

All Known Implementing Classes:

KernelNodeBo

public interface NodeBo

Represents a node and its properties.

Author:

Michael Meyling

Method Summary

Element	getFormula() Get formula of node.
ModuleContext	getModuleContext() Get module context the node is within.
NodeVo	getNodeVo() Get node.
QedeqNumbers	getNumbers() Get numbers of node.
QedeqBo	getParentQedeqBo() Get parent the node is in.
boolean	hasFormula() Has this node a formula?
boolean	isNotProved() This means for propositions that at least not even one formal proof could be successfully checked for correctness.
boolean	isNotWellFormed() Was this node checked unsuccessfully for formal correctness? This means checking the formal syntax of the node formulas.
boolean	isProved() This means that at least one formal proof was successfully checked for correctness and a rule declaration was possible.
boolean	isWellFormed() Was this node checked successfully for formal correctness? This means checking the formal syntax of the node formulas.

Method Detail

getParentQedeqBo

QedeqBo getParentQedeqBo()

Get parent the node is in.

Returns:

Parent module for this node.

getNumbers

QedeqNumbers getNumbers()

Get numbers of node.

Returns:

Node numbers.

getModuleContext

ModuleContext getModuleContext()

Get module context the node is within.

Returns:

The module context the node is within.

isWellFormed

boolean isWellFormed()

Was this node checked successfully for formal correctness? This means checking the formal syntax of the node formulas. This includes all formulas. LaTeX correctness doesn't play any role. Nodes without formal formulas return always true.

Returns:

true if the check was successful.

isNotWellFormed

boolean isNotWellFormed()

Was this node checked unsuccessfully for formal correctness? This means checking the formal syntax of the node formulas. This includes all formulas. LaTeX correctness doesn't play any role. Nodes without formal formulas return always false.

Returns:

true if the check was not successful.

isProved

boolean isProved()

This means that at least one formal proof was successfully checked for correctness and a rule declaration was possible. If we have no proposition and no rule we always get true.

Returns:

true if the check was successful.

isNotProved

boolean isNotProved()

This means for propositions that at least not even one formal proof could be successfully checked for correctness. For rules we get the question answered if a declaration is ok. If we have no proposition and no rule we always get false.

Returns:

true if the check was not successful.

hasFormula

boolean hasFormula()

Has this node a formula?

Returns:

Formula.

getFormula

Element getFormula()

Get formula of node. Can only be not null if this node is an Axiom, PredicateDefinition, FunctionDefinition or Proposition.

Returns:

Node formula.

getNodeVo

NodeVo getNodeVo()

Get node.

Returns:

Node.