////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2005-2011. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTERPROCESS_SIMPLE_SEQ_FIT_HPP #define BOOST_INTERPROCESS_SIMPLE_SEQ_FIT_HPP #if (defined _MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include #include #include //!\file //!Describes sequential fit algorithm used to allocate objects in shared memory. namespace boost { namespace interprocess { //!This class implements the simple sequential fit algorithm with a simply //!linked list of free buffers. template class simple_seq_fit : public ipcdetail::simple_seq_fit_impl { /// @cond typedef ipcdetail::simple_seq_fit_impl base_t; /// @endcond public: typedef typename base_t::size_type size_type; //!Constructor. "size" is the total size of the managed memory segment, //!"extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(simple_seq_fit) //!offset that the allocator should not use at all.*/ simple_seq_fit (size_type size, size_type extra_hdr_bytes) : base_t(size, extra_hdr_bytes){} }; } //namespace interprocess { } //namespace boost { #include #endif //#ifndef BOOST_INTERPROCESS_SIMPLE_SEQ_FIT_HPP