On Sat, Sep 7, 2013 at 6:28 AM, Janek Sendrowski wrote:
> Do you know the destination. I cant find it.
Here it is:
$ find . -name "*.[c|h]" | xgrep MAX_LEVENSHTEIN_STRLEN
./contrib/fuzzystrmatch/levenshtein.c:#define MAX_LEVENSHTEIN_STRLEN255
./contrib/fuzzystrmatch/levenshtein.c:if (m
On 9/6/2013 2:00 PM, jane...@web.de wrote:
Where can I change levensthein_max_length?
as the message you quoted said, its
#define MAX_LEVENSHTEIN_STRLEN
I'd expect this (without bothering to look) to be in a .h file in the
fuzzystrmatch contributed module directory.
--
john r p
Where can I change levensthein_max_length?
Janek Sendrowski
Von: "Szymon Guz"
An: "Tom Lane"
Betreff: Re: [GENERAL] Levenshtein Distance with more than 255 characters
On 6 September 2013 08:47, Tom Lane wrote:
> Szymon Guz writes:
> > On 6 September 2013 0
Do you know the destination. I cant find it.
On 6 September 2013 08:47, Tom Lane wrote:
> Szymon Guz writes:
> > On 6 September 2013 01:00, Janek Sendrowski wrote:
> >> I'm searching for an optimized Levenshtein Distance like Postgresql's.
> My
> >> problem is that I want to compare strings with a length over 255
> characters.
> >> Does a
Szymon Guz writes:
> On 6 September 2013 01:00, Janek Sendrowski wrote:
>> I'm searching for an optimized Levenshtein Distance like Postgresql's. My
>> problem is that I want to compare strings with a length over 255 characters.
>> Does anyone know a solution?
> I'm not sure there is anything di
On 6 September 2013 01:00, Janek Sendrowski wrote:
> Hi,
>
> I'm searching for an optimized Levenshtein Distance like Postgresql's. My
> problem is that I want to compare strings with a length over 255 characters.
> Does anyone know a solution?
>
> Janek Sendrowski
>
Hi,
I'm not sure there is a
Hi,
I'm searching for an optimized Levenshtein Distance like Postgresql's. My problem is that I want to compare strings with a length over 255 characters.
Does anyone know a solution?
Janek Sendrowski