Section 3: library functions
std::experimental::simd – std::experimental::simd Synopsis Defined in header <experimental/simd> template< class T, class Abi = simd_abi::compatible<T> > class simd; The class template simd is a data-parallel type. The width of a given simd instantiation is a constant expression, determined by the template parameters. An ABI tag is a type in the simd_abi namespace that indicates a…
std::experimental::shuffle – std::experimental::shuffle Synopsis Defined in header<experimental / algorithm> template <class RandomIt> (library fundamentals TS v2) void shuffle(RandomIt first, RandomIt last); Reorders the elements in the given range [first, last) such that each possible permutation of those elements has equal probability of appearance, using the per-thread_random_number_engine as the random number generator. Parameters first, last –…
std::experimental::shared_ptr<T>::shared_ptr – std::experimental::shared_ptr<T>::shared_ptr Synopsis constexpr shared_ptr() noexcept; (1) constexpr shared_ptr(std::nullptr_t) noexcept; (2) template <class Y> (3) explicit shared_ptr(Y *ptr); template <class Y, class Deleter> (4) shared_ptr(Y *ptr, Deleter d); template <class Deleter> (5) shared_ptr(std::nullptr_t ptr, Deleter d); template <class Y, class Deleter, class Alloc> (6) shared_ptr(Y *ptr, Deleter d, Alloc alloc); template <class Deleter, class…
std::experimental::shared_ptr<T>::operator[] – std::experimental::shared_ptr<T>::operator[] Synopsis element_type& operator[](std::ptrdiff_t i) const noexcept; (library fundamentals TS) Index into the array pointed to by the stored pointer. The behavior is undefined if the stored pointer is null or if i is negative. If T (the template parameter of shared_ptr) is an array type U[N], i shall be less than N,…
std::experimental::shared_ptr<T>::operator*,std::experimental::shared_ptr<T>::operator-> – std::experimental::shared_ptr<T>::operator*,std::experimental::shared_ptr<T>::operator-> Synopsis T& operator*() const noexcept; (1) (library fundamentals TS) T* operator->() const noexcept; (2) (library fundamentals TS) Dereferences the stored pointer. The behavior is undefined if the stored pointer is null. Parameters (none) Return value 1) The result of dereferencing the stored pointer, i.e., *get() 2) The stored pointer, i.e., get() Remarks…
std::experimental::shared_ptr<T>::get – std::experimental::shared_ptr<T>::get Synopsis element_type* get() const noexcept; (library fundamentals TS) Returns the stored pointer. Parameters (none) Return value The stored pointer. Notes A shared_ptr may share ownership of an object while storing a pointer to another object. get() returns the stored pointer, not the managed pointer. Example This section is incomplete Reason: no example…
std::experimental::shared_ptr – std::experimental::shared_ptr Synopsis Defined in header <experimental/memory> template< class T > class shared_ptr; (library fundamentals TS) std::experimental::shared_ptr is a modified version of std::shared_ptr that adds support for arrays. Member types Member type Definition element_type std::remove_extent_t<T> Member functions constructs new shared_ptr constructor (public member function) Observers returns the stored pointer get (public member function) dereferences…
std::experimental::shared_future<T>::then – std::experimental::shared_future<T>::then Synopsis template <class F> future</* see below */> then(F &&func) const; Attach the continuation func to *this. The behavior is undefined if *this has no associated shared state (i.e., valid() == false). Creates a shared state associated with the future object to be returned, and a copy fd of func constructed as…
std::experimental::shared_future<T>::shared_future – std::experimental::shared_future<T>::shared_future Synopsis shared_future() noexcept; (1) shared_future(std::experimental::shared_future<T>&& f) noexcept; (2) shared_future(const std::experimental::shared_future<T>& f); (3) shared_future(std::experimental::future<std::experimental::shared_future<T>> && other) noexcept; (4) shared_future(std::experimental::future<T>&& f) noexcept; (5) 1) Default constructor. Constructs an empty shared_future object that does not refer to a shared state. 2) Constructs a shared_future object, transferring the shared state held by f, if any. After…
std::experimental::shared_future<T>::operator= – std::experimental::shared_future<T>::operator= Synopsis std::experimental::shared_future<T> &operator=(const std::experimental::shared_future<T> &other); (1) std::experimental::shared_future<T> & operator=(std::experimental::shared_future<T> &&other) noexcept; (2) Assigns the contents of another std::experimental::shared_future object. 1) Releases any shared state and assigns the contents of other to *this. After the assignment, this->valid() == other.valid(). 2) Releases any shared state and move-assigns the contents of other to *this. After…
std::experimental::shared_future<T>::is_ready – std::experimental::shared_future<T>::is_ready Synopsis bool is_ready() const; Checks if the associated shared state is ready. The behavior is undefined if valid() is false. Parameters (none) Return value true if the associated shared state is ready, otherwise false. Example This section is incomplete Reason: no example See also checks if the future has a shared state…
std::experimental::shared_future – std::experimental::shared_future Synopsis Defined in header <experimental/shared_future> template< class T > class shared_future; (1) (concurrency TS) template< class T > class shared_future<T&>; (2) (concurrency TS) template<> class shared_future<void>; (3) (concurrency TS) The class template std::experimental::shared_future extends std::shared_future with the following operations: * an unwrapping constructor from future<shared_future<T>>; * a member function is_ready to query…
std::experimental::search – std::experimental::search Synopsis Defined in header<experimental / algorithm> template <class ForwardIterator, class Searcher> ForwardIterator search(ForwardIterator first, ForwardIterator last, (library fundamentals TS) const Searcher &searcher); Searches the sequence [first, last) for the pattern specified in the constructor of searcher. Effectively executes searcher(first, last). (until C++17) Effectively executes searcher(first, last).first. (since C++17) Searcher need not be…
std::experimental::sample – std::experimental::sample Synopsis Defined in header <experimental/algorithm> template< class PopulationIterator, class SampleIterator, class Distance, class URBG > SampleIterator sample( PopulationIterator first, PopulationIterator last, (1) (library fundamentals TS) SampleIterator out, Distance n, URBG&& g); template< class PopulationIterator, class SampleIterator, class Distance > SampleIterator sample( PopulationIterator first, PopulationIterator last, (2) (library fundamentals TS v2) SampleIterator out,…
std::experimental::reseed – std::experimental::reseed Synopsis Defined in header <experimental/random> void reseed(); (1) (library fundamentals TS v2) void reseed(std::default_random_engine::result_type value); (2) (library fundamentals TS v2) Reseeds the per-thread_random_number_engine and any std::uniform_int_distribution instances used by randint. 1) Sets the per-thread engine to an unpredictable state. 2) Seeds the per-thread engine g as if by g.seed(value). Parameters value –…
std::experimental::ranges::value_type – std::experimental::ranges::value_type Synopsis Defined in header<experimental / ranges / iterator> template <class I> (1) struct value_type { }; template <class T> (2) struct value_type<T *>; template <class I> requires std::is_array<I>::value(3) struct value_type<I> : value_type<std::decay_t<I>> { }; template <class T> (4) struct value_type<const T> : value_type<std::decay_t<T>> { }; template <class T> requires requires { typename…
std::experimental::ranges::tagged_tuple – std::experimental::ranges::tagged_tuple Synopsis Defined in header <experimental/ranges/tuple> template< TaggedType… Types > (ranges TS) using tagged_tuple = /* see below */; Convenience alias template for naming a ranges::tagged wrapping a std::tuple. A TaggedType is a function type S(T), where S is a TagSpecifier and T is the type of the element. tagged_tuple<S1(T1), …, SN(TN)> is…
std::experimental::ranges::tagged_pair – std::experimental::ranges::tagged_pair Synopsis Defined in header <experimental/ranges/utility> template< TaggedType T1, TaggedType T2 > (ranges TS) using tagged_pair = /* see below */; Convenience alias template for naming a ranges::tagged wrapping a std::pair. A TaggedType is a function type S(T), where S is a TagSpecifier and T is the type of the element. tagged_pair<S1(T1), S2(T2)>…
std::experimental::ranges::tagged<Base,Tags…>::tagged – std::experimental::ranges::tagged<Base,Tags…>::tagged Synopsis using Base::Base; (1) tagged() = default; (2) tagged(tagged &&that) = default; (3) tagged(const tagged &that) = default; (4) tagged(Base &&that) noexcept(std::is_nothrow_move_constructible<Base>::value)(5) requires MoveConstructible<Base>; tagged(const Base &that) noexcept(std::is_nothrow_copy_constructible<Base>::value)(6) requires CopyConstructible<Base>; template <class Other> requires Constructible<Base, Other>(7) constexpr tagged(ranges::tagged<Other, Tags…> &&that) noexcept(std::is_nothrow_constructible<Base, Other>::value); template <class Other> requires Constructible<Base, const Other &>(8) constexpr tagged(const…
std::experimental::ranges::tag::in,in1,in2,out,out1,out2,fun,min,max,begin,end – std::experimental::ranges::tag::in,in1,in2,out,out1,out2,fun,min,max,begin,end Synopsis Defined in header<experimental / ranges / algorithm> struct in { /* implementation-defined */ }; struct in1 { /* implementation-defined */ }; struct in2 { /* implementation-defined */ }; struct out { /* implementation-defined */ }; struct out1 { /* implementation-defined */ }; struct out2 { /* implementation-defined */ }; (ranges TS)…