//===----------------------- algorithm.cpp --------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #include "algorithm" // SGX compatible. Partial support. Priority 1. #if defined(_LIBCPP_SGX_CONFIG) #include "vector" #endif // defined(_LIBCPP_SGX_CONFIG) #include "random" #include "mutex" _LIBCPP_BEGIN_NAMESPACE_STD #if defined(_LIBCPP_SGX_CONFIG) template class __vector_base_common; #endif // defined(_LIBCPP_SGX_CONFIG) template void __sort<__less&, char*>(char*, char*, __less&); template void __sort<__less&, wchar_t*>(wchar_t*, wchar_t*, __less&); template void __sort<__less&, signed char*>(signed char*, signed char*, __less&); template void __sort<__less&, unsigned char*>(unsigned char*, unsigned char*, __less&); template void __sort<__less&, short*>(short*, short*, __less&); template void __sort<__less&, unsigned short*>(unsigned short*, unsigned short*, __less&); template void __sort<__less&, int*>(int*, int*, __less&); template void __sort<__less&, unsigned*>(unsigned*, unsigned*, __less&); template void __sort<__less&, long*>(long*, long*, __less&); template void __sort<__less&, unsigned long*>(unsigned long*, unsigned long*, __less&); template void __sort<__less&, long long*>(long long*, long long*, __less&); template void __sort<__less&, unsigned long long*>(unsigned long long*, unsigned long long*, __less&); template void __sort<__less&, float*>(float*, float*, __less&); template void __sort<__less&, double*>(double*, double*, __less&); template void __sort<__less&, long double*>(long double*, long double*, __less&); template bool __insertion_sort_incomplete<__less&, char*>(char*, char*, __less&); template bool __insertion_sort_incomplete<__less&, wchar_t*>(wchar_t*, wchar_t*, __less&); template bool __insertion_sort_incomplete<__less&, signed char*>(signed char*, signed char*, __less&); template bool __insertion_sort_incomplete<__less&, unsigned char*>(unsigned char*, unsigned char*, __less&); template bool __insertion_sort_incomplete<__less&, short*>(short*, short*, __less&); template bool __insertion_sort_incomplete<__less&, unsigned short*>(unsigned short*, unsigned short*, __less&); template bool __insertion_sort_incomplete<__less&, int*>(int*, int*, __less&); template bool __insertion_sort_incomplete<__less&, unsigned*>(unsigned*, unsigned*, __less&); template bool __insertion_sort_incomplete<__less&, long*>(long*, long*, __less&); template bool __insertion_sort_incomplete<__less&, unsigned long*>(unsigned long*, unsigned long*, __less&); template bool __insertion_sort_incomplete<__less&, long long*>(long long*, long long*, __less&); template bool __insertion_sort_incomplete<__less&, unsigned long long*>(unsigned long long*, unsigned long long*, __less&); template bool __insertion_sort_incomplete<__less&, float*>(float*, float*, __less&); template bool __insertion_sort_incomplete<__less&, double*>(double*, double*, __less&); template bool __insertion_sort_incomplete<__less&, long double*>(long double*, long double*, __less&); template unsigned __sort5<__less&, long double*>(long double*, long double*, long double*, long double*, long double*, __less&); #if !defined(_LIBCPP_SGX_CONFIG) #ifndef _LIBCPP_HAS_NO_THREADS static __libcpp_mutex_t __rs_mut = _LIBCPP_MUTEX_INITIALIZER; #endif unsigned __rs_default::__c_ = 0; __rs_default::__rs_default() { #ifndef _LIBCPP_HAS_NO_THREADS __libcpp_mutex_lock(&__rs_mut); #endif __c_ = 1; } __rs_default::__rs_default(const __rs_default&) { ++__c_; } __rs_default::~__rs_default() { #ifndef _LIBCPP_HAS_NO_THREADS if (--__c_ == 0) __libcpp_mutex_unlock(&__rs_mut); #else --__c_; #endif } __rs_default::result_type __rs_default::operator()() { static mt19937 __rs_g; return __rs_g(); } __rs_default __rs_get() { return __rs_default(); } #endif // !defined(_LIBCPP_SGX_CONFIG) _LIBCPP_END_NAMESPACE_STD