summaryrefslogtreecommitdiff
path: root/ace/Containers.i
diff options
context:
space:
mode:
authorschmidt <douglascraigschmidt@users.noreply.github.com>1998-09-16 23:37:28 +0000
committerschmidt <douglascraigschmidt@users.noreply.github.com>1998-09-16 23:37:28 +0000
commitb0c2215400c73c76bf943be729bd7cb9ac9937e7 (patch)
tree0a66ad6416a461420129850dfd66bc20d13f294d /ace/Containers.i
parent240a318fb9204b3fc4dfcdf7f217e6b38aed9027 (diff)
downloadATCD-b0c2215400c73c76bf943be729bd7cb9ac9937e7.tar.gz
*** empty log message ***
Diffstat (limited to 'ace/Containers.i')
-rw-r--r--ace/Containers.i126
1 files changed, 126 insertions, 0 deletions
diff --git a/ace/Containers.i b/ace/Containers.i
index c49f95438a4..05c55c3ed86 100644
--- a/ace/Containers.i
+++ b/ace/Containers.i
@@ -376,3 +376,129 @@ ACE_Array_Iterator<T>::done (void) const
return this->current_ >= array_.size ();
}
+
+template <class T> ACE_INLINE
+ACE_DLList_Node::ACE_DLList_Node (void)
+ : item_ (0),
+ next_ (0),
+ prev_ (0)
+{}
+
+template <class T> ACE_INLINE
+ACE_DLList_Node::ACE_DLList_Node (T *&i,
+ ACE_DLList_Node<T> *n,
+ ACE_DLList_Node<T> *p)
+ : item_ (i),
+ next_ (n),
+ prev_ (p)
+{
+}
+
+template <class T> ACE_INLINE
+ACE_DLList_Node::~ACE_DLList_Node (void)
+{
+};
+
+template <class T> ACE_INLINE void
+ACE_DLList::operator= (ACE_DLList<T> &l)
+{
+ *(DLList *) this = l;
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList::is_empty (void) const
+{
+ return ACE_Double_Linked_List< ACE_DLList_Node<T> >::is_empty ();
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList::is_full (void) const
+{
+ return ACE_Double_Linked_List< ACE_DLList_Node<T> >::is_full ();
+}
+
+template <class T> ACE_INLINE void
+ACE_DLList::eset (void)
+{
+ ACE_Double_Linked_List< ACE_DLList_Node<T> >::reset ();
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList::get (T *&item, size_t index)
+{
+ DLList_NODE *node;
+ int result
+ = ACE_Double_Linked_List< ACE_DLList_Node<T> >::get (node,
+ index);
+ item = node->item_;
+ return result;
+}
+
+template <class T> ACE_INLINE size_t
+ACE_DLList::size (void) const
+{
+ return ACE_Double_Linked_List< ACE_DLList_Node<T> >::size ();
+}
+
+template <class T> ACE_INLINE void
+ACE_DLList::dump (void) const
+{
+ ACE_Double_Linked_List< ACE_DLList_Node<T> >::dump ();
+}
+
+template <class T> ACE_INLINE
+ACE_DLList::ACE_DLList (ACE_Allocator *alloc )
+ : ACE_Double_Linked_List< ACE_DLList_Node<T> > (alloc)
+{
+}
+
+template <class T> ACE_INLINE
+ACE_DLList::ACE_DLList (ACE_DLList<T> &l)
+ : ACE_Double_Linked_List< ACE_DLList_Node<T> > ((DLList &) l)
+{
+}
+
+template <class T> ACE_INLINE
+ACE_DLList::~ACE_DLList (void)
+{
+ while (this->delete_head ()) ;
+}
+
+template <class T> ACE_INLINE
+ACE_DLList_Iterator::ACE_DLList_Iterator (ACE_DLList<T> &l)
+ : ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> > (l)
+{
+}
+
+template <class T> ACE_INLINE T *
+ACE_DLList_Iterator::next (void) const
+{
+ ACE_DLList_Node<T> *temp
+ = ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> >::next ();
+ return temp ? temp->item_ : 0;
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList_Iterator::advance (void)
+{
+ return ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> >::advance ();
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList_Iterator::first (void)
+{
+ return ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> >::first ();
+}
+
+template <class T> ACE_INLINE int
+ACE_DLList_Iterator::done (void) const
+{
+ return ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> >::done ();
+}
+
+template <class T> ACE_INLINE void
+ACE_DLList_Iterator::dump (void) const
+{
+ ACE_Double_Linked_List_Iterator< ACE_DLList_Node<T> >::dump ();
+}
+