<?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: tgood.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.7.4 -->
<div class="header">
<div class="headertitle">
<div class="title">tgood.cpp</div> </div>
</div>
<div class="contents">
<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">/* enchant</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 2003 Dom Lachowicz</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * This library is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00007"></a>00007 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00008"></a>00008 <span class="comment"> * version 2.1 of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This library is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00013"></a>00013 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * You should have received a copy of the GNU Lesser General Public</span>
<a name="l00016"></a>00016 <span class="comment"> * License along with this library; if not, write to the</span>
<a name="l00017"></a>00017 <span class="comment"> * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,</span>
<a name="l00018"></a>00018 <span class="comment"> * Boston, MA 02110-1301, USA.</span>
<a name="l00019"></a>00019 <span class="comment"> *</span>
<a name="l00020"></a>00020 <span class="comment"> * In addition, as a special exception, Dom Lachowicz</span>
<a name="l00021"></a>00021 <span class="comment"> * gives permission to link the code of this program with</span>
<a name="l00022"></a>00022 <span class="comment"> * non-LGPL Spelling Provider libraries (eg: a MSFT Office</span>
<a name="l00023"></a>00023 <span class="comment"> * spell checker backend) and distribute linked combinations including</span>
<a name="l00024"></a>00024 <span class="comment"> * the two. You must obey the GNU Lesser General Public License in all</span>
<a name="l00025"></a>00025 <span class="comment"> * respects for all of the code used other than said providers. If you modify</span>
<a name="l00026"></a>00026 <span class="comment"> * this file, you may extend this exception to your version of the</span>
<a name="l00027"></a>00027 <span class="comment"> * file, but you are not obligated to do so. If you do not wish to</span>
<a name="l00028"></a>00028 <span class="comment"> * do so, delete this exception statement from your version.</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="comment">/*</span>
<a name="l00032"></a>00032 <span class="comment"> * Copyright 1987, 1988, 1989, 1992, 1993, Geoff Kuenning, Granada Hills, CA</span>
<a name="l00033"></a>00033 <span class="comment"> * All rights reserved.</span>
<a name="l00034"></a>00034 <span class="comment"> *</span>
<a name="l00035"></a>00035 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00036"></a>00036 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00037"></a>00037 <span class="comment"> * are met:</span>
<a name="l00038"></a>00038 <span class="comment"> *</span>
<a name="l00039"></a>00039 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00040"></a>00040 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span>
<a name="l00041"></a>00041 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00042"></a>00042 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span>
<a name="l00043"></a>00043 <span class="comment"> * documentation and/or other materials provided with the distribution.</span>
<a name="l00044"></a>00044 <span class="comment"> * 3. All modifications to the source code must be clearly marked as</span>
<a name="l00045"></a>00045 <span class="comment"> * such. Binary redistributions based on modified source code</span>
<a name="l00046"></a>00046 <span class="comment"> * must be clearly marked as modified versions in the documentation</span>
<a name="l00047"></a>00047 <span class="comment"> * and/or other materials provided with the distribution.</span>
<a name="l00048"></a>00048 <span class="comment"> * 4. All advertising materials mentioning features or use of this software</span>
<a name="l00049"></a>00049 <span class="comment"> * must display the following acknowledgment:</span>
<a name="l00050"></a>00050 <span class="comment"> * This product includes software developed by Geoff Kuenning and</span>
<a name="l00051"></a>00051 <span class="comment"> * other unpaid contributors.</span>
<a name="l00052"></a>00052 <span class="comment"> * 5. The name of Geoff Kuenning may not be used to endorse or promote</span>
<a name="l00053"></a>00053 <span class="comment"> * products derived from this software without specific prior</span>
<a name="l00054"></a>00054 <span class="comment"> * written permission.</span>
<a name="l00055"></a>00055 <span class="comment"> *</span>
<a name="l00056"></a>00056 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS IS'' AND</span>
<a name="l00057"></a>00057 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span>
<a name="l00058"></a>00058 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span>
<a name="l00059"></a>00059 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL GEOFF KUENNING OR CONTRIBUTORS BE LIABLE</span>
<a name="l00060"></a>00060 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span>
<a name="l00061"></a>00061 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span>
<a name="l00062"></a>00062 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span>
<a name="l00063"></a>00063 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span>
<a name="l00064"></a>00064 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span>
<a name="l00065"></a>00065 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span>
<a name="l00066"></a>00066 <span class="comment"> * SUCH DAMAGE.</span>
<a name="l00067"></a>00067 <span class="comment"> */</span>
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">/*</span>
<a name="l00070"></a>00070 <span class="comment"> * Table-driven version of good.c.</span>
<a name="l00071"></a>00071 <span class="comment"> *</span>
<a name="l00072"></a>00072 <span class="comment"> * Geoff Kuenning, July 1987</span>
<a name="l00073"></a>00073 <span class="comment"> */</span>
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="comment">/*</span>
<a name="l00076"></a>00076 <span class="comment"> * $Log$</span>
<a name="l00077"></a>00077 <span class="comment"> * Revision 1.1 2004/01/31 16:44:12 zrusin</span>
<a name="l00078"></a>00078 <span class="comment"> * ISpell plugin.</span>
<a name="l00079"></a>00079 <span class="comment"> *</span>
<a name="l00080"></a>00080 <span class="comment"> * Revision 1.4 2003/08/14 17:51:29 dom</span>
<a name="l00081"></a>00081 <span class="comment"> * update license - exception clause should be Lesser GPL</span>
<a name="l00082"></a>00082 <span class="comment"> *</span>
<a name="l00083"></a>00083 <span class="comment"> * Revision 1.3 2003/07/28 20:40:28 dom</span>
<a name="l00084"></a>00084 <span class="comment"> * fix up the license clause, further win32-registry proof some directory getting functions</span>
<a name="l00085"></a>00085 <span class="comment"> *</span>
<a name="l00086"></a>00086 <span class="comment"> * Revision 1.2 2003/07/16 22:52:56 dom</span>
<a name="l00087"></a>00087 <span class="comment"> * LGPL + exception license</span>
<a name="l00088"></a>00088 <span class="comment"> *</span>
<a name="l00089"></a>00089 <span class="comment"> * Revision 1.1 2003/07/15 01:15:09 dom</span>
<a name="l00090"></a>00090 <span class="comment"> * ispell enchant backend</span>
<a name="l00091"></a>00091 <span class="comment"> *</span>
<a name="l00092"></a>00092 <span class="comment"> * Revision 1.2 2003/01/29 05:50:12 hippietrail</span>
<a name="l00093"></a>00093 <span class="comment"> *</span>
<a name="l00094"></a>00094 <span class="comment"> * Fixed my mess in EncodingManager.</span>
<a name="l00095"></a>00095 <span class="comment"> * Changed many C casts to C++ casts.</span>
<a name="l00096"></a>00096 <span class="comment"> *</span>
<a name="l00097"></a>00097 <span class="comment"> * Revision 1.1 2003/01/24 05:52:36 hippietrail</span>
<a name="l00098"></a>00098 <span class="comment"> *</span>
<a name="l00099"></a>00099 <span class="comment"> * Refactored ispell code. Old ispell global variables had been put into</span>
<a name="l00100"></a>00100 <span class="comment"> * an allocated structure, a pointer to which was passed to many functions.</span>
<a name="l00101"></a>00101 <span class="comment"> * I have now made all such functions and variables private members of the</span>
<a name="l00102"></a>00102 <span class="comment"> * ISpellChecker class. It was C OO, now it's C++ OO.</span>
<a name="l00103"></a>00103 <span class="comment"> *</span>
<a name="l00104"></a>00104 <span class="comment"> * I've fixed the makefiles and tested compilation but am unable to test</span>
<a name="l00105"></a>00105 <span class="comment"> * operation. Please back out my changes if they cause problems which</span>
<a name="l00106"></a>00106 <span class="comment"> * are not obvious or easy to fix.</span>
<a name="l00107"></a>00107 <span class="comment"> *</span>
<a name="l00108"></a>00108 <span class="comment"> * Revision 1.6 2003/01/06 18:48:42 dom</span>
<a name="l00109"></a>00109 <span class="comment"> * ispell cleanup, start of using new 'add' save features</span>
<a name="l00110"></a>00110 <span class="comment"> *</span>
<a name="l00111"></a>00111 <span class="comment"> * Revision 1.5 2002/09/19 05:31:20 hippietrail</span>
<a name="l00112"></a>00112 <span class="comment"> *</span>
<a name="l00113"></a>00113 <span class="comment"> * More Ispell cleanup. Conditional globals and DEREF macros are removed.</span>
<a name="l00114"></a>00114 <span class="comment"> * K&R function declarations removed, converted to Doxygen style comments</span>
<a name="l00115"></a>00115 <span class="comment"> * where possible. No code has been changed (I hope). Compiles for me but</span>
<a name="l00116"></a>00116 <span class="comment"> * unable to test.</span>
<a name="l00117"></a>00117 <span class="comment"> *</span>
<a name="l00118"></a>00118 <span class="comment"> * Revision 1.4 2002/09/17 03:03:31 hippietrail</span>
<a name="l00119"></a>00119 <span class="comment"> *</span>
<a name="l00120"></a>00120 <span class="comment"> * After seeking permission on the developer list I've reformatted all the</span>
<a name="l00121"></a>00121 <span class="comment"> * spelling source which seemed to have parts which used 2, 3, 4, and 8</span>
<a name="l00122"></a>00122 <span class="comment"> * spaces for tabs. It should all look good with our standard 4-space</span>
<a name="l00123"></a>00123 <span class="comment"> * tabs now.</span>
<a name="l00124"></a>00124 <span class="comment"> * I've concentrated just on indentation in the actual code. More prettying</span>
<a name="l00125"></a>00125 <span class="comment"> * could be done.</span>
<a name="l00126"></a>00126 <span class="comment"> * * NO code changes were made *</span>
<a name="l00127"></a>00127 <span class="comment"> *</span>
<a name="l00128"></a>00128 <span class="comment"> * Revision 1.3 2002/09/13 17:20:14 mpritchett</span>
<a name="l00129"></a>00129 <span class="comment"> * Fix more warnings for Linux build</span>
<a name="l00130"></a>00130 <span class="comment"> *</span>
<a name="l00131"></a>00131 <span class="comment"> * Revision 1.2 2001/05/12 16:05:42 thomasf</span>
<a name="l00132"></a>00132 <span class="comment"> * Big pseudo changes to ispell to make it pass around a structure rather</span>
<a name="l00133"></a>00133 <span class="comment"> * than rely on all sorts of gloabals willy nilly here and there. Also</span>
<a name="l00134"></a>00134 <span class="comment"> * fixed our spelling class to work with accepting suggestions once more.</span>
<a name="l00135"></a>00135 <span class="comment"> * This code is dirty, gross and ugly (not to mention still not supporting</span>
<a name="l00136"></a>00136 <span class="comment"> * multiple hash sized just yet) but it works on my machine and will no</span>
<a name="l00137"></a>00137 <span class="comment"> * doubt break other machines.</span>
<a name="l00138"></a>00138 <span class="comment"> *</span>
<a name="l00139"></a>00139 <span class="comment"> * Revision 1.1 2001/04/15 16:01:24 tomas_f</span>
<a name="l00140"></a>00140 <span class="comment"> * moving to spell/xp</span>
<a name="l00141"></a>00141 <span class="comment"> *</span>
<a name="l00142"></a>00142 <span class="comment"> * Revision 1.7 1999/10/20 06:03:56 sterwill</span>
<a name="l00143"></a>00143 <span class="comment"> * Changed C++-style comments to C-style comments in C code.</span>
<a name="l00144"></a>00144 <span class="comment"> *</span>
<a name="l00145"></a>00145 <span class="comment"> * Revision 1.6 1999/10/20 03:19:35 paul</span>
<a name="l00146"></a>00146 <span class="comment"> * Hacked ispell code to ignore any characters that don't fit in the lookup tables loaded from the dictionary. It ain't pretty, but at least we don't crash there any more.</span>
<a name="l00147"></a>00147 <span class="comment"> *</span>
<a name="l00148"></a>00148 <span class="comment"> * Revision 1.5 1999/04/13 17:12:51 jeff</span>
<a name="l00149"></a>00149 <span class="comment"> * Applied "Darren O. Benham" <gecko@benham.net> spell check changes.</span>
<a name="l00150"></a>00150 <span class="comment"> * Fixed crash on Win32 with the new code.</span>
<a name="l00151"></a>00151 <span class="comment"> *</span>
<a name="l00152"></a>00152 <span class="comment"> * Revision 1.4 1998/12/29 14:55:33 eric</span>
<a name="l00153"></a>00153 <span class="comment"> *</span>
<a name="l00154"></a>00154 <span class="comment"> * I've doctored the ispell code pretty extensively here. It is now</span>
<a name="l00155"></a>00155 <span class="comment"> * warning-free on Win32. It also *works* on Win32 now, since I</span>
<a name="l00156"></a>00156 <span class="comment"> * replaced all the I/O calls with ANSI standard ones.</span>
<a name="l00157"></a>00157 <span class="comment"> *</span>
<a name="l00158"></a>00158 <span class="comment"> * Revision 1.4 1998/12/29 14:55:33 eric</span>
<a name="l00159"></a>00159 <span class="comment"> *</span>
<a name="l00160"></a>00160 <span class="comment"> * I've doctored the ispell code pretty extensively here. It is now</span>
<a name="l00161"></a>00161 <span class="comment"> * warning-free on Win32. It also *works* on Win32 now, since I</span>
<a name="l00162"></a>00162 <span class="comment"> * replaced all the I/O calls with ANSI standard ones.</span>
<a name="l00163"></a>00163 <span class="comment"> *</span>
<a name="l00164"></a>00164 <span class="comment"> * Revision 1.3 1998/12/28 23:11:30 eric</span>
<a name="l00165"></a>00165 <span class="comment"> *</span>
<a name="l00166"></a>00166 <span class="comment"> * modified spell code and integration to build on Windows.</span>
<a name="l00167"></a>00167 <span class="comment"> * This is still a hack.</span>
<a name="l00168"></a>00168 <span class="comment"> *</span>
<a name="l00169"></a>00169 <span class="comment"> * Actually, it doesn't yet WORK on Windows. It just builds.</span>
<a name="l00170"></a>00170 <span class="comment"> * SpellCheckInit is failing for some reason.</span>
<a name="l00171"></a>00171 <span class="comment"> *</span>
<a name="l00172"></a>00172 <span class="comment"> * Revision 1.2 1998/12/28 22:16:22 eric</span>
<a name="l00173"></a>00173 <span class="comment"> *</span>
<a name="l00174"></a>00174 <span class="comment"> * These changes begin to incorporate the spell checker into AbiWord. Most</span>
<a name="l00175"></a>00175 <span class="comment"> * of this is a hack.</span>
<a name="l00176"></a>00176 <span class="comment"> *</span>
<a name="l00177"></a>00177 <span class="comment"> * 1. added other/spell to the -I list in config/abi_defs</span>
<a name="l00178"></a>00178 <span class="comment"> * 2. replaced other/spell/Makefile with one which is more like</span>
<a name="l00179"></a>00179 <span class="comment"> * our build system.</span>
<a name="l00180"></a>00180 <span class="comment"> * 3. added other/spell to other/Makefile so that the build will now</span>
<a name="l00181"></a>00181 <span class="comment"> * dive down and build the spell check library.</span>
<a name="l00182"></a>00182 <span class="comment"> * 4. added the AbiSpell library to the Makefiles in wp/main</span>
<a name="l00183"></a>00183 <span class="comment"> * 5. added a call to SpellCheckInit in wp/main/unix/UnixMain.cpp.</span>
<a name="l00184"></a>00184 <span class="comment"> * This call is a HACK and should be replaced with something</span>
<a name="l00185"></a>00185 <span class="comment"> * proper later.</span>
<a name="l00186"></a>00186 <span class="comment"> * 6. added code to fv_View.cpp as follows:</span>
<a name="l00187"></a>00187 <span class="comment"> * whenever you double-click on a word, the spell checker</span>
<a name="l00188"></a>00188 <span class="comment"> * verifies that word and prints its status to stdout.</span>
<a name="l00189"></a>00189 <span class="comment"> *</span>
<a name="l00190"></a>00190 <span class="comment"> * Caveats:</span>
<a name="l00191"></a>00191 <span class="comment"> * 1. This will break the Windows build. I'm going to work on fixing it</span>
<a name="l00192"></a>00192 <span class="comment"> * now.</span>
<a name="l00193"></a>00193 <span class="comment"> * 2. This only works if your dictionary is in /usr/lib/ispell/american.hash.</span>
<a name="l00194"></a>00194 <span class="comment"> * The dictionary location is currently hard-coded. This will be</span>
<a name="l00195"></a>00195 <span class="comment"> * fixed as well.</span>
<a name="l00196"></a>00196 <span class="comment"> *</span>
<a name="l00197"></a>00197 <span class="comment"> * Anyway, such as it is, it works.</span>
<a name="l00198"></a>00198 <span class="comment"> *</span>
<a name="l00199"></a>00199 <span class="comment"> * Revision 1.1 1998/12/28 18:04:43 davet</span>
<a name="l00200"></a>00200 <span class="comment"> * Spell checker code stripped from ispell. At this point, there are</span>
<a name="l00201"></a>00201 <span class="comment"> * two external routines... the Init routine, and a check-a-word routine</span>
<a name="l00202"></a>00202 <span class="comment"> * which returns a boolean value, and takes a 16 bit char string.</span>
<a name="l00203"></a>00203 <span class="comment"> * The code resembles the ispell code as much as possible still.</span>
<a name="l00204"></a>00204 <span class="comment"> *</span>
<a name="l00205"></a>00205 <span class="comment"> * Revision 1.32 1994/11/02 06:56:16 geoff</span>
<a name="l00206"></a>00206 <span class="comment"> * Remove the anyword feature, which I've decided is a bad idea.</span>
<a name="l00207"></a>00207 <span class="comment"> *</span>
<a name="l00208"></a>00208 <span class="comment"> * Revision 1.31 1994/10/25 05:46:25 geoff</span>
<a name="l00209"></a>00209 <span class="comment"> * Add support for the FF_ANYWORD (affix applies to all words, even if</span>
<a name="l00210"></a>00210 <span class="comment"> * flag bit isn't set) flag option.</span>
<a name="l00211"></a>00211 <span class="comment"> *</span>
<a name="l00212"></a>00212 <span class="comment"> * Revision 1.30 1994/05/24 06:23:08 geoff</span>
<a name="l00213"></a>00213 <span class="comment"> * Don't create a hit if "allhits" is clear and capitalization</span>
<a name="l00214"></a>00214 <span class="comment"> * mismatches. This cures a bug where a word could be in the dictionary</span>
<a name="l00215"></a>00215 <span class="comment"> * and yet not found.</span>
<a name="l00216"></a>00216 <span class="comment"> *</span>
<a name="l00217"></a>00217 <span class="comment"> * Revision 1.29 1994/05/17 06:44:21 geoff</span>
<a name="l00218"></a>00218 <span class="comment"> * Add support for controlled compound formation and the COMPOUNDONLY</span>
<a name="l00219"></a>00219 <span class="comment"> * option to affix flags.</span>
<a name="l00220"></a>00220 <span class="comment"> *</span>
<a name="l00221"></a>00221 <span class="comment"> * Revision 1.28 1994/01/25 07:12:13 geoff</span>
<a name="l00222"></a>00222 <span class="comment"> * Get rid of all old RCS log lines in preparation for the 3.1 release.</span>
<a name="l00223"></a>00223 <span class="comment"> *</span>
<a name="l00224"></a>00224 <span class="comment"> */</span>
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="preprocessor">#include <ctype.h></span>
<a name="l00227"></a>00227 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00228"></a>00228 <span class="preprocessor">#include <string.h></span>
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="preprocessor">#include "ispell_checker.h"</span>
<a name="l00231"></a>00231
<a name="l00243"></a>00243 <span class="keywordtype">void</span> ISpellChecker::chk_aff (ichar_t *word, ichar_t *ucword,
<a name="l00244"></a>00244 <span class="keywordtype">int</span> len, <span class="keywordtype">int</span> ignoreflagbits, <span class="keywordtype">int</span> allhits, <span class="keywordtype">int</span> pfxopts, <span class="keywordtype">int</span> sfxopts)
<a name="l00245"></a>00245 {
<a name="l00246"></a>00246 <span class="keyword">register</span> ichar_t * cp; <span class="comment">/* Pointer to char to index on */</span>
<a name="l00247"></a>00247 <span class="keyword">struct </span>flagptr * ind; <span class="comment">/* Flag index table to test */</span>
<a name="l00248"></a>00248
<a name="l00249"></a>00249 pfx_list_chk (word, ucword, len, pfxopts, sfxopts, &m_pflagindex[0],
<a name="l00250"></a>00250 ignoreflagbits, allhits);
<a name="l00251"></a>00251 cp = ucword;
<a name="l00252"></a>00252 <span class="comment">/* HACK: bail on unrecognized chars */</span>
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (*cp >= (SET_SIZE + MAXSTRINGCHARS))
<a name="l00254"></a>00254 <span class="keywordflow">return</span>;
<a name="l00255"></a>00255 ind = &m_pflagindex[*cp++];
<a name="l00256"></a>00256 <span class="keywordflow">while</span> (ind->numents == 0 && ind->pu.fp != NULL)
<a name="l00257"></a>00257 {
<a name="l00258"></a>00258 <span class="keywordflow">if</span> (*cp == 0)
<a name="l00259"></a>00259 <span class="keywordflow">return</span>;
<a name="l00260"></a>00260 <span class="keywordflow">if</span> (ind->pu.fp[0].numents)
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 pfx_list_chk (word, ucword, len, pfxopts, sfxopts, &ind->pu.fp[0],
<a name="l00263"></a>00263 ignoreflagbits, allhits);
<a name="l00264"></a>00264 <span class="keywordflow">if</span> (m_numhits && !allhits && <span class="comment">/* !cflag && */</span> !ignoreflagbits)
<a name="l00265"></a>00265 <span class="keywordflow">return</span>;
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267 <span class="comment">/* HACK: bail on unrecognized chars */</span>
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (*cp >= (SET_SIZE + MAXSTRINGCHARS))
<a name="l00269"></a>00269 <span class="keywordflow">return</span>;
<a name="l00270"></a>00270 ind = &ind->pu.fp[*cp++];
<a name="l00271"></a>00271 }
<a name="l00272"></a>00272 pfx_list_chk (word, ucword, len, pfxopts, sfxopts, ind, ignoreflagbits,
<a name="l00273"></a>00273 allhits);
<a name="l00274"></a>00274 <span class="keywordflow">if</span> (m_numhits && !allhits && <span class="comment">/* !cflag &&*/</span> !ignoreflagbits)
<a name="l00275"></a>00275 <span class="keywordflow">return</span>;
<a name="l00276"></a>00276 chk_suf (word, ucword, len, sfxopts, static_cast<struct flagent *>(NULL),
<a name="l00277"></a>00277 ignoreflagbits, allhits);
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279
<a name="l00292"></a>00292 <span class="keywordtype">void</span> ISpellChecker::pfx_list_chk (ichar_t *word, ichar_t *ucword, <span class="keywordtype">int</span> len, <span class="keywordtype">int</span> optflags,
<a name="l00293"></a>00293 <span class="keywordtype">int</span> sfxopts, <span class="keyword">struct</span> flagptr * ind, <span class="keywordtype">int</span> ignoreflagbits, <span class="keywordtype">int</span> allhits)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 <span class="keywordtype">int</span> cond; <span class="comment">/* Condition number */</span>
<a name="l00296"></a>00296 <span class="keyword">register</span> ichar_t * cp; <span class="comment">/* Pointer into end of ucword */</span>
<a name="l00297"></a>00297 <span class="keyword">struct </span>dent * dent; <span class="comment">/* Dictionary entry we found */</span>
<a name="l00298"></a>00298 <span class="keywordtype">int</span> entcount; <span class="comment">/* Number of entries to process */</span>
<a name="l00299"></a>00299 <span class="keyword">register</span> <span class="keyword">struct </span>flagent *
<a name="l00300"></a>00300 flent; <span class="comment">/* Current table entry */</span>
<a name="l00301"></a>00301 <span class="keywordtype">int</span> preadd; <span class="comment">/* Length added to tword2 as prefix */</span>
<a name="l00302"></a>00302 <span class="keyword">register</span> <span class="keywordtype">int</span> tlen; <span class="comment">/* Length of tword */</span>
<a name="l00303"></a>00303 ichar_t tword[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4]; <span class="comment">/* Tmp cpy */</span>
<a name="l00304"></a>00304 ichar_t tword2[<span class="keyword">sizeof</span> tword]; <span class="comment">/* 2nd copy for ins_root_cap */</span>
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keywordflow">for</span> (flent = ind->pu.ent, entcount = ind->numents;
<a name="l00307"></a>00307 entcount > 0;
<a name="l00308"></a>00308 flent++, entcount--)
<a name="l00309"></a>00309 {
<a name="l00310"></a>00310 <span class="comment">/*</span>
<a name="l00311"></a>00311 <span class="comment"> * If this is a compound-only affix, ignore it unless we're</span>
<a name="l00312"></a>00312 <span class="comment"> * looking for that specific thing.</span>
<a name="l00313"></a>00313 <span class="comment"> */</span>
<a name="l00314"></a>00314 <span class="keywordflow">if</span> ((flent->flagflags & FF_COMPOUNDONLY) != 0
<a name="l00315"></a>00315 && (optflags & FF_COMPOUNDONLY) == 0)
<a name="l00316"></a>00316 <span class="keywordflow">continue</span>;
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <span class="comment">/*</span>
<a name="l00319"></a>00319 <span class="comment"> * See if the prefix matches.</span>
<a name="l00320"></a>00320 <span class="comment"> */</span>
<a name="l00321"></a>00321 tlen = len - flent->affl;
<a name="l00322"></a>00322 <span class="keywordflow">if</span> (tlen > 0
<a name="l00323"></a>00323 && (flent->affl == 0
<a name="l00324"></a>00324 || icharncmp (flent->affix, ucword, flent->affl) == 0)
<a name="l00325"></a>00325 && tlen + flent->stripl >= flent->numconds)
<a name="l00326"></a>00326 {
<a name="l00327"></a>00327 <span class="comment">/*</span>
<a name="l00328"></a>00328 <span class="comment"> * The prefix matches. Remove it, replace it by the "strip"</span>
<a name="l00329"></a>00329 <span class="comment"> * string (if any), and check the original conditions.</span>
<a name="l00330"></a>00330 <span class="comment"> */</span>
<a name="l00331"></a>00331 <span class="keywordflow">if</span> (flent->stripl)
<a name="l00332"></a>00332 icharcpy (tword, flent->strip);
<a name="l00333"></a>00333 icharcpy (tword + flent->stripl, ucword + flent->affl);
<a name="l00334"></a>00334 cp = tword;
<a name="l00335"></a>00335 <span class="keywordflow">for</span> (cond = 0; cond < flent->numconds; cond++)
<a name="l00336"></a>00336 {
<a name="l00337"></a>00337 <span class="keywordflow">if</span> ((flent->conds[*cp++] & (1 << cond)) == 0)
<a name="l00338"></a>00338 <span class="keywordflow">break</span>;
<a name="l00339"></a>00339 }
<a name="l00340"></a>00340 <span class="keywordflow">if</span> (cond >= flent->numconds)
<a name="l00341"></a>00341 {
<a name="l00342"></a>00342 <span class="comment">/*</span>
<a name="l00343"></a>00343 <span class="comment"> * The conditions match. See if the word is in the</span>
<a name="l00344"></a>00344 <span class="comment"> * dictionary.</span>
<a name="l00345"></a>00345 <span class="comment"> */</span>
<a name="l00346"></a>00346 tlen += flent->stripl;
<a name="l00347"></a>00347
<a name="l00348"></a>00348 <span class="keywordflow">if</span> (ignoreflagbits)
<a name="l00349"></a>00349 {
<a name="l00350"></a>00350 <span class="keywordflow">if</span> ((dent = ispell_lookup (tword, 1)) != NULL)
<a name="l00351"></a>00351 {
<a name="l00352"></a>00352 cp = tword2;
<a name="l00353"></a>00353 <span class="keywordflow">if</span> (flent->affl)
<a name="l00354"></a>00354 {
<a name="l00355"></a>00355 icharcpy (cp, flent->affix);
<a name="l00356"></a>00356 cp += flent->affl;
<a name="l00357"></a>00357 *cp++ = <span class="charliteral">'+'</span>;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359 preadd = cp - tword2;
<a name="l00360"></a>00360 icharcpy (cp, tword);
<a name="l00361"></a>00361 cp += tlen;
<a name="l00362"></a>00362 <span class="keywordflow">if</span> (flent->stripl)
<a name="l00363"></a>00363 {
<a name="l00364"></a>00364 *cp++ = <span class="charliteral">'-'</span>;
<a name="l00365"></a>00365 icharcpy (cp, flent->strip);
<a name="l00366"></a>00366 }
<a name="l00367"></a>00367 }
<a name="l00368"></a>00368 }
<a name="l00369"></a>00369 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((dent = ispell_lookup (tword, 1)) != NULL
<a name="l00370"></a>00370 && TSTMASKBIT (dent->mask, flent->flagbit))
<a name="l00371"></a>00371 {
<a name="l00372"></a>00372 <span class="keywordflow">if</span> (m_numhits < MAX_HITS)
<a name="l00373"></a>00373 {
<a name="l00374"></a>00374 m_hits[m_numhits].dictent = dent;
<a name="l00375"></a>00375 m_hits[m_numhits].prefix = flent;
<a name="l00376"></a>00376 m_hits[m_numhits].suffix = NULL;
<a name="l00377"></a>00377 m_numhits++;
<a name="l00378"></a>00378 }
<a name="l00379"></a>00379 <span class="keywordflow">if</span> (!allhits)
<a name="l00380"></a>00380 {
<a name="l00381"></a>00381 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00382"></a>00382 <span class="preprocessor"></span> <span class="keywordflow">if</span> (cap_ok (word, &m_hits[0], len))
<a name="l00383"></a>00383 <span class="keywordflow">return</span>;
<a name="l00384"></a>00384 m_numhits = 0;
<a name="l00385"></a>00385 <span class="preprocessor">#else </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00386"></a>00386 <span class="keywordflow">return</span>;
<a name="l00387"></a>00387 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389 }
<a name="l00390"></a>00390 <span class="comment">/*</span>
<a name="l00391"></a>00391 <span class="comment"> * Handle cross-products.</span>
<a name="l00392"></a>00392 <span class="comment"> */</span>
<a name="l00393"></a>00393 <span class="keywordflow">if</span> (flent->flagflags & FF_CROSSPRODUCT)
<a name="l00394"></a>00394 chk_suf (word, tword, tlen, sfxopts | FF_CROSSPRODUCT,
<a name="l00395"></a>00395 flent, ignoreflagbits, allhits);
<a name="l00396"></a>00396 }
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398 }
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400
<a name="l00412"></a>00412 <span class="keywordtype">void</span>
<a name="l00413"></a>00413 ISpellChecker::chk_suf (ichar_t *word, ichar_t *ucword,
<a name="l00414"></a>00414 <span class="keywordtype">int</span> len, <span class="keywordtype">int</span> optflags, <span class="keyword">struct</span> flagent *pfxent,
<a name="l00415"></a>00415 <span class="keywordtype">int</span> ignoreflagbits, <span class="keywordtype">int</span> allhits)
<a name="l00416"></a>00416 {
<a name="l00417"></a>00417 <span class="keyword">register</span> ichar_t * cp; <span class="comment">/* Pointer to char to index on */</span>
<a name="l00418"></a>00418 <span class="keyword">struct </span>flagptr * ind; <span class="comment">/* Flag index table to test */</span>
<a name="l00419"></a>00419
<a name="l00420"></a>00420 suf_list_chk (word, ucword, len, &m_sflagindex[0], optflags, pfxent,
<a name="l00421"></a>00421 ignoreflagbits, allhits);
<a name="l00422"></a>00422 cp = ucword + len - 1;
<a name="l00423"></a>00423 <span class="comment">/* HACK: bail on unrecognized chars */</span>
<a name="l00424"></a>00424 <span class="keywordflow">if</span> (*cp >= (SET_SIZE + MAXSTRINGCHARS))
<a name="l00425"></a>00425 <span class="keywordflow">return</span>;
<a name="l00426"></a>00426 ind = &m_sflagindex[*cp];
<a name="l00427"></a>00427 <span class="keywordflow">while</span> (ind->numents == 0 && ind->pu.fp != NULL)
<a name="l00428"></a>00428 {
<a name="l00429"></a>00429 <span class="keywordflow">if</span> (cp == ucword)
<a name="l00430"></a>00430 <span class="keywordflow">return</span>;
<a name="l00431"></a>00431 <span class="keywordflow">if</span> (ind->pu.fp[0].numents)
<a name="l00432"></a>00432 {
<a name="l00433"></a>00433 suf_list_chk (word, ucword, len, &ind->pu.fp[0],
<a name="l00434"></a>00434 optflags, pfxent, ignoreflagbits, allhits);
<a name="l00435"></a>00435 <span class="keywordflow">if</span> (m_numhits != 0 && !allhits && <span class="comment">/* !cflag && */</span> !ignoreflagbits)
<a name="l00436"></a>00436 <span class="keywordflow">return</span>;
<a name="l00437"></a>00437 }
<a name="l00438"></a>00438 <span class="comment">/* HACK: bail on unrecognized chars */</span>
<a name="l00439"></a>00439 <span class="keywordflow">if</span> (*(cp-1) >= (SET_SIZE + MAXSTRINGCHARS))
<a name="l00440"></a>00440 <span class="keywordflow">return</span>;
<a name="l00441"></a>00441 ind = &ind->pu.fp[*--cp];
<a name="l00442"></a>00442 }
<a name="l00443"></a>00443 suf_list_chk (word, ucword, len, ind, optflags, pfxent,
<a name="l00444"></a>00444 ignoreflagbits, allhits);
<a name="l00445"></a>00445 }
<a name="l00446"></a>00446
<a name="l00457"></a>00457 <span class="keywordtype">void</span> ISpellChecker::suf_list_chk (ichar_t *word, ichar_t *ucword,
<a name="l00458"></a>00458 <span class="keywordtype">int</span> len, <span class="keyword">struct</span> flagptr *ind, <span class="keywordtype">int</span> optflags,
<a name="l00459"></a>00459 <span class="keyword">struct</span> flagent *pfxent, <span class="keywordtype">int</span> ignoreflagbits, <span class="keywordtype">int</span> allhits)
<a name="l00460"></a>00460 {
<a name="l00461"></a>00461 <span class="keyword">register</span> ichar_t * cp; <span class="comment">/* Pointer into end of ucword */</span>
<a name="l00462"></a>00462 <span class="keywordtype">int</span> cond; <span class="comment">/* Condition number */</span>
<a name="l00463"></a>00463 <span class="keyword">struct </span>dent * dent; <span class="comment">/* Dictionary entry we found */</span>
<a name="l00464"></a>00464 <span class="keywordtype">int</span> entcount; <span class="comment">/* Number of entries to process */</span>
<a name="l00465"></a>00465 <span class="keyword">register</span> <span class="keyword">struct </span>flagent *
<a name="l00466"></a>00466 flent; <span class="comment">/* Current table entry */</span>
<a name="l00467"></a>00467 <span class="keywordtype">int</span> preadd; <span class="comment">/* Length added to tword2 as prefix */</span>
<a name="l00468"></a>00468 <span class="keyword">register</span> <span class="keywordtype">int</span> tlen; <span class="comment">/* Length of tword */</span>
<a name="l00469"></a>00469 ichar_t tword[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4]; <span class="comment">/* Tmp cpy */</span>
<a name="l00470"></a>00470 ichar_t tword2[<span class="keyword">sizeof</span> tword]; <span class="comment">/* 2nd copy for ins_root_cap */</span>
<a name="l00471"></a>00471
<a name="l00472"></a>00472 icharcpy (tword, ucword);
<a name="l00473"></a>00473 <span class="keywordflow">for</span> (flent = ind->pu.ent, entcount = ind->numents;
<a name="l00474"></a>00474 entcount > 0;
<a name="l00475"></a>00475 flent++, entcount--)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 <span class="keywordflow">if</span> ((optflags & FF_CROSSPRODUCT) != 0
<a name="l00478"></a>00478 && (flent->flagflags & FF_CROSSPRODUCT) == 0)
<a name="l00479"></a>00479 <span class="keywordflow">continue</span>;
<a name="l00480"></a>00480 <span class="comment">/*</span>
<a name="l00481"></a>00481 <span class="comment"> * If this is a compound-only affix, ignore it unless we're</span>
<a name="l00482"></a>00482 <span class="comment"> * looking for that specific thing.</span>
<a name="l00483"></a>00483 <span class="comment"> */</span>
<a name="l00484"></a>00484 <span class="keywordflow">if</span> ((flent->flagflags & FF_COMPOUNDONLY) != 0
<a name="l00485"></a>00485 && (optflags & FF_COMPOUNDONLY) == 0)
<a name="l00486"></a>00486 <span class="keywordflow">continue</span>;
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="comment">/*</span>
<a name="l00489"></a>00489 <span class="comment"> * See if the suffix matches.</span>
<a name="l00490"></a>00490 <span class="comment"> */</span>
<a name="l00491"></a>00491 tlen = len - flent->affl;
<a name="l00492"></a>00492 <span class="keywordflow">if</span> (tlen > 0
<a name="l00493"></a>00493 && (flent->affl == 0
<a name="l00494"></a>00494 || icharcmp (flent->affix, ucword + tlen) == 0)
<a name="l00495"></a>00495 && tlen + flent->stripl >= flent->numconds)
<a name="l00496"></a>00496 {
<a name="l00497"></a>00497 <span class="comment">/*</span>
<a name="l00498"></a>00498 <span class="comment"> * The suffix matches. Remove it, replace it by the "strip"</span>
<a name="l00499"></a>00499 <span class="comment"> * string (if any), and check the original conditions.</span>
<a name="l00500"></a>00500 <span class="comment"> */</span>
<a name="l00501"></a>00501 icharcpy (tword, ucword);
<a name="l00502"></a>00502 cp = tword + tlen;
<a name="l00503"></a>00503 <span class="keywordflow">if</span> (flent->stripl)
<a name="l00504"></a>00504 {
<a name="l00505"></a>00505 icharcpy (cp, flent->strip);
<a name="l00506"></a>00506 tlen += flent->stripl;
<a name="l00507"></a>00507 cp = tword + tlen;
<a name="l00508"></a>00508 }
<a name="l00509"></a>00509 <span class="keywordflow">else</span>
<a name="l00510"></a>00510 *cp = <span class="charliteral">'\0'</span>;
<a name="l00511"></a>00511 <span class="keywordflow">for</span> (cond = flent->numconds; --cond >= 0; )
<a name="l00512"></a>00512 {
<a name="l00513"></a>00513 <span class="keywordflow">if</span> ((flent->conds[*--cp] & (1 << cond)) == 0)
<a name="l00514"></a>00514 <span class="keywordflow">break</span>;
<a name="l00515"></a>00515 }
<a name="l00516"></a>00516 <span class="keywordflow">if</span> (cond < 0)
<a name="l00517"></a>00517 {
<a name="l00518"></a>00518 <span class="comment">/*</span>
<a name="l00519"></a>00519 <span class="comment"> * The conditions match. See if the word is in the</span>
<a name="l00520"></a>00520 <span class="comment"> * dictionary.</span>
<a name="l00521"></a>00521 <span class="comment"> */</span>
<a name="l00522"></a>00522 <span class="keywordflow">if</span> (ignoreflagbits)
<a name="l00523"></a>00523 {
<a name="l00524"></a>00524 <span class="keywordflow">if</span> ((dent = ispell_lookup (tword, 1)) != NULL)
<a name="l00525"></a>00525 {
<a name="l00526"></a>00526 cp = tword2;
<a name="l00527"></a>00527 <span class="keywordflow">if</span> ((optflags & FF_CROSSPRODUCT)
<a name="l00528"></a>00528 && pfxent->affl != 0)
<a name="l00529"></a>00529 {
<a name="l00530"></a>00530 icharcpy (cp, pfxent->affix);
<a name="l00531"></a>00531 cp += pfxent->affl;
<a name="l00532"></a>00532 *cp++ = <span class="charliteral">'+'</span>;
<a name="l00533"></a>00533 }
<a name="l00534"></a>00534 preadd = cp - tword2;
<a name="l00535"></a>00535 icharcpy (cp, tword);
<a name="l00536"></a>00536 cp += tlen;
<a name="l00537"></a>00537 <span class="keywordflow">if</span> ((optflags & FF_CROSSPRODUCT)
<a name="l00538"></a>00538 && pfxent->stripl != 0)
<a name="l00539"></a>00539 {
<a name="l00540"></a>00540 *cp++ = <span class="charliteral">'-'</span>;
<a name="l00541"></a>00541 icharcpy (cp, pfxent->strip);
<a name="l00542"></a>00542 cp += pfxent->stripl;
<a name="l00543"></a>00543 }
<a name="l00544"></a>00544 <span class="keywordflow">if</span> (flent->stripl)
<a name="l00545"></a>00545 {
<a name="l00546"></a>00546 *cp++ = <span class="charliteral">'-'</span>;
<a name="l00547"></a>00547 icharcpy (cp, flent->strip);
<a name="l00548"></a>00548 cp += flent->stripl;
<a name="l00549"></a>00549 }
<a name="l00550"></a>00550 <span class="keywordflow">if</span> (flent->affl)
<a name="l00551"></a>00551 {
<a name="l00552"></a>00552 *cp++ = <span class="charliteral">'+'</span>;
<a name="l00553"></a>00553 icharcpy (cp, flent->affix);
<a name="l00554"></a>00554 cp += flent->affl;
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556 }
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((dent = ispell_lookup (tword, 1)) != NULL
<a name="l00559"></a>00559 && TSTMASKBIT (dent->mask, flent->flagbit)
<a name="l00560"></a>00560 && ((optflags & FF_CROSSPRODUCT) == 0
<a name="l00561"></a>00561 || TSTMASKBIT (dent->mask, pfxent->flagbit)))
<a name="l00562"></a>00562 {
<a name="l00563"></a>00563 <span class="keywordflow">if</span> (m_numhits < MAX_HITS)
<a name="l00564"></a>00564 {
<a name="l00565"></a>00565 m_hits[m_numhits].dictent = dent;
<a name="l00566"></a>00566 m_hits[m_numhits].prefix = pfxent;
<a name="l00567"></a>00567 m_hits[m_numhits].suffix = flent;
<a name="l00568"></a>00568 m_numhits++;
<a name="l00569"></a>00569 }
<a name="l00570"></a>00570 <span class="keywordflow">if</span> (!allhits)
<a name="l00571"></a>00571 {
<a name="l00572"></a>00572 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00573"></a>00573 <span class="preprocessor"></span> <span class="keywordflow">if</span> (cap_ok (word, &m_hits[0], len))
<a name="l00574"></a>00574 <span class="keywordflow">return</span>;
<a name="l00575"></a>00575 m_numhits = 0;
<a name="l00576"></a>00576 <span class="preprocessor">#else </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00577"></a>00577 <span class="keywordflow">return</span>;
<a name="l00578"></a>00578 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00579"></a>00579 }
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581 }
<a name="l00582"></a>00582 }
<a name="l00583"></a>00583 }
<a name="l00584"></a>00584 }
<a name="l00585"></a>00585
<a name="l00597"></a>00597 <span class="keywordtype">int</span> ISpellChecker::expand_pre (<span class="keywordtype">char</span> *croot, ichar_t *rootword, MASKTYPE mask[],
<a name="l00598"></a>00598 <span class="keywordtype">int</span> option, <span class="keywordtype">char</span> *extra)
<a name="l00599"></a>00599 {
<a name="l00600"></a>00600 <span class="keywordtype">int</span> entcount; <span class="comment">/* No. of entries to process */</span>
<a name="l00601"></a>00601 <span class="keywordtype">int</span> explength; <span class="comment">/* Length of expansions */</span>
<a name="l00602"></a>00602 <span class="keyword">register</span> <span class="keyword">struct </span>flagent *
<a name="l00603"></a>00603 flent; <span class="comment">/* Current table entry */</span>
<a name="l00604"></a>00604
<a name="l00605"></a>00605 <span class="keywordflow">for</span> (flent = m_pflaglist, entcount = m_numpflags, explength = 0;
<a name="l00606"></a>00606 entcount > 0;
<a name="l00607"></a>00607 flent++, entcount--)
<a name="l00608"></a>00608 {
<a name="l00609"></a>00609 <span class="keywordflow">if</span> (TSTMASKBIT (mask, flent->flagbit))
<a name="l00610"></a>00610 explength +=
<a name="l00611"></a>00611 pr_pre_expansion (croot, rootword, flent, mask, option, extra);
<a name="l00612"></a>00612 }
<a name="l00613"></a>00613 <span class="keywordflow">return</span> explength;
<a name="l00614"></a>00614 }
<a name="l00615"></a>00615
<a name="l00628"></a>00628 <span class="keywordtype">int</span> ISpellChecker::pr_pre_expansion ( <span class="keywordtype">char</span> *croot, ichar_t *rootword,
<a name="l00629"></a>00629 <span class="keyword">struct</span> flagent *flent, MASKTYPE mask[], <span class="keywordtype">int</span> option,
<a name="l00630"></a>00630 <span class="keywordtype">char</span> *extra)
<a name="l00631"></a>00631 {
<a name="l00632"></a>00632 <span class="keywordtype">int</span> cond; <span class="comment">/* Current condition number */</span>
<a name="l00633"></a>00633 <span class="keyword">register</span> ichar_t * nextc; <span class="comment">/* Next case choice */</span>
<a name="l00634"></a>00634 <span class="keywordtype">int</span> tlen; <span class="comment">/* Length of tword */</span>
<a name="l00635"></a>00635 ichar_t tword[INPUTWORDLEN + MAXAFFIXLEN]; <span class="comment">/* Temp */</span>
<a name="l00636"></a>00636
<a name="l00637"></a>00637 tlen = icharlen (rootword);
<a name="l00638"></a>00638 <span class="keywordflow">if</span> (flent->numconds > tlen)
<a name="l00639"></a>00639 <span class="keywordflow">return</span> 0;
<a name="l00640"></a>00640 tlen -= flent->stripl;
<a name="l00641"></a>00641 <span class="keywordflow">if</span> (tlen <= 0)
<a name="l00642"></a>00642 <span class="keywordflow">return</span> 0;
<a name="l00643"></a>00643 tlen += flent->affl;
<a name="l00644"></a>00644 <span class="keywordflow">for</span> (cond = 0, nextc = rootword; cond < flent->numconds; cond++)
<a name="l00645"></a>00645 {
<a name="l00646"></a>00646 <span class="keywordflow">if</span> ((flent->conds[mytoupper (*nextc++)] & (1 << cond)) == 0)
<a name="l00647"></a>00647 <span class="keywordflow">return</span> 0;
<a name="l00648"></a>00648 }
<a name="l00649"></a>00649 <span class="comment">/*</span>
<a name="l00650"></a>00650 <span class="comment"> * The conditions are satisfied. Copy the word, add the prefix,</span>
<a name="l00651"></a>00651 <span class="comment"> * and make it the proper case. This code is carefully written</span>
<a name="l00652"></a>00652 <span class="comment"> * to match that ins_cap and cap_ok. Note that the affix, as</span>
<a name="l00653"></a>00653 <span class="comment"> * inserted, is uppercase.</span>
<a name="l00654"></a>00654 <span class="comment"> *</span>
<a name="l00655"></a>00655 <span class="comment"> * There is a tricky bit here: if the root is capitalized, we</span>
<a name="l00656"></a>00656 <span class="comment"> * want a capitalized result. If the root is followcase, however,</span>
<a name="l00657"></a>00657 <span class="comment"> * we want to duplicate the case of the first remaining letter</span>
<a name="l00658"></a>00658 <span class="comment"> * of the root. In other words, "Loved/U" should generate "Unloved",</span>
<a name="l00659"></a>00659 <span class="comment"> * but "LOved/U" should generate "UNLOved" and "lOved/U" should</span>
<a name="l00660"></a>00660 <span class="comment"> * produce "unlOved".</span>
<a name="l00661"></a>00661 <span class="comment"> */</span>
<a name="l00662"></a>00662 <span class="keywordflow">if</span> (flent->affl)
<a name="l00663"></a>00663 {
<a name="l00664"></a>00664 icharcpy (tword, flent->affix);
<a name="l00665"></a>00665 nextc = tword + flent->affl;
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 icharcpy (nextc, rootword + flent->stripl);
<a name="l00668"></a>00668 <span class="keywordflow">if</span> (myupper (rootword[0]))
<a name="l00669"></a>00669 {
<a name="l00670"></a>00670 <span class="comment">/* We must distinguish followcase from capitalized and all-upper */</span>
<a name="l00671"></a>00671 <span class="keywordflow">for</span> (nextc = rootword + 1; *nextc; nextc++)
<a name="l00672"></a>00672 {
<a name="l00673"></a>00673 <span class="keywordflow">if</span> (!myupper (*nextc))
<a name="l00674"></a>00674 <span class="keywordflow">break</span>;
<a name="l00675"></a>00675 }
<a name="l00676"></a>00676 <span class="keywordflow">if</span> (*nextc)
<a name="l00677"></a>00677 {
<a name="l00678"></a>00678 <span class="comment">/* It's a followcase or capitalized word. Figure out which. */</span>
<a name="l00679"></a>00679 <span class="keywordflow">for</span> ( ; *nextc; nextc++)
<a name="l00680"></a>00680 {
<a name="l00681"></a>00681 <span class="keywordflow">if</span> (myupper (*nextc))
<a name="l00682"></a>00682 <span class="keywordflow">break</span>;
<a name="l00683"></a>00683 }
<a name="l00684"></a>00684 <span class="keywordflow">if</span> (*nextc)
<a name="l00685"></a>00685 {
<a name="l00686"></a>00686 <span class="comment">/* It's followcase. */</span>
<a name="l00687"></a>00687 <span class="keywordflow">if</span> (!myupper (tword[flent->affl]))
<a name="l00688"></a>00688 forcelc (tword, flent->affl);
<a name="l00689"></a>00689 }
<a name="l00690"></a>00690 <span class="keywordflow">else</span>
<a name="l00691"></a>00691 {
<a name="l00692"></a>00692 <span class="comment">/* It's capitalized */</span>
<a name="l00693"></a>00693 forcelc (tword + 1, tlen - 1);
<a name="l00694"></a>00694 }
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696 }
<a name="l00697"></a>00697 <span class="keywordflow">else</span>
<a name="l00698"></a>00698 {
<a name="l00699"></a>00699 <span class="comment">/* Followcase or all-lower, we don't care which */</span>
<a name="l00700"></a>00700 <span class="keywordflow">if</span> (!myupper (*nextc))
<a name="l00701"></a>00701 forcelc (tword, flent->affl);
<a name="l00702"></a>00702 }
<a name="l00703"></a>00703 <span class="keywordflow">if</span> (option == 3)
<a name="l00704"></a>00704 printf (<span class="stringliteral">"\n%s"</span>, croot);
<a name="l00705"></a>00705 <span class="keywordflow">if</span> (option != 4)
<a name="l00706"></a>00706 printf (<span class="stringliteral">" %s%s"</span>, ichartosstr (tword, 1), extra);
<a name="l00707"></a>00707 <span class="keywordflow">if</span> (flent->flagflags & FF_CROSSPRODUCT)
<a name="l00708"></a>00708 <span class="keywordflow">return</span> tlen
<a name="l00709"></a>00709 + expand_suf (croot, tword, mask, FF_CROSSPRODUCT, option, extra);
<a name="l00710"></a>00710 <span class="keywordflow">else</span>
<a name="l00711"></a>00711 <span class="keywordflow">return</span> tlen;
<a name="l00712"></a>00712 }
<a name="l00713"></a>00713
<a name="l00726"></a>00726 <span class="keywordtype">int</span> ISpellChecker::expand_suf (<span class="keywordtype">char</span> *croot, ichar_t *rootword, MASKTYPE mask[],
<a name="l00727"></a>00727 <span class="keywordtype">int</span> optflags, <span class="keywordtype">int</span> option, <span class="keywordtype">char</span> *extra)
<a name="l00728"></a>00728 {
<a name="l00729"></a>00729 <span class="keywordtype">int</span> entcount; <span class="comment">/* No. of entries to process */</span>
<a name="l00730"></a>00730 <span class="keywordtype">int</span> explength; <span class="comment">/* Length of expansions */</span>
<a name="l00731"></a>00731 <span class="keyword">register</span> <span class="keyword">struct </span>flagent *
<a name="l00732"></a>00732 flent; <span class="comment">/* Current table entry */</span>
<a name="l00733"></a>00733
<a name="l00734"></a>00734 <span class="keywordflow">for</span> (flent = m_sflaglist, entcount = m_numsflags, explength = 0;
<a name="l00735"></a>00735 entcount > 0;
<a name="l00736"></a>00736 flent++, entcount--)
<a name="l00737"></a>00737 {
<a name="l00738"></a>00738 <span class="keywordflow">if</span> (TSTMASKBIT (mask, flent->flagbit))
<a name="l00739"></a>00739 {
<a name="l00740"></a>00740 <span class="keywordflow">if</span> ((optflags & FF_CROSSPRODUCT) == 0
<a name="l00741"></a>00741 || (flent->flagflags & FF_CROSSPRODUCT))
<a name="l00742"></a>00742 explength +=
<a name="l00743"></a>00743 pr_suf_expansion (croot, rootword, flent, option, extra);
<a name="l00744"></a>00744 }
<a name="l00745"></a>00745 }
<a name="l00746"></a>00746 <span class="keywordflow">return</span> explength;
<a name="l00747"></a>00747 }
<a name="l00748"></a>00748
<a name="l00760"></a>00760 <span class="keywordtype">int</span> ISpellChecker::pr_suf_expansion (<span class="keywordtype">char</span> *croot, ichar_t *rootword,
<a name="l00761"></a>00761 <span class="keyword">struct</span> flagent *flent, <span class="keywordtype">int</span> option, <span class="keywordtype">char</span> *extra)
<a name="l00762"></a>00762 {
<a name="l00763"></a>00763 <span class="keywordtype">int</span> cond; <span class="comment">/* Current condition number */</span>
<a name="l00764"></a>00764 <span class="keyword">register</span> ichar_t * nextc; <span class="comment">/* Next case choice */</span>
<a name="l00765"></a>00765 <span class="keywordtype">int</span> tlen; <span class="comment">/* Length of tword */</span>
<a name="l00766"></a>00766 ichar_t tword[INPUTWORDLEN + MAXAFFIXLEN]; <span class="comment">/* Temp */</span>
<a name="l00767"></a>00767
<a name="l00768"></a>00768 tlen = icharlen (rootword);
<a name="l00769"></a>00769 cond = flent->numconds;
<a name="l00770"></a>00770 <span class="keywordflow">if</span> (cond > tlen)
<a name="l00771"></a>00771 <span class="keywordflow">return</span> 0;
<a name="l00772"></a>00772 <span class="keywordflow">if</span> (tlen - flent->stripl <= 0)
<a name="l00773"></a>00773 <span class="keywordflow">return</span> 0;
<a name="l00774"></a>00774 <span class="keywordflow">for</span> (nextc = rootword + tlen; --cond >= 0; )
<a name="l00775"></a>00775 {
<a name="l00776"></a>00776 <span class="keywordflow">if</span> ((flent->conds[mytoupper (*--nextc)] & (1 << cond)) == 0)
<a name="l00777"></a>00777 <span class="keywordflow">return</span> 0;
<a name="l00778"></a>00778 }
<a name="l00779"></a>00779 <span class="comment">/*</span>
<a name="l00780"></a>00780 <span class="comment"> * The conditions are satisfied. Copy the word, add the suffix,</span>
<a name="l00781"></a>00781 <span class="comment"> * and make it match the case of the last remaining character of the</span>
<a name="l00782"></a>00782 <span class="comment"> * root. Again, this code carefully matches ins_cap and cap_ok.</span>
<a name="l00783"></a>00783 <span class="comment"> */</span>
<a name="l00784"></a>00784 icharcpy (tword, rootword);
<a name="l00785"></a>00785 nextc = tword + tlen - flent->stripl;
<a name="l00786"></a>00786 <span class="keywordflow">if</span> (flent->affl)
<a name="l00787"></a>00787 {
<a name="l00788"></a>00788 icharcpy (nextc, flent->affix);
<a name="l00789"></a>00789 <span class="keywordflow">if</span> (!myupper (nextc[-1]))
<a name="l00790"></a>00790 forcelc (nextc, flent->affl);
<a name="l00791"></a>00791 }
<a name="l00792"></a>00792 <span class="keywordflow">else</span>
<a name="l00793"></a>00793 *nextc = 0;
<a name="l00794"></a>00794 <span class="keywordflow">if</span> (option == 3)
<a name="l00795"></a>00795 printf (<span class="stringliteral">"\n%s"</span>, croot);
<a name="l00796"></a>00796 <span class="keywordflow">if</span> (option != 4)
<a name="l00797"></a>00797 printf (<span class="stringliteral">" %s%s"</span>, ichartosstr (tword, 1), extra);
<a name="l00798"></a>00798 <span class="keywordflow">return</span> tlen + flent->affl - flent->stripl;
<a name="l00799"></a>00799 }
<a name="l00800"></a>00800
<a name="l00805"></a>00805 <span class="keywordtype">void</span> ISpellChecker::forcelc (ichar_t *dst, <span class="keywordtype">int</span> len) <span class="comment">/* Force to lowercase */</span>
<a name="l00806"></a>00806 {
<a name="l00807"></a>00807
<a name="l00808"></a>00808 <span class="keywordflow">for</span> ( ; --len >= 0; dst++)
<a name="l00809"></a>00809 *dst = mytolower (*dst);
<a name="l00810"></a>00810 }
</pre></div></div>
</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="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="classASpellDict.html">aspelldict</option>, <option value="classHSpellDict.html">hspelldict</option>, <option value="classKSpell2_1_1BackgroundChecker.html">kspell2::backgroundchecker</option>, <option value="classKSpell2_1_1Broker.html">kspell2::broker</option>, <option value="classKSpell2_1_1Client.html">kspell2::client</option>, <option value="classKSpell2_1_1Dictionary.html">kspell2::dictionary</option>, <option value="classKSpell2_1_1Filter.html">kspell2::filter</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>
