std::merge for n sequences

[Hicham Mouline]

Hello,
is there such a version of the algorithm?
regards,

 

[Hicham Mouline]

Hello,
is there such a version of the algorithm?
regards,

In fact, std::merge is not what I want, but something that is remotely
related to it.
I have n sorted containers of elements. Each element contains a boost::date
and other data.
I am trying to make the containers uniform in the sense that:
Assuming all begin and end dates of the n containers are identical,
if a date appears in any of the n containers, it should appear in all the
other containers,
if it doesn't, it is inserted and taking missing data from the previous
element available in the container.

Are there things in the std lib or boost to faciliate implementing this
case?

Regards,