<?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: correct.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>correct.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">/* 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"> * correct.c - Routines to manage the higher-level aspects of spell-checking</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * This code originally resided in ispell.c, but was moved here to keep</span>
<a name="l00035"></a>00035 <span class="comment"> * file sizes smaller.</span>
<a name="l00036"></a>00036 <span class="comment"> *</span>
<a name="l00037"></a>00037 <span class="comment"> * Copyright (c), 1983, by Pace Willisson</span>
<a name="l00038"></a>00038 <span class="comment"> *</span>
<a name="l00039"></a>00039 <span class="comment"> * Copyright 1992, 1993, Geoff Kuenning, Granada Hills, CA</span>
<a name="l00040"></a>00040 <span class="comment"> * All rights reserved.</span>
<a name="l00041"></a>00041 <span class="comment"> *</span>
<a name="l00042"></a>00042 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00043"></a>00043 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00044"></a>00044 <span class="comment"> * are met:</span>
<a name="l00045"></a>00045 <span class="comment"> *</span>
<a name="l00046"></a>00046 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00047"></a>00047 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span>
<a name="l00048"></a>00048 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00049"></a>00049 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span>
<a name="l00050"></a>00050 <span class="comment"> * documentation and/or other materials provided with the distribution.</span>
<a name="l00051"></a>00051 <span class="comment"> * 3. All modifications to the source code must be clearly marked as</span>
<a name="l00052"></a>00052 <span class="comment"> * such. Binary redistributions based on modified source code</span>
<a name="l00053"></a>00053 <span class="comment"> * must be clearly marked as modified versions in the documentation</span>
<a name="l00054"></a>00054 <span class="comment"> * and/or other materials provided with the distribution.</span>
<a name="l00055"></a>00055 <span class="comment"> * 4. All advertising materials mentioning features or use of this software</span>
<a name="l00056"></a>00056 <span class="comment"> * must display the following acknowledgment:</span>
<a name="l00057"></a>00057 <span class="comment"> * This product includes software developed by Geoff Kuenning and</span>
<a name="l00058"></a>00058 <span class="comment"> * other unpaid contributors.</span>
<a name="l00059"></a>00059 <span class="comment"> * 5. The name of Geoff Kuenning may not be used to endorse or promote</span>
<a name="l00060"></a>00060 <span class="comment"> * products derived from this software without specific prior</span>
<a name="l00061"></a>00061 <span class="comment"> * written permission.</span>
<a name="l00062"></a>00062 <span class="comment"> *</span>
<a name="l00063"></a>00063 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS IS'' AND</span>
<a name="l00064"></a>00064 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span>
<a name="l00065"></a>00065 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span>
<a name="l00066"></a>00066 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL GEOFF KUENNING OR CONTRIBUTORS BE LIABLE</span>
<a name="l00067"></a>00067 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span>
<a name="l00068"></a>00068 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span>
<a name="l00069"></a>00069 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span>
<a name="l00070"></a>00070 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span>
<a name="l00071"></a>00071 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span>
<a name="l00072"></a>00072 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span>
<a name="l00073"></a>00073 <span class="comment"> * SUCH DAMAGE.</span>
<a name="l00074"></a>00074 <span class="comment"> */</span>
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="comment">/*</span>
<a name="l00077"></a>00077 <span class="comment"> * $Log$</span>
<a name="l00078"></a>00078 <span class="comment"> * Revision 1.1 2004/01/31 16:44:12 zrusin</span>
<a name="l00079"></a>00079 <span class="comment"> * ISpell plugin.</span>
<a name="l00080"></a>00080 <span class="comment"> *</span>
<a name="l00081"></a>00081 <span class="comment"> * Revision 1.4 2003/08/14 17:51:26 dom</span>
<a name="l00082"></a>00082 <span class="comment"> * update license - exception clause should be Lesser GPL</span>
<a name="l00083"></a>00083 <span class="comment"> *</span>
<a name="l00084"></a>00084 <span class="comment"> * Revision 1.3 2003/07/28 20:40:25 dom</span>
<a name="l00085"></a>00085 <span class="comment"> * fix up the license clause, further win32-registry proof some directory getting functions</span>
<a name="l00086"></a>00086 <span class="comment"> *</span>
<a name="l00087"></a>00087 <span class="comment"> * Revision 1.2 2003/07/16 22:52:35 dom</span>
<a name="l00088"></a>00088 <span class="comment"> * LGPL + exception license</span>
<a name="l00089"></a>00089 <span class="comment"> *</span>
<a name="l00090"></a>00090 <span class="comment"> * Revision 1.1 2003/07/15 01:15:04 dom</span>
<a name="l00091"></a>00091 <span class="comment"> * ispell enchant backend</span>
<a name="l00092"></a>00092 <span class="comment"> *</span>
<a name="l00093"></a>00093 <span class="comment"> * Revision 1.2 2003/01/29 05:50:11 hippietrail</span>
<a name="l00094"></a>00094 <span class="comment"> *</span>
<a name="l00095"></a>00095 <span class="comment"> * Fixed my mess in EncodingManager.</span>
<a name="l00096"></a>00096 <span class="comment"> * Changed many C casts to C++ casts.</span>
<a name="l00097"></a>00097 <span class="comment"> *</span>
<a name="l00098"></a>00098 <span class="comment"> * Revision 1.1 2003/01/24 05:52:31 hippietrail</span>
<a name="l00099"></a>00099 <span class="comment"> *</span>
<a name="l00100"></a>00100 <span class="comment"> * Refactored ispell code. Old ispell global variables had been put into</span>
<a name="l00101"></a>00101 <span class="comment"> * an allocated structure, a pointer to which was passed to many functions.</span>
<a name="l00102"></a>00102 <span class="comment"> * I have now made all such functions and variables private members of the</span>
<a name="l00103"></a>00103 <span class="comment"> * ISpellChecker class. It was C OO, now it's C++ OO.</span>
<a name="l00104"></a>00104 <span class="comment"> *</span>
<a name="l00105"></a>00105 <span class="comment"> * I've fixed the makefiles and tested compilation but am unable to test</span>
<a name="l00106"></a>00106 <span class="comment"> * operation. Please back out my changes if they cause problems which</span>
<a name="l00107"></a>00107 <span class="comment"> * are not obvious or easy to fix.</span>
<a name="l00108"></a>00108 <span class="comment"> *</span>
<a name="l00109"></a>00109 <span class="comment"> * Revision 1.7 2002/09/19 05:31:15 hippietrail</span>
<a name="l00110"></a>00110 <span class="comment"> *</span>
<a name="l00111"></a>00111 <span class="comment"> * More Ispell cleanup. Conditional globals and DEREF macros are removed.</span>
<a name="l00112"></a>00112 <span class="comment"> * K&R function declarations removed, converted to Doxygen style comments</span>
<a name="l00113"></a>00113 <span class="comment"> * where possible. No code has been changed (I hope). Compiles for me but</span>
<a name="l00114"></a>00114 <span class="comment"> * unable to test.</span>
<a name="l00115"></a>00115 <span class="comment"> *</span>
<a name="l00116"></a>00116 <span class="comment"> * Revision 1.6 2002/09/17 03:03:28 hippietrail</span>
<a name="l00117"></a>00117 <span class="comment"> *</span>
<a name="l00118"></a>00118 <span class="comment"> * After seeking permission on the developer list I've reformatted all the</span>
<a name="l00119"></a>00119 <span class="comment"> * spelling source which seemed to have parts which used 2, 3, 4, and 8</span>
<a name="l00120"></a>00120 <span class="comment"> * spaces for tabs. It should all look good with our standard 4-space</span>
<a name="l00121"></a>00121 <span class="comment"> * tabs now.</span>
<a name="l00122"></a>00122 <span class="comment"> * I've concentrated just on indentation in the actual code. More prettying</span>
<a name="l00123"></a>00123 <span class="comment"> * could be done.</span>
<a name="l00124"></a>00124 <span class="comment"> * * NO code changes were made *</span>
<a name="l00125"></a>00125 <span class="comment"> *</span>
<a name="l00126"></a>00126 <span class="comment"> * Revision 1.5 2002/09/13 17:20:12 mpritchett</span>
<a name="l00127"></a>00127 <span class="comment"> * Fix more warnings for Linux build</span>
<a name="l00128"></a>00128 <span class="comment"> *</span>
<a name="l00129"></a>00129 <span class="comment"> * Revision 1.4 2002/03/06 08:27:16 fjfranklin</span>
<a name="l00130"></a>00130 <span class="comment"> * o Only activate compound handling when the hash file says so (Per Larsson)</span>
<a name="l00131"></a>00131 <span class="comment"> *</span>
<a name="l00132"></a>00132 <span class="comment"> * Revision 1.3 2001/05/14 09:52:50 hub</span>
<a name="l00133"></a>00133 <span class="comment"> * Removed newMain.c from GNUmakefile.am</span>
<a name="l00134"></a>00134 <span class="comment"> *</span>
<a name="l00135"></a>00135 <span class="comment"> * C++ comments are not C comment. Changed to C comments</span>
<a name="l00136"></a>00136 <span class="comment"> *</span>
<a name="l00137"></a>00137 <span class="comment"> * Revision 1.2 2001/05/12 16:05:42 thomasf</span>
<a name="l00138"></a>00138 <span class="comment"> * Big pseudo changes to ispell to make it pass around a structure rather</span>
<a name="l00139"></a>00139 <span class="comment"> * than rely on all sorts of gloabals willy nilly here and there. Also</span>
<a name="l00140"></a>00140 <span class="comment"> * fixed our spelling class to work with accepting suggestions once more.</span>
<a name="l00141"></a>00141 <span class="comment"> * This code is dirty, gross and ugly (not to mention still not supporting</span>
<a name="l00142"></a>00142 <span class="comment"> * multiple hash sized just yet) but it works on my machine and will no</span>
<a name="l00143"></a>00143 <span class="comment"> * doubt break other machines.</span>
<a name="l00144"></a>00144 <span class="comment"> *</span>
<a name="l00145"></a>00145 <span class="comment"> * Revision 1.1 2001/04/15 16:01:24 tomas_f</span>
<a name="l00146"></a>00146 <span class="comment"> * moving to spell/xp</span>
<a name="l00147"></a>00147 <span class="comment"> *</span>
<a name="l00148"></a>00148 <span class="comment"> * Revision 1.2 1999/10/05 16:17:28 paul</span>
<a name="l00149"></a>00149 <span class="comment"> * Fixed build, and other tidyness.</span>
<a name="l00150"></a>00150 <span class="comment"> * Spell dialog enabled by default, with keyboard binding of F7.</span>
<a name="l00151"></a>00151 <span class="comment"> *</span>
<a name="l00152"></a>00152 <span class="comment"> * Revision 1.1 1999/09/29 23:33:32 justin</span>
<a name="l00153"></a>00153 <span class="comment"> * Updates to the underlying ispell-based code to support suggested corrections.</span>
<a name="l00154"></a>00154 <span class="comment"> *</span>
<a name="l00155"></a>00155 <span class="comment"> * Revision 1.59 1995/08/05 23:19:43 geoff</span>
<a name="l00156"></a>00156 <span class="comment"> * Fix a bug that caused offsets for long lines to be confused if the</span>
<a name="l00157"></a>00157 <span class="comment"> * line started with a quoting uparrow.</span>
<a name="l00158"></a>00158 <span class="comment"> *</span>
<a name="l00159"></a>00159 <span class="comment"> * Revision 1.58 1994/11/02 06:56:00 geoff</span>
<a name="l00160"></a>00160 <span class="comment"> * Remove the anyword feature, which I've decided is a bad idea.</span>
<a name="l00161"></a>00161 <span class="comment"> *</span>
<a name="l00162"></a>00162 <span class="comment"> * Revision 1.57 1994/10/26 05:12:39 geoff</span>
<a name="l00163"></a>00163 <span class="comment"> * Try boundary characters when inserting or substituting letters, except</span>
<a name="l00164"></a>00164 <span class="comment"> * (naturally) at word boundaries.</span>
<a name="l00165"></a>00165 <span class="comment"> *</span>
<a name="l00166"></a>00166 <span class="comment"> * Revision 1.56 1994/10/25 05:46:30 geoff</span>
<a name="l00167"></a>00167 <span class="comment"> * Fix an assignment inside a conditional that could generate spurious</span>
<a name="l00168"></a>00168 <span class="comment"> * warnings (as well as being bad style). Add support for the FF_ANYWORD</span>
<a name="l00169"></a>00169 <span class="comment"> * option.</span>
<a name="l00170"></a>00170 <span class="comment"> *</span>
<a name="l00171"></a>00171 <span class="comment"> * Revision 1.55 1994/09/16 04:48:24 geoff</span>
<a name="l00172"></a>00172 <span class="comment"> * Don't pass newlines from the input to various other routines, and</span>
<a name="l00173"></a>00173 <span class="comment"> * don't assume that those routines leave the input unchanged.</span>
<a name="l00174"></a>00174 <span class="comment"> *</span>
<a name="l00175"></a>00175 <span class="comment"> * Revision 1.54 1994/09/01 06:06:41 geoff</span>
<a name="l00176"></a>00176 <span class="comment"> * Change erasechar/killchar to uerasechar/ukillchar to avoid</span>
<a name="l00177"></a>00177 <span class="comment"> * shared-library problems on HP systems.</span>
<a name="l00178"></a>00178 <span class="comment"> *</span>
<a name="l00179"></a>00179 <span class="comment"> * Revision 1.53 1994/08/31 05:58:38 geoff</span>
<a name="l00180"></a>00180 <span class="comment"> * Add code to handle extremely long lines in -a mode without splitting</span>
<a name="l00181"></a>00181 <span class="comment"> * words or reporting incorrect offsets.</span>
<a name="l00182"></a>00182 <span class="comment"> *</span>
<a name="l00183"></a>00183 <span class="comment"> * Revision 1.52 1994/05/25 04:29:24 geoff</span>
<a name="l00184"></a>00184 <span class="comment"> * Fix a bug that caused line widths to be calculated incorrectly when</span>
<a name="l00185"></a>00185 <span class="comment"> * displaying lines containing tabs. Fix a couple of places where</span>
<a name="l00186"></a>00186 <span class="comment"> * characters were sign-extended incorrectly, which could cause 8-bit</span>
<a name="l00187"></a>00187 <span class="comment"> * characters to be displayed wrong.</span>
<a name="l00188"></a>00188 <span class="comment"> *</span>
<a name="l00189"></a>00189 <span class="comment"> * Revision 1.51 1994/05/17 06:44:05 geoff</span>
<a name="l00190"></a>00190 <span class="comment"> * Add support for controlled compound formation and the COMPOUNDONLY</span>
<a name="l00191"></a>00191 <span class="comment"> * option to affix flags.</span>
<a name="l00192"></a>00192 <span class="comment"> *</span>
<a name="l00193"></a>00193 <span class="comment"> * Revision 1.50 1994/04/27 05:20:14 geoff</span>
<a name="l00194"></a>00194 <span class="comment"> * Allow compound words to be formed from more than two components</span>
<a name="l00195"></a>00195 <span class="comment"> *</span>
<a name="l00196"></a>00196 <span class="comment"> * Revision 1.49 1994/04/27 01:50:31 geoff</span>
<a name="l00197"></a>00197 <span class="comment"> * Add support to correctly capitalize words generated as a result of a</span>
<a name="l00198"></a>00198 <span class="comment"> * missing-space suggestion.</span>
<a name="l00199"></a>00199 <span class="comment"> *</span>
<a name="l00200"></a>00200 <span class="comment"> * Revision 1.48 1994/04/03 23:23:02 geoff</span>
<a name="l00201"></a>00201 <span class="comment"> * Clean up the code in missingspace() to be a bit simpler and more</span>
<a name="l00202"></a>00202 <span class="comment"> * efficient.</span>
<a name="l00203"></a>00203 <span class="comment"> *</span>
<a name="l00204"></a>00204 <span class="comment"> * Revision 1.47 1994/03/15 06:24:23 geoff</span>
<a name="l00205"></a>00205 <span class="comment"> * Fix the +/-/~ commands to be independent. Allow the + command to</span>
<a name="l00206"></a>00206 <span class="comment"> * receive a suffix which is a deformatter type (currently hardwired to</span>
<a name="l00207"></a>00207 <span class="comment"> * be either tex or nroff/troff).</span>
<a name="l00208"></a>00208 <span class="comment"> *</span>
<a name="l00209"></a>00209 <span class="comment"> * Revision 1.46 1994/02/21 00:20:03 geoff</span>
<a name="l00210"></a>00210 <span class="comment"> * Fix some bugs that could cause bad displays in the interaction between</span>
<a name="l00211"></a>00211 <span class="comment"> * TeX parsing and string characters. Show_char now will not overrun</span>
<a name="l00212"></a>00212 <span class="comment"> * the inverse-video display area by accident.</span>
<a name="l00213"></a>00213 <span class="comment"> *</span>
<a name="l00214"></a>00214 <span class="comment"> * Revision 1.45 1994/02/14 00:34:51 geoff</span>
<a name="l00215"></a>00215 <span class="comment"> * Fix correct to accept length parameters for ctok and itok, so that it</span>
<a name="l00216"></a>00216 <span class="comment"> * can pass them to the to/from ichar routines.</span>
<a name="l00217"></a>00217 <span class="comment"> *</span>
<a name="l00218"></a>00218 <span class="comment"> * Revision 1.44 1994/01/25 07:11:22 geoff</span>
<a name="l00219"></a>00219 <span class="comment"> * Get rid of all old RCS log lines in preparation for the 3.1 release.</span>
<a name="l00220"></a>00220 <span class="comment"> *</span>
<a name="l00221"></a>00221 <span class="comment"> */</span>
<a name="l00222"></a>00222
<a name="l00223"></a>00223 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00224"></a>00224 <span class="preprocessor">#include <string.h></span>
<a name="l00225"></a>00225 <span class="preprocessor">#include <ctype.h></span>
<a name="l00226"></a>00226 <span class="preprocessor">#include "ispell_checker.h"</span>
<a name="l00227"></a>00227 <span class="preprocessor">#include "msgs.h"</span>
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="comment">/*</span>
<a name="l00230"></a>00230 <span class="comment">extern void upcase P ((ichar_t * string));</span>
<a name="l00231"></a>00231 <span class="comment">extern void lowcase P ((ichar_t * string));</span>
<a name="l00232"></a>00232 <span class="comment">extern ichar_t * strtosichar P ((char * in, int canonical));</span>
<a name="l00233"></a>00233 <span class="comment"></span>
<a name="l00234"></a>00234 <span class="comment">int compoundflag = COMPOUND_CONTROLLED;</span>
<a name="l00235"></a>00235 <span class="comment">*/</span>
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="comment">/*</span>
<a name="l00238"></a>00238 <span class="comment"> * \param a</span>
<a name="l00239"></a>00239 <span class="comment"> * \param b</span>
<a name="l00240"></a>00240 <span class="comment"> * \param canonical NZ for canonical string chars</span>
<a name="l00241"></a>00241 <span class="comment"> *</span>
<a name="l00242"></a>00242 <span class="comment"> * \return</span>
<a name="l00243"></a>00243 <span class="comment"> */</span>
<a name="l00244"></a>00244 <span class="keywordtype">int</span>
<a name="l00245"></a>00245 ISpellChecker::casecmp (<span class="keywordtype">char</span> *a, <span class="keywordtype">char</span> *b, <span class="keywordtype">int</span> canonical)
<a name="l00246"></a>00246 {
<a name="l00247"></a>00247 <span class="keyword">register</span> ichar_t * ap;
<a name="l00248"></a>00248 <span class="keyword">register</span> ichar_t * bp;
<a name="l00249"></a>00249 ichar_t inta[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
<a name="l00250"></a>00250 ichar_t intb[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
<a name="l00251"></a>00251
<a name="l00252"></a>00252 strtoichar (inta, a, <span class="keyword">sizeof</span> inta, canonical);
<a name="l00253"></a>00253 strtoichar (intb, b, <span class="keyword">sizeof</span> intb, canonical);
<a name="l00254"></a>00254 <span class="keywordflow">for</span> (ap = inta, bp = intb; *ap != 0; ap++, bp++)
<a name="l00255"></a>00255 {
<a name="l00256"></a>00256 <span class="keywordflow">if</span> (*ap != *bp)
<a name="l00257"></a>00257 {
<a name="l00258"></a>00258 <span class="keywordflow">if</span> (*bp == <span class="charliteral">'\0'</span>)
<a name="l00259"></a>00259 <span class="keywordflow">return</span> m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*ap];
<a name="l00260"></a>00260 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mylower (*ap))
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 <span class="keywordflow">if</span> (mylower (*bp) || mytoupper (*ap) != *bp)
<a name="l00263"></a>00263 <span class="keywordflow">return</span> static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*ap])
<a name="l00264"></a>00264 - static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*bp]);
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 <span class="keywordflow">else</span>
<a name="l00267"></a>00267 {
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (myupper (*bp) || mytolower (*ap) != *bp)
<a name="l00269"></a>00269 <span class="keywordflow">return</span> static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*ap])
<a name="l00270"></a>00270 - static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*bp]);
<a name="l00271"></a>00271 }
<a name="l00272"></a>00272 }
<a name="l00273"></a>00273 }
<a name="l00274"></a>00274 <span class="keywordflow">if</span> (*bp != <span class="charliteral">'\0'</span>)
<a name="l00275"></a>00275 <span class="keywordflow">return</span> -static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*bp]);
<a name="l00276"></a>00276 <span class="keywordflow">for</span> (ap = inta, bp = intb; *ap; ap++, bp++)
<a name="l00277"></a>00277 {
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (*ap != *bp)
<a name="l00279"></a>00279 {
<a name="l00280"></a>00280 <span class="keywordflow">return</span> static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*ap])
<a name="l00281"></a>00281 - static_cast<int>(m_hashheader.<a class="code" href="structhashheader.html#o20">sortorder</a>[*bp]);
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284 <span class="keywordflow">return</span> 0;
<a name="l00285"></a>00285 }
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="comment">/*</span>
<a name="l00288"></a>00288 <span class="comment"> * \param word</span>
<a name="l00289"></a>00289 <span class="comment"> */</span>
<a name="l00290"></a>00290 <span class="keywordtype">void</span>
<a name="l00291"></a>00291 ISpellChecker::makepossibilities (ichar_t *word)
<a name="l00292"></a>00292 {
<a name="l00293"></a>00293 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00294"></a>00294
<a name="l00295"></a>00295 <span class="keywordflow">for</span> (i = 0; i < MAXPOSSIBLE; i++)
<a name="l00296"></a>00296 m_possibilities[i][0] = 0;
<a name="l00297"></a>00297 m_pcount = 0;
<a name="l00298"></a>00298 m_maxposslen = 0;
<a name="l00299"></a>00299 m_easypossibilities = 0;
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00302"></a>00302 <span class="preprocessor"></span> wrongcapital (word);
<a name="l00303"></a>00303 <span class="preprocessor">#endif</span>
<a name="l00304"></a>00304 <span class="preprocessor"></span>
<a name="l00305"></a>00305 <span class="comment">/* </span>
<a name="l00306"></a>00306 <span class="comment"> * according to Pollock and Zamora, CACM April 1984 (V. 27, No. 4),</span>
<a name="l00307"></a>00307 <span class="comment"> * page 363, the correct order for this is:</span>
<a name="l00308"></a>00308 <span class="comment"> * OMISSION = TRANSPOSITION > INSERTION > SUBSTITUTION</span>
<a name="l00309"></a>00309 <span class="comment"> * thus, it was exactly backwards in the old version. -- PWP</span>
<a name="l00310"></a>00310 <span class="comment"> */</span>
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keywordflow">if</span> (m_pcount < MAXPOSSIBLE)
<a name="l00313"></a>00313 missingletter (word); <span class="comment">/* omission */</span>
<a name="l00314"></a>00314 <span class="keywordflow">if</span> (m_pcount < MAXPOSSIBLE)
<a name="l00315"></a>00315 transposedletter (word); <span class="comment">/* transposition */</span>
<a name="l00316"></a>00316 <span class="keywordflow">if</span> (m_pcount < MAXPOSSIBLE)
<a name="l00317"></a>00317 extraletter (word); <span class="comment">/* insertion */</span>
<a name="l00318"></a>00318 <span class="keywordflow">if</span> (m_pcount < MAXPOSSIBLE)
<a name="l00319"></a>00319 wrongletter (word); <span class="comment">/* substitution */</span>
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="keywordflow">if</span> ((m_hashheader.<a class="code" href="structhashheader.html#o17">compoundflag</a> != COMPOUND_ANYTIME) &&
<a name="l00322"></a>00322 m_pcount < MAXPOSSIBLE)
<a name="l00323"></a>00323 missingspace (word); <span class="comment">/* two words */</span>
<a name="l00324"></a>00324
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326
<a name="l00327"></a>00327 <span class="comment">/*</span>
<a name="l00328"></a>00328 <span class="comment"> * \param word</span>
<a name="l00329"></a>00329 <span class="comment"> *</span>
<a name="l00330"></a>00330 <span class="comment"> * \return</span>
<a name="l00331"></a>00331 <span class="comment"> */</span>
<a name="l00332"></a>00332 <span class="keywordtype">int</span>
<a name="l00333"></a>00333 ISpellChecker::insert (ichar_t *word)
<a name="l00334"></a>00334 {
<a name="l00335"></a>00335 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00336"></a>00336 <span class="keyword">register</span> <span class="keywordtype">char</span> * realword;
<a name="l00337"></a>00337
<a name="l00338"></a>00338 realword = ichartosstr (word, 0);
<a name="l00339"></a>00339 <span class="keywordflow">for</span> (i = 0; i < m_pcount; i++)
<a name="l00340"></a>00340 {
<a name="l00341"></a>00341 <span class="keywordflow">if</span> (strcmp (m_possibilities[i], realword) == 0)
<a name="l00342"></a>00342 <span class="keywordflow">return</span> (0);
<a name="l00343"></a>00343 }
<a name="l00344"></a>00344
<a name="l00345"></a>00345 strcpy (m_possibilities[m_pcount++], realword);
<a name="l00346"></a>00346 i = strlen (realword);
<a name="l00347"></a>00347 <span class="keywordflow">if</span> (i > m_maxposslen)
<a name="l00348"></a>00348 m_maxposslen = i;
<a name="l00349"></a>00349 <span class="keywordflow">if</span> (m_pcount >= MAXPOSSIBLE)
<a name="l00350"></a>00350 <span class="keywordflow">return</span> (-1);
<a name="l00351"></a>00351 <span class="keywordflow">else</span>
<a name="l00352"></a>00352 <span class="keywordflow">return</span> (0);
<a name="l00353"></a>00353 }
<a name="l00354"></a>00354
<a name="l00355"></a>00355 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00356"></a>00356 <span class="preprocessor"></span><span class="comment">/*</span>
<a name="l00357"></a>00357 <span class="comment"> * \param word</span>
<a name="l00358"></a>00358 <span class="comment"> */</span>
<a name="l00359"></a>00359 <span class="keywordtype">void</span>
<a name="l00360"></a>00360 ISpellChecker::wrongcapital (ichar_t *word)
<a name="l00361"></a>00361 {
<a name="l00362"></a>00362 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00363"></a>00363
<a name="l00364"></a>00364 <span class="comment">/*</span>
<a name="l00365"></a>00365 <span class="comment"> ** When the third parameter to "good" is nonzero, it ignores</span>
<a name="l00366"></a>00366 <span class="comment"> ** case. If the word matches this way, "ins_cap" will recapitalize</span>
<a name="l00367"></a>00367 <span class="comment"> ** it correctly.</span>
<a name="l00368"></a>00368 <span class="comment"> */</span>
<a name="l00369"></a>00369 <span class="keywordflow">if</span> (good (word, 0, 1, 0, 0))
<a name="l00370"></a>00370 {
<a name="l00371"></a>00371 icharcpy (newword, word);
<a name="l00372"></a>00372 upcase (newword);
<a name="l00373"></a>00373 ins_cap (newword, word);
<a name="l00374"></a>00374 }
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376 <span class="preprocessor">#endif</span>
<a name="l00377"></a>00377 <span class="preprocessor"></span>
<a name="l00378"></a>00378 <span class="comment">/*</span>
<a name="l00379"></a>00379 <span class="comment"> * \param word</span>
<a name="l00380"></a>00380 <span class="comment"> */</span>
<a name="l00381"></a>00381 <span class="keywordtype">void</span>
<a name="l00382"></a>00382 ISpellChecker::wrongletter (ichar_t *word)
<a name="l00383"></a>00383 {
<a name="l00384"></a>00384 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00385"></a>00385 <span class="keyword">register</span> <span class="keywordtype">int</span> j;
<a name="l00386"></a>00386 <span class="keyword">register</span> <span class="keywordtype">int</span> n;
<a name="l00387"></a>00387 ichar_t savechar;
<a name="l00388"></a>00388 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00389"></a>00389
<a name="l00390"></a>00390 n = icharlen (word);
<a name="l00391"></a>00391 icharcpy (newword, word);
<a name="l00392"></a>00392 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00393"></a>00393 <span class="preprocessor"></span> upcase (newword);
<a name="l00394"></a>00394 <span class="preprocessor">#endif</span>
<a name="l00395"></a>00395 <span class="preprocessor"></span>
<a name="l00396"></a>00396 <span class="keywordflow">for</span> (i = 0; i < n; i++)
<a name="l00397"></a>00397 {
<a name="l00398"></a>00398 savechar = newword[i];
<a name="l00399"></a>00399 <span class="keywordflow">for</span> (j=0; j < m_Trynum; ++j)
<a name="l00400"></a>00400 {
<a name="l00401"></a>00401 <span class="keywordflow">if</span> (m_Try[j] == savechar)
<a name="l00402"></a>00402 <span class="keywordflow">continue</span>;
<a name="l00403"></a>00403 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (isboundarych (m_Try[j]) && (i == 0 || i == n - 1))
<a name="l00404"></a>00404 <span class="keywordflow">continue</span>;
<a name="l00405"></a>00405 newword[i] = m_Try[j];
<a name="l00406"></a>00406 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00407"></a>00407 {
<a name="l00408"></a>00408 <span class="keywordflow">if</span> (ins_cap (newword, word) < 0)
<a name="l00409"></a>00409 <span class="keywordflow">return</span>;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412 newword[i] = savechar;
<a name="l00413"></a>00413 }
<a name="l00414"></a>00414 }
<a name="l00415"></a>00415
<a name="l00416"></a>00416 <span class="comment">/*</span>
<a name="l00417"></a>00417 <span class="comment"> * \param word</span>
<a name="l00418"></a>00418 <span class="comment"> */</span>
<a name="l00419"></a>00419 <span class="keywordtype">void</span>
<a name="l00420"></a>00420 ISpellChecker::extraletter (ichar_t *word)
<a name="l00421"></a>00421 {
<a name="l00422"></a>00422 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00423"></a>00423 <span class="keyword">register</span> ichar_t * p;
<a name="l00424"></a>00424 <span class="keyword">register</span> ichar_t * r;
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <span class="keywordflow">if</span> (icharlen (word) < 2)
<a name="l00427"></a>00427 <span class="keywordflow">return</span>;
<a name="l00428"></a>00428
<a name="l00429"></a>00429 icharcpy (newword, word + 1);
<a name="l00430"></a>00430 <span class="keywordflow">for</span> (p = word, r = newword; *p != 0; )
<a name="l00431"></a>00431 {
<a name="l00432"></a>00432 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00433"></a>00433 {
<a name="l00434"></a>00434 <span class="keywordflow">if</span> (ins_cap (newword, word) < 0)
<a name="l00435"></a>00435 <span class="keywordflow">return</span>;
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437 *r++ = *p++;
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439 }
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="comment">/*</span>
<a name="l00442"></a>00442 <span class="comment"> * \param word</span>
<a name="l00443"></a>00443 <span class="comment"> */</span>
<a name="l00444"></a>00444 <span class="keywordtype">void</span>
<a name="l00445"></a>00445 ISpellChecker::missingletter (ichar_t *word)
<a name="l00446"></a>00446 {
<a name="l00447"></a>00447 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN + 1];
<a name="l00448"></a>00448 <span class="keyword">register</span> ichar_t * p;
<a name="l00449"></a>00449 <span class="keyword">register</span> ichar_t * r;
<a name="l00450"></a>00450 <span class="keyword">register</span> <span class="keywordtype">int</span> i;
<a name="l00451"></a>00451
<a name="l00452"></a>00452 icharcpy (newword + 1, word);
<a name="l00453"></a>00453 <span class="keywordflow">for</span> (p = word, r = newword; *p != 0; )
<a name="l00454"></a>00454 {
<a name="l00455"></a>00455 <span class="keywordflow">for</span> (i = 0; i < m_Trynum; i++)
<a name="l00456"></a>00456 {
<a name="l00457"></a>00457 <span class="keywordflow">if</span> (isboundarych (m_Try[i]) && r == newword)
<a name="l00458"></a>00458 <span class="keywordflow">continue</span>;
<a name="l00459"></a>00459 *r = m_Try[i];
<a name="l00460"></a>00460 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00461"></a>00461 {
<a name="l00462"></a>00462 <span class="keywordflow">if</span> (ins_cap (newword, word) < 0)
<a name="l00463"></a>00463 <span class="keywordflow">return</span>;
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466 *r++ = *p++;
<a name="l00467"></a>00467 }
<a name="l00468"></a>00468 <span class="keywordflow">for</span> (i = 0; i < m_Trynum; i++)
<a name="l00469"></a>00469 {
<a name="l00470"></a>00470 <span class="keywordflow">if</span> (isboundarych (m_Try[i]))
<a name="l00471"></a>00471 <span class="keywordflow">continue</span>;
<a name="l00472"></a>00472 *r = m_Try[i];
<a name="l00473"></a>00473 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00474"></a>00474 {
<a name="l00475"></a>00475 <span class="keywordflow">if</span> (ins_cap (newword, word) < 0)
<a name="l00476"></a>00476 <span class="keywordflow">return</span>;
<a name="l00477"></a>00477 }
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480
<a name="l00481"></a>00481 <span class="comment">/*</span>
<a name="l00482"></a>00482 <span class="comment"> * \param word</span>
<a name="l00483"></a>00483 <span class="comment"> */</span>
<a name="l00484"></a>00484 <span class="keywordtype">void</span> ISpellChecker::missingspace (ichar_t *word)
<a name="l00485"></a>00485 {
<a name="l00486"></a>00486 ichar_t firsthalf[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00487"></a>00487 <span class="keywordtype">int</span> firstno; <span class="comment">/* Index into first */</span>
<a name="l00488"></a>00488 ichar_t * firstp; <span class="comment">/* Ptr into current firsthalf word */</span>
<a name="l00489"></a>00489 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN + 1];
<a name="l00490"></a>00490 <span class="keywordtype">int</span> nfirsthalf; <span class="comment">/* No. words saved in 1st half */</span>
<a name="l00491"></a>00491 <span class="keywordtype">int</span> nsecondhalf; <span class="comment">/* No. words saved in 2nd half */</span>
<a name="l00492"></a>00492 <span class="keyword">register</span> ichar_t * p;
<a name="l00493"></a>00493 ichar_t secondhalf[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00494"></a>00494 <span class="keywordtype">int</span> secondno; <span class="comment">/* Index into second */</span>
<a name="l00495"></a>00495
<a name="l00496"></a>00496 <span class="comment">/*</span>
<a name="l00497"></a>00497 <span class="comment"> ** We don't do words of length less than 3; this keeps us from</span>
<a name="l00498"></a>00498 <span class="comment"> ** splitting all two-letter words into two single letters. We</span>
<a name="l00499"></a>00499 <span class="comment"> ** also don't do maximum-length words, since adding the space</span>
<a name="l00500"></a>00500 <span class="comment"> ** would exceed the size of the "possibilities" array.</span>
<a name="l00501"></a>00501 <span class="comment"> */</span>
<a name="l00502"></a>00502 nfirsthalf = icharlen (word);
<a name="l00503"></a>00503 <span class="keywordflow">if</span> (nfirsthalf < 3 || nfirsthalf >= INPUTWORDLEN + MAXAFFIXLEN - 1)
<a name="l00504"></a>00504 <span class="keywordflow">return</span>;
<a name="l00505"></a>00505 icharcpy (newword + 1, word);
<a name="l00506"></a>00506 <span class="keywordflow">for</span> (p = newword + 1; p[1] != <span class="charliteral">'\0'</span>; p++)
<a name="l00507"></a>00507 {
<a name="l00508"></a>00508 p[-1] = *p;
<a name="l00509"></a>00509 *p = <span class="charliteral">'\0'</span>;
<a name="l00510"></a>00510 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00511"></a>00511 {
<a name="l00512"></a>00512 <span class="comment">/*</span>
<a name="l00513"></a>00513 <span class="comment"> * Save_cap must be called before good() is called on the</span>
<a name="l00514"></a>00514 <span class="comment"> * second half, because it uses state left around by</span>
<a name="l00515"></a>00515 <span class="comment"> * good(). This is unfortunate because it wastes a bit of</span>
<a name="l00516"></a>00516 <span class="comment"> * time, but I don't think it's a significant performance</span>
<a name="l00517"></a>00517 <span class="comment"> * problem.</span>
<a name="l00518"></a>00518 <span class="comment"> */</span>
<a name="l00519"></a>00519 nfirsthalf = save_cap (newword, word, firsthalf);
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (good (p + 1, 0, 1, 0, 0))
<a name="l00521"></a>00521 {
<a name="l00522"></a>00522 nsecondhalf = save_cap (p + 1, p + 1, secondhalf);
<a name="l00523"></a>00523 <span class="keywordflow">for</span> (firstno = 0; firstno < nfirsthalf; firstno++)
<a name="l00524"></a>00524 {
<a name="l00525"></a>00525 firstp = &firsthalf[firstno][p - newword];
<a name="l00526"></a>00526 <span class="keywordflow">for</span> (secondno = 0; secondno < nsecondhalf; secondno++)
<a name="l00527"></a>00527 {
<a name="l00528"></a>00528 *firstp = <span class="charliteral">' '</span>;
<a name="l00529"></a>00529 icharcpy (firstp + 1, secondhalf[secondno]);
<a name="l00530"></a>00530 <span class="keywordflow">if</span> (insert (firsthalf[firstno]) < 0)
<a name="l00531"></a>00531 <span class="keywordflow">return</span>;
<a name="l00532"></a>00532 *firstp = <span class="charliteral">'-'</span>;
<a name="l00533"></a>00533 <span class="keywordflow">if</span> (insert (firsthalf[firstno]) < 0)
<a name="l00534"></a>00534 <span class="keywordflow">return</span>;
<a name="l00535"></a>00535 }
<a name="l00536"></a>00536 }
<a name="l00537"></a>00537 }
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541
<a name="l00542"></a>00542 <span class="comment">/*</span>
<a name="l00543"></a>00543 <span class="comment"> * \param word</span>
<a name="l00544"></a>00544 <span class="comment"> * \param pfxopts Options to apply to prefixes</span>
<a name="l00545"></a>00545 <span class="comment"> */</span>
<a name="l00546"></a>00546 <span class="keywordtype">int</span>
<a name="l00547"></a>00547 ISpellChecker::compoundgood (ichar_t *word, <span class="keywordtype">int</span> pfxopts)
<a name="l00548"></a>00548 {
<a name="l00549"></a>00549 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00550"></a>00550 <span class="keyword">register</span> ichar_t * p;
<a name="l00551"></a>00551 <span class="keyword">register</span> ichar_t savech;
<a name="l00552"></a>00552 <span class="keywordtype">long</span> secondcap; <span class="comment">/* Capitalization of 2nd half */</span>
<a name="l00553"></a>00553
<a name="l00554"></a>00554 <span class="comment">/*</span>
<a name="l00555"></a>00555 <span class="comment"> ** If compoundflag is COMPOUND_NEVER, compound words are never ok.</span>
<a name="l00556"></a>00556 <span class="comment"> */</span>
<a name="l00557"></a>00557 <span class="keywordflow">if</span> (m_hashheader.<a class="code" href="structhashheader.html#o17">compoundflag</a> == COMPOUND_NEVER)
<a name="l00558"></a>00558 <span class="keywordflow">return</span> 0;
<a name="l00559"></a>00559 <span class="comment">/*</span>
<a name="l00560"></a>00560 <span class="comment"> ** Test for a possible compound word (for languages like German that</span>
<a name="l00561"></a>00561 <span class="comment"> ** form lots of compounds).</span>
<a name="l00562"></a>00562 <span class="comment"> **</span>
<a name="l00563"></a>00563 <span class="comment"> ** This is similar to missingspace, except we quit on the first hit,</span>
<a name="l00564"></a>00564 <span class="comment"> ** and we won't allow either member of the compound to be a single</span>
<a name="l00565"></a>00565 <span class="comment"> ** letter.</span>
<a name="l00566"></a>00566 <span class="comment"> **</span>
<a name="l00567"></a>00567 <span class="comment"> ** We don't do words of length less than 2 * compoundmin, since</span>
<a name="l00568"></a>00568 <span class="comment"> ** both halves must at least compoundmin letters.</span>
<a name="l00569"></a>00569 <span class="comment"> */</span>
<a name="l00570"></a>00570 <span class="keywordflow">if</span> (icharlen (word) < 2 * m_hashheader.<a class="code" href="structhashheader.html#o4">compoundmin</a>)
<a name="l00571"></a>00571 <span class="keywordflow">return</span> 0;
<a name="l00572"></a>00572 icharcpy (newword, word);
<a name="l00573"></a>00573 p = newword + m_hashheader.<a class="code" href="structhashheader.html#o4">compoundmin</a>;
<a name="l00574"></a>00574 <span class="keywordflow">for</span> ( ; p[m_hashheader.<a class="code" href="structhashheader.html#o4">compoundmin</a> - 1] != 0; p++)
<a name="l00575"></a>00575 {
<a name="l00576"></a>00576 savech = *p;
<a name="l00577"></a>00577 *p = 0;
<a name="l00578"></a>00578 <span class="keywordflow">if</span> (good (newword, 0, 0, pfxopts, FF_COMPOUNDONLY))
<a name="l00579"></a>00579 {
<a name="l00580"></a>00580 *p = savech;
<a name="l00581"></a>00581 <span class="keywordflow">if</span> (good (p, 0, 1, FF_COMPOUNDONLY, 0)
<a name="l00582"></a>00582 || compoundgood (p, FF_COMPOUNDONLY))
<a name="l00583"></a>00583 {
<a name="l00584"></a>00584 secondcap = whatcap (p);
<a name="l00585"></a>00585 <span class="keywordflow">switch</span> (whatcap (newword))
<a name="l00586"></a>00586 {
<a name="l00587"></a>00587 <span class="keywordflow">case</span> ANYCASE:
<a name="l00588"></a>00588 <span class="keywordflow">case</span> CAPITALIZED:
<a name="l00589"></a>00589 <span class="keywordflow">case</span> FOLLOWCASE: <span class="comment">/* Followcase can have l.c. suffix */</span>
<a name="l00590"></a>00590 <span class="keywordflow">return</span> secondcap == ANYCASE;
<a name="l00591"></a>00591 <span class="keywordflow">case</span> ALLCAPS:
<a name="l00592"></a>00592 <span class="keywordflow">return</span> secondcap == ALLCAPS;
<a name="l00593"></a>00593 }
<a name="l00594"></a>00594 }
<a name="l00595"></a>00595 }
<a name="l00596"></a>00596 <span class="keywordflow">else</span>
<a name="l00597"></a>00597 *p = savech;
<a name="l00598"></a>00598 }
<a name="l00599"></a>00599 <span class="keywordflow">return</span> 0;
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <span class="comment">/*</span>
<a name="l00603"></a>00603 <span class="comment"> * \param word</span>
<a name="l00604"></a>00604 <span class="comment"> */</span>
<a name="l00605"></a>00605 <span class="keywordtype">void</span>
<a name="l00606"></a>00606 ISpellChecker::transposedletter (ichar_t *word)
<a name="l00607"></a>00607 {
<a name="l00608"></a>00608 ichar_t newword[INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00609"></a>00609 <span class="keyword">register</span> ichar_t * p;
<a name="l00610"></a>00610 <span class="keyword">register</span> ichar_t temp;
<a name="l00611"></a>00611
<a name="l00612"></a>00612 icharcpy (newword, word);
<a name="l00613"></a>00613 <span class="keywordflow">for</span> (p = newword; p[1] != 0; p++)
<a name="l00614"></a>00614 {
<a name="l00615"></a>00615 temp = *p;
<a name="l00616"></a>00616 *p = p[1];
<a name="l00617"></a>00617 p[1] = temp;
<a name="l00618"></a>00618 <span class="keywordflow">if</span> (good (newword, 0, 1, 0, 0))
<a name="l00619"></a>00619 {
<a name="l00620"></a>00620 <span class="keywordflow">if</span> (ins_cap (newword, word) < 0)
<a name="l00621"></a>00621 <span class="keywordflow">return</span>;
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623 temp = *p;
<a name="l00624"></a>00624 *p = p[1];
<a name="l00625"></a>00625 p[1] = temp;
<a name="l00626"></a>00626 }
<a name="l00627"></a>00627 }
<a name="l00628"></a>00628
<a name="l00637"></a>00637 <span class="keywordtype">int</span>
<a name="l00638"></a>00638 ISpellChecker::ins_cap (ichar_t *word, ichar_t *pattern)
<a name="l00639"></a>00639 {
<a name="l00640"></a>00640 <span class="keywordtype">int</span> i; <span class="comment">/* Index into savearea */</span>
<a name="l00641"></a>00641 <span class="keywordtype">int</span> nsaved; <span class="comment">/* No. of words saved */</span>
<a name="l00642"></a>00642 ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00643"></a>00643
<a name="l00644"></a>00644 nsaved = save_cap (word, pattern, savearea);
<a name="l00645"></a>00645 <span class="keywordflow">for</span> (i = 0; i < nsaved; i++)
<a name="l00646"></a>00646 {
<a name="l00647"></a>00647 <span class="keywordflow">if</span> (insert (savearea[i]) < 0)
<a name="l00648"></a>00648 <span class="keywordflow">return</span> -1;
<a name="l00649"></a>00649 }
<a name="l00650"></a>00650 <span class="keywordflow">return</span> 0;
<a name="l00651"></a>00651 }
<a name="l00652"></a>00652
<a name="l00662"></a>00662 <span class="keywordtype">int</span>
<a name="l00663"></a>00663 ISpellChecker::save_cap (ichar_t *word, ichar_t *pattern,
<a name="l00664"></a>00664 ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN])
<a name="l00665"></a>00665 {
<a name="l00666"></a>00666 <span class="keywordtype">int</span> hitno; <span class="comment">/* Index into hits array */</span>
<a name="l00667"></a>00667 <span class="keywordtype">int</span> nsaved; <span class="comment">/* Number of words saved */</span>
<a name="l00668"></a>00668 <span class="keywordtype">int</span> preadd; <span class="comment">/* No. chars added to front of root */</span>
<a name="l00669"></a>00669 <span class="keywordtype">int</span> prestrip; <span class="comment">/* No. chars stripped from front */</span>
<a name="l00670"></a>00670 <span class="keywordtype">int</span> sufadd; <span class="comment">/* No. chars added to back of root */</span>
<a name="l00671"></a>00671 <span class="keywordtype">int</span> sufstrip; <span class="comment">/* No. chars stripped from back */</span>
<a name="l00672"></a>00672
<a name="l00673"></a>00673 <span class="keywordflow">if</span> (*word == 0)
<a name="l00674"></a>00674 <span class="keywordflow">return</span> 0;
<a name="l00675"></a>00675
<a name="l00676"></a>00676 <span class="keywordflow">for</span> (hitno = m_numhits, nsaved = 0; --hitno >= 0 && nsaved < MAX_CAPS; )
<a name="l00677"></a>00677 {
<a name="l00678"></a>00678 <span class="keywordflow">if</span> (m_hits[hitno].prefix)
<a name="l00679"></a>00679 {
<a name="l00680"></a>00680 prestrip = m_hits[hitno].<a class="code" href="structsuccess.html#o1">prefix</a>-><a class="code" href="structflagent.html#o3">stripl</a>;
<a name="l00681"></a>00681 preadd = m_hits[hitno].<a class="code" href="structsuccess.html#o1">prefix</a>-><a class="code" href="structflagent.html#o4">affl</a>;
<a name="l00682"></a>00682 }
<a name="l00683"></a>00683 <span class="keywordflow">else</span>
<a name="l00684"></a>00684 prestrip = preadd = 0;
<a name="l00685"></a>00685 <span class="keywordflow">if</span> (m_hits[hitno].suffix)
<a name="l00686"></a>00686 {
<a name="l00687"></a>00687 sufstrip = m_hits[hitno].<a class="code" href="structsuccess.html#o2">suffix</a>-><a class="code" href="structflagent.html#o3">stripl</a>;
<a name="l00688"></a>00688 sufadd = m_hits[hitno].<a class="code" href="structsuccess.html#o2">suffix</a>-><a class="code" href="structflagent.html#o4">affl</a>;
<a name="l00689"></a>00689 }
<a name="l00690"></a>00690 <span class="keywordflow">else</span>
<a name="l00691"></a>00691 sufadd = sufstrip = 0;
<a name="l00692"></a>00692 save_root_cap (word, pattern, prestrip, preadd,
<a name="l00693"></a>00693 sufstrip, sufadd,
<a name="l00694"></a>00694 m_hits[hitno].dictent, m_hits[hitno].prefix, m_hits[hitno].suffix,
<a name="l00695"></a>00695 savearea, &nsaved);
<a name="l00696"></a>00696 }
<a name="l00697"></a>00697 <span class="keywordflow">return</span> nsaved;
<a name="l00698"></a>00698 }
<a name="l00699"></a>00699
<a name="l00700"></a>00700 <span class="comment">/*</span>
<a name="l00701"></a>00701 <span class="comment"> * \param word</span>
<a name="l00702"></a>00702 <span class="comment"> * \param pattern</span>
<a name="l00703"></a>00703 <span class="comment"> * \param prestrip</span>
<a name="l00704"></a>00704 <span class="comment"> * \param preadd</span>
<a name="l00705"></a>00705 <span class="comment"> * \param sufstrip</span>
<a name="l00706"></a>00706 <span class="comment"> * \param sufadd</span>
<a name="l00707"></a>00707 <span class="comment"> * \param firstdent</span>
<a name="l00708"></a>00708 <span class="comment"> * \param pfxent</span>
<a name="l00709"></a>00709 <span class="comment"> * \param sufent</span>
<a name="l00710"></a>00710 <span class="comment"> *</span>
<a name="l00711"></a>00711 <span class="comment"> * \return</span>
<a name="l00712"></a>00712 <span class="comment"> */</span>
<a name="l00713"></a>00713 <span class="keywordtype">int</span>
<a name="l00714"></a>00714 ISpellChecker::ins_root_cap (ichar_t *word, ichar_t *pattern,
<a name="l00715"></a>00715 <span class="keywordtype">int</span> prestrip, <span class="keywordtype">int</span> preadd, <span class="keywordtype">int</span> sufstrip, <span class="keywordtype">int</span> sufadd,
<a name="l00716"></a>00716 <span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a> *firstdent, <span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a> *pfxent, <span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a> *sufent)
<a name="l00717"></a>00717 {
<a name="l00718"></a>00718 <span class="keywordtype">int</span> i; <span class="comment">/* Index into savearea */</span>
<a name="l00719"></a>00719 ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN];
<a name="l00720"></a>00720 <span class="keywordtype">int</span> nsaved; <span class="comment">/* Number of words saved */</span>
<a name="l00721"></a>00721
<a name="l00722"></a>00722 nsaved = 0;
<a name="l00723"></a>00723 save_root_cap (word, pattern, prestrip, preadd, sufstrip, sufadd,
<a name="l00724"></a>00724 firstdent, pfxent, sufent, savearea, &nsaved);
<a name="l00725"></a>00725 <span class="keywordflow">for</span> (i = 0; i < nsaved; i++)
<a name="l00726"></a>00726 {
<a name="l00727"></a>00727 <span class="keywordflow">if</span> (insert (savearea[i]) < 0)
<a name="l00728"></a>00728 <span class="keywordflow">return</span> -1;
<a name="l00729"></a>00729 }
<a name="l00730"></a>00730 <span class="keywordflow">return</span> 0;
<a name="l00731"></a>00731 }
<a name="l00732"></a>00732
<a name="l00733"></a>00733 <span class="comment">/* ARGSUSED */</span>
<a name="l00747"></a>00747 <span class="keywordtype">void</span>
<a name="l00748"></a>00748 ISpellChecker::save_root_cap (ichar_t *word, ichar_t *pattern,
<a name="l00749"></a>00749 <span class="keywordtype">int</span> prestrip, <span class="keywordtype">int</span> preadd, <span class="keywordtype">int</span> sufstrip, <span class="keywordtype">int</span> sufadd,
<a name="l00750"></a>00750 <span class="keyword">struct</span> <a class="code" href="structdent.html">dent</a> *firstdent, <span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a> *pfxent, <span class="keyword">struct</span> <a class="code" href="structflagent.html">flagent</a> *sufent,
<a name="l00751"></a>00751 ichar_t savearea[MAX_CAPS][INPUTWORDLEN + MAXAFFIXLEN],
<a name="l00752"></a>00752 <span class="keywordtype">int</span> * nsaved)
<a name="l00753"></a>00753 {
<a name="l00754"></a>00754 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00755"></a>00755 <span class="preprocessor"></span> <span class="keyword">register</span> <span class="keyword">struct </span><a class="code" href="structdent.html">dent</a> * <a class="code" href="structdent.html">dent</a>;
<a name="l00756"></a>00756 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00757"></a>00757 <span class="keywordtype">int</span> firstisupper;
<a name="l00758"></a>00758 ichar_t newword[INPUTWORDLEN + 4 * MAXAFFIXLEN + 4];
<a name="l00759"></a>00759 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00760"></a>00760 <span class="preprocessor"></span> <span class="keyword">register</span> ichar_t * p;
<a name="l00761"></a>00761 <span class="keywordtype">int</span> len;
<a name="l00762"></a>00762 <span class="keywordtype">int</span> i;
<a name="l00763"></a>00763 <span class="keywordtype">int</span> limit;
<a name="l00764"></a>00764 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00765"></a>00765
<a name="l00766"></a>00766 <span class="keywordflow">if</span> (*nsaved >= MAX_CAPS)
<a name="l00767"></a>00767 <span class="keywordflow">return</span>;
<a name="l00768"></a>00768 icharcpy (newword, word);
<a name="l00769"></a>00769 firstisupper = myupper (pattern[0]);
<a name="l00770"></a>00770 <span class="preprocessor">#ifdef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00771"></a>00771 <span class="preprocessor"></span> <span class="comment">/*</span>
<a name="l00772"></a>00772 <span class="comment"> ** Apply the old, simple-minded capitalization rules.</span>
<a name="l00773"></a>00773 <span class="comment"> */</span>
<a name="l00774"></a>00774 <span class="keywordflow">if</span> (firstisupper)
<a name="l00775"></a>00775 {
<a name="l00776"></a>00776 <span class="keywordflow">if</span> (myupper (pattern[1]))
<a name="l00777"></a>00777 upcase (newword);
<a name="l00778"></a>00778 <span class="keywordflow">else</span>
<a name="l00779"></a>00779 {
<a name="l00780"></a>00780 lowcase (newword);
<a name="l00781"></a>00781 newword[0] = mytoupper (newword[0]);
<a name="l00782"></a>00782 }
<a name="l00783"></a>00783 }
<a name="l00784"></a>00784 <span class="keywordflow">else</span>
<a name="l00785"></a>00785 lowcase (newword);
<a name="l00786"></a>00786 icharcpy (savearea[*nsaved], newword);
<a name="l00787"></a>00787 (*nsaved)++;
<a name="l00788"></a>00788 <span class="keywordflow">return</span>;
<a name="l00789"></a>00789 <span class="preprocessor">#else </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00790"></a>00790 <span class="preprocessor">#define flagsareok(dent) \</span>
<a name="l00791"></a>00791 <span class="preprocessor"> ((pfxent == NULL \</span>
<a name="l00792"></a>00792 <span class="preprocessor"> || TSTMASKBIT (dent->mask, pfxent->flagbit)) \</span>
<a name="l00793"></a>00793 <span class="preprocessor"> && (sufent == NULL \</span>
<a name="l00794"></a>00794 <span class="preprocessor"> || TSTMASKBIT (dent->mask, sufent->flagbit)))</span>
<a name="l00795"></a>00795 <span class="preprocessor"></span>
<a name="l00796"></a>00796 dent = firstdent;
<a name="l00797"></a>00797 <span class="keywordflow">if</span> ((dent->flagfield & (CAPTYPEMASK | MOREVARIANTS)) == ALLCAPS)
<a name="l00798"></a>00798 {
<a name="l00799"></a>00799 upcase (newword); <span class="comment">/* Uppercase required */</span>
<a name="l00800"></a>00800 icharcpy (savearea[*nsaved], newword);
<a name="l00801"></a>00801 (*nsaved)++;
<a name="l00802"></a>00802 <span class="keywordflow">return</span>;
<a name="l00803"></a>00803 }
<a name="l00804"></a>00804 <span class="keywordflow">for</span> (p = pattern; *p; p++)
<a name="l00805"></a>00805 {
<a name="l00806"></a>00806 <span class="keywordflow">if</span> (mylower (*p))
<a name="l00807"></a>00807 <span class="keywordflow">break</span>;
<a name="l00808"></a>00808 }
<a name="l00809"></a>00809 <span class="keywordflow">if</span> (*p == 0)
<a name="l00810"></a>00810 {
<a name="l00811"></a>00811 upcase (newword); <span class="comment">/* Pattern was all caps */</span>
<a name="l00812"></a>00812 icharcpy (savearea[*nsaved], newword);
<a name="l00813"></a>00813 (*nsaved)++;
<a name="l00814"></a>00814 <span class="keywordflow">return</span>;
<a name="l00815"></a>00815 }
<a name="l00816"></a>00816 <span class="keywordflow">for</span> (p = pattern + 1; *p; p++)
<a name="l00817"></a>00817 {
<a name="l00818"></a>00818 <span class="keywordflow">if</span> (myupper (*p))
<a name="l00819"></a>00819 <span class="keywordflow">break</span>;
<a name="l00820"></a>00820 }
<a name="l00821"></a>00821 <span class="keywordflow">if</span> (*p == 0)
<a name="l00822"></a>00822 {
<a name="l00823"></a>00823 <span class="comment">/*</span>
<a name="l00824"></a>00824 <span class="comment"> ** The pattern was all-lower or capitalized. If that's</span>
<a name="l00825"></a>00825 <span class="comment"> ** legal, insert only that version.</span>
<a name="l00826"></a>00826 <span class="comment"> */</span>
<a name="l00827"></a>00827 <span class="keywordflow">if</span> (firstisupper)
<a name="l00828"></a>00828 {
<a name="l00829"></a>00829 <span class="keywordflow">if</span> (captype (dent->flagfield) == CAPITALIZED
<a name="l00830"></a>00830 || captype (dent->flagfield) == ANYCASE)
<a name="l00831"></a>00831 {
<a name="l00832"></a>00832 lowcase (newword);
<a name="l00833"></a>00833 newword[0] = mytoupper (newword[0]);
<a name="l00834"></a>00834 icharcpy (savearea[*nsaved], newword);
<a name="l00835"></a>00835 (*nsaved)++;
<a name="l00836"></a>00836 <span class="keywordflow">return</span>;
<a name="l00837"></a>00837 }
<a name="l00838"></a>00838 }
<a name="l00839"></a>00839 <span class="keywordflow">else</span>
<a name="l00840"></a>00840 {
<a name="l00841"></a>00841 <span class="keywordflow">if</span> (captype (dent->flagfield) == ANYCASE)
<a name="l00842"></a>00842 {
<a name="l00843"></a>00843 lowcase (newword);
<a name="l00844"></a>00844 icharcpy (savearea[*nsaved], newword);
<a name="l00845"></a>00845 (*nsaved)++;
<a name="l00846"></a>00846 <span class="keywordflow">return</span>;
<a name="l00847"></a>00847 }
<a name="l00848"></a>00848 }
<a name="l00849"></a>00849 <span class="keywordflow">while</span> (dent->flagfield & MOREVARIANTS)
<a name="l00850"></a>00850 {
<a name="l00851"></a>00851 dent = dent-><a class="code" href="structdent.html#o0">next</a>;
<a name="l00852"></a>00852 <span class="keywordflow">if</span> (captype (dent->flagfield) == FOLLOWCASE
<a name="l00853"></a>00853 || !flagsareok (dent))
<a name="l00854"></a>00854 <span class="keywordflow">continue</span>;
<a name="l00855"></a>00855 <span class="keywordflow">if</span> (firstisupper)
<a name="l00856"></a>00856 {
<a name="l00857"></a>00857 <span class="keywordflow">if</span> (captype (dent->flagfield) == CAPITALIZED)
<a name="l00858"></a>00858 {
<a name="l00859"></a>00859 lowcase (newword);
<a name="l00860"></a>00860 newword[0] = mytoupper (newword[0]);
<a name="l00861"></a>00861 icharcpy (savearea[*nsaved], newword);
<a name="l00862"></a>00862 (*nsaved)++;
<a name="l00863"></a>00863 <span class="keywordflow">return</span>;
<a name="l00864"></a>00864 }
<a name="l00865"></a>00865 }
<a name="l00866"></a>00866 <span class="keywordflow">else</span>
<a name="l00867"></a>00867 {
<a name="l00868"></a>00868 <span class="keywordflow">if</span> (captype (dent->flagfield) == ANYCASE)
<a name="l00869"></a>00869 {
<a name="l00870"></a>00870 lowcase (newword);
<a name="l00871"></a>00871 icharcpy (savearea[*nsaved], newword);
<a name="l00872"></a>00872 (*nsaved)++;
<a name="l00873"></a>00873 <span class="keywordflow">return</span>;
<a name="l00874"></a>00874 }
<a name="l00875"></a>00875 }
<a name="l00876"></a>00876 }
<a name="l00877"></a>00877 }
<a name="l00878"></a>00878 <span class="comment">/*</span>
<a name="l00879"></a>00879 <span class="comment"> ** Either the sample had complex capitalization, or the simple</span>
<a name="l00880"></a>00880 <span class="comment"> ** capitalizations (all-lower or capitalized) are illegal.</span>
<a name="l00881"></a>00881 <span class="comment"> ** Insert all legal capitalizations, including those that are</span>
<a name="l00882"></a>00882 <span class="comment"> ** all-lower or capitalized. If the prototype is capitalized,</span>
<a name="l00883"></a>00883 <span class="comment"> ** capitalized all-lower samples. Watch out for affixes.</span>
<a name="l00884"></a>00884 <span class="comment"> */</span>
<a name="l00885"></a>00885 dent = firstdent;
<a name="l00886"></a>00886 p = strtosichar (dent-><a class="code" href="structdent.html#o1">word</a>, 1);
<a name="l00887"></a>00887 len = icharlen (p);
<a name="l00888"></a>00888 <span class="keywordflow">if</span> (dent->flagfield & MOREVARIANTS)
<a name="l00889"></a>00889 dent = dent-><a class="code" href="structdent.html#o0">next</a>; <span class="comment">/* Skip place-holder entry */</span>
<a name="l00890"></a>00890 <span class="keywordflow">for</span> ( ; ; )
<a name="l00891"></a>00891 {
<a name="l00892"></a>00892 <span class="keywordflow">if</span> (flagsareok (dent))
<a name="l00893"></a>00893 {
<a name="l00894"></a>00894 <span class="keywordflow">if</span> (captype (dent->flagfield) != FOLLOWCASE)
<a name="l00895"></a>00895 {
<a name="l00896"></a>00896 lowcase (newword);
<a name="l00897"></a>00897 <span class="keywordflow">if</span> (firstisupper || captype (dent->flagfield) == CAPITALIZED)
<a name="l00898"></a>00898 newword[0] = mytoupper (newword[0]);
<a name="l00899"></a>00899 icharcpy (savearea[*nsaved], newword);
<a name="l00900"></a>00900 (*nsaved)++;
<a name="l00901"></a>00901 <span class="keywordflow">if</span> (*nsaved >= MAX_CAPS)
<a name="l00902"></a>00902 <span class="keywordflow">return</span>;
<a name="l00903"></a>00903 }
<a name="l00904"></a>00904 <span class="keywordflow">else</span>
<a name="l00905"></a>00905 {
<a name="l00906"></a>00906 <span class="comment">/* Followcase is the tough one. */</span>
<a name="l00907"></a>00907 p = strtosichar (dent->word, 1);
<a name="l00908"></a>00908 memmove (
<a name="l00909"></a>00909 reinterpret_cast<char *>(newword + preadd),
<a name="l00910"></a>00910 reinterpret_cast<char *>(p + prestrip),
<a name="l00911"></a>00911 (len - prestrip - sufstrip) * <span class="keyword">sizeof</span> (ichar_t));
<a name="l00912"></a>00912 <span class="keywordflow">if</span> (myupper (p[prestrip]))
<a name="l00913"></a>00913 {
<a name="l00914"></a>00914 <span class="keywordflow">for</span> (i = 0; i < preadd; i++)
<a name="l00915"></a>00915 newword[i] = mytoupper (newword[i]);
<a name="l00916"></a>00916 }
<a name="l00917"></a>00917 <span class="keywordflow">else</span>
<a name="l00918"></a>00918 {
<a name="l00919"></a>00919 <span class="keywordflow">for</span> (i = 0; i < preadd; i++)
<a name="l00920"></a>00920 newword[i] = mytolower (newword[i]);
<a name="l00921"></a>00921 }
<a name="l00922"></a>00922 limit = len + preadd + sufadd - prestrip - sufstrip;
<a name="l00923"></a>00923 i = len + preadd - prestrip - sufstrip;
<a name="l00924"></a>00924 p += len - sufstrip - 1;
<a name="l00925"></a>00925 <span class="keywordflow">if</span> (myupper (*p))
<a name="l00926"></a>00926 {
<a name="l00927"></a>00927 <span class="keywordflow">for</span> (p = newword + i; i < limit; i++, p++)
<a name="l00928"></a>00928 *p = mytoupper (*p);
<a name="l00929"></a>00929 }
<a name="l00930"></a>00930 <span class="keywordflow">else</span>
<a name="l00931"></a>00931 {
<a name="l00932"></a>00932 <span class="keywordflow">for</span> (p = newword + i; i < limit; i++, p++)
<a name="l00933"></a>00933 *p = mytolower (*p);
<a name="l00934"></a>00934 }
<a name="l00935"></a>00935 icharcpy (savearea[*nsaved], newword);
<a name="l00936"></a>00936 (*nsaved)++;
<a name="l00937"></a>00937 <span class="keywordflow">if</span> (*nsaved >= MAX_CAPS)
<a name="l00938"></a>00938 <span class="keywordflow">return</span>;
<a name="l00939"></a>00939 }
<a name="l00940"></a>00940 }
<a name="l00941"></a>00941 <span class="keywordflow">if</span> ((dent->flagfield & MOREVARIANTS) == 0)
<a name="l00942"></a>00942 <span class="keywordflow">break</span>; <span class="comment">/* End of the line */</span>
<a name="l00943"></a>00943 dent = dent->next;
<a name="l00944"></a>00944 }
<a name="l00945"></a>00945 <span class="keywordflow">return</span>;
<a name="l00946"></a>00946 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00947"></a>00947 }
<a name="l00948"></a>00948
<a name="l00949"></a>00949
</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
>
9373
