[51587aa] | 1 | // |
---|
| 2 | // Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo |
---|
| 3 | // |
---|
| 4 | // The contents of this file are covered under the licence agreement in the |
---|
| 5 | // file "LICENCE" distributed with Cforall. |
---|
| 6 | // |
---|
[60089f4] | 7 | // utility.h -- |
---|
[51587aa] | 8 | // |
---|
| 9 | // Author : Richard C. Bilson |
---|
| 10 | // Created On : Mon May 18 07:44:20 2015 |
---|
[e04ef3a] | 11 | // Last Modified By : Peter A. Buhr |
---|
| 12 | // Last Modified On : Wed Jun 8 17:33:59 2016 |
---|
| 13 | // Update Count : 22 |
---|
[51587aa] | 14 | // |
---|
[01aeade] | 15 | |
---|
| 16 | #ifndef _UTILITY_H |
---|
| 17 | #define _UTILITY_H |
---|
[51b7345] | 18 | |
---|
| 19 | #include <iostream> |
---|
[5f2f2d7] | 20 | #include <sstream> |
---|
[51b7345] | 21 | #include <iterator> |
---|
| 22 | #include <string> |
---|
| 23 | #include <cctype> |
---|
| 24 | #include <list> |
---|
| 25 | |
---|
| 26 | template< typename T > |
---|
[01aeade] | 27 | static inline T * maybeClone( const T *orig ) { |
---|
| 28 | if ( orig ) { |
---|
| 29 | return orig->clone(); |
---|
| 30 | } else { |
---|
| 31 | return 0; |
---|
| 32 | } // if |
---|
[51b7345] | 33 | } |
---|
| 34 | |
---|
[e04ef3a] | 35 | template<typename T, typename U> |
---|
| 36 | struct maybeBuild_t { |
---|
| 37 | static T * doit( const U *orig ) { |
---|
| 38 | if ( orig ) { |
---|
| 39 | return orig->build(); |
---|
| 40 | } else { |
---|
| 41 | return 0; |
---|
| 42 | } // if |
---|
| 43 | } |
---|
| 44 | }; |
---|
| 45 | |
---|
[51b7345] | 46 | template< typename T, typename U > |
---|
[01aeade] | 47 | static inline T * maybeBuild( const U *orig ) { |
---|
[e04ef3a] | 48 | return maybeBuild_t<T,U>::doit(orig); |
---|
[51b7345] | 49 | } |
---|
| 50 | |
---|
[7ecbb7e] | 51 | template< typename T, typename U > |
---|
| 52 | static inline T * maybeMoveBuild( const U *orig ) { |
---|
| 53 | T* ret = maybeBuild<T>(orig); |
---|
| 54 | delete orig; |
---|
| 55 | return ret; |
---|
| 56 | } |
---|
| 57 | |
---|
[51b7345] | 58 | template< typename Input_iterator > |
---|
[01aeade] | 59 | void printEnums( Input_iterator begin, Input_iterator end, const char * const *name_array, std::ostream &os ) { |
---|
| 60 | for ( Input_iterator i = begin; i != end; ++i ) { |
---|
| 61 | os << name_array[ *i ] << ' '; |
---|
| 62 | } // for |
---|
[51b7345] | 63 | } |
---|
| 64 | |
---|
| 65 | template< typename Container > |
---|
[01aeade] | 66 | void deleteAll( Container &container ) { |
---|
| 67 | for ( typename Container::iterator i = container.begin(); i != container.end(); ++i ) { |
---|
| 68 | delete *i; |
---|
| 69 | } // for |
---|
[51b7345] | 70 | } |
---|
| 71 | |
---|
| 72 | template< typename Container > |
---|
[01aeade] | 73 | void printAll( const Container &container, std::ostream &os, int indent = 0 ) { |
---|
| 74 | for ( typename Container::const_iterator i = container.begin(); i != container.end(); ++i ) { |
---|
| 75 | if ( *i ) { |
---|
[cf0941d] | 76 | os << std::string( indent, ' ' ); |
---|
[01aeade] | 77 | (*i)->print( os, indent + 2 ); |
---|
[60089f4] | 78 | // need an endl after each element because it's not easy to know when each individual item should end |
---|
[01aeade] | 79 | os << std::endl; |
---|
| 80 | } // if |
---|
| 81 | } // for |
---|
[51b7345] | 82 | } |
---|
| 83 | |
---|
| 84 | template< typename SrcContainer, typename DestContainer > |
---|
[01aeade] | 85 | void cloneAll( const SrcContainer &src, DestContainer &dest ) { |
---|
| 86 | typename SrcContainer::const_iterator in = src.begin(); |
---|
| 87 | std::back_insert_iterator< DestContainer > out( dest ); |
---|
| 88 | while ( in != src.end() ) { |
---|
| 89 | *out++ = (*in++)->clone(); |
---|
| 90 | } // while |
---|
[51b7345] | 91 | } |
---|
| 92 | |
---|
| 93 | template< typename Container > |
---|
[01aeade] | 94 | void assertAll( const Container &container ) { |
---|
| 95 | int count = 0; |
---|
| 96 | for ( typename Container::const_iterator i = container.begin(); i != container.end(); ++i ) { |
---|
| 97 | if ( !(*i) ) { |
---|
| 98 | std::cerr << count << " is null" << std::endl; |
---|
| 99 | } // if |
---|
| 100 | } // for |
---|
| 101 | } |
---|
| 102 | |
---|
[2871210] | 103 | static inline std::string assign_strptr( const std::string *str ) { |
---|
[01aeade] | 104 | if ( str == 0 ) { |
---|
| 105 | return ""; |
---|
| 106 | } else { |
---|
| 107 | std::string tmp; |
---|
| 108 | tmp = *str; |
---|
| 109 | delete str; |
---|
| 110 | return tmp; |
---|
| 111 | } // if |
---|
[51b7345] | 112 | } |
---|
| 113 | |
---|
[2871210] | 114 | template< class T, typename ResultType, ResultType( T::* memfunc )() > |
---|
[01aeade] | 115 | ResultType dispatch( T *pT ) { |
---|
| 116 | return (pT->*memfunc)(); |
---|
[51b7345] | 117 | } |
---|
| 118 | |
---|
| 119 | template < typename T > |
---|
[01aeade] | 120 | std::list<T> tail( std::list<T> l ) { |
---|
| 121 | if ( ! l.empty() ) { |
---|
| 122 | std::list<T> ret(++(l.begin()), l.end()); |
---|
| 123 | return ret; |
---|
| 124 | } // if |
---|
[51b7345] | 125 | } |
---|
| 126 | |
---|
| 127 | template < typename T > |
---|
| 128 | std::list<T> flatten( std::list < std::list<T> > l) { |
---|
[01aeade] | 129 | typedef std::list <T> Ts; |
---|
[51b7345] | 130 | |
---|
[01aeade] | 131 | Ts ret; |
---|
[51b7345] | 132 | |
---|
[a08ba92] | 133 | switch ( l.size() ) { |
---|
[01aeade] | 134 | case 0: |
---|
| 135 | return ret; |
---|
| 136 | case 1: |
---|
| 137 | return l.front(); |
---|
| 138 | default: |
---|
| 139 | ret = flatten(tail(l)); |
---|
| 140 | ret.insert(ret.begin(), l.front().begin(), l.front().end()); |
---|
| 141 | return ret; |
---|
| 142 | } // switch |
---|
[51b7345] | 143 | } |
---|
| 144 | |
---|
[60089f4] | 145 | template < typename T > |
---|
[51b7345] | 146 | std::string toString ( T value ) { |
---|
[5f2f2d7] | 147 | std::ostringstream os; |
---|
[01aeade] | 148 | os << value; // << std::ends; |
---|
[5f2f2d7] | 149 | return os.str(); |
---|
[51b7345] | 150 | } |
---|
| 151 | |
---|
| 152 | template< class Constructed, typename Arg > |
---|
| 153 | Constructed *ctor( Arg arg ) { |
---|
[01aeade] | 154 | Constructed *c = new Constructed( arg ); |
---|
| 155 | return c; |
---|
[51b7345] | 156 | } |
---|
| 157 | |
---|
| 158 | template< class Constructed, typename Arg > |
---|
| 159 | Constructed ctor_noptr( Arg arg ) { |
---|
[01aeade] | 160 | return Constructed( arg ); |
---|
[51b7345] | 161 | } |
---|
| 162 | |
---|
| 163 | template< typename T > |
---|
| 164 | void replace( std::list< T > &org, typename std::list< T >::iterator pos, std::list< T > &with ) { |
---|
[01aeade] | 165 | typename std::list< T >::iterator next = pos; advance( next, 1 ); |
---|
[51b7345] | 166 | |
---|
[01aeade] | 167 | //if ( next != org.end() ) { |
---|
[a08ba92] | 168 | org.erase( pos ); |
---|
| 169 | org.splice( next, with ); |
---|
| 170 | //} |
---|
[51b7345] | 171 | |
---|
[01aeade] | 172 | return; |
---|
[51b7345] | 173 | } |
---|
| 174 | |
---|
| 175 | template< typename T1, typename T2 > |
---|
| 176 | T2 *cast_ptr( T1 *from ) { |
---|
[01aeade] | 177 | return dynamic_cast< T2 * >( from ); |
---|
[51b7345] | 178 | } |
---|
| 179 | |
---|
| 180 | template< class Exception, typename Arg > |
---|
| 181 | void inline assert_throw( bool pred, Arg arg ) { |
---|
[01aeade] | 182 | if (pred) throw Exception( arg ); |
---|
[51b7345] | 183 | } |
---|
| 184 | |
---|
| 185 | template< typename T > |
---|
| 186 | struct is_null_pointer { |
---|
[a08ba92] | 187 | bool operator()( const T *ptr ) { return ( ptr == 0 ); } |
---|
[51b7345] | 188 | }; |
---|
| 189 | |
---|
| 190 | template< class InputIterator, class OutputIterator, class Predicate > |
---|
[01aeade] | 191 | void filter(InputIterator begin, InputIterator end, OutputIterator out, Predicate pred) { |
---|
| 192 | while ( begin++ != end ) |
---|
| 193 | if ( pred(*begin) ) *out++ = *begin; |
---|
[51b7345] | 194 | |
---|
[01aeade] | 195 | return; |
---|
[51b7345] | 196 | } |
---|
| 197 | |
---|
| 198 | template< class InputIterator1, class InputIterator2, class OutputIterator > |
---|
| 199 | void zip( InputIterator1 b1, InputIterator1 e1, InputIterator2 b2, InputIterator2 e2, OutputIterator out ) { |
---|
[01aeade] | 200 | while ( b1 != e1 && b2 != e2 ) |
---|
| 201 | *out++ = std::pair<typename InputIterator1::value_type, typename InputIterator2::value_type>(*b1++, *b2++); |
---|
[51b7345] | 202 | } |
---|
| 203 | |
---|
| 204 | template< class InputIterator1, class InputIterator2, class OutputIterator, class BinFunction > |
---|
| 205 | void zipWith( InputIterator1 b1, InputIterator1 e1, InputIterator2 b2, InputIterator2 e2, OutputIterator out, BinFunction func ) { |
---|
[01aeade] | 206 | while ( b1 != e1 && b2 != e2 ) |
---|
| 207 | *out++ = func(*b1++, *b2++); |
---|
[51b7345] | 208 | } |
---|
| 209 | |
---|
[d939274] | 210 | // it's nice to actually be able to increment iterators by an arbitrary amount |
---|
| 211 | template< typename Iterator > |
---|
| 212 | Iterator operator+(Iterator i, int inc) { |
---|
| 213 | while ( inc > 0 ) { |
---|
| 214 | ++i; |
---|
| 215 | --inc; |
---|
| 216 | } |
---|
| 217 | return i; |
---|
| 218 | } |
---|
| 219 | |
---|
[01aeade] | 220 | #endif // _UTILITY_H |
---|
[51b7345] | 221 | |
---|
[51587aa] | 222 | // Local Variables: // |
---|
| 223 | // tab-width: 4 // |
---|
| 224 | // mode: c++ // |
---|
| 225 | // compile-command: "make install" // |
---|
| 226 | // End: // |
---|