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 8840465
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T10:28:16+00:00 2026-06-14T10:28:16+00:00

I need to create a structure that has a vector<self> as a member variable.

  • 0

I need to create a structure that has a vector<self> as a member variable. Boost offers 2 mechanisms that achieve this:

1 – using boost::recursive_wrapper i.e.:

struct filter
{
    uint32_t id;
    std::vector< boost::recursive_wrapper< filter > > childFilters; 
};

2 – using boost::container i.e.:

struct filter
{
    uint32_t id;
    boost::container::vector< filter > childFilters; 
};

Is there any advantage with each technique? The second boost::container option involves less syntax, and I guess it uses a technique similar to the boost::recursive_wrapper internally.

  • 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-14T10:28:17+00:00Added an answer on June 14, 2026 at 10:28 am

    The better choice is to use boost::container::vector, because it allows direct access to the type stored in the vector.

    The extra layer of indirection provided by boost::recursive_wrapper that allows the declaration of a std::vector<self> makes code manipulating the vector more cumbersome, because it is necessary get to access the actual type being held.

    i.e.

    struct filter
    {
        uint32_t id;
        std::vector< boost::recursive_wrapper< filter > > childFilters; 
    };
    
    filter myFilter;
    
    // fill myFilter .....
    
    BOOST_FOREACH( boost::recursive_wrapper< filter > f, myFilter.childFilters )
    {
        std::cout << f.get().id << "\n";
    }
    

    With boost::container::vector the example becomes:

    struct filter
    {
        uint32_t id;
        boost::container::vector< filter > childFilters; 
    };
    
    filter myFilter;
    
    // fill myFilter .....
    
    BOOST_FOREACH( boost::recursive_wrapper< filter > f, myFilter.childFilters )
    {
        std::cout << f.id << "\n";    // no call to get()
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I need to create a structure that holds a variable number of 'char[2]'s, i.e.
I am trying to create a structure that has several different variable of different
I need to create a structure that looks like an int (but has an
I need to create MySQL tables that represent a tree structure like this: Root
I have some data and need to create a json file with this structure
I need to create a table structure that will automatically create columns for a
I want to create a database structure that will has good efficiency. Now database
I need create a tree structure recursively. In the tree each node has different
I am in need of a data structure that has fast insert, fast retrieve,
Ok, so here's the entire structure I'm trying to create. I need to create

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.