Section 3: library functions
std::experimental::disjunction – std::experimental::disjunction Synopsis Defined in header<experimental / type_traits> template <class… B> (library fundamentals TS v2) struct disjunction; Forms the logical_disjunction of the type traits B…, effectively performing a logical or on the sequence of traits. The specialization std::experimental::disjunction<B1, …, BN> has a public and unambiguous base that is * if sizeof…(B) == 0, std::false_type;…
std::experimental::default_searcher,std::experimental::make_default_searcher – std::experimental::default_searcher,std::experimental::make_default_searcher Synopsis Defined in header <experimental/functional> template< class ForwardIterator1, class BinaryPredicate = std::equal_to<> > (library fundamentals TS) class default_searcher; A class suitable for use with std::experimental::search that delegates the search operation to the standard library’s std::search. default_searcher is CopyConstructible and CopyAssignable. Member functions std::experimental::default_searcher::default_searcher default_searcher( ForwardIterator pat_first, ForwardIterator pat_last, BinaryPredicate pred = BinaryPredicate());…
std::experimental::const_where_expression – std::experimental::const_where_expression Synopsis Defined in header <experimental/simd> template < class M, class V > class const_where_expression; The class template const_where_expression abstracts the notion of selected elements of a given const object of arithmetic or data-parallel type. Selected elements signifies the elements data[i] for all i ∈ {j ∈ ℕ0 | j < M::size() ⋀…
std::experimental::conjunction – std::experimental::conjunction Synopsis Defined in header<experimental / type_traits> template <class… B> (library fundamentals TS v2) struct conjunction; Forms the logical_conjunction of the type traits B…, effectively performing a logical AND on the sequence of traits. The specialization std::experimental::conjunction<B1, …, BN> has a public and unambiguous base that is * if sizeof…(B) == 0, std::true_type;…
std::experimental::concat – std::experimental::concat Synopsis Defined in header<experimental / simd> template <class T, class… Abis> simd<T, simd_abi::deduce_t<T, (simd_size_v<T, Abis> + …)>>(1) concat(const simd<T, Abis> &…vs); template <class T, class… Abis> simd_mask<T, simd_abi::deduce_t<T, (simd_size_v<T, Abis> + …)>>(2) concat(const simd_mask<T, Abis> &…vs); Concatenates the input simd or simd_mask objects. Parameter vs – the input simd or simd_mask parameter…
std::experimental::clamp – std::experimental::clamp Synopsis Defined in header<experimental / simd> template <class T, class Abi> simd<T, Abi> clamp(const simd<T, Abi> &v, const simd<T, Abi> &lo, const simd<T, Abi> &hi); Parameters v – the elements to clamp lo, hi – the boundaries to clamp v to Return value The result of element-wise application of std::clamp(v[i], lo[i], hi[i])…
std::experimental::boyer_moore_searcher,std::experimental::make_boyer_moore_searcher – std::experimental::boyer_moore_searcher,std::experimental::make_boyer_moore_searcher Synopsis Defined in header <experimental/functional> template< class RandomIt1, class Hash = std::hash<typename std::iterator_traits<RandomIt1>::value_type>, (library fundamentals TS) class BinaryPredicate = std::equal_to<> > class boyer_moore_searcher; A searcher suitable for use with std::experimental::search that implements the Boyer-Moore_string_searching_algorithm. boyer_moore_searcher is CopyConstructible and CopyAssignable. RandomIt1 must meet the requirements of LegacyRandomAccessIterator. Member functions std::experimental::boyer_moore_searcher::boyer_moore_searcher boyer_moore_searcher( RandomIt1 pat_first,…
std::experimental::boyer_moore_horspool_searcher,std::experimental::make_boyer_moore_horspool_searcher – std::experimental::boyer_moore_horspool_searcher,std::experimental::make_boyer_moore_horspool_searcher Synopsis Defined in header <experimental/functional> template< class RandomIt1, class Hash = std::hash<typename std::iterator_traits<RandomIt1>::value_type>, (library fundamentals TS) class BinaryPredicate = std::equal_to<> > class boyer_moore_horspool_searcher; A searcher suitable for use with std::experimental::search that implements the Boyer-Moore-Horspool_string_searching_algorithm. boyer_moore_horspool_searcher is CopyConstructible and CopyAssignable. RandomIt1 must meet the requirements of LegacyRandomAccessIterator. Member functions std::experimental::boyer_moore_horspool_searcher::boyer_moore_horspool_searcher boyer_moore_horspool_searcher( RandomIt1 pat_first,…
std::experimental::basic_string_view<CharT,Traits>::to_string,std::experimental::basic_string_view<CharT,Traits>::operatorbasic_string – std::experimental::basic_string_view<CharT,Traits>::to_string,std::experimental::basic_string_view<CharT,Traits>::operatorbasic_string Synopsis template <class Allocator = allocator<CharT>> basic_string<CharT, Traits, Allocator>(library fundamentals TS) to_string(const Allocator &a = Allocator()) const; template <class Allocator> (library fundamentals TS) explicit operator basic_string<CharT, Traits, Allocator>() const; Creates a basic_string with a copy of the content of the current view. Template parameters Allocator – Allocator type used to allocate internal…
std::experimental::barrier::~barrier – std::experimental::barrier::~barrier Synopsis ~barrier(); (concurrency TS) Destroys the barrier. The behavior is undefined if a thread is blocked at the synchronization point.
std::experimental::barrier::arrive_and_wait – std::experimental::barrier::arrive_and_wait Synopsis void arrive_and_wait(); (concurrency TS) Blocks and arrive at the barrier’s synchronization point. The behavior is undefined if the calling thread is not in the set of participating threads of this barrier. Calls to arrive_and_wait synchronizes with the start of the completion phase of the barrier. The completion of the completion phase…
std::experimental::barrier::arrive_and_drop – std::experimental::barrier::arrive_and_drop Synopsis void arrive_and_drop(); (concurrency TS) Arrive at the barrier’s synchronization point and remove the current thread from the set of participating threads. It is unspecified whether this function blocks until the completion phase has ended. The behavior is undefined if the calling thread is not in the set of participating threads of…
std::experimental::barrier – std::experimental::barrier Synopsis Defined in header <experimental/barrier> class barrier; (concurrency TS) The class std::experimental::barrier provides a thread-coordination mechanism that allows a set of participating threads to block until an operation is completed. Unlike std::experimental::latch, barriers are reusable; once the participating threads are released from a barrier’s synchronization point, they can reuse the same barrier….
std::experimental::bad_optional_access – std::experimental::bad_optional_access Synopsis Defined in header <experimental/optional> class bad_optional_access; (library fundamentals TS) Defines a type of object to be thrown by std::experimental::optional::value when accessing an optional object that does not contain a value. std-bad optional access-inheritance.svg Inheritance diagram Member functions constructs the exception object constructor (public member function) Inherited from std::exception Member functions destructor…
std::experimental::bad_any_cast – std::experimental::bad_any_cast Synopsis Defined in header <experimental/any> class bad_any_cast : public std::bad_cast; (library fundamentals TS) Defines a type of object to be thrown by the value-returning forms of std::experimental::any_cast on failure. Inherited from std::exception Member functions destructor destroys the exception object (virtual public member function of std::exception) [virtual] what returns an explanatory string (virtual…
std::experimental::atomic_weak_ptr<T>::store – std::experimental::atomic_weak_ptr<T>::store Synopsis void store(weak_ptr<T> desired, std::memory_order order = std::memory_order_seq_cst) noexcept; Atomically replaces the current value with desired. Memory is affected according to the value of order. order must be one of std::memory_order_relaxed, std::memory_order_release or std::memory_order_seq_cst. Otherwise the behavior is undefined. Parameters desired – the weak_ptr to store into the atomic variable order –…
std::experimental::atomic_weak_ptr<T>::operatorweak_ptr<T> – std::experimental::atomic_weak_ptr<T>::operatorweak_ptr<T> Synopsis operator weak_ptr<T>() const noexcept; Atomically loads and returns the current value of the atomic_weak_ptr. Equivalent to load(). Parameters (none) Return value The current value of the atomic_weak_ptr. Remarks All associated use_count increments are guaranteed to be performed as part of the atomic operation. See also atomically obtains the value of the…
std::experimental::atomic_weak_ptr<T>::operator= – std::experimental::atomic_weak_ptr<T>::operator= Synopsis void operator=(weak_ptr<T> desired) noexcept; (1) void operator=(const atomic_weak_ptr &) = delete; (2) 1) Atomically assigns a value desired to the atomic variable. Equivalent to store(desired). 2) Atomic variables are not CopyAssignable. Parameters desired – value to assign Notes Unlike most assignment operators, the assignment operators for atomic_weak_ptr returns void. Remarks All…
std::experimental::atomic_weak_ptr<T>::load – std::experimental::atomic_weak_ptr<T>::load Synopsis weak_ptr<T> load(std::memory_order order = std::memory_order_seq_cst) const noexcept; Atomically loads and returns the current value of the atomic_weak_ptr. Memory is affected according to the value of order. order must be one of std::memory_order_relaxed, std::memory_order_consume, std::memory_order_acquire or std::memory_order_seq_cst. Otherwise the behavior is undefined. Parameters order – memory order constraints to enforce Remarks All…
std::experimental::atomic_weak_ptr<T>::is_lock_free – std::experimental::atomic_weak_ptr<T>::is_lock_free Synopsis bool is_lock_free() const noexcept; Checks whether the atomic operations on all objects of this type are lock-free. Parameters (none) Return value true if the atomic operations on the objects of this type are lock-free, false otherwise. See also std::atomic_is_lock_free(std::shared_ptr) std::atomic_load(std::shared_ptr) std::atomic_load_explicit(std::shared_ptr) std::atomic_store(std::shared_ptr) std::atomic_store_explicit(std::shared_ptr) std::atomic_exchange(std::shared_ptr) specializes atomic operations for std::shared_ptr std::atomic_exchange_explicit(std::shared_ptr) (function…