// // Project Name: Kratos // Last Modified by: $Author: pooyan $ // Date: $Date: 2006/01/26 18:50:46 $ // Revision: $Revision: 1.5 $ // // #if !defined(KRATOS_ARRAY_1D_H_INCLUDED ) #define KRATOS_ARRAY_1D_H_INCLUDED // System includes #include #include // External includes #include // Project includes #include "includes/define.h" #include "includes/ublas_interface.h" namespace Kratos { ///@name Kratos Globals ///@{ ///@} ///@name Type Definitions ///@{ ///@} ///@name Enum's ///@{ ///@} ///@name Functions ///@{ ///@} ///@name Kratos Classes ///@{ /// Short class definition. /** Detail class definition. */ template class array_1d : public vector_expression > { public: //#ifndef BOOST_UBLAS_NO_PROXY_SHORTCUTS // BOOST_UBLAS_USING vector_expression >::operator (); //#endif ///@name Type Definitions ///@{ /// Pointer definition of array_1d KRATOS_CLASS_POINTER_DEFINITION(array_1d); typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef T value_type; typedef typename type_traits::const_reference const_reference; typedef T &reference; typedef boost::array array_type; typedef T *pointer; typedef array_1d self_type; #ifndef BOOST_UBLAS_CT_REFERENCE_BASE_TYPEDEFS typedef const vector_const_reference const_closure_type; #else typedef const vector_reference const_closure_type; #endif typedef vector_reference closure_type; typedef self_type vector_temporary_type; typedef dense_tag storage_category; typedef concrete_tag simd_category; ///@} ///@name Life Cycle ///@{ /// Default constructor. BOOST_UBLAS_INLINE array_1d (): vector_expression () { //sin esto no funciona en windows!! //std::fill (data().begin(), data().end(), value_type ()); } explicit BOOST_UBLAS_INLINE array_1d (size_type size): vector_expression () { //sin esto no funciona en windows!! //std::fill (data().begin(), data().end(), value_type ()); /* std::fill (data().begin(), data().end(), value_type ()); */ } explicit BOOST_UBLAS_INLINE array_1d (size_type size, value_type v): vector_expression () { std::fill (data().begin(), data().begin() + size, value_type()); } BOOST_UBLAS_INLINE array_1d (size_type size, const array_type &data): vector_expression (), data_ (data) {} BOOST_UBLAS_INLINE array_1d (const array_1d &v): vector_expression (), data_ (v.data_) {} template BOOST_UBLAS_INLINE array_1d (const vector_expression &ae): vector_expression () { vector_assign (scalar_assign (), *this, ae); } ///@} ///@name Operators ///@{ // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i) const { return data_[i]; } BOOST_UBLAS_INLINE reference operator () (size_type i) { return data_[i]; } BOOST_UBLAS_INLINE const_reference operator [] (size_type i) const { return data_[i]; } BOOST_UBLAS_INLINE reference operator [] (size_type i) { return data_[i]; } // Assignment BOOST_UBLAS_INLINE array_1d &operator = (const array_1d &v) { data_ = v.data_; return *this; } template BOOST_UBLAS_INLINE array_1d &operator = (const vector_expression &ae) { // return assign (self_type (ae)); self_type temporary (ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE array_1d &operator += (const vector_expression &ae) { // return assign (self_type (*this + ae)); self_type temporary (*this + ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE array_1d &operator -= (const vector_expression &ae) { // return assign (self_type (*this - ae)); self_type temporary (*this - ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE array_1d &operator /= (const AT &at) { vector_assign_scalar (scalar_divides_assign (), *this, at); return *this; } ///@} ///@name Operations ///@{ // Resizing BOOST_UBLAS_INLINE void resize (size_type size, bool preserve = true) { if (!preserve) std::fill (data_.begin(), data_.end(), value_type ()); } BOOST_UBLAS_INLINE array_1d &assign_temporary (array_1d &v) { swap (v); return *this; } template BOOST_UBLAS_INLINE array_1d &operator *= (const AT &at) { vector_assign_scalar (scalar_multiplies_assign (), *this, at); return *this; } template BOOST_UBLAS_INLINE array_1d &plus_assign (const vector_expression &ae) { vector_assign (scalar_plus_assign (), *this, ae); return *this; } template BOOST_UBLAS_INLINE array_1d &assign (const vector_expression &ae) { vector_assign (scalar_assign (), *this, ae); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (array_1d &v) { if (this != &v) { data ().swap (v.data ()); } } #ifndef BOOST_UBLAS_NO_MEMBER_FRIENDS BOOST_UBLAS_INLINE friend void swap (array_1d &v1, array_1d &v2) { v1.swap (v2); } #endif // Element insertion and erasure // These functions should work with std::vector. // Thanks to Kresimir Fresl for spotting this. BOOST_UBLAS_INLINE void insert (size_type i, const_reference t) { // FIXME: only works for EqualityComparable value types. // BOOST_UBLAS_CHECK (data () [i] == value_type (0), bad_index ()); // Previously: data ().insert (data ().begin () + i, t); data () [i] = t; } BOOST_UBLAS_INLINE void erase (size_type i) { // Previously: data ().erase (data ().begin () + i); data () [i] = value_type (0); } BOOST_UBLAS_INLINE void clear () { // Previously: data ().clear (); std::fill (data ().begin (), data ().end (), value_type (0)); } ///@} ///@name Access ///@{ // Iterator types private: // Use the storage array1 iterator typedef typename array_type::const_iterator const_iterator_type; typedef typename array_type::iterator iterator_type; public: #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR typedef indexed_iterator iterator; typedef indexed_const_iterator const_iterator; #else class const_iterator; class iterator; #endif // Element lookup BOOST_UBLAS_INLINE const_iterator find (size_type i) const { #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator (*this, data ().begin () + i); #else return const_iterator (*this, i); #endif } BOOST_UBLAS_INLINE iterator find (size_type i) { #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator (*this, data ().begin () + i); #else return iterator (*this, i); #endif } BOOST_UBLAS_INLINE size_type size () const { return N; } template BOOST_UBLAS_INLINE array_1d &minus_assign (const vector_expression &ae) { vector_assign (scalar_minus_assign (), *this, ae); return *this; } BOOST_UBLAS_INLINE const array_type &data () const { return data_; } BOOST_UBLAS_INLINE array_type &data () { return data_; } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator: public container_const_reference, public random_access_iterator_base { public: typedef dense_random_access_iterator_tag iterator_category; #ifdef BOOST_MSVC_STD_ITERATOR typedef const_reference reference; #else typedef typename array_1d::difference_type difference_type; typedef typename array_1d::value_type value_type; typedef typename array_1d::const_reference reference; typedef const typename array_1d::pointer pointer; #endif // Construction and destruction BOOST_UBLAS_INLINE const_iterator (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator (const self_type &v, const const_iterator_type &it): container_const_reference (v), it_ (it) {} BOOST_UBLAS_INLINE #ifndef BOOST_UBLAS_QUALIFIED_TYPENAME const_iterator (const iterator &it): #else const_iterator (const typename self_type::iterator &it): #endif container_const_reference (it ()), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE const_iterator &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE const_iterator &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE const_iterator &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (it_ >= (*this) ().begin ().it_ && it_ < (*this) ().end ().it_, bad_index ()); return *it_; } // Index BOOST_UBLAS_INLINE size_type index () const { BOOST_UBLAS_CHECK (it_ >= (*this) ().begin ().it_ && it_ < (*this) ().end ().it_, bad_index ()); return it_ - (*this) ().begin ().it_; } // Assignment BOOST_UBLAS_INLINE const_iterator &operator = (const const_iterator &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: const_iterator_type it_; friend class iterator; }; #endif #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator: public container_reference, public random_access_iterator_base { public: typedef dense_random_access_iterator_tag iterator_category; #ifndef BOOST_MSVC_STD_ITERATOR typedef typename array_1d::difference_type difference_type; typedef typename array_1d::value_type value_type; typedef typename array_1d::reference reference; typedef typename array_1d::pointer pointer; #endif // Construction and destruction BOOST_UBLAS_INLINE iterator (): container_reference (), it_ () {} BOOST_UBLAS_INLINE iterator (self_type &v, const iterator_type &it): container_reference (v), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE iterator &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE iterator &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE iterator &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (it_ >= (*this) ().begin ().it_ && it_ < (*this) ().end ().it_ , bad_index ()); return *it_; } // Index BOOST_UBLAS_INLINE size_type index () const { BOOST_UBLAS_CHECK (it_ >= (*this) ().begin ().it_ && it_ < (*this) ().end ().it_ , bad_index ()); return it_ - (*this) ().begin ().it_; } // Assignment BOOST_UBLAS_INLINE iterator &operator = (const iterator &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: iterator_type it_; friend class const_iterator; }; #endif BOOST_UBLAS_INLINE const_iterator begin () const { return find (0); } BOOST_UBLAS_INLINE const_iterator end () const { return find (data_.size ()); } BOOST_UBLAS_INLINE iterator begin () { return find (0); } BOOST_UBLAS_INLINE iterator end () { return find (data_.size ()); } // Reverse iterator #ifdef BOOST_MSVC_STD_ITERATOR typedef reverse_iterator_base const_reverse_iterator; #else typedef reverse_iterator_base const_reverse_iterator; #endif BOOST_UBLAS_INLINE const_reverse_iterator rbegin () const { return const_reverse_iterator (end ()); } BOOST_UBLAS_INLINE const_reverse_iterator rend () const { return const_reverse_iterator (begin ()); } #ifdef BOOST_MSVC_STD_ITERATOR typedef reverse_iterator_base reverse_iterator; #else typedef reverse_iterator_base reverse_iterator; #endif BOOST_UBLAS_INLINE reverse_iterator rbegin () { return reverse_iterator (end ()); } BOOST_UBLAS_INLINE reverse_iterator rend () { return reverse_iterator (begin ()); } ///@} ///@name Inquiry ///@{ ///@} ///@name Input and output ///@{ ///@} ///@name Friends ///@{ ///@} protected: ///@name Protected static Member Variables ///@{ ///@} ///@name Protected member Variables ///@{ ///@} ///@name Protected Operators ///@{ ///@} ///@name Protected Operations ///@{ ///@} ///@name Protected Access ///@{ ///@} ///@name Protected Inquiry ///@{ ///@} ///@name Protected LifeCycle ///@{ ///@} private: ///@name Static Member Variables ///@{ ///@} ///@name Member Variables ///@{ array_type data_; ///@} ///@name Private Operators ///@{ ///@} ///@name Private Operations ///@{ ///@} ///@name Private Access ///@{ ///@} ///@name Private Inquiry ///@{ ///@} ///@name Un accessible methods ///@{ ///@} }; // Class array_1d ///@} ///@name Type Definitions ///@{ ///@} ///@name Input and output ///@{ ///@} } // namespace Kratos. #endif // KRATOS_ARRAY_1D_H_INCLUDED defined