- c -

• callback_leaves_t : m::storage::DataLayout
• callback_t : m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >, m::wasm::HashTable
• callback_type : m::CallbackOperator, m::gs::GridSearch< Spaces >, m::PartialPlanGenerator
• child_iterator_type : m::PhysicalPlanTableEntry< Actual, ChildIt >
• children_type : m::PhysicalOptimizerImpl< PhysicalPlanTable >
• chunk_list_type : m::list_allocator
• clause_map : m::GraphBuilder
• clock : m::Timer
• compare : m::pe::hs::config::Fibonacci_heap
• condition2entry_map_type : m::ConcretePhysicalPlanTable, m::PhysicalPlanTable< Actual, Condition2EntryMap >
• Const : m::ast::ASTVisitor, m::ast::ConstASTVisitor, m::ast::ThePostOrderExprVisitor< C >, m::ast::ThePreOrderExprVisitor< C >, m::ast::TheRecursiveExprVisitorBase< C >, m::detail::Visitor< ConcreteVisitor, Base >, m::detail::visitor_method_helper< ConcreteVisitor, Base, Class, Classes >, m::detail::visitor_method_helper< ConcreteVisitor, Base, Class >, m::detail::VisitorImpl< ConcreteVisitor, Base, Hierarchy >, m::interpreter::ThePostOrderMatchBaseVisitor< C >, m::interpreter::ThePreOrderMatchBaseVisitor< C >, m::interpreter::TheRecursiveMatchBaseVisitorBase< C >, m::M_OPERATOR_LIST::ThePostOrderOperatorVisitor< C >, m::M_OPERATOR_LIST::ThePreOrderOperatorVisitor< C >, m::wasm::ThePostOrderMatchBaseVisitor< C >, m::wasm::ThePreOrderMatchBaseVisitor< C >, m::wasm::TheRecursiveMatchBaseVisitorBase< C >
• const_bucket_iterator : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >
• const_child_iterator : m::ConcretePhysicalPlanTableEntry, m::PhysicalPlanTableEntry< Actual, ChildIt >
• const_entry_t : m::wasm::HashTable
• const_iterator : m::Block< N >, m::ConcreteCondition2PPTEntryMap, m::Condition2PPTEntryMap< Actual, It, Entry >, m::doubly_linked_list< T, Allocator >, m::dyn_array< T >, m::idx::ArrayIndex< Key >, m::idx::RecursiveModelIndex< Key >, m::pe::hs::search_states::EdgePtrBottomUp, m::pe::hs::search_states::EdgesBottomUp, m::pe::hs::search_states::SubproblemsArray, m::pe::hs::search_states::SubproblemTableBottomUp, m::PODPool< T, Hash, KeyEqual, Copy, ThreadSafe >, m::Pool< T, Hash, KeyEqual, ThreadSafe >, m::RefCountingHashMap< Key, Value, Hash, KeyEqual >, m::Schema
• const_pointer : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >
• const_reference : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >
• const_reference_t : m::wasm::HashTable
• const_reference_type : m::doubly_linked_list< T, Allocator >
• container_type : m::idx::ArrayIndex< Key >, m::idx::RecursiveModelIndex< Key >
• context_stack_t : m::ast::Sema
• continuation_t : m::wasm::If
• copy : m::PODPool< T, Hash, KeyEqual, Copy, ThreadSafe >
• cost_type : m::ConcretePhysicalPlanTableEntry, m::PhysicalOptimizerImpl< PhysicalPlanTable >, m::PhysicalPlanTableEntry< Actual, ChildIt >, m::PlanTableBase< Actual >
• counter_type : m::PODPool< T, Hash, KeyEqual, Copy, ThreadSafe >, m::Pool< T, Hash, KeyEqual, ThreadSafe >