summaryrefslogtreecommitdiff
path: root/libxsd-frontend/xsd-frontend/semantic-graph/schema.cxx
blob: f8127971663d447e778942bbbc5b3650ee846c31 (plain)
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
// file      : xsd-frontend/semantic-graph/schema.cxx
// author    : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2010 Code Synthesis Tools CC
// license   : GNU GPL v2 + exceptions; see accompanying LICENSE file

#include <xsd-frontend/semantic-graph/schema.hxx>

namespace XSDFrontend
{
  namespace SemanticGraph
  {
    namespace RTTI = Cult::RTTI;

    using RTTI::Access;
    using RTTI::TypeInfo;

    namespace
    {
      // Uses
      //
      struct UsesInit
      {
        UsesInit ()
        {
          TypeInfo ti (typeid (Uses));
          ti.add_base (Access::public_, true, typeid (Edge));
          RTTI::insert (ti);
        }

      } uses_init_;


      // Implies
      //
      struct ImpliesInit
      {
        ImpliesInit ()
        {
          TypeInfo ti (typeid (Implies));
          ti.add_base (Access::public_, true, typeid (Uses));
          RTTI::insert (ti);
        }

      } implies_init_;


      // Sources
      //
      struct SourcesInit
      {
        SourcesInit ()
        {
          TypeInfo ti (typeid (Sources));
          ti.add_base (Access::public_, true, typeid (Uses));
          RTTI::insert (ti);
        }

      } sources_init_;


      // Includes
      //
      struct IncludesInit
      {
        IncludesInit ()
        {
          TypeInfo ti (typeid (Includes));
          ti.add_base (Access::public_, true, typeid (Uses));
          RTTI::insert (ti);
        }

      } includes_init_;


      // Imports
      //
      struct ImportsInit
      {
        ImportsInit ()
        {
          TypeInfo ti (typeid (Imports));
          ti.add_base (Access::public_, true, typeid (Uses));
          RTTI::insert (ti);
        }

      } imports_init_;


      // Schema
      //
      struct SchemaInit
      {
        SchemaInit ()
        {
          TypeInfo ti (typeid (Schema));
          ti.add_base (Access::public_, true, typeid (Scope));
          RTTI::insert (ti);
        }

      } schema_init_;
    }


    // Schema
    //
    Schema::NamesIteratorPair Schema::
    find (Name const& name) const
    {
      // Here we are going to create an illusion that the namespace
      // hierarchy is flat.
      names_.clear ();
      schemas_.clear ();

      find_ (name, names_, schemas_);

      return NamesIteratorPair (NamesConstIterator (names_.begin ()),
                                NamesConstIterator (names_.end ()));
    }

    Void Schema::
    find_ (Name const& name, NamesList& names, SchemaSet& set) const
    {
      set.insert (this);

      // Check our own namespace first so it will end up first in the list.
      //
      NamesIteratorPair pair (Scope::find (name));
      names.insert (names.end (), pair.first.base (), pair.second.base ());

      for (UsesIterator i (uses_begin ()), end (uses_end ()); i != end; ++i)
      {
        Schema& s (i->schema ());

        if (set.find (&s) == set.end ())
          s.find_ (name, names, set);
      }
    }
  }
}