70 lines
2.0 KiB
C++
70 lines
2.0 KiB
C++
|
/*
|
||
|
|
* Copyright (C) 2015 - 2018 Intel Corporation.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright notice(s),
|
||
|
|
* this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice(s),
|
||
|
|
* this list of conditions and the following disclaimer in the documentation
|
||
|
|
* and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS
|
||
|
|
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
||
|
|
* EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
||
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
||
|
|
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
||
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include "Iterator.hpp"
|
||
|
|
|
||
|
|
#include <vector>
|
||
|
|
|
||
|
|
template<class T>
|
||
|
|
class VectorIterator
|
||
|
|
: public Iterator<T>
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
|
||
|
|
static VectorIterator create(int init_size)
|
||
|
|
{
|
||
|
|
return VectorIterator(init_size);
|
||
|
|
}
|
||
|
|
static VectorIterator create(std::vector<T> v)
|
||
|
|
{
|
||
|
|
return VectorIterator(v);
|
||
|
|
}
|
||
|
|
|
||
|
|
bool has_next() const
|
||
|
|
{
|
||
|
|
return !vec.empty();
|
||
|
|
}
|
||
|
|
|
||
|
|
T next()
|
||
|
|
{
|
||
|
|
T val = vec.back();
|
||
|
|
vec.pop_back();
|
||
|
|
return val;
|
||
|
|
}
|
||
|
|
|
||
|
|
size_t size() const
|
||
|
|
{
|
||
|
|
return vec.size();
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
VectorIterator(std::vector<T> v)
|
||
|
|
{
|
||
|
|
vec = v;
|
||
|
|
}
|
||
|
|
|
||
|
|
std::vector<T> vec;
|
||
|
|
};
|