SLIP
1.4
|
Provides a class to manipulate 2d static and generic arrays. More...
#include <iostream>
#include <iterator>
#include <cassert>
#include <string>
#include <cstddef>
#include "Box2d.hpp"
#include "Point2d.hpp"
#include "DPoint2d.hpp"
#include "Range.hpp"
#include "kstride_iterator.hpp"
#include "stride_iterator.hpp"
#include "iterator2d_box.hpp"
#include "iterator2d_range.hpp"
#include <boost/serialization/access.hpp>
#include <boost/serialization/split_member.hpp>
#include <boost/serialization/string.hpp>
#include <boost/serialization/complex.hpp>
#include <boost/serialization/version.hpp>
Go to the source code of this file.
Classes | |
class | slip::kstride_iterator< T, NC > |
class | slip::iterator2d_box< T > |
This is some iterator to iterate a 2d container into a slip::Box2d area defined by the indices of the 2d container. More... | |
class | slip::iterator2d_range< T > |
This is some iterator to iterate a 2d container into two Range defined by the indices and strides of the 2d container. More... | |
class | slip::const_iterator2d_box< T > |
This is some iterator to iterate a 2d container into a Box area defined by the indices of the 2d container. More... | |
class | slip::const_iterator2d_range< T > |
This is some iterator to iterate a 2d container into two Range defined by the indices and strides of the 2d container. More... | |
class | slip::DPoint2d< T > |
Difference of Point2D class, specialization of DPoint<CoordType,DIM> with DIM = 2. More... | |
class | slip::Point2d< T > |
This is a point2d class, a specialized version of Point<CoordType,DIM> with DIM = 2. More... | |
struct | slip::block2d< T, NR, NC > |
This is a two-dimensional static and generic container. This container statisfies the BidirectionnalContainer concepts of the STL. It is also an 2d extension of the RandomAccessContainer concept. That is to say the bracket element access is replaced by the double bracket element access. More... | |
struct | slip::block2d< T, NR, NC > |
This is a two-dimensional static and generic container. This container statisfies the BidirectionnalContainer concepts of the STL. It is also an 2d extension of the RandomAccessContainer concept. That is to say the bracket element access is replaced by the double bracket element access. More... | |
Namespaces | |
slip | |
This namespace corresponds to the kernel of the Simple Library on Image Processing (SLIP). That is to say that it contains the data structures and the algorithms needed by these data strucutres. | |
Functions | |
input/output operators | |
template<typename T , std::size_t NR, std::size_t NC> | |
std::ostream & | slip::operator<< (std::ostream &out, const slip::block2d< T, NR, NC > &b) |
EqualityComparable functions | |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator== (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator!= (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
LessThanComparable functions | |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator< (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator> (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator<= (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
template<typename T , std::size_t NR, std::size_t NC> | |
bool | slip::operator>= (const slip::block2d< T, NR, NC > &x, const slip::block2d< T, NR, NC > &y) |
Provides a class to manipulate 2d static and generic arrays.
Definition in file Block2d.hpp.