element_type* get() const noexcept;
T& operator*() const noexcept;
Remarks: When T is an array type or cv void, it is unspecified whether this member function is declared. If it is declared, it is unspecified what its return type is, except that the declaration (although not necessarily the definition) of the function shall be well formed.
T* operator->() const noexcept;
Remarks: When T is an array type, it is unspecified whether this member function is declared. If it is declared, it is unspecified what its return type is, except that the declaration (although not necessarily the definition) of the function shall be well formed.
element_type& operator[](ptrdiff_t i) const;
Remarks: When T is not an array type, it is unspecified whether this member function is declared. If it is declared, it is unspecified what its return type is, except that the declaration (although not necessarily the definition) of the function shall be well formed.
long use_count() const noexcept;
Returns: The number of shared_Βptr objects, *this included, that share ownership with *this, or 0 when *this is empty.
[βNote: get() == nullptr does not imply a specific return value of use_Βcount(). βββend noteβ]
[βNote: weak_Βptr<T>β::βlock() can affect the return value of use_Βcount(). βββend noteβ]
[βNote: When multiple threads can affect the return value of use_Βcount(), the result should be treated as approximate. In particular, use_Βcount() == 1 does not imply that accesses through a previously destroyed shared_Βptr have in any sense completed. βββend noteβ]
explicit operator bool() const noexcept;
template<class U> bool owner_before(const shared_ptr<U>& b) const noexcept;
template<class U> bool owner_before(const weak_ptr<U>& b) const noexcept;
Returns: An unspecified value such that
x.owner_Βbefore(y) defines a strict weak ordering as defined in [alg.sorting];
under the equivalence relation defined by owner_Βbefore, !a.owner_Βbefore(b) && !b.owner_Βbefore(a), two shared_Βptr or weak_Βptr instances are equivalent if and only if they share ownership or are both empty.