CQueryNode is an abstract class for any node in a query parse tree. A parse tree is built by YACC during CQueryCompiler::ParseQuery. This class contains all members which are common to atomic and operation nodes. More...

#include <QueryNode.h>

Inheritance diagram for CQueryNode:

[legend]

Collaboration diagram for CQueryNode:

[legend]

Public Member Functions
	CQueryNode (bool bUseNodeIndices=false, bool bUseMatchIds=false, const CConcHolder *holder=NULL)
	Constructor. More...

virtual	~CQueryNode ()
	Destructor. More...

virtual void	Evaluate (bool bSeparateHits=false)

virtual void	EvaluateWithoutHits ()
	initial-stage query evaluation EvaluateWithoutHits is the first stage of the evaluation of one query. The main task it to build CQueryNode::m_Occurrences, which is written by chunks, sorted by the first item of a chunk. More...

void	SetNegation (bool Value)
	set m_bNegated More...

bool	GetNegation () const
	get m_bNegated More...

void	AddOccurrence (const CQueryNode &FromNode, int FromOcc)
	insers a single occurrence FromNode.m_Occurrences[occ] More...

void	AddOccurrences (const CQueryNode &FromNode, int start, int end)
	inserts occurrences [FromNode.m_Occurrences.begin()+start, FromNode.m_Occurrences.begin()+end) into m_Occurrences[] (and m_OccurrenceNodeIndices if appropriate) More...

void	AddOccurrences2 (const CQueryNode &FromNode1, int start1, int end1, const CQueryNode &FromNode2, int start2, int end2)
	appends occurrences from both FromNode1 and FromNode2, maintaining sort-order and respecting both m_bUseNodeIndices and m_bUseMatchIds More...

void	AddOccurrences3 (const CQueryNode &FromNode1, int start1, int end1, const CQueryNode &FromNode2, int start2, int end2, const CQueryNode &FromNode3, int start3, int end3)
	appends occurrences from FromNode1, FromNode2, and FromNode3 maintaining sort-order and respecting both m_bUseNodeIndices and m_bUseMatchIds More...

void	ClearAndReserveOccurrences (int size)

void	SwapOccurrences (CQueryNode &Node, bool swapChunkLengths=false)
	swaps m_Occurrences[], m_OccurrenceNodeIndices[], and m_OccurrenceMatchIds[] between caller object and Node More...

void	ConvertOccurrencesToHits (bool bSeparateHits)
	convert occurrences to hits using m_pHolder->GetBreaks() More...

void	ConvertOccurrencesToHitsForPatterns (bool bSeparateHits)
	convert occurrences to hits for pattern query construction (like "mother likes father") More...

void	EnsureChunkOffsets ()
	ensure m_ChunkOffsets[] is populated More...

void	SetHolder (const CConcHolder *pHolder)
	set m_pHolder dependent properties m_bUseNodeIndices, m_bUseMatchIds More...

virtual bool	IsUniversalWildcard () const
	return true iff this is a universal wildcard query (*); default returns false More...

virtual size_t	GetNodeFrequencyByNodeIndex (size_t NodeIndex) const
	get occurrence count by query-node index; used by rank-sort operator. default implementation in CQueryNode just chokes. More...

DWORD	HitOccurrencesBegin (DWORD HitNo) const
	get the index of the first occurrence in m_Occurrences[] for hit number HitNo More...

DWORD	HitOccurrencesEnd (DWORD HitNo) const
	get the index of the first occurrence in m_Occurrences[] after hit number HitNo More...

DWORD	GetFirstOccurrenceInHit (DWORD HitNo, BYTE MatchId) const

DWORD	GetLastOccurrenceInHit (DWORD HitNo, BYTE MatchId) const

DWORD	GetMiddleOccurrenceInHit (DWORD HitNo, BYTE MatchId) const

DWORD	BreakStride () const
	get average size of gap between breaks in m_Hits[]; returned value is always >= 1 More...

Public Attributes
bool	m_bAtomic
	true if this node is a description of one token or a sequence of adjacent tokens More...

bool	m_bNegated
	is the node negated? More...

string	m_Source
	the string from which this node was created More...

vector< CTokenNo >	m_Occurrences
	all occurrences of this node in the current subcorpus, which should be highlighted More...

bool	m_bUseNodeIndices
	should DDC uses m_OccurrenceNodeIndices (m_OccurrenceNodeIndices is necessary only for #less_by_rank) More...

vector< BYTE >	m_OccurrenceNodeIndices
	query node indices for each occurrence (the origin for each occurrence) More...

bool	m_bUseMatchIds
	should DDC use m_OccurrenceMatchIds to track match-ids? More...

vector< BYTE >	m_OccurrenceMatchIds
	match-ids for each occurrence in m_Occurrences (only if m_bUseMatchIds is true) More...

vector< CHit >	m_Hits
	all hits of this node in the current subcorpora More...

const CConcHolder *	m_pHolder
	a reference to the parent holder (moo: should be unused until evaluation time, but isn't!) More...

vector< DWORD >	m_ChunkLengths

vector< DWORD >	m_ChunkOffsets

vector< int >	m_CacheIds
	??? More...

Detailed Description

CQueryNode is an abstract class for any node in a query parse tree. A parse tree is built by YACC during CQueryCompiler::ParseQuery. This class contains all members which are common to atomic and operation nodes.

moo: this class looks like it should be an abstract representation of query without any direct dependence on an actual index instance (e.g. ConcHolder or ConcIndexator) until evaluation time, but that doesn't appear to be the case. Attempting to re-build a more modular abstract query representation in Query.(cpp|h).

Constructor & Destructor Documentation

◆ CQueryNode()

CQueryNode::CQueryNode	(	bool	bUseNodeIndices = `false`,
		bool	bUseMatchIds = `false`,
		const CConcHolder *	holder = `NULL`
	)

inline

Constructor.

References Evaluate(), EvaluateWithoutHits(), GetNegation(), SetNegation(), and ~CQueryNode().

Here is the call graph for this function:

◆ ~CQueryNode()

CQueryNode::~CQueryNode ( )

virtual

Destructor.

References ClearVector(), m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by CQueryNode().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Function Documentation

◆ Evaluate()

void CQueryNode::Evaluate ( bool bSeparateHits = false )

virtual

evaluate query node with respect to m_pHolder , populating m_Hits[] attributes m_BreakNo, m_HighlightOcurrencesEnd . If bSeparateHits is false (default), hits in m_Hits[] will by aggregated by m_BreakNo (i.e. at most one instance of any m_BreakNo value in m_Hits[])

Reimplemented in CQueryWithNode, CQueryNearNode, CQuerySequenceNode, CQueryTokenNode, CQueryOrOperation, and CQueryAndOperation.

References errParseError.

Referenced by CQueryNode(), CQuery::Evaluate(), CQueryAndOperation::~CQueryAndOperation(), CQueryOrOperation::~CQueryOrOperation(), and CQueryWithNode::~CQueryWithNode().

Here is the caller graph for this function:

◆ EvaluateWithoutHits()

void CQueryNode::EvaluateWithoutHits ( )

virtual

initial-stage query evaluation EvaluateWithoutHits is the first stage of the evaluation of one query. The main task it to build CQueryNode::m_Occurrences, which is written by chunks, sorted by the first item of a chunk.

Reimplemented in CQueryWithorNode, CQueryWithoutNode, CQueryWithNode, CQuerySequenceNode, and CQueryTokenNode.

Referenced by CQueryNode(), CQueryWithNode::Evaluate(), CQueryNearNode::FindOccurrences2(), CQueryNearNode::FindOccurrences3(), CConcSession::GetOccurrences(), CQueryWithNode::~CQueryWithNode(), CQueryWithorNode::~CQueryWithorNode(), and CQueryWithoutNode::~CQueryWithoutNode().

Here is the caller graph for this function:

◆ SetNegation()

void CQueryNode::SetNegation ( bool Value )

set m_bNegated

References m_bNegated.

Referenced by CQNegatable::Compile(), CQueryNode(), CQueryAndOperation::Evaluate(), and CQueryOrOperation::Evaluate().

Here is the caller graph for this function:

◆ GetNegation()

bool CQueryNode::GetNegation ( ) const

get m_bNegated

References m_bNegated.

Referenced by CQueryNode().

Here is the caller graph for this function:

◆ AddOccurrence()

void CQueryNode::AddOccurrence	(	const CQueryNode &	FromNode,
		int	FromOcc
	)

inline

insers a single occurrence FromNode.m_Occurrences[occ]

References AddOccurrences(), AddOccurrences2(), AddOccurrences3(), ClearAndReserveOccurrences(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), EnsureChunkOffsets(), GetNodeFrequencyByNodeIndex(), IsUniversalWildcard(), m_OccurrenceMatchIds, m_OccurrenceNodeIndices, m_Occurrences, SetHolder(), and SwapOccurrences().

Here is the call graph for this function:

◆ AddOccurrences()

void CQueryNode::AddOccurrences	(	const CQueryNode &	FromNode,
		int	start,
		int	end
	)

inserts occurrences [FromNode.m_Occurrences.begin()+start, FromNode.m_Occurrences.begin()+end) into m_Occurrences[] (and m_OccurrenceNodeIndices if appropriate)

References m_bUseMatchIds, m_bUseNodeIndices, m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by AddOccurrence(), AddOccurrences2(), AddOccurrences3(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQuerySequenceNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CQueryBinaryOperationNode::hits_add(), CQueryBinaryOperationNode::hits_and_positions_assign(), CQueryBinaryOperationNode::hits_and_positions_difference(), and CQueryBinaryOperationNode::hits_and_positions_union().

Here is the caller graph for this function:

◆ AddOccurrences2()

void CQueryNode::AddOccurrences2	(	const CQueryNode &	FromNode1,
		int	start1,
		int	end1,
		const CQueryNode &	FromNode2,
		int	start2,
		int	end2
	)

appends occurrences from both FromNode1 and FromNode2, maintaining sort-order and respecting both m_bUseNodeIndices and m_bUseMatchIds

References AddOccurrences(), m_bUseMatchIds, m_bUseNodeIndices, m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by AddOccurrence(), CQueryNearNode::FindOccurrences2(), CQueryBinaryOperationNode::hits_and_positions_intersection(), and CQueryBinaryOperationNode::hits_and_positions_union().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ AddOccurrences3()

void CQueryNode::AddOccurrences3	(	const CQueryNode &	FromNode1,
		int	start1,
		int	end1,
		const CQueryNode &	FromNode2,
		int	start2,
		int	end2,
		const CQueryNode &	FromNode3,
		int	start3,
		int	end3
	)

appends occurrences from FromNode1, FromNode2, and FromNode3 maintaining sort-order and respecting both m_bUseNodeIndices and m_bUseMatchIds

References AddOccurrences(), m_bUseMatchIds, m_bUseNodeIndices, m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by AddOccurrence(), and CQueryNearNode::FindOccurrences3().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ ClearAndReserveOccurrences()

void CQueryNode::ClearAndReserveOccurrences ( int size )

clears m_Occurrences[] and reserves at least size elements. Also clears and reserves m_OccurrenceNodeIndices[], m_OccurrenceMatchids[] just in case m_bUseNodeIndices rsp. m_bUseMatchIds is true.

References m_bUseMatchIds, m_bUseNodeIndices, m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by AddOccurrence(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryTokenNode::EvaluateWithoutHits(), CQuerySequenceNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CQueryNearNode::FindOccurrences2(), CQueryNearNode::FindOccurrences3(), CQueryBinaryOperationNode::hits_and_positions_assign(), CQueryBinaryOperationNode::hits_and_positions_difference(), CQueryBinaryOperationNode::hits_and_positions_intersection(), and CQueryBinaryOperationNode::hits_and_positions_union().

Here is the caller graph for this function:

◆ SwapOccurrences()

void CQueryNode::SwapOccurrences	(	CQueryNode &	Node,
		bool	swapChunkLengths = `false`
	)

swaps m_Occurrences[], m_OccurrenceNodeIndices[], and m_OccurrenceMatchIds[] between caller object and Node

References m_ChunkLengths, m_OccurrenceMatchIds, m_OccurrenceNodeIndices, and m_Occurrences.

Referenced by AddOccurrence(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryWithNode::EvaluateWithoutHits(), and CQueryBinaryOperationNode::hits_and_positions_swap().

Here is the caller graph for this function:

◆ ConvertOccurrencesToHits()

void CQueryNode::ConvertOccurrencesToHits ( bool bSeparateHits )

convert occurrences to hits using m_pHolder->GetBreaks()

References AddOccurrences(), ddcVecFile< T >::begin(), ClearAndReserveOccurrences(), DDC_GETBREAK_BINSEARCH_COEF, ddcVecFile< T >::end(), CConcSession::GetBreaks(), GetOccurrencesSize, CConcSession::GetTextArea(), CBiblIndex::GetTextAreasCount(), log2u32(), CConcordance::m_BiblIndex, m_bUseMatchIds, m_bUseNodeIndices, CHit::m_HighlightOccurrenceEnd, m_Hits, m_Occurrences, CConcSession::m_pConcordance, m_pHolder, SwapOccurrences(), UnknownTextAreaNo, and VectorStride().

Referenced by AddOccurrence(), CQueryTokenNode::Evaluate(), and CQueryWithNode::Evaluate().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ ConvertOccurrencesToHitsForPatterns()

void CQueryNode::ConvertOccurrencesToHitsForPatterns ( bool bSeparateHits )

convert occurrences to hits for pattern query construction (like "mother likes father")

References AddOccurrences(), ddcVecFile< T >::begin(), ClearAndReserveOccurrences(), ddcVecFile< T >::end(), CConcSession::GetBreaks(), GetOccurrencesSize, CConcSession::GetTextArea(), CBiblIndex::GetTextAreasCount(), CConcordance::m_BiblIndex, m_bUseMatchIds, m_bUseNodeIndices, m_ChunkLengths, CHit::m_HighlightOccurrenceEnd, m_Hits, m_Occurrences, CConcSession::m_pConcordance, m_pHolder, ddcVecFile< T >::size(), SwapOccurrences(), and UnknownTextAreaNo.

Referenced by AddOccurrence(), CQueryTokenNode::Evaluate(), CQuerySequenceNode::Evaluate(), CQueryNearNode::Evaluate(), and CConcSession::GetOccurrences().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ EnsureChunkOffsets()

void CQueryNode::EnsureChunkOffsets ( )

ensure m_ChunkOffsets[] is populated

References m_ChunkLengths, and m_ChunkOffsets.

Referenced by AddOccurrence().

Here is the caller graph for this function:

◆ SetHolder()

void CQueryNode::SetHolder ( const CConcHolder * pHolder )

set m_pHolder dependent properties m_bUseNodeIndices, m_bUseMatchIds

References CConcSession::HasMatchIdOperator(), CConcSession::HasRankOrderOperator(), m_bUseMatchIds, m_bUseNodeIndices, and m_pHolder.

Referenced by AddOccurrence(), CQueryBinaryOperationNode::Create(), CQuerySequenceNode::Create(), CQueryNearNode::Create(), CQueryTokenNode::CreateAnchorPattern(), CQueryTokenNode::CreateChunkPattern(), CQueryTokenNode::CreateLemmaPattern(), CQueryTokenNode::CreateMorphAnnotationPattern(), CQueryTokenNode::CreateThesPattern(), CQueryTokenNode::CreateUniversalPattern(), and CQueryTokenNode::GetIndex().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ IsUniversalWildcard()

bool CQueryNode::IsUniversalWildcard ( ) const

virtual

return true iff this is a universal wildcard query (*); default returns false

Reimplemented in CQueryTokenNode.

Referenced by AddOccurrence(), CQuerySequenceNode::EvaluateWithoutHits(), CQueryNearNode::FindOccurrences2(), and CQueryNearNode::FindOccurrences3().

Here is the caller graph for this function:

◆ GetNodeFrequencyByNodeIndex()

size_t CQueryNode::GetNodeFrequencyByNodeIndex ( size_t NodeIndex ) const

virtual

get occurrence count by query-node index; used by rank-sort operator. default implementation in CQueryNode just chokes.

Reimplemented in CQueryNearNode, CQuerySequenceNode, CQueryTokenNode, and CQueryBinaryOperationNode.

Referenced by AddOccurrence(), CQueryNearNode::GetNodeFrequencyByNodeIndex(), CConcSession::InitSortByRank(), and CQueryBinaryOperationNode::pushHit().

Here is the caller graph for this function:

◆ HitOccurrencesBegin()

DWORD CQueryNode::HitOccurrencesBegin ( DWORD HitNo ) const

inline

get the index of the first occurrence in m_Occurrences[] for hit number HitNo

Referenced by GetFirstOccurrenceInHit(), GetLastOccurrenceInHit(), and GetMiddleOccurrenceInHit().

Here is the caller graph for this function:

◆ HitOccurrencesEnd()

DWORD CQueryNode::HitOccurrencesEnd ( DWORD HitNo ) const

inline

get the index of the first occurrence in m_Occurrences[] after hit number HitNo

References GetFirstOccurrenceInHit(), GetLastOccurrenceInHit(), and GetMiddleOccurrenceInHit().

Referenced by GetFirstOccurrenceInHit(), GetLastOccurrenceInHit(), and GetMiddleOccurrenceInHit().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetFirstOccurrenceInHit()

DWORD CQueryNode::GetFirstOccurrenceInHit	(	DWORD	HitNo,
		BYTE	MatchId
	)		const

scan for first occurrence of match-id MatchId for hit HitNo in m_OccurrenceMatchIds[]; only valid if m_bUseMatchIds is true

Returns: least occurence-index i such that: occurrence i belongs to Hits[HitNo] and as match-id MatchId, or (DOWRD)-1 if none exists

References HitOccurrencesBegin(), HitOccurrencesEnd(), and m_OccurrenceMatchIds.

Referenced by HitOccurrencesEnd(), and CConcSession::InitSortByContext().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetLastOccurrenceInHit()

DWORD CQueryNode::GetLastOccurrenceInHit	(	DWORD	HitNo,
		BYTE	MatchId
	)		const

scan for last occurrence of match-id MatchId for hit HitNo in m_OccurrenceMatchIds[]; only valid if m_bUseMatchIds is true

Returns: greatest occurence-index i such that: occurrence i belongs to Hits[HitNo] and as match-id MatchId, or (DWORD)-1 if none exists

References HitOccurrencesBegin(), HitOccurrencesEnd(), and m_OccurrenceMatchIds.

Referenced by HitOccurrencesEnd(), and CConcSession::InitSortByContext().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetMiddleOccurrenceInHit()

DWORD CQueryNode::GetMiddleOccurrenceInHit	(	DWORD	HitNo,
		BYTE	MatchId
	)		const

scan for middle-most occurrence of match-id MatchId for hit HitNo in m_OccurrenceMatchIds[]; only valid if m_bUseMatchIds is true

Returns: middle-most occurence-index i such that: occurrence i belongs to Hits[HitNo] and as match-id MatchId, or (DWORD)-1 if none exists

References HitOccurrencesBegin(), HitOccurrencesEnd(), and m_OccurrenceMatchIds.

Referenced by HitOccurrencesEnd(), and CConcSession::InitSortByContext().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ BreakStride()

DWORD CQueryNode::BreakStride ( ) const

inline

get average size of gap between breaks in m_Hits[]; returned value is always >= 1

Member Data Documentation

◆ m_bAtomic

bool CQueryNode::m_bAtomic

true if this node is a description of one token or a sequence of adjacent tokens

Referenced by CQuerySequenceNode::CQuerySequenceNode(), CQueryTokenNode::CQueryTokenNode(), CQueryWithNode::CQueryWithNode(), CQueryNearNode::Create(), CQueryTokenNode::CreateAnchorPattern(), CQueryTokenNode::CreateChunkPattern(), and CQueryTokenNode::CreateUniversalPattern().

◆ m_bNegated

bool CQueryNode::m_bNegated

is the node negated?

Referenced by GetNegation(), and SetNegation().

◆ m_Source

string CQueryNode::m_Source

the string from which this node was created

◆ m_Occurrences

vector<CTokenNo> CQueryNode::m_Occurrences

all occurrences of this node in the current subcorpus, which should be highlighted

Referenced by AddOccurrence(), AddOccurrences(), AddOccurrences2(), AddOccurrences3(), CQOccurrenceIterator::assign(), CQOccurrenceIterator::bind(), CQTokenOccurrenceIterator::bind(), ClearAndReserveOccurrences(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryTokenNode::EvaluateWithoutHits(), CQuerySequenceNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CConcSession::GetAllHits(), CQueryTokenNode::GetNodeFrequencyByNodeIndex(), CConcSession::GetOccurrences(), CQueryBinaryOperationNode::hits_and_positions_assign(), CConcSession::InitSortByContext(), CConcSession::InitSortByRank(), CQOccurrenceIterator::operator==(), CQTokenOccurrenceIterator::operator==(), CQueryBinaryOperationNode::pushHit(), SwapOccurrences(), CQOccurrenceIterator::tmax(), CQOccurrenceIterator::tmax_prev(), CQOccurrenceIterator::tmin(), CQOccurrenceIterator::tocc(), and ~CQueryNode().

◆ m_bUseNodeIndices

bool CQueryNode::m_bUseNodeIndices

should DDC uses m_OccurrenceNodeIndices (m_OccurrenceNodeIndices is necessary only for #less_by_rank)

Referenced by AddOccurrences(), AddOccurrences2(), AddOccurrences3(), ClearAndReserveOccurrences(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryTokenNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), and SetHolder().

◆ m_OccurrenceNodeIndices

vector<BYTE> CQueryNode::m_OccurrenceNodeIndices

query node indices for each occurrence (the origin for each occurrence)

Referenced by AddOccurrence(), AddOccurrences(), AddOccurrences2(), AddOccurrences3(), ClearAndReserveOccurrences(), CQueryTokenNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CConcSession::InitSortByRank(), SwapOccurrences(), and ~CQueryNode().

◆ m_bUseMatchIds

bool CQueryNode::m_bUseMatchIds

should DDC use m_OccurrenceMatchIds to track match-ids?

Referenced by AddOccurrences(), AddOccurrences2(), AddOccurrences3(), ClearAndReserveOccurrences(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryTokenNode::CQueryTokenNode(), CQueryTokenNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CConcSession::GetAllHits(), CConcSession::InitSortByContext(), SetHolder(), and CQueryTokenNode::SetMatchId().

◆ m_OccurrenceMatchIds

vector<BYTE> CQueryNode::m_OccurrenceMatchIds

match-ids for each occurrence in m_Occurrences (only if m_bUseMatchIds is true)

Referenced by AddOccurrence(), AddOccurrences(), AddOccurrences2(), AddOccurrences3(), ClearAndReserveOccurrences(), CQueryTokenNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CConcSession::GetAllHits(), GetFirstOccurrenceInHit(), GetLastOccurrenceInHit(), GetMiddleOccurrenceInHit(), CConcSession::InitSortByContext(), SwapOccurrences(), and ~CQueryNode().

◆ m_Hits

vector<CHit> CQueryNode::m_Hits

all hits of this node in the current subcorpora

Referenced by ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CConcSession::GetAllHits(), CConcSession::GetOccurrences(), CQueryBinaryOperationNode::hits_add(), CQueryBinaryOperationNode::hits_and_positions_assign(), CQueryBinaryOperationNode::hits_and_positions_difference(), CQueryBinaryOperationNode::hits_and_positions_intersection(), CQueryBinaryOperationNode::hits_and_positions_swap(), CQueryBinaryOperationNode::hits_and_positions_union(), CConcSession::InitSortByContext(), CConcSession::InitSortByRandom(), CConcSession::InitSortByRank(), CConcSession::InitSortBySize(), CConcSession::InitSortKeyForHits(), CQFPrune::PruneHitsIndex(), and CQueryBinaryOperationNode::pushHit().

◆ m_pHolder

const CConcHolder* CQueryNode::m_pHolder

a reference to the parent holder (moo: should be unused until evaluation time, but isn't!)

Referenced by CQueryTokenNode::BuildRegExp(), ConvertOccurrencesToHits(), ConvertOccurrencesToHitsForPatterns(), CQueryTokenNode::EvaluateWithoutHits(), and SetHolder().

◆ m_ChunkLengths

vector<DWORD> CQueryNode::m_ChunkLengths

the division of m_Occurrences by chunks , so m_ChunkLengths[0]+m_ChunkLengths[1]... = m_Occurrences.size() ; used by near() queries.

Referenced by CQOccurrenceIterator::chunksize(), ConvertOccurrencesToHitsForPatterns(), EnsureChunkOffsets(), CQueryTokenNode::EvaluateWithoutHits(), CQuerySequenceNode::EvaluateWithoutHits(), CQueryWithNode::EvaluateWithoutHits(), CQueryWithoutNode::EvaluateWithoutHits(), CQueryWithorNode::EvaluateWithoutHits(), CQueryNearNode::FindOccurrences2(), CQueryNearNode::FindOccurrences3(), CConcSession::GetOccurrences(), CQOccurrenceIterator::operator++(), SwapOccurrences(), and CQOccurrenceIterator::tmax().

◆ m_ChunkOffsets

vector<DWORD> CQueryNode::m_ChunkOffsets

chunk offsets, used by CQuerySequenceNode queries; use EnsureChunkOffsets() to populate if required

introduced in v2.1.19; still unused (should probably be used to allow binary-search seek for NEAR queries

Referenced by EnsureChunkOffsets().

◆ m_CacheIds

vector<int> CQueryNode::m_CacheIds

???

Referenced by CQueryTokenNode::EvaluateWithoutHits().

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

Public Member Functions

Public Attributes

Detailed Description

Constructor & Destructor Documentation

◆ CQueryNode()

◆ ~CQueryNode()

Member Function Documentation

◆ Evaluate()

◆ EvaluateWithoutHits()

◆ SetNegation()

◆ GetNegation()

◆ AddOccurrence()

◆ AddOccurrences()

◆ AddOccurrences2()

◆ AddOccurrences3()

◆ ClearAndReserveOccurrences()

◆ SwapOccurrences()

◆ ConvertOccurrencesToHits()

◆ ConvertOccurrencesToHitsForPatterns()

◆ EnsureChunkOffsets()

◆ SetHolder()

◆ IsUniversalWildcard()

◆ GetNodeFrequencyByNodeIndex()

◆ HitOccurrencesBegin()

◆ HitOccurrencesEnd()

◆ GetFirstOccurrenceInHit()

◆ GetLastOccurrenceInHit()

◆ GetMiddleOccurrenceInHit()

◆ BreakStride()

Member Data Documentation

◆ m_bAtomic

◆ m_bNegated

◆ m_Source

◆ m_Occurrences

◆ m_bUseNodeIndices

◆ m_OccurrenceNodeIndices

◆ m_bUseMatchIds

◆ m_OccurrenceMatchIds

◆ m_Hits

◆ m_pHolder

◆ m_ChunkLengths

◆ m_ChunkOffsets

◆ m_CacheIds