mirror of
https://github.com/trapexit/mergerfs.git
synced 2024-11-26 02:09:52 +08:00
47 lines
1.2 KiB
C++
47 lines
1.2 KiB
C++
/*
|
|
Copyright (c) 2016, Antonio SJ Musumeci <trapexit@spawn.link>
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
|
|
template<typename V, bool SORT = false>
|
|
class buildvector
|
|
{
|
|
public:
|
|
buildvector(const V &val_)
|
|
{
|
|
_vector.push_back(val_);
|
|
}
|
|
|
|
buildvector<V,SORT> &operator()(const V &val_)
|
|
{
|
|
_vector.push_back(val_);
|
|
return *this;
|
|
}
|
|
|
|
operator std::vector<V>()
|
|
{
|
|
if(SORT == true)
|
|
std::sort(_vector.begin(),_vector.end());
|
|
return _vector;
|
|
}
|
|
|
|
private:
|
|
std::vector<V> _vector;
|
|
};
|