private QCandidates GetQCandidates(IQuery query)
{
QQueryBase.CreateCandidateCollectionResult result = ((QQuery)query).CreateCandidateCollection
();
((QQuery)query).CheckConstraintsEvaluationMode();
QCandidates candidates = (QCandidates)result.candidateCollection._element;
return(candidates);
}
public static QCandidate ToQCandidate(Db4objects.Db4o.Internal.TreeInt tree, QCandidates
candidates)
{
if (tree == null)
{
return(null);
}
return(tree.ToQCandidate(candidates));
}
public static QCandidate ToQCandidate(TreeInt tree, QCandidates
candidates)
{
if (tree == null)
{
return(null);
}
return(tree.ToQCandidate(candidates));
}
private QueryingReadContext(Transaction transaction, QCandidates candidates, int
handlerVersion, IReadBuffer buffer, int collectionID, IdObjectCollector collector
) : base(transaction, buffer)
{
_candidates = candidates;
_activationDepth = new LegacyActivationDepth(0);
_collectionID = collectionID;
_handlerVersion = handlerVersion;
_collector = collector;
}
internal virtual QCandidate ToQCandidate(QCandidates candidates)
{
var qc = new QCandidate(candidates, null, _key);
qc._preceding = ToQCandidate((TreeInt)_preceding
, candidates);
qc._subsequent = ToQCandidate((TreeInt)_subsequent, candidates);
qc._size = _size;
return(qc);
}
internal virtual QCandidate ToQCandidate(QCandidates candidates)
{
QCandidate qc = new QCandidate(candidates, null, _key);
qc._preceding = ToQCandidate((Db4objects.Db4o.Internal.TreeInt)((Tree)_preceding)
, candidates);
qc._subsequent = ToQCandidate((Db4objects.Db4o.Internal.TreeInt)((Tree)_subsequent
), candidates);
qc._size = _size;
return(qc);
}
public override void MarkAsBestIndex(QCandidates candidates)
{
_constraint.SetProcessedByIndex(candidates);
}
protected virtual FieldIndexProcessor CreateProcessor(IQuery query)
{
QCandidates candidates = GetQCandidates(query);
return(new FieldIndexProcessor(candidates));
}
private void CollectIndexedNodes(QCandidates candidates)
{
CollectIndexedNodes(candidates.IterateConstraints());
ImplicitlyAndJoinsOnSameField();
}
public IndexedNodeCollector(QCandidates candidates)
{
_nodes = new Collection4();
_nodeCache = new Hashtable4();
CollectIndexedNodes(candidates);
}
public virtual Tree ToQCandidate(QCandidates candidates)
{
return(TreeInt.ToQCandidate(ToTreeInt(), candidates));
}
internal override void EvaluateSimpleExec(QCandidates a_candidates)
{
a_candidates.Filter(this);
}
public FieldIndexProcessor(QCandidates candidates)
{
_candidates = candidates;
}
public abstract void MarkAsBestIndex(QCandidates arg1);
public virtual void MarkAsBestIndex(QCandidates candidates)
{
_leaf1.MarkAsBestIndex(candidates);
_constraint.SetProcessedByIndex(candidates);
}
public QueryingReadContext(Transaction transaction, QCandidates candidates, int handlerVersion
, IReadBuffer buffer, int collectionID) : this(transaction, candidates, handlerVersion
, buffer, collectionID, new IdObjectCollector())
{
}
internal override void EvaluateSimpleExec(QCandidates a_candidates)
{
a_candidates.Filter(this);
}
