|
template<class InputIt > |
| fixed_size_free_list (InputIt first, InputIt last) |
| Construct a new free_list from range defined by input iterators. More...
|
|
void | insert (block_type const &b) |
| Inserts a block into the free_list in the correct order, coalescing it with the preceding and following blocks if either is contiguous. More...
|
|
void | insert (free_list &&other) |
| Splices blocks from range [first, last) onto the free_list. More...
|
|
block_type | get_block (size_t size) |
| Returns the first block in the free list. More...
|
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
| beginning of the free list
|
|
const_iterator | cbegin () const noexcept |
| beginning of the free list
|
|
iterator | end () noexcept |
| beginning of the free list
|
|
const_iterator | end () const noexcept |
| end of the free list
|
|
const_iterator | cend () const noexcept |
| end of the free list
|
|
size_type | size () const noexcept |
| end of the free list More...
|
|
bool | is_empty () const noexcept |
| checks whether the free_list is empty. More...
|
|
void | erase (const_iterator iter) |
| Removes the block indicated by iter from the free list. More...
|
|
void | clear () noexcept |
| Erase all blocks from the free_list.
|
|
void | print () const |
| Print all blocks in the free_list.
|
|
|
using | block_type = block_base |
|
using | list_type = std::list< block_base > |
|
using | size_type = typename list_type::size_type |
|
using | iterator = typename list_type::iterator |
|
using | const_iterator = typename list_type::const_iterator |
|
void | insert (const_iterator pos, block_type const &b) |
| Insert a block in the free list before the specified position. More...
|
|
void | splice (const_iterator pos, free_list &&other) |
| Inserts a list of blocks in the free list before the specified position. More...
|
|
void | push_back (const block_type &b) |
| Appends the given block to the end of the free list. More...
|
|
void | push_back (block_type &&b) |
| Appends the given block to the end of the free list. b is moved to the new element. More...
|
|
void | pop_front () |
| Removes the first element of the free list. If there are no elements in the free list, the behavior is undefined. More...
|
|
◆ fixed_size_free_list()
template<class InputIt >
rmm::mr::detail::fixed_size_free_list::fixed_size_free_list |
( |
InputIt |
first, |
|
|
InputIt |
last |
|
) |
| |
|
inline |
Construct a new free_list from range defined by input iterators.
- Template Parameters
-
- Parameters
-
first | The start of the range to insert into the free_list |
last | The end of the range to insert into the free_list |
◆ get_block()
block_type rmm::mr::detail::fixed_size_free_list::get_block |
( |
size_t |
size | ) |
|
|
inline |
Returns the first block in the free list.
- Parameters
-
size | The size in bytes of the desired block (unused). |
- Returns
- block A block large enough to store
size
bytes.
◆ insert() [1/2]
void rmm::mr::detail::fixed_size_free_list::insert |
( |
block_type const & |
b | ) |
|
|
inline |
Inserts a block into the free_list
in the correct order, coalescing it with the preceding and following blocks if either is contiguous.
- Parameters
-
◆ insert() [2/2]
void rmm::mr::detail::fixed_size_free_list::insert |
( |
free_list && |
other | ) |
|
|
inline |
Splices blocks from range [first, last)
onto the free_list.
- Parameters
-
first | The beginning of the range of blocks to insert |
last | The end of the range of blocks to insert. |
The documentation for this struct was generated from the following file: