85 lines
3.1 KiB
C++
85 lines
3.1 KiB
C++
// Copyright 2022 Memgraph Ltd.
|
|
//
|
|
// Use of this software is governed by the Business Source License
|
|
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
|
|
// License, and you may not use this file except in compliance with the Business Source License.
|
|
//
|
|
// As of the Change Date specified in that file, in accordance with
|
|
// the Business Source License, use of this software will be governed
|
|
// by the Apache License, Version 2.0, included in the file
|
|
// licenses/APL.txt.
|
|
|
|
/// @file
|
|
#pragma once
|
|
|
|
#include <concepts>
|
|
#include <cstdint>
|
|
#include <string>
|
|
#include <string_view>
|
|
#include <type_traits>
|
|
|
|
#include "query/v2/bindings/symbol.hpp"
|
|
#include "query/v2/bindings/typed_value.hpp"
|
|
#include "query/v2/exceptions.hpp"
|
|
#include "query/v2/frontend/ast/ast.hpp"
|
|
#include "query/v2/path.hpp"
|
|
#include "storage/v3/conversions.hpp"
|
|
#include "storage/v3/id_types.hpp"
|
|
#include "storage/v3/property_value.hpp"
|
|
#include "storage/v3/result.hpp"
|
|
#include "storage/v3/view.hpp"
|
|
#include "utils/exceptions.hpp"
|
|
#include "utils/logging.hpp"
|
|
#include "utils/variant_helpers.hpp"
|
|
|
|
namespace memgraph::query::v2 {
|
|
|
|
namespace impl {
|
|
bool TypedValueCompare(const TypedValue &a, const TypedValue &b);
|
|
} // namespace impl
|
|
|
|
/// Custom Comparator type for comparing vectors of TypedValues.
|
|
///
|
|
/// Does lexicographical ordering of elements based on the above
|
|
/// defined TypedValueCompare, and also accepts a vector of Orderings
|
|
/// the define how respective elements compare.
|
|
class TypedValueVectorCompare final {
|
|
public:
|
|
TypedValueVectorCompare() {}
|
|
explicit TypedValueVectorCompare(const std::vector<Ordering> &ordering) : ordering_(ordering) {}
|
|
|
|
template <class TAllocator>
|
|
bool operator()(const std::vector<TypedValue, TAllocator> &c1, const std::vector<TypedValue, TAllocator> &c2) const {
|
|
// ordering is invalid if there are more elements in the collections
|
|
// then there are in the ordering_ vector
|
|
MG_ASSERT(c1.size() <= ordering_.size() && c2.size() <= ordering_.size(),
|
|
"Collections contain more elements then there are orderings");
|
|
|
|
auto c1_it = c1.begin();
|
|
auto c2_it = c2.begin();
|
|
auto ordering_it = ordering_.begin();
|
|
for (; c1_it != c1.end() && c2_it != c2.end(); c1_it++, c2_it++, ordering_it++) {
|
|
if (impl::TypedValueCompare(*c1_it, *c2_it)) return *ordering_it == Ordering::ASC;
|
|
if (impl::TypedValueCompare(*c2_it, *c1_it)) return *ordering_it == Ordering::DESC;
|
|
}
|
|
|
|
// at least one collection is exhausted
|
|
// c1 is less then c2 iff c1 reached the end but c2 didn't
|
|
return (c1_it == c1.end()) && (c2_it != c2.end());
|
|
}
|
|
|
|
// TODO: Remove this, member is public
|
|
const auto &ordering() const { return ordering_; }
|
|
|
|
std::vector<Ordering> ordering_;
|
|
};
|
|
|
|
/// Raise QueryRuntimeException if the value for symbol isn't of expected type.
|
|
inline void ExpectType(const Symbol &symbol, const TypedValue &value, TypedValue::Type expected) {
|
|
if (value.type() != expected)
|
|
throw QueryRuntimeException("Expected a {} for '{}', but got {}.", expected, symbol.name(), value.type());
|
|
}
|
|
|
|
int64_t QueryTimestamp();
|
|
} // namespace memgraph::query::v2
|