NVBIO
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
suffix_trie.h
Go to the documentation of this file.
1 /*
2  * nvbio
3  * Copyright (c) 2011-2014, NVIDIA CORPORATION. All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are met:
7  * * Redistributions of source code must retain the above copyright
8  * notice, this list of conditions and the following disclaimer.
9  * * Redistributions in binary form must reproduce the above copyright
10  * notice, this list of conditions and the following disclaimer in the
11  * documentation and/or other materials provided with the distribution.
12  * * Neither the name of the NVIDIA CORPORATION nor the
13  * names of its contributors may be used to endorse or promote products
14  * derived from this software without specific prior written permission.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19  * DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE FOR ANY
20  * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23  * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26  */
27 
28 #pragma once
29 
30 #include <nvbio/basic/types.h>
31 #include <nvbio/basic/iterator.h>
32 
33 namespace nvbio {
34 
46 
49 
52 
63 
76 template <uint32 ALPHABET_SIZE_T, TrieType TYPE_T>
77 struct TrieNode
78 {
79  const static uint32 ALPHABET_SIZE = ALPHABET_SIZE_T;
80 
81  static const uint32 invalid_node = uint32(-1);
82  static const TrieType trie_type = TYPE_T;
83 
85  TrieNode();
86 
88  TrieNode(const uint32 _child, const uint32 _mask);
89 
91  bool is_leaf() const;
92 
94  uint32 child() const;
95 
97  uint32 child(const uint32 c) const;
99  uint32 nth_child(const uint32 c) const;
100 
102  uint32 first_child() const;
103 
105  uint32 mask() const;
106 
108  void set_child_bit(const uint32 c);
109 
111  uint32 child_bit(const uint32 c) const;
112 
114  void set_size(const uint32 size);
115 
117  uint32 size() const;
118 
122 };
123 
135 template <TrieType TYPE_T>
136 struct TrieNode5
137 {
138  const static uint32 ALPHABET_SIZE = 5;
139 
140  static const uint32 invalid_node = uint32(-1);
141  static const TrieType trie_type = TYPE_T;
142 
144  TrieNode();
145 
147  TrieNode(const uint32 _child, const uint32 _mask);
148 
150  bool is_leaf() const;
151 
153  uint32 child() const;
154 
156  uint32 child(const uint32 c) const;
158  uint32 nth_child(const uint32 c) const;
159 
161  uint32 first_child() const;
162 
164  uint32 mask() const;
165 
167  void set_child_bit(const uint32 c);
168 
170  uint32 child_bit(const uint32 c) const;
171 
173  void set_size(const uint32 size);
174 
176  uint32 size() const;
177 
180 };
181 
184 template <TrieType TYPE_T>
185 struct TrieNode<2,TYPE_T> : public TrieNode5
186 {
188  TrieNode(const uint32 _child, const uint32 _mask) : TrieNode5( _child, _mask ) {}
189 };
192 template <TrieType TYPE_T>
193 struct TrieNode<3,TYPE_T> : public TrieNode5
194 {
196  TrieNode(const uint32 _child, const uint32 _mask) : TrieNode5( _child, _mask ) {}
197 };
200 template <TrieType TYPE_T>
201 struct TrieNode<4,TYPE_T> : public TrieNode5
202 {
204  TrieNode(const uint32 _child, const uint32 _mask) : TrieNode5( _child, _mask ) {}
205 };
208 template <TrieType TYPE_T>
209 struct TrieNode<5,TYPE_T> : public TrieNode5
210 {
212  TrieNode(const uint32 _child, const uint32 _mask) : TrieNode5( _child, _mask ) {}
213 };
214 
215 
222 template <uint32 ALPHABET_SIZE_T, typename NodeIterator>
224 {
225  const static uint32 ALPHABET_SIZE = ALPHABET_SIZE_T;
226 
227  typedef typename std::iterator_traits<NodeIterator>::value_type node_type;
228 
233 
237  SuffixTrie(const NodeIterator seq);
238 
242  node_type root() const;
243 
255  template <typename Visitor>
257  void children(const node_type node, Visitor& visitor) const;
258 
261  const NodeIterator& nodes() const { return m_seq; }
262 
263 private:
264  NodeIterator m_seq;
265 };
266 
267 
304 template <typename TrieType, typename NodeVector>
305 void build_suffix_trie(
306  const TrieType& in_trie,
307  NodeVector& out_nodes);
308 
311 
312 } // namespace nvbio
313