Here is a list of all struct and union fields with links to the structures/unions they belong to:

- b -

• back() : m::ConcretePhysicalPlanTable, m::doubly_linked_list< T, Allocator >, m::PhysicalPlanTable< Actual, Condition2EntryMap >
• backend_exception() : m::backend_exception
• backends_ : m::Catalog
• backends_begin() : m::Catalog
• backends_cbegin() : m::Catalog
• backends_cend() : m::Catalog
• backends_end() : m::Catalog
• base_address() : m::wasm::Buffer< IsGlobal >
• base_address_ : m::wasm::Buffer< IsGlobal >, m::wasm::buffer_storage< true >
• base_t : m::setup_t, m::teardown_t
• base_type : DPsize, DPsizeOpt, DPsizeSub, DPsub, DPsubOpt, IKKBZ, LinearizedDP, m::__virtual_crtp_helper< Tag, Const >::returns< ReturnType >::crtp_args< CRTPArgs >::args< Args >, m::detail::Visitor< ConcreteVisitor, Base >, m::idx::RecursiveModelIndex< Key >, m::list_allocator, m::malloc_allocator, m::pe::DPccp, m::pe::GOO, m::pe::hs::HeuristicSearch, 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::pe::TDGOO, m::wasm::Parameter< T, L >, MockInterface, PEall, TDbasic, TDMinCutAGaT
• BaseTable() : m::BaseTable
• batch_size : m::Match< wasm::IndexScan< IndexMethod > >
• beam() : m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >
• beam_dynamic() : m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >
• BEAM_FACTOR : m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >
• beam_queue_ : m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >
• beam_width : m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context >
• BeamWidth : m::pe::hs::config::beam< Num, Denom >
• begin() : m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::Partitions< true >, m::Block< N >, m::ConcreteCondition2PPTEntryMap, m::ConcreteTable, m::Condition2PPTEntryMap< Actual, It, Entry >, m::ConditionPropertyMap< Property, Ordered >, m::doubly_linked_list< T, Allocator >, m::dyn_array< T >, m::idx::ArrayIndex< 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::PlanTableDecorator< Actual >, m::PlanTableLargeAndSparse, m::PlanTableSmallOrDense, m::PODPool< T, Hash, KeyEqual, Copy, ThreadSafe >, m::Pool< T, Hash, KeyEqual, ThreadSafe >, m::range< It >, m::RefCountingHashMap< Key, Value, Hash, KeyEqual >, m::Schema, m::SmallBitset, m::sorted_vector< T, Compare >, m::storage::DataLayout::INode, m::Table, m::TableDecorator, m::Timer, m::Timer::Measurement, m::view< It, ReturnType &(It)>, m::wasm::ChainedHashTable< IsGlobal >, m::wasm::OpenAddressingHashTable< IsGlobal, ValueInPlace >, m::wasm::OpenAddressingHashTableBase
• begin_ : LinearizedDP::Sequence, m::range< It >
• begin_all() : m::ConcreteTable, m::Table, m::TableDecorator
• begin_children() : m::ConcretePhysicalPlanTableEntry, m::PhysicalPlanTableEntry< Actual, ChildIt >
• begin_hidden() : m::ConcreteTable, m::Table, m::TableDecorator
• begin_tables() : m::Database
• begin_transaction() : m::Scheduler, m::SerialScheduler
• benchmark : m::Options
• BG : m::term::Color
• Bin() : m::Spn::ContinuousLeaf::Bin, m::Spn::DiscreteLeaf::Bin
• BINARY() : m::wasm::Expr< T, L >
• binary() : m::wasm::Module, m::WasmModule
• BinaryExpr() : m::ast::BinaryExpr
• binding_depth() : m::ast::Designator, m::ClauseInfo
• binding_depth_ : m::ast::Designator
• bins : m::Spn::ContinuousLeaf, m::Spn::DiscreteLeaf
• bit_offset_ : m::wasm::detail::local_bit_storage< L >, m::wasm::detail::local_bit_storage< 1 >
• Bitmap() : m::Bitmap
• bitmap_ : m::wasm::detail::local_bit_storage< 1 >
• bitmask() : m::wasm::Expr< T, L >, m::wasm::LocalBitmap
• bitmask_per_offset : m::wasm::LocalBitvector
• bits_ : m::SmallBitset, m::SmallBitset::iterator, m::SmallBitset::reverse_iterator
• bitvector_ : m::wasm::detail::local_bit_storage< L >
• Block() : m::Block< N >, m::wasm::Block, m::wasm::Module
• block_ : m::Block< N >::the_iterator< C >, m::Pipeline, m::wasm::BlockUser
• BLOCK_SIZE : m::PaxStore
• block_size() : m::PaxStore
• block_size_ : m::PaxStore
• block_size_t : m::storage::PAXLayoutFactory
• block_t : m::Block< N >::the_iterator< C >
• BlockUser : m::wasm::Block, m::wasm::BlockUser, m::wasm::Module
• body() : m::wasm::Loop, m::wasm::While
• body_ : m::wasm::Loop
• BOLD : m::Diagnostic
• Boolean() : m::Boolean
• boolean_result_t : m::wasm::ConstantFolding
• Bottom() : m::pe::hs::search_states::SubproblemsArray
• bottomup_lookahead_cheapest() : m::pe::hs::heuristics::bottomup_lookahead_cheapest< PlanTable, State >
• bound_clauses_ : m::GraphBuilder
• branch_target_stack_ : m::wasm::Module
• branch_target_t() : m::wasm::branch_target_t
• breadth() : m::Spn, m::Spn::ContinuousLeaf, m::Spn::DiscreteLeaf, m::Spn::Node, m::Spn::Product, m::Spn::Sum, m::SpnWrapper
• brk : m::wasm::branch_target_t
• broadcast() : m::wasm::Expr< T, L >, m::wasm::Variable< T, Kind, CanBeNull, L >
• bucket() : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >, m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
• bucket_ : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
• bucket_index() : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
• bucket_index_ : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >
• bucket_iterator : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >
• bucket_type : m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_bucket_iterator< C >, m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::the_iterator< C >
• budget_exhausted_exception() : m::ai::budget_exhausted_exception
• buf : m::DSVReader
• buf_ : m::ast::Lexer, m::InjectionCardinalityEstimator
• buf_append() : m::InjectionCardinalityEstimator
• buf_t : m::ast::Lexer
• buf_view() : m::InjectionCardinalityEstimator
• Buffer() : m::wasm::Buffer< IsGlobal >
• Buffer< IsGlobal > : m::wasm::buffer_load_proxy_t< IsGlobal >, m::wasm::buffer_store_proxy_t< IsGlobal >, m::wasm::buffer_swap_proxy_t< IsGlobal >
• Buffer< true > : m::wasm::buffer_storage< true >
• buffer_ : m::wasm::buffer_load_proxy_t< IsGlobal >, m::wasm::buffer_store_proxy_t< IsGlobal >, m::wasm::buffer_swap_proxy_t< IsGlobal >
• buffer_factory_ : m::Match< wasm::Filter< Predicated > >, m::Match< wasm::HashBasedGroupJoin >, m::Match< wasm::IndexScan< IndexMethod > >, m::Match< wasm::LazyDisjunctiveFilter >, m::Match< wasm::NestedLoopsJoin< Predicated > >, m::Match< wasm::Projection >, m::Match< wasm::Scan< SIMDfied > >, m::Match< wasm::SimpleHashJoin< UniqueBuild, Predicated > >
• buffer_load_proxy_t() : m::wasm::buffer_load_proxy_t< IsGlobal >
• buffer_num_tuples_ : m::Match< wasm::Filter< Predicated > >, m::Match< wasm::HashBasedGroupJoin >, m::Match< wasm::IndexScan< IndexMethod > >, m::Match< wasm::LazyDisjunctiveFilter >, m::Match< wasm::NestedLoopsJoin< Predicated > >, m::Match< wasm::Projection >, m::Match< wasm::Scan< SIMDfied > >, m::Match< wasm::SimpleHashJoin< UniqueBuild, Predicated > >
• buffer_store_proxy_t() : m::wasm::buffer_store_proxy_t< IsGlobal >
• buffer_swap_proxy_t() : m::wasm::buffer_swap_proxy_t< IsGlobal >
• build : m::Match< wasm::HashBasedGroupJoin >, m::Match< wasm::SimpleHashJoin< UniqueBuild, Predicated > >
• Build() : m::QueryGraph
• build_query() : m::idx::IndexBase
• builder : m::SubqueryInfo
• Builder() : m::wasm::Module
• builder_ : m::wasm::Module
• bulkload() : m::idx::ArrayIndex< Key >, m::idx::IndexBase