Longest common subsequence: Difference between revisions
m
Switched std::map to C++11 std::unordered_map to reduce initial Match() overhead.
(Simplified discussion of the product-order, defining it to be non-strict in keeping with wider convention. Corrected legend.) |
m (Switched std::map to C++11 std::unordered_map to reduce initial Match() overhead.) |
||
Line 460:
#include <iostream>
#include <deque>
#include <
#include <algorithm> // for lower_bound()
#include <iterator> // for next() and prev()
Line 490:
typedef deque<uint32_t> THRESHOLD;
typedef deque<uint32_t> INDEXES;
typedef
typedef deque<INDEXES*> MATCHES;
| |||