Re: [Boost-users] Mismatch and regex newbie problem still problem"

From: Paul Davis (pjdavis_at_[hidden])
Date: 2006-08-29 11:00:02

If you're willing to dig into assembly and SSE instructions for your
processor, its possible you could do an exhaustive search in O(N) time (N
being the lenght of the string your searching in).  I don't know too much
about the whole thing, but I do know that some processors have a vector math
function that allows you to compare up to something like 16 single byte
values in one cycle.  Pretty nifty, but like I say, I haven't any idea on
how to actually code it.

Paul

On 8/29/06, david v <danova_fr_at_[hidden]> wrote:
>
> Hello,
> As James pointed out the right place to start with will be suffix tree
> algorithms.  The only thing i don't know if this is going to be very time
> consuming ???
>
>
> ######For Brian....
>   1) What's the longest string you're searching for?
> For the moment is limited to 6 to 8 characters.
>
>   2) What's the smallest bit-width of any cpu on which you're running
> your code?
> I'm on 64 dual opteron machine
>
>   3) How familiar with string searching/matching are you?
> Quite familiar but was looking for a cpp library that could handle it
> instead of trying to rewrite things.
>
> Best,
> david
>
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>