#ifndef SCANN_UTILS_INFINITE_ONE_ARRAY_H_
#define SCANN_UTILS_INFINITE_ONE_ARRAY_H_
#include "scann/utils/types.h"
namespace research_scann {
template <typename T>
class InfiniteOneIterator {
public:
T operator*() const { return T(1); }
T operator[](size_t i) const { return T(1); }
void operator++() {}
void operator++(int dummy) {}
InfiniteOneIterator operator+=(size_t i) { return *this; }
InfiniteOneIterator operator-=(size_t i) { return *this; }
bool operator<(const InfiniteOneIterator<T>& x) const { return true; }
};
template <typename T>
class InfiniteOneArray {
public:
InfiniteOneArray() {}
size_t size() const { return numeric_limits<size_t>::max(); }
bool empty() const { return false; }
T operator[](size_t i) const { return T(1); }
T front() const { return T(1); }
T back() const { return T(1); }
InfiniteOneIterator<T> begin() { return InfiniteOneIterator<T>(); }
InfiniteOneIterator<T> end() { return InfiniteOneIterator<T>(); }
InfiniteOneArray data() const { return *this; }
};
template <typename T>
class InfiniteOneMatrix {
public:
InfiniteOneMatrix() {}
size_t size() const { return numeric_limits<size_t>::max(); }
bool empty() const { return false; }
InfiniteOneArray<T> operator[](size_t i) const {
return InfiniteOneArray<T>();
}
InfiniteOneArray<T> front() const { return InfiniteOneArray<T>(); }
InfiniteOneArray<T> back() const { return InfiniteOneArray<T>(); }
};
}
#endif