PlayaBlockIteratorDecl.hpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                 Playa: Programmable Linear Algebra
00005 //                 Copyright 2012 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
00041 
00042 #ifndef PLAYA_BLOCKITERATORDECL_HPP
00043 #define PLAYA_BLOCKITERATORDECL_HPP
00044 
00045 #include "PlayaDefs.hpp"
00046 #include "Teuchos_Array.hpp"
00047 #include <deque> 
00048 
00049 namespace Playa
00050 {
00051 
00052 using Teuchos::RCP;
00053 using Teuchos::Array;
00054 
00055 /* Forward declare VectorSpaceBase */
00056 template <class Scalar> 
00057 class VectorSpaceBase;
00058 
00059 /* Forward declare VectorSpace */
00060 template <class Scalar> 
00061 class VectorSpace;
00062 
00063 /* Forward declare Vector */
00064 template <class Scalar> 
00065 class Vector;
00066 
00067 
00068 /** 
00069  * BlockIterator can locate a block within an arbitrarily nested block
00070  * vector space.
00071  */
00072 template <class Scalar>
00073 class BlockIterator
00074 {
00075 public:
00076 
00077   friend class VectorSpaceBase<Scalar>;
00078   friend class VectorSpace<Scalar>;
00079   friend class Vector<Scalar>;
00080 
00081   /** Empty ctor */
00082   BlockIterator() : space_(),
00083                     index_(), 
00084                     atEnd_(true){}
00085 
00086   /** Compare two iterators */
00087   bool operator==(const BlockIterator<Scalar>& other) const ;
00088 
00089   /** Compare two iterators */
00090   bool operator!=(const BlockIterator<Scalar>& other) const 
00091     {
00092       return !operator==(other);
00093     }
00094 
00095   /** Compare two iterators */
00096   bool operator<(const BlockIterator<Scalar>& other) const ;
00097 
00098   /** Advance the block iterator */
00099   BlockIterator<Scalar> operator++(int);
00100 
00101   /** */
00102   const VectorSpace<Scalar>& space() const ;
00103   
00104   /** Print the iterator */
00105   std::ostream& print(std::ostream& os) const ;
00106 
00107   /** */
00108   const std::deque<int>& blockIndex() const {return index_;}
00109 
00110   /** */
00111   bool atEnd() const {return atEnd_;}
00112 
00113   /** Set to true (by doing BlockIterator<Scalar>::debug()=true) to
00114    * trace the iterator */
00115   static bool& debug() 
00116     {static bool rtn = false; return rtn;}
00117 
00118 protected:
00119 
00120   /** Build an index pointing to the leftmost entry in the 
00121    * given block space */
00122   void goToStart(const VectorSpace<Scalar>& space,
00123     std::deque<int>& pos) const ;
00124 
00125   /** Constructor is private: the construction is always done inside
00126    * the begin and end methods of vector space. */
00127   BlockIterator(const VectorSpace<Scalar>& space,
00128     bool atEnd);
00129 
00130   /** Advance the index at the specified level. Return false if
00131    * no further advance is possible */
00132   bool advance(int level);
00133 
00134 private:
00135   /** Store the VC in an RCP so we can do forward declaration of VS */
00136   RCP<const VectorSpace<Scalar> > space_;
00137   std::deque<int> index_;
00138   bool atEnd_;
00139 };
00140 
00141 }
00142 
00143 namespace Playa
00144 {
00145 /** \relates BlockIterator */
00146 template <class Scalar> inline
00147 std::ostream& operator<<(std::ostream& os, 
00148   const Playa::BlockIterator<Scalar>& i)
00149 {
00150   return i.print(os);
00151 }
00152 }
00153 
00154 
00155 #endif

Site Contact