Lunchbox  1.6.0
Classes | Defines | Functions
stdExt.h File Reference

Include extensions to the STL and define a uniform interface to them. More...

#include <lunchbox/compiler.h>
#include <lunchbox/uint128_t.h>
#include <algorithm>
#include <string>
#include <vector>
#include <hash_map>
#include <hash_set>
+ Include dependency graph for stdExt.h:
+ This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  hash< lunchbox::uint128_t >
 std::string hash function. More...

Defines

#define LB_STDEXT_STD
#define LB_STDEXT_NAMESPACE_OPEN   namespace std {
#define LB_STDEXT_NAMESPACE_CLOSE   }

Functions

template<typename C >
void usort (C &c)
 MSVC.
template<typename T >
std::vector< T >::iterator find (std::vector< T > &container, const T &element)
 Find the element in the given vector.
template<typename T >
std::vector< T >::const_iterator find (const std::vector< T > &container, const T &element)
 Find the element in the given vector.
template<typename T , typename P >
std::vector< T >::iterator find_if (std::vector< T > &container, const P &predicate)
 Find the element matching the predicate.
template<typename T , typename P >
std::vector< T >::const_iterator find_if (std::vector< const T > &container, const P &predicate)
 Find the element matching the predicate.

Detailed Description

Include extensions to the STL and define a uniform interface to them.

Definition in file stdExt.h.


Function Documentation

template<typename T >
std::vector< T >::iterator find ( std::vector< T > &  container,
const T &  element 
)

Find the element in the given vector.

Version:
1.0

Definition at line 213 of file stdExt.h.

Referenced by find().

+ Here is the caller graph for this function:

template<typename T >
std::vector< T >::const_iterator find ( const std::vector< T > &  container,
const T &  element 
)

Find the element in the given vector.

Version:
1.0

Definition at line 218 of file stdExt.h.

References find().

+ Here is the call graph for this function:

template<typename T , typename P >
std::vector< T >::iterator find_if ( std::vector< T > &  container,
const P &  predicate 
)

Find the element matching the predicate.

Version:
1.0

Definition at line 223 of file stdExt.h.

Referenced by find_if().

+ Here is the caller graph for this function:

template<typename T , typename P >
std::vector<T>::const_iterator find_if ( std::vector< const T > &  container,
const P &  predicate 
)

Find the element matching the predicate.

Version:
1.0

Definition at line 228 of file stdExt.h.

References find_if().

+ Here is the call graph for this function:

template<typename C >
void usort ( C &  c)

MSVC.

Uniquely sorts and eliminates duplicates in a STL container.

Version:
1.0

Definition at line 205 of file stdExt.h.