/** * Copyright (C) 2018-present MongoDB, Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the Server Side Public License, version 1, * as published by MongoDB, Inc. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * Server Side Public License for more details. * * You should have received a copy of the Server Side Public License * along with this program. If not, see * . * * As a special exception, the copyright holders give permission to link the * code of portions of this program with the OpenSSL library under certain * conditions as described in each individual source file and distribute * linked combinations including the program with the OpenSSL library. You * must comply with the Server Side Public License in all respects for * all of the code used other than as permitted herein. If you modify file(s) * with this exception, you may extend this exception to your version of the * file(s), but you are not obligated to do so. If you do not wish to do so, * delete this exception statement from your version. If you delete this * exception statement from all source files in the program, then also delete * it in the license file. */ #pragma once #include #include "mongo/base/string_data.h" #include "mongo/db/matcher/expression.h" #include "mongo/db/matcher/expression_array.h" #include "mongo/db/matcher/expression_with_placeholder.h" namespace mongo { /** * A match expression similar to $elemMatch, but only matches arrays for which every element * matches the sub-expression. */ class InternalSchemaAllElemMatchFromIndexMatchExpression final : public ArrayMatchingMatchExpression { public: static constexpr StringData kName = "$_internalSchemaAllElemMatchFromIndex"_sd; InternalSchemaAllElemMatchFromIndexMatchExpression( StringData path, long long index, std::unique_ptr expression); std::unique_ptr shallowClone() const final; bool matchesArray(const BSONObj& array, MatchDetails* details) const final { auto iter = BSONObjIterator(array); for (int i = 0; iter.more() && i < _index; i++) { iter.next(); } while (iter.more()) { if (!_expression->matchesBSONElement(iter.next(), details)) { return false; } } return true; } void debugString(StringBuilder& debug, int indentationLevel) const final; BSONObj getSerializedRightHandSide() const final; bool equivalent(const MatchExpression* other) const final; boost::optional&> getChildVector() final { return boost::none; } size_t numChildren() const final { return 1; } MatchExpression* getChild(size_t i) const final { invariant(i == 0); return _expression->getFilter(); } void acceptVisitor(MatchExpressionMutableVisitor* visitor) final { visitor->visit(this); } void acceptVisitor(MatchExpressionConstVisitor* visitor) const final { visitor->visit(this); } private: ExpressionOptimizerFunc getOptimizer() const final; long long _index; std::unique_ptr _expression; }; } // namespace mongo