bpf::collection namespace

Contents

Namespaces

namespace ops

Classes

template<typename T, fsize I = 0>
class Array
template<typename T>
class Array<T, 0>
template<typename T>
class ArrayConstIterator
template<typename IType, typename T>
class ArrayConstIteratorBase
template<typename T>
class ArrayConstReverseIterator
template<typename T>
class ArrayIterator
template<typename IType, typename T>
class ArrayIteratorBase
template<typename T>
class ArrayList
template<typename T>
class ArrayReverseIterator
template<typename IType, typename T>
class ConstIterator
template<typename C>
class ConstReverseAdapter
template<typename K, typename V, typename HashOp = Hash<K>>
class HashMap
template<class HashMap, typename EntryType, typename NodeType>
class HashMapConstIterator
template<class HashMap, typename EntryType, typename NodeType>
class HashMapConstReverseIterator
template<class HashMap, typename EntryType, typename NodeType>
class HashMapIterator
template<class HashMap, typename EntryType, typename NodeType, template<class, typename, typename> class IType, template<typename, typename> class Base>
class HashMapIteratorBase
template<class HashMap, typename EntryType, typename NodeType>
class HashMapReverseIterator
template<typename IType, typename T>
class Iterator
template<typename T>
class List
template<typename T, typename NodeType>
class ListConstIterator
template<typename T, typename NodeType>
class ListConstReverseIterator
template<typename T, typename NodeType>
class ListIterator
template<typename T, typename NodeType, template<typename, typename> class IType, template<typename, typename> class Base>
class ListIteratorBase
template<typename T, typename NodeType>
class ListReverseIterator
template<typename K, typename V, template<typename T> class Greater = ops::Greater, template<typename T> class Less = ops::Less>
class Map
template<typename EntryType, typename NodeType>
class MapConstIterator
template<typename EntryType, typename NodeType>
class MapConstReverseIterator
template<typename Map, typename EntryType, typename NodeType>
class MapIterator
template<typename EntryType, typename NodeType>
class MapReverseIterator
template<typename K, typename V, template<typename> class HeapFunc = MaxHeap>
class PriorityQueue
template<typename T>
class Queue
template<typename C>
class ReverseAdapter
template<typename T>
class Stack
class StackOverflowException
class StackUnderflowException

Typedefs

using MinHeap = ops::LessOrEqual<T>
using MaxHeap = ops::GreaterOrEqual<T>

Functions

template<typename C>
auto Reverse(const C& container) -> BP_TPL_API ConstReverseAdapter<C>
template<typename C>
auto Reverse(C& container) -> BP_TPL_API ReverseAdapter<C>

Variables

fint HASH_MAP_INIT_BUF_SIZE constexpr
float HASH_MAP_LIMIT_UNTIL_EXTEND constexpr
template<typename T>
class BP_TPL_API List

Typedef documentation

using bpf::collection::MinHeap = ops::LessOrEqual<T>
#include <Base/include/Framework/Collection/Utility.hpp>

Default minimizing operator for PriorityQueue

using bpf::collection::MaxHeap = ops::GreaterOrEqual<T>
#include <Base/include/Framework/Collection/Utility.hpp>

Default maximizing operator for PriorityQueue

Function documentation

#include <Base/include/Framework/Collection/Iterator.hpp>
template<typename C>
BP_TPL_API ConstReverseAdapter<C> bpf::collection::Reverse(const C& container)

Template parameters
C the collection type
Parameters
container the actual collection to iterate in reverse order

Utility function used to walk a iterable collection in reverse order using the C++ 11 range for loop syntax

#include <Base/include/Framework/Collection/Iterator.hpp>
template<typename C>
BP_TPL_API ReverseAdapter<C> bpf::collection::Reverse(C& container)

Template parameters
C the collection type
Parameters
container the actual collection to iterate in reverse order

Utility function used to walk a iterable collection in reverse order using the C++ 11 range for loop syntax

Variable documentation

#include <Base/include/Framework/Collection/List.Iterator.hpp>
template<typename T>
class BP_TPL_API bpf::collection::List