Eigene Dateien/uni/visualisierung/vislu/bsp2/plugin/iTunesIslands/ptr_vector.h File Reference

#include <assert.h>
#include <iterator>
#include <vector>
#include <functional>
#include <algorithm>

Include dependency graph for ptr_vector.h:

Namespaces
namespace	stdx
Classes
struct	stdx::ptr_iterator_tag
class	stdx::ptr_vec_iter_imp< PtrT >
class	stdx::ptr_vec_iter< T >
class	stdx::const_ptr_vec_iter< T >
class	stdx::ptr_vector< T >
class	stdx::ptr_iter_util< It >
class	stdx::ptr_vector_owner< T >
Functions
template<typename T>
bool	stdx::operator< (const ptr_vector< T > &left, const ptr_vector< T > &right)
template<typename T>
T *	stdx::iter2ptr (stdx::ptr_vec_iter< T > ptrIter)
template<typename T>
const T *	stdx::iter2ptr (stdx::const_ptr_vec_iter< T > ptrIter)
template<typename T>
void	stdx::ptr_swap (stdx::ptr_vec_iter< T > first, stdx::ptr_vec_iter< T > second)
template<typename PtrBidirectionalIterator1, typename PtrBidirectionalIterator2>
PtrBidirectionalIterator2	stdx::swap_ranges (PtrBidirectionalIterator1 first1, PtrBidirectionalIterator1 last1, PtrBidirectionalIterator2 first2)
template<typename PtrBidirectionalIterator, typename T>
PtrBidirectionalIterator	stdx::remove (PtrBidirectionalIterator first, PtrBidirectionalIterator last, const T &value)
template<typename PtrBidirectionalIterator, typename Predicate>
PtrBidirectionalIterator	stdx::remove_if (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Predicate pred)
template<typename PtrBidirectionalIterator>
PtrBidirectionalIterator	stdx::unique (PtrBidirectionalIterator first, PtrBidirectionalIterator last)
template<typename PtrBidirectionalIterator, typename Predicate>
PtrBidirectionalIterator	stdx::unique (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Predicate pred)
template<typename PtrBidirectionalIterator>
void	stdx::reverse (PtrBidirectionalIterator first, PtrBidirectionalIterator last)
template<typename PtrForwardIterator>
void	stdx::rotate (PtrForwardIterator first, PtrForwardIterator middle, PtrForwardIterator last)
template<typename PtrRandomAccessIterator>
void	stdx::random_shuffle (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename RandomNumberGenerator>
void	stdx::random_shuffle (PtrRandomAccessIterator first, PtrRandomAccessIterator last, RandomNumberGenerator &rand)
template<typename PtrBidirectionalIterator, typename Predicate>
PtrBidirectionalIterator	stdx::partition (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Predicate pred)
template<typename PtrBidirectionalIterator, typename Predicate>
PtrBidirectionalIterator	stdx::stable_partition (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Predicate pred)
template<typename PtrRandomAccessIterator>
void	stdx::sort (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::sort (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::stable_sort (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::stable_sort (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::partial_sort (PtrRandomAccessIterator first, PtrRandomAccessIterator middle, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::partial_sort (PtrRandomAccessIterator first, PtrRandomAccessIterator middle, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::nth_element (PtrRandomAccessIterator first, PtrRandomAccessIterator nth, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::nth_element (PtrRandomAccessIterator first, PtrRandomAccessIterator nth, PtrRandomAccessIterator last, Compare comp)
template<typename PtrBidirectionalIterator>
void	stdx::inplace_merge (PtrBidirectionalIterator first, PtrBidirectionalIterator middle, PtrBidirectionalIterator last)
template<typename PtrBidirectionalIterator, typename Compare>
void	stdx::inplace_merge (PtrBidirectionalIterator first, PtrBidirectionalIterator middle, PtrBidirectionalIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::push_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::push_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::pop_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::pop_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::make_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::make_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrRandomAccessIterator>
void	stdx::sort_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last)
template<typename PtrRandomAccessIterator, typename Compare>
void	stdx::sort_heap (PtrRandomAccessIterator first, PtrRandomAccessIterator last, Compare comp)
template<typename PtrBidirectionalIterator>
bool	stdx::next_permutation (PtrBidirectionalIterator first, PtrBidirectionalIterator last)
template<typename PtrBidirectionalIterator, typename Compare>
bool	stdx::next_permutation (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Compare comp)
template<typename PtrBidirectionalIterator>
bool	stdx::prev_permutation (PtrBidirectionalIterator first, PtrBidirectionalIterator last)
template<typename PtrBidirectionalIterator, typename Compare>
bool	stdx::prev_permutation (PtrBidirectionalIterator first, PtrBidirectionalIterator last, Compare comp)

---

Detailed Description

  Copyright (c) 2004, 2005, 2006 Roland Pibinger
  All rights reserved.

  Redistribution and use in source and binary forms, with or without modification,
  are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this
    list of conditions and the following disclaimer.
Neither the name of the copyright holders nor the names of contributors may
    be used to endorse or promote products derived from this software without
    specific prior written permission.

  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
  ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
  ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

rpbg123@yahoo.com

Log

Version:

2006-11-04

Date:

31-May-2004 - first version

16-Dec-2004 - add: wrapper function templates for std::algorithms

12-Mar-2005 - chg: iterators contain ptr_vec_iter_imp instead of deriving private(ly)

21-Oct-2006 - chg: operator== (const ptr_vector<T>& x, const ptr_vector<T>& y) because of 'depricated' warings in VC++8.0

25-Oct-2006 - chg: ptr_vec_iter_imp: assert in op_pp() and op_mm() corrected

03-Nov-2006 - chg: ptr_vector::check_not_null; macro PTV_KW_CLASS removed

---