Import Geant4 11.4.0 source tree
This commit is contained in:
Gabriele Cosmo
+28
-329
@@ -4,7 +4,10 @@
|
||||
#ifndef tools_vmanip
|
||||
#define tools_vmanip
|
||||
|
||||
#include "touplow"
|
||||
|
||||
#include <vector>
|
||||
#include <string>
|
||||
|
||||
namespace tools {
|
||||
|
||||
@@ -39,10 +42,6 @@ inline void safe_reverse_clear(std::vector<T*>& a_vec){ //used in sg/group.
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef TOOLS_DEPRECATED
|
||||
template <class T> inline void clear(std::vector<T*>& a_vec){safe_clear<T>(a_vec);}
|
||||
#endif
|
||||
|
||||
template <class T>
|
||||
inline void raw_clear(std::vector<T*>& a_vec){
|
||||
typedef typename std::vector<T*>::iterator it_t;
|
||||
@@ -50,18 +49,6 @@ inline void raw_clear(std::vector<T*>& a_vec){
|
||||
a_vec.clear();
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void copy(std::vector<T*>& a_to,const std::vector<T*>& a_from){
|
||||
raw_clear<T>(a_to);
|
||||
typedef typename std::vector<T*>::const_iterator it_t;
|
||||
for(it_t it = a_from.begin();it!=a_from.end();++it) {
|
||||
a_to.push_back((*it)->copy());
|
||||
}
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void vcopy(std::vector<T*>& a_to,const std::vector<T*>& a_from) {return copy<T>(a_to,a_from);}
|
||||
|
||||
template <class T>
|
||||
inline void append(std::vector<T>& a_vec,const std::vector<T>& a_from) {
|
||||
typedef typename std::vector<T>::size_type sz_t;
|
||||
@@ -105,42 +92,34 @@ inline bool is_inp(const std::vector<T*>& a_vec,const T* a_item){
|
||||
return false;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline T* find_named(const std::vector<T*>& a_vec,const std::string& a_name) {
|
||||
typedef typename std::vector<T*>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
if((*it)->name()==a_name) return *it;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline T* find_named_case_insensitive(const std::vector<T*>& a_vec,const std::string& a_name) {
|
||||
std::string low_a_name = a_name;
|
||||
tolowercase(low_a_name);
|
||||
std::string low_name;
|
||||
typedef typename std::vector<T*>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
low_name = (*it)->name();
|
||||
tolowercase(low_name);
|
||||
if(low_name==low_a_name) return *it;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////
|
||||
/// T : ////////////////////////////////////////////////////////////////////
|
||||
////////////////////////////////////////////////////////////////////////////
|
||||
template <class T>
|
||||
inline void push_back_unique(std::vector<T>& a_vec,const T& a_v) {
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it=a_vec.begin();it!=a_vec.end();++it) {if(*it==a_v) return;}
|
||||
a_vec.push_back(a_v);
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool remove(std::vector<T>& a_vals,const T& a_elem){
|
||||
bool found_some = false;
|
||||
//std::vector<T>::iterator it;
|
||||
//for(it=a_vals.begin();it!=a_vals.end();) {
|
||||
// if(*it==a_elem) {
|
||||
// it = a_vals.erase(it);
|
||||
// found_some = true;
|
||||
// } else {
|
||||
// ++it;
|
||||
// }
|
||||
//}
|
||||
//TOOLS_STL : brut force avoiding erase() :
|
||||
std::vector<T> vs;
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
for(it_t it=a_vals.begin();it!=a_vals.end();++it) {
|
||||
if(*it==a_elem) {
|
||||
found_some = true;
|
||||
} else {
|
||||
vs.push_back(*it);
|
||||
}
|
||||
}
|
||||
a_vals = vs;
|
||||
return found_some;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void vfilter(std::vector<T>& a_vals,bool(*a_filter_func)(const T& a_elem)){
|
||||
std::vector<T> vs;
|
||||
@@ -151,54 +130,6 @@ inline void vfilter(std::vector<T>& a_vals,bool(*a_filter_func)(const T& a_elem)
|
||||
a_vals = vs;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void unique(std::vector<T>& a_vec) {
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
it_t it,it2;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
it2 = it;it2++; //TOOLS_STL : it2=it+1 does not compile.
|
||||
for(;it2!=a_vec.end();) {
|
||||
if((*it2)==(*it)) {
|
||||
it2 = a_vec.erase(it2);
|
||||
} else {
|
||||
++it2;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool is_in(const std::vector<T>& a_vec,const T& a_item){
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
if(*it==a_item) return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool item_index(const std::vector<T>& a_vec,const T& a_item,unsigned int& a_index){
|
||||
a_index = 0;
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it,a_index++) {
|
||||
if(*it==a_item) return true;
|
||||
}
|
||||
a_index = 0;
|
||||
return false;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool belong(const std::vector<T>& a_vec,const T& a_item){
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
if(*it==a_item) return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool minimum(const std::vector<T>& a_vec,T& a_value) {
|
||||
if(a_vec.empty()) {a_value = T();return false;}
|
||||
@@ -221,131 +152,7 @@ inline bool maximum(const std::vector<T>& a_vec,T& a_value) {
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline T sum(const std::vector<T>& a_vec) {
|
||||
T sum = T();
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) sum += *it;
|
||||
return sum;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void filter(std::vector<T>& a_vec,unsigned int a_min,unsigned int a_max){
|
||||
unsigned int imx = a_vec.size()-1;
|
||||
unsigned int mx = a_max<imx?a_max:imx;
|
||||
unsigned int i = 0;
|
||||
for(unsigned int index=a_min;index<=mx;index++) {
|
||||
a_vec[i] = a_vec[index];i++;
|
||||
}
|
||||
a_vec.resize(i);
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void steps(std::vector<T>& a_vec,unsigned int a_number){
|
||||
a_vec.resize(a_number);
|
||||
for(unsigned int index=0;index<a_number;index++) a_vec[index] = T(index);
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool add(std::vector<T>& a_vec,const std::vector<T>& a_v){
|
||||
if(a_vec.size()!=a_v.size()) return false;
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
typedef typename std::vector<T>::const_iterator cit_t;
|
||||
it_t it = a_vec.begin();
|
||||
cit_t vit = a_v.begin();
|
||||
for(;it!=a_vec.end();++it,++vit) *it += *vit;
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool vequ(const std::vector<T>& a_vec,const std::vector<T>& a_v){
|
||||
if(a_vec.size()!=a_v.size()) return false;
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
typedef typename std::vector<T>::const_iterator cit_t;
|
||||
it_t it = a_vec.begin();
|
||||
cit_t vit = a_v.begin();
|
||||
//size_t count = 0;
|
||||
for(;it!=a_vec.end();++it,++vit
|
||||
// ,count++
|
||||
) {
|
||||
if((*it)!=(*vit))
|
||||
//{::printf("debug : %lu : %d %d\n",count,(*it),(*vit));
|
||||
return false;
|
||||
//}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool vadd(std::vector<T>& a_vec,const std::vector<T>& a_v) {return add<T>(a_vec,a_v);}
|
||||
|
||||
template <class T>
|
||||
inline bool sub(std::vector<T>& a_vec,const std::vector<T>& a_v){
|
||||
if(a_vec.size()!=a_v.size()) return false;
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
typedef typename std::vector<T>::const_iterator cit_t;
|
||||
it_t it = a_vec.begin();
|
||||
cit_t vit = a_v.begin();
|
||||
for(;it!=a_vec.end();++it,++vit) *it -= *vit;
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool div(std::vector<T>& a_vec,const std::vector<T>& a_v){
|
||||
if(a_vec.size()!=a_v.size()) return false;
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
typedef typename std::vector<T>::const_iterator cit_t;
|
||||
it_t it = a_vec.begin();
|
||||
cit_t vit = a_v.begin();
|
||||
bool errors = false;
|
||||
for(;it!=a_vec.end();++it,++vit) {
|
||||
if(*vit==T()) {
|
||||
errors = true;
|
||||
} else {
|
||||
*it /= *vit;
|
||||
}
|
||||
}
|
||||
return errors;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void add(std::vector<T>& a_vec,const T& a_v){
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
for(it_t it=a_vec.begin();it!=a_vec.end();++it) *it += a_v;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void sub(std::vector<T>& a_vec,const T& a_v){
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
for(it_t it=a_vec.begin();it!=a_vec.end();++it) *it -= a_v;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void mul(std::vector<T>& a_vec,const T& a_v){
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
for(it_t it=a_vec.begin();it!=a_vec.end();++it) *it *= a_v;
|
||||
}
|
||||
template <class T>
|
||||
inline bool vmul(std::vector<T>& a_vec,const std::vector<T>& a_v) {return vmul<T>(a_vec,a_v);}
|
||||
|
||||
template <class T>
|
||||
inline void div(std::vector<T>& a_vec,const T& a_v){
|
||||
typedef typename std::vector<T>::iterator it_t;
|
||||
for(it_t it=a_vec.begin();it!=a_vec.end();++it) *it /= a_v;
|
||||
}
|
||||
|
||||
/*
|
||||
template <class FROM,class TO>
|
||||
inline std::vector<TO> convert(const std::vector<FROM>& a_from){
|
||||
typedef typename std::vector<FROM>::const_iterator const_it_t;
|
||||
typedef typename std::vector<TO>::iterator it_t;
|
||||
std::vector<TO> to(a_from.size());
|
||||
const_it_t ait = a_from.begin();
|
||||
it_t toit = to.begin();
|
||||
for(;ait!=a_from.end();++ait,++toit) {*toit = (TO)*ait;}
|
||||
return to;
|
||||
}
|
||||
*/
|
||||
template <class FROM,class TO>
|
||||
inline void convert(const std::vector<FROM>& a_from,std::vector<TO>& a_to) {
|
||||
typedef typename std::vector<FROM>::const_iterator const_it_t;
|
||||
@@ -356,114 +163,6 @@ inline void convert(const std::vector<FROM>& a_from,std::vector<TO>& a_to) {
|
||||
for(;ait!=a_from.end();++ait,++toit) {*toit = (TO)*ait;}
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool min_max(const std::vector<T>& a_vec,T& a_min,T& a_max) {
|
||||
if(a_vec.empty()) {a_min=T();a_max=T();return false;}
|
||||
a_min = *(a_vec.begin());
|
||||
a_max = a_min;
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) {
|
||||
a_min = *it<a_min?*it:a_min;
|
||||
a_max = *it>a_max?*it:a_max;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
/// T(*a_fabs)(T) : ///////////////////////////////////////////////////////////////////////////////////////////
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
template <class T>
|
||||
inline bool mean_rms(const std::vector<T>& a_vec,T& a_mean,T& a_rms,T(*a_sqrt)(T),T(*a_fabs)(T)) {
|
||||
if(a_vec.empty()) {a_mean=T();a_rms=T();return false;}
|
||||
T S = T();
|
||||
T S2 = T();
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) {
|
||||
S += *it;
|
||||
S2 += (*it) * (*it);
|
||||
}
|
||||
a_mean = S/T(a_vec.size());
|
||||
a_rms = a_sqrt(a_fabs(S2/T(a_vec.size()) - a_mean * a_mean));
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool min_max_mean_rms(const std::vector<T>& a_vec,T& a_min,T& a_max,T& a_mean,T& a_rms,
|
||||
T(*a_sqrt)(T),T(*a_fabs)(T)) {
|
||||
if(a_vec.empty()) {a_min=T();a_max=T();a_mean=T();a_rms=T();return false;}
|
||||
a_min = *(a_vec.begin());
|
||||
a_max = a_min;
|
||||
T S = T();
|
||||
T S2 = T();
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) {
|
||||
a_min = *it<a_min?*it:a_min;
|
||||
a_max = *it>a_max?*it:a_max;
|
||||
S += *it;
|
||||
S2 += (*it) * (*it);
|
||||
}
|
||||
a_mean = S/T(a_vec.size());
|
||||
a_rms = a_sqrt(a_fabs(S2/T(a_vec.size()) - a_mean * a_mean));
|
||||
return true;
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
/// T(*a_fabs)(const T&) : ///////////////////////////////////////////////////////////////////////////////////////////
|
||||
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
template <class T>
|
||||
inline bool mean_rms(const std::vector<T>& a_vec,T& a_mean,T& a_rms,T(*a_sqrt)(const T&),T(*a_fabs)(const T&)) {
|
||||
if(a_vec.empty()) {a_mean=T();a_rms=T();return false;}
|
||||
T S = T();
|
||||
T S2 = T();
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) {
|
||||
S += *it;
|
||||
S2 += (*it) * (*it);
|
||||
}
|
||||
a_mean = S/T(a_vec.size());
|
||||
a_rms = a_sqrt(a_fabs(S2/T(a_vec.size()) - a_mean * a_mean));
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool min_max_mean_rms(const std::vector<T>& a_vec,T& a_min,T& a_max,T& a_mean,T& a_rms,
|
||||
T(*a_sqrt)(const T&),T(*a_fabs)(const T&)) {
|
||||
if(a_vec.empty()) {a_min=T();a_max=T();a_mean=T();a_rms=T();return false;}
|
||||
a_min = *(a_vec.begin());
|
||||
a_max = a_min;
|
||||
T S = T();
|
||||
T S2 = T();
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
for(it_t it = a_vec.begin();it!=a_vec.end();++it) {
|
||||
a_min = *it<a_min?*it:a_min;
|
||||
a_max = *it>a_max?*it:a_max;
|
||||
S += *it;
|
||||
S2 += (*it) * (*it);
|
||||
}
|
||||
a_mean = S/T(a_vec.size());
|
||||
a_rms = a_sqrt(a_fabs(S2/T(a_vec.size()) - a_mean * a_mean));
|
||||
return true;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////
|
||||
/// manipulations that induces other includes : ///////////
|
||||
///////////////////////////////////////////////////////////
|
||||
#include <ostream>
|
||||
|
||||
namespace tools {
|
||||
|
||||
//NOTE : print is a Python keyword.
|
||||
template <class T>
|
||||
inline void dump(const std::vector<T>& a_vec,std::ostream& a_out){
|
||||
typedef typename std::vector<T>::const_iterator it_t;
|
||||
it_t it;
|
||||
for(it=a_vec.begin();it!=a_vec.end();++it) {
|
||||
a_out << *it << std::endl;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user