search::PartialVertex Class Reference

#include <vertex.hh>

Collaboration diagram for search::PartialVertex:

[legend]

List of all members.

Public Member Functions
	PartialVertex ()
	PartialVertex (VertexNode &back)
bool	Empty () const
bool	Complete () const
const lm::ngram::ChartState &	State () const
bool	RightFull () const
Score	Bound () const
unsigned char	Niceness () const
bool	Split (PartialVertex &alternative)
const History	End () const

---

Detailed Description

Definition at line 108 of file vertex.hh.

---

Constructor & Destructor Documentation

search::PartialVertex::PartialVertex

(

)

[inline]

Definition at line 110 of file vertex.hh.

search::PartialVertex::PartialVertex

(

VertexNode &

back

)

[inline, explicit]

Definition at line 112 of file vertex.hh.

---

Member Function Documentation

Score search::PartialVertex::Bound

(

)

const [inline]

Definition at line 121 of file vertex.hh.

References search::VertexNode::Bound().

Referenced by search::EdgeGenerator::Pop().

Here is the call graph for this function:

Here is the caller graph for this function:

bool search::PartialVertex::Complete

(

)

const [inline]

Definition at line 116 of file vertex.hh.

References search::VertexNode::Complete().

Referenced by search::Vertex::BestChild(), and Split().

Here is the call graph for this function:

Here is the caller graph for this function:

bool search::PartialVertex::Empty

(

)

const [inline]

Definition at line 114 of file vertex.hh.

References search::VertexNode::Empty().

Referenced by search::Vertex::BestChild().

Here is the call graph for this function:

Here is the caller graph for this function:

const History search::PartialVertex::End

(

)

const [inline]

Definition at line 142 of file vertex.hh.

References search::VertexNode::End().

Referenced by search::Vertex::BestChild(), and search::GenericApplied< Applied >::GenericApplied().

Here is the call graph for this function:

Here is the caller graph for this function:

unsigned char search::PartialVertex::Niceness

(

)

const [inline]

Definition at line 123 of file vertex.hh.

References search::VertexNode::Niceness().

Referenced by search::EdgeGenerator::Pop().

Here is the call graph for this function:

Here is the caller graph for this function:

bool search::PartialVertex::RightFull

(

)

const [inline]

Definition at line 119 of file vertex.hh.

References search::VertexNode::RightFull().

Here is the call graph for this function:

bool search::PartialVertex::Split

(

PartialVertex &

alternative

)

[inline]

Definition at line 126 of file vertex.hh.

References search::VertexNode::BuildExtend(), Complete(), and search::VertexNode::Size().

Referenced by search::Vertex::BestChild().

Here is the call graph for this function:

Here is the caller graph for this function:

const lm::ngram::ChartState& search::PartialVertex::State

(

)

const [inline]

Definition at line 118 of file vertex.hh.

References search::VertexNode::State().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• /disk4/html/www/moses/doxygen/mosesdecoder/search/vertex.hh