1 files changed, 155 insertions, 0 deletions
diff --git a/searchlib/src/tests/queryeval/blueprint/mysearch.h b/searchlib/src/tests/queryeval/blueprint/mysearch.h
new file mode 100644
index 00000000000..7ab852b384f
--- /dev/null
+++ b/searchlib/src/tests/queryeval/blueprint/mysearch.h
@@ -0,0 +1,155 @@
+// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
+#include <vespa/searchlib/queryeval/blueprint.h>
+#include <vespa/vespalib/objects/visit.h>
+
+namespace search {
+namespace queryeval {
+
+//-----------------------------------------------------------------------------
+
+class MySearch : public SearchIterator
+{
+public:
+    typedef MultiSearch::Children      Children;
+    typedef std::vector<SearchIterator::UP>      MyChildren;
+    typedef search::fef::TermFieldMatchDataArray TFMDA;
+    typedef search::fef::MatchData               MatchData;
+
+private:
+    std::string _tag;
+    bool        _isLeaf;
+    bool        _isStrict;
+    MyChildren  _children;
+    TFMDA       _match;
+    MatchData  *_md;
+
+    std::vector<uint32_t> _handles;
+
+protected:
+    virtual void doSeek(uint32_t) {}
+    virtual void doUnpack(uint32_t) {}
+
+public:
+    MySearch(const std::string &tag, bool leaf, bool strict)
+        : _tag(tag), _isLeaf(leaf), _isStrict(strict), _children(),
+          _match(), _md(0) {}
+
+    MySearch(const std::string &tag, const TFMDA &tfmda, bool strict)
+        : _tag(tag), _isLeaf(true), _isStrict(strict), _children(),
+          _match(tfmda), _md(0) {}
+
+    MySearch(const std::string &tag, const Children &children,
+             MatchData *md, bool strict)
+        : _tag(tag), _isLeaf(false), _isStrict(strict), _children(),
+          _match(), _md(md) {
+        for (size_t i(0); i < children.size(); i++) {
+            _children.emplace_back(children[i]);
+        }
+    }
+
+    MySearch &add(SearchIterator *search) {
+        _children.emplace_back(search);
+        return *this;
+    }
+
+    MySearch &addHandle(uint32_t handle) {
+        _handles.push_back(handle);
+        return *this;
+    }
+
+    bool verifyAndInferImpl(MatchData &md) {
+        bool ok = true;
+        if (!_isLeaf) {
+            ok &= (_md == &md);
+        }
+        for (size_t i = 0; i < _children.size(); ++i) {
+            MySearch *child = dynamic_cast<MySearch *>(_children[i].get());
+            ok &= (child != 0);
+            if (child != 0) {
+                ok &= child->verifyAndInferImpl(md);
+            }
+        }
+        for (size_t i = 0; i < _match.size(); ++i) {
+            search::fef::TermFieldMatchData *tfmd = _match[i];
+            _handles.push_back(search::fef::IllegalHandle);
+            for (search::fef::TermFieldHandle j = 0; j < md.getNumTermFields(); ++j) {
+                if (md.resolveTermField(j) == tfmd) {
+                    _handles.back() = j;
+                    break;
+                }
+            }
+            ok &= (_handles.back() != search::fef::IllegalHandle);
+        }
+        return ok;
+    }
+
+    static bool verifyAndInfer(SearchIterator *search, MatchData &md) {
+        MySearch *self = dynamic_cast<MySearch *>(search);
+        if (self == 0) {
+            return false;
+        } else {
+            return self->verifyAndInferImpl(md);
+        }
+    }
+
+    virtual void visitMembers(vespalib::ObjectVisitor &visitor) const {
+        visit(visitor, "_tag",      _tag);
+        visit(visitor, "_isLeaf",   _isLeaf);
+        visit(visitor, "_isStrict", _isStrict);
+        visit(visitor, "_children", _children);
+        visit(visitor, "_handles",  _handles);
+    }
+
+    virtual ~MySearch() {}
+};
+
+//-----------------------------------------------------------------------------
+
+class MyLeaf : public SimpleLeafBlueprint
+{
+    typedef search::fef::TermFieldMatchDataArray TFMDA;
+
+public:
+    virtual SearchIterator::UP
+    createLeafSearch(const TFMDA &tfmda, bool strict) const
+    {
+        return SearchIterator::UP(new MySearch("leaf", tfmda, strict));
+    }
+
+    MyLeaf(const FieldSpecBaseList &fields)
+        : SimpleLeafBlueprint(fields)
+    {}
+
+    MyLeaf &estimate(uint32_t hits, bool empty = false) {
+        setEstimate(HitEstimate(hits, empty));
+        return *this;
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+class MyLeafSpec
+{
+private:
+    FieldSpecBaseList      _fields;
+    Blueprint::HitEstimate _estimate;
+
+public:
+    explicit MyLeafSpec(uint32_t estHits, bool empty = false)
+        : _fields(), _estimate(estHits, empty) {}
+
+    MyLeafSpec &addField(uint32_t fieldId, uint32_t handle) {
+        _fields.add(FieldSpecBase(fieldId, handle));
+        return *this;
+    }
+    MyLeaf *create() const {
+        MyLeaf *leaf = new MyLeaf(_fields);
+        leaf->estimate(_estimate.estHits, _estimate.empty);
+        return leaf;
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+} // namespace queryeval
+} // namespace search