Hi,
OK, here, instead of a composite_key instantiation, you can take advantage directly of std::vector comparison semantics (you don't really need tuple_element):
typedef multi_index_container< element, indexed_by< hashed_unique< member<element,std::vector<const std::string>,&element::tp> > // other indices, maybe
element_collection;
Is this equivalent to having a member std::string tp which is constructed at run-time from all the elements of std::vector< const std::string > ? Also, how does the hash function generate the key ? Thanks a lot. regards, Prashant Thakre Joaquin M Lopez Munoz <joaquin <at> tid.es> writes:
Prashant Thakre <prashant.thakre <at> gmail.com> writes:
Now, you can use n-sized vectors everywhere, where n is determined at run-time. Does this suit your needs?
Joaquín M López Muñoz Telefónica, Investigación y Desarrollo
_______________________________________________ Boost-users mailing list Boost-users <at> lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users