Adding primitive tree printing for debugging

Author: PapeCoding

Src/DasherCore/LanguageModelling/PPMLanguageModel.cpp

@@ -9,6 +9,8 @@
 #include "PPMLanguageModel.h"
 
 #include <cstring>
+#include <iostream>
+#include <iterator>
 #include <myassert.h>
 
 using namespace Dasher;
@@ -449,6 +451,19 @@ struct BinaryRecord {
   short int m_iSymbol;
 };
 
+void CPPMLanguageModel::printTreeRecursive(CPPMnode* node){
+  std::cout << '>' << std::endl;
+  for (ChildIterator it = node->children(); it != node->end(); it++) {
+    std::cout << static_cast<char>('a' + (*it)->sym - 1) << '|' << (*it)->count << std::endl;
+    printTreeRecursive(*it);
+  }
+  std::cout << '<' << std::endl;
+}
+
+void CPPMLanguageModel::printTree(){
+  printTreeRecursive(m_pRoot);
+}
+
 bool CPPMLanguageModel::WriteToFile(std::string strFilename) {
 
   std::map<CPPMnode *, int> mapIdx;

Src/DasherCore/LanguageModelling/PPMLanguageModel.h

@@ -143,12 +143,16 @@ namespace Dasher {
   public:
     CPPMLanguageModel(CSettingsStore* pSettingsStore, int iNumSyms);
     virtual void GetProbs(Context context, std::vector < unsigned int >&Probs, int norm, int iUniform) const;
+
+    void printTree();
+    void printTreeRecursive(CPPMnode* node);
   protected:
     /// Makes a standard CPPMnode, but using a pooled allocator (m_NodeAlloc) - faster!
     virtual CPPMnode *makeNode(int sym);
 
     virtual bool WriteToFile(std::string strFilename);
     virtual bool ReadFromFile(std::string strFilename);
+
   private:
     int NodesAllocated;