lcp.hpp

Go to the documentation of this file.

//=======================================================================
// Copyright (c) 2013 Piotr Smulewicz
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifndef PAAL_LCP_HPP
#define PAAL_LCP_HPP

#include <vector>

namespace paal {
template <typename Letter>
void lcp(std::vector<int> const &suffix_array, std::vector<int> const &rank,
         std::vector<int> &lcp, std::vector<Letter> const &sumWords) {
    int comonPrefixLength = 0;
    for (auto suffixRank :
         rank) { // suffixRank number suffix in lexicographically order
        if (suffixRank != 0) {
            while (sumWords[suffix_array[suffixRank] + comonPrefixLength] ==
                   sumWords[suffix_array[suffixRank - 1] + comonPrefixLength]) {
                ++comonPrefixLength;
            }
        }
        lcp[suffixRank] = comonPrefixLength;
        if (comonPrefixLength > 0) {
            --comonPrefixLength;
        }
    }
}
} 

#endif // PAAL_LCP_HPP