qskinny/inputcontext/QskPinyinCompositionModel.cpp

110 lines
2.9 KiB
C++
Raw Normal View History

2018-02-06 14:55:35 +01:00
/******************************************************************************
* QSkinny - Copyright (C) 2016 Uwe Rathmann
* This file may be used under the terms of the QSkinny License, Version 1.0
*****************************************************************************/
2017-07-21 18:21:34 +02:00
#include "QskPinyinCompositionModel.h"
2018-04-04 15:19:51 +02:00
#include "QskInputContext.h"
2017-07-21 18:21:34 +02:00
#include "pinyinime.h"
2017-07-21 18:21:34 +02:00
2018-04-01 12:47:44 +02:00
#include <QStringList>
2018-04-04 20:19:47 +02:00
#include <QDebug>
2017-07-21 18:21:34 +02:00
class QskPinyinCompositionModel::PrivateData
{
public:
2018-04-01 12:47:44 +02:00
QStringList candidates;
2017-07-21 18:21:34 +02:00
};
2018-04-04 15:19:51 +02:00
QskPinyinCompositionModel::QskPinyinCompositionModel( QskInputContext* context ):
Inherited( context ),
2017-07-21 18:21:34 +02:00
m_data( new PrivateData )
{
#if 1
const char dictionary[] = "XXX/3rdparty/pinyin/data/dict_pinyin.dat";
#endif
// ### prevent having 2 calls to im_open_decoder by using a singleton or so
bool opened = ime_pinyin::im_open_decoder( dictionary, "" );
if( !opened )
{
qWarning() << "could not open pinyin decoder dictionary at" << dictionary;
}
2017-07-21 18:21:34 +02:00
}
QskPinyinCompositionModel::~QskPinyinCompositionModel()
{
ime_pinyin::im_close_decoder();
2017-07-21 18:21:34 +02:00
}
bool QskPinyinCompositionModel::supportsSuggestions() const
2017-07-21 18:21:34 +02:00
{
return true;
2017-07-21 18:21:34 +02:00
}
int QskPinyinCompositionModel::candidateCount() const
2017-07-21 18:21:34 +02:00
{
2018-04-01 12:47:44 +02:00
return m_data->candidates.count();
}
2017-07-21 18:21:34 +02:00
QString QskPinyinCompositionModel::candidate( int index ) const
{
2018-04-01 12:47:44 +02:00
if ( ( index >= 0 ) && ( index < m_data->candidates.count() ) )
return m_data->candidates[ index ];
return QString();
2017-07-21 18:21:34 +02:00
}
bool QskPinyinCompositionModel::hasIntermediate() const
{
return m_data->candidates.count() > 0;
2017-07-21 18:21:34 +02:00
}
QString QskPinyinCompositionModel::polishPreedit( const QString& preedit )
{
if( preedit.isEmpty() )
2017-07-21 18:21:34 +02:00
{
ime_pinyin::im_reset_search();
2017-07-21 18:21:34 +02:00
}
QByteArray preeditBuffer = preedit.toLatin1();
size_t numSearchResults = ime_pinyin::im_search(
preeditBuffer.constData(), size_t( preeditBuffer.length() ) );
2017-07-21 18:21:34 +02:00
if( numSearchResults > 0 )
2017-07-21 18:21:34 +02:00
{
2018-04-01 12:47:44 +02:00
QStringList newCandidates;
newCandidates.reserve( 1 );
2017-07-21 18:21:34 +02:00
QVector< QChar > candidateBuffer;
candidateBuffer.resize( ime_pinyin::kMaxSearchSteps + 1 );
2017-07-21 18:21:34 +02:00
// ### numSearchResults is way too big, we should only do this for the first ten results or so
for( unsigned int a = 0; a < numSearchResults; a++ )
{
size_t length = static_cast< size_t >( candidateBuffer.length() - 1 );
bool getCandidate = ime_pinyin::im_get_candidate( a, reinterpret_cast< ime_pinyin::char16* >( candidateBuffer.data() ), length );
2017-07-21 18:21:34 +02:00
QString candidate;
2017-07-21 18:21:34 +02:00
if( getCandidate )
{
candidateBuffer.last() = 0;
candidate = QString( candidateBuffer.data() );
}
2017-07-21 18:21:34 +02:00
Qt::Key key = Qt::Key( candidate.at( 0 ).unicode() );
QString string = QChar( key );
newCandidates.append( string );
}
m_data->candidates = newCandidates;
Q_EMIT candidatesChanged();
2017-07-21 18:21:34 +02:00
}
return preedit;
2017-07-21 18:21:34 +02:00
}