1 files changed, 0 insertions, 163 deletions
diff --git a/ace/Vector_T.cpp b/ace/Vector_T.cpp
deleted file mode 100644
index 2dcbd96f67c..00000000000
--- a/ace/Vector_T.cpp
+++ /dev/null
@@ -1,163 +0,0 @@
-// $Id$
-
-#ifndef ACE_VECTOR_T_C
-#define ACE_VECTOR_T_C
-
-#if !defined (ACE_LACKS_PRAGMA_ONCE)
-# pragma once
-#endif /* ACE_LACKS_PRAGMA_ONCE */
-
-#include "ace/Vector_T.h"
-
-#if !defined (__ACE_INLINE__)
-#include "ace/Vector_T.inl"
-#endif /* __ACE_INLINE__ */
-
-ACE_RCSID(ace, Vector_T, "$Id$")
-
-ACE_ALLOC_HOOK_DEFINE(ACE_Vector)
-
-template <class T, size_t DEFAULT_SIZE>
-void ACE_Vector<T, DEFAULT_SIZE>::resize (const size_t new_size,
-					  const T& t)
-{
-  ACE_Array<T>::size (new_size);
-  if (new_size > length_)
-    for (size_t i = length_; i < new_size; ++i)
-      (*this)[i]=t;
-
-  curr_max_size_ = this->max_size ();
-  length_ = new_size;
-}
-
-template <class T, size_t DEFAULT_SIZE>
-void ACE_Vector<T, DEFAULT_SIZE>::push_back (const T& elem)
-{
-  if (length_ == curr_max_size_)
-    {
-      ACE_Array<T>::size (curr_max_size_ * 2);
-      curr_max_size_ = this->max_size ();
-    }
-  ++length_;
-  (*this)[length_-1] = elem;
-}
-
-template <class T, size_t DEFAULT_SIZE>
-void ACE_Vector<T, DEFAULT_SIZE>::dump (void) const
-{
-#if defined (ACE_HAS_DUMP)
-#if 0
-  // Can't do this unless the vector is an object with a dump
-  // function.
-  for (size_t i = 0; i < this->size (); ++i)
-    (*this)[i].dump ();
-#endif /* 0 */
-#endif /* ACE_HAS_DUMP */
-}
-
-// Compare this vector with <s> for equality.
-template <class T, size_t DEFAULT_SIZE> bool
-ACE_Vector<T, DEFAULT_SIZE>::operator== (const ACE_Vector<T, DEFAULT_SIZE> &s) const
-{
-  if (this == &s)
-    return true;
-  else if (this->size () != s.size ())
-    return false;
-
-  const size_t len = s.size ();
-  for (size_t slot = 0; slot < len; ++slot)
-    if ((*this)[slot] != s[slot])
-      return false;
-
-  return true;
-}
-
-#if 0
-template<class T>
-int compare(const ACE_Vector<T>& v1,
-            const ACE_Vector<T>& v2,
-            const size_t from_ndx,
-            const size_t to_ndx)
-{
-  size_t last1 = v1.size () - 1;
-  size_t last2 = v2.size () - 1;
-  if (last1 < from_ndx || last1 < to_ndx)
-    {
-      return false;
-    }
-  if (last2 < from_ndx || last2 < to_ndx)
-    {
-      return false;
-    }
-  if (last1 != last2)
-    {
-      return false;
-    }
-
-  //  cout<<"compare() <================="<<endl;
-  for (size_t i = from_ndx; i <= to_ndx; ++i)
-    {
-      //     cout<<"V1["<<i<<"]="<<v1[i];
-      //     cout<<", V2["<<i<<"]="<<v2[i];
-      //     cout<<": NOT EQUAL == "<<(v1[i]!=v2[i])<<endl;
-      if (v1[i] != v2[i])
-	{
-	  return false;
-	}
-    }
-  //  cout<<"compare() ====================>"<<endl;
-  return true;
-}
-
-template<class T>
-int partial_compare(const ACE_Vector<T>& v1,
-		    const ACE_Vector<T>& v2,
-		    const size_t from_ndx,
-		    const size_t to_ndx)
-{
-  size_t last1 = v1.size () - 1;
-  size_t last2 = v2.size () - 1;
-  if (last1 < from_ndx || last1 < to_ndx)
-    {
-      return false;
-    }
-  if (last2 < from_ndx || last2 < to_ndx)
-    {
-      return false;
-    }
-  //  cout<<"partial_compare() <================="<<endl;
-  for (size_t i = from_ndx; i <= to_ndx; ++i)
-    {
-      //     cout<<"V1["<<i<<"]="<<v1[i];
-      //     cout<<", V2["<<i<<"]="<<v2[i];
-      //     cout<<": NOT EQUAL == "<<(v1[i]!=v2[i])<<endl;
-      if (v1[i] != v2[i])
-	{
-	  return false;
-	}
-    }
-  //  cout<<"partial_compare() ====================>"<<endl;
-  return true;
-}
-#endif
-
-// ****************************************************************
-
-template <class T, size_t DEFAULT_SIZE> int
-ACE_Vector_Iterator<T, DEFAULT_SIZE>::next (T *&item)
-{
-  // ACE_TRACE ("ACE_Vector_Iterator<T>::next");
-
-  if (this->done ())
-    {
-      item = 0;
-      return 0;
-    }
-  else
-    {
-      item = &vector_[current_];
-      return 1;
-    }
-}
-
-#endif /* ACE_VECTOR_T_C */