| Home | Libraries | People | FAQ | More

## Struct template unordered_node_traits

boost::intrusive::unordered_node_traits

## Synopsis

    // In header: <boost/intrusive/unordered_set_hook.hpp>

    template<typename VoidPointer, bool StoreHash, bool OptimizeMultiKey>
    struct unordered_node_traits {
      // types
      typedef slist_node_traits< VoidPointer >                           reduced_slist_node_traits;
      typedef unordered_node< VoidPointer, StoreHash, OptimizeMultiKey > node;
      typedef boost::pointer_to_other< VoidPointer, node >::type         node_ptr;
      typedef boost::pointer_to_other< VoidPointer, const node >::type   const_node_ptr;

      // public static functions
      static node_ptr get_next(const_node_ptr);
      static void set_next(node_ptr, node_ptr);
      static node_ptr get_prev_in_group(const_node_ptr);
      static void set_prev_in_group(node_ptr, node_ptr);
      static std::size_t get_hash(const_node_ptr);
      static void set_hash(node_ptr, std::size_t);
      static const bool store_hash;
      static const bool optimize_multikey;
    };

## Description

### `unordered_node_traits` public static functions

1.     static node_ptr get_next(const_node_ptr n);

2.     static void set_next(node_ptr n, node_ptr next);

3.     static node_ptr get_prev_in_group(const_node_ptr n);

4.     static void set_prev_in_group(node_ptr n, node_ptr prev);

5.     static std::size_t get_hash(const_node_ptr n);

6.     static void set_hash(node_ptr n, std::size_t h);