Honeycomb  0.1
Component-Model Framework
Typedefs | Functions
honey::stdutil Namespace Reference

See Standard Util. More...

Typedefs

template<class Key , class Value , template< class > class Alloc>
using unordered_map = std::unordered_map< Key, Value, std::hash< Key >, std::equal_to< Key >, Alloc< pair< const Key, Value >>>
 std::unordered_map with custom allocator More...
 
template<class Key , class Value , template< class > class Alloc>
using unordered_multimap = std::unordered_multimap< Key, Value, std::hash< Key >, std::equal_to< Key >, Alloc< pair< const Key, Value >>>
 std::unordered_multimap with custom allocator More...
 
template<class Key , template< class > class Alloc>
using unordered_set = std::unordered_set< Key, std::hash< Key >, std::equal_to< Key >, Alloc< Key >>
 std::unordered_set with custom allocator More...
 
template<class Key , template< class > class Alloc>
using unordered_multiset = std::unordered_multiset< Key, std::hash< Key >, std::equal_to< Key >, Alloc< Key >>
 std::unordered_multiset with custom allocator More...
 

Functions

template<class Iter >
auto reverseIterToForward (Iter &&it) -> typename mt::removeRef< decltype(--it.base())>::type
 Convert reverse iterator to forward iterator. More...
 
template<class List >
List::reverse_iterator erase (List &list, const typename List::reverse_iterator &iter)
 Erase using reverse iterator. Returns reverse iterator to element after erased element. More...
 
template<class List >
List::iterator eraseVal (List &list, const typename List::value_type &val)
 Erase first occurrence of value. Returns iterator to next element after the erased element, or end if not found. More...
 
template<class List , class T >
void eraseVals (List &list, const T &val)
 Erase all occurrences of value. More...
 
template<class MultiMap , class Key , class Val >
auto findVal (MultiMap &map, const Key &key, const Val &val) -> mt_iterOf(map)
 Get iterator to key with value. Returns end if not found. More...
 
template<class MultiSet , class Val >
auto findVal (MultiSet &set, const Val &val) -> mt_iterOf(set)
 Get iterator to value. Returns end if not found. More...
 

Detailed Description

See Standard Util.

Typedef Documentation

template<class Key , class Value , template< class > class Alloc>
using honey::stdutil::unordered_map = typedef std::unordered_map<Key, Value, std::hash<Key>, std::equal_to<Key>, Alloc<pair<const Key, Value>>>

std::unordered_map with custom allocator

template<class Key , class Value , template< class > class Alloc>
using honey::stdutil::unordered_multimap = typedef std::unordered_multimap<Key, Value, std::hash<Key>, std::equal_to<Key>, Alloc<pair<const Key, Value>>>

std::unordered_multimap with custom allocator

template<class Key , template< class > class Alloc>
using honey::stdutil::unordered_multiset = typedef std::unordered_multiset<Key, std::hash<Key>, std::equal_to<Key>, Alloc<Key>>

std::unordered_multiset with custom allocator

template<class Key , template< class > class Alloc>
using honey::stdutil::unordered_set = typedef std::unordered_set<Key, std::hash<Key>, std::equal_to<Key>, Alloc<Key>>

std::unordered_set with custom allocator

Function Documentation

template<class List >
List::reverse_iterator honey::stdutil::erase ( List &  list,
const typename List::reverse_iterator &  iter 
)

Erase using reverse iterator. Returns reverse iterator to element after erased element.

template<class List >
List::iterator honey::stdutil::eraseVal ( List &  list,
const typename List::value_type &  val 
)

Erase first occurrence of value. Returns iterator to next element after the erased element, or end if not found.

template<class List , class T >
void honey::stdutil::eraseVals ( List &  list,
const T &  val 
)

Erase all occurrences of value.

template<class MultiMap , class Key , class Val >
auto honey::stdutil::findVal ( MultiMap &  map,
const Key &  key,
const Val &  val 
) -> mt_iterOf(map)

Get iterator to key with value. Returns end if not found.

template<class MultiSet , class Val >
auto honey::stdutil::findVal ( MultiSet &  set,
const Val &  val 
) -> mt_iterOf(set)

Get iterator to value. Returns end if not found.

template<class Iter >
auto honey::stdutil::reverseIterToForward ( Iter &&  it) -> typename mt::removeRef<decltype(--it.base())>::type

Convert reverse iterator to forward iterator.