org.qedeq.kernel.bo.module
Class KernelNodeBo

java.lang.Object
  org.qedeq.kernel.bo.module.KernelNodeBo

All Implemented Interfaces:

NodeBo, CheckLevel

public class KernelNodeBo
extends java.lang.Object
implements NodeBo, CheckLevel

Business object for node access.

Author:

Michael Meyling

Field Summary

Fields inherited from interface org.qedeq.kernel.se.common.CheckLevel

FAILURE, SUCCESS, UNCHECKED

Constructor Summary

KernelNodeBo(NodeVo node, ModuleContext context, KernelQedeqBo qedeq, QedeqNumbers data)
Constructor.

Method Summary

Element	getFormula() Get formula of node.
ModuleContext	getModuleContext() Get module context the node is within.
NodeVo	getNodeVo() Get plain node data.
QedeqNumbers	getNumbers() Get the results of various counters for the node.
QedeqBo	getParentQedeqBo() Get parent module the node is within.
KernelQedeqBo	getQedeqBo() Get parent module the node is within.
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	isProofLineLabel(java.lang.String label) // FIXME 20110316 m31: we have to solve the uniqueness problem if we have several formal proofs Is the given name a proof line label within this node?
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.
void	setProved(int provedCheck) Set proved parameter.
void	setWellFormed(int wellFormedCheck) Set proved parameter.

Methods inherited from class java.lang.Object

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

Constructor Detail

KernelNodeBo

public KernelNodeBo(NodeVo node,
                    ModuleContext context,
                    KernelQedeqBo qedeq,
                    QedeqNumbers data)

Constructor.

Parameters:

node - The plain node data.

context - The module context the node is within.

qedeq - Parent module the node is within.

data - Herein are the results of various counters for the node.

Method Detail

getNodeVo

public NodeVo getNodeVo()

Get plain node data.

Specified by:

getNodeVo in interface NodeBo

Returns:

The plain node data.

getModuleContext

public ModuleContext getModuleContext()

Get module context the node is within.

Specified by:

getModuleContext in interface NodeBo

Returns:

The module context the node is within.

getParentQedeqBo

public QedeqBo getParentQedeqBo()

Get parent module the node is within.

Specified by:

getParentQedeqBo in interface NodeBo

Returns:

Parent module the node is within.

getQedeqBo

public KernelQedeqBo getQedeqBo()

Get parent module the node is within.

Returns:

Parent module the node is within.

getNumbers

public QedeqNumbers getNumbers()

Get the results of various counters for the node.

Specified by:

getNumbers in interface NodeBo

Returns:

Herein are the results of various counters for the node.

isProofLineLabel

public boolean isProofLineLabel(java.lang.String label)

// FIXME 20110316 m31: we have to solve the uniqueness problem if we have several formal proofs Is the given name a proof line label within this node?

Parameters:

label - Look if this node is a proposition that contains this label name.

Returns:

Answer.

setWellFormed

public void setWellFormed(int wellFormedCheck)

Set proved parameter. See isWellFormed().

Parameters:

wellFormedCheck - Node well formed state. See CheckLevel for parameter format.

isWellFormed

public boolean isWellFormed()

Description copied from interface: NodeBo

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.

Specified by:

isWellFormed in interface NodeBo

Returns:

true if the check was successful.

isNotWellFormed

public boolean isNotWellFormed()

Description copied from interface: NodeBo

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.

Specified by:

isNotWellFormed in interface NodeBo

Returns:

true if the check was not successful.

setProved

public void setProved(int provedCheck)

Set proved parameter. See isProved().

Parameters:

provedCheck - Node proved state. See CheckLevel for parameter format.

isProved

public boolean isProved()

Description copied from interface: NodeBo

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.

Specified by:

isProved in interface NodeBo

Returns:

true if the check was successful.

isNotProved

public boolean isNotProved()

Description copied from interface: NodeBo

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.

Specified by:

isNotProved in interface NodeBo

Returns:

true if the check was not successful.

hasFormula

public boolean hasFormula()

Description copied from interface: NodeBo

Has this node a formula?

Specified by:

hasFormula in interface NodeBo

Returns:

Formula.

getFormula

public Element getFormula()

Description copied from interface: NodeBo

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

Specified by:

getFormula in interface NodeBo

Returns:

Node formula.