File: ps_my2asciipaths.cxx

package info (click to toggle)
arb 6.0.6-8
  • links: PTS, VCS
  • area: non-free
  • in suites: forky, sid, trixie
  • size: 66,204 kB
  • sloc: ansic: 394,911; cpp: 250,290; makefile: 19,644; sh: 15,879; perl: 10,473; fortran: 6,019; ruby: 683; xml: 503; python: 53; awk: 32
file content (77 lines) | stat: -rw-r--r-- 2,532 bytes parent folder | download | duplicates (6)
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
// =============================================================== //
//                                                                 //
//   File      : ps_my2asciipaths.cxx                              //
//   Purpose   :                                                   //
//                                                                 //
//   Coded by Wolfram Foerster in October 2002                     //
//   Institute of Microbiology (Technical University Munich)       //
//   http://www.arb-home.de/                                       //
//                                                                 //
// =============================================================== //

#include "ps_node.hxx"

//  GLOBALS

typedef pair<bool, SpeciesID> Step;
static vector<Step> *__PATH = new vector<Step>;

static void PS_print_paths(const PS_NodePtr& _ps_node) {
    //  recursively print the paths to the leafs

    // path
    __PATH->push_back(Step(_ps_node->hasInverseProbes(), _ps_node->hasProbes() ? _ps_node->getNum() : -(_ps_node->getNum())));

    // children
    if (_ps_node->hasChildren()) {
        for (PS_NodeMapConstIterator i = _ps_node->getChildrenBegin(); i != _ps_node->getChildrenEnd(); ++i) {
            PS_print_paths(i->second);
        }
    }
    else {
        // print path in leaf nodes
        printf("[%4zu] ", __PATH->size());
        for (vector<Step>::const_iterator i=__PATH->begin(); i != __PATH->end(); ++i) {
            printf("%4i%c ", i->second, i->first ? '+' : ' ');
        }
        printf("\n");
    }

    // path
    __PATH->pop_back();
}


//  ====================================================
//  ====================================================

int main(int argc,   char *argv[]) {

    // open probe-set-database
    if (argc < 2) {
        printf("Missing arguments\n Usage %s <database name>\n", argv[0]);
        exit(1);
    }

    const char *input_DB_name = argv[1];

    printf("Opening probe-set-database '%s'..\n", input_DB_name);
    PS_FileBuffer *fb = new PS_FileBuffer(input_DB_name, PS_FileBuffer::READONLY);
    PS_NodePtr     root(new PS_Node(-1));
    root->load(fb);
    printf("loaded database (enter to continue)\n");


    for (PS_NodeMapConstIterator i = root->getChildrenBegin(); i != root->getChildrenEnd(); ++i) {
        PS_print_paths(i->second);
    }

    printf("(enter to continue)\n");

    delete fb;
    root.SetNull();
    printf("root should be destroyed now\n");
    printf("(enter to continue)\n");

    return 0;
}