Fiber::ChartIDList Class Reference

Inheritance diagram for Fiber::ChartIDList:

Public Member Functions
RefPtr< ChartID >	operator() (const string &name) const
	Find a certain name.
RefPtr< ChartID >	operator[] (const string &name)
	Get the ChartID of a certain name - create one of not existent yet.
bool	insertSharedChartID (const RefPtr< ChartID > &id)
	Insert a chart ID from another instance, returning false if such an ID already exists.
unsigned	epsg_iterate (uint16_t epsg_code, const std::function< bool(const ChartID &)> &iterator) const
Public Member Functions inherited from std::set< RefPtr< ChartID > >
	set (_InputIterator __first, _InputIterator __last)
	set (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
	set (_InputIterator __first, _InputIterator __last, const allocator_type &__a)
	set (const _Compare &__comp, const allocator_type &__a=allocator_type())
	set (const allocator_type &__a)
	set (const set &)=default
	set (const set &__x, const __type_identity_t< allocator_type > &__a)
	set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
	set (initializer_list< value_type > __l, const allocator_type &__a)
	set (set &&)=default
	set (set &&__x, const __type_identity_t< allocator_type > &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())
iterator	begin () const noexcept
iterator	cbegin () const noexcept
iterator	cend () const noexcept
void	clear () noexcept
reverse_iterator	crbegin () const noexcept
reverse_iterator	crend () const noexcept
std::pair< iterator, bool >	emplace (_Args &&... __args)
iterator	emplace_hint (const_iterator __pos, _Args &&... __args)
bool	empty () const noexcept
iterator	end () const noexcept
size_type	erase (const key_type &__x)
_GLIBCXX_ABI_TAG_CXX11 iterator	erase (const_iterator __first, const_iterator __last)
_GLIBCXX_ABI_TAG_CXX11 iterator	erase (const_iterator __position)
node_type	extract (const key_type &__x)
node_type	extract (const_iterator __pos)
allocator_type	get_allocator () const noexcept
void	insert (_InputIterator __first, _InputIterator __last)
std::pair< iterator, bool >	insert (const value_type &__x)
iterator	insert (const_iterator __hint, node_type &&__nh)
iterator	insert (const_iterator __position, const value_type &__x)
void	insert (initializer_list< value_type > __l)
insert_return_type	insert (node_type &&__nh)
key_compare	key_comp () const
size_type	max_size () const noexcept
set &	operator= (const set &)=default
set &	operator= (initializer_list< value_type > __l)
set &	operator= (set &&)=default
reverse_iterator	rbegin () const noexcept
reverse_iterator	rend () const noexcept
size_type	size () const noexcept
void	swap (set &__x) noexcept(/*conditional */)
value_compare	value_comp () const
size_type	count (const key_type &__x) const
auto	count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
size_type	count (const key_type &__x) const
auto	count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
bool	contains (const key_type &__x) const
auto	contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true)
bool	contains (const key_type &__x) const
auto	contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true)
iterator	find (const key_type &__x)
const_iterator	find (const key_type &__x) const
auto	find (const _Kt &__x) -> decltype(iterator{_M_t._M_find_tr(__x)})
auto	find (const _Kt &__x) const -> decltype(const_iterator{_M_t._M_find_tr(__x)})
iterator	find (const key_type &__x)
const_iterator	find (const key_type &__x) const
auto	find (const _Kt &__x) -> decltype(iterator{_M_t._M_find_tr(__x)})
auto	find (const _Kt &__x) const -> decltype(const_iterator{_M_t._M_find_tr(__x)})
iterator	lower_bound (const key_type &__x)
const_iterator	lower_bound (const key_type &__x) const
auto	lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
auto	lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
iterator	lower_bound (const key_type &__x)
const_iterator	lower_bound (const key_type &__x) const
auto	lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
auto	lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
iterator	upper_bound (const key_type &__x)
const_iterator	upper_bound (const key_type &__x) const
auto	upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
auto	upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
iterator	upper_bound (const key_type &__x)
const_iterator	upper_bound (const key_type &__x) const
auto	upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
auto	upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
std::pair< iterator, iterator >	equal_range (const key_type &__x)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const
auto	equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
auto	equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
std::pair< iterator, iterator >	equal_range (const key_type &__x)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const
auto	equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
auto	equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
Public Member Functions inherited from MemCore::ReferenceBase< ChartIDList >
auto	getObjectCountID () const noexcept
bool	isIdentical (const WeakPtr< Object, Object > &PossibleSelf) const noexcept
void	mkAutoDestructive ()
refcount_t	refcount () const noexcept
	ReferenceBase (Object *that) noexcept
const auto &	self () const
refcount_t	wrefcount () const noexcept

Friends
class	GlobalCharts

Additional Inherited Members
Public Types inherited from std::set< RefPtr< ChartID > >
typedef _Key	key_type
typedef _Key	key_type
typedef _Key	value_type
typedef _Key	value_type
typedef _Compare	key_compare
typedef _Compare	key_compare
typedef _Compare	value_compare
typedef _Compare	value_compare
typedef _Alloc	allocator_type
typedef _Alloc	allocator_type
typedef _Alloc_traits::pointer	pointer
typedef _Alloc_traits::pointer	pointer
typedef _Alloc_traits::const_pointer	const_pointer
typedef _Alloc_traits::const_pointer	const_pointer
typedef _Alloc_traits::reference	reference
typedef _Alloc_traits::reference	reference
typedef _Alloc_traits::const_reference	const_reference
typedef _Alloc_traits::const_reference	const_reference
typedef _Rep_type::const_iterator	iterator
typedef _Rep_type::const_iterator	iterator
typedef _Rep_type::const_iterator	const_iterator
typedef _Rep_type::const_iterator	const_iterator
typedef _Rep_type::const_reverse_iterator	reverse_iterator
typedef _Rep_type::const_reverse_iterator	reverse_iterator
typedef _Rep_type::const_reverse_iterator	const_reverse_iterator
typedef _Rep_type::const_reverse_iterator	const_reverse_iterator
typedef _Rep_type::size_type	size_type
typedef _Rep_type::size_type	size_type
typedef _Rep_type::difference_type	difference_type
typedef _Rep_type::difference_type	difference_type
Public Types inherited from MemCore::ReferenceBase< ChartIDList >
typedef Object	reference_domain_t
typedef WeakPtr< Object, Object >	SelfPtr_t
Public Attributes inherited from std::set< RefPtr< ChartID > >
K	keys
	STL member.
Protected Member Functions inherited from MemCore::ReferenceBase< ChartIDList >
virtual void	extremeUnction ()
ReferenceBase &	operator= (const ReferenceBase &R)
void	suicide ()