Defined in header <valarray> template< class T > valarray<T> cos( const valarray<T>& va ); For each element in va computes cosine of the value of the element. Parameters va - value array to apply the operation to Return value Value array containing cosines of the values in va. Notes Unqualified function (cos) is used to perform the computation. If such function is not available, std::cos is used due to argument dependent lookup. The fu

Defined in header <complex> template< class T > complex<T> cos( const complex<T>& z ); Computes complex cosine of a complex value z. Parameters z - complex value Return value If no errors occur, the complex cosine of z is returned. Errors and special cases are handled as if the operation is implemented by std::cosh(i*z), where i is the imaginary unit. Notes The cosine is an entire function on the complex plane, and has no branch cuts.

Defined in header <cmath> float cos( float arg ); (1) double cos( double arg ); (2) long double cos( long double arg ); (3) double cos( Integral arg ); (4) (since C++11) Computes the cosine of arg (measured in radians). 4) A set of overloads or a function template accepting an argument of any integral type. Equivalent to 2) (the argument is cast to double). Parameters arg - value representing angle in radians, of a floating-point o

Defined in header <algorithm> template< class InputIt, class Size, class OutputIt > OutputIt copy_n( InputIt first, Size count, OutputIt result ); (since C++11) Copies exactly count values from the range beginning at first to the range beginning at result, if count>0. Does nothing otherwise. Parameters first - the beginning of the range of elements to copy from count - number of the elements to copy result - the beginning of the destination rang

Defined in header <algorithm> template< class BidirIt1, class BidirIt2 > BidirIt2 copy_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); Copies the elements from the range, defined by [first, last), to another range ending at d_last. The elements are copied in reverse order (the last element is copied first), but their relative order is preserved. The behavior is undefined if d_last is within (first, last]. std::copy must be used instead of std::copy_backwar

Defined in header <cmath> float copysign( float x, float y ); (1) (since C++11) double copysign( double x, double y ); (2) (since C++11) long double copysign( long double x, long double y ); (3) (since C++11) Promoted copysign( Arithmetic1 x, Arithmetic2 y ); (4) (since C++11) 1-3) Composes a floating point value with the magnitude of x and the sign of y. 4) A set of overloads or a function template for all combinations of arguments of ari

Defined in header <algorithm> template< class InputIt, class OutputIt > OutputIt copy( InputIt first, InputIt last, OutputIt d_first ); (1) template< class InputIt, class OutputIt, class UnaryPredicate > OutputIt copy_if( InputIt first, InputIt last, OutputIt d_first, UnaryPredicate pred ); (2) (since C++11) Copies the elements in the range, defined by [first, last), to another range beginning at d_first. The second func

Defined in header <type_traits> template<class... B> struct conjunction; (1) (since C++17) Forms the logical conjunction of the type traits B.... The BaseCharacteristic of a specialization std::conjunction<B1, ..., BN> is the first Bi for which Bi::value == false, or if every Bi::value != false, the BaseCharacteristic is BN. If sizeof...(B) == 0, the BaseCharacteristic is std::true_type. Conjunction is short-circuiting: if there is a template type argument Bi wi

Defined in header <complex> template< class T > complex<T> conj( const complex<T>& z ); (1) std::complex<long double> conj( long double z ); (2) (since C++11) template< class DoubleOrIngeter > std::complex<double> conj( DoubleOrInteger z ); (3) (since C++11) std::complex<float> conj( float z ); (4) (since C++11) Computes the complex conjugate of z by reversing the sign of the imaginary part. (since C++11)Addit

template< class Lock, class Clock, class Duration > std::cv_status wait_until( Lock& lock, const std::chrono::time_point<Clock, Duration>& timeout_time ); (1) (since C++11) template< class Lock, class Clock, class Duration, class Predicate > bool wait_until( Lock& lock, const std::chrono::time_point<Clock, Duration>& timeout_time, Predicate pred ); (2) (since C++11) wait_until caus