steminternal.h

Go to the documentation of this file.

/* Copyright (C) 2007,2009,2010,2016 Olly Betts
 * Copyright (C) 2010 Evgeny Sizikov
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
 */

#ifndef XAPIAN_INCLUDED_STEMINTERNAL_H
#define XAPIAN_INCLUDED_STEMINTERNAL_H

#include <xapian/stem.h>

#include "alignment_cast.h"

#include <cstdlib>
#include <string>

typedef unsigned char symbol;

#define HEAD (2 * sizeof(int))

typedef int (*among_function)(Xapian::StemImplementation *);

struct among {
    int s_size;         /* length of search string (in symbols) */
    unsigned s;         /* offset in pool to search string */
    int substring_i;    /* index to longest matching substring */
    int result;         /* result of the lookup */
};

inline void lose_s(symbol * p) {
    if (p) std::free(reinterpret_cast<char *>(p) - HEAD);
}

namespace Xapian {

class SnowballStemImplementation : public StemImplementation {
    int slice_check();

  protected:
    symbol * p;
    int c, l, lb, bra, ket;

    static int
    SIZE(const symbol* p)
    {
        return alignment_cast<const int *>(p)[-1];
    }

    static void
    SET_SIZE(symbol* p, int n)
    {
        alignment_cast<int *>(p)[-1] = n;
    }

    static int
    CAPACITY(const symbol* p)
    {
        return alignment_cast<const int *>(p)[-2];
    }

    static void
    SET_CAPACITY(symbol* p, int n)
    {
        alignment_cast<int *>(p)[-2] = n;
    }

    static int skip_utf8(const symbol * p, int c, int lb, int l, int n);

    static symbol * increase_size(symbol * p, int n);

    static symbol * create_s();

    int get_utf8(int * slot);
    int get_b_utf8(int * slot);

    int in_grouping_U(const unsigned char * s, int min, int max, int repeat);
    int in_grouping_b_U(const unsigned char * s, int min, int max, int repeat);
    int out_grouping_U(const unsigned char * s, int min, int max, int repeat);
    int out_grouping_b_U(const unsigned char * s, int min, int max, int repeat);

    int eq_s(int s_size, const symbol * s);
    int eq_s_b(int s_size, const symbol * s);
    int eq_v(const symbol * v) { return eq_s(SIZE(v), v); }
    int eq_v_b(const symbol * v) { return eq_s_b(SIZE(v), v); }

    int find_among(const symbol *pool, const struct among * v, int v_size,
                   const unsigned char * fnum, const among_function * f);
    int find_among_b(const symbol *pool, const struct among * v, int v_size,
                     const unsigned char * fnum, const among_function * f);

    int replace_s(int c_bra, int c_ket, int s_size, const symbol * s);
    int slice_from_s(int s_size, const symbol * s);
    int slice_from_v(const symbol * v) { return slice_from_s(SIZE(v), v); }

    int slice_del() { return slice_from_s(0, 0); }

    void insert_s(int c_bra, int c_ket, int s_size, const symbol * s);
    void insert_v(int c_bra, int c_ket, const symbol * v) {
        insert_s(c_bra, c_ket, SIZE(v), v);
    }

    symbol * slice_to(symbol * v);
    symbol * assign_to(symbol * v);

    int len_utf8(const symbol * v);

#if 0
    void debug(int number, int line_count);
#endif

  public:
    SnowballStemImplementation()
        : p(create_s()), c(0), l(0), lb(0), bra(0), ket(0) { }

    virtual ~SnowballStemImplementation();

    virtual std::string operator()(const std::string & word);

    virtual int stem() = 0;
};

}

#endif // XAPIAN_INCLUDED_STEMINTERNAL_H