mirror of
https://github.com/KingDuckZ/dindexer.git
synced 2025-02-23 12:54:56 +00:00
99 lines
3.1 KiB
Text
99 lines
3.1 KiB
Text
|
/* Copyright 2015, 2016, Michele Santullo
|
||
|
|
* This file is part of "dindexer".
|
||
|
|
*
|
||
|
|
* "dindexer" is free software: you can redistribute it and/or modify
|
||
|
|
* it under the terms of the GNU General Public License as published by
|
||
|
|
* the Free Software Foundation, either version 3 of the License, or
|
||
|
|
* (at your option) any later version.
|
||
|
|
*
|
||
|
|
* "dindexer" 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 "dindexer". If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "command.hpp"
|
||
|
|
#include <cassert>
|
||
|
|
#include <ciso646>
|
||
|
|
|
||
|
|
namespace redis {
|
||
|
|
namespace implem {
|
||
|
|
} //namespace implem
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
ScanIterator<V, ValueFetch>::ScanIterator (Command* parCommand, bool parEnd) :
|
||
|
|
implem::ScanIteratorBaseClass(parCommand),
|
||
|
|
m_reply(),
|
||
|
|
m_scan_context(0),
|
||
|
|
m_curr_index(0)
|
||
|
|
{
|
||
|
|
if (not parEnd)
|
||
|
|
this->increment();
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
void ScanIterator<V, ValueFetch>::increment() {
|
||
|
|
static_assert(ValueFetch::step > 0, "Can't have an increase step of 0");
|
||
|
|
if (m_curr_index + ValueFetch::step < m_reply.size()) {
|
||
|
|
m_curr_index += ValueFetch::step;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
std::vector<RedisReplyType> array_reply;
|
||
|
|
long long new_context;
|
||
|
|
|
||
|
|
do {
|
||
|
|
auto whole_reply = this->forward_scan_command<ValueFetch>(0);
|
||
|
|
|
||
|
|
array_reply = get_array(whole_reply);
|
||
|
|
assert(2 == array_reply.size());
|
||
|
|
assert(array_reply.size() % ValueFetch::step == 0);
|
||
|
|
new_context = get_integer(array_reply[0]);
|
||
|
|
} while (new_context and array_reply.empty());
|
||
|
|
|
||
|
|
m_reply = get_array(array_reply[1]);
|
||
|
|
m_scan_context = new_context;
|
||
|
|
m_curr_index = 0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
bool ScanIterator<V, ValueFetch>::equal (const ScanIterator& parOther) const {
|
||
|
|
return
|
||
|
|
(&parOther == this) or
|
||
|
|
(
|
||
|
|
implem::ScanIteratorBaseClass::is_equal(parOther) and
|
||
|
|
(m_scan_context == parOther.m_scan_context)
|
||
|
|
);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
const V& ScanIterator<V, ValueFetch>::dereference() const {
|
||
|
|
assert(m_scan_context);
|
||
|
|
assert(not m_reply.empty());
|
||
|
|
assert(m_curr_index < m_reply.size());
|
||
|
|
|
||
|
|
return ValueFetch::make_value(m_reply.data() + m_curr_index);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
template <typename T>
|
||
|
|
RedisReplyType ScanIterator<V, ValueFetch>::forward_scan_command (typename std::enable_if<HasScanTargetMethod<T>::value, int>::type) {
|
||
|
|
return implem::ScanIteratorBaseClass::run(T::command(), T::scan_target(), m_scan_context);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename V, typename ValueFetch>
|
||
|
|
template <typename T>
|
||
|
|
RedisReplyType ScanIterator<V, ValueFetch>::forward_scan_command (typename std::enable_if<not HasScanTargetMethod<T>::value, int>::type) {
|
||
|
|
return implem::ScanIteratorBaseClass::run(T::command(), m_scan_context);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename T>
|
||
|
|
const T& ScanSingleValues<T>::make_value (const RedisReplyType* parItem) {
|
||
|
|
assert(parItem);
|
||
|
|
return get<T>(*parItem);
|
||
|
|
}
|
||
|
|
} //namespace redis
|