s_baltst::BasicSchemaUtil_AlgorithmUtil Struct Reference

#include <s_baltst_basicschemautil.h>

Static Public Member Functions
template<class SEQUENCE_CONTAINER >
static void	eraseToEnd (SEQUENCE_CONTAINER *container, typename SEQUENCE_CONTAINER::iterator position)
template<class INPUT_ITERATOR , class TRANSFORM >
static INPUT_ITERATOR	forEach (INPUT_ITERATOR first, INPUT_ITERATOR last, TRANSFORM transform)

Member Function Documentation

eraseToEnd()

template<class SEQUENCE_CONTAINER >

void s_baltst::BasicSchemaUtil_AlgorithmUtil::eraseToEnd ( SEQUENCE_CONTAINER *  container, typename SEQUENCE_CONTAINER::iterator  position  )

static

Erase all of the elements in the specified container from the specified position iterator to the end of the container, as if by container->erase(position, container.end()). The behavior is undefined unless container->erase(position, container.end()) is well-formed.

forEach()

template<class INPUT_ITERATOR , class TRANSFORM >

INPUT_ITERATOR s_baltst::BasicSchemaUtil_AlgorithmUtil::forEach ( INPUT_ITERATOR  first, INPUT_ITERATOR  last, TRANSFORM  transform  )

static

Invoke the specified transform on each object in the range specified by [first, last) and return an input iterator equal to last.

---

The documentation for this struct was generated from the following file:

• s_baltst_basicschemautil.h