|
1
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 |
/*
* Copyright (c) 2012, Michael Lehn, Klaus Pototzky * * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1) Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2) Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * 3) Neither the name of the FLENS development group nor the names of * its contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef FLENS_STORAGE_PACKEDSTORAGE_PACKEDSTORAGEVIEW_TCC #define FLENS_STORAGE_PACKEDSTORAGE_PACKEDSTORAGEVIEW_TCC #include <flens/auxiliary/auxiliary.h> #include <flens/storage/packedstorage/packedstorageview.h> #include <flens/typedefs.h> namespace flens { template <typename T, StorageOrder Order, typename I, typename A> PackedStorageView<T, Order, I, A>::PackedStorageView(IndexType dim, ElementType *data, IndexType indexBase, const Allocator &allocator) : _data(data), _allocator(allocator), _dim(dim), _indexBase(0) { ASSERT(_dim>=0); changeIndexBase(indexBase); } template <typename T, StorageOrder Order, typename I, typename A> template <typename ARRAY> PackedStorageView<T, Order, I, A>::PackedStorageView(IndexType dim, ARRAY &array, IndexType indexBase, const Allocator &allocator) : _data(array.data()), _allocator(allocator), _dim(dim), _indexBase(0) { ASSERT((dim*(dim+1))/2<=array.length()); ASSERT(_dim>=0); changeIndexBase(indexBase); } template <typename T, StorageOrder Order, typename I, typename A> PackedStorageView<T,Order,I,A>::PackedStorageView(const PackedStorageView &rhs) : _data(rhs._data), _allocator(rhs._allocator), _dim(rhs._dim), _indexBase(rhs._indexBase) { } template <typename T, StorageOrder Order, typename I, typename A> template <typename RHS> PackedStorageView<T, Order, I, A>::PackedStorageView(RHS &rhs) : _data(rhs.data()), _allocator(rhs.allocator()), _dim(rhs.dim()), _indexBase(0) { changeIndexBase(rhs.indexBase()); } template <typename T, StorageOrder Order, typename I, typename A> PackedStorageView<T, Order, I, A>::~PackedStorageView() { } //-- operators ----------------------------------------------------------------- template <typename T, StorageOrder Order, typename I, typename A> const typename PackedStorageView<T, Order, I, A>::ElementType & PackedStorageView<T, Order, I, A>::operator()(StorageUpLo upLo, IndexType row, IndexType col) const { # ifndef NDEBUG ASSERT(row>=indexBase()); ASSERT(col>=indexBase()); ASSERT(row<=indexBase()+dim()-1); ASSERT(col<=indexBase()+dim()-1); if (dim()) { if (upLo==Lower) { ASSERT(row>=col); } else { ASSERT(col>=row); } } # endif const IndexType i = row - _indexBase; const IndexType j = col - _indexBase; const IndexType n = _dim; if ((order==RowMajor) && (upLo==Upper)) { return _data[j+i*(2*n-i-1)/2]; } if ((order==RowMajor) && (upLo==Lower)) { return _data[j+i*(i+1)/2]; } if ((order==ColMajor) && (upLo==Upper)) { return _data[i+j*(j+1)/2]; } return _data[i+j*(2*n-j-1)/2]; } template <typename T, StorageOrder Order, typename I, typename A> typename PackedStorageView<T, Order, I, A>::ElementType & PackedStorageView<T, Order, I, A>::operator()(StorageUpLo upLo, IndexType row, IndexType col) { # ifndef NDEBUG ASSERT(row>=indexBase()); ASSERT(col>=indexBase()); ASSERT(row<=indexBase()+dim()-1); ASSERT(col<=indexBase()+dim()-1); if (dim()) { if (upLo==Lower) { ASSERT(row>=col); } else { ASSERT(col>=row); } } # endif const IndexType i = row - _indexBase; const IndexType j = col - _indexBase; const IndexType n = _dim; if ((order==RowMajor) && (upLo==Upper)) { return _data[j+i*(2*n-i-1)/2]; } if ((order==RowMajor) && (upLo==Lower)) { return _data[j+i*(i+1)/2]; } if ((order==ColMajor) && (upLo==Upper)) { return _data[i+j*(j+1)/2]; } return _data[i+j*(2*n-j-1)/2]; } //-- methods ------------------------------------------------------------------- template <typename T, StorageOrder Order, typename I, typename A> typename PackedStorageView<T, Order, I, A>::IndexType PackedStorageView<T, Order, I, A>::indexBase() const { return _indexBase; } template <typename T, StorageOrder Order, typename I, typename A> typename PackedStorageView<T, Order, I, A>::IndexType PackedStorageView<T, Order, I, A>::numNonZeros() const { return _dim*(_dim+1)/IndexType(2); } template <typename T, StorageOrder Order, typename I, typename A> typename PackedStorageView<T, Order, I, A>::IndexType PackedStorageView<T, Order, I, A>::dim() const { return _dim; } template <typename T, StorageOrder Order, typename I, typename A> const typename PackedStorageView<T, Order, I, A>::ElementType * PackedStorageView<T, Order, I, A>::data() const { return _data; } template <typename T, StorageOrder Order, typename I, typename A> typename PackedStorageView<T, Order, I, A>::ElementType * PackedStorageView<T, Order, I, A>::data() { return _data; } template <typename T, StorageOrder Order, typename I, typename A> const typename PackedStorageView<T, Order, I, A>::Allocator & PackedStorageView<T, Order, I, A>::allocator() const { return _allocator; } template <typename T, StorageOrder Order, typename I, typename A> bool PackedStorageView<T, Order, I, A>::resize(IndexType DEBUG_VAR(_dim), IndexType indexBase, const ElementType &) { ASSERT(_dim==dim()); changeIndexBase(indexBase); return false; } template <typename T, StorageOrder Order, typename I, typename A> bool PackedStorageView<T, Order, I, A>::fill(const ElementType &value) { std::fill_n(data(), numNonZeros(), value); return true; } template <typename T, StorageOrder Order, typename I, typename A> void PackedStorageView<T, Order, I, A>::changeIndexBase(IndexType indexBase) { _indexBase = indexBase; } } // namespace flens #endif // FLENS_STORAGE_PACKEDSTORAGE_PACKEDSTORAGEVIEW_TCC |