FEI Version of the Day
snl_fei_RaggedTable_specialize.cpp
00001 /*
00002 // @HEADER
00003 // ************************************************************************
00004 //             FEI: Finite Element Interface to Linear Solvers
00005 //                  Copyright (2005) Sandia Corporation.
00006 //
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, the
00008 // 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 Alan Williams (william@sandia.gov) 
00038 //
00039 // ************************************************************************
00040 // @HEADER
00041 */
00042 
00043 
00044 #include <fei_macros.hpp>
00045 #include <snl_fei_RaggedTable_specialize.hpp>
00046 
00047 namespace snl_fei {
00048 
00050 RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >::RaggedTable(int firstKey, int lastKey)
00051   : map_(firstKey, lastKey),
00052     poolAllocatorSet_(),
00053     dummy()
00054 {
00055   int len = lastKey-firstKey+1;
00056   if (len > 0) {
00057     map_type::value_type val;
00058     for(int i=0; i<len; ++i) {
00059       val.first = firstKey+i;
00060       row_type* row = poolAllocatorSet_.allocate(1);
00061       poolAllocatorSet_.construct(row,dummy);
00062       val.second = row;
00063       map_.insert(val);
00064     }
00065   }
00066 }
00067 
00068 RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >::RaggedTable(const RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >& src)
00069  : map_(src.map_),
00070    poolAllocatorSet_()
00071 {
00072 }
00073 
00074 void RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >::addIndices(int row,
00075                              int numIndices,
00076                              const int* indices)
00077 {
00078   iterator m_end = map_.end();
00079   iterator m_iter = map_.lower_bound(row);
00080 
00081   map_type::mapped_type mapped_indices = (*m_iter).second;
00082 
00083   if (mapped_indices == NULL) {
00084     throw std::runtime_error("RaggedTable<MapContig>, NULL row.");
00085   }
00086 
00087   for(int i=0; i<numIndices; ++i) {
00088     mapped_indices->insert2(indices[i]);
00089   }
00090 }
00091 
00092 void
00093 RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >::addIndices(int numRows,
00094                              const int* rows,
00095                              int numIndices,
00096                              const int* indices)
00097 {
00098   iterator m_end = map_.end();
00099   map_type::mapped_type mapped_indices = NULL;
00100 
00101   for(int i=0; i<numRows; ++i) {
00102     int row = rows[i];
00103     iterator m_iter = map_.lower_bound(row);
00104 
00105     mapped_indices = (*m_iter).second;
00106     if (mapped_indices == NULL) {
00107       throw std::runtime_error("RaggedTable<MapContig>, NULL row.");
00108     }
00109 
00110     for(int j=0; j<numIndices; ++j) {
00111       mapped_indices->insert2(indices[j]);
00112     }
00113   }
00114 }
00115 
00116 void RaggedTable<MapContig<fei::ctg_set<int>*>,fei::ctg_set<int> >::addDiagonals(int numIndices,
00117                                                          const int* indices)
00118 {
00119   for(int i=0; i<numIndices; ++i) {
00120     int ind = indices[i];
00121     addIndices(ind, 1, &ind);
00122   }
00123 }
00124 
00125 }//namespace snl_fei
00126 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends