libstdc++
|
Classes | |
class | _Automaton |
Base class for, um, automata. Could be an NFA or a DFA. Your choice. More... | |
struct | _Before_begin |
struct | _CharMatcher |
Matches a single character. More... | |
class | _Compiler |
Builds an NFA from an input iterator interval. More... | |
struct | _Default_ranged_hash |
Default ranged hash function H. In principle it should be a function object composed from objects of type H1 and H2 such that h(k, N) = h2(h1(k), N), but that would mean making extra copies of h1 and h2. So instead we'll just use a tag to tell class template hashtable to do that composition. More... | |
struct | _EndTagger |
End state tag. More... | |
struct | _Equal_helper< _Key, _Value, _ExtractKey, _Equal, _HashCodeType, false > |
Specialization. More... | |
struct | _Equal_helper< _Key, _Value, _ExtractKey, _Equal, _HashCodeType, true > |
Specialization. More... | |
struct | _Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false > |
Specialization. More... | |
struct | _Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true > |
Specialization. More... | |
struct | _Equality_base |
class | _Grep_matcher |
Executes a regular expression NFA/DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags. More... | |
struct | _Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Default_ranged_hash, false > |
Specialization: hash function and range-hashing function, no caching of hash codes. Provides typedef and accessor required by C++ 11. More... | |
struct | _Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Default_ranged_hash, true > |
Specialization: hash function and range-hashing function, caching hash codes. H is provided but ignored. Provides typedef and accessor required by C++ 11. More... | |
struct | _Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, false > |
Specialization: ranged hash function, no caching hash codes. H1 and H2 are provided but ignored. We define a dummy hash code type. More... | |
struct | _Hash_node< _Value, false > |
struct | _Hash_node< _Value, true > |
struct | _Hash_node_base |
struct | _Hashtable_base |
struct | _Hashtable_ebo_helper< _Nm, _Tp, false > |
Specialization not using EBO. More... | |
struct | _Hashtable_ebo_helper< _Nm, _Tp, true > |
Specialization using EBO. More... | |
struct | _Hashtable_traits |
struct | _Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false, _Unique_keys > |
Specialization. More... | |
struct | _Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true, false > |
Specialization. More... | |
struct | _Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true, true > |
Specialization. More... | |
struct | _Insert_base |
struct | _List_node_base |
Common part of a node in the list. More... | |
struct | _Local_const_iterator |
local const_iterators More... | |
struct | _Local_iterator |
local iterators More... | |
struct | _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, false > |
Specialization. More... | |
struct | _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, true > |
Specialization. More... | |
struct | _Map_base |
struct | _Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false > |
Partial specialization, __unique_keys set to false. More... | |
struct | _Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true > |
Partial specialization, __unique_keys set to true. More... | |
struct | _Mod_range_hashing |
Default range hashing function: use division to fold a large number into the range [0, N). More... | |
class | _Nfa |
struct _Nfa More... | |
struct | _Node_const_iterator |
Node const_iterators, used to iterate through all the hashtable. More... | |
struct | _Node_iterator |
Node iterators, used to iterate through all the hashtable. More... | |
struct | _Node_iterator_base |
Base class for node iterators. More... | |
struct | _PatternCursor |
ABC for pattern matching. More... | |
struct | _Prime_rehash_policy |
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load factor small enough. More... | |
struct | _RangeMatcher |
Matches a character range (bracket expression) More... | |
struct | _Rehash_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _Prime_rehash_policy, _Traits > |
Specialization. More... | |
struct | _Results |
Provides a generic facade for a templated match_results. More... | |
class | _Scanner |
struct _Scanner. Scans an input range for regex tokens. More... | |
struct | _Scanner_base |
Base class for scanner. More... | |
class | _SpecializedCursor |
Provides a cursor into the specific target string. More... | |
class | _SpecializedResults |
A _Results facade specialized for wrapping a templated match_results. More... | |
struct | _StartTagger |
Start state tag. More... | |
struct | _State |
struct _State More... | |
class | _StateSeq |
Describes a sequence of one or more _State, its current start and end(s). This structure contains fragments of an NFA during construction. More... | |
Typedefs | |
typedef std::shared_ptr < _Automaton > | _AutomatonPtr |
typedef std::function< bool(const _PatternCursor &)> | _Matcher |
typedef int | _StateIdT |
typedef std::set< _StateIdT > | _StateSet |
typedef std::stack< _StateIdT, std::vector< _StateIdT > > | _StateStack |
typedef std::function< void(const _PatternCursor &, _Results &)> | _Tagger |
Enumerations | |
enum | _Opcode { _S_opcode_unknown, _S_opcode_alternative, _S_opcode_subexpr_begin, _S_opcode_subexpr_end, _S_opcode_match, _S_opcode_accept } |
Functions | |
template<typename _InIter , typename _TraitsT > | |
_AutomatonPtr | __compile (const _InIter &__b, const _InIter &__e, _TraitsT &__t, regex_constants::syntax_option_type __f) |
template<typename _FwdIterT > | |
_SpecializedCursor< _FwdIterT > | __cursor (const _FwdIterT &__b, const _FwdIterT __e) |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | __distance_fw (_Iterator __first, _Iterator __last, std::input_iterator_tag) |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | __distance_fw (_Iterator __first, _Iterator __last, std::forward_iterator_tag) |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | __distance_fw (_Iterator __first, _Iterator __last) |
template<typename _InputIterator , typename _OutputIterator , typename _Tp > | |
_OutputIterator | __normalize (_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp &__factor) |
bool | _AnyMatcher (const _PatternCursor &) |
template<typename _Value , bool _Cache_hash_code> | |
bool | operator!= (const _Node_iterator_base< _Value, _Cache_hash_code > &__x, const _Node_iterator_base< _Value, _Cache_hash_code > &__y) |
template<typename _Key , typename _Value , typename _ExtractKey , typename _H1 , typename _H2 , typename _Hash , bool __cache> | |
bool | operator!= (const _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache > &__x, const _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache > &__y) |
template<typename _Value , bool _Cache_hash_code> | |
bool | operator== (const _Node_iterator_base< _Value, _Cache_hash_code > &__x, const _Node_iterator_base< _Value, _Cache_hash_code > &__y) |
template<typename _Key , typename _Value , typename _ExtractKey , typename _H1 , typename _H2 , typename _Hash , bool __cache> | |
bool | operator== (const _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache > &__x, const _Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache > &__y) |
Variables | |
static const _StateIdT | _S_invalid_state_id |
Implementation details not part of the namespace std interface.