added explicit template instantiations.

1 files changed, 41 insertions, 39 deletions

diff --git a/TAO/examples/Simulator/DOVEMIB/Node.cpp b/TAO/examples/Simulator/DOVEMIB/Node.cpp
index 226336cb45b..20da755adef 100644
--- a/TAO/examples/Simulator/DOVEMIB/Node.cpp
+++ b/TAO/examples/Simulator/DOVEMIB/Node.cpp
@@ -7,7 +7,7 @@
 //    any_test_i.cpp
 //
 // = AUTHOR
-//    Michael Kircher 
+//    Michael Kircher
 //
 // = DESCRIPTION
 //   Implementation of the Nodes for the any evaluator.
@@ -19,7 +19,7 @@
 ACE_RCSID(DOVEMIB, Node, "$Id$")
 
 StructNode::StructNode (const char *Name_ptr,
-			unsigned int recursion_level) {
+                        unsigned int recursion_level) {
   Name_ptr_ = Name_ptr;
   queue_ptr_ = new ACE_Unbounded_Queue<Node *>;
   recursion_level_ = recursion_level;
@@ -41,15 +41,15 @@ StructNode::getChildNumber () {
   return (unsigned int) queue_ptr_->size ();
 }
 
-Node * 
+Node *
 StructNode::getChild (unsigned int n) {
-    
+
   // create new iterator if some things have changed
-  if (queue_iterator_ptr_ == 0) {      
+  if (queue_iterator_ptr_ == 0) {
     queue_iterator_ptr_ = new ACE_Unbounded_Queue_Iterator<Node *> (*queue_ptr_);
     queue_position_ = 0;
   }
-  
+
   // check if we have such a Zebra
   if (n < queue_ptr_->size ()) {
     // if we are already to far in the queue
@@ -57,21 +57,21 @@ StructNode::getChild (unsigned int n) {
       queue_position_ = 0;
       queue_iterator_ptr_->first ();
     }
-      
+
     Node **node_ptr_ptr_;
-    for (; 
-	      !queue_iterator_ptr_->done() && queue_position_ <= n;
-	      queue_iterator_ptr_->advance (), queue_position_++) {
+    for (;
+              !queue_iterator_ptr_->done() && queue_position_ <= n;
+              queue_iterator_ptr_->advance (), queue_position_++) {
       queue_iterator_ptr_->next (node_ptr_ptr_);
-    }      
-    return (*node_ptr_ptr_); 
+    }
+    return (*node_ptr_ptr_);
   }
   else {
     return 0;
   }
 }
 
-int 
+int
 StructNode::addChild (Node *node) {
   delete queue_iterator_ptr_;
   queue_iterator_ptr_ = 0;
@@ -88,16 +88,16 @@ StructNode::Accept (NodeVisitor *nodeVisitor) {
   nodeVisitor->visitStructNode (this);
 }
 
-unsigned int 
+unsigned int
 StructNode::getRecursionLevel () {
   return recursion_level_;
 }
 
 DoubleNode::DoubleNode (CORBA::Double *Double_ptr,
-			const char *Name_ptr,
-			unsigned int recursion_level)  {
+                        const char *Name_ptr,
+                        unsigned int recursion_level)  {
   Double_ptr_ = Double_ptr;
-  Name_ptr_ = Name_ptr; 
+  Name_ptr_ = Name_ptr;
   recursion_level_ = recursion_level;
 }
 
@@ -108,7 +108,7 @@ DoubleNode::getName () {
 
 
 
-CORBA::Double 
+CORBA::Double
 DoubleNode::getValue () {
   return *Double_ptr_;
 }
@@ -124,8 +124,8 @@ DoubleNode::getRecursionLevel () {
 }
 
 LongNode::LongNode (CORBA::Long *Long_ptr,
-		    const char *Name_ptr,
-		    unsigned int recursion_level) {
+                    const char *Name_ptr,
+                    unsigned int recursion_level) {
   Long_ptr_ = Long_ptr;
   Name_ptr_ = Name_ptr;
   recursion_level_ = recursion_level;
@@ -146,20 +146,20 @@ LongNode::Accept (NodeVisitor *nodeVisitor) {
   nodeVisitor->visitLongNode (this);
 }
 
-unsigned int 
+unsigned int
 LongNode::getRecursionLevel () {
   return recursion_level_;
 }
 
-ULongNode::ULongNode (CORBA::ULong *ULong_ptr, 
-		      const char *Name_ptr,
-		      unsigned int recursion_level) {
-  ULong_ptr_ = ULong_ptr; 
+ULongNode::ULongNode (CORBA::ULong *ULong_ptr,
+                      const char *Name_ptr,
+                      unsigned int recursion_level) {
+  ULong_ptr_ = ULong_ptr;
   Name_ptr_ = Name_ptr;
   recursion_level_ = recursion_level;
 }
 
-const char * 
+const char *
 ULongNode::getName () {
   return Name_ptr_;
 }
@@ -174,17 +174,17 @@ ULongNode::Accept (NodeVisitor *nodeVisitor) {
   nodeVisitor->visitULongNode (this);
 }
 
-unsigned int 
+unsigned int
 ULongNode::getRecursionLevel () {
   return recursion_level_;
 }
 
 
-StringNode::StringNode (CORBA::String_var String_var, 
-			const char *Name_ptr,
-			unsigned int recursion_level) {
+StringNode::StringNode (CORBA::String_var String_var,
+                        const char *Name_ptr,
+                        unsigned int recursion_level) {
   String_var_ = String_var;
-  Name_ptr_ = Name_ptr; 
+  Name_ptr_ = Name_ptr;
   recursion_level_ = recursion_level;
 }
 
@@ -203,15 +203,17 @@ StringNode::Accept (NodeVisitor *nodeVisitor) {
   nodeVisitor->visitStringNode (this);
 }
 
-unsigned int 
+unsigned int
 StringNode::getRecursionLevel () {
   return recursion_level_;
 }
 
-
-
-
-
-
-
-
+#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
+template class ACE_Node<Node *>;
+template class ACE_Unbounded_Queue<Node *>;
+template class ACE_Unbounded_Queue_Iterator<Node *>;
+#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
+#pragma instantiate ACE_Node<Node *>
+#pragma instantiate ACE_Unbounded_Queue<Node *>
+#pragma instantiate ACE_Unbounded_Queue_Iterator<Node *>
+#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */