/usr/include/shark/Data/BatchInterface.h is in libshark-dev 3.1.3+ds1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 | /*!
*
*
* \brief Defines the Batch Interface for a type, e.g., for every type a container with optimal structure.
*
*
*
* \author O.Krause
* \date 2012
*
*
* \par Copyright 1995-2015 Shark Development Team
*
* <BR><HR>
* This file is part of Shark.
* <http://image.diku.dk/shark/>
*
* Shark is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Shark is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Shark. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef SHARK_DATA_BATCHINTERFACE_H
#define SHARK_DATA_BATCHINTERFACE_H
#include <shark/LinAlg/Base.h>
#include <shark/Core/utility/Iterators.h>
#include <boost/preprocessor.hpp>
#include <boost/type_traits/is_arithmetic.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/utility/enable_if.hpp>
#include <boost/range/algorithm_ext/iota.hpp>
#include <boost/mpl/if.hpp>
namespace shark{
namespace detail{
/// \brief default implementation of the Batch which maps it's type on std::vector<T>
template<class T>
struct DefaultBatch{
/// \brief Type of a single element.
typedef T& reference;
/// \brief Type of a single immutable element.
typedef T const& const_reference;
/// \brief Type of a batch of elements.
typedef std::vector<T> type;
/// \brief The type of the elements stored in the batch
typedef T value_type;
/// \brief the iterator type of the object
typedef typename type::iterator iterator;
/// \brief the const_iterator type of the object
typedef typename type::const_iterator const_iterator;
///\brief creates a batch able to store elements of the structure of input (e.g. same dimensionality)
static type createBatch(T const& input, std::size_t size = 1){
return type(size,input);
}
///\brief creates a batch storing the elements referenced by the provided range
template<class Range>
static type createBatchFromRange(Range const& range){
return type(range.begin(),range.end());
}
static void resize(type& batch, std::size_t batchSize, std::size_t elements){
batch.resize(batchSize);
}
};
/// \brief default implementation of the Batch for arithmetic types, which are mapped on shark::blas::vector<T>
template<class T>
struct ArithmeticBatch{
/// \brief Type of a single element.
typedef T& reference;
/// \brief Type of a single immutable element.
typedef T const& const_reference;
/// \brief Type of a batch of elements.
typedef shark::blas::vector<T> type;
/// \brief The type of the elements stored in the batch
typedef T value_type;
/// \brief the iterator type of the object
typedef typename type::iterator iterator;
/// \brief the const_iterator type of the object
typedef typename type::const_iterator const_iterator;
///\brief creates a batch which can storne size numbers of type T
static type createBatch(T const& input, std::size_t size = 1){
return type(size,input);
}
///\brief creates a batch storing the elements referenced by the provided range
template<class Range>
static type createBatchFromRange(Range const& range){
type batch(range.size());
std::copy(range.begin(),range.end(),batch.begin());
return batch;
}
static void resize(type& batch, std::size_t batchSize, std::size_t elements){
ensure_size(batch,batchSize);
}
};
///\brief Wrapper for a matrix row, which offers a conversion operator to
/// to the Vector Type.
template<class Matrix, class Vector>
class MatrixRowReference: public blas::temporary_proxy<blas::matrix_row<Matrix> >{
private:
typedef blas::temporary_proxy<blas::matrix_row<Matrix> > base_type;
public:
MatrixRowReference( Matrix& matrix, std::size_t i)
:base_type(blas::matrix_row<Matrix>(matrix,i)){}
template<class T>//special version allows for const-conversion
MatrixRowReference(T const& matrixrow)
:base_type(blas::matrix_row<Matrix>(matrixrow.expression().expression(),matrixrow.index())){}
template<class T>
const MatrixRowReference& operator=(const T& argument){
static_cast<base_type&>(*this)=argument;
return *this;
}
operator Vector(){
return Vector(*this);
}
};
template<class M, class V>
void swap(MatrixRowReference<M,V> ref1, MatrixRowReference<M,V> ref2){
swap_rows(ref1.expression().expression(),ref1.index(),ref2.expression().expression(),ref2.index());
}
}
///\brief class which helps using different batch types
///
/// e.g. creating a batch of a single element or returning a single element
/// when the element type is arithmetic, like int,double, std::complex,...
/// the return value will be a linear algebra compatible vector, like RealVector.
/// If it is not, for example a string, the return value will be a std::vector<T>.
template<class T>
//see detail above for implementations, we just choose the correct implementations based on
//whether T is arithmetic or not
struct Batch
:public boost::mpl::if_<
boost::is_arithmetic<T>,
detail::ArithmeticBatch<T>,
detail::DefaultBatch<T>
>::type{};
///\brief creates a batch from a range of inputs
template<class T, class Range>
typename Batch<T>::type createBatch(Range const& range){
return Batch<T>::createBatchFromRange(range);
}
template< class Range>
typename Batch<typename Range::value_type>::type createBatch(Range const& range){
return Batch<typename Range::value_type>::createBatchFromRange(range);
}
/// \cond
/// \brief specialization for vectors which should be matrices in batch mode!
template<class T>
struct Batch<blas::vector<T> >{
/// \brief Type of a batch of elements.
typedef shark::blas::matrix<T> type;
/// \brief The type of the elements stored in the batch
typedef blas::vector<T> value_type;
/// \brief Reference to a single element.
typedef detail::MatrixRowReference<type,value_type> reference;
/// \brief Reference to a single immutable element.
typedef detail::MatrixRowReference<const type,value_type> const_reference;
/// \brief the iterator type of the object
typedef ProxyIterator<type, value_type,reference > iterator;
/// \brief the const_iterator type of the object
typedef ProxyIterator<const type, value_type, const_reference > const_iterator;
///\brief creates a batch with input as size blueprint
template<class Element>
static type createBatch(Element const& input, std::size_t size = 1){
return type(size,input.size());
}
///\brief creates a batch storing the elements referenced by the provided range
template<class Range>
static type createBatchFromRange(Range const& range){
type batch(range.size(),range.begin()->size());
std::copy(range.begin(),range.end(),boost::begin(batch));
return batch;
}
static void resize(type& batch, std::size_t batchSize, std::size_t elements){
ensure_size(batch,batchSize,elements);
}
};
/// \brief specialization for ublas compressed vectors which are compressed matrices in batch mode!
template<class T>
struct Batch<shark::blas::compressed_vector<T> >{
/// \brief Type of a batch of elements.
typedef shark::blas::compressed_matrix<T> type;
/// \brief The type of the elements stored in the batch
typedef shark::blas::compressed_vector<T> value_type;
/// \brief Type of a single element.
//typedef shark::blas::matrix_row<type> reference;
typedef detail::MatrixRowReference<type,value_type> reference;
/// \brief Type of a single immutable element.
//typedef shark::blas::matrix_row<const type> const_reference;
typedef detail::MatrixRowReference<const type,value_type> const_reference;
/// \brief the iterator type of the object
typedef ProxyIterator<type, value_type, reference > iterator;
/// \brief the const_iterator type of the object
typedef ProxyIterator<const type, value_type, const_reference > const_iterator;
///\brief creates a batch with input as size blueprint
template<class Element>
static type createBatch(Element const& input, std::size_t size = 1){
return type(size,input.size());
}
///\brief creates a batch storing the elements referenced by the provided range
template<class Range>
static type createBatchFromRange(Range const& range){
//before creating the batch, we need the number of nonzero elements
std::size_t nonzeros = 0;
for(typename Range::const_iterator pos = range.begin(); pos != range.end(); ++pos){
nonzeros += pos->nnz();
}
type batch(range.size(),range.begin()->size(),nonzeros);
std::copy(range.begin(),range.end(),boost::begin(batch));
return batch;
}
static void resize(type& batch, std::size_t batchSize, std::size_t elements){
ensure_size(batch,batchSize,elements);
}
};
/// \brief specialization for blas::matrix which become blas::matrix_set in batch mode!
template<class T>
struct Batch<blas::matrix<T> >{
/// \brief Type of a batch of elements.
typedef shark::blas::matrix_set<blas::matrix<T> > type;
/// \brief The type of the elements stored in the batch
typedef blas::matrix<T> value_type;
/// \brief Reference to a single element.
typedef typename type::reference reference;
/// \brief Reference to a single immutable element.
typedef typename type::const_reference const_reference;
/// \brief the iterator type of the object
typedef typename type::iterator iterator;
/// \brief the const_iterator type of the object
typedef typename type::const_iterator const_iterator;
///\brief creates a batch with input as size blueprint
template<class Element>
static type createBatch(Element const& input, std::size_t size = 1){
return type(size,input);
}
///\brief creates a batch storing the elements referenced by the provided range
template<class Range>
static type createBatchFromRange(Range const& range){
type batch(range.size());
std::copy(range.begin(),range.end(),batch.begin());
return batch;
}
//~ static void resize(type& batch, std::size_t batchSize, std::size_t elements){
//~ ensure_size(batch,batchSize,elements);
//~ }
};
}
//template specialization for boost::matrices so that they offer the iterator interface
namespace boost{
//first the typedefs which tell boost::range which iterators to use. this needs to be done for all
//supported matrix types separately as well as for the matrix_container/matrix_expression base type
//dense matrix
template< class T >
struct range_mutable_iterator< shark::blas::matrix<T> >{
typedef shark::blas::vector<T> Vector;
typedef typename shark::Batch<Vector>::iterator type;
};
template< class T >
struct range_const_iterator< shark::blas::matrix<T> >{
typedef shark::blas::vector<T> Vector;
typedef typename shark::Batch<Vector>::const_iterator type;
};
//compressed matrix
template< class T >
struct range_mutable_iterator< shark::blas::compressed_matrix<T> >{
typedef shark::blas::compressed_vector<T> Vector;
typedef typename shark::Batch<Vector>::iterator type;
};
template< class T >
struct range_const_iterator< shark::blas::compressed_matrix<T> >{
typedef shark::blas::compressed_vector<T> Vector;
typedef typename shark::Batch<Vector>::const_iterator type;
};
//matrix container
template< class M >
struct range_mutable_iterator< shark::blas::matrix_container<M> >{
typedef typename range_mutable_iterator<M>::type type;
};
template< class M >
struct range_const_iterator< shark::blas::matrix_container<M> >{
typedef typename range_const_iterator<M>::type type;
};
//matrix expression
template< class M >
struct range_mutable_iterator< shark::blas::matrix_expression<M> >{
typedef typename range_mutable_iterator<M>::type type;
};
template< class M >
struct range_const_iterator< shark::blas::matrix_expression<M> >{
typedef typename range_const_iterator<M>::type type;
};
//matrix proxy
template< class T >
struct range_mutable_iterator< shark::blas::dense_matrix_adaptor<T> >{
typedef shark::blas::vector<typename boost::remove_const<T>::type> Vector;
typedef shark::detail::MatrixRowReference<shark::blas::dense_matrix_adaptor<T>,Vector> reference;
typedef shark::ProxyIterator<shark::blas::dense_matrix_adaptor<T>, Vector, reference > type;
};
template< class T >
struct range_const_iterator< shark::blas::dense_matrix_adaptor<T> >{
typedef shark::blas::vector<typename boost::remove_const<T>::type> Vector;
typedef shark::detail::MatrixRowReference<shark::blas::dense_matrix_adaptor<T> const,Vector> reference;
typedef shark::ProxyIterator<shark::blas::dense_matrix_adaptor<T> const, Vector, reference > type;
};
}
namespace shark{ namespace blas{
//dense matrix
template< class T >
typename boost::range_iterator<matrix<T> const>::type
range_begin( matrix<T> const& m )
{
typedef typename boost::range_iterator<matrix<T> const>::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<matrix<T> >::type
range_begin( matrix<T>& m )
{
typedef typename boost::range_iterator<matrix<T> >::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<matrix<T> const>::type
range_end( matrix<T> const& m )
{
typedef typename boost::range_iterator<matrix<T> const>::type Iter;
return Iter(m,m.size1());
}
template< class T >
typename boost::range_iterator<matrix<T> >::type
range_end( matrix<T>& m )
{
typedef typename boost::range_iterator<matrix<T> >::type Iter;
return Iter(m,m.size1());
}
//compressed matrix
template< class T >
typename boost::range_iterator<compressed_matrix<T> const>::type
range_begin( compressed_matrix<T> const& m )
{
typedef typename boost::range_iterator<compressed_matrix<T> const>::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<compressed_matrix<T> >::type
range_begin( compressed_matrix<T>& m )
{
typedef typename boost::range_iterator<compressed_matrix<T> >::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<compressed_matrix<T> const>::type
range_end( compressed_matrix<T> const& m )
{
typedef typename boost::range_iterator<compressed_matrix<T> const>::type Iter;
return Iter(m,m.size1());
}
template< class T >
typename boost::range_iterator<compressed_matrix<T> >::type
range_end( compressed_matrix<T>& m )
{
typedef typename boost::range_iterator<compressed_matrix<T> >::type Iter;
return Iter(m,m.size1());
}
//matrix_container
template< class M >
typename boost::range_iterator<M const>::type
range_begin( matrix_container<M> const& m )
{
return range_begin(m());
}
template< class M >
typename boost::range_iterator<M>::type
range_begin( matrix_container<M>& m )
{
return range_begin(m());
}
template< class M >
typename boost::range_iterator<M const>::type
range_end( matrix_container<M> const& m )
{
return range_end(m());
}
template< class M >
typename boost::range_iterator<M>::type
range_end( matrix_container<M>& m )
{
return range_end(m());
}
//matrix_expression
template< class M >
typename boost::range_iterator<M const>::type
range_begin( matrix_expression<M> const& m )
{
return range_begin(m());
}
template< class M >
typename boost::range_iterator<M>::type
range_begin( matrix_expression<M>& m )
{
return range_begin(m());
}
template< class M >
typename boost::range_iterator<M const>::type
range_end( matrix_expression<M> const& m )
{
return range_end(m());
}
template< class M >
typename boost::range_iterator<M>::type
range_end( matrix_expression<M>& m )
{
return range_end(m());
}
//dense matrix proxy
template< class T >
typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> const>::type
range_begin( shark::blas::dense_matrix_adaptor<T> const& m )
{
typedef typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> const>::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> >::type
range_begin( shark::blas::dense_matrix_adaptor<T>& m )
{
typedef typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> >::type Iter;
return Iter(m,0);
}
template< class T >
typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> const>::type
range_end( shark::blas::dense_matrix_adaptor<T> const& m )
{
typedef typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> const>::type Iter;
return Iter(m,m.size1());
}
template< class T >
typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> >::type
range_end( shark::blas::dense_matrix_adaptor<T>& m )
{
typedef typename boost::range_iterator<shark::blas::dense_matrix_adaptor<T> >::type Iter;
return Iter(m,m.size1());
}
/// \endcond
}}
#endif
|