Namespaces | |
| namespace | detail |
Classes | |
| class | behave_state_list |
| behave_state_list. wrapper of combing all state behaves. More... | |
| class | behave_state_node |
| behave_state_list single node. defines behaves in single state. More... | |
| class | directed_acyclic_graph |
| DAG Class. More... | |
| class | directed_acyclic_node |
| DAG Node Class. More... | |
| class | free_list |
| Free list for memory pool. More... | |
| class | kd_tree |
| The kd_tree with K dimensions container Class. K the number of dimensions. Every node in the tree is a k-dimensional point. Every non-leaf node generates a splitting hyperplane that divides the space into two parts. Points to the left of the splitting hyperplane are represented by the left subtree of that node and points to the right of the hyperplane are represented by the right subtree. The hyperplane direction is chosen in the following way: it is perpendicular to the axis corresponding to the depth of the node (modulo k). The tree is balanced when constructed with points that are uniformly distributed. More... | |
| class | linked_unordered_map |
| The container combines hashmap and list together. Used in the case that we want iter a hashmap in order. Thread Safe. More... | |
| class | radix_trie |
| Declare of radix_trie. More... | |
| class | radix_trie< BITS, 1 > |
| Implementation of radix_trie with 1 LAYER. More... | |
| class | radix_trie< BITS, 2 > |
| Implementation of radix_trie with 2 LAYER. More... | |
| class | radix_trie< BITS, 3 > |
| Implementation of radix_trie with 3 LAYER. More... | |
| class | runtime_memory_block |
| The container is wrapper of a continue memory block. Used in Material::BuildMaterial(), helps to update buffer. More... | |
| class | span |
| Used for manage multiple page memory. More... | |
| class | span_list |
| Bidirectional cyclic linked list for span. More... | |
| class | thread_queue |
| Thread safe Queue. More... | |
| class | thread_unordered_map |
| Thread safe unordered_map. More... | |
| class | tree |
| simple tree. More... | |
| class | vector |
| This Class is similar to std::vector, the difference between that is this one allocates memory by malloc rather that new. This is important is ObjectPool. More... | |
Functions | |
| template<typename Tuple , typename Function > | |
| void | IterTuple (Tuple &tuple, Function &&f) |
| Iter a tuple. | |