1169691Skan// -*- C++ -*-
2169691Skan
3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
4169691Skan//
5169691Skan// This file is part of the GNU ISO C++ Library.  This library is free
6169691Skan// software; you can redistribute it and/or modify it under the terms
7169691Skan// of the GNU General Public License as published by the Free Software
8169691Skan// Foundation; either version 2, or (at your option) any later
9169691Skan// version.
10169691Skan
11169691Skan// This library is distributed in the hope that it will be useful, but
12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of
13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14169691Skan// General Public License for more details.
15169691Skan
16169691Skan// You should have received a copy of the GNU General Public License
17169691Skan// along with this library; see the file COPYING.  If not, write to
18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19169691Skan// MA 02111-1307, USA.
20169691Skan
21169691Skan// As a special exception, you may use this file as part of a free
22169691Skan// software library without restriction.  Specifically, if other files
23169691Skan// instantiate templates or use macros or inline functions from this
24169691Skan// file, or you compile this file and link it with other files to
25169691Skan// produce an executable, this file does not by itself cause the
26169691Skan// resulting executable to be covered by the GNU General Public
27169691Skan// License.  This exception does not however invalidate any other
28169691Skan// reasons why the executable file might be covered by the GNU General
29169691Skan// Public License.
30169691Skan
31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32169691Skan
33169691Skan// Permission to use, copy, modify, sell, and distribute this software
34169691Skan// is hereby granted without fee, provided that the above copyright
35169691Skan// notice appears in all copies, and that both that copyright notice
36169691Skan// and this permission notice appear in supporting documentation. None
37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any
38169691Skan// representation about the suitability of this software for any
39169691Skan// purpose. It is provided "as is" without express or implied
40169691Skan// warranty.
41169691Skan
42169691Skan/**
43169691Skan * @file trace_fn_imps.hpp
44169691Skan * Contains an implementation class for pat_trie_.
45169691Skan */
46169691Skan
47169691Skan#ifdef PB_DS_PAT_TRIE_TRACE_
48169691Skan
49169691SkanPB_DS_CLASS_T_DEC
50169691Skanvoid
51169691SkanPB_DS_CLASS_C_DEC::
52169691Skantrace() const
53169691Skan{
54169691Skan  std::cerr << std::endl;
55169691Skan  if (m_p_head->m_p_parent == NULL)
56169691Skan    return;
57169691Skan  trace_node(m_p_head->m_p_parent, 0);
58169691Skan  std::cerr << std::endl;
59169691Skan}
60169691Skan
61169691SkanPB_DS_CLASS_T_DEC
62169691Skanvoid
63169691SkanPB_DS_CLASS_C_DEC::
64169691Skantrace_node(const_node_pointer p_nd, size_type level)
65169691Skan{
66169691Skan  for (size_type i = 0; i < level; ++i)
67169691Skan    std::cerr << ' ';
68169691Skan  std::cerr << p_nd << " ";
69169691Skan  std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type) ? "l " : "i ");
70169691Skan
71169691Skan  trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>());
72169691Skan  typename e_access_traits::const_iterator el_it = pref_begin(p_nd);
73169691Skan  while (el_it != pref_end(p_nd))
74169691Skan    {
75169691Skan      std::cerr <<* el_it;
76169691Skan      ++el_it;
77169691Skan    }
78169691Skan
79169691Skan  if (p_nd->m_type == pat_trie_leaf_node_type)
80169691Skan    {
81169691Skan      std::cerr << std::endl;
82169691Skan      return;
83169691Skan    }
84169691Skan
85169691Skan  const_internal_node_pointer p_internal =
86169691Skan    static_cast<const_internal_node_pointer>(p_nd);
87169691Skan
88169691Skan  std::cerr << " " <<
89169691Skan    static_cast<unsigned long>(p_internal->get_e_ind()) << std::endl;
90169691Skan
91169691Skan  const size_type num_children = std::distance(p_internal->begin(),
92169691Skan					       p_internal->end());
93169691Skan
94169691Skan  for (size_type child_i = 0; child_i < num_children; ++child_i)
95169691Skan    {
96169691Skan      typename internal_node::const_iterator child_it =
97169691Skan	p_internal->begin();
98169691Skan      std::advance(child_it, num_children - child_i - 1);
99169691Skan      trace_node(*child_it, level + 1);
100169691Skan    }
101169691Skan}
102169691Skan
103169691SkanPB_DS_CLASS_T_DEC
104169691Skantemplate<typename Metadata_>
105169691Skanvoid
106169691SkanPB_DS_CLASS_C_DEC::
107169691Skantrace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>)
108169691Skan{
109169691Skan  std::cerr << "(" << static_cast<unsigned long>(p_nd->get_metadata()) << ") ";
110169691Skan}
111169691Skan
112169691SkanPB_DS_CLASS_T_DEC
113169691Skanvoid
114169691SkanPB_DS_CLASS_C_DEC::
115169691Skantrace_node_metadata(const_node_pointer, type_to_type<null_node_metadata>)
116169691Skan{ }
117169691Skan
118169691Skan#endif
119169691Skan
120