|
HDK
|
#include <STY_Results.h>
Inheritance diagram for STY_Results:Additional Inherited Members | |
| Public Types inherited from UT_ArrayStringMap< STY_ResultMap > | |
| typedef UT::ArrayMap < UT_StringHolder, STY_ResultMap > | Parent |
| typedef Parent::const_iterator | const_iterator |
| typedef Parent::iterator | iterator |
| typedef Parent::size_type | size_type |
| Public Types inherited from UT::ArrayMap< Key, T, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual > | |
| typedef ArraySet< std::pair < Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T > , MapKeyEqual< KeyEqual, Key, T > > | set_type |
| typedef ArrayMap< Key, T, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual > | map_type |
| typedef Key | key_type |
| typedef T | mapped_type |
| typedef Hash | hasher |
| typedef KeyEqual | key_equal |
| using | pointer = typename set_type::pointer |
| using | const_pointer = typename set_type::const_pointer |
| using | value_type = typename set_type::value_type |
| using | size_type = typename set_type::size_type |
| using | iterator = typename set_type::iterator |
| Inherit iterator and const_iterator. More... | |
| template<bool constant_type> | |
| using | iterator_t = typename set_type::template iterator_t< constant_type > |
| using | const_iterator = typename set_type::const_iterator |
| using | const_key_iterator = partial_iterator_base< const_iterator, const key_type, deref_pair_first< const_iterator, const key_type >> |
| using | mapped_iterator = partial_iterator_base< iterator, mapped_type, deref_pair_second< iterator, mapped_type >> |
| using | const_mapped_iterator = partial_iterator_base< const_iterator, const mapped_type, deref_pair_second< const_iterator, const mapped_type >> |
| typedef ArraySet< Key, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual > | set_type |
| Inherit the constructors from ArraySet. More... | |
| Public Types inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| typedef ArraySet< std::pair < Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T > , MapKeyEqual< KeyEqual, Key, T > > | set_type |
| typedef std::pair< Key, T > | key_type |
| typedef std::pair< Key, T > | value_type |
| typedef std::size_t | size_type |
| typedef std::ptrdiff_t | difference_type |
| typedef MapKeyHash< Hash, Key, T > | hasher |
| typedef MapKeyEqual< KeyEqual, Key, T > | key_equal |
| typedef value_type & | reference |
| typedef const value_type & | const_reference |
| typedef value_type * | pointer |
| typedef const value_type * | const_pointer |
| typedef Clearer | clearer_type |
| typedef iterator_t< false > | iterator |
| Iterator type for iterating over non-constant elements. More... | |
| Public Member Functions inherited from UT_ArrayStringMap< STY_ResultMap > | |
| iterator | erase (iterator pos) |
| SYS_FORCE_INLINE STY_ResultMap | get (const UT_StringRef &key, const STY_ResultMap &defval) const |
| std::pair< iterator, bool > | insert (const UT_StringRef &key, const STY_ResultMap &val) |
| std::pair< iterator, bool > | insert (const UT_StringRef &key, STY_ResultMap &&val) |
| std::pair< iterator, bool > | insert (UT_StringRef &&key, const STY_ResultMap &val) |
| std::pair< iterator, bool > | insert (UT_StringRef &&key, STY_ResultMap &&val) |
| std::pair< iterator, bool > | insert (const char *key, const STY_ResultMap &val) |
| std::pair< iterator, bool > | insert (const char *key, STY_ResultMap &&val) |
| Public Member Functions inherited from UT::ArrayMap< Key, T, MULTI, MAX_LOAD_FACTOR_256, Clearer, Hash, KeyEqual > | |
| std::pair< iterator, bool > | insert (const Key &key, const T &val) |
| std::pair< iterator, bool > | insert (Key &&key, T &&val) |
| bool | operator== (const map_type &that) const |
| bool | operator!= (const map_type &that) const |
| mapped_type | get (const key_type &key, const mapped_type &defval) const |
| size_type | count (const Key &key) const |
| bool | contains (const Key &key) const |
| T & | operator[] (const Key &key) |
| T & | operator[] (Key &&key) |
| size_type | erase (const Key &key) |
| template<typename FUNCTOR > | |
| SYS_FORCE_INLINE void | forEachKey (FUNCTOR &&functor) const |
| template<typename FUNCTOR > | |
| SYS_FORCE_INLINE void | forEachValue (FUNCTOR &&functor) const |
| template<typename COMPARATOR > | |
| ordered_iterator_t< true > | ordered_begin (const COMPARATOR &comparator) const |
| template<typename COMPARATOR > | |
| ordered_iterator_t< true > | ordered_cbegin (const COMPARATOR &comparator) const |
| template<typename COMPARATOR > | |
| ordered_iterator_t< false > | ordered_begin (const COMPARATOR &comparator) |
| UT_IteratorRange < const_key_iterator > | key_range () const |
| UT_IteratorRange< mapped_iterator > | mapped_range () |
| UT_IteratorRange < const_mapped_iterator > | mapped_range () const |
| iterator | find (const Key &key) |
| const_iterator | find (const Key &key) const |
| T & | at (const Key &key) |
| const T & | at (const Key &key) const |
| std::pair< const_iterator, const_iterator > | equal_range (const Key &key) const |
| std::pair< iterator, iterator > | equal_range (const Key &key) |
| Public Member Functions inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| ArraySet () | |
| ArraySet (size_type init_bucket_count) | |
| ArraySet (set_type &&that) | |
| Move constructor, destroying the source. More... | |
| ArraySet (const set_type &that) | |
| ArraySet (INPUT_ITERATOR start_input, INPUT_ITERATOR end_input, size_type init_bucket_count=0) | |
| Inserts all of the items in the range [start_input,end_input). More... | |
| ArraySet (std::initializer_list< value_type > init, size_type init_bucket_count=0) | |
| set_type & | operator= (const set_type &that) |
| set_type & | operator= (std::initializer_list< value_type > init) |
| set_type & | operator= (set_type &&that) |
| bool | operator== (const set_type &that) const |
| bool | operator!= (const set_type &that) const |
| void | swap (set_type &that) |
| Swaps another set with this one. More... | |
| ~ArraySet () | |
| bool | empty () const |
| Returns true iff there are no items in the set. More... | |
| size_type | size () const |
| Returns the number of items in the set. More... | |
| void | clear () |
| void | destroy () |
| Removes all items from the set and frees all the memory. More... | |
| size_type | bucket_count () const |
| Returns the current number of buckets. More... | |
| size_type | bucket_size (size_type i) const |
| float | load_factor () const |
| Returns the current portion of buckets that are occupied. More... | |
| void | rehash (size_type new_num_buckets) |
| void | reserve (size_type num_items) |
| void | setNumBuckets (size_type new_num_buckets) |
| void | bumpNumBuckets (size_type new_num_items) |
| iterator | begin () |
| Returns a non-const iterator for the beginning of the set. More... | |
| const_iterator | begin () const |
| Returns a const iterator for the beginning of the set. More... | |
| const_iterator | cbegin () const |
| Returns a const iterator for the beginning of the set. More... | |
| iterator | end () |
| Returns a non-const end iterator for the set. More... | |
| const_iterator | end () const |
| Returns a const end iterator for the set. More... | |
| const_iterator | cend () const |
| Returns a const end iterator for the set. More... | |
| size_type | count (const std::pair< Key, T > &key) const |
| bool | contains (const std::pair< Key, T > &key) const |
| bool | containsAll (const S &src) const |
| void | insert (INPUT_ITERATOR start_input, INPUT_ITERATOR end_input) |
| Inserts all of the items in the range [start_input,end_input). More... | |
| void | insert (std::initializer_list< value_type > list) |
| Inserts all of the items from the initializer_list. More... | |
| std::pair< iterator, bool > | emplace (Args &&...args) |
| iterator | erase (iterator iter) |
| size_type | erase (const std::pair< Key, T > &key) |
| int64 | getMemoryUsage (bool inclusive) const |
| SYS_FORCE_INLINE void | forEach (FUNCTOR &&functor) const |
| iterator | find (const std::pair< Key, T > &key) |
| const_iterator | find (const std::pair< Key, T > &key) const |
| std::pair< const_iterator, const_iterator > | equal_range (const std::pair< Key, T > &key) const |
| std::pair< iterator, iterator > | equal_range (const std::pair< Key, T > &key) |
| std::pair< iterator, bool > | insert (const value_type &value) |
| std::pair< iterator, bool > | insert (value_type &&value) |
| Static Public Member Functions inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| static size_type | max_size () |
| static size_type | max_bucket_count () |
| static float | max_load_factor () |
| static hasher | hash_function () |
| static key_equal | key_eq () |
| Protected Member Functions inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| pointer | searchStart (const std::pair< Key, T > &key) |
| const_pointer | searchStart (const std::pair< Key, T > &key) const |
| bool | insertHelper (pointer pstart, size_type nbuckets, const value_type &value, pointer &destp) |
| Static Protected Member Functions inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| static size_type | minBuckets (size_type size) |
| Protected Attributes inherited from UT::ArraySet< std::pair< Key, T >, MULTI, MAX_LOAD_FACTOR_256, Clearer, MapKeyHash< Hash, Key, T >, MapKeyEqual< KeyEqual, Key, T > > | |
| pointer | myBuckets |
| size_type | myNumBuckets |
This is the data type returned when evaluating style sheet results. The top level string map is the category name (one of the STY_OVERRIDE_* constants). Each STY_ResultMap contains the result key/value pairs within that category.
Definition at line 99 of file STY_Results.h.
1.8.6 
