Recent changes to class structure

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Sun, 11 Sep 2011 03:44:26 -0000

--- v7 
+++ v8 
@@ -66,7 +66,7 @@
         }
     }
 
-The add_sequence() function operates on a vector of Objects:
+The add_sequence() function operates on a vector of Objects.  To add a sequence [A, B, C] to a tree, we call add_sequence(o), where o points to the first object in the vector.
 
     Object: :add_sequence( vector: :iterator o){
        if (o->lemma == "") return

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Sat, 10 Sep 2011 05:48:21 -0000

--- v6 
+++ v7 
@@ -69,7 +69,7 @@
 The add_sequence() function operates on a vector of Objects:
 
     Object: :add_sequence( vector: :iterator o){
-       if (lemma == "") return
+       if (o->lemma == "") return
        for (b=branches.begin; b!=branches.end){
           if (o->lemma == b->lemma){
              b->count++

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Sat, 10 Sep 2011 05:46:27 -0000

--- v5 
+++ v6 
@@ -83,3 +83,37 @@
        branches.back().add_sequence(++o)
     }
 
+An example main() function to build and print the tree would be:
+
+    main(){
+
+      Object A, B, C
+      A->lemma="A"
+      B->lemma="B"
+      C->lemma="C"
+      vector v1 = [ A, B, C ]
+      vector v2 = [ A, B, D ]
+
+      Object tree
+      vector: :iterator o=v1.begin
+      tree.add_sequence(o)
+      tree.add_sequence(o)
+
+      o = v2.begin()
+      tree.add_sequence(o)
+
+      tree.sort_branches()
+      tree.printout()
+    }   
+
+
+This would printout the tree:
+
+    A :3
+         B :3
+              C :2
+              D :1
+
+
+The class used in the ensuing analysis is expanded from the above definition.  But the general framework is the same.
+

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Sat, 10 Sep 2011 05:33:28 -0000

--- v4 
+++ v5 
@@ -51,10 +51,35 @@
 
 The member functions are all recursive: (in pseudo code) 
 
-     Object::printout(int depth){
+    Object: :printout(int depth){
       for( i =0; iprintout(depth+1)
+       }
+    }
+
+    Object: :sort_branches(){
+        branches.sort()
+        for (b=branches.begin; b!=branches.end){
+            b->sort_branches()
+        }
+    }
+
+The add_sequence() function operates on a vector of Objects:
+
+    Object: :add_sequence( vector: :iterator o){
+       if (lemma == "") return
+       for (b=branches.begin; b!=branches.end){
+          if (o->lemma == b->lemma){
+             b->count++
+             b->add_sequence(++o)
+             return
+          }
+       }      
+       // new branch
+       Object new_branch(*o)
+       branches.push_back(new_branch)
+       branches.back().add_sequence(++o)
+    }

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Sat, 10 Sep 2011 05:12:28 -0000

--- v3 
+++ v4 
@@ -49,3 +49,12 @@
 
 
 
+The member functions are all recursive: (in pseudo code) 
+
+     Object::printout(int depth){
+      for( i =0; i

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Fri, 09 Sep 2011 11:44:04 -0000

--- v2 
+++ v3 
@@ -14,13 +14,15 @@
 
 
 In the following example tree:
+
     A :3
          B :3
               C :2
               D :1
 
 
 The object instances would be:
+
      Object A {
                lemma = "A"
                count = 3

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Fri, 09 Sep 2011 11:43:47 -0000

--- v1 
+++ v2 
@@ -1,13 +1,49 @@
-class Object{
-public:
-  string lemma;
-  int count;
-  
-  list branches;
- 
-  void    add_sequence(  vector::iterator );
-  void    sort_branches();
-  void    printout(int);
- 
-}
+Each node of the tree is an instance of the "Object" class below.  
+
+    class Object{
+    public:
+      string lemma;              // identifier
+      int    count;              
+      list branches;
+ 
+      void    add_sequence(  vector::iterator );
+      void    sort_branches();
+      void    printout(int);
+     }
+
+
+
+In the following example tree:
+    A :3
+         B :3
+              C :2
+              D :1
+
+
+The object instances would be:
+     Object A {
+               lemma = "A"
+               count = 3
+               branches = [ B ]
+               } 
+
+     Object B {
+               lemma = "B"
+               count = 3
+               branches = [ C,D ]
+               } 
+
+     Object C {
+               lemma = "C"
+               count = 2
+               branches = [ ]
+               } 
+
+     Object D {
+               lemma = "D"
+               count = 1
+               branches = [ ]
+               } 
+
+

WikiPage class structure modified by Ken Del Signore

Ken Del Signore — Thu, 08 Sep 2011 04:13:24 -0000

class Object{ public: string lemma; int count; list branches; void add_sequence( vector::iterator ); void sort_branches(); void printout(int); }