linktrie.h

Go to the documentation of this file.

#ifndef LINKTRIE_H
#define LINKTRIE_H

#include "bioseq.h"
#include "matrix.h"
#include <string>
#include <iostream>
#include <vector>

using namespace std;

struct intnode {
   intnode() : value(-1), next(0) { }
   intnode(int v) : value(v), next(0) { }
   int value;
   intnode* next;
};

struct lnode {
   lnode() : data('0'), sibling(0), child(0), key(0), pos(0) { }
   lnode(char c) : data(c), sibling(0), child(0), key(0), pos(0) { }

   void addChild(char c) { child=new lnode(c); }
   void addSibling(char c) { sibling= new lnode(c); }
   lnode* findSibling(char c);
   //lnode* findChild(char c) const;
   void deleteSelf();
   friend void deleteNode(lnode* n);
   friend ostream& operator<<(ostream &ous, const lnode& n);

   char data; // current node char
   lnode* sibling;
   lnode* child;
   char *key;  // final key, path from root to here
   intnode *pos; // as linked list, location in sequence
   //vector<int> position; // a list of positions
};

class ltrie {
   public:
      ltrie() : root(new lnode), leafnodes(), ws(4) { }
      ltrie(int depth) : root(new lnode), leafnodes(), ws(depth) { }
      ltrie(const string &seq);

      void build(const string &seq, const Matrix &mat, float T, float F);
      void insert(const char word[], int index);
      const lnode* find(const char word[]) const;
      //bool find(const string &word);
      void showLeafs(ostream &ous) const;
      ~ltrie();

   protected:
      lnode* root;
      int ws; // word size
      vector<lnode*> leafnodes; // alias to all leaf nodes
};

#endif