// -*- C++ -*-
|
// -*- C++ -*-
|
|
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
|
//
|
//
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// software; you can redistribute it and/or modify it under the terms
|
// software; you can redistribute it and/or modify it under the terms
|
// of the GNU General Public License as published by the Free Software
|
// of the GNU General Public License as published by the Free Software
|
// Foundation; either version 3, or (at your option) any later
|
// Foundation; either version 3, or (at your option) any later
|
// version.
|
// version.
|
|
|
// This library is distributed in the hope that it will be useful, but
|
// This library is distributed in the hope that it will be useful, but
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
// General Public License for more details.
|
// General Public License for more details.
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
// Under Section 7 of GPL version 3, you are granted additional
|
// permissions described in the GCC Runtime Library Exception, version
|
// permissions described in the GCC Runtime Library Exception, version
|
// 3.1, as published by the Free Software Foundation.
|
// 3.1, as published by the Free Software Foundation.
|
|
|
// You should have received a copy of the GNU General Public License and
|
// You should have received a copy of the GNU General Public License and
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// <http://www.gnu.org/licenses/>.
|
// <http://www.gnu.org/licenses/>.
|
|
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
|
|
// Permission to use, copy, modify, sell, and distribute this software
|
// Permission to use, copy, modify, sell, and distribute this software
|
// is hereby granted without fee, provided that the above copyright
|
// is hereby granted without fee, provided that the above copyright
|
// notice appears in all copies, and that both that copyright notice
|
// notice appears in all copies, and that both that copyright notice
|
// and this permission notice appear in supporting documentation. None
|
// and this permission notice appear in supporting documentation. None
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// of the above authors, nor IBM Haifa Research Laboratories, make any
|
// representation about the suitability of this software for any
|
// representation about the suitability of this software for any
|
// purpose. It is provided "as is" without express or implied
|
// purpose. It is provided "as is" without express or implied
|
// warranty.
|
// warranty.
|
|
|
/**
|
/**
|
* @file node_iterators.hpp
|
* @file node_iterators.hpp
|
* Contains an implementation class for pat_trie_.
|
* Contains an implementation class for pat_trie_.
|
*/
|
*/
|
|
|
#ifndef PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
|
#ifndef PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
|
#define PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
|
#define PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
|
|
|
#include <debug/debug.h>
|
#include <debug/debug.h>
|
|
|
namespace __gnu_pbds
|
namespace __gnu_pbds
|
{
|
{
|
namespace detail
|
namespace detail
|
{
|
{
|
|
|
#define PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC \
|
#define PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC \
|
pat_trie_const_node_it_< \
|
pat_trie_const_node_it_< \
|
Node, \
|
Node, \
|
Leaf, \
|
Leaf, \
|
Head, \
|
Head, \
|
Internal_Node, \
|
Internal_Node, \
|
Const_Iterator, \
|
Const_Iterator, \
|
Iterator, \
|
Iterator, \
|
E_Access_Traits, \
|
E_Access_Traits, \
|
Allocator>
|
Allocator>
|
|
|
#define PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC \
|
#define PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC \
|
pat_trie_node_it_< \
|
pat_trie_node_it_< \
|
Node, \
|
Node, \
|
Leaf, \
|
Leaf, \
|
Head, \
|
Head, \
|
Internal_Node, \
|
Internal_Node, \
|
Const_Iterator, \
|
Const_Iterator, \
|
Iterator, \
|
Iterator, \
|
E_Access_Traits, \
|
E_Access_Traits, \
|
Allocator>
|
Allocator>
|
|
|
// Const node iterator.
|
// Const node iterator.
|
template<typename Node,
|
template<typename Node,
|
class Leaf,
|
class Leaf,
|
class Head,
|
class Head,
|
class Internal_Node,
|
class Internal_Node,
|
class Const_Iterator,
|
class Const_Iterator,
|
class Iterator,
|
class Iterator,
|
class E_Access_Traits,
|
class E_Access_Traits,
|
class Allocator>
|
class Allocator>
|
class pat_trie_const_node_it_
|
class pat_trie_const_node_it_
|
{
|
{
|
protected:
|
protected:
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Node>::other::pointer
|
Node>::other::pointer
|
node_pointer;
|
node_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Leaf>::other::const_pointer
|
Leaf>::other::const_pointer
|
const_leaf_pointer;
|
const_leaf_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Leaf>::other::pointer
|
Leaf>::other::pointer
|
leaf_pointer;
|
leaf_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Internal_Node>::other::pointer
|
Internal_Node>::other::pointer
|
internal_node_pointer;
|
internal_node_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Internal_Node>::other::const_pointer
|
Internal_Node>::other::const_pointer
|
const_internal_node_pointer;
|
const_internal_node_pointer;
|
|
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
E_Access_Traits>::other::const_pointer
|
E_Access_Traits>::other::const_pointer
|
const_e_access_traits_pointer;
|
const_e_access_traits_pointer;
|
|
|
private:
|
private:
|
inline typename E_Access_Traits::const_iterator
|
inline typename E_Access_Traits::const_iterator
|
pref_begin() const
|
pref_begin() const
|
{
|
{
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
return (m_p_traits->begin(
|
return (m_p_traits->begin(
|
m_p_traits->extract_key(
|
m_p_traits->extract_key(
|
static_cast<const_leaf_pointer>(m_p_nd)->value())));
|
static_cast<const_leaf_pointer>(m_p_nd)->value())));
|
|
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
|
|
return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_b_it());
|
return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_b_it());
|
}
|
}
|
|
|
inline typename E_Access_Traits::const_iterator
|
inline typename E_Access_Traits::const_iterator
|
pref_end() const
|
pref_end() const
|
{
|
{
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
return (m_p_traits->end(
|
return (m_p_traits->end(
|
m_p_traits->extract_key(
|
m_p_traits->extract_key(
|
static_cast<const_leaf_pointer>(m_p_nd)->value())));
|
static_cast<const_leaf_pointer>(m_p_nd)->value())));
|
|
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
|
|
return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_e_it());
|
return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_e_it());
|
}
|
}
|
|
|
public:
|
public:
|
|
|
// Size type.
|
// Size type.
|
typedef typename Allocator::size_type size_type;
|
typedef typename Allocator::size_type size_type;
|
|
|
// Category.
|
// Category.
|
typedef trivial_iterator_tag iterator_category;
|
typedef trivial_iterator_tag iterator_category;
|
|
|
// Difference type.
|
// Difference type.
|
typedef trivial_iterator_difference_type difference_type;
|
typedef trivial_iterator_difference_type difference_type;
|
|
|
// __Iterator's value type.
|
// __Iterator's value type.
|
typedef Const_Iterator value_type;
|
typedef Const_Iterator value_type;
|
|
|
// __Iterator's reference type.
|
// __Iterator's reference type.
|
typedef value_type reference;
|
typedef value_type reference;
|
|
|
// __Iterator's __const reference type.
|
// __Iterator's __const reference type.
|
typedef value_type const_reference;
|
typedef value_type const_reference;
|
|
|
// Element access traits.
|
// Element access traits.
|
typedef E_Access_Traits e_access_traits;
|
typedef E_Access_Traits e_access_traits;
|
|
|
// A key's element __const iterator.
|
// A key's element __const iterator.
|
typedef typename e_access_traits::const_iterator const_e_iterator;
|
typedef typename e_access_traits::const_iterator const_e_iterator;
|
|
|
// Metadata type.
|
// Metadata type.
|
typedef typename Node::metadata_type metadata_type;
|
typedef typename Node::metadata_type metadata_type;
|
|
|
// Const metadata reference type.
|
// Const metadata reference type.
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
metadata_type>::other::const_reference
|
metadata_type>::other::const_reference
|
const_metadata_reference;
|
const_metadata_reference;
|
|
|
// Default constructor.
|
// Default constructor.
|
/*
|
/*
|
inline
|
inline
|
pat_trie_const_node_it_()
|
pat_trie_const_node_it_()
|
*/
|
*/
|
inline
|
inline
|
pat_trie_const_node_it_(node_pointer p_nd = NULL,
|
pat_trie_const_node_it_(node_pointer p_nd = NULL,
|
const_e_access_traits_pointer p_traits = NULL)
|
const_e_access_traits_pointer p_traits = NULL)
|
: m_p_nd(const_cast<node_pointer>(p_nd)), m_p_traits(p_traits)
|
: m_p_nd(const_cast<node_pointer>(p_nd)), m_p_traits(p_traits)
|
{ }
|
{ }
|
|
|
// Subtree valid prefix.
|
// Subtree valid prefix.
|
inline std::pair<const_e_iterator, const_e_iterator>
|
inline std::pair<const_e_iterator, const_e_iterator>
|
valid_prefix() const
|
valid_prefix() const
|
{ return std::make_pair(pref_begin(), pref_end()); }
|
{ return std::make_pair(pref_begin(), pref_end()); }
|
|
|
// Const access; returns the __const iterator* associated with
|
// Const access; returns the __const iterator* associated with
|
// the current leaf.
|
// the current leaf.
|
inline const_reference
|
inline const_reference
|
operator*() const
|
operator*() const
|
{
|
{
|
_GLIBCXX_DEBUG_ASSERT(num_children() == 0);
|
_GLIBCXX_DEBUG_ASSERT(num_children() == 0);
|
return Const_Iterator(m_p_nd);
|
return Const_Iterator(m_p_nd);
|
}
|
}
|
|
|
// Metadata access.
|
// Metadata access.
|
inline const_metadata_reference
|
inline const_metadata_reference
|
get_metadata() const
|
get_metadata() const
|
{ return m_p_nd->get_metadata(); }
|
{ return m_p_nd->get_metadata(); }
|
|
|
// Returns the number of children in the corresponding node.
|
// Returns the number of children in the corresponding node.
|
inline size_type
|
inline size_type
|
num_children() const
|
num_children() const
|
{
|
{
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
if (m_p_nd->m_type == pat_trie_leaf_node_type)
|
return 0;
|
return 0;
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
return std::distance(static_cast<internal_node_pointer>(m_p_nd)->begin(), static_cast<internal_node_pointer>(m_p_nd)->end());
|
return std::distance(static_cast<internal_node_pointer>(m_p_nd)->begin(), static_cast<internal_node_pointer>(m_p_nd)->end());
|
}
|
}
|
|
|
// Returns a __const node __iterator to the corresponding node's
|
// Returns a __const node __iterator to the corresponding node's
|
// i-th child.
|
// i-th child.
|
PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
get_child(size_type i) const
|
get_child(size_type i) const
|
{
|
{
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
_GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
|
typename Internal_Node::iterator it =
|
typename Internal_Node::iterator it =
|
static_cast<internal_node_pointer>(m_p_nd)->begin();
|
static_cast<internal_node_pointer>(m_p_nd)->begin();
|
|
|
std::advance(it, i);
|
std::advance(it, i);
|
return PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC(*it, m_p_traits);
|
return PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC(*it, m_p_traits);
|
}
|
}
|
|
|
// Compares content to a different iterator object.
|
// Compares content to a different iterator object.
|
inline bool
|
inline bool
|
operator==(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
|
operator==(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
|
{ return (m_p_nd == other.m_p_nd); }
|
{ return (m_p_nd == other.m_p_nd); }
|
|
|
// Compares content (negatively) to a different iterator object.
|
// Compares content (negatively) to a different iterator object.
|
inline bool
|
inline bool
|
operator!=(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
|
operator!=(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
|
{ return m_p_nd != other.m_p_nd; }
|
{ return m_p_nd != other.m_p_nd; }
|
|
|
private:
|
private:
|
|
|
friend class PB_DS_CLASS_C_DEC;
|
friend class PB_DS_CLASS_C_DEC;
|
|
|
public:
|
public:
|
node_pointer m_p_nd;
|
node_pointer m_p_nd;
|
|
|
const_e_access_traits_pointer m_p_traits;
|
const_e_access_traits_pointer m_p_traits;
|
};
|
};
|
|
|
// Node iterator.
|
// Node iterator.
|
template<typename Node,
|
template<typename Node,
|
class Leaf,
|
class Leaf,
|
class Head,
|
class Head,
|
class Internal_Node,
|
class Internal_Node,
|
class Const_Iterator,
|
class Const_Iterator,
|
class Iterator,
|
class Iterator,
|
class E_Access_Traits,
|
class E_Access_Traits,
|
class Allocator>
|
class Allocator>
|
class pat_trie_node_it_ :
|
class pat_trie_node_it_ :
|
public PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
public PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
|
|
{
|
{
|
private:
|
private:
|
typedef
|
typedef
|
typename Allocator::template rebind<
|
typename Allocator::template rebind<
|
Node>::other::pointer
|
Node>::other::pointer
|
node_pointer;
|
node_pointer;
|
|
|
typedef Iterator iterator;
|
typedef Iterator iterator;
|
|
|
typedef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC base_type;
|
typedef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC base_type;
|
|
|
typedef
|
typedef
|
typename base_type::const_e_access_traits_pointer
|
typename base_type::const_e_access_traits_pointer
|
const_e_access_traits_pointer;
|
const_e_access_traits_pointer;
|
|
|
typedef typename base_type::internal_node_pointer internal_node_pointer;
|
typedef typename base_type::internal_node_pointer internal_node_pointer;
|
|
|
public:
|
public:
|
|
|
// Size type.
|
// Size type.
|
typedef
|
typedef
|
typename PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC::size_type
|
typename PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC::size_type
|
size_type;
|
size_type;
|
|
|
// __Iterator's value type.
|
// __Iterator's value type.
|
typedef Iterator value_type;
|
typedef Iterator value_type;
|
|
|
// __Iterator's reference type.
|
// __Iterator's reference type.
|
typedef value_type reference;
|
typedef value_type reference;
|
|
|
// __Iterator's __const reference type.
|
// __Iterator's __const reference type.
|
typedef value_type const_reference;
|
typedef value_type const_reference;
|
|
|
// Default constructor.
|
// Default constructor.
|
/*
|
/*
|
inline
|
inline
|
pat_trie_node_it_() ;
|
pat_trie_node_it_() ;
|
*/
|
*/
|
|
|
inline
|
inline
|
pat_trie_node_it_(node_pointer p_nd = NULL, const_e_access_traits_pointer p_traits = NULL) : base_type(p_nd, p_traits)
|
pat_trie_node_it_(node_pointer p_nd = NULL, const_e_access_traits_pointer p_traits = NULL) : base_type(p_nd, p_traits)
|
{ }
|
{ }
|
|
|
// Access; returns the iterator* associated with the current leaf.
|
// Access; returns the iterator* associated with the current leaf.
|
inline reference
|
inline reference
|
operator*() const
|
operator*() const
|
{
|
{
|
_GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0);
|
_GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0);
|
return Iterator(base_type::m_p_nd);
|
return Iterator(base_type::m_p_nd);
|
|
|
}
|
}
|
|
|
// Returns a node __iterator to the corresponding node's i-th child.
|
// Returns a node __iterator to the corresponding node's i-th child.
|
PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
|
PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
|
get_child(size_type i) const
|
get_child(size_type i) const
|
{
|
{
|
_GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == pat_trie_internal_node_type);
|
_GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == pat_trie_internal_node_type);
|
|
|
typename Internal_Node::iterator it =
|
typename Internal_Node::iterator it =
|
static_cast<internal_node_pointer>(base_type::m_p_nd)->begin();
|
static_cast<internal_node_pointer>(base_type::m_p_nd)->begin();
|
|
|
std::advance(it, i);
|
std::advance(it, i);
|
return PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC(*it, base_type::m_p_traits);
|
return PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC(*it, base_type::m_p_traits);
|
}
|
}
|
|
|
private:
|
private:
|
friend class PB_DS_CLASS_C_DEC;
|
friend class PB_DS_CLASS_C_DEC;
|
};
|
};
|
|
|
#undef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
#undef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
|
#undef PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
|
#undef PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
|
|
|
} // namespace detail
|
} // namespace detail
|
} // namespace __gnu_pbds
|
} // namespace __gnu_pbds
|
|
|
#endif
|
#endif
|
|
|
|
|
