// file : libbutl/small-forward-list.mxx -*- C++ -*- // license : MIT; see accompanying LICENSE file #ifndef __cpp_modules_ts #pragma once #endif #ifndef __cpp_lib_modules_ts #include // size_t #include // move() #include #endif // Other includes. #ifdef __cpp_modules_ts export module butl.small_forward_list; #ifdef __cpp_lib_modules_ts import std.core; #endif import butl.small_allocator; #else #include #endif #include LIBBUTL_MODEXPORT namespace butl { // Issues and limitations. // // - Because small_allocator currently expects us to allocate the entire // small buffer and there is no reserve() in std::forward_list, we // currently only support N==1 (which we static_assert). // // - swap() is deleted (see notes below). // // - The implementation doesn't allocate T but rather a "node" that normally // consists of a pointers (next) and T. // template using small_forward_list_node = #if defined (_MSC_VER) std::_Flist_node; #elif defined (__GLIBCXX__) std::_Fwd_list_node; #elif defined (_LIBCPP_VERSION) std::__forward_list_node; #else #error unknown standard library implementation #endif template using small_forward_list_buffer = small_allocator_buffer, N>; template class small_forward_list: private small_forward_list_buffer, public std::forward_list>> { static_assert (N == 1, "only small_forward_list or 1 currently supported"); public: static constexpr const std::size_t small_size = N; using buffer_type = small_forward_list_buffer; using allocator_type = small_allocator; using base_type = std::forward_list; small_forward_list () : base_type (allocator_type (this)) {} small_forward_list (std::initializer_list v) : base_type (allocator_type (this)) { static_cast (*this) = v; } template small_forward_list (I b, I e) : base_type (allocator_type (this)) { this->assign (b, e); } explicit small_forward_list (std::size_t n) : base_type (allocator_type (this)) { this->resize (n); } small_forward_list (std::size_t n, const T& x) : base_type (allocator_type (this)) { this->assign (n, x); } small_forward_list (const small_forward_list& v) : buffer_type (), base_type (allocator_type (this)) { static_cast (*this) = v; } small_forward_list& operator= (const small_forward_list& v) { // Note: propagate_on_container_copy_assignment = false // static_cast (*this) = v; return *this; } small_forward_list (small_forward_list&& v) : base_type (allocator_type (this)) { *this = std::move (v); // Delegate to operator=(&&). } small_forward_list& operator= (small_forward_list&& v) { // VC14's implementation of operator=(&&) swaps pointers without regard // for allocator (fixed in 15). // #if defined(_MSC_VER) && _MSC_VER <= 1900 clear (); for (T& x: v) push_front (std::move (x)); reverse (); v.clear (); #else // Note: propagate_on_container_move_assignment = false // static_cast (*this) = std::move (v); #endif return *this; } small_forward_list& operator= (std::initializer_list v) { static_cast (*this) = v; return *this; } // Implementing swap() under small buffer optimization is not trivial, to // say the least (think of swapping two such buffers of different sizes). // One easy option would be to force both in to the heap. // void swap (small_forward_list&) = delete; }; }