template<typename T>
class fl::vector_psram< T >
Definition at line 917 of file vector.h.
|
| | vector_psram () FL_NOEXCEPT |
| |
| | vector_psram (const vector_psram &other) FL_NOEXCEPT |
| |
| | vector_psram (fl::initializer_list< T > init) FL_NOEXCEPT |
| |
| | vector_psram (fl::size count, const T &value=T()) FL_NOEXCEPT |
| |
| template<typename InputIterator, typename = fl::enable_if_t<!fl::is_integral<InputIterator>::value>> |
| | vector_psram (InputIterator first, InputIterator last) FL_NOEXCEPT |
| |
| | vector_psram (vector_psram &&other) FL_NOEXCEPT |
| |
| vector_psram & | operator= (const vector_psram &other) FL_NOEXCEPT |
| |
| vector_psram & | operator= (vector_psram &&other) FL_NOEXCEPT |
| |
| | vector () FL_NOEXCEPT |
| |
| | vector (const vector &other) FL_NOEXCEPT |
| |
| | vector (fl::initializer_list< T > init) FL_NOEXCEPT |
| |
| | vector (fl::size count, const T &value, memory_resource *resource) FL_NOEXCEPT |
| |
| | vector (fl::size count, const T &value=T()) FL_NOEXCEPT |
| |
| template<typename InputIterator, typename = fl::enable_if_t<!fl::is_integral<InputIterator>::value>> |
| | vector (InputIterator first, InputIterator last) FL_NOEXCEPT |
| |
| | vector (memory_resource *resource) FL_NOEXCEPT |
| |
| | vector (span< const T, fl::size(-1)> s) FL_NOEXCEPT |
| |
| template<fl::size N> |
| | vector (T(&values)[N]) FL_NOEXCEPT |
| |
| | vector (vector &&other) FL_NOEXCEPT |
| |
| void | assign (fl::size new_cap, const T &value) FL_NOEXCEPT |
| |
| template<typename InputIt, typename = fl::enable_if_t<!fl::is_integral<InputIt>::value>> |
| void | assign (InputIt first, InputIt last) FL_NOEXCEPT |
| |
| const T & | back () const FL_NOEXCEPT |
| |
| T & | back () FL_NOEXCEPT |
| |
| const_iterator | begin () const FL_NOEXCEPT |
| |
| iterator | begin () FL_NOEXCEPT |
| |
| const_iterator | cbegin () const FL_NOEXCEPT |
| |
| const_iterator | cend () const FL_NOEXCEPT |
| |
| void | clear () FL_NOEXCEPT |
| |
| const T * | data () const FL_NOEXCEPT |
| |
| T * | data () FL_NOEXCEPT |
| |
| template<typename... Args> |
| void | emplace_back (Args &&... args) FL_NOEXCEPT |
| |
| const_iterator | end () const FL_NOEXCEPT |
| |
| iterator | end () FL_NOEXCEPT |
| |
| void | ensure_size (fl::size n) FL_NOEXCEPT |
| |
| void | erase (const T &value) FL_NOEXCEPT |
| |
| iterator | erase (iterator pos) FL_NOEXCEPT |
| |
| bool | erase (iterator pos, T *out_value) FL_NOEXCEPT |
| |
| void | erase_range (iterator first, fl::size count) FL_NOEXCEPT |
| |
| const_iterator | find (const T &value) const FL_NOEXCEPT |
| |
| iterator | find (const T &value) FL_NOEXCEPT |
| |
| template<typename Predicate> |
| iterator | find_if (Predicate pred) FL_NOEXCEPT |
| |
| const T & | front () const FL_NOEXCEPT |
| |
| T & | front () FL_NOEXCEPT |
| |
| memory_resource * | get_resource () const FL_NOEXCEPT |
| |
| bool | has (const T &value) const FL_NOEXCEPT |
| |
| bool | insert (iterator pos, const T &value) FL_NOEXCEPT |
| |
| template<typename InputIt> |
| iterator | insert (iterator pos, InputIt first, InputIt last) FL_NOEXCEPT |
| |
| bool | insert (iterator pos, T &&value) FL_NOEXCEPT |
| |
| bool | operator!= (const vector &other) const FL_NOEXCEPT |
| |
| bool | operator< (const vector &other) const FL_NOEXCEPT |
| |
| bool | operator<= (const vector &other) const FL_NOEXCEPT |
| |
| vector & | operator= (const vector &other) FL_NOEXCEPT |
| |
| vector & | operator= (vector &&other) FL_NOEXCEPT |
| |
| bool | operator== (const vector &other) const FL_NOEXCEPT |
| |
| bool | operator> (const vector &other) const FL_NOEXCEPT |
| |
| bool | operator>= (const vector &other) const FL_NOEXCEPT |
| |
| const T & | operator[] (fl::size index) const FL_NOEXCEPT |
| |
| T & | operator[] (fl::size index) FL_NOEXCEPT |
| |
| void | pop_back () FL_NOEXCEPT |
| |
| void | push_back (const T &value) FL_NOEXCEPT |
| |
| void | push_back (T &&value) FL_NOEXCEPT |
| |
| const_reverse_iterator | rbegin () const FL_NOEXCEPT |
| |
| reverse_iterator | rbegin () FL_NOEXCEPT |
| |
| const_reverse_iterator | rend () const FL_NOEXCEPT |
| |
| reverse_iterator | rend () FL_NOEXCEPT |
| |
| void | reserve (fl::size n) FL_NOEXCEPT |
| |
| void | resize (fl::size n) FL_NOEXCEPT |
| |
| void | resize (fl::size n, const T &value) FL_NOEXCEPT |
| |
| void | shrink_to_fit () FL_NOEXCEPT |
| |
| void | swap (iterator a, iterator b) FL_NOEXCEPT |
| |
| void | swap (vector &&other) FL_NOEXCEPT |
| |
| void | swap (vector &other) FL_NOEXCEPT |
| |
| | ~vector_basic () FL_NOEXCEPT |
| |
| fl::size | capacity () const FL_NOEXCEPT |
| |
| void | clear_impl () FL_NOEXCEPT |
| |
| const void * | data_raw () const FL_NOEXCEPT |
| |
| void * | data_raw () FL_NOEXCEPT |
| |
| fl::size | element_size () const FL_NOEXCEPT |
| |
| bool | empty () const FL_NOEXCEPT |
| |
| void | erase_impl (fl::size index) FL_NOEXCEPT |
| | Erase element at index. Shifts subsequent elements left.
|
| |
| void | erase_range_impl (fl::size first_index, fl::size count) FL_NOEXCEPT |
| | Erase range [first_index, first_index + count).
|
| |
| bool | full () const FL_NOEXCEPT |
| |
| void | insert_copy_impl (fl::size index, const void *element) FL_NOEXCEPT |
| | Insert element at index by copy. Shifts subsequent elements right.
|
| |
| void | insert_move_impl (fl::size index, void *element) FL_NOEXCEPT |
| | Insert element at index by move. Shifts subsequent elements right.
|
| |
| void | pop_back_impl () FL_NOEXCEPT |
| |
| void | push_back_copy_impl (const void *element) FL_NOEXCEPT |
| |
| void | push_back_move_impl (void *element) FL_NOEXCEPT |
| |
| void | reserve_impl (fl::size n) FL_NOEXCEPT |
| |
| void | resize_impl (fl::size n) FL_NOEXCEPT |
| | Resize to n elements. New elements are default-constructed (zeroed for trivial).
|
| |
| void | resize_value_impl (fl::size n, const void *value) FL_NOEXCEPT |
| | Resize to n elements. New elements are copy-constructed from value.
|
| |
| void | shrink_to_fit_impl () FL_NOEXCEPT |
| |
| fl::size | size () const FL_NOEXCEPT |
| |
| void | swap_impl (vector_basic &other) FL_NOEXCEPT |
| | Swap contents with another vector_basic.
|
| |