1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
#ifndef TAXONOMYNODE
#define TAXONOMYNODE
/*
* taxonomynode.h
*
*
* Created by Pat Schloss on 7/8/11.
* Copyright 2011 Patrick D. Schloss. All rights reserved.
*
*/
/**************************************************************************************************/
#include "mothurout.h"
/**************************************************************************************************/
class TaxonomyNode {
public:
TaxonomyNode();
TaxonomyNode(string, int);
void setName(string n) { name = n; }
string getName() { return name; }
void setParent(int p) { parent = p; }
int getParent() { return parent; }
void makeChild(string c, int i) { children[c] = i; }
map<string, int> getChildren() { return children; }
int getNumKids() { return (int)children.size(); }
int getNumSeqs() { return numSeqs; }
void setTotalSeqs(int n) { totalSeqs = n; }
int getLevel() { return level; }
int getChildIndex(string);
private:
int parent;
map<string, int> children;
int numChildren;
int level;
protected:
MothurOut* m;
int numSeqs;
int totalSeqs;
string name;
};
/**************************************************************************************************/
#endif
|
