forked from mia/Aegisub
104 lines
2.8 KiB
C++
104 lines
2.8 KiB
C++
// Copyright (c) 2006, Rodrigo Braz Monteiro
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
// * Neither the name of the TrayDict Group nor the names of its contributors
|
|
// may be used to endorse or promote products derived from this software
|
|
// without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
// POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// -----------------------------------------------------------------------------
|
|
//
|
|
// TRAYDICT
|
|
//
|
|
// Website: http://aegisub.cellosoft.com
|
|
// Contact: mailto:zeratul@cellosoft.com
|
|
//
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
///////////
|
|
// Headers
|
|
#include <list>
|
|
#include "kana_table.h"
|
|
|
|
|
|
//////////////////////////
|
|
// Dictionary entry class
|
|
class DictEntry {
|
|
public:
|
|
wxString english;
|
|
wxString kanji;
|
|
wxString kana;
|
|
wxString romaji;
|
|
|
|
void Compact();
|
|
};
|
|
|
|
|
|
///////////
|
|
// Results
|
|
class SearchResult {
|
|
public:
|
|
DictEntry *entry;
|
|
int relevance;
|
|
};
|
|
bool operator < (const SearchResult &a,const SearchResult &b);
|
|
|
|
|
|
//////////////
|
|
// Result set
|
|
class ResultSet {
|
|
public:
|
|
wxString query;
|
|
wxString dicName;
|
|
|
|
std::list<SearchResult> results;
|
|
bool ownData;
|
|
int time;
|
|
|
|
ResultSet();
|
|
~ResultSet();
|
|
};
|
|
|
|
|
|
////////////////////
|
|
// Dictionary class
|
|
class Dictionary {
|
|
private:
|
|
std::list<DictEntry> entries;
|
|
wxString dictFile;
|
|
wxString name;
|
|
|
|
public:
|
|
wxCheckBox *check;
|
|
static KanaTable kanatable;
|
|
static void Convert(wxString source,wxString dest);
|
|
|
|
void Load(wxString filename);
|
|
void Search(ResultSet &results,wxString query);
|
|
int GetRelevance(wxString substr,wxString str,bool isPop,bool english=false);
|
|
|
|
Dictionary(wxString name,wxCheckBox *check);
|
|
~Dictionary();
|
|
};
|