include/realroot/Seq.hpp File Reference

#include <string.h>
#include <vector>
#include <algorithm>
#include <realroot/parser.hpp>
#include <realroot/shared_object.hpp>
#include <realroot/assign.hpp>
#include <realroot/array.hpp>

Go to the source code of this file.

Classes

• struct Seq< C, R >

  Sequence of terms with reference counter. More...
  

• struct ShapeForeachContainerBase
• class ShapeForeachContainer< T >

Namespaces

• namespace mmx
• namespace mmx::let

  Namespace for explicit type conversion.

  
  

Defines

• #define Shape_FOREACH(variable, container)
• #define foreach   Shape_FOREACH

Functions

• template<class C > std::ostream & operator<< (std::ostream &os, const std::vector< C > &V)
• template<class C , class R , class X , class S > void assign (Seq< C, R > &r, const Seq< X, S > &x)
• template<class C , class R , class S > void assign (Seq< C, R > &r, const Seq< C, S > &x)
• template<class C , class R > const C & read (const Seq< C, R > &m, unsigned i)
• template<class C , class R > bool eq (const Seq< C, R > &v1, const Seq< C, R > &v2)
• template<class C , class R > bool neq (const Seq< C, R > &v1, const Seq< C, R > &v2)
• template<class C , class R > unsigned hash (const Seq< C, R > &v)
• template<class C , class R > unsigned soft_hash (const Seq< C, R > &m)
• template<class C , class R > Seq< C, R >::const_iterator iterate (const Seq< C, R > &m)
• template<class C , class R > Seq< C, R > & operator<< (Seq< C, R > &r, const C &x)
• template<class C , class R > bool operator== (const Seq< C, R > &a, const Seq< C, R > &b)
• template<class C , class R > bool operator!= (const Seq< C, R > &a, const Seq< C, R > &b)
• template<class C , class R > std::ostream & operator<< (std::ostream &os, const Seq< C, R > &s)

  Output operator.
  

• template<class C , class R > std::istream & operator>> (std::istream &is, Seq< C, R > &V)
• template<class C , class R > Seq< C, R > operator+ (Seq< C, R > a, const Seq< C, R > &b)
• template<class C , class R > Seq< C, R > adds (Seq< C, R > a, const Seq< C, R > &b)
• template<class C , class R > Seq< C, R > mul (C b, Seq< C, R > a)
• template<class C , class R > Seq< C, R > operator/ (Seq< C, R > a, const C b)
• template<typename T > T * qForeachpointer (const T &)
• template<typename T > ShapeForeachContainer< T > qForeachContainerNew (const T &t)
• template<typename T > const ShapeForeachContainer< T > * qForeachContainer (const ShapeForeachContainerBase *base, const T *)

---

Define Documentation

#define foreach   Shape_FOREACH

Definition at line 410 of file Seq.hpp.

#define Shape_FOREACH	(	variable,
		container		)

Value:

for (const ShapeForeachContainerBase &_container_ = qForeachContainerNew(container); \
          qForeachContainer(&_container_, true ? 0 : qForeachpointer(container))->condition(); \
          ++qForeachContainer(&_container_, true ? 0 : qForeachpointer(container))->i) \
         for (variable = *qForeachContainer(&_container_, true ? 0 : qForeachpointer(container))->i; \
              qForeachContainer(&_container_, true ? 0 : qForeachpointer(container))->brk; \
              --qForeachContainer(&_container_, true ? 0 : qForeachpointer(container))->brk)

Definition at line 399 of file Seq.hpp.