1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067 |
- #ifndef BOOST_CONTAINER_FLAT_MAP_HPP
- #define BOOST_CONTAINER_FLAT_MAP_HPP
- #ifndef BOOST_CONFIG_HPP
- # include <boost/config.hpp>
- #endif
- #if defined(BOOST_HAS_PRAGMA_ONCE)
- # pragma once
- #endif
- #include <boost/container/detail/config_begin.hpp>
- #include <boost/container/detail/workaround.hpp>
- #include <boost/container/allocator_traits.hpp>
- #include <boost/container/container_fwd.hpp>
- #include <boost/container/new_allocator.hpp> //new_allocator
- #include <boost/container/throw_exception.hpp>
- #include <boost/container/detail/flat_tree.hpp>
- #include <boost/container/detail/type_traits.hpp>
- #include <boost/container/detail/mpl.hpp>
- #include <boost/container/detail/algorithm.hpp> //equal()
- #include <boost/container/detail/container_or_allocator_rebind.hpp>
- #include <boost/move/utility_core.hpp>
- #include <boost/move/traits.hpp>
- #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
- #include <boost/move/detail/fwd_macros.hpp>
- #endif
- #include <boost/move/detail/move_helpers.hpp>
- #include <boost/move/detail/force_ptr.hpp>
- #include <boost/intrusive/detail/minimal_pair_header.hpp> //pair
- #include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- #include <initializer_list>
- #endif
- namespace boost {
- namespace container {
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- template <class Key, class T, class Compare, class AllocatorOrContainer>
- class flat_multimap;
- namespace dtl{
- template<class D, class S>
- BOOST_CONTAINER_FORCEINLINE static D &force(S &s)
- { return *move_detail::force_ptr<D*>(&s); }
- template<class D, class S>
- BOOST_CONTAINER_FORCEINLINE static const D &force(const S &s)
- { return *move_detail::force_ptr<const D*>(&s); }
- template<class D, class S>
- BOOST_CONTAINER_FORCEINLINE static D force_copy(const S &s)
- {
- const D *const vp = move_detail::force_ptr<const D *>(&s);
- D ret_val(*vp);
- return ret_val;
- }
- }
- #endif
- #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
- template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
- #else
- template <class Key, class T, class Compare, class AllocatorOrContainer>
- #endif
- class flat_map
- {
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- private:
- BOOST_COPYABLE_AND_MOVABLE(flat_map)
-
- typedef dtl::flat_tree<
- std::pair<Key, T>,
- dtl::select1st<Key>,
- Compare,
- AllocatorOrContainer> tree_t;
-
- typedef dtl::flat_tree<
- dtl::pair<Key, T>,
- dtl::select1st<Key>,
- Compare,
- typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
- > impl_tree_t;
- impl_tree_t m_flat_tree;
- typedef typename impl_tree_t::value_type impl_value_type;
- typedef typename impl_tree_t::const_iterator impl_const_iterator;
- typedef typename impl_tree_t::iterator impl_iterator;
- typedef typename impl_tree_t::allocator_type impl_allocator_type;
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- typedef std::initializer_list<impl_value_type> impl_initializer_list;
- #endif
- typedef dtl::flat_tree_value_compare
- < Compare
- , dtl::select1st<Key>
- , std::pair<Key, T> > value_compare_t;
- typedef typename tree_t::iterator iterator_t;
- typedef typename tree_t::const_iterator const_iterator_t;
- typedef typename tree_t::reverse_iterator reverse_iterator_t;
- typedef typename tree_t::const_reverse_iterator const_reverse_iterator_t;
- public:
- typedef typename impl_tree_t::stored_allocator_type impl_stored_allocator_type;
- typedef typename impl_tree_t::sequence_type impl_sequence_type;
- BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
- { return m_flat_tree; }
- BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
- { return m_flat_tree; }
- private:
- typedef typename tree_t::get_stored_allocator_const_return_t get_stored_allocator_const_return_t;
- typedef typename tree_t::get_stored_allocator_noconst_return_t get_stored_allocator_noconst_return_t;
- typedef typename impl_tree_t::get_stored_allocator_const_return_t impl_get_stored_allocator_const_return_t;
- typedef typename impl_tree_t::get_stored_allocator_noconst_return_t impl_get_stored_allocator_noconst_return_t;
- #endif
- public:
-
-
-
-
-
- typedef Key key_type;
- typedef T mapped_type;
- typedef Compare key_compare;
- typedef std::pair<Key, T> value_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;
- typedef typename sequence_type::allocator_type allocator_type;
- typedef ::boost::container::allocator_traits<allocator_type> allocator_traits_type;
- typedef typename sequence_type::pointer pointer;
- typedef typename sequence_type::const_pointer const_pointer;
- typedef typename sequence_type::reference reference;
- typedef typename sequence_type::const_reference const_reference;
- typedef typename sequence_type::size_type size_type;
- typedef typename sequence_type::difference_type difference_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;
- typedef typename sequence_type::iterator iterator;
- typedef typename sequence_type::const_iterator const_iterator;
- typedef typename sequence_type::reverse_iterator reverse_iterator;
- typedef typename sequence_type::const_reverse_iterator const_reverse_iterator;
- typedef BOOST_CONTAINER_IMPDEF(impl_value_type) movable_value_type;
-
- BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
- dtl::is_nothrow_default_constructible<Compare>::value)
- : m_flat_tree()
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE explicit flat_map(const allocator_type& a)
- : m_flat_tree(dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE explicit flat_map(const Compare& comp)
- : m_flat_tree(comp)
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(const Compare& comp, const allocator_type& a)
- : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last)
- : m_flat_tree(true, first, last)
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const allocator_type& a)
- : m_flat_tree(true, first, last, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp)
- : m_flat_tree(true, first, last, comp)
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
- : m_flat_tree(true, first, last, comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_map(ordered_unique_range_t, InputIterator first, InputIterator last)
- : m_flat_tree(ordered_range, first, last)
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
- : m_flat_tree(ordered_range, first, last, comp)
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
- : m_flat_tree(ordered_range, first, last, comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
- : m_flat_tree(ordered_range, first, last, Compare(), a)
- {}
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il)
- : m_flat_tree( true
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end())
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const allocator_type& a)
- : m_flat_tree( true
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp)
- : m_flat_tree(true
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp)
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
- : m_flat_tree(true
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp
- , dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il)
- : m_flat_tree(ordered_unique_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end())
- {}
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp)
- : m_flat_tree(ordered_unique_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp)
- {}
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
- : m_flat_tree( ordered_unique_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp
- , dtl::force<const impl_allocator_type>(a))
- {}
- #endif
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x)
- : m_flat_tree(x.m_flat_tree)
- {}
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x)
- BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
- : m_flat_tree(boost::move(x.m_flat_tree))
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x, const allocator_type &a)
- : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a)
- : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_COPY_ASSIGN_REF(flat_map) x)
- { m_flat_tree = x.m_flat_tree; return *this; }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_RV_REF(flat_map) x)
- BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
- allocator_traits_type::is_always_equal::value) &&
- boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
- { m_flat_tree = boost::move(x.m_flat_tree); return *this; }
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
- flat_map& operator=(std::initializer_list<value_type> il)
- {
- this->clear();
- this->insert(il.begin(), il.end());
- return *this;
- }
- #endif
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- get_stored_allocator_noconst_return_t get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
- {
- impl_get_stored_allocator_noconst_return_t r = m_flat_tree.get_stored_allocator();
- return dtl::force<stored_allocator_type>(r);
- }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- get_stored_allocator_const_return_t get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
- {
- impl_get_stored_allocator_const_return_t r = m_flat_tree.get_stored_allocator();
- return dtl::force<const stored_allocator_type>(r);
- }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.begin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator end() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.end()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.empty(); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.size(); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.max_size(); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.capacity(); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void reserve(size_type cnt)
- { m_flat_tree.reserve(cnt); }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()
- { m_flat_tree.shrink_to_fit(); }
-
-
-
-
-
- #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-
-
-
-
-
- mapped_type &operator[](const key_type& k);
-
-
-
-
-
-
- mapped_type &operator[](key_type &&k);
- #elif defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
-
- BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](const key_type &k) { return this->priv_subscript(k); }
- BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](BOOST_RV_REF(key_type) k) { return this->priv_subscript(::boost::move(k)); }
- #else
- BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript)
- #endif
-
-
-
-
-
-
-
-
-
-
-
-
- template <class M>
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)
- {
- return dtl::force_copy< std::pair<iterator, bool> >
- (this->m_flat_tree.insert_or_assign
- ( impl_const_iterator(), k, ::boost::forward<M>(obj))
- );
- }
-
-
-
-
-
-
-
-
-
-
-
-
- template <class M>
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
- {
- return dtl::force_copy< std::pair<iterator, bool> >
- (this->m_flat_tree.insert_or_assign
- ( impl_const_iterator(), ::boost::move(k), ::boost::forward<M>(obj))
- );
- }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- template <class M>
- BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)
- {
- return dtl::force_copy<iterator>
- (this->m_flat_tree.insert_or_assign
- ( dtl::force_copy<impl_const_iterator>(hint)
- , k, ::boost::forward<M>(obj)).first
- );
- }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- template <class M>
- BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
- {
- return dtl::force_copy<iterator>
- (this->m_flat_tree.insert_or_assign
- ( dtl::force_copy<impl_const_iterator>(hint)
- , ::boost::move(k), ::boost::forward<M>(obj)).first
- );
- }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p)); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD T& at(const key_type& k)
- {
- iterator i = this->find(k);
- if(i == this->end()){
- throw_out_of_range("flat_map::at key not found");
- }
- return i->second;
- }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD const T& at(const key_type& k) const
- {
- const_iterator i = this->find(k);
- if(i == this->end()){
- throw_out_of_range("flat_map::at key not found");
- }
- return i->second;
- }
-
-
-
-
-
- #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)
- { return dtl::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); }
-
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.emplace_hint_unique( dtl::force_copy<impl_const_iterator>(hint)
- , boost::forward<Args>(args)...));
- }
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy< std::pair<iterator, bool> >(
- m_flat_tree.try_emplace(impl_const_iterator(), k, boost::forward<Args>(args)...));
- }
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy<iterator>(m_flat_tree.try_emplace
- (dtl::force_copy<impl_const_iterator>(hint), k, boost::forward<Args>(args)...).first);
- }
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy< std::pair<iterator, bool> >
- (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k), boost::forward<Args>(args)...));
- }
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.try_emplace(dtl::force_copy
- <impl_const_iterator>(hint), boost::move(k), boost::forward<Args>(args)...).first);
- }
- #else
- #define BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE(N) \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\
- {\
- return dtl::force_copy< std::pair<iterator, bool> >\
- (m_flat_tree.emplace_unique(BOOST_MOVE_FWD##N));\
- }\
- \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- {\
- return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_unique\
- (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
- }\
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- {\
- return dtl::force_copy< std::pair<iterator, bool> >\
- (m_flat_tree.try_emplace(impl_const_iterator(), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
- }\
- \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- { return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
- (dtl::force_copy<impl_const_iterator>(hint), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
- \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- {\
- return dtl::force_copy< std::pair<iterator, bool> >\
- (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
- }\
- \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- { return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
- (dtl::force_copy<impl_const_iterator>(hint), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
-
- BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE)
- #undef BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE
- #endif
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(const value_type& x)
- { return dtl::force_copy<std::pair<iterator,bool> >(
- m_flat_tree.insert_unique(dtl::force<const impl_value_type>(x))); }
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(BOOST_RV_REF(value_type) x)
- {
- return dtl::force_copy<std::pair<iterator,bool> >(
- m_flat_tree.insert_unique(boost::move(dtl::force<impl_value_type>(x))));
- }
-
-
-
-
-
-
-
-
-
-
-
- template <class Pair>
- BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
- ( std::pair<iterator BOOST_MOVE_I bool>
- , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
- BOOST_MOVE_I std::pair<iterator BOOST_MOVE_I bool> >::type)
- insert(BOOST_FWD_REF(Pair) x)
- {
- return dtl::force_copy<std::pair<iterator,bool> >
- (m_flat_tree.emplace_unique(boost::forward<Pair>(x)));
- }
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
- , dtl::force<const impl_value_type>(x)));
- }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
- , boost::move(dtl::force<impl_value_type>(x))));
- }
-
-
-
-
-
-
-
-
-
- template <class Pair>
- BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
- ( iterator
- , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
- BOOST_MOVE_I iterator>::type)
- insert(const_iterator p, BOOST_FWD_REF(Pair) x)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.emplace_hint_unique(dtl::force_copy<impl_const_iterator>(p), boost::forward<Pair>(x)));
- }
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
- { m_flat_tree.insert_unique(first, last); }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, InputIterator first, InputIterator last)
- { m_flat_tree.insert_unique(ordered_unique_range, first, last); }
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
- {
- m_flat_tree.insert_unique( dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end());
- }
-
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, std::initializer_list<value_type> il)
- {
- m_flat_tree.insert_unique(ordered_unique_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end());
- }
- #endif
-
-
-
-
-
-
-
-
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
- { m_flat_tree.merge_unique(source.tree()); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
- { return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
- { m_flat_tree.merge_unique(source.tree()); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
- { return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
- }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
- { return m_flat_tree.erase_unique(x); }
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
- , dtl::force_copy<impl_const_iterator>(last)));
- }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void swap(flat_map& x)
- BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
- && boost::container::dtl::is_nothrow_swappable<Compare>::value )
- { m_flat_tree.swap(x.m_flat_tree); }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
- { m_flat_tree.clear(); }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- key_compare key_comp() const
- { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- value_compare value_comp() const
- { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator find(const key_type& x)
- { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator find(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator find(const K& x)
- { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator find(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type count(const key_type& x) const
- { return static_cast<size_type>(m_flat_tree.find(x) != m_flat_tree.end()); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type count(const K& x) const
-
-
- { return m_flat_tree.count(x); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool contains(const key_type& x) const
- { return m_flat_tree.find(x) != m_flat_tree.end(); }
-
-
-
-
-
-
-
- template<typename K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool contains(const K& x) const
- { return m_flat_tree.find(x) != m_flat_tree.end(); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator lower_bound(const key_type& x)
- { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator lower_bound(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator lower_bound(const K& x)
- { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator lower_bound(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator upper_bound(const key_type& x)
- { return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator upper_bound(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator upper_bound(const K& x)
- { return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator upper_bound(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<iterator,iterator> equal_range(const key_type& x)
- { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.lower_bound_range(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
- { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.lower_bound_range(x)); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<iterator,iterator> equal_range(const K& x)
-
-
- { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<const_iterator, const_iterator> equal_range(const K& x) const
-
-
- { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE sequence_type extract_sequence()
- {
- return boost::move(dtl::force<sequence_type>(m_flat_tree.get_sequence_ref()));
- }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
- { this->m_flat_tree.adopt_sequence_unique(boost::move(dtl::force<impl_sequence_type>(seq))); }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_unique_range_t, BOOST_RV_REF(sequence_type) seq)
- { this->m_flat_tree.adopt_sequence_unique(ordered_unique_range_t(), boost::move(dtl::force<impl_sequence_type>(seq))); }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE const sequence_type & sequence() const BOOST_NOEXCEPT
- { return dtl::force<sequence_type>(m_flat_tree.get_sequence_cref()); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator==(const flat_map& x, const flat_map& y)
- { return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin()); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator!=(const flat_map& x, const flat_map& y)
- { return !(x == y); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator<(const flat_map& x, const flat_map& y)
- { return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); }
- //! <b>Effects</b>: Returns true if x is greater than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator>(const flat_map& x, const flat_map& y)
- { return y < x; }
- //! <b>Effects</b>: Returns true if x is equal or less than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator<=(const flat_map& x, const flat_map& y)
- { return !(y < x); }
- //! <b>Effects</b>: Returns true if x is equal or greater than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator>=(const flat_map& x, const flat_map& y)
- { return !(x < y); }
- //! <b>Effects</b>: x.swap(y)
-
-
- BOOST_CONTAINER_FORCEINLINE friend void swap(flat_map& x, flat_map& y)
- BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
- { x.swap(y); }
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- private:
- mapped_type &priv_subscript(const key_type& k)
- {
- iterator i = this->lower_bound(k);
-
- if (i == end() || key_comp()(k, (*i).first)){
- dtl::value_init<mapped_type> m;
- impl_value_type v(k, ::boost::move(m.m_t));
- i = this->insert(i, ::boost::move(v));
- }
- return (*i).second;
- }
- mapped_type &priv_subscript(BOOST_RV_REF(key_type) mk)
- {
- key_type &k = mk;
- iterator i = this->lower_bound(k);
-
- if (i == end() || key_comp()(k, (*i).first)){
- dtl::value_init<mapped_type> m;
- impl_value_type v(::boost::move(k), ::boost::move(m.m_t));
- i = this->insert(i, ::boost::move(v));
- }
- return (*i).second;
- }
- #endif
- };
- #ifndef BOOST_CONTAINER_NO_CXX17_CTAD
- template <typename InputIterator>
- flat_map(InputIterator, InputIterator) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>>;
- template < typename InputIterator, typename AllocatorOrCompare>
- flat_map(InputIterator, InputIterator, AllocatorOrCompare const&) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , typename dtl::if_c< // Compare
- dtl::is_allocator<AllocatorOrCompare>::value
- , std::less<it_based_non_const_first_type_t<InputIterator>>
- , AllocatorOrCompare
- >::type
- , typename dtl::if_c< // Allocator
- dtl::is_allocator<AllocatorOrCompare>::value
- , AllocatorOrCompare
- , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
- >::type
- >;
- template < typename InputIterator, typename Compare, typename Allocator
- , typename = dtl::require_nonallocator_t<Compare>
- , typename = dtl::require_allocator_t<Allocator>>
- flat_map(InputIterator, InputIterator, Compare const&, Allocator const&) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , Compare
- , Allocator>;
- template <typename InputIterator>
- flat_map(ordered_unique_range_t, InputIterator, InputIterator) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>>;
- template < typename InputIterator, typename AllocatorOrCompare>
- flat_map(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , typename dtl::if_c< // Compare
- dtl::is_allocator<AllocatorOrCompare>::value
- , std::less<it_based_non_const_first_type_t<InputIterator>>
- , AllocatorOrCompare
- >::type
- , typename dtl::if_c< // Allocator
- dtl::is_allocator<AllocatorOrCompare>::value
- , AllocatorOrCompare
- , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
- >::type
- >;
- template < typename InputIterator, typename Compare, typename Allocator
- , typename = dtl::require_nonallocator_t<Compare>
- , typename = dtl::require_allocator_t<Allocator>>
- flat_map(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
- flat_map< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , Compare
- , Allocator>;
- #endif
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- }
- template <class Key, class T, class Compare, class AllocatorOrContainer>
- struct has_trivial_destructor_after_move<boost::container::flat_map<Key, T, Compare, AllocatorOrContainer> >
- {
- typedef ::boost::container::dtl::pair<Key, T> value_t;
- typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
- typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
- static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
- };
- namespace container {
- #endif
- #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
- template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
- #else
- template <class Key, class T, class Compare, class AllocatorOrContainer>
- #endif
- class flat_multimap
- {
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- private:
- BOOST_COPYABLE_AND_MOVABLE(flat_multimap)
- typedef dtl::flat_tree<
- std::pair<Key, T>,
- dtl::select1st<Key>,
- Compare,
- AllocatorOrContainer> tree_t;
-
- typedef dtl::flat_tree<
- dtl::pair<Key, T>,
- dtl::select1st<Key>,
- Compare,
- typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
- > impl_tree_t;
- impl_tree_t m_flat_tree;
- typedef typename impl_tree_t::value_type impl_value_type;
- typedef typename impl_tree_t::const_iterator impl_const_iterator;
- typedef typename impl_tree_t::iterator impl_iterator;
- typedef typename impl_tree_t::allocator_type impl_allocator_type;
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
- typedef std::initializer_list<impl_value_type> impl_initializer_list;
- #endif
- typedef dtl::flat_tree_value_compare
- < Compare
- , dtl::select1st<Key>
- , std::pair<Key, T> > value_compare_t;
- typedef typename tree_t::iterator iterator_t;
- typedef typename tree_t::const_iterator const_iterator_t;
- typedef typename tree_t::reverse_iterator reverse_iterator_t;
- typedef typename tree_t::const_reverse_iterator const_reverse_iterator_t;
- public:
- typedef typename impl_tree_t::stored_allocator_type impl_stored_allocator_type;
- typedef typename impl_tree_t::sequence_type impl_sequence_type;
- BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
- { return m_flat_tree; }
- BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
- { return m_flat_tree; }
- private:
- #endif
- public:
-
-
-
-
-
- typedef Key key_type;
- typedef T mapped_type;
- typedef Compare key_compare;
- typedef std::pair<Key, T> value_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;
- typedef typename sequence_type::allocator_type allocator_type;
- typedef ::boost::container::allocator_traits<allocator_type> allocator_traits_type;
- typedef typename sequence_type::pointer pointer;
- typedef typename sequence_type::const_pointer const_pointer;
- typedef typename sequence_type::reference reference;
- typedef typename sequence_type::const_reference const_reference;
- typedef typename sequence_type::size_type size_type;
- typedef typename sequence_type::difference_type difference_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;
- typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;
- typedef typename sequence_type::iterator iterator;
- typedef typename sequence_type::const_iterator const_iterator;
- typedef typename sequence_type::reverse_iterator reverse_iterator;
- typedef typename sequence_type::const_reverse_iterator const_reverse_iterator;
- typedef BOOST_CONTAINER_IMPDEF(impl_value_type) movable_value_type;
-
- BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE flat_multimap()
- BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
- dtl::is_nothrow_default_constructible<Compare>::value)
- : m_flat_tree()
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const allocator_type& a)
- : m_flat_tree(dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const Compare& comp)
- : m_flat_tree(comp)
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(const Compare& comp, const allocator_type& a)
- : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(InputIterator first, InputIterator last)
- : m_flat_tree(false, first, last)
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(InputIterator first, InputIterator last, const allocator_type& a)
- : m_flat_tree(false, first, last, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(InputIterator first, InputIterator last, const Compare& comp)
- : m_flat_tree(false, first, last, comp)
- {}
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
- : m_flat_tree(false, first, last, comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, InputIterator first, InputIterator last)
- : m_flat_tree(ordered_range, first, last)
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
- : m_flat_tree(ordered_range, first, last, comp)
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
- : m_flat_tree(ordered_range, first, last, comp, a)
- {}
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const allocator_type &a)
- : m_flat_tree(ordered_range, first, last, Compare(), a)
- {}
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(std::initializer_list<value_type> il)
- : m_flat_tree( false
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end())
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(std::initializer_list<value_type> il, const allocator_type& a)
- : m_flat_tree(false
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(std::initializer_list<value_type> il, const Compare& comp)
- : m_flat_tree(false
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end(), comp)
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
- : m_flat_tree( false
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, std::initializer_list<value_type> il)
- : m_flat_tree( ordered_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end())
- {}
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp)
- : m_flat_tree( ordered_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end(), comp)
- {}
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
- : m_flat_tree( ordered_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end()
- , comp, dtl::force<const impl_allocator_type>(a))
- {}
- #endif
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(const flat_multimap& x)
- : m_flat_tree(x.m_flat_tree)
- {}
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(BOOST_RV_REF(flat_multimap) x)
- BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
- : m_flat_tree(boost::move(x.m_flat_tree))
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(const flat_multimap& x, const allocator_type &a)
- : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap(BOOST_RV_REF(flat_multimap) x, const allocator_type &a)
- : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
- {}
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap& operator=(BOOST_COPY_ASSIGN_REF(flat_multimap) x)
- { m_flat_tree = x.m_flat_tree; return *this; }
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap& operator=(BOOST_RV_REF(flat_multimap) x)
- BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
- allocator_traits_type::is_always_equal::value) &&
- boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
- { m_flat_tree = boost::move(x.m_flat_tree); return *this; }
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- flat_multimap& operator=(std::initializer_list<value_type> il)
- {
- this->clear();
- this->insert(il.begin(), il.end());
- return *this;
- }
- #endif
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force<const stored_allocator_type>(m_flat_tree.get_stored_allocator()); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.begin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator end() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.end()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.empty(); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.size(); }
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.max_size(); }
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.capacity(); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- void reserve(size_type cnt)
- { m_flat_tree.reserve(cnt); }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE
- void shrink_to_fit()
- { m_flat_tree.shrink_to_fit(); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
- { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p)); }
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
- { return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p)); }
- #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE
- iterator emplace(BOOST_FWD_REF(Args)... args)
- { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Args>(args)...)); }
-
-
-
-
-
-
-
-
-
-
-
-
- template <class... Args>
- BOOST_CONTAINER_FORCEINLINE
- iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
- {
- return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal
- (dtl::force_copy<impl_const_iterator>(hint), boost::forward<Args>(args)...));
- }
- #else
- #define BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE(N) \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
- { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(BOOST_MOVE_FWD##N)); }\
- \
- BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
- BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
- {\
- return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal\
- (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
- }\
-
- BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE)
- #undef BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE
- #endif
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator insert(const value_type& x)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.insert_equal(dtl::force<const impl_value_type>(x)));
- }
-
-
-
-
-
-
-
- template<class Pair>
- BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
- ( iterator
- , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
- BOOST_MOVE_I iterator >::type)
- insert(BOOST_FWD_REF(Pair) x)
- { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Pair>(x))); }
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.insert_equal( dtl::force_copy<impl_const_iterator>(p)
- , dtl::force<const impl_value_type>(x)));
- }
-
-
-
-
-
-
-
-
-
-
-
- template<class Pair>
- BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
- ( iterator
- , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
- BOOST_MOVE_I iterator>::type)
- insert(const_iterator p, BOOST_FWD_REF(Pair) x)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.emplace_hint_equal(dtl::force_copy<impl_const_iterator>(p), boost::forward<Pair>(x)));
- }
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
- { m_flat_tree.insert_equal(first, last); }
-
-
-
-
-
-
-
-
-
-
-
-
-
- template <class InputIterator>
- BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, InputIterator first, InputIterator last)
- { m_flat_tree.insert_equal(ordered_range, first, last); }
- #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
- {
- m_flat_tree.insert_equal( dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end());
- }
-
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, std::initializer_list<value_type> il)
- {
- m_flat_tree.insert_equal( ordered_range
- , dtl::force<impl_initializer_list>(il).begin()
- , dtl::force<impl_initializer_list>(il).end());
- }
- #endif
-
-
-
-
-
-
-
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
- { m_flat_tree.merge_equal(source.tree()); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
- { return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
- { m_flat_tree.merge_equal(source.tree()); }
-
- template<class C2>
- BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
- { return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
- {
- return dtl::force_copy<iterator>(
- m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
- }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
- { return m_flat_tree.erase(x); }
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
- {
- return dtl::force_copy<iterator>
- (m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
- , dtl::force_copy<impl_const_iterator>(last)));
- }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void swap(flat_multimap& x)
- BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
- && boost::container::dtl::is_nothrow_swappable<Compare>::value )
- { m_flat_tree.swap(x.m_flat_tree); }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
- { m_flat_tree.clear(); }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- key_compare key_comp() const
- { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- value_compare value_comp() const
- { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); }
-
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator find(const key_type& x)
- { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator find(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator find(const K& x)
- { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator find(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type count(const key_type& x) const
- { return m_flat_tree.count(x); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- size_type count(const K& x) const
- { return m_flat_tree.count(x); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool contains(const key_type& x) const
- { return m_flat_tree.find(x) != m_flat_tree.end(); }
-
-
-
-
-
-
-
- template<typename K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- bool contains(const K& x) const
- { return m_flat_tree.find(x) != m_flat_tree.end(); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator lower_bound(const key_type& x)
- { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator lower_bound(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator lower_bound(const K& x)
- { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator lower_bound(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator upper_bound(const key_type& x)
- {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator upper_bound(const key_type& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- iterator upper_bound(const K& x)
- {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- const_iterator upper_bound(const K& x) const
- { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<iterator,iterator> equal_range(const key_type& x)
- { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
- { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<iterator,iterator> equal_range(const K& x)
- { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
-
-
-
- template<class K>
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- std::pair<const_iterator, const_iterator> equal_range(const K& x) const
- { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }
-
-
-
-
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- sequence_type extract_sequence()
- { return boost::move(dtl::force<sequence_type>(m_flat_tree.get_sequence_ref())); }
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
- { this->m_flat_tree.adopt_sequence_equal(boost::move(dtl::force<impl_sequence_type>(seq))); }
-
-
-
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_range_t, BOOST_RV_REF(sequence_type) seq)
- { this->m_flat_tree.adopt_sequence_equal(ordered_range_t(), boost::move(dtl::force<impl_sequence_type>(seq))); }
-
-
-
-
-
- BOOST_CONTAINER_FORCEINLINE const sequence_type & sequence() const BOOST_NOEXCEPT
- { return dtl::force<sequence_type>(m_flat_tree.get_sequence_cref()); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator==(const flat_multimap& x, const flat_multimap& y)
- { return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin()); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator!=(const flat_multimap& x, const flat_multimap& y)
- { return !(x == y); }
-
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator<(const flat_multimap& x, const flat_multimap& y)
- { return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); }
- //! <b>Effects</b>: Returns true if x is greater than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator>(const flat_multimap& x, const flat_multimap& y)
- { return y < x; }
- //! <b>Effects</b>: Returns true if x is equal or less than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator<=(const flat_multimap& x, const flat_multimap& y)
- { return !(y < x); }
- //! <b>Effects</b>: Returns true if x is equal or greater than y
-
-
- BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
- friend bool operator>=(const flat_multimap& x, const flat_multimap& y)
- { return !(x < y); }
- //! <b>Effects</b>: x.swap(y)
-
-
- BOOST_CONTAINER_FORCEINLINE friend void swap(flat_multimap& x, flat_multimap& y)
- BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
- { x.swap(y); }
- };
- #ifndef BOOST_CONTAINER_NO_CXX17_CTAD
- template <typename InputIterator>
- flat_multimap(InputIterator, InputIterator) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>>;
- template < typename InputIterator, typename AllocatorOrCompare>
- flat_multimap(InputIterator, InputIterator, AllocatorOrCompare const&) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , typename dtl::if_c< // Compare
- dtl::is_allocator<AllocatorOrCompare>::value
- , std::less<it_based_non_const_first_type_t<InputIterator>>
- , AllocatorOrCompare
- >::type
- , typename dtl::if_c< // Allocator
- dtl::is_allocator<AllocatorOrCompare>::value
- , AllocatorOrCompare
- , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
- >::type
- >;
- template < typename InputIterator, typename Compare, typename Allocator
- , typename = dtl::require_nonallocator_t<Compare>
- , typename = dtl::require_allocator_t<Allocator>>
- flat_multimap(InputIterator, InputIterator, Compare const&, Allocator const&) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , Compare
- , Allocator>;
- template <typename InputIterator>
- flat_multimap(ordered_range_t, InputIterator, InputIterator) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>>;
- template < typename InputIterator, typename AllocatorOrCompare>
- flat_multimap(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , typename dtl::if_c< // Compare
- dtl::is_allocator<AllocatorOrCompare>::value
- , std::less<it_based_non_const_first_type_t<InputIterator>>
- , AllocatorOrCompare
- >::type
- , typename dtl::if_c< // Allocator
- dtl::is_allocator<AllocatorOrCompare>::value
- , AllocatorOrCompare
- , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
- >::type
- >;
- template < typename InputIterator, typename Compare, typename Allocator
- , typename = dtl::require_nonallocator_t<Compare>
- , typename = dtl::require_allocator_t<Allocator>>
- flat_multimap(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
- flat_multimap< it_based_non_const_first_type_t<InputIterator>
- , it_based_second_type_t<InputIterator>
- , Compare
- , Allocator>;
- #endif
- }}
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- namespace boost {
- template <class Key, class T, class Compare, class AllocatorOrContainer>
- struct has_trivial_destructor_after_move< boost::container::flat_multimap<Key, T, Compare, AllocatorOrContainer> >
- {
- typedef ::boost::container::dtl::pair<Key, T> value_t;
- typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
- typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
- static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
- };
- }
- #endif
- #include <boost/container/detail/config_end.hpp>
- #endif
|