Hi How could I loop through the container to get all the keys. Eg: For(int i=0;i< beambook.count();++i) Or Beambook:: iter1 = beambook.begin(), iter2 = beambook.end(); My requirement is to loop through the size and list compositeKey vs list of element Ids Thanks, UJ // define a multi_index_container with a composite key on typedef multi_index_container< Beam_entry, indexed_by< //non-unique as some might have more than ids ordered_non_unique< composite_key< Beam_entry, member, member, member, member, member, member > >, ordered_unique< member > >

beambook;

Thanks for the reply.. Let me put my requirement more clear. I want to loop through and get all the element Ids[ member] which are having the same member values[pid, orientX, orientY, orientZ, OffsetA and OffsetB]. I am expecting the count of the container to give the count of unique member entries. Something like: for (beambook::iterator iter = pb.begin(), i_end = pb.end(); iter != i_end; iter = pb.upper_bound(iter->eid)) { //print pid, orientX, orientY, orientZ, OffsetA, OffsetB VS VECTOR of eid's; } Thanks Uthpal -----Original Message----- From: boost-users-bounces@lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Andrew Holden Sent: Tuesday, June 01, 2010 7:10 PM To: boost-users@lists.boost.org Subject: Re: [Boost-users] multi_index_container for composite key On Tuesday, June 01, 2010 5:41 AM, Uthpal Urubail wrote:

Hi How could I loop through the container to get all the keys. Eg:       For(int i=0;i< beambook.count();++i) Or       Beambook:: iter1 = beambook.begin(), iter2 = beambook.end();

My requirement is to loop through the size and list compositeKey vs list of element Ids

Thanks, UJ   

// define a multi_index_container with a composite key on typedef multi_index_container<     Beam_entry,     indexed_by<     //non-unique as some  might have more than ids     ordered_non_unique<         composite_key<             Beam_entry,             member,             member,             member,             member,             member,             member             >     >,     ordered_unique<     member     >     >

...

beambook;

for (beambook::iterator iter = container.begin(), i_end = container.end(); iter != i_end; iter = container.upper_bound (get key from iter)) _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

Hi I am looking for a composite key container. Though I found multi_index_container for composite key is the best I have few doubts in its use case: Question:01 class Book { public: size_t mID; size_t node[3]; }; How to add the below into multi_index_container? typedef multi_index_container< Book, indexed_by< ordered_unique< composite_key< Book, member, member, member > >, ordered_unique< member > >

beambook;

Question:02 My requirement is straight forward. I need to get the id by providing 3 nodes. Should I always need to create a data structure? [class Book] Can't I have something like below? typedef multi_index_container< size_t, indexed_by< ordered_unique< composite_key< size_t, size_t, size_t > >, ordered_unique< size_t > >

beambook;

Thanks, UJ

Joaquín M López Muñoz, Thanks for offering me the help. One interesting observation: If I use the below in finding the objects it is not retrieving properly indexed_by< ordered_unique< /// INSTEAD if I use ordered_non_unique< it works fine composite_key< I am still not clear with my question:2 Can I define the container like below? I don't want to create the temporary data structure. I will get these information from a class object. Can I use them directly?? Please help me in understanding. typedef multi_index_container< , //?? indexed_by< ordered_unique< composite_key< , //??? BookNodeExtractor<0>, BookNodeExtractor<1>, BookNodeExtractor<2> > >, ordered_unique< member > > > beambook; Thanks, UJ -----Original Message----- From: boost-users-bounces@lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of joaquin@tid.es Sent: Thursday, September 09, 2010 11:31 AM To: boost-users@lists.boost.org Subject: Re: [Boost-users] multi_index_container for composite key Uthpal Urubail escribió:

Hi

I am looking for a composite key container.

Though I found multi_index_container for composite key is the best I have few doubts in its use case:

*Question:01*

class Book

{

public:

size_t mID;

*size_t node[3];*

};

How to add the below into multi_index_container?

typedef multi_index_container<

Book,

indexed_by<

ordered_unique<

composite_key<

Book,

member,

member,

member

>

>,

ordered_unique<

member

>

>

...

beambook;

member does not work for syntactic reasons (Book::node[0] is not a member of Book), but you can overcome this difficulty by using a custom key extractor (http://tinyurl.com/dafk2f ) just like this: template<int N> struct BookNodeExtractor { typedef size_t result_type; result_type operator()(const Book& b)const { return b.node[N]; } }; typedef multi_index_container< Book, indexed_by< ordered_unique< composite_key< Book, BookNodeExtractor<0>, BookNodeExtractor<1>, BookNodeExtractor<2> > >, ordered_unique< member > >

beambook;

*Question:02*

My requirement is straight forward. I need to get the id by providing 3 nodes.

Should I always need to create a data structure? [class Book]

No, in fact you don't need to create a Book object. Suppose bb is a beambook and you want to retrieve the mID of an element in bb with nodes n0, n1 and n2. You only have to do the following: size_t mID=bb.find(boost::make_tuple(n0,n1,n2))->mID; As you can see, you simply pass a tuple with the values for the composite key, not a whole Book object. Hope this helps, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

Joaquín, My question is: Can I define container like below? typedef multi_index_container< ElemShell*, indexed_by< //non-unique as some might have more than ids ordered_non_unique< composite_key< ElemShell*, member, member, member, member > >, ordered_unique< member > >

beambook;

When I retrieve, beambook::iterator it=(pb.find(boost::make_tuple(obj->N1,obj->N2,obj->N3,node4))); int val = (*it)->N4; Application is crashing. About: If you use ordered_unique then there cannot be two elements with the same node[0], node[1], node[2] values. Its TRUE. Two elements cannot have same node[0], node[1], node[2] values. How should be the container? Thanks, Uthpal

Hi I am new to multithreading please help me to resolve the below issue. I am getting the below error when I try to compile a simple multithreading program. 'libboost_thread-vc80-mt-gd-1_41.lib' - Is missing in boost installation. [**folder $BOOST_ROOT/stage is missing] 1>------ Build started: Project: BoostMultithreading, Configuration: Debug Win32 ------ 1>Compiling... 1>main.cpp 1>Linking... 1>LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc80-mt-gd-1_41.lib' 1>BoostMultithreading - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Thanks in advance UJ

On Tue, 2010-06-01 at 07:48 +0100, Anthony Williams wrote:

Braden McDaniel writes:

...

Using Boost 1.43, this program:

# include

int main() { boost::shared_mutex mutex; boost::upgrade_lockboost::shared_mutex lock(mutex); boost::upgrade_to_unique_lockboost::shared_mutex write_lock(lock); }

... produces this error when compiled with Visual C++ 2010:

That is trac issue 2501. It was fixed post 1.43, so should be in 1.44.

Aha. Thanks. -- Braden McDaniel