Result class. More...
#include <cut.H>
Public Member Functions | |
| result (const FixedList< point, N > &x) | |
| Construct from a single element. | |
| result | operator+ (const result &x) const |
| Add together two lists. | |
| Public Member Functions inherited from DynamicList< FixedList< point, N > > | |
| constexpr | DynamicList () noexcept |
| Default construct, an empty list without allocation. | |
| ~DynamicList () | |
| Destructor, sync allocated size before List destruction. | |
| label | capacity () const noexcept |
| Size of the underlying storage. | |
| std::streamsize | capacity_bytes () const noexcept |
| Number of contiguous bytes of the underlying storage. | |
| void | setCapacity (const label len) |
| Alter the size of the underlying storage. | |
| void | setCapacity_nocopy (const label len) |
| Alter the size of the underlying storage, without retaining old content. | |
| void | setCapacity_unsafe (label len) noexcept |
| Change the value for the list capacity directly (ADVANCED, UNSAFE) Does not perform any memory management or resizing. | |
| void | reserve (const label len) |
| Reserve allocation space for at least this size, allocating new space if required and retaining old content. | |
| void | reserve_nocopy (const label len) |
| Reserve allocation space for at least this size, allocating new space if required without retaining old content. | |
| void | reserve_exact (const label len) |
| Reserve allocation space for at least this size, allocating new space if required and retaining old content. If allocation is required, uses the specified size without any other resizing logic. | |
| void | resize (const label len) |
| Alter addressable list size, allocating new space if required while recovering old content. | |
| void | resize_copy (label count, const label len) |
| Alter addressable size, retaining the first count contents. | |
| void | resize_fill (const label len, const FixedList< point, N > &val) |
| Alter addressable size and set val for all addressed entries. | |
| void | resize_nocopy (const label len) |
| Alter addressable list size, allocating new space if required without necessarily recovering old content. | |
| void | clear () noexcept |
| Clear the addressed list, i.e. set the size to zero. | |
| void | clearStorage () |
| Clear the list and delete storage. | |
| void | shrink_to_fit () |
| Shrink the allocated space to the number of elements used. | |
| void | swap (List< FixedList< point, N > > &other) |
| Swap with plain List content. Implies shrink_to_fit(). | |
| void | transfer (List< FixedList< point, N > > &list) |
| Transfer contents of the argument List into this. | |
| FixedList< point, N > & | emplace_back (Args &&... args) |
| Construct an element at the end of the list, return reference to the new list element. | |
| void | push_back (const FixedList< point, N > &val) |
| Copy append an element to the end of this list. | |
| label | push_uniq (const FixedList< point, N > &val) |
| Append an element if not already in the list. | |
| void | pop_back (label n=1) |
| Reduce size by 1 or more elements. Can be called on an empty list. | |
| FixedList< point, N > | remove () |
| Remove and return the last element. Fatal on an empty list. | |
| label | subset (const labelRange &range) |
| Retain a (start,size) subset from the list. | |
| FixedList< point, N > & | operator() (const label i) |
| Return non-const access to an element, resizing list if needed. | |
| void | operator= (const FixedList< point, N > &val) |
| Assign addressed entries to the given value. | |
| Istream & | readList (Istream &is) |
| Read from Istream, discarding existing contents. | |
| void | setSize (const label n) |
| Alias for resize(). | |
| DynamicList< FixedList< point, N >, 16 > & | shrink () |
| Calls shrink_to_fit() and returns a reference to the DynamicList. | |
| void | append (const FixedList< point, N > &val) |
| Copy append an element to the end of this list. | |
| label | appendUniq (const FixedList< point, N > &val) |
| Same as push_uniq(). | |
| Public Member Functions inherited from List< FixedList< point, N > > | |
| void | resize (const label len) |
| autoPtr< List< FixedList< point, N > > > | clone () const |
| Clone. | |
| ~List () | |
| Destructor. | |
| void | clear () |
| Clear the list, i.e. set size to zero. | |
| void | resize_copy (label count, const label len) |
| Change allocated size of list, retaining the first count elements. | |
| void | resize_fill (const label len, const FixedList< point, N > &val) |
| Adjust allocated size of list and set val for all elements. | |
| void | resize_nocopy (const label len) |
| Adjust allocated size of list without necessarily. | |
| void | transfer (List< FixedList< point, N > > &list) |
| Transfer the contents of the argument List into this list and annul the argument list. | |
| FixedList< point, N > & | newElmt (const label i) |
| Return subscript-checked element of UList and resizing the list if required. | |
| FixedList< point, N > & | emplace_back (Args &&... args) |
| Construct an element at the end of the list, return reference to the new list element. | |
| void | push_back (const FixedList< point, N > &val) |
| Append an element at the end of the list. | |
| label | push_uniq (const FixedList< point, N > &val) |
| Append an element if not already in the list. | |
| void | pop_back (label n=1) |
| Reduce size by 1 or more elements. Can be called on an empty list. | |
| void | operator= (const UList< FixedList< point, N > > &list) |
| Assignment to UList operator. Takes linear time. | |
| Istream & | readList (Istream &is) |
| Read List from Istream, discarding contents of existing List. | |
| void | shallowCopy (const UList< FixedList< point, N > > &)=delete |
| No shallowCopy permitted. | |
| bool | set (const label i, bool val=true) |
| A bitSet::set() method for a list of bool. | |
| void | append (const FixedList< point, N > &val) |
| Append an element at the end of the list. | |
| label | appendUniq (const FixedList< point, N > &val) |
| Same as push_uniq(). | |
| void | setSize (label n) |
| Alias for resize(). | |
| Public Member Functions inherited from UList< FixedList< point, N > > | |
| UList (const UList< FixedList< point, N > > &) noexcept=default | |
| Copy construct, shallow copy. | |
| UList< FixedList< point, N > > & | operator= (const UList< FixedList< point, N > > &)=delete |
| No copy assignment (default: shallow copy). | |
| label | fcIndex (const label i) const noexcept |
| The forward circular index. The next index in the list which returns to the first at the end of the list. | |
| label | rcIndex (const label i) const noexcept |
| The reverse circular index. The previous index in the list which returns to the last at the beginning of the list. | |
| const FixedList< point, N > & | fcValue (const label i) const |
| Return forward circular value (ie, next value in the list). | |
| const FixedList< point, N > & | rcValue (const label i) const |
| Return reverse circular value (ie, previous value in the list). | |
| const FixedList< point, N > * | cdata () const noexcept |
| Return pointer to the underlying array serving as data storage. | |
| FixedList< point, N > * | data () noexcept |
| Return pointer to the underlying array serving as data storage. | |
| const char * | cdata_bytes () const noexcept |
| Return pointer to the underlying array serving as data storage,. | |
| char * | data_bytes () noexcept |
| Return pointer to the underlying array serving as data storage,. | |
| FixedList< point, N > & | front () |
| Access first element of the list, position [0]. | |
| FixedList< point, N > & | back () |
| Access last element of the list, position [size()-1]. | |
| std::streamsize | size_bytes () const noexcept |
| Number of contiguous bytes for the List data. | |
| std::streamsize | byteSize () const |
| Number of contiguous bytes for the List data, runtime FatalError if type is not contiguous. | |
| void | checkStart (const label start) const |
| Check start is within valid range [0,size). | |
| void | checkSize (const label size) const |
| Check size is within valid range [0,size]. | |
| void | checkRange (const label start, const label len) const |
| Check that start and length define a valid range. | |
| void | checkIndex (const label i) const |
| Check index is within valid range [0,size). | |
| bool | uniform () const |
| True if all entries have identical values, and list is non-empty. | |
| bool | contains (const FixedList< point, N > &val) const |
| True if the value is contained in the list. | |
| label | find (const FixedList< point, N > &val) const |
| Find index of the first occurrence of the value. | |
| label | rfind (const FixedList< point, N > &val, label pos=-1) const |
| Find index of the last occurrence of the value. | |
| void | moveFirst (const label i) |
| Move element to the first position. | |
| void | moveLast (const label i) |
| Move element to the last position. | |
| void | swapFirst (const label i) |
| Swap element with the first element. Fatal on an empty list. | |
| void | swapLast (const label i) |
| Swap element with the last element. Fatal on an empty list. | |
| void | shallowCopy (FixedList< point, N > *__restrict__ ptr, const label len) noexcept |
| Copy the pointer and size. | |
| void | deepCopy (const UList< FixedList< point, N > > &list) |
| Copy elements of the given UList. Sizes must match! | |
| SubList< FixedList< point, N > > | slice (const label pos, label len=-1) |
| Return SubList slice (non-const access) - no range checking. | |
| FixedList< point, N > & | operator[] (const label i) |
| Return element of UList. | |
| operator const Foam::List< FixedList< point, N > > & () const | |
| Allow cast to a const List<T>&. | |
| iterator | begin () noexcept |
| Return an iterator to begin traversing the UList. | |
| iterator | end () noexcept |
| Return an iterator to end traversing the UList. | |
| const_iterator | cbegin () const noexcept |
| Return const_iterator to begin traversing the constant UList. | |
| const_iterator | cend () const noexcept |
| Return const_iterator to end traversing the constant UList. | |
| reverse_iterator | rbegin () |
| Return reverse_iterator to begin reverse traversing the UList. | |
| reverse_iterator | rend () |
| Return reverse_iterator to end reverse traversing the UList. | |
| const_reverse_iterator | crbegin () const |
| Return const_reverse_iterator to begin reverse traversing the UList. | |
| const_reverse_iterator | crend () const |
| Return const_reverse_iterator to end reverse traversing the UList. | |
| bool | empty () const noexcept |
| True if List is empty (ie, size() is zero). | |
| label | capacity () const noexcept |
| Size of the underlying storage. | |
| void | swap (UList< FixedList< point, N > > &list) noexcept |
| Swap content with another UList of the same type in constant time. | |
| bool | operator== (const UList< FixedList< point, N > > &list) const |
| Equality operation on ULists of the same type. | |
| bool | operator!= (const UList< FixedList< point, N > > &list) const |
| The opposite of the equality operation. Takes linear time. | |
| bool | operator< (const UList< FixedList< point, N > > &list) const |
| Compare two ULists lexicographically. Takes linear time. | |
| bool | operator> (const UList< FixedList< point, N > > &list) const |
| Compare two ULists lexicographically. Takes linear time. | |
| bool | operator<= (const UList< FixedList< point, N > > &list) const |
| Return true if !(a > b). Takes linear time. | |
| bool | operator>= (const UList< FixedList< point, N > > &list) const |
| Return true if !(a < b). Takes linear time. | |
| Istream & | readList (Istream &is) |
| Read List contents from Istream. | |
| Ostream & | writeList (Ostream &os, const label shortLen=0) const |
| Write List, with line-breaks in ASCII when length exceeds shortLen. | |
| bool | all () const |
| True if all entries are 'true' or if the list is empty. | |
| bool | any () const |
| True if any entries are 'true'. | |
| bool | none () const |
| True if no entries are 'true'. | |
| bool | test (const label i) const |
Test bool value at specified position, always false for out-of-range access. | |
| bool | get (const label i) const |
Return bool value at specified position, always false for out-of-range access. | |
| bool | unset (const label i) |
Unset the bool entry at specified position, always false for out-of-range access. | |
| std::string_view | view () const |
| Return a string_view of the charList. Content is non-modifiable. | |
| FixedList< point, N > & | first () |
| Access first element of the list, position [0]. | |
| FixedList< point, N > & | last () |
| Access last element of the list, position [size()-1]. | |
| bool | found (const FixedList< point, N > &val, label pos=0) const |
| Same as contains(). | |
| auto | expr () const |
| Wrap value as expression. | |
Additional Inherited Members | |
| Public Types inherited from List< FixedList< point, N > > | |
| typedef SubList< FixedList< point, N > > | subList |
| Declare type of subList. | |
| Public Types inherited from UList< FixedList< point, N > > | |
| typedef FixedList< point, N > | value_type |
| The value type the list contains. | |
| typedef FixedList< point, N > * | pointer |
| The pointer type for non-const access to value_type items. | |
| typedef const FixedList< point, N > * | const_pointer |
| The pointer type for const access to value_type items. | |
| typedef FixedList< point, N > & | reference |
| The type used for storing into value_type objects. | |
| typedef const FixedList< point, N > & | const_reference |
| The type used for reading from constant value_type objects. | |
| typedef FixedList< point, N > * | iterator |
| Random access iterator for traversing a UList. | |
| typedef const FixedList< point, N > * | const_iterator |
| Random access iterator for traversing a UList. | |
| typedef label | size_type |
| The type to represent the size of a UList. | |
| typedef label | difference_type |
| The difference between iterator objects. | |
| typedef std::reverse_iterator< iterator > | reverse_iterator |
| Reverse iterator (non-const access). | |
| typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
| Reverse iterator (const access). | |
| using | is_List |
| Have unique tag. | |
| Static Public Member Functions inherited from DynamicList< FixedList< point, N > > | |
| static constexpr label | min_size () noexcept |
| Normal lower capacity limit - the SizeMin template parameter. | |
| Static Public Member Functions inherited from List< FixedList< point, N > > | |
| static const List< FixedList< point, N > > & | null () noexcept |
| Return a null List (reference to a nullObject). Behaves like an empty List. | |
| Static Public Member Functions inherited from UList< FixedList< point, N > > | |
| static const UList< FixedList< point, N > > & | null () noexcept |
| Return a null UList (reference to a nullObject). Behaves like an empty UList. | |
| static constexpr label | max_size () noexcept |
| The size of the largest possible UList. | |
| Protected Member Functions inherited from UList< FixedList< point, N > > | |
| void | setAddressableSize (const label n) noexcept |
| Set addressed size to be inconsistent with allocated storage. | |
| void | size (const label n) |
| Older name for setAddressableSize. | |
| void | writeEntry (Ostream &os) const |
| Write the UList with its compound type. | |
| labelRange | validateRange (const labelRange &requestedRange) const |
| Return a validated (start,size) subset range, which means that it always addresses a valid section of the list. | |
| void | fill_uniform (const FixedList< point, N > &val) |
| Assign all entries to the given value. | |
Result class.
Construct from a single element.
Definition at line 383 of file cut.H.
References DynamicList< FixedList< point, N > >::DynamicList(), N(), and x.
Referenced by operator+().
Add together two lists.
Definition at line 394 of file cut.H.
References DynamicList< T, SizeMin >::append(), result(), and x.
1.16.1 