Boost :

Date view	Thread view	Subject view	Author view

Subject: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm
From: Ð—Ð°Ð¹Ñ†ÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ€ (zamazan4ik_at_[hidden])
Date: 2016-10-12 15:59:44

Next message: Gavin Lambert: "Re: [boost] [config] Changes to reflect Visual C++ "15" preview 5"
Previous message: Emil Dotchevski: "Re: [boost] [qvm] Doesn qvm contain any sse/avx etc optimizations?"
Next in thread: Seth: "Re: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm"
Reply: Seth: "Re: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm"

Hello

I want to add to Boost.Algorithm algorithm for finding all palindromes in a sequence in O(N). https://en.wikipedia.org/wiki/Longest_palindromic_substring

Is it useful algorithm for Boost? Have you any suggestions?

--Â
Best regards, Alexander Zaitsev

Next message: Gavin Lambert: "Re: [boost] [config] Changes to reflect Visual C++ "15" preview 5"
Previous message: Emil Dotchevski: "Re: [boost] [qvm] Doesn qvm contain any sse/avx etc optimizations?"
Next in thread: Seth: "Re: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm"
Reply: Seth: "Re: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm"

Date view	Thread view	Subject view	Author view

Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk