indexer/tree_structure.hpp


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

#pragma once

#include "base/assert.hpp"

#include "std/iostream.hpp"


namespace tree
{
  template <class ToDo>
  bool LoadTreeAsText(istream & s, ToDo & toDo)
  {
    string name;
    s >> name;
    ASSERT ( !name.empty(), ("Error in classificator file") );
    if (name == "{}") return false;

    // set key name
    toDo.Name(name);

    // load object itself
    string strkey;
    s >> strkey;
    while (strkey != "+" && strkey != "-")
    {
      s >> strkey;
    }

    // load children
    if (strkey == "+")
    {
      size_t i = 0;
      while (true)
      {
        toDo.Start(i++);
        bool const isContinue = LoadTreeAsText(s, toDo);
        toDo.End();

        if (!isContinue)
        {
          toDo.EndChilds();
          break;
        }
      }

      ASSERT ( i <= 128, ("too many features at level = ", name) );
    }

    return true;
  }
}