Implement semantic graph traversal mechanism

1 files changed, 79 insertions, 0 deletions

diff --git a/odb/traversal/elements.cxx b/odb/traversal/elements.cxx
new file mode 100644
index 0000000..62f3eab
--- /dev/null
+++ b/odb/traversal/elements.cxx
@@ -0,0 +1,79 @@
+// file      : odb/traversal/elements.cxx
+// author    : Boris Kolpackov <boris@codesynthesis.com>
+// copyright : Copyright (c) 2009-2010 Code Synthesis Tools CC
+// license   : GNU GPL v2; see accompanying LICENSE file
+
+#include <traversal/elements.hxx>
+
+namespace traversal
+{
+  void names::
+  traverse (type& e)
+  {
+    dispatch (e.named ());
+  }
+
+  void declares::
+  traverse (type& e)
+  {
+    dispatch (e.named ());
+  }
+
+  void defines::
+  traverse (type& e)
+  {
+    dispatch (e.named ());
+  }
+
+  void typedefs::
+  traverse (type& e)
+  {
+    dispatch (e.named ());
+  }
+
+  void belongs::
+  traverse (type& e)
+  {
+    dispatch (e.type ());
+  }
+
+  // instance
+  //
+  void instance::
+  traverse (type& i)
+  {
+    belongs (i);
+  }
+
+  void instance::
+  belongs (type& i)
+  {
+    belongs (i, *this);
+  }
+
+  void instance::
+  belongs (type& i, edge_dispatcher& d)
+  {
+    d.dispatch (i.belongs ());
+  }
+
+  // data_member
+  //
+  void data_member::
+  traverse (type& m)
+  {
+    belongs (m);
+  }
+
+  void data_member::
+  belongs (type& m)
+  {
+    belongs (m, *this);
+  }
+
+  void data_member::
+  belongs (type& m, edge_dispatcher& d)
+  {
+    d.dispatch (m.belongs ());
+  }
+}