32 characters limit: 64bit?

[jbarth-ubhd]

Would it be possible to surpass the ~32 characters limit of agrep by using 64 bit unsigned long instead of unsigned?

Tried a bit with using unsigned long and doubling some agrep.h defines and replacing (unsigned)037777777777 to the 64 bit equivalent etc. But didn't work.

[Wikinaut]

As far as I know (since many years), this appears to be impossible, unfortunately!

[jbarth-ubhd]

Just tried it with the Fuzzy searching example code (substitutions only) here: https://en.wikipedia.org/wiki/Bitap_algorithm : 64 bit unsigned long works with 63 character long queries.

[Wikinaut]

Ah, sounds good. However please keep in mind, that agrep uses (offers to use) a circus of algorithms, so for this case it might be valid.

Looking forward to a(your) formal patch/pull request; please as a distinct feature branch, so that others can decide what to use - just in case.

Thanks for your message/issue.

[Wikinaut]

PS.
off-topic

Just found your perspective-correction scripts, I am also trying to find a working version of ShiftN.

See https://github.com/Wikinaut/shiftn and https://github.com/Wikinaut/Perspective-Transformation

[jbarth-ubhd]

quote from https://github.com/heyimalex/bitap : »Pattern size is limited to system word size (mem::size_of::() - 1), so you can't search for anything longer than 31/63 characters, depending on architecture.«