Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8690211
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T23:51:15+00:00 2026-06-12T23:51:15+00:00

In the boost graph library, there are property maps used. For an example, consider

  • 0

In the boost graph library, there are property maps used. For an example, consider this link about properties. You can add multiple properties list like:

typedef property<vertex_distance_t, float, 
    property<vertex_name_t, std::string> > VertexProperty;

My questions are:

  • Is there a name for this “list of templates” concept, so I can google it?
  • Are there similar advanced template structures, like arrays or trees?
  • Do you have a good book or weblink explaining it?

Note: I need a solution without C++11, though C++11 would be interesting, too.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-12T23:51:17+00:00Added an answer on June 12, 2026 at 11:51 pm

    This type of template composition is called base class chaining.

    It specifically works nicely to

    • profit from empty baseclass optimizations
    • making it relatively easy to support open-ended lists of mixins, even on compilers that don’t directly support variadics yet

      Edit In fact, indeed this was how typelists were usually implemented before the advent of (c++0x) variadics (Modern C++ Design)

    References:

    • Base Class Chaining and Object Size

    Related:

    • Parameterized Base Class
    • Empty Base Optimization
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

can someone show me an example of how to use the Boost Graph Library
I am writing a Graph-class using boost-graph-library. I use custom vertex and edge properties
I have C++ program using boost graph library. I wonder if there is any
I am having some problems with the code from boost graph library Dijkstra example
I am confused about how to actually create a Graph using the boost library,
I'm using the boost graph library and having a runtime error that I can't
I am developing a Graph-class, based on boost-graph-library. A Graph-object contains a boost-graph, so
I found http://www.boost.org/doc/libs/1_49_0/libs/graph/example/incremental_components.cpp and want to check if it will work for me. How
I am using boost graph library for solving a network graph problem. I have
I have a large graph (30k vertices, 250m edges) and using boost graph library

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.