1
0
Fork 0
arangodb/arangod/Aql/Quantifier.h

53 lines
1.7 KiB
C++

////////////////////////////////////////////////////////////////////////////////
/// DISCLAIMER
///
/// Copyright 2014-2016 ArangoDB GmbH, Cologne, Germany
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except in compliance with the License.
/// You may obtain a copy of the License at
///
/// http://www.apache.org/licenses/LICENSE-2.0
///
/// Unless required by applicable law or agreed to in writing, software
/// distributed under the License is distributed on an "AS IS" BASIS,
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
/// See the License for the specific language governing permissions and
/// limitations under the License.
///
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
///
/// @author Jan Steemann
////////////////////////////////////////////////////////////////////////////////
#ifndef ARANGOD_AQL_QUANTIFIER_H
#define ARANGOD_AQL_QUANTIFIER_H 1
#include "Basics/Common.h"
namespace arangodb {
namespace aql {
struct AstNode;
struct Quantifier {
static int64_t const NONE;
static int64_t const ALL;
static int64_t const ANY;
/// @brief converts a quantifier string into an int equivalent
static int64_t FromString(std::string const& value);
/// @brief converts a quantifier int value into its string equivalent
static std::string Stringify(int64_t value);
static bool IsAllOrNone(AstNode const* quantifier);
/// @brief determine the min/max number of matches for an array comparison
static std::pair<size_t, size_t> RequiredMatches(size_t inputSize, AstNode const* quantifier);
};
} // namespace aql
} // namespace arangodb
#endif