vg
tools for working with variation graphs
Loading...
Searching...
No Matches
zip_code_tree.hpp File Reference
#include "zip_code.hpp"
#include "snarl_seed_clusterer.hpp"
#include <stack>
#include <forward_list>

Classes

class  vg::ZipCodeTree
struct  vg::ZipCodeTree::tree_item_t
 One item in the zip code tree, representing a node or edge of the tree. More...
struct  vg::ZipCodeTree::oriented_seed_t
struct  vg::ZipCodeTree::seed_result_t
class  vg::ZipCodeTree::seed_iterator
class  vg::ZipCodeTree::distance_iterator
struct  vg::ZipCodeTree::distance_iterator::iteration_position
class  vg::ZipCodeForest
struct  vg::ZipCodeForest::forest_growing_state_t
 This stores information about the state of the forest as we fill it in. More...
struct  vg::ZipCodeForest::seed_info_t
struct  vg::ZipCodeForest::child_info_t
struct  vg::ZipCodeForest::interval_state_t
struct  vg::ZipCodeForest::sort_value_t
struct  std::hash< vg::ZipCodeTree::oriented_seed_t >
 Hash functor to hash oriented_seed_t with std::hash. More...
struct  std::hash< vg::ZipCodeTree::seed_result_t >
 Hash functor to hash seed_result_t with std::hash. More...
struct  std::iterator_traits< vg::ZipCodeTree::seed_iterator >
struct  std::iterator_traits< vg::ZipCodeTree::distance_iterator >

Namespaces

namespace  vg
namespace  std
 Hash functor to hash NodeSides using std::hash.

Functions

std::ostream & vg::operator<< (std::ostream &out, const ZipCodeTree::tree_item_type_t &type)
 Print an item type to a stream.
std::ostream & vg::operator<< (std::ostream &out, const ZipCodeTree::distance_iterator::State &state)
 Print an iterator state to a stream.
std::string std::to_string (const vg::ZipCodeTree::tree_item_type_t &type)
 Make an item type into a string.
std::string std::to_string (const vg::ZipCodeTree::distance_iterator::State &state)
 Make an iterator state into a string.