<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en_US" xml:lang="en_US">
<head>
<title>kspell2: lookup.cpp Source File (kspell2)</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta http-equiv="Content-Style-Type" content="text/css" />
<meta http-equiv="pics-label" content='(pics-1.1 "http://www.icra.org/ratingsv02.html" comment "ICRAonline DE v2.0" l gen true for "http://www.kde.org" r (nz 1 vz 1 lz 1 oz 1 cb 1) "http://www.rsac.org/ratingsv01.html" l gen true for "http://www.kde.org" r (n 0 s 0 v 0 l 0))' />
<meta name="trademark" content="KDE e.V." />
<meta name="description" content="K Desktop Environment Homepage, KDE.org" />
<meta name="MSSmartTagsPreventParsing" content="true" />
<meta name="robots" content="all" />
<link rel="shortcut icon" href="../../favicon.ico" />
<link rel="stylesheet" media="screen" type="text/css" title="APIDOX" href="doxygen.css" />
</head>
<body>
<div id="nav_header_top" align="right">
<a href="#content" class="doNotDisplay" accesskey="2">Skip to main content ::</a>
<a href="../.."><img id="nav_header_logo" alt="Home" align="left" src="../../kde_gear_64.png" border="0" /></a>
<span class="doNotDisplay">::</span>
<div id="nav_header_title" align="left">KDE API Reference</div>
</div>
<div id="nav_header_bottom" align="right">
<span class="doNotDisplay">:: <a href="#navigation" accesskey="5">Skip to Link Menu</a><br/></span>
<div id="nav_header_bottom_right" style="text-align: left;">
/ <a href="../..">API Reference</a>
/ <a href=".">kspell2</a>
</div>
</div>
<table id="main" border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td valign="top" class="menuheader" height="0"></td>
<td id="contentcolumn" valign="top" rowspan="2" >
<div id="content" style="padding-top: 0px;"><div style="width:100%; margin: 0px; padding: 0px;">
<a name="content"></a>
<!-- Generated by Doxygen 1.4.4 -->
<div class="nav">
<a class="el" href="dir_000000.html">kspell2</a> » <a class="el" href="dir_000002.html">plugins</a> » <a class="el" href="dir_000003.html">ispell</a></div>
<h1>lookup.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* vim: set sw=8: -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* kspell2 - adopted from enchant</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 2003 Dom Lachowicz</span>
<a name="l00004"></a>00004 <span class="comment"> * Copyright (C) 2004 Zack Rusin <zack@kde.org></span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00008"></a>00008 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00009"></a>00009 <span class="comment"> * version 2.1 of the License, or (at your option) any later version.</span>
<a name="l00010"></a>00010 <span class="comment"> *</span>
<a name="l00011"></a>00011 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU Lesser General Public</span>
<a name="l00017"></a>00017 <span class="comment"> * License along with this library; if not, write to the</span>
<a name="l00018"></a>00018 <span class="comment"> * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,</span>
<a name="l00019"></a>00019 <span class="comment"> * Boston, MA 02110-1301, USA.</span>
<a name="l00020"></a>00020 <span class="comment"> *</span>
<a name="l00021"></a>00021 <span class="comment"> * In addition, as a special exception, Dom Lachowicz</span>
<a name="l00022"></a>00022 <span class="comment"> * gives permission to link the code of this program with</span>
<a name="l00023"></a>00023 <span class="comment"> * non-LGPL Spelling Provider libraries (eg: a MSFT Office</span>
<a name="l00024"></a>00024 <span class="comment"> * spell checker backend) and distribute linked combinations including</span>
<a name="l00025"></a>00025 <span class="comment"> * the two. You must obey the GNU General Public License in all</span>
<a name="l00026"></a>00026 <span class="comment"> * respects for all of the code used other than said providers. If you modify</span>
<a name="l00027"></a>00027 <span class="comment"> * this file, you may extend this exception to your version of the</span>
<a name="l00028"></a>00028 <span class="comment"> * file, but you are not obligated to do so. If you do not wish to</span>
<a name="l00029"></a>00029 <span class="comment"> * do so, delete this exception statement from your version.</span>
<a name="l00030"></a>00030 <span class="comment"> */</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="comment">/*</span>
<a name="l00033"></a>00033 <span class="comment"> * lookup.c - see if a word appears in the dictionary</span>
<a name="l00034"></a>00034 <span class="comment"> *</span>
<a name="l00035"></a>00035 <span class="comment"> * Pace Willisson, 1983</span>
<a name="l00036"></a>00036 <span class="comment"> *</span>
<a name="l00037"></a>00037 <span class="comment"> * Copyright 1987, 1988, 1989, 1992, 1993, Geoff Kuenning, Granada Hills, CA</span>
<a name="l00038"></a>00038 <span class="comment"> * All rights reserved.</span>
<a name="l00039"></a>00039 <span class="comment"> *</span>
<a name="l00040"></a>00040 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00041"></a>00041 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00042"></a>00042 <span class="comment"> * are met:</span>
<a name="l00043"></a>00043 <span class="comment"> *</span>
<a name="l00044"></a>00044 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00045"></a>00045 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span>
<a name="l00046"></a>00046 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00047"></a>00047 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span>
<a name="l00048"></a>00048 <span class="comment"> * documentation and/or other materials provided with the distribution.</span>
<a name="l00049"></a>00049 <span class="comment"> * 3. All modifications to the source code must be clearly marked as</span>
<a name="l00050"></a>00050 <span class="comment"> * such. Binary redistributions based on modified source code</span>
<a name="l00051"></a>00051 <span class="comment"> * must be clearly marked as modified versions in the documentation</span>
<a name="l00052"></a>00052 <span class="comment"> * and/or other materials provided with the distribution.</span>
<a name="l00053"></a>00053 <span class="comment"> * 4. All advertising materials mentioning features or use of this software</span>
<a name="l00054"></a>00054 <span class="comment"> * must display the following acknowledgment:</span>
<a name="l00055"></a>00055 <span class="comment"> * This product includes software developed by Geoff Kuenning and</span>
<a name="l00056"></a>00056 <span class="comment"> * other unpaid contributors.</span>
<a name="l00057"></a>00057 <span class="comment"> * 5. The name of Geoff Kuenning may not be used to endorse or promote</span>
<a name="l00058"></a>00058 <span class="comment"> * products derived from this software without specific prior</span>
<a name="l00059"></a>00059 <span class="comment"> * written permission.</span>
<a name="l00060"></a>00060 <span class="comment"> *</span>
<a name="l00061"></a>00061 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS IS'' AND</span>
<a name="l00062"></a>00062 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span>
<a name="l00063"></a>00063 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span>
<a name="l00064"></a>00064 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL GEOFF KUENNING OR CONTRIBUTORS BE LIABLE</span>
<a name="l00065"></a>00065 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span>
<a name="l00066"></a>00066 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span>
<a name="l00067"></a>00067 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span>
<a name="l00068"></a>00068 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span>
<a name="l00069"></a>00069 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span>
<a name="l00070"></a>00070 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span>
<a name="l00071"></a>00071 <span class="comment"> * SUCH DAMAGE.</span>
<a name="l00072"></a>00072 <span class="comment"> */</span>
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="comment">/*</span>
<a name="l00075"></a>00075 <span class="comment"> * $Log$</span>
<a name="l00076"></a>00076 <span class="comment"> * Revision 1.1 2004/01/31 16:44:12 zrusin</span>
<a name="l00077"></a>00077 <span class="comment"> * ISpell plugin.</span>
<a name="l00078"></a>00078 <span class="comment"> *</span>
<a name="l00079"></a>00079 <span class="comment"> * Revision 1.7 2003/09/25 02:44:48 dom</span>
<a name="l00080"></a>00080 <span class="comment"> * bug 5813</span>
<a name="l00081"></a>00081 <span class="comment"> *</span>
<a name="l00082"></a>00082 <span class="comment"> * Revision 1.6 2003/08/26 13:20:40 dom</span>
<a name="l00083"></a>00083 <span class="comment"> * ispell crasher fix, implement enchant_dictionary_release</span>
<a name="l00084"></a>00084 <span class="comment"> *</span>
<a name="l00085"></a>00085 <span class="comment"> * Revision 1.5 2003/08/26 13:08:03 uwog</span>
<a name="l00086"></a>00086 <span class="comment"> * Fix segfault when the requested dictionary couldn't be found.</span>
<a name="l00087"></a>00087 <span class="comment"> *</span>
<a name="l00088"></a>00088 <span class="comment"> * Revision 1.4 2003/08/14 16:27:36 dom</span>
<a name="l00089"></a>00089 <span class="comment"> * update some documentation</span>
<a name="l00090"></a>00090 <span class="comment"> *</span>
<a name="l00091"></a>00091 <span class="comment"> * Revision 1.3 2003/07/28 20:40:27 dom</span>
<a name="l00092"></a>00092 <span class="comment"> * fix up the license clause, further win32-registry proof some directory getting functions</span>
<a name="l00093"></a>00093 <span class="comment"> *</span>
<a name="l00094"></a>00094 <span class="comment"> * Revision 1.2 2003/07/16 22:52:47 dom</span>
<a name="l00095"></a>00095 <span class="comment"> * LGPL + exception license</span>
<a name="l00096"></a>00096 <span class="comment"> *</span>
<a name="l00097"></a>00097 <span class="comment"> * Revision 1.1 2003/07/15 01:15:07 dom</span>
<a name="l00098"></a>00098 <span class="comment"> * ispell enchant backend</span>
<a name="l00099"></a>00099 <span class="comment"> *</span>
<a name="l00100"></a>00100 <span class="comment"> * Revision 1.3 2003/01/29 05:50:12 hippietrail</span>
<a name="l00101"></a>00101 <span class="comment"> *</span>
<a name="l00102"></a>00102 <span class="comment"> * Fixed my mess in EncodingManager.</span>
<a name="l00103"></a>00103 <span class="comment"> * Changed many C casts to C++ casts.</span>
<a name="l00104"></a>00104 <span class="comment"> *</span>
<a name="l00105"></a>00105 <span class="comment"> * Revision 1.2 2003/01/25 03:16:05 hippietrail</span>
<a name="l00106"></a>00106 <span class="comment"> *</span>
<a name="l00107"></a>00107 <span class="comment"> * An UT_ICONV_INVALID fix which escaped the last commit.</span>
<a name="l00108"></a>00108 <span class="comment"> *</span>
<a name="l00109"></a>00109 <span class="comment"> * Revision 1.1 2003/01/24 05:52:34 hippietrail</span>
<a name="l00110"></a>00110 <span class="comment"> *</span>
<a name="l00111"></a>00111 <span class="comment"> * Refactored ispell code. Old ispell global variables had been put into</span>
<a name="l00112"></a>00112 <span class="comment"> * an allocated structure, a pointer to which was passed to many functions.</span>
<a name="l00113"></a>00113 <span class="comment"> * I have now made all such functions and variables private members of the</span>
<a name="l00114"></a>00114 <span class="comment"> * ISpellChecker class. It was C OO, now it's C++ OO.</span>
<a name="l00115"></a>00115 <span class="comment"> *</span>
<a name="l00116"></a>00116 <span class="comment"> * I've fixed the makefiles and tested compilation but am unable to test</span>
<a name="l00117"></a>00117 <span class="comment"> * operation. Please back out my changes if they cause problems which</span>
<a name="l00118"></a>00118 <span class="comment"> * are not obvious or easy to fix.</span>
<a name="l00119"></a>00119 <span class="comment"> *</span>
<a name="l00120"></a>00120 <span class="comment"> * Revision 1.12 2003/01/06 18:48:39 dom</span>
<a name="l00121"></a>00121 <span class="comment"> * ispell cleanup, start of using new 'add' save features</span>
<a name="l00122"></a>00122 <span class="comment"> *</span>
<a name="l00123"></a>00123 <span class="comment"> * Revision 1.11 2002/09/19 05:31:17 hippietrail</span>
<a name="l00124"></a>00124 <span class="comment"> *</span>
<a name="l00125"></a>00125 <span class="comment"> * More Ispell cleanup. Conditional globals and DEREF macros are removed.</span>
<a name="l00126"></a>00126 <span class="comment"> * K&R function declarations removed, converted to Doxygen style comments</span>
<a name="l00127"></a>00127 <span class="comment"> * where possible. No code has been changed (I hope). Compiles for me but</span>
<a name="l00128"></a>00128 <span class="comment"> * unable to test.</span>
<a name="l00129"></a>00129 <span class="comment"> *</span>
<a name="l00130"></a>00130 <span class="comment"> * Revision 1.10 2002/09/17 03:03:30 hippietrail</span>
<a name="l00131"></a>00131 <span class="comment"> *</span>
<a name="l00132"></a>00132 <span class="comment"> * After seeking permission on the developer list I've reformatted all the</span>
<a name="l00133"></a>00133 <span class="comment"> * spelling source which seemed to have parts which used 2, 3, 4, and 8</span>
<a name="l00134"></a>00134 <span class="comment"> * spaces for tabs. It should all look good with our standard 4-space</span>
<a name="l00135"></a>00135 <span class="comment"> * tabs now.</span>
<a name="l00136"></a>00136 <span class="comment"> * I've concentrated just on indentation in the actual code. More prettying</span>
<a name="l00137"></a>00137 <span class="comment"> * could be done.</span>
<a name="l00138"></a>00138 <span class="comment"> * * NO code changes were made *</span>
<a name="l00139"></a>00139 <span class="comment"> *</span>
<a name="l00140"></a>00140 <span class="comment"> * Revision 1.9 2002/09/13 17:20:13 mpritchett</span>
<a name="l00141"></a>00141 <span class="comment"> * Fix more warnings for Linux build</span>
<a name="l00142"></a>00142 <span class="comment"> *</span>
<a name="l00143"></a>00143 <span class="comment"> * Revision 1.8 2002/05/03 09:49:43 fjfranklin</span>
<a name="l00144"></a>00144 <span class="comment"> * o hash downloader update (Gabriel Gerhardsson)</span>
<a name="l00145"></a>00145 <span class="comment"> * - Comment out the "Can't open <dictionary>" printf.</span>
<a name="l00146"></a>00146 <span class="comment"> * - Make the progressbar more clean at the begining of the download.</span>
<a name="l00147"></a>00147 <span class="comment"> * - Add support for tarballs that doesn't have the full path included</span>
<a name="l00148"></a>00148 <span class="comment"> * - Fix copyright headers on the newly added files (*HashDownloader.*)</span>
<a name="l00149"></a>00149 <span class="comment"> *</span>
<a name="l00150"></a>00150 <span class="comment"> * Revision 1.7 2001/08/27 19:06:30 dom</span>
<a name="l00151"></a>00151 <span class="comment"> * Lots of compilation fixes</span>
<a name="l00152"></a>00152 <span class="comment"> *</span>
<a name="l00153"></a>00153 <span class="comment"> * Revision 1.6 2001/08/10 18:32:40 dom</span>
<a name="l00154"></a>00154 <span class="comment"> * Spelling and iconv updates. god, i hate iconv</span>
<a name="l00155"></a>00155 <span class="comment"> *</span>
<a name="l00156"></a>00156 <span class="comment"> * Revision 1.5 2001/08/10 09:57:49 hub</span>
<a name="l00157"></a>00157 <span class="comment"> * Patch by sobomax@FreeBSD.org</span>
<a name="l00158"></a>00158 <span class="comment"> * #include "iconv.h" directive is missed from src/other/spell/xp/lookup.c and</span>
<a name="l00159"></a>00159 <span class="comment"> * src/wp/impexp/xp/ie_imp_RTF.cpp.</span>
<a name="l00160"></a>00160 <span class="comment"> * See bug 1823</span>
<a name="l00161"></a>00161 <span class="comment"> *</span>
<a name="l00162"></a>00162 <span class="comment"> * Revision 1.4 2001/07/18 17:46:01 dom</span>
<a name="l00163"></a>00163 <span class="comment"> * Module changes, and fix compiler warnings</span>
<a name="l00164"></a>00164 <span class="comment"> *</span>
<a name="l00165"></a>00165 <span class="comment"> * Revision 1.3 2001/06/12 21:32:49 dom</span>
<a name="l00166"></a>00166 <span class="comment"> * More ispell work...</span>
<a name="l00167"></a>00167 <span class="comment"> *</span>
<a name="l00168"></a>00168 <span class="comment"> * Revision 1.2 2001/05/12 16:05:42 thomasf</span>
<a name="l00169"></a>00169 <span class="comment"> * Big pseudo changes to ispell to make it pass around a structure rather</span>
<a name="l00170"></a>00170 <span class="comment"> * than rely on all sorts of gloabals willy nilly here and there. Also</span>
<a name="l00171"></a>00171 <span class="comment"> * fixed our spelling class to work with accepting suggestions once more.</span>
<a name="l00172"></a>00172 <span class="comment"> * This code is dirty, gross and ugly (not to mention still not supporting</span>
<a name="l00173"></a>00173 <span class="comment"> * multiple hash sized just yet) but it works on my machine and will no</span>
<a name="l00174"></a>00174 <span class="comment"> * doubt break other machines.</span>
<a name="l00175"></a>00175 <span class="comment"> *</span>
<a name="l00176"></a>00176 <span class="comment"> * Revision 1.1 2001/04/15 16:01:24 tomas_f</span>
<a name="l00177"></a>00177 <span class="comment"> * moving to spell/xp</span>
<a name="l00178"></a>00178 <span class="comment"> *</span>
<a name="l00179"></a>00179 <span class="comment"> * Revision 1.7 1999/09/29 23:33:32 justin</span>
<a name="l00180"></a>00180 <span class="comment"> * Updates to the underlying ispell-based code to support suggested corrections.</span>
<a name="l00181"></a>00181 <span class="comment"> *</span>
<a name="l00182"></a>00182 <span class="comment"> * Revision 1.6 1999/04/13 17:12:51 jeff</span>
<a name="l00183"></a>00183 <span class="comment"> * Applied "Darren O. Benham" <gecko@benham.net> spell check changes.</span>
<a name="l00184"></a>00184 <span class="comment"> * Fixed crash on Win32 with the new code.</span>
<a name="l00185"></a>00185 <span class="comment"> *</span>
<a name="l00186"></a>00186 <span class="comment"> * Revision 1.5 1999/01/07 01:07:48 paul</span>
<a name="l00187"></a>00187 <span class="comment"> * Fixed spell leaks.</span>
<a name="l00188"></a>00188 <span class="comment"> *</span>
<a name="l00189"></a>00189 <span class="comment"> * Revision 1.5 1999/01/07 01:07:48 paul</span>
<a name="l00190"></a>00190 <span class="comment"> * Fixed spell leaks.</span>
<a name="l00191"></a>00191 <span class="comment"> *</span>
<a name="l00192"></a>00192 <span class="comment"> * Revision 1.4 1998/12/29 14:55:33 eric</span>
<a name="l00193"></a>00193 <span class="comment"> *</span>
<a name="l00194"></a>00194 <span class="comment"> * I've doctored the ispell code pretty extensively here. It is now</span>
<a name="l00195"></a>00195 <span class="comment"> * warning-free on Win32. It also *works* on Win32 now, since I</span>
<a name="l00196"></a>00196 <span class="comment"> * replaced all the I/O calls with ANSI standard ones.</span>
<a name="l00197"></a>00197 <span class="comment"> *</span>
<a name="l00198"></a>00198 <span class="comment"> * Revision 1.3 1998/12/28 23:11:30 eric</span>
<a name="l00199"></a>00199 <span class="comment"> *</span>
<a name="l00200"></a>00200 <span class="comment"> * modified spell code and integration to build on Windows.</span>
<a name="l00201"></a>00201 <span class="comment"> * This is still a hack.</span>
<a name="l00202"></a>00202 <span class="comment"> *</span>
<a name="l00203"></a>00203 <span class="comment"> * Actually, it doesn't yet WORK on Windows. It just builds.</span>
<a name="l00204"></a>00204 <span class="comment"> * SpellCheckInit is failing for some reason.</span>
<a name="l00205"></a>00205 <span class="comment"> *</span>
<a name="l00206"></a>00206 <span class="comment"> * Revision 1.2 1998/12/28 22:16:22 eric</span>
<a name="l00207"></a>00207 <span class="comment"> *</span>
<a name="l00208"></a>00208 <span class="comment"> * These changes begin to incorporate the spell checker into AbiWord. Most</span>
<a name="l00209"></a>00209 <span class="comment"> * of this is a hack.</span>
<a name="l00210"></a>00210 <span class="comment"> *</span>
<a name="l00211"></a>00211 <span class="comment"> * 1. added other/spell to the -I list in config/abi_defs</span>
<a name="l00212"></a>00212 <span class="comment"> * 2. replaced other/spell/Makefile with one which is more like</span>
<a name="l00213"></a>00213 <span class="comment"> * our build system.</span>
<a name="l00214"></a>00214 <span class="comment"> * 3. added other/spell to other/Makefile so that the build will now</span>
<a name="l00215"></a>00215 <span class="comment"> * dive down and build the spell check library.</span>
<a name="l00216"></a>00216 <span class="comment"> * 4. added the AbiSpell library to the Makefiles in wp/main</span>
<a name="l00217"></a>00217 <span class="comment"> * 5. added a call to SpellCheckInit in wp/main/unix/UnixMain.cpp.</span>
<a name="l00218"></a>00218 <span class="comment"> * This call is a HACK and should be replaced with something</span>
<a name="l00219"></a>00219 <span class="comment"> * proper later.</span>
<a name="l00220"></a>00220 <span class="comment"> * 6. added code to fv_View.cpp as follows:</span>
<a name="l00221"></a>00221 <span class="comment"> * whenever you double-click on a word, the spell checker</span>
<a name="l00222"></a>00222 <span class="comment"> * verifies that word and prints its status to stdout.</span>
<a name="l00223"></a>00223 <span class="comment"> *</span>
<a name="l00224"></a>00224 <span class="comment"> * Caveats:</span>
<a name="l00225"></a>00225 <span class="comment"> * 1. This will break the Windows build. I'm going to work on fixing it</span>
<a name="l00226"></a>00226 <span class="comment"> * now.</span>
<a name="l00227"></a>00227 <span class="comment"> * 2. This only works if your dictionary is in /usr/lib/ispell/american.hash.</span>
<a name="l00228"></a>00228 <span class="comment"> * The dictionary location is currently hard-coded. This will be</span>
<a name="l00229"></a>00229 <span class="comment"> * fixed as well.</span>
<a name="l00230"></a>00230 <span class="comment"> *</span>
<a name="l00231"></a>00231 <span class="comment"> * Anyway, such as it is, it works.</span>
<a name="l00232"></a>00232 <span class="comment"> *</span>
<a name="l00233"></a>00233 <span class="comment"> * Revision 1.1 1998/12/28 18:04:43 davet</span>
<a name="l00234"></a>00234 <span class="comment"> * Spell checker code stripped from ispell. At this point, there are</span>
<a name="l00235"></a>00235 <span class="comment"> * two external routines... the Init routine, and a check-a-word routine</span>
<a name="l00236"></a>00236 <span class="comment"> * which returns a boolean value, and takes a 16 bit char string.</span>
<a name="l00237"></a>00237 <span class="comment"> * The code resembles the ispell code as much as possible still.</span>
<a name="l00238"></a>00238 <span class="comment"> *</span>
<a name="l00239"></a>00239 <span class="comment"> * Revision 1.42 1995/01/08 23:23:42 geoff</span>
<a name="l00240"></a>00240 <span class="comment"> * Support MSDOS_BINARY_OPEN when opening the hash file to read it in.</span>
<a name="l00241"></a>00241 <span class="comment"> *</span>
<a name="l00242"></a>00242 <span class="comment"> * Revision 1.41 1994/01/25 07:11:51 geoff</span>
<a name="l00243"></a>00243 <span class="comment"> * Get rid of all old RCS log lines in preparation for the 3.1 release.</span>
<a name="l00244"></a>00244 <span class="comment"> *</span>
<a name="l00245"></a>00245 <span class="comment"> */</span>
<a name="l00246"></a>00246
<a name="l00247"></a>00247 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00248"></a>00248 <span class="preprocessor">#include <string.h></span>
<a name="l00249"></a>00249 <span class="preprocessor">#include <ctype.h></span>
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="preprocessor">#include "ispell_checker.h"</span>
<a name="l00252"></a>00252 <span class="preprocessor">#include "msgs.h"</span>
<a name="l00253"></a>00253
<a name="l00254"></a>00254 <span class="preprocessor">#ifdef INDEXDUMP</span>
<a name="l00255"></a>00255 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span> dumpindex P ((<span class="keyword">struct</span> <a class="code" href="structflagptr.html">flagptr</a> * indexp, <span class="keywordtype">int</span> depth));
<a name="l00256"></a>00256 <span class="preprocessor">#endif </span><span class="comment">/* INDEXDUMP */</span>
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keywordtype">int</span> gnMaskBits = 64;
<a name="l00259"></a>00259
<a name="l00265"></a>00265 <span class="keywordtype">int</span> ISpellChecker::linit (<span class="keywordtype">char</span> *hashname)
<a name="l00266"></a>00266 {
<a name="l00267"></a>00267 FILE* fpHash;
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00270"></a>00270 <span class="keyword">register</span> <span class="keyword">struct </span><a class="code" href="structdent.html">dent</a> * dp;
<a name="l00271"></a>00271 <span class="keyword">struct </span><a class="code" href="structflagent.html">flagent</a> * entry;
<a name="l00272"></a>00272 <span class="keyword">struct </span><a class="code" href="structflagptr.html">flagptr</a> * ind;
<a name="l00273"></a>00273 <span class="keywordtype">int</span> nextchar, x;
<a name="l00274"></a>00274 <span class="keywordtype">int</span> viazero;
<a name="l00275"></a>00275 <span class="keyword">register</span> ichar_t * cp;
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keywordflow">if</span> ((fpHash = fopen (hashname, <span class="stringliteral">"rb"</span>)) == NULL)
<a name="l00278"></a>00278 {
<a name="l00279"></a>00279 <span class="keywordflow">return</span> (-1);
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00282"></a>00282 m_hashsize = fread (reinterpret_cast<char *>(&m_hashheader), 1, <span class="keyword">sizeof</span> m_hashheader, fpHash);
<a name="l00283"></a>00283 <span class="keywordflow">if</span> (m_hashsize < static_cast<int>(<span class="keyword">sizeof</span>(m_hashheader)))
<a name="l00284"></a>00284 {
<a name="l00285"></a>00285 <span class="keywordflow">if</span> (m_hashsize < 0)
<a name="l00286"></a>00286 fprintf (stderr, LOOKUP_C_CANT_READ, hashname);
<a name="l00287"></a>00287 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_hashsize == 0)
<a name="l00288"></a>00288 fprintf (stderr, LOOKUP_C_NULL_HASH, hashname);
<a name="l00289"></a>00289 <span class="keywordflow">else</span>
<a name="l00290"></a>00290 fprintf (stderr,
<a name="l00291"></a>00291 LOOKUP_C_SHORT_HASH (m_hashname, m_hashsize,
<a name="l00292"></a>00292 static_cast<int>(<span class="keyword">sizeof</span> m_hashheader)));
<a name="l00293"></a>00293 <span class="keywordflow">return</span> (-1);
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_hashheader.magic != MAGIC)
<a name="l00296"></a>00296 {
<a name="l00297"></a>00297 fprintf (stderr,
<a name="l00298"></a>00298 LOOKUP_C_BAD_MAGIC (hashname, static_cast<unsigned int>(MAGIC),
<a name="l00299"></a>00299 static_cast<unsigned int>(m_hashheader.magic)));
<a name="l00300"></a>00300 <span class="keywordflow">return</span> (-1);
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_hashheader.magic2 != MAGIC)
<a name="l00303"></a>00303 {
<a name="l00304"></a>00304 fprintf (stderr,
<a name="l00305"></a>00305 LOOKUP_C_BAD_MAGIC2 (hashname, static_cast<unsigned int>(MAGIC),
<a name="l00306"></a>00306 static_cast<unsigned int>(m_hashheader.magic2)));
<a name="l00307"></a>00307 <span class="keywordflow">return</span> (-1);
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309 <span class="comment">/* else if (hashheader.compileoptions != COMPILEOPTIONS*/</span>
<a name="l00310"></a>00310 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( 1 != 1
<a name="l00311"></a>00311 || m_hashheader.maxstringchars != MAXSTRINGCHARS
<a name="l00312"></a>00312 || m_hashheader.maxstringcharlen != MAXSTRINGCHARLEN)
<a name="l00313"></a>00313 {
<a name="l00314"></a>00314 fprintf (stderr,
<a name="l00315"></a>00315 LOOKUP_C_BAD_OPTIONS (static_cast<unsigned int>(m_hashheader.compileoptions),
<a name="l00316"></a>00316 m_hashheader.maxstringchars, m_hashheader.maxstringcharlen,
<a name="l00317"></a>00317 static_cast<unsigned int>(COMPILEOPTIONS), MAXSTRINGCHARS, MAXSTRINGCHARLEN));
<a name="l00318"></a>00318 <span class="keywordflow">return</span> (-1);
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320
<a name="l00321"></a>00321 {
<a name="l00322"></a>00322 m_hashtbl =
<a name="l00323"></a>00323 (<span class="keyword">struct </span><a class="code" href="structdent.html">dent</a> *)
<a name="l00324"></a>00324 calloc (static_cast<unsigned>(m_hashheader.tblsize), sizeof (<span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a>));
<a name="l00325"></a>00325 m_hashsize = m_hashheader.tblsize;
<a name="l00326"></a>00326 m_hashstrings = static_cast<char *>(malloc(static_cast<unsigned>(m_hashheader.stringsize)));
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328 m_numsflags = m_hashheader.stblsize;
<a name="l00329"></a>00329 m_numpflags = m_hashheader.ptblsize;
<a name="l00330"></a>00330 m_sflaglist = (<span class="keyword">struct </span><a class="code" href="structflagent.html">flagent</a> *)
<a name="l00331"></a>00331 malloc ((m_numsflags + m_numpflags) * <span class="keyword">sizeof</span> (<span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a>));
<a name="l00332"></a>00332 <span class="keywordflow">if</span> (m_hashtbl == NULL || m_hashstrings == NULL || m_sflaglist == NULL)
<a name="l00333"></a>00333 {
<a name="l00334"></a>00334 fprintf (stderr, LOOKUP_C_NO_HASH_SPACE);
<a name="l00335"></a>00335 <span class="keywordflow">return</span> (-1);
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337 m_pflaglist = m_sflaglist + m_numsflags;
<a name="l00338"></a>00338
<a name="l00339"></a>00339 {
<a name="l00340"></a>00340 <span class="keywordflow">if</span>( fread ( m_hashstrings, 1, static_cast<unsigned>(m_hashheader.stringsize), fpHash)
<a name="l00341"></a>00341 != static_cast<size_t>(m_hashheader.stringsize) )
<a name="l00342"></a>00342 {
<a name="l00343"></a>00343 fprintf (stderr, LOOKUP_C_BAD_FORMAT);
<a name="l00344"></a>00344 fprintf (stderr, <span class="stringliteral">"stringsize err\n"</span> );
<a name="l00345"></a>00345 <span class="keywordflow">return</span> (-1);
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347 <span class="keywordflow">if</span> ( m_hashheader.compileoptions & 0x04 )
<a name="l00348"></a>00348 {
<a name="l00349"></a>00349 <span class="keywordflow">if</span>( fread (reinterpret_cast<char *>(m_hashtbl), 1, static_cast<unsigned>(m_hashheader.tblsize) * <span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a>), fpHash)
<a name="l00350"></a>00350 != (static_cast<size_t>(m_hashheader.tblsize * <span class="keyword">sizeof</span> (<span class="keyword">struct </span><a class="code" href="structdent.html">dent</a>))))
<a name="l00351"></a>00351 {
<a name="l00352"></a>00352 fprintf (stderr, LOOKUP_C_BAD_FORMAT);
<a name="l00353"></a>00353 <span class="keywordflow">return</span> (-1);
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356 <span class="keywordflow">else</span>
<a name="l00357"></a>00357 {
<a name="l00358"></a>00358 <span class="keywordflow">for</span>( x=0; x<m_hashheader.tblsize; x++ )
<a name="l00359"></a>00359 {
<a name="l00360"></a>00360 <span class="keywordflow">if</span>( fread ( reinterpret_cast<char*>(m_hashtbl+x), <span class="keyword">sizeof</span>( <span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a>)-<span class="keyword">sizeof</span>( MASKTYPE ), 1, fpHash)
<a name="l00361"></a>00361 != 1)
<a name="l00362"></a>00362 {
<a name="l00363"></a>00363 fprintf (stderr, LOOKUP_C_BAD_FORMAT);
<a name="l00364"></a>00364 <span class="keywordflow">return</span> (-1);
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366 } <span class="comment">/*for*/</span>
<a name="l00367"></a>00367 } <span class="comment">/*else*/</span>
<a name="l00368"></a>00368 }
<a name="l00369"></a>00369 <span class="keywordflow">if</span> (fread (reinterpret_cast<char *>(m_sflaglist), 1,
<a name="l00370"></a>00370 static_cast<unsigned>(m_numsflags+ m_numpflags) * <span class="keyword">sizeof</span> (<span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a>), fpHash)
<a name="l00371"></a>00371 != (m_numsflags + m_numpflags) * <span class="keyword">sizeof</span> (<span class="keyword">struct</span> flagent))
<a name="l00372"></a>00372 {
<a name="l00373"></a>00373 fprintf (stderr, LOOKUP_C_BAD_FORMAT);
<a name="l00374"></a>00374 <span class="keywordflow">return</span> (-1);
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376 fclose (fpHash);
<a name="l00377"></a>00377
<a name="l00378"></a>00378 {
<a name="l00379"></a>00379 <span class="keywordflow">for</span> (i = m_hashsize, dp = m_hashtbl; --i >= 0; dp++)
<a name="l00380"></a>00380 {
<a name="l00381"></a>00381 <span class="keywordflow">if</span> (dp-><a class="code" href="structdent.html#o1">word</a> == (<span class="keywordtype">char</span> *) -1)
<a name="l00382"></a>00382 dp-><a class="code" href="structdent.html#o1">word</a> = NULL;
<a name="l00383"></a>00383 <span class="keywordflow">else</span>
<a name="l00384"></a>00384 dp-><a class="code" href="structdent.html#o1">word</a> = &m_hashstrings [ reinterpret_cast<size_t>(dp-><a class="code" href="structdent.html#o1">word</a>) ];
<a name="l00385"></a>00385 <span class="keywordflow">if</span> (dp-><a class="code" href="structdent.html#o0">next</a> == (<span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a> *) -1)
<a name="l00386"></a>00386 dp-><a class="code" href="structdent.html#o0">next</a> = NULL;
<a name="l00387"></a>00387 <span class="keywordflow">else</span>
<a name="l00388"></a>00388 dp-><a class="code" href="structdent.html#o0">next</a> = &m_hashtbl [ reinterpret_cast<size_t>(dp-><a class="code" href="structdent.html#o0">next</a>) ];
<a name="l00389"></a>00389 }
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391
<a name="l00392"></a>00392 <span class="keywordflow">for</span> (i = m_numsflags + m_numpflags, entry = m_sflaglist; --i >= 0; entry++)
<a name="l00393"></a>00393 {
<a name="l00394"></a>00394 <span class="keywordflow">if</span> (entry-><a class="code" href="structflagent.html#o3">stripl</a>)
<a name="l00395"></a>00395 entry-><a class="code" href="structflagent.html#o0">strip</a> = reinterpret_cast<ichar_t *>(&m_hashstrings[reinterpret_cast<size_t>(entry-><a class="code" href="structflagent.html#o0">strip</a>)]);
<a name="l00396"></a>00396 <span class="keywordflow">else</span>
<a name="l00397"></a>00397 entry-><a class="code" href="structflagent.html#o0">strip</a> = NULL;
<a name="l00398"></a>00398 <span class="keywordflow">if</span> (entry-><a class="code" href="structflagent.html#o4">affl</a>)
<a name="l00399"></a>00399 entry-><a class="code" href="structflagent.html#o1">affix</a> = reinterpret_cast<ichar_t *>(&m_hashstrings[reinterpret_cast<size_t>(entry-><a class="code" href="structflagent.html#o1">affix</a>)]);
<a name="l00400"></a>00400 <span class="keywordflow">else</span>
<a name="l00401"></a>00401 entry-><a class="code" href="structflagent.html#o1">affix</a> = NULL;
<a name="l00402"></a>00402 }
<a name="l00403"></a>00403 <span class="comment">/*</span>
<a name="l00404"></a>00404 <span class="comment"> ** Warning - 'entry' and 'i' are reset in the body of the loop</span>
<a name="l00405"></a>00405 <span class="comment"> ** below. Don't try to optimize it by (e.g.) moving the decrement</span>
<a name="l00406"></a>00406 <span class="comment"> ** of i into the loop condition.</span>
<a name="l00407"></a>00407 <span class="comment"> */</span>
<a name="l00408"></a>00408 <span class="keywordflow">for</span> (i = m_numsflags, entry = m_sflaglist; i > 0; i--, entry++)
<a name="l00409"></a>00409 {
<a name="l00410"></a>00410 <span class="keywordflow">if</span> (entry-><a class="code" href="structflagent.html#o4">affl</a> == 0)
<a name="l00411"></a>00411 {
<a name="l00412"></a>00412 cp = NULL;
<a name="l00413"></a>00413 ind = &m_sflagindex[0];
<a name="l00414"></a>00414 viazero = 1;
<a name="l00415"></a>00415 }
<a name="l00416"></a>00416 <span class="keywordflow">else</span>
<a name="l00417"></a>00417 {
<a name="l00418"></a>00418 cp = entry-><a class="code" href="structflagent.html#o1">affix</a> + entry-><a class="code" href="structflagent.html#o4">affl</a> - 1;
<a name="l00419"></a>00419 ind = &m_sflagindex[*cp];
<a name="l00420"></a>00420 viazero = 0;
<a name="l00421"></a>00421 <span class="keywordflow">while</span> (ind-><a class="code" href="structflagptr.html#o1">numents</a> == 0 && ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> != NULL)
<a name="l00422"></a>00422 {
<a name="l00423"></a>00423 <span class="keywordflow">if</span> (cp == entry-><a class="code" href="structflagent.html#o1">affix</a>)
<a name="l00424"></a>00424 {
<a name="l00425"></a>00425 ind = &ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>[0];
<a name="l00426"></a>00426 viazero = 1;
<a name="l00427"></a>00427 }
<a name="l00428"></a>00428 <span class="keywordflow">else</span>
<a name="l00429"></a>00429 {
<a name="l00430"></a>00430 ind = &ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>[*--cp];
<a name="l00431"></a>00431 viazero = 0;
<a name="l00432"></a>00432 }
<a name="l00433"></a>00433 }
<a name="l00434"></a>00434 }
<a name="l00435"></a>00435 <span class="keywordflow">if</span> (ind-><a class="code" href="structflagptr.html#o1">numents</a> == 0)
<a name="l00436"></a>00436 ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a> = entry;
<a name="l00437"></a>00437 ind-><a class="code" href="structflagptr.html#o1">numents</a>++;
<a name="l00438"></a>00438 <span class="comment">/*</span>
<a name="l00439"></a>00439 <span class="comment"> ** If this index entry has more than MAXSEARCH flags in</span>
<a name="l00440"></a>00440 <span class="comment"> ** it, we will split it into subentries to reduce the</span>
<a name="l00441"></a>00441 <span class="comment"> ** searching. However, the split doesn't make sense in</span>
<a name="l00442"></a>00442 <span class="comment"> ** two cases: (a) if we are already at the end of the</span>
<a name="l00443"></a>00443 <span class="comment"> ** current affix, or (b) if all the entries in the list</span>
<a name="l00444"></a>00444 <span class="comment"> ** have identical affixes. Since the list is sorted, (b)</span>
<a name="l00445"></a>00445 <span class="comment"> ** is true if the first and last affixes in the list</span>
<a name="l00446"></a>00446 <span class="comment"> ** are identical.</span>
<a name="l00447"></a>00447 <span class="comment"> */</span>
<a name="l00448"></a>00448 <span class="keywordflow">if</span> (!viazero && ind-><a class="code" href="structflagptr.html#o1">numents</a> >= MAXSEARCH
<a name="l00449"></a>00449 && icharcmp (entry-><a class="code" href="structflagent.html#o1">affix</a>, ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a>-><a class="code" href="structflagent.html#o1">affix</a>) != 0)
<a name="l00450"></a>00450 {
<a name="l00451"></a>00451 <span class="comment">/* Sneaky trick: back up and reprocess */</span>
<a name="l00452"></a>00452 entry = ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a> - 1; <span class="comment">/* -1 is for entry++ in loop */</span>
<a name="l00453"></a>00453 i = m_numsflags - (entry - m_sflaglist);
<a name="l00454"></a>00454 ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> =
<a name="l00455"></a>00455 (<span class="keyword">struct </span><a class="code" href="structflagptr.html">flagptr</a> *)
<a name="l00456"></a>00456 calloc (static_cast<unsigned>(SET_SIZE + m_hashheader.nstrchars),
<a name="l00457"></a>00457 sizeof (<span class="keyword">struct</span> <a class="code" href="structflagptr.html">flagptr</a>));
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> == NULL)
<a name="l00459"></a>00459 {
<a name="l00460"></a>00460 fprintf (stderr, LOOKUP_C_NO_LANG_SPACE);
<a name="l00461"></a>00461 <span class="keywordflow">return</span> (-1);
<a name="l00462"></a>00462 }
<a name="l00463"></a>00463 ind-><a class="code" href="structflagptr.html#o1">numents</a> = 0;
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466 <span class="comment">/*</span>
<a name="l00467"></a>00467 <span class="comment"> ** Warning - 'entry' and 'i' are reset in the body of the loop</span>
<a name="l00468"></a>00468 <span class="comment"> ** below. Don't try to optimize it by (e.g.) moving the decrement</span>
<a name="l00469"></a>00469 <span class="comment"> ** of i into the loop condition.</span>
<a name="l00470"></a>00470 <span class="comment"> */</span>
<a name="l00471"></a>00471 <span class="keywordflow">for</span> (i = m_numpflags, entry = m_pflaglist; i > 0; i--, entry++)
<a name="l00472"></a>00472 {
<a name="l00473"></a>00473 <span class="keywordflow">if</span> (entry-><a class="code" href="structflagent.html#o4">affl</a> == 0)
<a name="l00474"></a>00474 {
<a name="l00475"></a>00475 cp = NULL;
<a name="l00476"></a>00476 ind = &m_pflagindex[0];
<a name="l00477"></a>00477 viazero = 1;
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479 <span class="keywordflow">else</span>
<a name="l00480"></a>00480 {
<a name="l00481"></a>00481 cp = entry-><a class="code" href="structflagent.html#o1">affix</a>;
<a name="l00482"></a>00482 ind = &m_pflagindex[*cp++];
<a name="l00483"></a>00483 viazero = 0;
<a name="l00484"></a>00484 <span class="keywordflow">while</span> (ind-><a class="code" href="structflagptr.html#o1">numents</a> == 0 && ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> != NULL)
<a name="l00485"></a>00485 {
<a name="l00486"></a>00486 <span class="keywordflow">if</span> (*cp == 0)
<a name="l00487"></a>00487 {
<a name="l00488"></a>00488 ind = &ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>[0];
<a name="l00489"></a>00489 viazero = 1;
<a name="l00490"></a>00490 }
<a name="l00491"></a>00491 <span class="keywordflow">else</span>
<a name="l00492"></a>00492 {
<a name="l00493"></a>00493 ind = &ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>[*cp++];
<a name="l00494"></a>00494 viazero = 0;
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496 }
<a name="l00497"></a>00497 }
<a name="l00498"></a>00498 <span class="keywordflow">if</span> (ind-><a class="code" href="structflagptr.html#o1">numents</a> == 0)
<a name="l00499"></a>00499 ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a> = entry;
<a name="l00500"></a>00500 ind-><a class="code" href="structflagptr.html#o1">numents</a>++;
<a name="l00501"></a>00501 <span class="comment">/*</span>
<a name="l00502"></a>00502 <span class="comment"> ** If this index entry has more than MAXSEARCH flags in</span>
<a name="l00503"></a>00503 <span class="comment"> ** it, we will split it into subentries to reduce the</span>
<a name="l00504"></a>00504 <span class="comment"> ** searching. However, the split doesn't make sense in</span>
<a name="l00505"></a>00505 <span class="comment"> ** two cases: (a) if we are already at the end of the</span>
<a name="l00506"></a>00506 <span class="comment"> ** current affix, or (b) if all the entries in the list</span>
<a name="l00507"></a>00507 <span class="comment"> ** have identical affixes. Since the list is sorted, (b)</span>
<a name="l00508"></a>00508 <span class="comment"> ** is true if the first and last affixes in the list</span>
<a name="l00509"></a>00509 <span class="comment"> ** are identical.</span>
<a name="l00510"></a>00510 <span class="comment"> */</span>
<a name="l00511"></a>00511 <span class="keywordflow">if</span> (!viazero && ind-><a class="code" href="structflagptr.html#o1">numents</a> >= MAXSEARCH
<a name="l00512"></a>00512 && icharcmp (entry-><a class="code" href="structflagent.html#o1">affix</a>, ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a>-><a class="code" href="structflagent.html#o1">affix</a>) != 0)
<a name="l00513"></a>00513 {
<a name="l00514"></a>00514 <span class="comment">/* Sneaky trick: back up and reprocess */</span>
<a name="l00515"></a>00515 entry = ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o1">ent</a> - 1; <span class="comment">/* -1 is for entry++ in loop */</span>
<a name="l00516"></a>00516 i = m_numpflags - (entry - m_pflaglist);
<a name="l00517"></a>00517 ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> =
<a name="l00518"></a>00518 static_cast<struct flagptr *>(calloc(SET_SIZE + m_hashheader.nstrchars,
<a name="l00519"></a>00519 sizeof (<span class="keyword">struct</span> <a class="code" href="structflagptr.html">flagptr</a>)));
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (ind-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> == NULL)
<a name="l00521"></a>00521 {
<a name="l00522"></a>00522 fprintf (stderr, LOOKUP_C_NO_LANG_SPACE);
<a name="l00523"></a>00523 <span class="keywordflow">return</span> (-1);
<a name="l00524"></a>00524 }
<a name="l00525"></a>00525 ind-><a class="code" href="structflagptr.html#o1">numents</a> = 0;
<a name="l00526"></a>00526 }
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528 <span class="preprocessor">#ifdef INDEXDUMP</span>
<a name="l00529"></a>00529 <span class="preprocessor"></span> fprintf (stderr, <span class="stringliteral">"Prefix index table:\n"</span>);
<a name="l00530"></a>00530 dumpindex (m_pflagindex, 0);
<a name="l00531"></a>00531 fprintf (stderr, <span class="stringliteral">"Suffix index table:\n"</span>);
<a name="l00532"></a>00532 dumpindex (m_sflagindex, 0);
<a name="l00533"></a>00533 <span class="preprocessor">#endif</span>
<a name="l00534"></a>00534 <span class="preprocessor"></span> <span class="keywordflow">if</span> (m_hashheader.nstrchartype == 0)
<a name="l00535"></a>00535 m_chartypes = NULL;
<a name="l00536"></a>00536 <span class="keywordflow">else</span>
<a name="l00537"></a>00537 {
<a name="l00538"></a>00538 m_chartypes = (<span class="keyword">struct </span><a class="code" href="structstrchartype.html">strchartype</a> *)
<a name="l00539"></a>00539 malloc (m_hashheader.nstrchartype * sizeof (<span class="keyword">struct</span> <a class="code" href="structstrchartype.html">strchartype</a>));
<a name="l00540"></a>00540 <span class="keywordflow">if</span> (m_chartypes == NULL)
<a name="l00541"></a>00541 {
<a name="l00542"></a>00542 fprintf (stderr, LOOKUP_C_NO_LANG_SPACE);
<a name="l00543"></a>00543 <span class="keywordflow">return</span> (-1);
<a name="l00544"></a>00544 }
<a name="l00545"></a>00545 <span class="keywordflow">for</span> (i = 0, nextchar = m_hashheader.strtypestart;
<a name="l00546"></a>00546 i < m_hashheader.nstrchartype;
<a name="l00547"></a>00547 i++)
<a name="l00548"></a>00548 {
<a name="l00549"></a>00549 m_chartypes[i].<a class="code" href="structstrchartype.html#o0">name</a> = &m_hashstrings[nextchar];
<a name="l00550"></a>00550 nextchar += strlen (m_chartypes[i].<a class="code" href="structstrchartype.html#o0">name</a>) + 1;
<a name="l00551"></a>00551 m_chartypes[i].<a class="code" href="structstrchartype.html#o1">deformatter</a> = &m_hashstrings[nextchar];
<a name="l00552"></a>00552 nextchar += strlen (m_chartypes[i].<a class="code" href="structstrchartype.html#o1">deformatter</a>) + 1;
<a name="l00553"></a>00553 m_chartypes[i].<a class="code" href="structstrchartype.html#o2">suffixes</a> = &m_hashstrings[nextchar];
<a name="l00554"></a>00554 <span class="keywordflow">while</span> (m_hashstrings[nextchar] != <span class="charliteral">'\0'</span>)
<a name="l00555"></a>00555 nextchar += strlen (&m_hashstrings[nextchar]) + 1;
<a name="l00556"></a>00556 nextchar++;
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559
<a name="l00560"></a>00560 initckch(NULL);
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="keywordflow">return</span> (0);
<a name="l00563"></a>00563 }
<a name="l00564"></a>00564
<a name="l00565"></a>00565 <span class="preprocessor">#ifndef FREEP</span>
<a name="l00566"></a>00566 <span class="preprocessor"></span><span class="preprocessor">#define FREEP(p) do { if (p) free(p); } while (0)</span>
<a name="l00567"></a>00567 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00568"></a>00568 <span class="preprocessor"></span>
<a name="l00572"></a>00572 <span class="keywordtype">void</span> ISpellChecker::initckch (<span class="keywordtype">char</span> *wchars)
<a name="l00573"></a>00573 {
<a name="l00574"></a>00574 <span class="keyword">register</span> ichar_t c;
<a name="l00575"></a>00575 <span class="keywordtype">char</span> num[4];
<a name="l00576"></a>00576
<a name="l00577"></a>00577 <span class="keywordflow">for</span> (c = 0; c < static_cast<ichar_t>(SET_SIZE+ m_hashheader.nstrchars); ++c)
<a name="l00578"></a>00578 {
<a name="l00579"></a>00579 <span class="keywordflow">if</span> (iswordch (c))
<a name="l00580"></a>00580 {
<a name="l00581"></a>00581 <span class="keywordflow">if</span> (!mylower (c))
<a name="l00582"></a>00582 {
<a name="l00583"></a>00583 m_Try[m_Trynum] = c;
<a name="l00584"></a>00584 ++m_Trynum;
<a name="l00585"></a>00585 }
<a name="l00586"></a>00586 }
<a name="l00587"></a>00587 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (isboundarych (c))
<a name="l00588"></a>00588 {
<a name="l00589"></a>00589 m_Try[m_Trynum] = c;
<a name="l00590"></a>00590 ++m_Trynum;
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592 }
<a name="l00593"></a>00593 <span class="keywordflow">if</span> (wchars != NULL)
<a name="l00594"></a>00594 {
<a name="l00595"></a>00595 <span class="keywordflow">while</span> (m_Trynum < SET_SIZE && *wchars != <span class="charliteral">'\0'</span>)
<a name="l00596"></a>00596 {
<a name="l00597"></a>00597 <span class="keywordflow">if</span> (*wchars != <span class="charliteral">'n'</span> && *wchars != <span class="charliteral">'\\'</span>)
<a name="l00598"></a>00598 {
<a name="l00599"></a>00599 c = *wchars;
<a name="l00600"></a>00600 ++wchars;
<a name="l00601"></a>00601 }
<a name="l00602"></a>00602 <span class="keywordflow">else</span>
<a name="l00603"></a>00603 {
<a name="l00604"></a>00604 ++wchars;
<a name="l00605"></a>00605 num[0] = <span class="charliteral">'\0'</span>;
<a name="l00606"></a>00606 num[1] = <span class="charliteral">'\0'</span>;
<a name="l00607"></a>00607 num[2] = <span class="charliteral">'\0'</span>;
<a name="l00608"></a>00608 num[3] = <span class="charliteral">'\0'</span>;
<a name="l00609"></a>00609 <span class="keywordflow">if</span> (isdigit (wchars[0]))
<a name="l00610"></a>00610 {
<a name="l00611"></a>00611 num[0] = wchars[0];
<a name="l00612"></a>00612 <span class="keywordflow">if</span> (isdigit (wchars[1]))
<a name="l00613"></a>00613 {
<a name="l00614"></a>00614 num[1] = wchars[1];
<a name="l00615"></a>00615 <span class="keywordflow">if</span> (isdigit (wchars[2]))
<a name="l00616"></a>00616 num[2] = wchars[2];
<a name="l00617"></a>00617 }
<a name="l00618"></a>00618 }
<a name="l00619"></a>00619 <span class="keywordflow">if</span> (wchars[-1] == <span class="charliteral">'n'</span>)
<a name="l00620"></a>00620 {
<a name="l00621"></a>00621 wchars += strlen (num);
<a name="l00622"></a>00622 c = atoi (num);
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624 <span class="keywordflow">else</span>
<a name="l00625"></a>00625 {
<a name="l00626"></a>00626 wchars += strlen (num);
<a name="l00627"></a>00627 c = 0;
<a name="l00628"></a>00628 <span class="keywordflow">if</span> (num[0])
<a name="l00629"></a>00629 c = num[0] - <span class="charliteral">'0'</span>;
<a name="l00630"></a>00630 <span class="keywordflow">if</span> (num[1])
<a name="l00631"></a>00631 {
<a name="l00632"></a>00632 c <<= 3;
<a name="l00633"></a>00633 c += num[1] - <span class="charliteral">'0'</span>;
<a name="l00634"></a>00634 }
<a name="l00635"></a>00635 <span class="keywordflow">if</span> (num[2])
<a name="l00636"></a>00636 {
<a name="l00637"></a>00637 c <<= 3;
<a name="l00638"></a>00638 c += num[2] - <span class="charliteral">'0'</span>;
<a name="l00639"></a>00639 }
<a name="l00640"></a>00640 }
<a name="l00641"></a>00641 }
<a name="l00642"></a>00642 <span class="comment">/* c &= NOPARITY;*/</span>
<a name="l00643"></a>00643 <span class="keywordflow">if</span> (!m_hashheader.wordchars[c])
<a name="l00644"></a>00644 {
<a name="l00645"></a>00645 m_hashheader.wordchars[c] = 1;
<a name="l00646"></a>00646 m_hashheader.sortorder[c] = m_hashheader.sortval++;
<a name="l00647"></a>00647 m_Try[m_Trynum] = c;
<a name="l00648"></a>00648 ++m_Trynum;
<a name="l00649"></a>00649 }
<a name="l00650"></a>00650 }
<a name="l00651"></a>00651 }
<a name="l00652"></a>00652 }
<a name="l00653"></a>00653
<a name="l00654"></a>00654 <span class="comment">/*</span>
<a name="l00655"></a>00655 <span class="comment"> * \param indexp</span>
<a name="l00656"></a>00656 <span class="comment"> */</span>
<a name="l00657"></a>00657 <span class="keywordtype">void</span> ISpellChecker::clearindex (<span class="keyword">struct</span> <a class="code" href="structflagptr.html">flagptr</a> *indexp)
<a name="l00658"></a>00658 {
<a name="l00659"></a>00659 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00660"></a>00660 <span class="keywordflow">for</span> (i = 0; i < SET_SIZE + m_hashheader.nstrchars; i++, indexp++)
<a name="l00661"></a>00661 {
<a name="l00662"></a>00662 <span class="keywordflow">if</span> (indexp-><a class="code" href="structflagptr.html#o1">numents</a> == 0 && indexp-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a> != NULL)
<a name="l00663"></a>00663 {
<a name="l00664"></a>00664 clearindex(indexp-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>);
<a name="l00665"></a>00665 free(indexp-><a class="code" href="structflagptr.html#o0">pu</a>.<a class="code" href="unionptr__union.html#o0">fp</a>);
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 }
<a name="l00668"></a>00668 }
<a name="l00669"></a>00669
<a name="l00670"></a>00670 <span class="preprocessor">#ifdef INDEXDUMP</span>
<a name="l00671"></a>00671 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span> dumpindex (indexp, depth)
<a name="l00672"></a>00672 register struct <a class="code" href="structflagptr.html">flagptr</a> * indexp;
<a name="l00673"></a>00673 register <span class="keywordtype">int</span> depth;
<a name="l00674"></a>00674 {
<a name="l00675"></a>00675 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00676"></a>00676 <span class="keywordtype">int</span> j;
<a name="l00677"></a>00677 <span class="keywordtype">int</span> k;
<a name="l00678"></a>00678 <span class="keywordtype">char</span> stripbuf[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
<a name="l00679"></a>00679
<a name="l00680"></a>00680 <span class="keywordflow">for</span> (i = 0; i < SET_SIZE + <a class="code" href="structhashheader.html">hashheader</a>.nstrchars; i++, indexp++)
<a name="l00681"></a>00681 {
<a name="l00682"></a>00682 <span class="keywordflow">if</span> (indexp->numents == 0 && indexp->pu.fp != NULL)
<a name="l00683"></a>00683 {
<a name="l00684"></a>00684 <span class="keywordflow">for</span> (j = depth; --j >= 0; )
<a name="l00685"></a>00685 putc (<span class="charliteral">' '</span>, stderr);
<a name="l00686"></a>00686 <span class="keywordflow">if</span> (i >= <span class="charliteral">' '</span> && i <= <span class="charliteral">'~'</span>)
<a name="l00687"></a>00687 putc (i, stderr);
<a name="l00688"></a>00688 <span class="keywordflow">else</span>
<a name="l00689"></a>00689 fprintf (stderr, <span class="stringliteral">"0x%x"</span>, i);
<a name="l00690"></a>00690 putc (<span class="charliteral">'\n'</span>, stderr);
<a name="l00691"></a>00691 dumpindex (indexp->pu.fp, depth + 1);
<a name="l00692"></a>00692 }
<a name="l00693"></a>00693 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (indexp->numents)
<a name="l00694"></a>00694 {
<a name="l00695"></a>00695 <span class="keywordflow">for</span> (j = depth; --j >= 0; )
<a name="l00696"></a>00696 putc (<span class="charliteral">' '</span>, stderr);
<a name="l00697"></a>00697 <span class="keywordflow">if</span> (i >= <span class="charliteral">' '</span> && i <= <span class="charliteral">'~'</span>)
<a name="l00698"></a>00698 putc (i, stderr);
<a name="l00699"></a>00699 <span class="keywordflow">else</span>
<a name="l00700"></a>00700 fprintf (stderr, <span class="stringliteral">"0x%x"</span>, i);
<a name="l00701"></a>00701 fprintf (stderr, <span class="stringliteral">" -> %d entries\n"</span>, indexp->numents);
<a name="l00702"></a>00702 <span class="keywordflow">for</span> (k = 0; k < indexp->numents; k++)
<a name="l00703"></a>00703 {
<a name="l00704"></a>00704 <span class="keywordflow">for</span> (j = depth; --j >= 0; )
<a name="l00705"></a>00705 putc (<span class="charliteral">' '</span>, stderr);
<a name="l00706"></a>00706 <span class="keywordflow">if</span> (indexp->pu.ent[k].stripl)
<a name="l00707"></a>00707 {
<a name="l00708"></a>00708 ichartostr (stripbuf, indexp->pu.ent[k].strip,
<a name="l00709"></a>00709 <span class="keyword">sizeof</span> stripbuf, 1);
<a name="l00710"></a>00710 fprintf (stderr, <span class="stringliteral">" entry %d (-%s,%s)\n"</span>,
<a name="l00711"></a>00711 &indexp->pu.ent[k] - sflaglist,
<a name="l00712"></a>00712 stripbuf,
<a name="l00713"></a>00713 indexp->pu.ent[k].affl
<a name="l00714"></a>00714 ? ichartosstr (indexp->pu.ent[k].affix, 1) : <span class="stringliteral">"-"</span>);
<a name="l00715"></a>00715 }
<a name="l00716"></a>00716 <span class="keywordflow">else</span>
<a name="l00717"></a>00717 fprintf (stderr, <span class="stringliteral">" entry %d (%s)\n"</span>,
<a name="l00718"></a>00718 &indexp->pu.ent[k] - sflaglist,
<a name="l00719"></a>00719 ichartosstr (indexp->pu.ent[k].affix, 1));
<a name="l00720"></a>00720 }
<a name="l00721"></a>00721 }
<a name="l00722"></a>00722 }
<a name="l00723"></a>00723 }
<a name="l00724"></a>00724 <span class="preprocessor">#endif</span>
<a name="l00725"></a>00725 <span class="preprocessor"></span>
<a name="l00726"></a>00726 <span class="comment">/* n is length of s */</span>
<a name="l00727"></a>00727
<a name="l00728"></a>00728 <span class="comment">/*</span>
<a name="l00729"></a>00729 <span class="comment"> * \param s</span>
<a name="l00730"></a>00730 <span class="comment"> * \param dotree</span>
<a name="l00731"></a>00731 <span class="comment"> *</span>
<a name="l00732"></a>00732 <span class="comment"> * \return</span>
<a name="l00733"></a>00733 <span class="comment"> */</span>
<a name="l00734"></a>00734 <span class="keyword">struct </span><a class="code" href="structdent.html">dent</a> * ISpellChecker::ispell_lookup (ichar_t *s, <span class="keywordtype">int</span> dotree)
<a name="l00735"></a>00735 {
<a name="l00736"></a>00736 <span class="keyword">register</span> <span class="keyword">struct </span><a class="code" href="structdent.html">dent</a> * dp;
<a name="l00737"></a>00737 <span class="keyword">register</span> <span class="keywordtype">char</span> * s1;
<a name="l00738"></a>00738 <span class="keywordtype">char</span> schar[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00739"></a>00739
<a name="l00740"></a>00740 dp = &m_hashtbl[hash (s, m_hashsize)];
<a name="l00741"></a>00741 <span class="keywordflow">if</span> (ichartostr (schar, s, <span class="keyword">sizeof</span> schar, 1))
<a name="l00742"></a>00742 fprintf (stderr, WORD_TOO_LONG (schar));
<a name="l00743"></a>00743 <span class="keywordflow">for</span> ( ; dp != NULL; dp = dp-><a class="code" href="structdent.html#o0">next</a>)
<a name="l00744"></a>00744 {
<a name="l00745"></a>00745 <span class="comment">/* quick strcmp, but only for equality */</span>
<a name="l00746"></a>00746 s1 = dp-><a class="code" href="structdent.html#o1">word</a>;
<a name="l00747"></a>00747 <span class="keywordflow">if</span> (s1 && s1[0] == schar[0] && strcmp (s1 + 1, schar + 1) == 0)
<a name="l00748"></a>00748 <span class="keywordflow">return</span> dp;
<a name="l00749"></a>00749 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00750"></a>00750 <span class="preprocessor"></span> <span class="keywordflow">while</span> (dp->flagfield & MOREVARIANTS) <span class="comment">/* Skip variations */</span>
<a name="l00751"></a>00751 dp = dp-><a class="code" href="structdent.html#o0">next</a>;
<a name="l00752"></a>00752 <span class="preprocessor">#endif</span>
<a name="l00753"></a>00753 <span class="preprocessor"></span> }
<a name="l00754"></a>00754 <span class="keywordflow">return</span> NULL;
<a name="l00755"></a>00755 }
<a name="l00756"></a>00756
<a name="l00757"></a>00757 <span class="keywordtype">void</span> ISpellChecker::alloc_ispell_struct()
<a name="l00758"></a>00758 {
<a name="l00759"></a>00759 m_translate_in = 0;
<a name="l00760"></a>00760 }
<a name="l00761"></a>00761
<a name="l00762"></a>00762 <span class="keywordtype">void</span> ISpellChecker::free_ispell_struct()
<a name="l00763"></a>00763 {
<a name="l00764"></a>00764 }
</pre></div> </div></div>
</td>
</tr>
<tr>
<td valign="top" id="leftmenu" width="25%">
<a name="navigation"></a>
<div class="menu_box"><h2>kspell2</h2>
<div class="nav_list">
<ul><li><a href="index.html">Main Page</a></li><li><a href="namespaces.html">Namespace List</a></li><li><a href="hierarchy.html">Class Hierarchy</a></li><li><a href="classes.html">Alphabetical List</a></li><li><a href="annotated.html">Class List</a></li><li><a href="files.html">File List</a></li><li><a href="dirs.html">Directories</a></li><li><a href="namespacemembers.html">Namespace Members</a></li><li><a href="functions.html">Class Members</a></li></ul>
<!--
<h2>Class Picker</h2>
<div style="text-align: center;">
<form name="guideform">
<select name="guidelinks" style="width:100%;" onChange="window.location=document.guideform.guidelinks.options[document.guideform.guidelinks.selectedIndex].value">
<option value="annotated.html">-- Choose --</option>
<option value="classASpellClient.html">aspellclient</option>, <option value="classASpellDict.html">aspelldict</option>, <option value="classHSpellClient.html">hspellclient</option>, <option value="classHSpellDict.html">hspelldict</option>, <option value="classISpellChecker.html">ispellchecker</option>, <option value="classISpellClient.html">ispellclient</option>, <option value="classISpellDict.html">ispelldict</option>, <option value="classKSpell2_1_1BackgroundChecker.html">kspell2::backgroundchecker</option>, <option value="classKSpell2_1_1BackgroundEngine.html">kspell2::backgroundengine</option>, <option value="classKSpell2_1_1BackgroundThread.html">kspell2::backgroundthread</option>, <option value="classKSpell2_1_1Broker.html">kspell2::broker</option>, <option value="classKSpell2_1_1Client.html">kspell2::client</option>, <option value="classKSpell2_1_1ConfigDialog.html">kspell2::configdialog</option>, <option value="classKSpell2_1_1ConfigWidget.html">kspell2::configwidget</option>, <option value="classKSpell2_1_1DefaultDictionary.html">kspell2::defaultdictionary</option>, <option value="classKSpell2_1_1Dialog.html">kspell2::dialog</option>, <option value="classKSpell2_1_1Dictionary.html">kspell2::dictionary</option>, <option value="classKSpell2_1_1Filter.html">kspell2::filter</option>, <option value="classKSpell2_1_1FinishedCheckingEvent.html">kspell2::finishedcheckingevent</option>, <option value="classKSpell2_1_1Highlighter.html">kspell2::highlighter</option>, <option value="classKSpell2_1_1MisspellingEvent.html">kspell2::misspellingevent</option>, <option value="classKSpell2_1_1Settings.html">kspell2::settings</option>, <option value="classKSpell2ConfigUI.html">kspell2configui</option>, <option value="classKSpell2UI.html">kspell2ui</option>,
</select>
</form>
</div>
-->
</div></div>
<div class="menu_box"><h2>API Dox</h2>
<div class="nav_list">
<ul>
<li><a href="../../arts/html/index.html">arts</a></li><li><a href="../../dcop/html/index.html">dcop</a></li><li><a href="../../dnssd/html/index.html">dnssd</a></li><li><a href="../../interfaces/html/index.html">interfaces</a></li><li> <a href="../../interfaces/kimproxy/interface/html/index.html">interface</a></li><li> <a href="../../interfaces/kimproxy/library/html/index.html">library</a></li><li> <a href="../../interfaces/kspeech/html/index.html">kspeech</a></li><li> <a href="../../interfaces/ktexteditor/html/index.html">ktexteditor</a></li><li><a href="../../kabc/html/index.html">kabc</a></li><li><a href="../../kate/html/index.html">kate</a></li><li><a href="../../kcmshell/html/index.html">kcmshell</a></li><li><a href="../../kdecore/html/index.html">kdecore</a></li><li><a href="../../kded/html/index.html">kded</a></li><li><a href="../../kdefx/html/index.html">kdefx</a></li><li><a href="../../kdeprint/html/index.html">kdeprint</a></li><li><a href="../../kdesu/html/index.html">kdesu</a></li><li><a href="../../kdeui/html/index.html">kdeui</a></li><li><a href="../../kdoctools/html/index.html">kdoctools</a></li><li><a href="../../khtml/html/index.html">khtml</a></li><li><a href="../../kimgio/html/index.html">kimgio</a></li><li><a href="../../kinit/html/index.html">kinit</a></li><li><a href="../../kio/html/index.html">kio</a></li><li> <a href="../../kio/bookmarks/html/index.html">bookmarks</a></li><li> <a href="../../kio/httpfilter/html/index.html">httpfilter</a></li><li> <a href="../../kio/kfile/html/index.html">kfile</a></li><li> <a href="../../kio/kio/html/index.html">kio</a></li><li> <a href="../../kio/kioexec/html/index.html">kioexec</a></li><li> <a href="../../kio/kpasswdserver/html/index.html">kpasswdserver</a></li><li> <a href="../../kio/kssl/html/index.html">kssl</a></li><li><a href="../../kioslave/html/index.html">kioslave</a></li><li> <a href="../../kioslave/http/html/index.html">http</a></li><li><a href="../../kjs/html/index.html">kjs</a></li><li><a href="../../kmdi/html/index.html">kmdi</a></li><li> <a href="../../kmdi/kmdi/html/index.html">kmdi</a></li><li><a href="../../knewstuff/html/index.html">knewstuff</a></li><li><a href="../../kparts/html/index.html">kparts</a></li><li><a href="../../kresources/html/index.html">kresources</a></li><li><a href="../../kspell2/html/index.html">kspell2</a></li><li><a href="../../kunittest/html/index.html">kunittest</a></li><li><a href="../../kutils/html/index.html">kutils</a></li><li><a href="../../kwallet/html/index.html">kwallet</a></li><li><a href="../../libkmid/html/index.html">libkmid</a></li><li><a href="../../libkscreensaver/html/index.html">libkscreensaver</a></li>
</ul></div></div>
</td>
</tr>
</table>
<span class="doNotDisplay">
<a href="http://www.kde.org/" accesskey="8">KDE Home</a> |
<a href="http://accessibility.kde.org/" accesskey="9">KDE Accessibility Home</a> |
<a href="http://www.kde.org/media/accesskeys.php" accesskey="0">Description of Access Keys</a>
</span>
<div style="height: 8px"></div>
<div id="footer">
<div id="footer_left">
Maintained by <a href="mailto:groot@kde.org">Adriaan de Groot</a>
and
<a href="mailto:winter@kde.org">Allen Winter</a>.
<br/>
KDE and K Desktop Environment are trademarks of <a href="http://www.kde.org/areas/kde-ev/" title="Homepage of the KDE non-profit Organization">KDE e.V.</a> |
<a href="http://www.kde.org/contact/impressum.php">Legal</a>
</div>
<div id="footer_right"><img src="/media/images/footer_right.png" style="margin: 0px" alt="" /></div>
</div>
<!--
WARNING: DO NOT SEND MAIL TO THE FOLLOWING EMAIL ADDRESS! YOU WILL
BE BLOCKED INSTANTLY AND PERMANENTLY!
<a href="mailto:aaaatrap-425acc3b5374943f@kde.org">Block me</a>
WARNING END
-->
</body>
</html>
distrib
>
PLD
>
ac
>
amd64
>
media
>
dist
>
by-pkgid
>
90467ea6a387df728f7218a11e972208
>
files
>
9441
