#include "postgres.h"
#include <ctype.h>
#include "utils/builtins.h"
#include "utils/varlena.h"
#include "varatt.h"

Include dependency graph for fuzzystrmatch.c:

Macros
#define	SOUNDEX_LEN 4

#define	MAX_METAPHONE_STRLEN 255

#define	SH 'X'

#define	TH '0'

#define	isvowel(c) (getcode(c) & 1) /* AEIOU */

#define	NOCHANGE(c) (getcode(c) & 2) /* FJMNR */

#define	AFFECTH(c) (getcode(c) & 4) /* CGPST */

#define	MAKESOFT(c) (getcode(c) & 8) /* EIY */

#define	NOGHTOF(c) (getcode(c) & 16) /* BDH */

#define	Next_Letter (toupper((unsigned char) word[w_idx+1]))

#define	Curr_Letter (toupper((unsigned char) word[w_idx]))

#define	Look_Back_Letter(n) (w_idx >= (n) ? toupper((unsigned char) word[w_idx-(n)]) : '\0')

#define	Prev_Letter (Look_Back_Letter(1))

#define	After_Next_Letter (Next_Letter != '\0' ? toupper((unsigned char) word[w_idx+2]) : '\0')

#define	Look_Ahead_Letter(n) toupper((unsigned char) Lookahead(word+w_idx, n))

#define	Phonize(c) do {(*phoned_word)[p_idx++] = c;} while (0)

#define	End_Phoned_Word do {(*phoned_word)[p_idx] = '\0';} while (0)

#define	Phone_Len (p_idx)

#define	Isbreak(c) (!isalpha((unsigned char) (c)))

Functions
static void	_soundex (const char instr, char outstr)

static char	soundex_code (char letter)

static char	Lookahead (char *word, int how_far)

static void	_metaphone (char word, int max_phonemes, char *phoned_word)

static int	getcode (char c)

	PG_FUNCTION_INFO_V1 (levenshtein_with_costs)

Datum	levenshtein_with_costs (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (levenshtein)

Datum	levenshtein (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (levenshtein_less_equal_with_costs)

Datum	levenshtein_less_equal_with_costs (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (levenshtein_less_equal)

Datum	levenshtein_less_equal (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (metaphone)

Datum	metaphone (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (soundex)

Datum	soundex (PG_FUNCTION_ARGS)

	PG_FUNCTION_INFO_V1 (difference)

Datum	difference (PG_FUNCTION_ARGS)

Variables
	PG_MODULE_MAGIC

static const char *const	soundex_table = "01230120022455012623010202"

static const char	_codes [26]

Macro Definition Documentation

◆ AFFECTH

#define AFFECTH ( c ) (getcode(c) & 4) /* CGPST */

Definition at line 138 of file fuzzystrmatch.c.

◆ After_Next_Letter

#define After_Next_Letter (Next_Letter != '\0' ? toupper((unsigned char) word[w_idx+2]) : '\0')

Definition at line 310 of file fuzzystrmatch.c.

◆ Curr_Letter

#define Curr_Letter (toupper((unsigned char) word[w_idx]))

Definition at line 303 of file fuzzystrmatch.c.

◆ End_Phoned_Word

#define End_Phoned_Word do {(*phoned_word)[p_idx] = '\0';} while (0)

Definition at line 335 of file fuzzystrmatch.c.

◆ Isbreak

#define Isbreak ( c ) (!isalpha((unsigned char) (c)))

Definition at line 340 of file fuzzystrmatch.c.

◆ isvowel

#define isvowel ( c ) (getcode(c) & 1) /* AEIOU */

Definition at line 132 of file fuzzystrmatch.c.

◆ Look_Ahead_Letter

#define Look_Ahead_Letter ( n ) toupper((unsigned char) Lookahead(word+w_idx, n))

Definition at line 312 of file fuzzystrmatch.c.

◆ Look_Back_Letter

#define Look_Back_Letter ( n ) (w_idx >= (n) ? toupper((unsigned char) word[w_idx-(n)]) : '\0')

Definition at line 305 of file fuzzystrmatch.c.

◆ MAKESOFT

#define MAKESOFT ( c ) (getcode(c) & 8) /* EIY */

Definition at line 141 of file fuzzystrmatch.c.

◆ MAX_METAPHONE_STRLEN

#define MAX_METAPHONE_STRLEN 255

Definition at line 72 of file fuzzystrmatch.c.

◆ Next_Letter

#define Next_Letter (toupper((unsigned char) word[w_idx+1]))

Definition at line 301 of file fuzzystrmatch.c.

◆ NOCHANGE

#define NOCHANGE ( c ) (getcode(c) & 2) /* FJMNR */

Definition at line 135 of file fuzzystrmatch.c.

◆ NOGHTOF

#define NOGHTOF ( c ) (getcode(c) & 16) /* BDH */

Definition at line 144 of file fuzzystrmatch.c.

◆ Phone_Len

#define Phone_Len (p_idx)

Definition at line 337 of file fuzzystrmatch.c.

◆ Phonize

#define Phonize ( c ) do {(*phoned_word)[p_idx++] = c;} while (0)

Definition at line 333 of file fuzzystrmatch.c.

◆ Prev_Letter

#define Prev_Letter (Look_Back_Letter(1))

Definition at line 308 of file fuzzystrmatch.c.

◆ SH

#define SH 'X'

Definition at line 103 of file fuzzystrmatch.c.

◆ SOUNDEX_LEN

#define SOUNDEX_LEN 4

Definition at line 54 of file fuzzystrmatch.c.

◆ TH

#define TH '0'

Definition at line 104 of file fuzzystrmatch.c.

Function Documentation

◆ _metaphone()

static void _metaphone	(	char *	word,
		int	max_phonemes,
		char **	phoned_word
	)

static

Definition at line 344 of file fuzzystrmatch.c.

{
    int         w_idx = 0;      /* point in the phonization we're at. */
    int         p_idx = 0;      /* end of the phoned phrase */
 
    /*-- Parameter checks --*/
 
    /*
     * Shouldn't be necessary, but left these here anyway jec Aug 3, 2001
     */
 
    /* Negative phoneme length is meaningless */
    if (!(max_phonemes > 0))
        /* internal error */
        elog(ERROR, "metaphone: Requested output length must be > 0");
 
    /* Empty/null string is meaningless */
    if ((word == NULL) || !(strlen(word) > 0))
        /* internal error */
        elog(ERROR, "metaphone: Input string length must be > 0");
 
    /*-- Allocate memory for our phoned_phrase --*/
    if (max_phonemes == 0)
    {                           /* Assume largest possible */
        *phoned_word = palloc(sizeof(char) * strlen(word) + 1);
    }
    else
    {
        *phoned_word = palloc(sizeof(char) * max_phonemes + 1);
    }
 
    /*-- The first phoneme has to be processed specially. --*/
    /* Find our first letter */
    for (; !isalpha((unsigned char) (Curr_Letter)); w_idx++)
    {
        /* On the off chance we were given nothing but crap... */
        if (Curr_Letter == '\0')
        {
            End_Phoned_Word;
            return;
        }
    }
 
    switch (Curr_Letter)
    {
            /* AE becomes E */
        case 'A':
            if (Next_Letter == 'E')
            {
                Phonize('E');
                w_idx += 2;
            }
            /* Remember, preserve vowels at the beginning */
            else
            {
                Phonize('A');
                w_idx++;
            }
            break;
            /* [GKP]N becomes N */
        case 'G':
        case 'K':
        case 'P':
            if (Next_Letter == 'N')
            {
                Phonize('N');
                w_idx += 2;
            }
            break;
 
            /*
             * WH becomes H, WR becomes R W if followed by a vowel
             */
        case 'W':
            if (Next_Letter == 'H' ||
                Next_Letter == 'R')
            {
                Phonize(Next_Letter);
                w_idx += 2;
            }
            else if (isvowel(Next_Letter))
            {
                Phonize('W');
                w_idx += 2;
            }
            /* else ignore */
            break;
            /* X becomes S */
        case 'X':
            Phonize('S');
            w_idx++;
            break;
            /* Vowels are kept */
 
            /*
             * We did A already case 'A': case 'a':
             */
        case 'E':
        case 'I':
        case 'O':
        case 'U':
            Phonize(Curr_Letter);
            w_idx++;
            break;
        default:
            /* do nothing */
            break;
    }
 
 
 
    /* On to the metaphoning */
    for (; Curr_Letter != '\0' &&
         (max_phonemes == 0 || Phone_Len < max_phonemes);
         w_idx++)
    {
        /*
         * How many letters to skip because an earlier encoding handled
         * multiple letters
         */
        unsigned short int skip_letter = 0;
 
 
        /*
         * THOUGHT:  It would be nice if, rather than having things like...
         * well, SCI.  For SCI you encode the S, then have to remember to skip
         * the C.  So the phonome SCI invades both S and C.  It would be
         * better, IMHO, to skip the C from the S part of the encoding. Hell,
         * I'm trying it.
         */
 
        /* Ignore non-alphas */
        if (!isalpha((unsigned char) (Curr_Letter)))
            continue;
 
        /* Drop duplicates, except CC */
        if (Curr_Letter == Prev_Letter &&
            Curr_Letter != 'C')
            continue;
 
        switch (Curr_Letter)
        {
                /* B -> B unless in MB */
            case 'B':
                if (Prev_Letter != 'M')
                    Phonize('B');
                break;
 
                /*
                 * 'sh' if -CIA- or -CH, but not SCH, except SCHW. (SCHW is
                 * handled in S) S if -CI-, -CE- or -CY- dropped if -SCI-,
                 * SCE-, -SCY- (handed in S) else K
                 */
            case 'C':
                if (MAKESOFT(Next_Letter))
                {               /* C[IEY] */
                    if (After_Next_Letter == 'A' &&
                        Next_Letter == 'I')
                    {           /* CIA */
                        Phonize(SH);
                    }
                    /* SC[IEY] */
                    else if (Prev_Letter == 'S')
                    {
                        /* Dropped */
                    }
                    else
                        Phonize('S');
                }
                else if (Next_Letter == 'H')
                {
#ifndef USE_TRADITIONAL_METAPHONE
                    if (After_Next_Letter == 'R' ||
                        Prev_Letter == 'S')
                    {           /* Christ, School */
                        Phonize('K');
                    }
                    else
                        Phonize(SH);
#else
                    Phonize(SH);
#endif
                    skip_letter++;
                }
                else
                    Phonize('K');
                break;
 
                /*
                 * J if in -DGE-, -DGI- or -DGY- else T
                 */
            case 'D':
                if (Next_Letter == 'G' &&
                    MAKESOFT(After_Next_Letter))
                {
                    Phonize('J');
                    skip_letter++;
                }
                else
                    Phonize('T');
                break;
 
                /*
                 * F if in -GH and not B--GH, D--GH, -H--GH, -H---GH else
                 * dropped if -GNED, -GN, else dropped if -DGE-, -DGI- or
                 * -DGY- (handled in D) else J if in -GE-, -GI, -GY and not GG
                 * else K
                 */
            case 'G':
                if (Next_Letter == 'H')
                {
                    if (!(NOGHTOF(Look_Back_Letter(3)) ||
                          Look_Back_Letter(4) == 'H'))
                    {
                        Phonize('F');
                        skip_letter++;
                    }
                    else
                    {
                        /* silent */
                    }
                }
                else if (Next_Letter == 'N')
                {
                    if (Isbreak(After_Next_Letter) ||
                        (After_Next_Letter == 'E' &&
                         Look_Ahead_Letter(3) == 'D'))
                    {
                        /* dropped */
                    }
                    else
                        Phonize('K');
                }
                else if (MAKESOFT(Next_Letter) &&
                         Prev_Letter != 'G')
                    Phonize('J');
                else
                    Phonize('K');
                break;
                /* H if before a vowel and not after C,G,P,S,T */
            case 'H':
                if (isvowel(Next_Letter) &&
                    !AFFECTH(Prev_Letter))
                    Phonize('H');
                break;
 
                /*
                 * dropped if after C else K
                 */
            case 'K':
                if (Prev_Letter != 'C')
                    Phonize('K');
                break;
 
                /*
                 * F if before H else P
                 */
            case 'P':
                if (Next_Letter == 'H')
                    Phonize('F');
                else
                    Phonize('P');
                break;
 
                /*
                 * K
                 */
            case 'Q':
                Phonize('K');
                break;
 
                /*
                 * 'sh' in -SH-, -SIO- or -SIA- or -SCHW- else S
                 */
            case 'S':
                if (Next_Letter == 'I' &&
                    (After_Next_Letter == 'O' ||
                     After_Next_Letter == 'A'))
                    Phonize(SH);
                else if (Next_Letter == 'H')
                {
                    Phonize(SH);
                    skip_letter++;
                }
#ifndef USE_TRADITIONAL_METAPHONE
                else if (Next_Letter == 'C' &&
                         Look_Ahead_Letter(2) == 'H' &&
                         Look_Ahead_Letter(3) == 'W')
                {
                    Phonize(SH);
                    skip_letter += 2;
                }
#endif
                else
                    Phonize('S');
                break;
 
                /*
                 * 'sh' in -TIA- or -TIO- else 'th' before H else T
                 */
            case 'T':
                if (Next_Letter == 'I' &&
                    (After_Next_Letter == 'O' ||
                     After_Next_Letter == 'A'))
                    Phonize(SH);
                else if (Next_Letter == 'H')
                {
                    Phonize(TH);
                    skip_letter++;
                }
                else
                    Phonize('T');
                break;
                /* F */
            case 'V':
                Phonize('F');
                break;
                /* W before a vowel, else dropped */
            case 'W':
                if (isvowel(Next_Letter))
                    Phonize('W');
                break;
                /* KS */
            case 'X':
                Phonize('K');
                if (max_phonemes == 0 || Phone_Len < max_phonemes)
                    Phonize('S');
                break;
                /* Y if followed by a vowel */
            case 'Y':
                if (isvowel(Next_Letter))
                    Phonize('Y');
                break;
                /* S */
            case 'Z':
                Phonize('S');
                break;
                /* No transformation */
            case 'F':
            case 'J':
            case 'L':
            case 'M':
            case 'N':
            case 'R':
                Phonize(Curr_Letter);
                break;
            default:
                /* nothing */
                break;
        }                       /* END SWITCH */
 
        w_idx += skip_letter;
    }                           /* END FOR */
 
    End_Phoned_Word;
}                               /* END metaphone */

References AFFECTH, After_Next_Letter, Curr_Letter, elog, End_Phoned_Word, ERROR, Isbreak, isvowel, Look_Ahead_Letter, Look_Back_Letter, MAKESOFT, Next_Letter, NOGHTOF, palloc(), Phone_Len, Phonize, Prev_Letter, SH, TH, and word().

Referenced by metaphone().

◆ _soundex()

static void _soundex	(	const char *	instr,
		char *	outstr
	)

static

Definition at line 723 of file fuzzystrmatch.c.

{
    int         count;
 
    Assert(instr);
    Assert(outstr);
 
    /* Skip leading non-alphabetic characters */
    while (*instr && !isalpha((unsigned char) *instr))
        ++instr;
 
    /* If no string left, return all-zeroes buffer */
    if (!*instr)
    {
        memset(outstr, '\0', SOUNDEX_LEN + 1);
        return;
    }
 
    /* Take the first letter as is */
    *outstr++ = (char) toupper((unsigned char) *instr++);
 
    count = 1;
    while (*instr && count < SOUNDEX_LEN)
    {
        if (isalpha((unsigned char) *instr) &&
            soundex_code(*instr) != soundex_code(*(instr - 1)))
        {
            *outstr = soundex_code(*instr);
            if (*outstr != '0')
            {
                ++outstr;
                ++count;
            }
        }
        ++instr;
    }
 
    /* Fill with 0's */
    while (count < SOUNDEX_LEN)
    {
        *outstr = '0';
        ++outstr;
        ++count;
    }
 
    /* And null-terminate */
    *outstr = '\0';
}

References Assert(), soundex_code(), and SOUNDEX_LEN.

Referenced by difference(), and soundex().

◆ difference()

Datum difference ( PG_FUNCTION_ARGS )

Definition at line 775 of file fuzzystrmatch.c.

{
    char        sndx1[SOUNDEX_LEN + 1],
                sndx2[SOUNDEX_LEN + 1];
    int         i,
                result;
 
    _soundex(text_to_cstring(PG_GETARG_TEXT_PP(0)), sndx1);
    _soundex(text_to_cstring(PG_GETARG_TEXT_PP(1)), sndx2);
 
    result = 0;
    for (i = 0; i < SOUNDEX_LEN; i++)
    {
        if (sndx1[i] == sndx2[i])
            result++;
    }
 
    PG_RETURN_INT32(result);
}

References _soundex(), i, PG_GETARG_TEXT_PP, PG_RETURN_INT32, SOUNDEX_LEN, and text_to_cstring().

Referenced by checkcondition_str(), ExtendMultiXactMember(), find_wordentry(), getKeyJsonValueFromContainer(), hstore_concat(), hstore_delete_array(), hstore_delete_hstore(), hstore_subscript_assign(), and hstoreFindKey().

◆ getcode()

static int getcode ( char c )

static

Definition at line 120 of file fuzzystrmatch.c.

{
    if (isalpha((unsigned char) c))
    {
        c = toupper((unsigned char) c);
        /* Defend against non-ASCII letters */
        if (c >= 'A' && c <= 'Z')
            return _codes[c - 'A'];
    }
    return 0;
}

References _codes.

◆ levenshtein()

Datum levenshtein ( PG_FUNCTION_ARGS )

Definition at line 174 of file fuzzystrmatch.c.

{
    text       *src = PG_GETARG_TEXT_PP(0);
    text       *dst = PG_GETARG_TEXT_PP(1);
    const char *s_data;
    const char *t_data;
    int         s_bytes,
                t_bytes;
 
    /* Extract a pointer to the actual character data */
    s_data = VARDATA_ANY(src);
    t_data = VARDATA_ANY(dst);
    /* Determine length of each string in bytes */
    s_bytes = VARSIZE_ANY_EXHDR(src);
    t_bytes = VARSIZE_ANY_EXHDR(dst);
 
    PG_RETURN_INT32(varstr_levenshtein(s_data, s_bytes, t_data, t_bytes,
                                       1, 1, 1, false));
}

References PG_GETARG_TEXT_PP, PG_RETURN_INT32, VARDATA_ANY, VARSIZE_ANY_EXHDR, and varstr_levenshtein().

◆ levenshtein_less_equal()

Datum levenshtein_less_equal ( PG_FUNCTION_ARGS )

Definition at line 226 of file fuzzystrmatch.c.

{
    text       *src = PG_GETARG_TEXT_PP(0);
    text       *dst = PG_GETARG_TEXT_PP(1);
    int         max_d = PG_GETARG_INT32(2);
    const char *s_data;
    const char *t_data;
    int         s_bytes,
                t_bytes;
 
    /* Extract a pointer to the actual character data */
    s_data = VARDATA_ANY(src);
    t_data = VARDATA_ANY(dst);
    /* Determine length of each string in bytes */
    s_bytes = VARSIZE_ANY_EXHDR(src);
    t_bytes = VARSIZE_ANY_EXHDR(dst);
 
    PG_RETURN_INT32(varstr_levenshtein_less_equal(s_data, s_bytes,
                                                  t_data, t_bytes,
                                                  1, 1, 1,
                                                  max_d, false));
}

References PG_GETARG_INT32, PG_GETARG_TEXT_PP, PG_RETURN_INT32, VARDATA_ANY, VARSIZE_ANY_EXHDR, and varstr_levenshtein_less_equal().

◆ levenshtein_less_equal_with_costs()

Datum levenshtein_less_equal_with_costs ( PG_FUNCTION_ARGS )

Definition at line 197 of file fuzzystrmatch.c.

{
    text       *src = PG_GETARG_TEXT_PP(0);
    text       *dst = PG_GETARG_TEXT_PP(1);
    int         ins_c = PG_GETARG_INT32(2);
    int         del_c = PG_GETARG_INT32(3);
    int         sub_c = PG_GETARG_INT32(4);
    int         max_d = PG_GETARG_INT32(5);
    const char *s_data;
    const char *t_data;
    int         s_bytes,
                t_bytes;
 
    /* Extract a pointer to the actual character data */
    s_data = VARDATA_ANY(src);
    t_data = VARDATA_ANY(dst);
    /* Determine length of each string in bytes */
    s_bytes = VARSIZE_ANY_EXHDR(src);
    t_bytes = VARSIZE_ANY_EXHDR(dst);
 
    PG_RETURN_INT32(varstr_levenshtein_less_equal(s_data, s_bytes,
                                                  t_data, t_bytes,
                                                  ins_c, del_c, sub_c,
                                                  max_d, false));
}

References PG_GETARG_INT32, PG_GETARG_TEXT_PP, PG_RETURN_INT32, VARDATA_ANY, VARSIZE_ANY_EXHDR, and varstr_levenshtein_less_equal().

◆ levenshtein_with_costs()

Datum levenshtein_with_costs ( PG_FUNCTION_ARGS )

Definition at line 148 of file fuzzystrmatch.c.

{
    text       *src = PG_GETARG_TEXT_PP(0);
    text       *dst = PG_GETARG_TEXT_PP(1);
    int         ins_c = PG_GETARG_INT32(2);
    int         del_c = PG_GETARG_INT32(3);
    int         sub_c = PG_GETARG_INT32(4);
    const char *s_data;
    const char *t_data;
    int         s_bytes,
                t_bytes;
 
    /* Extract a pointer to the actual character data */
    s_data = VARDATA_ANY(src);
    t_data = VARDATA_ANY(dst);
    /* Determine length of each string in bytes */
    s_bytes = VARSIZE_ANY_EXHDR(src);
    t_bytes = VARSIZE_ANY_EXHDR(dst);
 
    PG_RETURN_INT32(varstr_levenshtein(s_data, s_bytes, t_data, t_bytes,
                                       ins_c, del_c, sub_c, false));
}

References PG_GETARG_INT32, PG_GETARG_TEXT_PP, PG_RETURN_INT32, VARDATA_ANY, VARSIZE_ANY_EXHDR, and varstr_levenshtein().

◆ Lookahead()

static char Lookahead	(	char *	word,
		int	how_far
	)

static

Definition at line 318 of file fuzzystrmatch.c.

{
    char        letter_ahead = '\0';    /* null by default */
    int         idx;
 
    for (idx = 0; word[idx] != '\0' && idx < how_far; idx++);
    /* Edge forward in the string... */
 
    letter_ahead = word[idx];   /* idx will be either == to how_far or at the
                                 * end of the string */
    return letter_ahead;
}

References idx(), and word().

◆ metaphone()

Datum metaphone ( PG_FUNCTION_ARGS )

Definition at line 257 of file fuzzystrmatch.c.

{
    char       *str_i = TextDatumGetCString(PG_GETARG_DATUM(0));
    size_t      str_i_len = strlen(str_i);
    int         reqlen;
    char       *metaph;
 
    /* return an empty string if we receive one */
    if (!(str_i_len > 0))
        PG_RETURN_TEXT_P(cstring_to_text(""));
 
    if (str_i_len > MAX_METAPHONE_STRLEN)
        ereport(ERROR,
                (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
                 errmsg("argument exceeds the maximum length of %d bytes",
                        MAX_METAPHONE_STRLEN)));
 
    reqlen = PG_GETARG_INT32(1);
    if (reqlen > MAX_METAPHONE_STRLEN)
        ereport(ERROR,
                (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
                 errmsg("output exceeds the maximum length of %d bytes",
                        MAX_METAPHONE_STRLEN)));
 
    if (!(reqlen > 0))
        ereport(ERROR,
                (errcode(ERRCODE_ZERO_LENGTH_CHARACTER_STRING),
                 errmsg("output cannot be empty string")));
 
    _metaphone(str_i, reqlen, &metaph);
    PG_RETURN_TEXT_P(cstring_to_text(metaph));
}

References _metaphone(), cstring_to_text(), ereport, errcode(), errmsg(), ERROR, MAX_METAPHONE_STRLEN, PG_GETARG_DATUM, PG_GETARG_INT32, PG_RETURN_TEXT_P, and TextDatumGetCString.

◆ PG_FUNCTION_INFO_V1() [1/7]

PG_FUNCTION_INFO_V1 ( difference )

◆ PG_FUNCTION_INFO_V1() [2/7]

PG_FUNCTION_INFO_V1 ( levenshtein )

◆ PG_FUNCTION_INFO_V1() [3/7]

PG_FUNCTION_INFO_V1 ( levenshtein_less_equal )

◆ PG_FUNCTION_INFO_V1() [4/7]

PG_FUNCTION_INFO_V1 ( levenshtein_less_equal_with_costs )

◆ PG_FUNCTION_INFO_V1() [5/7]

PG_FUNCTION_INFO_V1 ( levenshtein_with_costs )

◆ PG_FUNCTION_INFO_V1() [6/7]

PG_FUNCTION_INFO_V1 ( metaphone )

◆ PG_FUNCTION_INFO_V1() [7/7]

PG_FUNCTION_INFO_V1 ( soundex )

◆ soundex()

Datum soundex ( PG_FUNCTION_ARGS )

Definition at line 710 of file fuzzystrmatch.c.

{
    char        outstr[SOUNDEX_LEN + 1];
    char       *arg;
 
    arg = text_to_cstring(PG_GETARG_TEXT_PP(0));
 
    _soundex(arg, outstr);
 
    PG_RETURN_TEXT_P(cstring_to_text(outstr));
}

References _soundex(), arg, cstring_to_text(), PG_GETARG_TEXT_PP, PG_RETURN_TEXT_P, SOUNDEX_LEN, and text_to_cstring().

Referenced by daitch_mokotoff(), daitch_mokotoff_coding(), find_or_create_child_node(), update_leaves(), and update_node().

◆ soundex_code()

static char soundex_code ( char letter )

static

Definition at line 60 of file fuzzystrmatch.c.

{
    letter = toupper((unsigned char) letter);
    /* Defend against non-ASCII letters */
    if (letter >= 'A' && letter <= 'Z')
        return soundex_table[letter - 'A'];
    return letter;
}

References soundex_table.

Referenced by _soundex().

Variable Documentation

◆ _codes

const char _codes[26]

static

Initial value:

= {
    1, 16, 4, 16, 9, 2, 4, 16, 9, 2, 0, 2, 2, 2, 1, 4, 0, 2, 4, 4, 1, 0, 0, 0, 8, 0
 
}

Definition at line 114 of file fuzzystrmatch.c.

Referenced by getcode().

◆ PG_MODULE_MAGIC

PG_MODULE_MAGIC

Definition at line 47 of file fuzzystrmatch.c.

◆ soundex_table

const char* const soundex_table = "01230120022455012623010202"

static

Definition at line 57 of file fuzzystrmatch.c.

Referenced by soundex_code().

Macros

Functions

Variables

Macro Definition Documentation

◆ AFFECTH

◆ After_Next_Letter

◆ Curr_Letter

◆ End_Phoned_Word

◆ Isbreak

◆ isvowel

◆ Look_Ahead_Letter

◆ Look_Back_Letter

◆ MAKESOFT

◆ MAX_METAPHONE_STRLEN

◆ Next_Letter

◆ NOCHANGE

◆ NOGHTOF

◆ Phone_Len

◆ Phonize

◆ Prev_Letter

◆ SH

◆ SOUNDEX_LEN

◆ TH

Function Documentation

◆ _metaphone()

◆ _soundex()

◆ difference()

◆ getcode()

◆ levenshtein()

◆ levenshtein_less_equal()

◆ levenshtein_less_equal_with_costs()

◆ levenshtein_with_costs()

◆ Lookahead()

◆ metaphone()

◆ PG_FUNCTION_INFO_V1() [1/7]

◆ PG_FUNCTION_INFO_V1() [2/7]

◆ PG_FUNCTION_INFO_V1() [3/7]

◆ PG_FUNCTION_INFO_V1() [4/7]

◆ PG_FUNCTION_INFO_V1() [5/7]

◆ PG_FUNCTION_INFO_V1() [6/7]

◆ PG_FUNCTION_INFO_V1() [7/7]

◆ soundex()

◆ soundex_code()

Variable Documentation

◆ _codes

◆ PG_MODULE_MAGIC

◆ soundex_table