tables::table::addu

1)

template <typename... Ts,is_primitive_type... Ps>
template<typename... TAs,is_primitive_type... PAs>
requires (
  is_tuple_unique<std::tuple<TAs...>> &&
  ( sizeof...(TAs) == sizeof...(PAs) )
)
inline
constexpr auto
table<std::pair<Ts,Ps>...>::addu(
  const column<PAs>&... cs
) const

2)

template <typename... Ts,is_primitive_type... Ps>
template<typename... TAs,is_primitive_type... PAs>
requires (
  is_tuple_unique<std::tuple<TAs...>> &&
  ( sizeof...(TAs) == sizeof...(PAs) )
)
inline
constexpr auto
table<std::pair<Ts,Ps>...>::addu(
  const table<std::pair<TAs,PAs>...>& t
) const

  1. Returns a new table obtained by adding columns cs if lookup-type TA is not in table, or updating if lookup-type TA already exists in table.

  2. Returns a new table obtained by adding columns of t if lookup-type TA is not in table, or updating if lookup-type TA already exists in table.

Example

Code

#include <cpptables/table.hh>
#include <iostream>

using namespace tables;
using namespace std;

struct c0{ constexpr static string_view name =  "Col0"; };
struct c1{ constexpr static string_view name =  "Col1"; };
struct c2{ constexpr static string_view name =  "Col2"; };

using table_t = table<
  pair<c0,string_view>,
  pair<c1,unsigned>,
  pair<c2,double>
>;


void table_addu()
{
  const table_t t(
      {"abc", "def", "ghi"},
      {100,200,300},
      {1.0, 2.0, 3.0} 
    );

  const auto t1 = t.addu<c2>( column<string_view>({"foo","bar","xyz"}) );
  cout << t1 << "\n";
}

Output

Col0 Col1 Col2
--------------
 abc   10  foo
 def   20  bar
 ghi   30  xyz