fc::raw::detail Namespace Reference

Classes
struct	if_class
struct	if_class< fc::false_type >
struct	if_enum
struct	if_enum< fc::true_type >
struct	if_reflected
struct	if_reflected< fc::true_type >
struct	pack_object_visitor
struct	unpack_object_visitor

Functions
template<template< typename... > class Set, typename Stream , typename T , typename... U>
void	pack_set (Stream &s, const Set< T, U... > &value)
template<template< typename... > class Set, typename Stream , typename T , typename... U>
void	unpack_set (Stream &s, Set< T, U... > &value)
template<template< typename... > class Set, typename Stream , typename T , typename... U>
void	unpack_flat_set (Stream &s, Set< T, U... > &value)
template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>
void	pack_map (Stream &s, const Map< K, V, U... > &value)
template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>
void	unpack_map (Stream &s, Map< K, V, U... > &value)
template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>
void	unpack_flat_map (Stream &s, Map< K, V, U... > &value)

Function Documentation

pack_map()

template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>

void fc::raw::detail::pack_map ( Stream & s, const Map< K, V, U... > & value )

inline

Definition at line 47 of file container_detail.hpp.

                                                                         {
            FC_ASSERT( value.size() <= MAX_NUM_ARRAY_ELEMENTS );
            pack( s, unsigned_int((uint32_t)value.size()) );
            for( const auto& item : value ) {
               pack( s, item );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function:

pack_set()

template<template< typename... > class Set, typename Stream , typename T , typename... U>

void fc::raw::detail::pack_set ( Stream & s, const Set< T, U... > & value )

inline

Definition at line 13 of file container_detail.hpp.

                                                                      {
            FC_ASSERT( value.size() <= MAX_NUM_ARRAY_ELEMENTS );
            pack( s, unsigned_int((uint32_t)value.size()) );
            for( const auto& item : value ) {
               pack( s, item );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function:

unpack_flat_map()

template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>

void fc::raw::detail::unpack_flat_map ( Stream & s, Map< K, V, U... > & value )

inline

Definition at line 68 of file container_detail.hpp.

                                                                          {
            unsigned_int size; unpack( s, size );
            FC_ASSERT( size.value <= MAX_NUM_ARRAY_ELEMENTS );
            value.clear();
            value.reserve( size.value );
            for( uint32_t i = 0; i < size.value; ++i ) {
               auto tmp = ::fc::detail::default_construct_pair_maybe_with_allocator<K, V>( value.get_allocator() );
               unpack( s, tmp );
               value.insert( value.end(), std::move(tmp) );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function:

unpack_flat_set()

template<template< typename... > class Set, typename Stream , typename T , typename... U>

void fc::raw::detail::unpack_flat_set ( Stream & s, Set< T, U... > & value )

inline

Definition at line 34 of file container_detail.hpp.

                                                                       {
            unsigned_int size; unpack( s, size );
            FC_ASSERT( size.value <= MAX_NUM_ARRAY_ELEMENTS );
            value.clear();
            value.reserve( size.value );
            for( uint32_t i = 0; i < size.value; ++i ) {
               auto tmp = ::fc::detail::construct_maybe_with_allocator<T>( value.get_allocator() );
               unpack( s, tmp );
               value.insert( value.end(), std::move(tmp) );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function:

unpack_map()

template<template< typename... > class Map, typename Stream , typename K , typename V , typename... U>

void fc::raw::detail::unpack_map ( Stream & s, Map< K, V, U... > & value )

inline

Definition at line 56 of file container_detail.hpp.

                                                                     {
            unsigned_int size; unpack( s, size );
            FC_ASSERT( size.value <= MAX_NUM_ARRAY_ELEMENTS );
            value.clear();
            for( uint32_t i = 0; i < size.value; ++i ) {
               auto tmp = ::fc::detail::default_construct_pair_maybe_with_allocator<K, V>( value.get_allocator() );
               unpack( s, tmp );
               value.insert( value.end(), std::move(tmp) );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function:

unpack_set()

template<template< typename... > class Set, typename Stream , typename T , typename... U>

void fc::raw::detail::unpack_set ( Stream & s, Set< T, U... > & value )

inline

Definition at line 22 of file container_detail.hpp.

                                                                  {
            unsigned_int size; unpack( s, size );
            FC_ASSERT( size.value <= MAX_NUM_ARRAY_ELEMENTS );
            value.clear();
            for( uint32_t i = 0; i < size.value; ++i ) {
               auto tmp = ::fc::detail::construct_maybe_with_allocator<T>( value.get_allocator() );
               unpack( s, tmp );
               value.insert( value.end(), std::move(tmp) );
            }
         }

Here is the call graph for this function:

Here is the caller graph for this function: