# PhasicFlow: src/phasicFlow/containers/Vector/VectorAlgorithm.hpp Source File

VectorAlgorithm.hpp
Go to the documentation of this file.
/*------------------------------- phasicFlow ---------------------------------
O C enter of
O O E ngineering and
O O M ultiscale modeling of
OOOOOOO F luid flow
------------------------------------------------------------------------------
Copyright (C): www.cemf.ir
email: hamid.r.norouzi AT gmail.com
------------------------------------------------------------------------------
Licence:
This file is part of phasicFlow code. It is a free software for simulating
granular and multiphase flows. You can redistribute it and/or modify it under
the terms of GNU General Public License v3 or any other later versions.
phasicFlow is distributed to help others in their research in the field of
granular and multiphase flows, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-----------------------------------------------------------------------------*/
namespace pFlow
{
template<typename T, typename Allocator>
inline auto count(const Vector<T, Allocator>& vec, const T& val)
{
return std::count(vec.begin(), vec.end(), val);
}
template<typename T, typename Allocator, typename UnaryPredicate>
inline auto count_if(const Vector<T, Allocator>& vec, UnaryPredicate p)
{
return std::count_if(vec.begin(), vec.end(), p);
}
template<typename T, typename Allocator>
inline void fill_n(Vector<T, Allocator>& vec, size_t n, const T& val)
{
std::fill_n(vec.begin(), n, val);
}
template<typename T, typename Allocator>
inline void fill(Vector<T, Allocator>& vec, const T& val)
{
std::fill(vec.begin(), vec.end(), val);
}
template<typename T, typename Allocator>
inline void fillSequence(Vector<T, Allocator>& vec, int32 start, int32 end, const T& startVal)
{
pFlow::algorithms::STD::fillSequence<T, false>(vec.data()+start, end-start, startVal);
}
template<typename T, typename Allocator>
inline void fillSequence(Vector<T, Allocator>& vec, const T& startVal)
{
pFlow::fillSequence(vec, 0, vec.size(), startVal);
}
template<typename T, typename Allocator>
inline void sort(Vector<T, Allocator>& vec)
{
std::sort(vec.begin(), vec.end());
}
template<typename T, typename Allocator>
inline int64 find(Vector<T, Allocator>& vec, const T& val)
{
ForAll( i,vec)
{
if ( vec[i] == val) return static_cast< int64 >(i);
}
return -1;
}
} // pFlow
count
auto count(const Vector< T, Allocator > &vec, const T &val)
pFlow::fillSequence
void fillSequence(Vector< T, Allocator > &vec, int32 start, int32 end, const T &startVal)
Definition: VectorAlgorithm.hpp:50
pFlow::fill
void fill(Vector< T, Allocator > &vec, const T &val)
Definition: VectorAlgorithm.hpp:44
pFlow::count_if
auto count_if(const Vector< T, Allocator > &vec, UnaryPredicate p)
Definition: VectorAlgorithm.hpp:32
pFlow::find
int64 find(Vector< T, Allocator > &vec, const T &val)
Definition: VectorAlgorithm.hpp:69
count_if
auto count_if(const Vector< T, Allocator > &vec, UnaryPredicate p)
pFlow::int64
long long int int64
Definition: builtinTypes.hpp:55
pFlow::Vector::size
auto size() const
Definition: Vector.hpp:299
pFlow
Definition: demComponent.hpp:28
fill_n
void fill_n(Vector< T, Allocator > &vec, size_t n, const T &val)
n
int32 n
Definition: NBSCrossLoop.hpp:24
pFlow::int32
int int32
Definition: builtinTypes.hpp:53
ForAll
#define ForAll(i, container)
Definition: pFlowMacros.hpp:71
fill
void fill(Vector< T, Allocator > &vec, const T &val)
pFlow::count
auto count(const Vector< T, Allocator > &vec, const T &val)
Definition: VectorAlgorithm.hpp:26
sort
void sort(Vector< T, Allocator > &vec)
pFlow::sort
void sort(Vector< T, Allocator > &vec)
Definition: VectorAlgorithm.hpp:62
pFlow::Vector
Definition: Vector.hpp:46
pFlow::fill_n
void fill_n(Vector< T, Allocator > &vec, size_t n, const T &val)
Definition: VectorAlgorithm.hpp:38