Remove src2 directory

[creaImageIO.git] / src2 / creaImageIOIndexedHeap.h

diff --git a/src2/creaImageIOIndexedHeap.h b/src2/creaImageIOIndexedHeap.h
deleted file mode 100644 (file)
index 8568b67..0000000
--- a/src2/creaImageIOIndexedHeap.h
+++ /dev/null
@@ -1,139 +0,0 @@
-/* 
-
-*/
-/*! \file 
-       \brief Indexed priority queues handled by binary trees.
-*/
-#ifndef __creaImageIOIndexedHeap_h_INCLUDED__
-#define __creaImageIOIndexedHeap_h_INCLUDED__
-
-#include <vector>
-
-namespace creaImageIO 
-{
-
-       
-
-  template <class T, 
-           class Comparator/*=Less<T>*/,
-           class Indexer/*=Index<T> */> 
-  class IndexedHeap ;
-  template < class T, 
-            class C, 
-            class I> 
-  std::ostream& operator << (std::ostream&, const IndexedHeap<T,C,I>& );
- 
-
-  //template <class T, class Comparator=std::less<T>, class Index=IndexIndex<T> > class SlicedIndexedHeap; 
-
-
-  //========================================================================
-  /// \brief Indexed priority queues handled by binary trees. 
-  /// 
-  ///  Heap Allows :
-  ///          - log(n) insertion
-  ///          - constant time acces to the first element
-  ///          - log(n) removal of the first element
-  ///          - log(n) priority change of a random element 
-  /// Indexation Allows :
-  ///          - constant time access to a random element (for priority change)
-  /// 
-  /// The Indexer is an unary_function<T,int&> whose operator()(T& t) 
-  /// returns a reference on an integer which 
-  /// is maintained by the IndexedHeap in order to provide at any time 
-  /// the position of the object t in the Heap 
-  /// (hence allowing constant time random access to an object). 
-  template <class T, 
-           class Comparator /*=Less<T>*/, 
-           class Indexer /*=Index<T>*/> 
-  class IndexedHeap 
-  {
-    //                 friend class SlicedIndexedHeap<T,Comparator,Index>;
-  public :
-               
-    //======================================================================
-    /// Constructor 
-    IndexedHeap () {}
-    /// Constructor 
-    IndexedHeap ( const Comparator& comp, const Indexer& ind ) ;
-    /// Destructor 
-    ~IndexedHeap() { }
-    /// Sets the comparator 
-    void set( const Comparator& comp );
-    /// Sets the Index 
-    void set( const Indexer& ind );
-    //======================================================================
-               
-    //======================================================================
-    /// inserts an element in the Heap and returns its position 
-    int insert(T);
-    /// return a reference on the first element of the Heap 
-    T& top(); 
-    /// return a constant reference on the first element of the Heap 
-    const T& top() const;  
-    /// removes and returns the first element of the Heap 
-    T remove_top();
-    /// removes and returns the nth element 
-    T remove(int n);
-    /// returns the size of the Heap 
-    inline int size() const {return m_p.size(); }
-    /// empties the Heap 
-       void clear();
-    //======================================================================
-       
-    //======================================================================
-    /// returns a constant on the stack of elements 
-    const std::vector<T> & stack() const {return m_p;}
-    /// returns a reference to the ith element of the stack 
-    T& operator [] (int i) { return m_p[i];}
-    /// returns a constant reference to the ith element of the stack 
-    const T& operator [] (int i) const { return m_p[i];}
-    /// returns the index (position) of t 
-    inline int index(T& t) { return (*m_i)(t); }
-    //======================================================================
-
-    //======================================================================
-    /// returns the position of the father of i 
-    inline int father( int i ) const;
-    /// returns the position of the right son of i 
-    inline int rightson( int i ) const;
-    /// returns the position of the leftson of i 
-    inline int leftson( int i ) const;
-    //======================================================================
-    /// swaps ith and jth elements 
-    inline void swap(int i, int j);
-    /// remonte un element dans le tas tant qu'il n'est pas a sa place. 
-    /// renvoie la position finale 
-    inline int upsort(int);
-    /// descend un element dans le tas tant qu'il n'est pas a sa place.
-    /// renvoie la position finale
-    inline int downsort(int);
-    //======================================================================
-                       
-  protected : 
-    /// binary tree handled by a vector 
-    std::vector<T> m_p;
-    /// comparator pointer 
-    const Comparator* m_c;
-    /// Index pointer 
-    const Indexer*  m_i;
-  };
-  //========================================================================
-  // EO class IndexedHeap
-  //========================================================================
-
-
-#include "creaImageIOIndexedHeap.txx"
-
-
-};
-//===========================================================================
-// EO namespace creaImageIO
-//===========================================================================
-
-
-
-//===========================================================================
-// EOF
-//===========================================================================
-#endif