copy, delete_backfill and delete_shiftup algorithms. More...
#include "Utilities/ElementProperties.h"#include "Utilities/PAssert.h"#include <iterator>#include <string.h>
Include dependency graph for algorithms.h:
This graph shows which files directly or indirectly include this file:
Classes | |
| struct | Pooma::Algorithms::IsConcrete< type > |
Namespaces | |
| namespace | Pooma |
| namespace | Pooma::Algorithms |
Defines | |
| #define | POOMA_TAG_DUMMY_MEMBERS(tagclassname) |
| Tag class used to choose the proper specialization of copy. | |
Functions | |
| template<class It , class It2 > | |
| It2 | Pooma::Algorithms::copy (It begin, It end, It2 dest) |
| void copy(Iterator begin, Iterator end, Iterator2 dest) | |
| template<class It , class It2 > | |
| It2 | Pooma::Algorithms::copy_special (It begin, It end, It2 dest, IsConcrete< true >) |
| void copy_special(Iterator begin, Iterator end, Iterator2 dest, IsConcrete<true>) | |
| template<class It , class It2 > | |
| It2 | Pooma::Algorithms::copy_special (It begin, It end, It2 dest, IsConcrete< false >) |
| void copy_special(Iterator begin, Iterator end, Iterator2 dest, IsConcrete<false>) | |
| template<class DataIterator , class KillIterator > | |
| std::iterator_traits < DataIterator > ::difference_type | Pooma::Algorithms::delete_backfill (DataIterator data_begin, DataIterator data_end, const KillIterator kill_begin, const KillIterator kill_end, typename std::iterator_traits< DataIterator >::difference_type offset=0) |
| difference_type delete_backfill(DataIterator, DataIterator, KillIterator, KillIterator, difference_type) | |
| template<class DataIterator , class KillIterator > | |
| std::iterator_traits < DataIterator > ::difference_type | Pooma::Algorithms::delete_shiftup (DataIterator data_begin, DataIterator data_end, KillIterator kill_begin, KillIterator kill_end, typename std::iterator_traits< DataIterator >::difference_type offset=0) |
| difference_type delete_shiftup(DataIterator, DataIterator, KillIterator, KillIterator, difference_type) | |
| template<class DataIterator > | |
| DataIterator | Pooma::Algorithms::find_most_common (DataIterator dataBegin, DataIterator dataEnd) |
| DataIterator find_most_common(DataIterator, DataIterator) | |
Detailed Description
copy, delete_backfill and delete_shiftup algorithms.
copy(start, end, dest)
- An STL-like copy algorithm. This one first checks, using ElementProperties, for whether or not the element is "concrete". If so, it performs the copy with std::copy or with std::memmove. If not, it does the copy explicitly using ElementProperties::construct.
delete_backfill(data_begin, data_end, kill_begin, kill_end)
- Deletes the elements described by the range [kill_begin,kill_end) from the data described by the range [data_begin,data_end), filling the deleted slots from the end of the list. All iterators are assumed to be random access iterators. Returns the number of deleted elements.
delete_shiftup(data_begin, data_end, kill_begin, kill_end)
- Deletes the elements described by the range [kill_begin,kill_end) from the data described by the range [data_begin,data_end), filling the deleted slots from the end of the list. All iterators are assumed to be random access iterators. Returns the number of deleted elements.
Define Documentation
| #define POOMA_TAG_DUMMY_MEMBERS | ( | tagclassname | ) |
Value:
inline tagclassname() { }; \ inline tagclassname(const tagclassname &) { }; \ inline tagclassname &operator=(const tagclassname &) { return *this; }
Tag class used to choose the proper specialization of copy.
