mu
t
able
A Database System for Research and Fast Prototyping
Loading...
Searching...
No Matches
- o -
offset() :
m::LimitOperator
,
m::memory::LinearAllocator
,
m::memory::Memory
,
m::PaxStore
,
m::RowStore
on_message() :
m::wasm::detail::V8InspectorClientImpl
,
m::WebSocketServer
OnoLohmannCycle() :
m::PlanTableLargeAndSparse
op() :
m::ast::BinaryExpr
,
m::ast::UnaryExpr
OpenAddressingHashTable() :
m::wasm::OpenAddressingHashTable< IsGlobal, ValueInPlace >
OpenAddressingHashTableBase() :
m::wasm::OpenAddressingHashTableBase
Operator() :
m::Operator
operator and() :
m::wasm::Expr< T, L >
operator bitand() :
m::wasm::Decimal< Base >
operator bitor() :
m::wasm::Decimal< Base >
operator bool() :
m::AdjacencyMatrix::Proxy< C >
,
m::ast::Token
,
m::GospersHack
,
m::SmallBitset
,
m::SmallBitset::Proxy< C >
,
m::storage::DataLayout
,
m::SubsetEnumerator
,
m::Value
,
m::wasm::Expr< T, L >
operator const INode &() :
m::storage::DataLayout
operator const T &() :
m::OptField< Condition, T >
,
m::Pooled< T, Pool, CanBeNone >
operator const T *() :
m::Pooled< T, Pool, CanBeNone >
operator dependent_expr_t< U >() :
m::wasm::Variable< T, Kind, CanBeNull, L >
operator dependent_expr_type() :
m::wasm::Variable< T, Kind, CanBeNull, L >
operator double() :
m::Value
operator Expr< To, ToL >() :
m::wasm::Expr< T, L >
operator float() :
m::Value
operator int32_t() :
m::Value
operator int64_t() :
m::Value
operator NChar() :
m::wasm::HashTable::the_reference< NChar, IsConst >
operator or() :
m::wasm::Expr< T, L >
operator Pooled< U, Pool, false >() :
m::Pooled< T, Pool, CanBeNone >
operator PrimitiveExpr< T, L >() :
m::wasm::detail::the_reference< T, L, IsConst >
operator result_type() :
m::lazy_construct< Factory >
operator T() :
m::wasm::HashTable
operator T&() :
m::OptField< Condition, T >
operator T*() :
m::Value
operator the_entry< true >() :
m::wasm::HashTable::the_entry< IsConst >
operator the_iterator< true >() :
m::doubly_linked_list< T, Allocator >::the_iterator< C >
operator TokenType() :
m::ast::Token
operator uint64_t() :
m::SmallBitset
operator unsigned() :
WeighExpr
operator xor() :
m::wasm::Decimal< Base >
operator!() :
m::cnf::Predicate
operator!=() :
m::AdjacencyMatrix
,
m::ast::Expr
,
m::Attribute
,
m::Block< N >::the_iterator< C >
,
m::cnf::Clause
,
m::cnf::CNF
,
m::cnf::Predicate
,
m::Condition
,
m::ConditionSet
,
m::DataSource
,
m::detail::ConcretePhysicalPlanTableIterator< Ref, C >
,
m::detail::the_condition_entry_iterator< Actual, C, Entry >
,
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::dyn_array< T >
,
m::Join
,
m::pe::hs::search_states::Base< Actual >
,
m::pe::hs::search_states::EdgePtrBottomUp
,
m::pe::hs::search_states::EdgePtrBottomUp::the_iterator< IsConst >
,
m::pe::hs::search_states::EdgesBottomUp
,
m::pe::hs::search_states::SubproblemsArray
,
m::pe::hs::search_states::SubproblemTableBottomUp
,
m::pe::hs::search_states::SubproblemTableBottomUp::the_iterator< IsConst >
,
m::PlanTableBase< Actual >
,
m::PlanTableEntry
,
m::PlanTableLargeAndSparse
,
m::PlanTableSmallOrDense
,
m::Pooled< T, Pool, CanBeNone >
,
m::Position
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
,
m::Schema::Identifier
,
m::Schema
,
m::SmallBitset::iterator
,
m::SmallBitset
,
m::SmallBitset::reverse_iterator
,
m::storage::DataLayout::INode::const_iterator
,
m::StringView
,
m::Table::the_iterator< V, H >
,
m::Tuple
,
m::Type
,
m::Value
operator%() :
m::wasm::Decimal< Base >
operator&() :
m::pe::GOO::node
operator&=() :
m::SmallBitset
operator()() :
CNFGenerator
,
DPsize
,
DPsizeOpt
,
DPsizeSub
,
DPsub
,
DPsubOpt
,
GetNestedQueries
,
IKKBZ
,
LinearizedDP
,
m::__virtual_crtp_helper< Tag, Const >::returns< ReturnType >::crtp_args< CRTPArgs >::args< Args >::base_type_helper< false, T >
,
m::__virtual_crtp_helper< Tag, Const >::returns< ReturnType >::crtp_args< CRTPArgs >::args< Args >::base_type_helper< true, T >
,
m::__virtual_crtp_helper< Tag, Const >::returns< ReturnType >::crtp_args< CRTPArgs >::args< Args >::derived_type_helper< false, Actual, T >
,
m::__virtual_crtp_helper< Tag, Const >::returns< ReturnType >::crtp_args< CRTPArgs >::args< Args >::derived_type_helper< true, Actual, T >
,
m::AdjacencyMatrix
,
m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::comparator
,
m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::Partitions< false >
,
m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::Partitions< true >
,
m::ArgParser
,
m::ast::ThePostOrderExprVisitor< C >
,
m::ast::ThePreOrderExprVisitor< C >
,
m::ast::TheRecursiveExprVisitorBase< C >
,
m::CartesianProductEstimator
,
m::ConditionPropertyMap< Property, Ordered >::IdentifierHash
,
m::CostFunctionCout
,
m::detail::stl_visit_helper< Callable, ResultType, Visitor, Class, Classes >
,
m::detail::stl_visit_helper< Callable, ResultType, Visitor, Class >
,
m::detail::Visitor< ConcreteVisitor, Base >
,
m::detail::visitor_method_helper< ConcreteVisitor, Base, Class, Classes >
,
m::detail::visitor_method_helper< ConcreteVisitor, Base, Class >
,
m::Diagnostic
,
m::DSVReader
,
m::GraphBuilder
,
m::gs::GridSearch< Spaces >
,
m::gs::LinearSpace< T >
,
m::gs::Space< T, Derived >
,
m::idx::RecursiveModelIndex< Key >::LinearModel
,
m::InjectionCardinalityEstimator
,
m::interpreter::ThePostOrderMatchBaseVisitor< C >
,
m::interpreter::ThePreOrderMatchBaseVisitor< C >
,
m::M_OPERATOR_LIST::ThePostOrderOperatorVisitor< C >
,
m::M_OPERATOR_LIST::ThePreOrderOperatorVisitor< C >
,
m::Optimizer
,
m::PairHash< T1, T2, H1, H2 >
,
m::partition_predicated_naive
,
m::pe::DPccp
,
m::pe::GOO
,
m::pe::hs::expansions::BottomUpComplete
,
m::pe::hs::expansions::TopDownComplete
,
m::pe::hs::heuristics::avg_sel< PlanTable, State, BottomUp >
,
m::pe::hs::heuristics::bottomup_lookahead_cheapest< PlanTable, State >
,
m::pe::hs::heuristics::GOO< PlanTable, State, BottomUp >
,
m::pe::hs::heuristics::GOO< PlanTable, State, TopDown >
,
m::pe::hs::heuristics::product< PlanTable, State, BottomUp >
,
m::pe::hs::heuristics::scaled_sum< PlanTable, State, BottomUp >
,
m::pe::hs::heuristics::sqrt_sum< PlanTable, State, TopDown >
,
m::pe::hs::heuristics::sum< PlanTable, State, BottomUp >
,
m::pe::hs::heuristics::sum< PlanTable, State, TopDown >
,
m::pe::hs::heuristics::zero< PlanTable, State, Expand >
,
m::pe::hs::HeuristicSearch
,
m::pe::PlanEnumerator
,
m::pe::TDGOO
,
m::PODPool< T, Hash, KeyEqual, Copy, ThreadSafe >
,
m::Pool< T, Hash, KeyEqual, ThreadSafe >::dereference_equal_to
,
m::Pool< T, Hash, KeyEqual, ThreadSafe >::dereference_hash
,
m::Pool< T, Hash, KeyEqual, ThreadSafe >
,
m::QueryGraph2SQL
,
m::Reader
,
m::setup_t
,
m::SmallBitset
,
m::SpnEstimator
,
m::StackMachine
,
m::StackMachineBuilder
,
m::StrClone
,
m::StrEqual
,
m::StrEqualWithNull
,
m::StrHash
,
m::SubproblemHash
,
m::teardown_t
,
m::TrainedCostFunction
,
m::wasm::buffer_load_proxy_t< IsGlobal >
,
m::wasm::buffer_store_proxy_t< IsGlobal >
,
m::wasm::buffer_swap_proxy_t< IsGlobal >
,
m::wasm::detail::wasm_type_helper< PrimitiveExpr< T, L >, 1 >
,
m::wasm::detail::wasm_type_helper< ReturnType(ParamTypes...), 1 >
,
m::wasm::detail::wasm_type_helper< T, 1 >
,
m::wasm::detail::wasm_type_helper< T, L >
,
m::wasm::ExprCompiler
,
m::wasm::ThePostOrderMatchBaseVisitor< C >
,
m::wasm::ThePreOrderMatchBaseVisitor< C >
,
m::wasm::TheRecursiveMatchBaseVisitorBase< C >
,
PEall
,
skewed_distribution< RealType >
,
std::hash< Container >
,
std::hash< m::ast::Expr >
,
std::hash< m::Attribute >
,
std::hash< m::cnf::Predicate >
,
std::hash< m::pe::hs::search_states::EdgePtrBottomUp >
,
std::hash< m::pe::hs::search_states::EdgesBottomUp >
,
std::hash< m::pe::hs::search_states::SubproblemsArray >
,
std::hash< m::pe::hs::search_states::SubproblemTableBottomUp >
,
std::hash< m::Schema::Identifier >
,
std::hash< m::Tuple >
,
std::hash< m::Type >
,
std::hash< m::Value >
,
std::hash< std::reference_wrapper< T > >
,
std::std::hash< m::Pooled< T, Pool, CanBeNone > >
,
TDbasic
,
TDMinCutAGaT
,
WeighExpr
operator*() :
m::Block< N >::the_iterator< C >
,
m::cnf::Predicate
,
m::detail::ConcretePhysicalPlanTableIterator< Ref, C >
,
m::detail::the_condition_entry_iterator< Actual, C, Entry >
,
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::GospersHack
,
m::OptField< Condition, T >
,
m::pe::hs::search_states::EdgePtrBottomUp::the_iterator< IsConst >
,
m::pe::hs::search_states::SubproblemTableBottomUp::the_iterator< IsConst >
,
m::Pooled< T, Pool, CanBeNone >
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
,
m::SmallBitset::iterator
,
m::SmallBitset::reverse_iterator
,
m::storage::DataLayout::INode::const_iterator
,
m::SubsetEnumerator
,
m::Table::the_iterator< V, H >
,
m::wasm::Decimal< Base >
operator+() :
m::pe::GOO::node
,
m::wasm::Decimal< Base >
operator++() :
m::Block< N >::the_iterator< C >
,
m::detail::ConcretePhysicalPlanTableIterator< Ref, C >
,
m::detail::the_condition_entry_iterator< Actual, C, Entry >
,
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::GospersHack
,
m::pe::hs::search_states::EdgePtrBottomUp::the_iterator< IsConst >
,
m::pe::hs::search_states::SubproblemTableBottomUp::the_iterator< IsConst >
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
,
m::SmallBitset::iterator
,
m::SmallBitset
,
m::SmallBitset::reverse_iterator
,
m::storage::DataLayout::INode::const_iterator
,
m::SubsetEnumerator
,
m::Table::the_iterator< V, H >
operator+=() :
m::pe::GOO::node
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::Schema
,
m::Table::the_iterator< V, H >
operator-() :
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::Table::the_iterator< V, H >
,
m::wasm::Decimal< Base >
operator--() :
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::SmallBitset
,
m::Table::the_iterator< V, H >
operator-=() :
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::SmallBitset
,
m::Table::the_iterator< V, H >
operator->() :
m::Block< N >::the_iterator< C >
,
m::cnf::Predicate
,
m::detail::ConcretePhysicalPlanTableIterator< Ref, C >
,
m::detail::the_condition_entry_iterator< Actual, C, Entry >
,
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::OptField< Condition, T >
,
m::pe::hs::search_states::EdgePtrBottomUp::the_iterator< IsConst >
,
m::pe::hs::search_states::SubproblemTableBottomUp::the_iterator< IsConst >
,
m::Pooled< T, Pool, CanBeNone >
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
,
m::storage::DataLayout::INode::const_iterator
,
m::Table::the_iterator< V, H >
operator/() :
m::wasm::Decimal< Base >
operator<() :
m::cnf::Predicate
,
m::pe::hs::search_states::Base< Actual >
,
m::pe::hs::search_states::SubproblemsArray
,
m::pe::hs::search_states::SubproblemTableBottomUp
,
m::Spn::ContinuousLeaf::Bin
,
m::Spn::DiscreteLeaf::Bin
,
m::StringView
operator<<() :
m::wasm::Decimal< Base >
operator<=() :
m::cnf::Clause
,
m::cnf::CNF
,
m::StringView
operator<=>() :
m::Scheduler::Transaction
operator=() :
m::AdjacencyMatrix
,
m::AdjacencyMatrix::Proxy< C >
,
m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >
,
m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >
,
m::Catalog
,
m::ConcreteCondition2PPTEntryMap
,
m::ConcretePhysicalPlanTable
,
m::ConcretePhysicalPlanTableEntry
,
m::Condition2PPTEntryMap< Actual, It, Entry >
,
m::ConditionSet
,
m::detail::condition_entry_t< Entry >
,
m::doubly_linked_list< T, Allocator >
,
m::dyn_array< T >
,
m::InjectionCardinalityEstimator::InjectionCardinalityDataModel
,
m::InjectionCardinalityEstimator
,
m::list_allocator
,
m::memory::Memory
,
m::OptField< Condition, T >
,
m::Options
,
m::pe::hs::search_states::EdgePtrBottomUp
,
m::pe::hs::search_states::EdgePtrBottomUp::Scratchpad
,
m::pe::hs::search_states::EdgesBottomUp
,
m::pe::hs::search_states::SubproblemsArray
,
m::pe::hs::search_states::SubproblemTableBottomUp
,
m::PhysicalPlanTable< Actual, Condition2EntryMap >
,
m::PhysicalPlanTableEntry< Actual, ChildIt >
,
m::PlanTableBase< Actual >
,
m::PlanTableLargeAndSparse
,
m::PlanTableSmallOrDense
,
m::Pooled< T, Pool, CanBeNone >
,
m::QueryGraph
,
m::read_lock
,
m::reader_writer_lock
,
m::SmallBitset::Proxy< C >
,
m::some< T >
,
m::storage::DataLayout::INode
,
m::Tuple
,
m::unsharable_shared_ptr< T >
,
m::upgrade_lock
,
m::wasm::Block
,
m::wasm::Buffer< IsGlobal >
,
m::wasm::buffer_load_proxy_t< IsGlobal >
,
m::wasm::buffer_store_proxy_t< IsGlobal >
,
m::wasm::detail::the_reference< T, L, IsConst >
,
m::wasm::Expr< T, L >
,
m::wasm::HashTable
,
m::wasm::HashTable::the_reference< NChar, IsConst >
,
m::wasm::Loop
,
m::wasm::Variable< T, Kind, CanBeNull, L >
,
m::write_lock
operator==() :
m::AdjacencyMatrix
,
m::ast::BinaryExpr
,
m::ast::Constant
,
m::ast::Designator
,
m::ast::ErrorExpr
,
m::ast::Expr
,
m::ast::FnApplicationExpr
,
m::ast::QueryExpr
,
m::ast::UnaryExpr
,
m::Attribute
,
m::Bitmap
,
m::Block< N >::the_iterator< C >
,
m::Boolean
,
m::CharacterSequence
,
m::cnf::Clause
,
m::cnf::CNF
,
m::cnf::Predicate
,
m::ConcreteTable
,
m::Condition
,
m::ConditionPropertyMap< Property, Ordered >
,
m::ConditionSet
,
m::DataSource
,
m::Date
,
m::DateTime
,
m::detail::ConcretePhysicalPlanTableIterator< Ref, C >
,
m::detail::the_condition_entry_iterator< Actual, C, Entry >
,
m::doubly_linked_list< T, Allocator >::the_iterator< C >
,
m::dyn_array< T >
,
m::ErrorType
,
m::FnType
,
m::Join
,
m::NoneType
,
m::Numeric
,
m::pe::hs::search_states::Base< Actual >
,
m::pe::hs::search_states::EdgePtrBottomUp
,
m::pe::hs::search_states::EdgePtrBottomUp::the_iterator< IsConst >
,
m::pe::hs::search_states::EdgesBottomUp
,
m::pe::hs::search_states::SubproblemsArray
,
m::pe::hs::search_states::SubproblemTableBottomUp
,
m::pe::hs::search_states::SubproblemTableBottomUp::the_iterator< IsConst >
,
m::PlanTableBase< Actual >
,
m::PlanTableEntry
,
m::PlanTableLargeAndSparse
,
m::PlanTableSmallOrDense
,
m::Pooled< T, Pool, CanBeNone >
,
m::Position
,
m::Predicated
,
m::projecting_iterator< It, ReturnType &(It), OwnsProjection >
,
m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
,
m::Scheduler::Transaction
,
m::Schema::Identifier
,
m::Schema
,
m::SIMD
,
m::SmallBitset::iterator
,
m::SmallBitset
,
m::SmallBitset::reverse_iterator
,
m::Sortedness
,
m::storage::DataLayout::INode::const_iterator
,
m::StringView
,
m::Table
,
m::Table::the_iterator< V, H >
,
m::TableDecorator
,
m::Tuple
,
m::Type
,
m::Unsatisfiable
,
m::Value
,
m::wasm::HashTable
,
m::wasm::HashTable::the_reference< NChar, IsConst >
operator>() :
m::StringView
operator>=() :
m::cnf::Clause
,
m::cnf::CNF
,
m::StringView
operator>>() :
m::wasm::Decimal< Base >
operator[]() :
m::Block< N >
,
m::ConcretePhysicalPlanTable
,
m::ConcreteTable
,
m::dyn_array< T >
,
m::pe::hs::search_states::EdgesBottomUp
,
m::pe::hs::search_states::SubproblemsArray
,
m::pe::hs::search_states::SubproblemTableBottomUp
,
m::PhysicalPlanTable< Actual, Condition2EntryMap >
,
m::PlanTableBase< Actual >
,
m::PlanTableLargeAndSparse
,
m::PlanTableSmallOrDense
,
m::QueryGraph
,
m::Schema
,
m::SmallBitset
,
m::storage::DataLayout::INode
,
m::Table
,
m::TableDecorator
,
m::Tuple
,
m::wasm::Environment
operator|=() :
m::Schema
,
m::SmallBitset
operator~() :
m::SmallBitset
,
m::wasm::Decimal< Base >
OptField() :
m::OptField< Condition, T >
,
m::OptField< false, T >
optimize() :
m::Optimizer
Optimize() :
m::wasm::Module
optimize_filter() :
m::Optimizer
optimize_join_order() :
m::Optimizer
optimize_plan() :
m::Optimizer
optimize_source_plans() :
m::Optimizer
optimize_with_plantable() :
m::Optimizer
Optimizer() :
m::Optimizer
Option() :
m::ArgParser::Option
OptionImpl() :
m::ArgParser::OptionImpl< T >
Options() :
m::Options
order_by() :
m::QueryGraph
,
m::SortingOperator
OrderByClause() :
m::ast::OrderByClause
orders() :
m::Sortedness
out() :
m::Diagnostic
out_of_range() :
m::out_of_range
overflow() :
NullBuffer
owned_by() :
m::pe::hs::search_states::EdgePtrBottomUp::Scratchpad
owns_lock() :
m::read_lock
,
m::write_lock
owns_read_lock() :
m::reader_writer_lock
,
m::upgrade_lock
owns_write_lock() :
m::reader_writer_lock
mu
t
able website
GitHub
Generated by
1.9.6