[Scstudio-commits] SF.net SVN: scstudio: [15] trunk/src/data/livenodedetection.cc

[<koc...@us...>]

Revision: 15
          http://scstudio.svn.sourceforge.net/scstudio/?rev=15&view=rev
Author:   kocianon
Date:     2008-04-08 03:51:56 -0700 (Tue, 08 Apr 2008)

Log Message:
-----------
Coding Conventions changes

Modified Paths:
--------------
    trunk/src/data/livenodedetection.cc

Modified: trunk/src/data/livenodedetection.cc
===================================================================
--- trunk/src/data/livenodedetection.cc	2008-04-08 08:08:07 UTC (rev 14)
+++ trunk/src/data/livenodedetection.cc	2008-04-08 10:51:56 UTC (rev 15)
@@ -19,33 +19,39 @@
 #include <list>
 #include <string>
 #include <map>
+#include <queue>
+
 #include "msc.h"
 
-
 class GraphNode 
 {
     
-private:
-  ReferenceNodePtr m_ReferenceNodePtrNode;
-  bool m_visited;
-  list<GraphNode> m_GraphNodeList;
-public:
-  GraphNode(ReferenceNodePtr ref) : m_ReferenceNodePtrNode(ref), visited(false) {}
-  
+  private:
+    ReferenceNodePtr m_ReferenceNodePtr;
+    bool m_visited;
+    std::list<GraphNode> m_GraphNodeList;
+  public:
+    getM_visited;
+    GraphNode(ReferenceNodePrt ref);
+    ~GraphNode();
 };
 
-using namespace std;
+GraphNode::GraphNode(ReferenceNodePtr ref)
+{
+  m_ReferenceNodePrt(ref);
+  m_visited(false);
+}
 
 int main(int argc, char** argv) 
 {
     
-  list<GraphNode> graphNodeList;
-  list<GraphNode> graphNodeEndList;
-  queue<GraphNode> graphNodeQueue;
+  std::list<GraphNode> graphNodeList;
+  std::list<GraphNode> graphNodeEndList;
+  std::queue<GraphNode> graphNodeQueue;
     
     
-  list<ReferenceNodePtr> referenceNodePtrList;
-  list<ReferenceNodePtr> reachedReferenceNodePtrList;
+  std::list<ReferenceNodePtr> referenceNodePtrList;
+  std::list<ReferenceNodePtr> reachedReferenceNodePtrList;
     
   StartNodePtr startNodePrt;
   HMscPtr hMscPtr;
@@ -53,11 +59,11 @@
   GraphNode graphNodeFront;
   GraphNode graphNodeSuccessor;
    
-  map<ReferenceNodePtr,list<GraphNode>> relationGraphRefmap;
+  std::map<ReferenceNodePtr,list<GraphNode>> relationGraphRefmap;
     
-  list<ReferenceNodePtr>::iterator itReferenceNodePtr;
-  list<ReferenceNodePtr>::iterator itReferenceNodePtrSec;
-  list<GraphNode>::iterator itGraphNode;
+  std::list<ReferenceNodePtr>::iterator itReferenceNodePtr;
+  std::list<ReferenceNodePtr>::iterator itReferenceNodePtrSec;
+  std::list<GraphNode>::iterator itGraphNode;
  
 
   /**
@@ -75,7 +81,7 @@
     
   for (itReferenceNodePtr = referenceNodePtrList.begin(); itReferenceNodePtr != referenceNodePtrList.end(); referenceNodePtr++ )
   {
-    GraphNode newGraphNode = GraphNode(*itReferenceNodePtr);
+    GraphNode newGraphNode = new GraphNode(*itReferenceNodePtr);
     GraphNodeList.push_back(newGraphNode);
     if((*itReferenceNodePtr)->m_end!=null)
       GraphNodeEndList.push_back(newGraphNode);


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.