Boost logo

Boost :

From: Gennadiy Rozental (gennadiy_at_[hidden])
Date: 2002-09-19 03:34:47

> template<typename size_type, typename InIt1, typename InIt2, typename
> size_type
> compute_lcs( InIt1 first_begin,
> InIt1 first_end,
> InIt2 second_begin,
> InIt2 second_end,
> OutIt result );

Several more steps:
* add Allocator
* change OutIt to more generic predicate as I explained in my other post
* completely separate LCS length search algorithm (does not require last
argument in above interface) and
  the find LCS itself algorithm (does not require the result type size_t)
* provide 2 different implementation one for the Forward iterator, second
for Bidirectional one.
* make sure that second implementation above does require namely
Bidirectional iterator, rather than Random Access as it is now in you

and we are on the same page.


Boost list run by bdawes at, gregod at, cpdaniel at, john at