private bool CreateChildForDescendable(QCandidates parentCandidates, ITypeHandler4
handler, QueryingReadContext queryingReadContext, ITypeHandler4 arrayElementHandler
)
{
int offset = queryingReadContext.Offset();
bool outerRes = true;
// The following construct is worse than not ideal. For each constraint it completely reads the
// underlying structure again. The structure could be kept fairly easy. TODO: Optimize!
IEnumerator i = parentCandidates.IterateConstraints();
while (i.MoveNext())
{
QCon qcon = (QCon)i.Current;
QField qf = qcon.GetField();
if (qf != null && !qf.Name().Equals(_fieldMetadata.GetName()))
{
continue;
}
QCon tempParent = qcon.Parent();
qcon.SetParent(null);
QCandidates candidates = new QCandidates(parentCandidates.i_trans, null, qf, false
);
candidates.AddConstraint(qcon);
qcon.SetCandidates(candidates);
ReadArrayCandidates(handler, queryingReadContext.Buffer(), arrayElementHandler, candidates
);
queryingReadContext.Seek(offset);
bool isNot = qcon.IsNot();
if (isNot)
{
qcon.RemoveNot();
}
candidates.Evaluate();
ByRef pending = ByRef.NewInstance();
BooleanByRef innerRes = new BooleanByRef(isNot);
candidates.Traverse(new QCandidate.CreateDescendChildTraversingVisitor(pending, innerRes
, isNot));
if (isNot)
{
qcon.Not();
}
// In case we had pending subresults, we need to communicate them up to our root.
if (((Tree)pending.value) != null)
{
((Tree)pending.value).Traverse(new _IVisitor4_168(this));
}
if (!innerRes.value)
{
// Again this could be double triggering.
//
// We want to clean up the "No route" at some stage.
qcon.Visit(GetRoot(), qcon.Evaluator().Not(false));
outerRes = false;
}
qcon.SetParent(tempParent);
}
return(outerRes);
}
public object Apply(object current)
{
var id = ((int)current);
var candidate = new QCandidate(_enclosing, null, id);
_enclosing.i_root = candidate;
_enclosing.Evaluate();
if (!candidate.Include())
{
return(Iterators.Skip);
}
return(current);
}
internal virtual bool CreateChild(QCandidates a_candidates)
{
if (!_include)
{
return false;
}
if (_fieldMetadata != null)
{
var handler = _fieldMetadata.GetHandler();
if (handler != null)
{
var queryingReadContext = new QueryingReadContext(Transaction(),
MarshallerFamily().HandlerVersion(), _bytes, _key);
var arrayElementHandler = Handlers4.ArrayElementHandler(handler, queryingReadContext
);
if (arrayElementHandler != null)
{
var offset = queryingReadContext.Offset();
var outerRes = true;
// The following construct is worse than not ideal.
// For each constraint it completely reads the
// underlying structure again. The structure could b
// kept fairly easy. TODO: Optimize!
var i = a_candidates.IterateConstraints();
while (i.MoveNext())
{
var qcon = (QCon) i.Current;
var qf = qcon.GetField();
if (qf == null || qf.Name().Equals(_fieldMetadata.GetName()))
{
var tempParent = qcon.Parent();
qcon.SetParent(null);
var candidates = new QCandidates(a_candidates.i_trans, null, qf);
candidates.AddConstraint(qcon);
qcon.SetCandidates(candidates);
ReadArrayCandidates(handler, queryingReadContext.Buffer(), arrayElementHandler,
candidates
);
queryingReadContext.Seek(offset);
var isNot = qcon.IsNot();
if (isNot)
{
qcon.RemoveNot();
}
candidates.Evaluate();
var pending = ByRef.NewInstance();
bool[] innerRes = {isNot};
candidates.Traverse(new _IVisitor4_160(innerRes, isNot, pending));
// Collect all pending subresults.
// We need to change
// the
// constraint here, so
// our
// pending collector
// uses
// the right
// comparator.
// We only keep one
// pending result
// for
// all array
// elements.
// and memorize,
// whether we had a
// true or a false
// result.
// or both.
if (isNot)
{
qcon.Not();
}
// In case we had pending subresults, we
// need to communicate
// them up to our root.
if (((Tree) pending.value) != null)
{
((Tree) pending.value).Traverse(new _IVisitor4_229(this));
}
if (!innerRes[0])
{
// Again this could be double triggering.
//
// We want to clean up the "No route"
// at some stage.
qcon.Visit(GetRoot(), qcon.Evaluator().Not(false));
outerRes = false;
}
qcon.SetParent(tempParent);
}
}
return outerRes;
}
// We may get simple types here too, if the YapField was null
// in the higher level simple evaluation. Evaluate these
// immediately.
if (Handlers4.IsQueryLeaf(handler))
{
a_candidates.i_currentConstraint.Visit(this);
return true;
}
}
}
if (_fieldMetadata == null)
{
return false;
}
if (_fieldMetadata is NullFieldMetadata)
{
return false;
}
_classMetadata.SeekToField(Transaction(), _bytes, _fieldMetadata);
var candidate = ReadSubCandidate(
a_candidates);
if (candidate == null)
{
return false;
}
// fast early check for ClassMetadata
if (a_candidates.i_classMetadata != null && a_candidates.i_classMetadata.IsStronglyTyped
())
{
var handler = _fieldMetadata.GetHandler();
if (Handlers4.IsUntyped(handler))
{
handler = TypeHandlerFor(candidate);
}
if (handler == null)
{
return false;
}
}
AddDependant(a_candidates.Add(candidate));
return true;
}
internal virtual bool CreateChild(QCandidates a_candidates)
{
if (!_include)
{
return(false);
}
if (_fieldMetadata != null)
{
ITypeHandler4 handler = _fieldMetadata.GetHandler();
if (handler != null)
{
QueryingReadContext queryingReadContext = new QueryingReadContext(Transaction(),
MarshallerFamily().HandlerVersion(), _bytes, _key);
ITypeHandler4 arrayElementHandler = Handlers4.ArrayElementHandler(handler, queryingReadContext
);
if (arrayElementHandler != null)
{
int offset = queryingReadContext.Offset();
bool outerRes = true;
// The following construct is worse than not ideal.
// For each constraint it completely reads the
// underlying structure again. The structure could b
// kept fairly easy. TODO: Optimize!
IEnumerator i = a_candidates.IterateConstraints();
while (i.MoveNext())
{
QCon qcon = (QCon)i.Current;
QField qf = qcon.GetField();
if (qf == null || qf.Name().Equals(_fieldMetadata.GetName()))
{
QCon tempParent = qcon.Parent();
qcon.SetParent(null);
QCandidates candidates = new QCandidates(a_candidates.i_trans, null, qf);
candidates.AddConstraint(qcon);
qcon.SetCandidates(candidates);
ReadArrayCandidates(handler, queryingReadContext.Buffer(), arrayElementHandler, candidates
);
queryingReadContext.Seek(offset);
bool isNot = qcon.IsNot();
if (isNot)
{
qcon.RemoveNot();
}
candidates.Evaluate();
ByRef pending = ByRef.NewInstance();
bool[] innerRes = new bool[] { isNot };
candidates.Traverse(new _IVisitor4_160(innerRes, isNot, pending));
// Collect all pending subresults.
// We need to change
// the
// constraint here, so
// our
// pending collector
// uses
// the right
// comparator.
// We only keep one
// pending result
// for
// all array
// elements.
// and memorize,
// whether we had a
// true or a false
// result.
// or both.
if (isNot)
{
qcon.Not();
}
// In case we had pending subresults, we
// need to communicate
// them up to our root.
if (((Tree)pending.value) != null)
{
((Tree)pending.value).Traverse(new _IVisitor4_229(this));
}
if (!innerRes[0])
{
// Again this could be double triggering.
//
// We want to clean up the "No route"
// at some stage.
qcon.Visit(GetRoot(), qcon.Evaluator().Not(false));
outerRes = false;
}
qcon.SetParent(tempParent);
}
}
return(outerRes);
}
// We may get simple types here too, if the YapField was null
// in the higher level simple evaluation. Evaluate these
// immediately.
if (Handlers4.IsQueryLeaf(handler))
{
a_candidates.i_currentConstraint.Visit(this);
return(true);
}
}
}
if (_fieldMetadata == null)
{
return(false);
}
if (_fieldMetadata is NullFieldMetadata)
{
return(false);
}
_classMetadata.SeekToField(Transaction(), _bytes, _fieldMetadata);
Db4objects.Db4o.Internal.Query.Processor.QCandidate candidate = ReadSubCandidate(
a_candidates);
if (candidate == null)
{
return(false);
}
// fast early check for ClassMetadata
if (a_candidates.i_classMetadata != null && a_candidates.i_classMetadata.IsStronglyTyped
())
{
ITypeHandler4 handler = _fieldMetadata.GetHandler();
if (Handlers4.IsUntyped(handler))
{
handler = TypeHandlerFor(candidate);
}
if (handler == null)
{
return(false);
}
}
AddDependant(a_candidates.Add(candidate));
return(true);
}
