/* 
 *  libpinyin
 *  Library to deal with pinyin.
 *  
 *  Copyright (C) 2016 Peng Wu <alexepico@gmail.com>
 *  
 *  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 3 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, see <http://www.gnu.org/licenses/>.
 */

#ifndef PHRASE_LARGE_TABLE3_H
#define PHRASE_LARGE_TABLE3_H

#include <stdio.h>
#include "novel_types.h"
#include "memory_chunk.h"
#include "pinyin_utils.h"

#ifdef HAVE_BERKELEY_DB
#include "phrase_large_table3_bdb.h"
#endif

#ifdef HAVE_KYOTO_CABINET
#include "phrase_large_table3_kyotodb.h"
#endif

#ifdef HAVE_TKRZW
#include "phrase_large_table3_tkrzwdb.h"
#endif

namespace pinyin{

/**
 * Data Structure:
 * m_chunk consists of array of tokens.
 */
class MaskOutVisitor;
class MaskOutProcessor;

class PhraseTableEntry{
    friend class PhraseLargeTable3;
    friend class MaskOutVisitor;
    friend class MaskOutProcessor;
protected:
    MemoryChunk m_chunk;

private:
    /* Disallow used outside. */
    PhraseTableEntry() {}

public:
    /* search method */
    int search(/* out */ PhraseTokens tokens) const;

    /* add_index/remove_index method */
    int add_index(/* in */ phrase_token_t token);
    int remove_index(/* in */ phrase_token_t token);

    /* get length method */
    int get_length() const;

    /* mask out method */
    bool mask_out(phrase_token_t mask, phrase_token_t value);
};


static inline int reduce_tokens(const PhraseTokens tokens,
                                TokenVector tokenarray,
                                bool validate = true) {
    int num = 0;
    g_array_set_size(tokenarray, 0);

    for (size_t i = 0; i < PHRASE_INDEX_LIBRARY_COUNT; ++i) {
        GArray * array = tokens[i];
        if (NULL == array)
            continue;

        num += array->len;

        g_array_append_vals(tokenarray, array->data, array->len);
    }

    /* the following lines will be removed in future after code are verified. */
    if (validate)
        assert(0 <= num && num <= 4);

    return num;
}

/* for compatibility. */
static inline int get_first_token(const PhraseTokens tokens,
                                  /* out */ phrase_token_t & token){
    token = null_token;

    TokenVector tokenarray = g_array_new(FALSE, FALSE, sizeof(phrase_token_t));
    int num = reduce_tokens(tokens, tokenarray);
    if (num)
        token = g_array_index(tokenarray, phrase_token_t, 0);
    g_array_free(tokenarray, TRUE);

    return num;
}


};

#endif
