Represents a collection of controls.
|
| template<typename control_t , typename ... args_t> |
| control_t & | emplace (const_iterator pos, args_t &&...args) |
| | Creates and inserts specified control at specified position.
|
| |
| template<typename control_t , typename ... args_t> |
| control_t & | emplace_at (size_t index, args_t &&...args) |
| | Creates and inserts specified control at specified position.
|
| |
| template<typename control_t , typename ... args_t> |
| control_t & | emplace_back (args_t &&...args) |
| | Creates and adds a control to the end.
|
| |
| iterator | insert (const_iterator pos, const value_type &value) override |
| | Inserts specified element at specified position.
|
| |
| void | insert_at (size_t index, const value_type &value) override |
| | Inserts specified element at specified index.
|
| |
| void | push_back (const value_type &value) override |
| | Adds an element to the end.
|
| |
|
template<typename control_t > |
| iterator | insert (const_iterator pos, control_t &value) |
| |
|
template<typename control_t > |
| void | insert_at (size_t index, control_t &value) |
| |
|
template<typename control_t > |
| void | push_back (control_t &value) |
| |
|
| using | allocator_type = std::allocator< value_type > |
| | Represents the allocator type of the collection.
|
| |
| using | size_type = std::size_t |
| | Represents the size type of the collection.
|
| |
| using | difference_type = std::ptrdiff_t |
| | Represents the pointer difference type of the collection.
|
| |
| using | reference = value_type & |
| | Represents the value type reference of the collection.
|
| |
| using | const_reference = const value_type & |
| | Represents the value type const reference the collection.
|
| |
| using | pointer = typename std::allocator_traits< allocator_type >::pointer |
| | Represents the value type pointer of the collection.
|
| |
| using | const_pointer = typename std::allocator_traits< allocator_type >::const_pointer |
| | Represents the value type const pointer of the collection.
|
| |
| using | iterator = typename std::vector< value_type >::iterator |
| | Represents the iterator type of the collection.
|
| |
| using | const_iterator = typename std::vector< value_type >::const_iterator |
| | Represents the const iterator type of the collection.
|
| |
| using | reverse_iterator = typename std::vector< value_type >::reverse_iterator |
| | Represents the reverse iterator type of the collection.
|
| |
| using | const_reverse_iterator = typename std::vector< value_type >::const_reverse_iterator |
| | Represents the const reverse iterator type of the collection.
|
| |
| event< arranged_element_collection, delegate< void(size_t, control_ref &item)> > | item_added |
| | Occurs when an item is added to the collection.
|
| |
| event< arranged_element_collection, delegate< void(size_t, control_ref &item)> > | item_updated |
| | Occurs when an item is updated in the collection.
|
| |
| event< arranged_element_collection, delegate< void(size_t, control_ref &item)> > | item_removed |
| | Occurs when an item is removed from the collection.
|
| |
| static constexpr xtd::size | npos |
| | This is a special value equal to the maximum value representable by the type size_t.
|
| |
| | arranged_element_collection (const allocator_type &allocator=allocator_type()) |
| | Creates a new object xtd::forms::layout::arranged_element_collection with specified allocator (optional).
|
| |
| | arranged_element_collection (const std::initializer_list< control_ref > &il) |
| | Creates a new object xtd::diagnostics::trace_listener_collection with specified initializer list.
|
| |
| allocator_type | get_allocator () const noexcept |
| | Returns the associated allocator.
|
| |
| reference | at (size_type pos) |
| | Access specified element with bounds checking.
|
| |
| const_reference | at (size_type pos) const |
| | Access specified element with bounds checking.
|
| |
| reference | front () |
| | Access the first element.
|
| |
| const_reference | front () const |
| | Access the first element.
|
| |
| reference | back () |
| | Access the last element.
|
| |
| const_reference | back () const |
| | Access the last element.
|
| |
| pointer | data () |
| | Direct access to the underlying array.
|
| |
| const_pointer | data () const |
| | Direct access to the underlying array.
|
| |
| iterator | begin () noexcept |
| | Returns an iterator to the beginning.
|
| |
| const_iterator | begin () const noexcept |
| | Returns an iterator to the beginning.
|
| |
| const_iterator | cbegin () const noexcept |
| | Returns an iterator to the beginning.
|
| |
| iterator | end () noexcept |
| | Returns an iterator to the end.
|
| |
| const_iterator | end () const noexcept |
| | Returns an iterator to the end.
|
| |
| const_iterator | cend () const noexcept |
| | Returns an iterator to the end.
|
| |
| reverse_iterator | rbegin () noexcept |
| | Returns a reverse iterator to the end.
|
| |
| const_reverse_iterator | rbegin () const noexcept |
| | Returns a reverse iterator to the end.
|
| |
| const_reverse_iterator | crbegin () const noexcept |
| | Returns a reverse iterator to the end.
|
| |
| reverse_iterator | rend () noexcept |
| | Returns a reverse iterator to the end.
|
| |
| const_reverse_iterator | rend () const noexcept |
| | Returns a reverse iterator to the end.
|
| |
| const_reverse_iterator | crend () const noexcept |
| | Returns a reverse iterator to the end.
|
| |
| bool | empty () const noexcept |
| | Checks whether the container is empty.
|
| |
| size_type | size () const noexcept |
| | Returns the number of elements.
|
| |
| size_type | max_size () const noexcept |
| | Returns the maximum possible number of elements.
|
| |
| void | reserve (size_type size) |
| | Reserves storage.
|
| |
| size_type | capacity () const noexcept |
| | Returns the number of elements that can be held in currently allocated storage.
|
| |
| void | shrink_to_fit () |
| | Reduces memory usage by freeing unused memory.
|
| |
| virtual bool | sorted () const noexcept |
| | Checks whether the container is sorted.
|
| |
| virtual void | sorted (bool value) |
| | Sets the container is sorted.
|
| |
| virtual void | clear () noexcept |
| | clears the contents.
|
| |
| virtual iterator | insert (const_iterator pos, value_type &&value) |
| | Inserts specified element at specified position.
|
| |
| void | emplace (const_iterator pos, args_t &&... args) |
| | Inserts specified element at specified position.
|
| |
| void | emplace_back (args_t &&... args) |
| | Adds an element to the end.
|
| |
| virtual iterator | erase (iterator pos) |
| | Erases element at specified position.
|
| |
| virtual iterator | erase (const_iterator pos) |
| | Erases element at specified position.
|
| |
| virtual iterator | erase (iterator first, iterator last) |
| | Erases elements at specified range.
|
| |
| virtual iterator | erase (const_iterator first, const_iterator last) |
| | Erases elements at specified range.
|
| |
| virtual void | erase_at (size_t index) |
| | Erases element at specified index.
|
| |
| virtual void | pop_back () |
| | Removes the last element of the container.
|
| |
| virtual void | push_back (value_type &&item) |
| | Adds an element to the end.
|
| |
| virtual void | push_back_range (const arranged_element_collection &collection) |
| | Adds elements to the end.
|
| |
| virtual void | push_back_range (const std::vector< value_type > &collection) |
| | Adds elements to the end.
|
| |
| virtual void | push_back_range (const std::initializer_list< value_type > &collection) |
| | Adds elements to the end.
|
| |
| void | push_back_range (collection_t &&collection) |
| | Adds elements to the end.
|
| |
| void | push_back_range (iterator_t begin, iterator_t end) |
| | Adds elements to the end.
|
| |
| virtual void | sort () |
| | Sorts the content.
|
| |
| std::vector< control_ref > | to_array () const noexcept |
| | Gets an array with the elements of the container.
|
| |
| std::vector< control_ref > | to_vector () const noexcept |
| | Gets an array with the elements of the container.
|
| |
| reference | operator[] (size_type pos) |
| | Access specified element.
|
| |
| const_reference | operator[] (size_type pos) const |
| | Access specified element.
|
| |
| virtual void | on_item_added (size_t index, control_ref &item) |
| | Raises the xtd::forms::layout::arranged_element_collection::item_added event.
|
| |
| virtual void | on_item_updated (size_t index, control_ref &item) |
| | Raises the xtd::forms::layout::arranged_element_collection::item_updated event.
|
| |
| | object ()=default |
| | Create a new instance of the ultimate base class object.
|
| |
| virtual bool | equals (const object &obj) const noexcept |
| | Determines whether the specified object is equal to the current object.
|
| |
| virtual size_t | get_hash_code () const noexcept |
| | Serves as a hash function for a particular type.
|
| |
| virtual type_object | get_type () const noexcept |
| | Gets the type of the current instance.
|
| |
| template<typename object_t > |
| xtd::uptr< object_t > | memberwise_clone () const |
| | Creates a shallow copy of the current object.
|
| |
| virtual xtd::string | to_string () const noexcept |
| | Returns a xtd::string that represents the current object.
|
| |
| template<typename object_a_t , typename object_b_t > |
| static bool | equals (const object_a_t &object_a, const object_b_t &object_b) noexcept |
| | Determines whether the specified object instances are considered equal.
|
| |
| template<typename object_a_t , typename object_b_t > |
| static bool | reference_equals (const object_a_t &object_a, const object_b_t &object_b) noexcept |
| | Determines whether the specified object instances are the same instance.
|
| |