2 #ifndef GAUDIALG_TUPLEOBJ_H 3 #define GAUDIALG_TUPLEOBJ_H 1 32 #include "Math/Point3D.h" 33 #include "Math/Vector3D.h" 34 #include "Math/Vector4D.h" 35 #include "Math/SVector.h" 36 #include "Math/SMatrix.h" 63 template <
typename T>
struct to_ {
64 template <
typename Arg>
66 {
return T(std::forward<Arg>(i)); }
70 template <
typename Iterator>
260 const CLID& clid = CLID_ColumnWiseTuple ,
385 unsigned short value ,
386 unsigned short minv ,
387 unsigned short maxv );
467 unsigned char value ,
469 unsigned char maxv );
633 unsigned long value ,
635 unsigned long maxv );
715 unsigned long long value ,
716 unsigned long long minv ,
717 unsigned long long maxv );
738 return column ( name , value ,
829 auto is_ok = [](
const StatusCode& sc) ->
bool {
return sc; };
840 template <
typename Value,
typename... Args>
842 return columns_helper(std::forward<Value>(value),
844 std::index_sequence_for<Args...>{});
924 template <
typename ITERATOR1,
typename ITERATOR2>
932 std::forward<ITERATOR1>(first), std::forward<ITERATOR2>(last),
978 template <
class DATA>
1047 template <
class FUNCTION,
class ITERATOR>
1049 const FUNCTION&
function ,
1059 if(
std::distance(first,last) > static_cast<std::ptrdiff_t>(maxv) ) {
1061 + name +
"'): array is overflow, skip extra entries") ;
1066 Int* len = ints( length , 0 , maxv ) ;
1073 FArray* var = fArray ( name , len ) ;
1127 {
return os << i.first; } );
1128 Warning(
"farray('" + os.str()
1129 +
"'): array overflow, skipping extra entries").ignore() ;
1134 Int* len = ints ( length , 0 , maxv ) ;
1143 [&](
const auto& item) {
return this->fArray(item.first,len); } );
1149 for(
size_t index = 0; first != last; ++first,++index ) {
1150 auto item = items.begin();
1151 for(
auto& var : vars ) {
1152 (*var)[index] = (item++)->
second(*first);
1190 template <
class FUNC1,
class FUNC2,
class Iterator>
1192 const FUNC1& func1 ,
1194 const FUNC2& func2 ,
1202 std::forward<Iterator>(first), std::forward<Iterator>(last),
1242 template <
class FUNC1,
class FUNC2,
class FUNC3,
class Iterator>
1244 const FUNC1& func1 ,
1246 const FUNC2& func2 ,
1248 const FUNC3& func3 ,
1257 std::forward<Iterator>(first), std::forward<Iterator>(last),
1300 template <
class FUNC1,
class FUNC2,
class FUNC3,
class FUNC4,
class Iterator>
1302 const FUNC1& func1 ,
1304 const FUNC2& func2 ,
1306 const FUNC3& func3 ,
1308 const FUNC4& func4 ,
1318 std::forward<Iterator>(first), std::forward<Iterator>(last),
1374 template <
class MATRIX>
1376 const MATRIX& data ,
1378 const MIndex& cols ,
1388 Warning (
"fmatrix('"+name+
"'): matrix is overflow, skip extra items").ignore() ;
1389 rows = ( 0 < maxv ) ? ( maxv - 1 ) : 0 ;
1393 Int* len = ints( length , 0 , maxv ) ;
1400 FMatrix* var = fMatrix ( name , len , cols ) ;
1404 for (
size_t iCol = 0 ; iCol < cols ; ++iCol )
1406 for ( MIndex iRow = 0 ; iRow < rows ; ++iRow )
1407 { (*var)[ iRow ] [ iCol ] = data[ iRow ][ iCol ] ; }
1449 template <
class DATA>
1453 const MIndex& cols ,
1461 if ( first + maxv < last )
1463 Warning(
"fmatrix('"+name+
"'): matrix is overflow, skip extra items").ignore() ;
1464 last = first + maxv ;
1468 Int* len = ints( length , 0 , maxv ) ;
1472 *len = last - first ;
1475 FMatrix* var = fMatrix ( name , len , cols ) ;
1480 for ( ; first != last ; ++first )
1483 for ( MIndex iCol = 0 ; iCol < cols ; ++iCol )
1484 { (*var)[ iRow ] [ iCol ] = (float)((*first)[ iCol ]) ; }
1570 template <
class FUN,
class DATA>
1583 if (
std::distance(first,last) > static_cast<std::ptrdiff_t>(maxv) )
1585 Warning(
"fmatrix('"+name+
"'): matrix is overflow, skip extra items").ignore() ;
1590 Int* len = ints( length , 0 , maxv ) ;
1598 FMatrix* var = fMatrix ( name , len , cols ) ;
1603 for ( ; first != last ; ++first )
1606 for ( FUN
fun = funF ;
fun < funL ; ++
fun )
1607 { (*var)[ iRow ] [
fun - funF ] = (*fun) ( *first ) ; }
1639 template <
class DATA>
1652 FArray* var = fArray ( name , length ) ;
1699 template <
class ARRAY>
1702 const MIndex& length )
1708 auto first =
begin(data);
1742 template <
class ARRAY>
1800 template <
class MATRIX>
1802 const MATRIX& data ,
1803 const MIndex& rows ,
1804 const MIndex& cols )
1810 FMatrix* var = fMatrix ( name , rows , cols ) ;
1814 for (
size_t iCol = 0 ; iCol < cols ; ++iCol )
1816 for (
size_t iRow = 0 ; iRow < rows ; ++iRow )
1817 { (*var)[iRow][iCol] = data[iRow][iCol]; }
1840 template <
class TYPE>
1843 return columns( v,
std::make_pair( name +
"E", &ROOT::Math::LorentzVector<TYPE>::E ),
1844 std::make_pair( name +
"X", &ROOT::Math::LorentzVector<TYPE>::Px),
1845 std::make_pair( name +
"Y", &ROOT::Math::LorentzVector<TYPE>::Py),
1846 std::make_pair( name +
"Z", &ROOT::Math::LorentzVector<TYPE>::Pz) );
1865 template <
class TYPE,
class TAG>
1890 template <
class TYPE,
class TAG>
1895 return this->columns( v,
1909 template <
class TYPE,
unsigned int D1,
unsigned int D2,
class REP>
1912 const ROOT::Math::SMatrix<TYPE,D1,D2,REP>& mtrx )
1918 FMatrix* var = fMatrix ( name , (MIndex)D1 , (MIndex)D2 ) ;
1922 for (
size_t iCol = 0 ; iCol < D2 ; ++iCol )
1924 for (
size_t iRow = 0 ; iRow < D1 ; ++iRow )
1925 { (*var)[iRow][iCol] = mtrx(iRow,iCol) ; }
1948 template <
class KEY,
class VALUE>
1953 const size_t maxv = 100 )
1957 fns = { { [](
const Info& i) {
return i.first; } ,
1958 [](
const Info& i) {
return i.second; } } };
1974 template <
class TYPE>
2006 unsigned long addRef () {
return ++m_refCount ; }
2021 bool columnWise()
const {
return CLID_ColumnWiseTuple == clid() ; }
2024 bool rowWise ()
const {
return CLID_RowWiseTuple == clid() ; }
2030 bool valid ()
const {
return 0 != tuple() ; }
2051 {
return m_items.end() == m_items.find ( name ) ; }
2054 const ItemMap&
items()
const {
return m_items ; }
2079 const MIndex& rows ) ;
2087 const MIndex& cols ) ;
2091 const MIndex& rows ,
2092 const MIndex& cols ) ;
2161 size_t m_refCount = 0;
2224 #endif // GAUDIALG_TUPLEOBJ_H
StatusCode column(const std::string &name, const ROOT::Math::DisplacementVector3D< TYPE, TAG > &v)
Useful shortcut to put 3D-Vector directly into N-Tuple:
UShorts m_ushorts
the actual storage of all 'unsigned int' columns
FMatrices m_fmatrices
the actual storage of all 'FArray' columns
A bit modified version of 'Loki::AssocVector' associative vector from Loki library by Andrei Alexandr...
const NTuple::Tuple * tuple() const
provide the access to underlying Gaudi N-tuple
StatusCode matrix(const std::string &name, const MATRIX &data, const MIndex &rows, const MIndex &cols)
fill N-Tuple with fixed-size matrix
GaudiUtils::HashMap< std::string, std::unique_ptr< FMatrix > > FMatrices
the actual storage type for matrix columns
T forward_as_tuple(T...args)
GAUDI_API std::string format(const char *,...)
MsgStream format utility "a la sprintf(...)".
NTuple::Item< float > Float
basic type for float items
bool goodItem(const std::string &name) const
check the uniqueness of the name
bool evtColType() const
Event collection ?
Doubles m_doubles
the actual storage of all 'Double' columns
Tuples::Type m_type
tuple 'type'
StatusCode columns_helper(const Value &value, const Tuple &tup, std::index_sequence< I... >)
Set the values for several columns simultaneously, for the same object Non-existing columns will be a...
Class acting as a smart pointer holding a N tuple _Item.
NTuple::Item< IOpaqueAddress * > Address
basic type for address items
FMatrices m_matricesf
the actual storage of all 'FMatrix' columns (fixed)
Floats m_floats
the actual storage of all 'Float' columns
GAUDI_API void fill(AIDA::IHistogram1D *histo, const double value, const double weight=1.0)
simple function to fill AIDA::IHistogram1D objects
NTuple::Item< unsigned long long > ULongLong
basic type for unsigned long long items
FArrays m_farrays
the actual storage of all 'FArray' columns
NTuple::Item< unsigned short > UShort
basic type for unsigned int items
StatusCode fmatrix(const std::string &name, const MATRIX &data, size_t rows, const MIndex &cols, const std::string &length, size_t maxv)
Fill N-Tuple with data from variable-size matrix.
GaudiUtils::HashMap< std::string, std::unique_ptr< LongLong > > LongLongs
the actual storage type for longlong columns
NTuple::Tuple * tuple()
provide the access to underlying Gaudi N-tuple
FArrays m_arraysf
the actual storage of all 'FArray' columns (fixed)
GaudiUtils::HashMap< std::string, std::unique_ptr< Address > > Addresses
the actual storage type for address columns
StatusCode farray(const std::string &name, ITERATOR1 &&first, ITERATOR2 &&last, const std::string &length, size_t maxv)
Add an indexed array (of type float) to N-tuple.
NTuple::Item< unsigned char > UChar
basic type for unsigned int items
Bools m_bools
the actual storage of all 'bool' columns
Provide serialization function (output only) for some common STL classes (vectors, lists, pairs, maps) plus GaudiUtils::Map and GaudiUtils::HashMap.
auto begin(reverse_wrapper< T > &w)
bool columnWise() const
column wise NTuple ?
PropertyMgr & operator=(const PropertyMgr &)=delete
NTuple::Item< short > Short
basic type for int items
Chars m_chars
the actual storage of all 'Int' columns
A simple wrapper class over standard Gaudi NTuple::Tuple facility.
bool addItem(std::string name, std::string type)
add the item name into the list of known items
StatusCode fmatrix(const std::string &name, FUN funF, FUN funL, DATA first, DATA last, const std::string &length, size_t maxv)
fill N-Tuple with matrix of "direct-product" of "data-vector" [first,last) and "function-vector" [fun...
ULongLongs m_ulonglongs
the actual storage of all 'ulonglong' columns
TupleObj.h GaudiAlg/TupleObj.h namespace with few technical implementations.
A simple wrapper class over standard Gaudi NTuple::Tuple facility.
StatusCode array(const std::string &name, const ARRAY &data)
fill N-Tuple with fixed-size array
This class is used for returning status codes from appropriate routines.
StatusCode farray(const std::string &name1, const FUNC1 &func1, const std::string &name2, const FUNC2 &func2, const std::string &name3, const FUNC3 &func3, Iterator &&first, Iterator &&last, const std::string &length, size_t maxv)
Put three functions from one data array into LoKi-style N-Tuple simultaneously (effective!) ...
StatusCode farray(const std::string &name, const DATA &data, const std::string &length, const size_t maxv)
Add an indexed array (of type float) to N-tuple.
NTuple::Matrix< float > FMatrix
basic type for matrix of floats
UInts m_uints
the actual storage of all 'unsigned int' columns
T operator()(Arg &&i) const
ItemMap m_items
all booked types:
NTuple::Item< bool > Bool
basic type for int items
auto end(reverse_wrapper< T > &w)
NTuple::Item< double > Double
basic type for double items
StatusCode farray(const std::string &name1, const FUNC1 &func1, const std::string &name2, const FUNC2 &func2, Iterator &&first, Iterator &&last, const std::string &length, size_t maxv)
Put two functions from one data array into LoKi-style N-Tuple simultaneously (effective!) ...
Specialization acting as a smart pointer holding a N tuple _Item.
Ints m_ints
the actual storage of all 'Int' columns
unsigned int CLID
Class ID definition.
GaudiUtils::HashMap< std::string, std::unique_ptr< UShort > > UShorts
the actual storage type for unsigned short columns
LongLongs m_longlongs
the actual storage of all 'longlong' columns
bool valid() const
valid pointer to tuple ?
StatusCode fmatrix(const std::string &name, DATA first, DATA last, const MIndex &cols, const std::string &length, size_t maxv)
Fill N-Tuple with data from variable-size matrix.
unsigned long addRef()
add the reference to TupleObj
unsigned long refCount() const
return the reference counter
bool rowWise() const
row wise NTuple ?
Stream & ostream_joiner(Stream &os, Iterator first, Iterator last, Separator sep, OutputElement output=OutputElement{})
Abstract base class which allows the user to interact with the actual N tuple implementation.
typename std::add_const< typename std::iterator_traits< Iterator >::reference >::type const_ref_t
StatusCode column(const std::string &name, signed char value)
Set the value for the selected tuple column.
ErrorCodes
Tuple error codes.
NTuple::Item< long long > LongLong
basic type for unsigned long long items
Addresses m_addresses
the actual storage of all 'Address' columns
GaudiUtils::HashMap< std::string, std::unique_ptr< FArray > > FArrays
the actual storage type for array columns
GaudiUtils::HashMap< std::string, std::unique_ptr< Float > > Floats
the actual storage type for float columns
StatusCode farray(const std::string &name1, const FUNC1 &func1, const std::string &name2, const FUNC2 &func2, const std::string &name3, const FUNC3 &func3, const std::string &name4, const FUNC4 &func4, Iterator &&first, Iterator &&last, const std::string &length, size_t maxv)
Put four functions from one data array into LoKi-style N-Tuple simultaneously (effective!) ...
StatusCode array(const std::string &name, DATA first, DATA last)
fill N-Tuple with fixed-size array
struct GAUDI_API array
Parametrisation class for redirection array - like implementation.
NTuple::Tuple * m_tuple
tuple itself
GaudiUtils::HashMap< std::string, std::unique_ptr< Double > > Doubles
the actual storage type for float columns
Tuples::Type type() const
accessor to the N-Tuple type
boost::spirit::classic::position_iterator2< ForwardIterator > Iterator
StatusCode farray(const std::string &name, const FUNCTION &function, ITERATOR first, ITERATOR last, const std::string &length, size_t maxv)
Put an indexed array into LoKi-style N-Tuple.
T back_inserter(T...args)
double fun(const std::vector< double > &x)
NTuple::Item< char > Char
basic type for int items
Common class providing an architecture-independent hash map.
NTuple::Item< int > Int
basic type for int items
GaudiUtils::HashMap< std::string, std::unique_ptr< Char > > Chars
the actual storage type for short columns
StatusCode column(const std::string &name, const ROOT::Math::LorentzVector< TYPE > &v)
Useful shortcut to put LorentzVector directly into N-Tuple:
Shorts m_shorts
the actual storage of all 'Int' columns
bool invalid() const
invalid pointer to tuple ?
const ItemMap & items() const
get the full list of booked items
NTuple::Array< float > FArray
basic type for array of floats
auto invoke(F &&f, ArgTypes &&...args) noexcept(noexcept(detail2::INVOKE(std::forward< F >(f), std::forward< ArgTypes >(args)...))) -> decltype(detail2::INVOKE(std::forward< F >(f), std::forward< ArgTypes >(args)...))
Implementation file for Tuple::TupleObj::put method.
Opaque address interface definition.
GaudiUtils::HashMap< std::string, std::unique_ptr< UInt > > UInts
the actual storage type for unsigned integer columns
Class acting as a smart pointer holding a N tuple _Item.
const CLID & clid() const
accessor to the N-Tuple CLID
GaudiUtils::HashMap< std::string, std::unique_ptr< Int > > Ints
the actual storage type for integer columns
StatusCode array(const std::string &name, const ARRAY &data, const MIndex &length)
fill N-Tuple with fixed-size array
GaudiUtils::HashMap< std::string, std::unique_ptr< Short > > Shorts
the actual storage type for short columns
Class acting as a smart pointer holding a N tuple _Item.
std::map< std::string, std::string > ItemMap
Type
the list of available types for ntuples
const std::string & name() const
get the name
NTuple::Item< unsigned int > UInt
basic type for unsigned int items
StatusCode columns(Value &&value, Args &&...args)
GaudiUtils::HashMap< std::string, std::unique_ptr< ULongLong > > ULongLongs
the actual storage type for ulonglong columns
UChars m_uchars
the actual storage of all 'unsigned int' columns
GaudiUtils::HashMap< std::string, std::unique_ptr< Bool > > Bools
the actual storage type for short columns
Out1 * put(DataObjectHandle< Out1 > &out_handle, Out2 &&out)
GaudiUtils::HashMap< std::string, std::unique_ptr< UChar > > UChars
the actual storage type for unsigned short columns
General namespace for Tuple properties.