我正在尝试创建一个自定义容器和迭代器。
这是我到目前为止所拥有的:
std::array<int, 1000> global_data;
class TestVectorIterator
{
public:
TestVectorIterator()
: index(0)
{
}
TestVectorIterator(int index)
: index(index)
{
}
int& operator*()
{
return global_data[index];
}
const int& operator*() const
{
return global_data[index];
}
TestVectorIterator& operator++()
{
index++;
return *this;
}
TestVectorIterator& operator--()
{
index--;
return *this;
}
friend int operator- (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
return lhs.index - rhs.index;
}
friend int operator+ (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
return lhs.index + rhs.index;
}
friend bool operator== (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index == rhs.index;
}
return (*lhs) == (*rhs);
}
friend bool operator!= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index != rhs.index;
}
return (*lhs) != (*rhs);
}
friend bool operator<= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index <= rhs.index;
}
return (*lhs) <= (*rhs);
}
friend bool operator>= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index >= rhs.index;
}
return (*lhs) >= (*rhs);
}
friend bool operator< (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index < rhs.index;
}
return (*lhs) < (*rhs);
}
using difference_type = int;
using value_type = int;
using pointer = int*;
using reference = int&;
using iterator_category = std::random_access_iterator_tag;
private:
int index = 0;
};
class TestVector
{
public:
typedef TestVectorIterator iterator;
typedef const TestVectorIterator const_iterator;
TestVector()
{
}
int size()
{
return global_data.size();
}
TestVector::iterator begin()
{
return TestVectorIterator(0);
}
TestVector::iterator end()
{
return TestVectorIterator(size());
}
TestVector::const_iterator cbegin()
{
return TestVectorIterator(0);
}
TestVector::const_iterator cend()
{
return TestVectorIterator(size());
}
int& operator[](int i)
{
return global_data[i];
}
};
Run Code Online (Sandbox Code Playgroud)
它与范围for循环一起工作正常,但与以下命令一起使用时会出现编译时错误std::sort:
我已经有一段时间没有使用 C++ 了,所以我猜我错过了一些简单的事情(或者做了一些完全错误的事情)。
编辑:
接受完Holt答案后,编译代码如下:
std::array<int, 1000> global_data;
class TestVectorIterator
{
public:
TestVectorIterator()
: index(0)
{
}
TestVectorIterator(int index)
: index(index)
{
}
int& operator*()
{
return global_data[index];
}
const int& operator*() const
{
return global_data[index];
}
TestVectorIterator& operator++()
{
index++;
return *this;
}
TestVectorIterator& operator--()
{
index--;
return *this;
}
friend int operator- (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
return lhs.index - rhs.index;
}
friend TestVectorIterator operator-(TestVectorIterator const& lhs, int rhs)
{
return TestVectorIterator(lhs.index - rhs);
}
friend TestVectorIterator operator+(TestVectorIterator const& lhs, int rhs)
{
return TestVectorIterator(lhs.index + rhs);
}
friend TestVectorIterator operator+(int lhs, TestVectorIterator const& rhs)
{
return TestVectorIterator(lhs + rhs.index);
}
friend TestVectorIterator& operator+= (TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
lhs.index += rhs.index;
return lhs;
}
friend TestVectorIterator& operator-= (TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
lhs.index -= rhs.index;
return lhs;
}
friend bool operator== (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index == rhs.index;
}
return (*lhs) == (*rhs);
}
friend bool operator!= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index != rhs.index;
}
return (*lhs) != (*rhs);
}
friend bool operator<= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index <= rhs.index;
}
return (*lhs) <= (*rhs);
}
friend bool operator>= (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index >= rhs.index;
}
return (*lhs) >= (*rhs);
}
friend bool operator< (const TestVectorIterator& lhs, const TestVectorIterator& rhs)
{
if (rhs.index >= global_data.size())
{
return lhs.index < rhs.index;
}
return (*lhs) < (*rhs);
}
using difference_type = int;
using value_type = int;
using pointer = int*;
using reference = int&;
using iterator_category = std::random_access_iterator_tag;
private:
int index = 0;
};
Run Code Online (Sandbox Code Playgroud)
为了使用,您的迭代器必须满足LegacyRandomAccessIteratorstd::sort的要求,这意味着LegacyBi DirectionIterator、LegacyForwardIterator和LegacyIterator。
您TestVectorIterator缺少一堆重载来满足此类要求。尤其:
operator+(TestVectorIterator const&, TestVectorIterator const&)没有意义,你需要operator+(TestVectorIterator const&, int)和operator+(int, TestVectorIterator const&);TestVectorIterator operator-(TestVectorIterator const&, int);+=, -=;TestVectorIterator operator++(int)以及TestVectorIterator operator--(int);int& operator[](int)。