/*
* Copyright (C) 2015-present ScyllaDB
*/
/*
* This file is part of Scylla.
*
* Scylla is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Scylla 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
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Scylla. If not, see .
*/
#pragma once
#include
#include "types.hh"
#include "schema.hh"
#include
#include
class mutation;
namespace query {
class result;
class no_value : public std::runtime_error {
public:
using runtime_error::runtime_error;
};
class non_null_data_value {
data_value _v;
public:
explicit non_null_data_value(data_value&& v);
operator const data_value&() const {
return _v;
}
};
inline bool operator==(const non_null_data_value& x, const non_null_data_value& y) {
return static_cast(x) == static_cast(y);
}
// Result set row is a set of cells that are associated with a row
// including regular column cells, partition keys, as well as static values.
class result_set_row {
schema_ptr _schema;
const std::unordered_map _cells;
public:
result_set_row(schema_ptr schema, std::unordered_map&& cells)
: _schema{schema}
, _cells{std::move(cells)}
{ }
// Look up a deserialized row cell value by column name
const data_value*
get_data_value(const sstring& column_name) const {
auto it = _cells.find(column_name);
if (it == _cells.end()) {
return nullptr;
}
return &static_cast(it->second);
}
// Look up a deserialized row cell value by column name
template
std::optional
get(const sstring& column_name) const {
if (const auto *value = get_ptr(column_name)) {
return std::optional(*value);
}
return std::nullopt;
}
template
const T*
get_ptr(const sstring& column_name) const {
const auto *value = get_data_value(column_name);
if (value == nullptr) {
return nullptr;
}
return &value_cast(*value);
}
// throws no_value on error
template
const T& get_nonnull(const sstring& column_name) const {
auto v = get_ptr>(column_name);
if (v) {
return *v;
}
throw no_value(column_name);
}
const std::unordered_map& cells() const { return _cells; }
friend inline bool operator==(const result_set_row& x, const result_set_row& y);
friend inline bool operator!=(const result_set_row& x, const result_set_row& y);
friend std::ostream& operator<<(std::ostream& out, const result_set_row& row);
};
inline bool operator==(const result_set_row& x, const result_set_row& y) {
return x._schema == y._schema && x._cells == y._cells;
}
inline bool operator!=(const result_set_row& x, const result_set_row& y) {
return !(x == y);
}
// Result set is an in-memory representation of query results in
// deserialized format. To obtain a result set, use the result_set_builder
// class as a visitor to query_result::consume() function.
class result_set {
schema_ptr _schema;
std::vector _rows;
public:
static result_set from_raw_result(schema_ptr, const partition_slice&, const result&);
result_set(schema_ptr s, std::vector&& rows)
: _schema(std::move(s)), _rows{std::move(rows)}
{ }
explicit result_set(const mutation&);
bool empty() const {
return _rows.empty();
}
// throws std::out_of_range on error
const result_set_row& row(size_t idx) const {
if (idx >= _rows.size()) {
throw std::out_of_range("no such row in result set: " + std::to_string(idx));
}
return _rows[idx];
}
const std::vector& rows() const {
return _rows;
}
const schema_ptr& schema() const {
return _schema;
}
friend inline bool operator==(const result_set& x, const result_set& y);
friend std::ostream& operator<<(std::ostream& out, const result_set& rs);
};
inline bool operator==(const result_set& x, const result_set& y) {
return x._rows == y._rows;
}
}