IndirectArray.h

Go to the documentation of this file.

//     ____   ______ __
//    / __ \ / ____// /
//   / /_/ // /    / /
//  / ____// /___ / /___   PixInsight Class Library
// /_/     \____//_____/   PCL 2.6.11
// ----------------------------------------------------------------------------
// pcl/IndirectArray.h - Released 2024-05-07T15:27:32Z
// ----------------------------------------------------------------------------
// This file is part of the PixInsight Class Library (PCL).
// PCL is a multiplatform C++ framework for development of PixInsight modules.
//
// Copyright (c) 2003-2024 Pleiades Astrophoto S.L. All Rights Reserved.
//
// Redistribution and use in both source and binary forms, with or without
// modification, is permitted provided that the following conditions are met:
//
// 1. All redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
//
// 2. All redistributions in binary form must reproduce the above copyright
//    notice, this list of conditions and the following disclaimer in the
//    documentation and/or other materials provided with the distribution.
//
// 3. Neither the names "PixInsight" and "Pleiades Astrophoto", nor the names
//    of their contributors, may be used to endorse or promote products derived
//    from this software without specific prior written permission. For written
//    permission, please contact info@pixinsight.com.
//
// 4. All products derived from this software, in any form whatsoever, must
//    reproduce the following acknowledgment in the end-user documentation
//    and/or other materials provided with the product:
//
//    "This product is based on software from the PixInsight project, developed
//    by Pleiades Astrophoto and its contributors (https://pixinsight.com/)."
//
//    Alternatively, if that is where third-party acknowledgments normally
//    appear, this acknowledgment must be reproduced in the product itself.
//
// THIS SOFTWARE IS PROVIDED BY PLEIADES ASTROPHOTO AND ITS 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 PLEIADES ASTROPHOTO OR ITS
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, BUSINESS
// INTERRUPTION; PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; AND LOSS OF USE,
// DATA OR PROFITS) 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.
// ----------------------------------------------------------------------------
 
#ifndef __PCL_IndirectArray_h
#define __PCL_IndirectArray_h
 
 
#include <pcl/Defs.h>
#include <pcl/Diagnostics.h>
 
#include <pcl/Array.h>
#include <pcl/Indirect.h>
 
namespace pcl
{
 
// ----------------------------------------------------------------------------
 
template <class T, class A = StandardAllocator>
class PCL_CLASS IndirectArray : public IndirectContainer<T>
{
public:
 
   using block_allocator = A;
 
   using allocator = pcl::Allocator<T,A>;
 
   using iterator = T**;
 
   using const_iterator = T* const*;
 
   using array_implementation = Array<void*, A>;
 
   using array_iterator = typename array_implementation::iterator;
 
   using const_array_iterator = typename array_implementation::const_iterator;
 
   using reverse_iterator = ReverseRandomAccessIterator<iterator, T*>;
 
   using const_reverse_iterator = ReverseRandomAccessIterator<const_iterator, const T*>;
 
   using equal = IndirectEqual<const T*>;
 
   using less = IndirectLess<const T*>;
 
   // -------------------------------------------------------------------------
 
   IndirectArray() = default;
 
   explicit
   IndirectArray( size_type n )
   {
      m_array.Append( (void*)nullptr, n );
   }
 
   IndirectArray( size_type n, const T* p )
   {
      m_array.Append( (void*)p, n );
   }
 
   template <class FI>
   IndirectArray( FI i, FI j )
      : m_array( i, j )
   {
   }
 
   IndirectArray( const IndirectArray& ) = default;
 
   IndirectArray( IndirectArray&& ) = default;
 
   ~IndirectArray()
   {
   }
 
   bool IsUnique() const
   {
      return m_array.IsUnique();
   }
 
   bool IsAliasOf( const IndirectArray& x ) const
   {
      return m_array.IsAliasOf( x.m_array );
   }
 
   void EnsureUnique()
   {
      m_array.EnsureUnique();
   }
 
   size_type Size() const
   {
      return m_array.Size();
   }
 
   size_type Length() const
   {
      return m_array.Length();
   }
 
   size_type Capacity() const
   {
      return m_array.Capacity();
   }
 
   size_type Available() const
   {
      return m_array.Available();
   }
 
   bool IsValid() const
   {
      return m_array.IsValid();
   }
 
   bool IsEmpty() const
   {
      return m_array.IsEmpty();
   }
 
   size_type LowerBound() const
   {
      return m_array.LowerBound();
   }
 
   size_type UpperBound() const
   {
      return m_array.UpperBound();
   }
 
   const allocator& Allocator() const
   {
      return m_array.Allocator();
   }
 
   void SetAllocator( const allocator& a )
   {
      m_array.SetAllocator( a );
   }
 
   iterator At( size_type i )
   {
      return iterator( m_array.At( i ) );
   }
 
   const_iterator At( size_type i ) const
   {
      return const_iterator( m_array.At( i ) );
   }
 
   iterator MutableIterator( const_iterator i )
   {
      return iterator( m_array.MutableIterator( (const_array_iterator)i ) );
   }
 
   T*& operator []( size_type i )
   {
      return (T*&)m_array[i];
   }
 
   const T* operator []( size_type i ) const
   {
      return (const T*)m_array[i];
   }
 
   T*& operator *()
   {
      return (T*&)*Begin();
   }
 
   const T* operator *() const
   {
      return (T*)*Begin();
   }
 
   iterator Begin()
   {
      return iterator( m_array.Begin() );
   }
 
   const_iterator Begin() const
   {
      return const_iterator( m_array.Begin() );
   }
 
   const_iterator ConstBegin() const
   {
      return const_iterator( m_array.ConstBegin() );
   }
 
   iterator End()
   {
      return iterator( m_array.End() );
   }
 
   const_iterator End() const
   {
      return const_iterator( m_array.End() );
   }
 
   const_iterator ConstEnd() const
   {
      return const_iterator( m_array.ConstEnd() );
   }
 
   reverse_iterator ReverseBegin()
   {
      return iterator( (array_iterator)m_array.ReverseBegin() );
   }
 
   const_reverse_iterator ReverseBegin() const
   {
      return const_iterator( (const_array_iterator)m_array.ReverseBegin() );
   }
 
   const_reverse_iterator ConstReverseBegin() const
   {
      return const_iterator( (const_array_iterator)m_array.ConstReverseBegin() );
   }
 
   reverse_iterator ReverseEnd()
   {
      return iterator( (array_iterator)m_array.ReverseEnd() );
   }
 
   const_reverse_iterator ReverseEnd() const
   {
      return const_iterator( (const_array_iterator)m_array.ReverseEnd() );
   }
 
   const_reverse_iterator ConstReverseEnd() const
   {
      return const_iterator( (const_array_iterator)m_array.ConstReverseEnd() );
   }
 
   T* First()
   {
      return IsEmpty() ? nullptr : *Begin();
   }
 
   const T* First() const
   {
      return IsEmpty() ? nullptr : *Begin();
   }
 
   T* Last()
   {
      return IsEmpty() ? nullptr : *ReverseBegin();
   }
 
   const T* Last() const
   {
      return IsEmpty() ? nullptr : *ReverseBegin();
   }
 
   void UniquifyIterator( iterator& i )
   {
      m_array.UniquifyIterator( (array_iterator&)i );
   }
 
   void UniquifyIterators( iterator& i, iterator& j )
   {
      m_array.UniquifyIterators( (array_iterator&)i, (array_iterator&)j );
   }
 
#ifndef __PCL_NO_STL_COMPATIBLE_ITERATORS
   iterator begin()
   {
      return Begin();
   }
 
   const_iterator begin() const
   {
      return Begin();
   }
 
   iterator end()
   {
      return End();
   }
 
   const_iterator end() const
   {
      return End();
   }
#endif   // !__PCL_NO_STL_COMPATIBLE_ITERATORS
 
   IndirectArray& operator =( const IndirectArray& x )
   {
      Assign( x );
      return *this;
   }
 
   void Assign( const IndirectArray& x )
   {
      m_array.Assign( x.m_array );
   }
 
   IndirectArray& operator =( IndirectArray&& x )
   {
      Transfer( x );
      return *this;
   }
 
   void Transfer( IndirectArray& x )
   {
      m_array.Transfer( x.m_array );
   }
 
   void Transfer( IndirectArray&& x )
   {
      m_array.Transfer( x.m_array );
   }
 
   void Assign( const T* p, size_type n = 1 )
   {
      m_array.Assign( (void*)p, n );
   }
 
   template <class FI>
   void Assign( FI i, FI j )
   {
      m_array.Assign( i, j );
   }
 
   template <class C>
   void CloneAssign( const C& x )
   {
      PCL_ASSERT_CONTAINER( C, T );
      CloneObjects( x, (C*)nullptr );
   }
 
   void Import( iterator i, iterator j )
   {
      m_array.Import( (array_iterator)i, (array_iterator)j );
   }
 
   iterator Release()
   {
      return iterator( m_array.Release() );
   }
 
   iterator Grow( const_iterator i, size_type n = 1 )
   {
      return iterator( m_array.Insert( (array_iterator)const_cast<iterator>( i ), (void*)nullptr, n ) );
   }
 
   iterator Expand( size_type n = 1 )
   {
      return Grow( ConstEnd(), n );
   }
 
   void Shrink( size_type n = 1 )
   {
      if ( n < Length() )
         Truncate( ConstEnd() - n );
      else
         Clear();
   }
 
   void Resize( size_type n )
   {
      size_type l = Length();
      if ( n > l )
         Expand( n - l );
      else
         Shrink( l - n );
   }
 
   iterator Insert( const_iterator i, const IndirectArray& x )
   {
      return iterator( m_array.Insert( (array_iterator)const_cast<iterator>( i ), x.m_array ) );
   }
 
   iterator Insert( const_iterator i, const T* p, size_type n = 1 )
   {
      return iterator( m_array.Insert( (array_iterator)const_cast<iterator>( i ), (void*)p, n ) );
   }
 
   template <class FI>
   iterator Insert( const_iterator i, FI p, FI q )
   {
      return iterator( m_array.Insert( (array_iterator)const_cast<iterator>( i ), p, q ) );
   }
 
   void Append( const IndirectArray& x )
   {
      m_array.Append( x.m_array );
   }
 
   void Append( const T* p, size_type n = 1 )
   {
      m_array.Append( (void*)p, n );
   }
 
   template <class FI>
   void Append( FI p, FI q )
   {
      m_array.Append( p, q );
   }
 
   void Prepend( const IndirectArray& x )
   {
      m_array.Prepend( x.m_array );
   }
 
   void Prepend( const T* p, size_type n = 1 )
   {
      m_array.Prepend( (void*)p, n );
   }
 
   template <class FI>
   void Prepend( FI p, FI q )
   {
      m_array.Prepend( p, q );
   }
 
   void Add( const IndirectArray& x )
   {
      Append( x );
   }
 
   void Add( const T* p, size_type n = 1 )
   {
      Append( p, n );
   }
 
   template <class FI>
   void Add( FI i, FI j )
   {
      Append( i, j );
   }
 
   void Remove( const_iterator i, size_type n = 1 )
   {
      m_array.Remove( (array_iterator)const_cast<iterator>( i ), n );
   }
 
   void Remove( const_iterator i, const_iterator j )
   {
      m_array.Remove( (array_iterator)const_cast<iterator>( i ),
                      (array_iterator)const_cast<iterator>( j ) );
   }
 
   void Truncate( const_iterator i )
   {
      m_array.Truncate( (array_iterator)const_cast<iterator>( i ) );
   }
 
   void Remove( const T& v )
   {
      array_implementation r;
      for ( const_iterator i = ConstBegin(); i < ConstEnd(); ++i )
         if ( *i == nullptr || **i != v )
            r.Add( (void*)*i );
      if ( r.Length() < m_array.Length() )
         m_array.Transfer( r );
   }
 
   template <class BP>
   void Remove( const T& v, BP p )
   {
      array_implementation r;
      for ( const_iterator i = ConstBegin(); i < ConstEnd(); ++i )
         if ( *i == nullptr || !p( **i, v ) )
            r.Add( (void*)*i );
      if ( r.Length() < m_array.Length() )
         m_array.Transfer( r );
   }
 
   void Remove( const T* p )
   {
      m_array.Remove( (void*)p );
   }
 
   void Clear()
   {
      m_array.Clear();
   }
 
   void Delete( iterator i, size_type n = 1 )
   {
      Delete( i, i+n );
   }
 
   void Delete( iterator i, iterator j )
   {
      // NB: Copy-on-write must *not* happen in this function.
      if ( i < ConstEnd() )
      {
         i = pcl::Max( const_cast<iterator>( ConstBegin() ), i );
         j = pcl::Min( j, const_cast<iterator>( ConstEnd() ) );
         allocator a;
         for ( ; i < j; ++i )
            if ( *i != nullptr )
               DeleteObject( i, a );
      }
   }
 
   void Delete( const T& v )
   {
      // NB: Copy-on-write must *not* happen in this function.
      allocator a;
      for ( iterator i = const_cast<iterator>( ConstBegin() ); i < ConstEnd(); ++i )
         if ( *i != nullptr && **i == v )
            DeleteObject( i, a );
   }
 
   template <class BP>
   void Delete( const T& v, BP p )
   {
      // NB: Copy-on-write must *not* happen in this function.
      allocator a;
      for ( iterator i = const_cast<iterator>( ConstBegin() ); i < ConstEnd(); ++i )
         if ( *i != nullptr && p( **i, v ) )
            DeleteObject( i, a );
   }
 
   void Delete()
   {
      // NB: Copy-on-write must *not* happen in this function.
      allocator a;
      for ( iterator i = const_cast<iterator>( ConstBegin() ); i < ConstEnd(); ++i )
         if ( *i != nullptr )
            DeleteObject( i, a );
   }
 
   void Destroy( iterator i, size_type n = 1 )
   {
      Delete( i, n );
      Remove( i, n );
   }
 
   void Destroy( iterator i, iterator j )
   {
      Delete( i, j );
      Remove( i, j );
   }
 
   void Destroy( const T& v )
   {
      array_implementation r;
      allocator a;
      for ( iterator i = const_cast<iterator>( ConstBegin() ); i < ConstEnd(); ++i )
         if ( *i != nullptr && **i == v )
            DeleteObject( i, a );
         else
            r.Add( (void*)*i );
      // NB: Copy-on-write must *not* happen before this point.
      if ( r.Length() < m_array.Length() )
         m_array.Transfer( r );
   }
 
   template <class BP>
   void Destroy( const T& v, BP p )
   {
      array_implementation r;
      allocator a;
      for ( iterator i = const_cast<iterator>( ConstBegin() ); i < ConstEnd(); ++i )
         if ( *i != nullptr && p( **i, v ) )
            DeleteObject( i, a );
         else
            r.Add( (void*)*i );
      // NB: Copy-on-write must *not* happen before this point.
      if ( r.Length() < m_array.Length() )
         m_array.Transfer( r );
   }
 
   void Destroy()
   {
      Delete();
      Clear();
   }
 
   void Pack()
   {
      m_array.Remove( (void*)nullptr );
   }
 
   iterator Replace( const_iterator i, const_iterator j, const IndirectArray& x )
   {
      return iterator( m_array.Replace( (array_iterator)const_cast<iterator>( i ),
                                        (array_iterator)const_cast<iterator>( j ), x.m_array ) );
   }
 
   iterator Replace( const_iterator i, const_iterator j, const T* p, size_type n = 1 )
   {
      return iterator( m_array.Replace( (array_iterator)const_cast<iterator>( i ),
                                        (array_iterator)const_cast<iterator>( j ), (void*)p, n ) );
   }
 
   template <class FI>
   iterator Replace( const_iterator i, const_iterator j, FI p, FI q )
   {
      return iterator( m_array.Replace( (array_iterator)const_cast<iterator>( i ),
                                        (array_iterator)const_cast<iterator>( j ), p, q ) );
   }
 
   void Reserve( size_type n )
   {
      m_array.Reserve( n );
   }
 
   void Squeeze()
   {
      m_array.Squeeze();
   }
 
   void Fill( const T& v )
   {
      Apply( [v]( T* x ){ *x = v; } );
   }
 
   template <class F>
   void Apply( F f )
   {
      pcl::Apply( Begin(), End(), IndirectUnaryFunction<T*, F>( f ) );
   }
 
   template <class F>
   void Apply( F f ) const
   {
      pcl::Apply( Begin(), End(), IndirectUnaryFunction<const T*, F>( f ) );
   }
 
   template <class F>
   iterator FirstThat( F f ) const
   {
      return const_cast<iterator>( pcl::FirstThat( Begin(), End(), IndirectUnaryPredicate<const T*, F>( f ) ) );
   }
 
   template <class F>
   iterator LastThat( F f ) const
   {
      return const_cast<iterator>( pcl::LastThat( Begin(), End(), IndirectUnaryPredicate<const T*, F>( f ) ) );
   }
 
   size_type Count( const T& v ) const
   {
      return pcl::Count( Begin(), End(), &v, equal() );
   }
 
   size_type Count( const T* p ) const
   {
      return m_array.Count( (void*)p );
   }
 
   template <class BP>
   size_type Count( const T& v, BP p ) const
   {
      return pcl::Count( Begin(), End(), &v, IndirectBinaryPredicate<const T*, const T*, BP>( p ) );
   }
 
   template <class UP>
   size_type CountIf( UP p ) const
   {
      return pcl::CountIf( Begin(), End(), IndirectUnaryPredicate<const T*, UP>( p ) );
   }
 
   iterator MinItem() const
   {
      return const_cast<iterator>( pcl::MinItem( Begin(), End(), less() ) );
   }
 
   template <class BP>
   iterator MinItem( BP p ) const
   {
      return const_cast<iterator>( pcl::MinItem( Begin(), End(),
                                                 IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   iterator MaxItem() const
   {
      return const_cast<iterator>( pcl::MaxItem( Begin(), End(), less() ) );
   }
 
   template <class BP>
   iterator MaxItem( BP p ) const
   {
      return const_cast<iterator>( pcl::MaxItem( Begin(), End(),
                                                 IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   void Reverse()
   {
      m_array.Reverse();
   }
 
   void Rotate( distance_type n )
   {
      m_array.Rotate( n );
   }
 
   void ShiftLeft( const T* p, size_type n = 1 )
   {
      m_array.ShiftLeft( (void*)p, n );
   }
 
   void ShiftRight( const T* p, size_type n = 1 )
   {
      m_array.ShiftRight( (void*)p, n );
   }
 
   iterator Search( const T& v ) const
   {
      return const_cast<iterator>( pcl::LinearSearch( Begin(), End(), &v, equal() ) );
   }
 
   iterator Search( const T* p ) const
   {
      return iterator( m_array.Search( (void*)p ) );
   }
 
   template <class BP>
   iterator Search( const T& v, BP p ) const
   {
      return const_cast<iterator>( pcl::LinearSearch( Begin(), End(), &v,
                                                      IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   iterator SearchLast( const T& v ) const
   {
      return const_cast<iterator>( pcl::LinearSearchLast( Begin(), End(), &v, equal() ) );
   }
 
   iterator SearchLast( const T* p ) const
   {
      return iterator( m_array.SearchLast( (void*)p ) );
   }
 
   template <class BP>
   iterator SearchLast( const T& v, BP p ) const
   {
      return const_cast<iterator>( pcl::LinearSearchLast( Begin(), End(), &v,
                                                          IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   template <class FI>
   iterator SearchSubset( FI i, FI j ) const
   {
      return const_cast<iterator>( pcl::Search( Begin(), End(), i, j, equal() ) );
   }
 
   template <class FI, class BP>
   iterator SearchSubset( FI i, FI j, BP p ) const
   {
      return const_cast<iterator>( pcl::Search( Begin(), End(), i, j,
                                                IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   template <class C>
   iterator SearchSubset( const C& c ) const
   {
      return const_cast<iterator>( pcl::Search( Begin(), End(), c.Begin(), c.End(), equal() ) );
   }
 
   template <class C, class BP>
   iterator SearchSubset( const C& c, BP p ) const
   {
      return const_cast<iterator>( pcl::Search( Begin(), End(), c.Begin(), c.End(),
                                                IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   template <class BI>
   iterator SearchLastSubset( BI i, BI j ) const
   {
      return const_cast<iterator>( pcl::SearchLast( Begin(), End(), i, j, equal() ) );
   }
 
   template <class BI, class BP>
   iterator SearchLastSubset( BI i, BI j, BP p ) const
   {
      return const_cast<iterator>( pcl::SearchLast( Begin(), End(), i, j,
                                                    IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   template <class C>
   iterator SearchLastSubset( const C& c ) const
   {
      return const_cast<iterator>( pcl::SearchLast( Begin(), End(), c.Begin(), c.End(), equal() ) );
   }
 
   template <class C, class BP>
   iterator SearchLastSubset( const C& c, BP p ) const
   {
      return const_cast<iterator>( pcl::SearchLast( Begin(), End(), c.Begin(), c.End(),
                                                    IndirectBinaryPredicate<const T*, const T*, BP>( p ) ) );
   }
 
   bool Contains( const T& v ) const
   {
      return Search( v ) != End();
   }
 
   bool Contains( const T* p ) const
   {
      return m_array.Contains( (void*)p );
   }
 
   template <class BP>
   bool Contains( const T& v, BP p ) const
   {
      return Search( v, p ) != End();
   }
 
   template <class FI>
   iterator ContainsSubset( FI i, FI j ) const
   {
      return SearchSubset( i, j ) != End();
   }
 
   template <class FI, class BP>
   iterator ContainsSubset( FI i, FI j, BP p ) const
   {
      return SearchSubset( i, j, p ) != End();
   }
 
   template <class C>
   iterator ContainsSubset( const C& c ) const
   {
      return SearchSubset( c ) != End();
   }
 
   template <class C, class BP>
   iterator ContainsSubset( const C& c, BP p ) const
   {
      return SearchSubset( c, p ) != End();
   }
 
   void Sort()
   {
      pcl::QuickSort( Begin(), End(), less() );
   }
 
   template <class BP>
   void Sort( BP p )
   {
      pcl::QuickSort( Begin(), End(), IndirectBinaryPredicate<const T*, const T*, BP>( p ) );
   }
 
   friend void Swap( IndirectArray& x1, IndirectArray& x2 )
   {
      pcl::Swap( x1.m_array, x2.m_array );
   }
 
   template <class S, typename SP>
   S& ToSeparated( S& s, SP separator ) const
   {
      const_iterator i = Begin();
      if ( i < End() )
      {
         while ( *i == nullptr )
            if ( ++i == End() )
               return s;
         s.Append( S( **i ) );
         if ( ++i < End() )
            do
               if ( *i != nullptr )
               {
                  s.Append( separator );
                  s.Append( S( **i ) );
               }
            while ( ++i < End() );
      }
      return s;
   }
 
   template <class S, typename SP, class AF>
   S& ToSeparated( S& s, SP separator, AF append ) const
   {
      const_iterator i = Begin();
      if ( i < End() )
      {
         while ( *i == nullptr )
            if ( ++i == End() )
               return s;
         append( s, S( **i ) );
         if ( ++i < End() )
         {
            S p( separator );
            do
               if ( *i != nullptr )
               {
                  append( s, p );
                  append( s, S( **i ) );
               }
            while ( ++i < End() );
         }
      }
      return s;
   }
 
   template <class S>
   S& ToCommaSeparated( S& s ) const
   {
      return ToSeparated( s, ',' );
   }
 
   template <class S>
   S& ToSpaceSeparated( S& s ) const
   {
      return ToSeparated( s, ' ' );
   }
 
   template <class S>
   S& ToTabSeparated( S& s ) const
   {
      return ToSeparated( s, '\t' );
   }
 
   template <class S>
   S& ToNewLineSeparated( S& s ) const
   {
      return ToSeparated( s, '\n' );
   }
 
   uint64 Hash64( uint64 seed = 0 ) const
   {
      return m_array.Hash64( seed );
   }
 
   uint32 Hash32( uint32 seed = 0 ) const
   {
      return m_array.Hash32( seed );
   }
 
   uint64 Hash( uint64 seed = 0 ) const
   {
      return Hash64( seed );
   }
 
   // -------------------------------------------------------------------------
 
private:
 
   array_implementation m_array;
 
   void DeleteObject( iterator i, allocator& a )
   {
      pcl::Destroy( *i );
      a.Deallocate( *i );
      *i = nullptr;
   }
 
   template <class C>
   void CloneObjects( const C& x, DirectContainer<T>* )
   {
      Clear();
      Reserve( x.Length() );
      Append( static_cast<T*>( nullptr ), x.Length() );
      iterator i = Begin(), j = End();
      typename C::const_iterator p = x.Begin(), q = x.End();
      for ( allocator a; i < j && p != q; ++i, ++p )
      {
         *i = a.Allocate( 1 );
         pcl::Construct( *i, *p, a );
      }
   }
 
   template <class C>
   void CloneObjects( const C& x, IndirectContainer<T>* )
   {
      Clear();
      Reserve( x.Length() );
      Append( static_cast<T*>( nullptr ), x.Length() );
      iterator i = Begin(), j = End();
      typename C::const_iterator p = x.Begin(), q = x.End();
      for ( allocator a; i < j && p != q; ++i, ++p )
         if ( *p != nullptr )
         {
            *i = a.Allocate( 1 );
            pcl::Construct( *i, **p, a );
         }
   }
};
 
// ----------------------------------------------------------------------------
 
template <class T, class A> inline
bool operator ==( const IndirectArray<T,A>& x1, const IndirectArray<T,A>& x2 )
{
   return x1.Length() == x2.Length() && pcl::Equal( x1.Begin(), x2.Begin(), x2.End(), IndirectArray<T,A>::equal() );
}
 
template <class T, class A> inline
bool operator <( const IndirectArray<T,A>& x1, const IndirectArray<T,A>& x2 )
{
   return pcl::Compare( x1.Begin(), x1.End(), x2.Begin(), x2.End(), IndirectArray<T,A>::less() ) < 0;
}
 
template <class T, class A, class V> inline
IndirectArray<T,A>& operator <<( IndirectArray<T,A>& x, const V* p )
{
   x.Append( static_cast<const T*>( p ) );
   return x;
}
 
template <class T, class A, class V> inline
IndirectArray<T,A>& operator <<( IndirectArray<T,A>&& x, const V* p )
{
   x.Append( static_cast<const T*>( p ) );
   return x;
}
 
template <class T, class A> inline
IndirectArray<T,A>& operator <<( IndirectArray<T,A>& x1, const IndirectArray<T,A>& x2 )
{
   x1.Append( x2 );
   return x1;
}
 
template <class T, class A> inline
IndirectArray<T,A>& operator <<( IndirectArray<T,A>&& x1, const IndirectArray<T,A>& x2 )
{
   x1.Append( x2 );
   return x1;
}
 
// ----------------------------------------------------------------------------
 
} // pcl
 
#endif  // __PCL_IndirectArray_h
 
// ----------------------------------------------------------------------------
// EOF pcl/IndirectArray.h - Released 2024-05-07T15:27:32Z