Tables in C++

[danny280279]

I'm a beginner in C++ but I would like to know how to make tables in C++ that combine different types of data, such as, country codes, countries, and languages, all within the same table, so as it's easy to find for lookups

[binarybob350]

You could use a map of structures.

[Dy7SLyTq]

well, if your really dedicated, mysql

[Disch]

I want to chime in and say that if you're looking to use a database... C++ probably is not the first language I would choose for that. Static typing and databases generally don't work very well together.

[Dy7SLyTq]

whats a better alternative then? csv (or would that still be database area)?

[JLBorges]

> I'm a beginner in C++ but I would like to know how to make tables in C++
> that combine different types of data, > such as, country codes, countries, and languages,
> all within the same table, so as it's easy to find for lookups

If you are familiar with templates, boost::multi_index_container<> may be just what you are looking for.
http://www.boost.org/doc/libs/1_53_0/libs/multi_index/doc/index.html

Not really absolute beginner stuff, though.

#include <iostream>
#include <string>
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/sequenced_index.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index/member.hpp>
#include <algorithm>
#include <iterator>

using namespace boost ;
using namespace boost::multi_index ;

struct country
{
    int country_code ;
    std::string name ;
    std::string language ;
    int population ;
    std::string currency ;

    friend inline std::ostream& operator<< ( std::ostream& stm, const country& c )
    {
        return stm << "{ " << c.country_code << ", " << c.name << ", " << c.language
                    << ", " << c.population << ", " << c.currency << " }" ;
    }
};

template < typename TAG, typename T, T country::*MEM >
    using  unique_member = ordered_unique< tag<TAG>, member< country, T, MEM > > ;

template < typename TAG, typename T, T country::*MEM >
    using  non_unique_member = ordered_non_unique< tag<TAG>, member< country, T, MEM > > ;

int main()
{
    struct by_code{};
    struct by_name{};
    struct by_lang{};
    struct by_pop{};
    struct by_currency{};

    using country_db = multi_index_container
    <
        country,
        indexed_by
        <
            sequenced<>,
            unique_member< by_code, int, &country::country_code >,
            unique_member< by_name, std::string, &country::name >,
            non_unique_member< by_lang, std::string, &country::language >,
            non_unique_member< by_pop, int, &country::population >,
            non_unique_member< by_currency, std::string, &country::currency >
        >
    >;

    country_db db ;
    db.push_back( { 56, "Spain", "Spanish", 123, "Drachma" }  ) ;
    db.push_back( { 68, "Lithuania", "Lithuanian", 4567, "Lira" }  ) ;
    db.push_back( { 92, "Armenia", "Armenian", 890, "Zlotty" }  ) ;
    db.push_back( { 11, "Mexico", "Spanish", 2345, "Taka" }  ) ;
    db.push_back( { 38, "Brazil", "Spanish", 345, "Rouble" }  ) ;
    db.push_back( { 93, "Austria", "German", 6789, "Yen" }  ) ;

    auto to_stdout = std::ostream_iterator<country>( std::cout, "\n" ) ;

    // list by country code
    std::copy( db.get<by_code>().begin(), db.get<by_code>().end(), to_stdout ) ;

    // list Spanish speaking countries
    {
        std::cout << "\nlanguage is 'Spanish'\n-----------\n" ;
        const auto& iter = db.get<by_lang>().equal_range("Spanish") ;
        std::copy( iter.first, iter.second, to_stdout ) ;
    }

    // print out the population of 'Armenia'
    std::cout << "\npopulation of 'Armenia': "
               << db.get<by_name>().find("Armenia")->population << '\n' ;

    // list countries with population > 999 and less than 5000
    {
        std::cout << "\npopulation > 900 && population < 5000\n------------------\n" ;
        const auto& begin = db.get<by_pop>().upper_bound(999) ;
        const auto& end = db.get<by_pop>().lower_bound(5000) ;
        std::copy( begin, end, to_stdout ) ;
    }
}

Snippet: http://liveworkspace.org/code/2FTmsm$0