<?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: makedent.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">makedent.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 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"> * $Log$</span>
<a name="l00071"></a>00071 <span class="comment"> * Revision 1.2 2004/02/01 04:46:46 zrusin</span>
<a name="l00072"></a>00072 <span class="comment"> * Both ispell and aspell plugins are not working properly. We can start switching.</span>
<a name="l00073"></a>00073 <span class="comment"> *</span>
<a name="l00074"></a>00074 <span class="comment"> * Revision 1.1 2004/01/31 16:44:12 zrusin</span>
<a name="l00075"></a>00075 <span class="comment"> * ISpell plugin.</span>
<a name="l00076"></a>00076 <span class="comment"> *</span>
<a name="l00077"></a>00077 <span class="comment"> * Revision 1.4 2003/08/14 17:51:28 dom</span>
<a name="l00078"></a>00078 <span class="comment"> * update license - exception clause should be Lesser GPL</span>
<a name="l00079"></a>00079 <span class="comment"> *</span>
<a name="l00080"></a>00080 <span class="comment"> * Revision 1.3 2003/07/28 20:40:27 dom</span>
<a name="l00081"></a>00081 <span class="comment"> * fix up the license clause, further win32-registry proof some directory getting functions</span>
<a name="l00082"></a>00082 <span class="comment"> *</span>
<a name="l00083"></a>00083 <span class="comment"> * Revision 1.2 2003/07/16 22:52:49 dom</span>
<a name="l00084"></a>00084 <span class="comment"> * LGPL + exception license</span>
<a name="l00085"></a>00085 <span class="comment"> *</span>
<a name="l00086"></a>00086 <span class="comment"> * Revision 1.1 2003/07/15 01:15:08 dom</span>
<a name="l00087"></a>00087 <span class="comment"> * ispell enchant backend</span>
<a name="l00088"></a>00088 <span class="comment"> *</span>
<a name="l00089"></a>00089 <span class="comment"> * Revision 1.3 2003/02/12 02:10:38 hippietrail</span>
<a name="l00090"></a>00090 <span class="comment"> *</span>
<a name="l00091"></a>00091 <span class="comment"> * C casts -> C++ casts</span>
<a name="l00092"></a>00092 <span class="comment"> * Improved const-correctness due to changing casts</span>
<a name="l00093"></a>00093 <span class="comment"> * Fixed some warnings</span>
<a name="l00094"></a>00094 <span class="comment"> *</span>
<a name="l00095"></a>00095 <span class="comment"> * Revision 1.2 2003/01/29 05:50:12 hippietrail</span>
<a name="l00096"></a>00096 <span class="comment"> *</span>
<a name="l00097"></a>00097 <span class="comment"> * Fixed my mess in EncodingManager.</span>
<a name="l00098"></a>00098 <span class="comment"> * Changed many C casts to C++ casts.</span>
<a name="l00099"></a>00099 <span class="comment"> *</span>
<a name="l00100"></a>00100 <span class="comment"> * Revision 1.1 2003/01/24 05:52:35 hippietrail</span>
<a name="l00101"></a>00101 <span class="comment"> *</span>
<a name="l00102"></a>00102 <span class="comment"> * Refactored ispell code. Old ispell global variables had been put into</span>
<a name="l00103"></a>00103 <span class="comment"> * an allocated structure, a pointer to which was passed to many functions.</span>
<a name="l00104"></a>00104 <span class="comment"> * I have now made all such functions and variables private members of the</span>
<a name="l00105"></a>00105 <span class="comment"> * ISpellChecker class. It was C OO, now it's C++ OO.</span>
<a name="l00106"></a>00106 <span class="comment"> *</span>
<a name="l00107"></a>00107 <span class="comment"> * I've fixed the makefiles and tested compilation but am unable to test</span>
<a name="l00108"></a>00108 <span class="comment"> * operation. Please back out my changes if they cause problems which</span>
<a name="l00109"></a>00109 <span class="comment"> * are not obvious or easy to fix.</span>
<a name="l00110"></a>00110 <span class="comment"> *</span>
<a name="l00111"></a>00111 <span class="comment"> * Revision 1.8 2003/01/06 18:48:40 dom</span>
<a name="l00112"></a>00112 <span class="comment"> * ispell cleanup, start of using new 'add' save features</span>
<a name="l00113"></a>00113 <span class="comment"> *</span>
<a name="l00114"></a>00114 <span class="comment"> * Revision 1.7 2003/01/04 19:09:04 dom</span>
<a name="l00115"></a>00115 <span class="comment"> * some tidying... bug pissing me off...</span>
<a name="l00116"></a>00116 <span class="comment"> *</span>
<a name="l00117"></a>00117 <span class="comment"> * Revision 1.6 2002/09/19 05:31:18 hippietrail</span>
<a name="l00118"></a>00118 <span class="comment"> *</span>
<a name="l00119"></a>00119 <span class="comment"> * More Ispell cleanup. Conditional globals and DEREF macros are removed.</span>
<a name="l00120"></a>00120 <span class="comment"> * K&R function declarations removed, converted to Doxygen style comments</span>
<a name="l00121"></a>00121 <span class="comment"> * where possible. No code has been changed (I hope). Compiles for me but</span>
<a name="l00122"></a>00122 <span class="comment"> * unable to test.</span>
<a name="l00123"></a>00123 <span class="comment"> *</span>
<a name="l00124"></a>00124 <span class="comment"> * Revision 1.5 2002/09/17 03:03:30 hippietrail</span>
<a name="l00125"></a>00125 <span class="comment"> *</span>
<a name="l00126"></a>00126 <span class="comment"> * After seeking permission on the developer list I've reformatted all the</span>
<a name="l00127"></a>00127 <span class="comment"> * spelling source which seemed to have parts which used 2, 3, 4, and 8</span>
<a name="l00128"></a>00128 <span class="comment"> * spaces for tabs. It should all look good with our standard 4-space</span>
<a name="l00129"></a>00129 <span class="comment"> * tabs now.</span>
<a name="l00130"></a>00130 <span class="comment"> * I've concentrated just on indentation in the actual code. More prettying</span>
<a name="l00131"></a>00131 <span class="comment"> * could be done.</span>
<a name="l00132"></a>00132 <span class="comment"> * * NO code changes were made *</span>
<a name="l00133"></a>00133 <span class="comment"> *</span>
<a name="l00134"></a>00134 <span class="comment"> * Revision 1.4 2002/09/13 17:20:13 mpritchett</span>
<a name="l00135"></a>00135 <span class="comment"> * Fix more warnings for Linux build</span>
<a name="l00136"></a>00136 <span class="comment"> *</span>
<a name="l00137"></a>00137 <span class="comment"> * Revision 1.3 2002/03/22 14:31:57 dom</span>
<a name="l00138"></a>00138 <span class="comment"> * fix mg's compile problem</span>
<a name="l00139"></a>00139 <span class="comment"> *</span>
<a name="l00140"></a>00140 <span class="comment"> * Revision 1.2 2001/05/12 16:05:42 thomasf</span>
<a name="l00141"></a>00141 <span class="comment"> * Big pseudo changes to ispell to make it pass around a structure rather</span>
<a name="l00142"></a>00142 <span class="comment"> * than rely on all sorts of gloabals willy nilly here and there. Also</span>
<a name="l00143"></a>00143 <span class="comment"> * fixed our spelling class to work with accepting suggestions once more.</span>
<a name="l00144"></a>00144 <span class="comment"> * This code is dirty, gross and ugly (not to mention still not supporting</span>
<a name="l00145"></a>00145 <span class="comment"> * multiple hash sized just yet) but it works on my machine and will no</span>
<a name="l00146"></a>00146 <span class="comment"> * doubt break other machines.</span>
<a name="l00147"></a>00147 <span class="comment"> *</span>
<a name="l00148"></a>00148 <span class="comment"> * Revision 1.1 2001/04/15 16:01:24 tomas_f</span>
<a name="l00149"></a>00149 <span class="comment"> * moving to spell/xp</span>
<a name="l00150"></a>00150 <span class="comment"> *</span>
<a name="l00151"></a>00151 <span class="comment"> * Revision 1.6 1999/12/21 18:46:29 sterwill</span>
<a name="l00152"></a>00152 <span class="comment"> * ispell patch for non-English dictionaries by Henrik Berg <henrik@lansen.se></span>
<a name="l00153"></a>00153 <span class="comment"> *</span>
<a name="l00154"></a>00154 <span class="comment"> * Revision 1.5 1999/10/20 03:19:35 paul</span>
<a name="l00155"></a>00155 <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="l00156"></a>00156 <span class="comment"> *</span>
<a name="l00157"></a>00157 <span class="comment"> * Revision 1.4 1999/04/13 17:12:51 jeff</span>
<a name="l00158"></a>00158 <span class="comment"> * Applied "Darren O. Benham" <gecko@benham.net> spell check changes.</span>
<a name="l00159"></a>00159 <span class="comment"> * Fixed crash on Win32 with the new code.</span>
<a name="l00160"></a>00160 <span class="comment"> *</span>
<a name="l00161"></a>00161 <span class="comment"> * Revision 1.3 1998/12/29 14:55:33 eric</span>
<a name="l00162"></a>00162 <span class="comment"> *</span>
<a name="l00163"></a>00163 <span class="comment"> * I've doctored the ispell code pretty extensively here. It is now</span>
<a name="l00164"></a>00164 <span class="comment"> * warning-free on Win32. It also *works* on Win32 now, since I</span>
<a name="l00165"></a>00165 <span class="comment"> * replaced all the I/O calls with ANSI standard ones.</span>
<a name="l00166"></a>00166 <span class="comment"> *</span>
<a name="l00167"></a>00167 <span class="comment"> * Revision 1.3 1998/12/29 14:55:33 eric</span>
<a name="l00168"></a>00168 <span class="comment"> *</span>
<a name="l00169"></a>00169 <span class="comment"> * I've doctored the ispell code pretty extensively here. It is now</span>
<a name="l00170"></a>00170 <span class="comment"> * warning-free on Win32. It also *works* on Win32 now, since I</span>
<a name="l00171"></a>00171 <span class="comment"> * replaced all the I/O calls with ANSI standard ones.</span>
<a name="l00172"></a>00172 <span class="comment"> *</span>
<a name="l00173"></a>00173 <span class="comment"> * Revision 1.2 1998/12/28 23:11:30 eric</span>
<a name="l00174"></a>00174 <span class="comment"> *</span>
<a name="l00175"></a>00175 <span class="comment"> * modified spell code and integration to build on Windows.</span>
<a name="l00176"></a>00176 <span class="comment"> * This is still a hack.</span>
<a name="l00177"></a>00177 <span class="comment"> *</span>
<a name="l00178"></a>00178 <span class="comment"> * Actually, it doesn't yet WORK on Windows. It just builds.</span>
<a name="l00179"></a>00179 <span class="comment"> * SpellCheckInit is failing for some reason.</span>
<a name="l00180"></a>00180 <span class="comment"> *</span>
<a name="l00181"></a>00181 <span class="comment"> * Revision 1.1 1998/12/28 18:04:43 davet</span>
<a name="l00182"></a>00182 <span class="comment"> * Spell checker code stripped from ispell. At this point, there are</span>
<a name="l00183"></a>00183 <span class="comment"> * two external routines... the Init routine, and a check-a-word routine</span>
<a name="l00184"></a>00184 <span class="comment"> * which returns a boolean value, and takes a 16 bit char string.</span>
<a name="l00185"></a>00185 <span class="comment"> * The code resembles the ispell code as much as possible still.</span>
<a name="l00186"></a>00186 <span class="comment"> *</span>
<a name="l00187"></a>00187 <span class="comment"> * Revision 1.45 1994/12/27 23:08:52 geoff</span>
<a name="l00188"></a>00188 <span class="comment"> * Add code to makedent to reject words that contain non-word characters.</span>
<a name="l00189"></a>00189 <span class="comment"> * This helps protect people who use ISO 8-bit characters when ispell</span>
<a name="l00190"></a>00190 <span class="comment"> * isn't configured for that option.</span>
<a name="l00191"></a>00191 <span class="comment"> *</span>
<a name="l00192"></a>00192 <span class="comment"> * Revision 1.44 1994/10/25 05:46:20 geoff</span>
<a name="l00193"></a>00193 <span class="comment"> * Fix some incorrect declarations in the lint versions of some routines.</span>
<a name="l00194"></a>00194 <span class="comment"> *</span>
<a name="l00195"></a>00195 <span class="comment"> * Revision 1.43 1994/09/16 03:32:34 geoff</span>
<a name="l00196"></a>00196 <span class="comment"> * Issue an error message for bad affix flags</span>
<a name="l00197"></a>00197 <span class="comment"> *</span>
<a name="l00198"></a>00198 <span class="comment"> * Revision 1.42 1994/02/07 04:23:43 geoff</span>
<a name="l00199"></a>00199 <span class="comment"> * Correctly identify the deformatter when changing file types</span>
<a name="l00200"></a>00200 <span class="comment"> *</span>
<a name="l00201"></a>00201 <span class="comment"> * Revision 1.41 1994/01/25 07:11:55 geoff</span>
<a name="l00202"></a>00202 <span class="comment"> * Get rid of all old RCS log lines in preparation for the 3.1 release.</span>
<a name="l00203"></a>00203 <span class="comment"> *</span>
<a name="l00204"></a>00204 <span class="comment"> */</span>
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00207"></a>00207 <span class="preprocessor">#include <string.h></span>
<a name="l00208"></a>00208 <span class="preprocessor">#include <ctype.h></span>
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="preprocessor">#include "ispell_checker.h"</span>
<a name="l00211"></a>00211 <span class="preprocessor">#include "msgs.h"</span>
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <span class="keywordtype">int</span> makedent P ((<span class="keywordtype">char</span> * lbuf, <span class="keywordtype">int</span> lbuflen, <span class="keyword">struct</span> dent * ent));
<a name="l00214"></a>00214 <span class="comment">/*int combinecaps P ((struct dent * hdr, struct dent * newent));</span>
<a name="l00215"></a>00215 <span class="comment">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00216"></a>00216 <span class="comment">static void forcevheader P ((struct dent * hdrp, struct dent * oldp,</span>
<a name="l00217"></a>00217 <span class="comment"> struct dent * newp));</span>
<a name="l00218"></a>00218 <span class="comment">#endif / * NO_CAPITALIZATION_SUPPORT * /</span>
<a name="l00219"></a>00219 <span class="comment">static int combine_two_entries P ((struct dent * hdrp,</span>
<a name="l00220"></a>00220 <span class="comment"> struct dent * oldp, struct dent * newp));</span>
<a name="l00221"></a>00221 <span class="comment">static int acoversb P ((struct dent * enta, struct dent * entb));</span>
<a name="l00222"></a>00222 <span class="comment">*/</span>
<a name="l00223"></a>00223 <span class="comment">/*static int issubset P ((struct dent * ent1, struct dent * ent2));</span>
<a name="l00224"></a>00224 <span class="comment">static void combineaffixes P ((struct dent * ent1, struct dent * ent2));*/</span>
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keywordtype">void</span> toutent P ((FILE * outfile, <span class="keyword">struct</span> dent * hent,
<a name="l00227"></a>00227 <span class="keywordtype">int</span> onlykeep));
<a name="l00228"></a>00228 <span class="comment">/*static void toutword P ((FILE * outfile, char * word,</span>
<a name="l00229"></a>00229 <span class="comment"> struct dent * cent));</span>
<a name="l00230"></a>00230 <span class="comment">static void flagout P ((FILE * outfile, int flag));</span>
<a name="l00231"></a>00231 <span class="comment">*/</span>
<a name="l00232"></a>00232 <span class="preprocessor">#ifndef ICHAR_IS_CHAR</span>
<a name="l00233"></a>00233 <span class="preprocessor"></span>ichar_t * icharcpy P ((ichar_t * out, ichar_t * in));
<a name="l00234"></a>00234 <span class="keywordtype">int</span> icharlen P ((ichar_t * str));
<a name="l00235"></a>00235 <span class="keywordtype">int</span> icharcmp P ((ichar_t * s1, ichar_t * s2));
<a name="l00236"></a>00236 <span class="keywordtype">int</span> icharncmp P ((ichar_t * s1, ichar_t * s2, <span class="keywordtype">int</span> n));
<a name="l00237"></a>00237 <span class="preprocessor">#endif </span><span class="comment">/* ICHAR_IS_CHAR */</span>
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="comment">/*static int has_marker;*/</span>
<a name="l00240"></a>00240
<a name="l00241"></a>00241 <span class="comment">/*</span>
<a name="l00242"></a>00242 <span class="comment"> * Fill in a directory entry, including setting the capitalization flags, and</span>
<a name="l00243"></a>00243 <span class="comment"> * allocate and initialize memory for the d->word field. Returns -1</span>
<a name="l00244"></a>00244 <span class="comment"> * if there was trouble. The input word must be in canonical form.</span>
<a name="l00245"></a>00245 <span class="comment">int makedent (lbuf, lbuflen, d)</span>
<a name="l00246"></a>00246 <span class="comment">This function is not used by AbiWord. I don't know if it'll be needed for </span>
<a name="l00247"></a>00247 <span class="comment">other abi documents</span>
<a name="l00248"></a>00248 <span class="comment"> */</span>
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="preprocessor">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00251"></a>00251 <span class="preprocessor"></span>
<a name="l00259"></a>00259 <span class="keywordtype">long</span>
<a name="l00260"></a>00260 ISpellChecker::whatcap (ichar_t *word)
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 <span class="keyword">register</span> ichar_t * p;
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="keywordflow">for</span> (p = word; *p; p++)
<a name="l00265"></a>00265 {
<a name="l00266"></a>00266 <span class="keywordflow">if</span> (mylower (*p))
<a name="l00267"></a>00267 <span class="keywordflow">break</span>;
<a name="l00268"></a>00268 }
<a name="l00269"></a>00269 <span class="keywordflow">if</span> (*p == <span class="charliteral">'\0'</span>)
<a name="l00270"></a>00270 <span class="keywordflow">return</span> ALLCAPS;
<a name="l00271"></a>00271 <span class="keywordflow">else</span>
<a name="l00272"></a>00272 {
<a name="l00273"></a>00273 <span class="keywordflow">for</span> ( ; *p; p++)
<a name="l00274"></a>00274 {
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (myupper (*p))
<a name="l00276"></a>00276 <span class="keywordflow">break</span>;
<a name="l00277"></a>00277 }
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (*p == <span class="charliteral">'\0'</span>)
<a name="l00279"></a>00279 {
<a name="l00280"></a>00280 <span class="comment">/*</span>
<a name="l00281"></a>00281 <span class="comment"> ** No uppercase letters follow the lowercase ones.</span>
<a name="l00282"></a>00282 <span class="comment"> ** If there is more than one uppercase letter, it's</span>
<a name="l00283"></a>00283 <span class="comment"> ** "followcase". If only the first one is capitalized,</span>
<a name="l00284"></a>00284 <span class="comment"> ** it's "capitalize". If there are no capitals</span>
<a name="l00285"></a>00285 <span class="comment"> ** at all, it's ANYCASE.</span>
<a name="l00286"></a>00286 <span class="comment"> */</span>
<a name="l00287"></a>00287 <span class="keywordflow">if</span> (myupper (word[0]))
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289 <span class="keywordflow">for</span> (p = word + 1; *p != <span class="charliteral">'\0'</span>; p++)
<a name="l00290"></a>00290 {
<a name="l00291"></a>00291 <span class="keywordflow">if</span> (myupper (*p))
<a name="l00292"></a>00292 <span class="keywordflow">return</span> FOLLOWCASE;
<a name="l00293"></a>00293 }
<a name="l00294"></a>00294 <span class="keywordflow">return</span> CAPITALIZED;
<a name="l00295"></a>00295 }
<a name="l00296"></a>00296 <span class="keywordflow">else</span>
<a name="l00297"></a>00297 <span class="keywordflow">return</span> ANYCASE;
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299 <span class="keywordflow">else</span>
<a name="l00300"></a>00300 <span class="keywordflow">return</span> FOLLOWCASE; <span class="comment">/* .../lower/upper */</span>
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303
<a name="l00312"></a>00312 <span class="keywordtype">int</span> ISpellChecker::addvheader ( <span class="keyword">struct</span> dent *dp)
<a name="l00313"></a>00313 {
<a name="l00314"></a>00314 <span class="keyword">register</span> <span class="keyword">struct </span>dent * tdent; <span class="comment">/* Copy of entry */</span>
<a name="l00315"></a>00315
<a name="l00316"></a>00316 <span class="comment">/*</span>
<a name="l00317"></a>00317 <span class="comment"> ** Add a second entry with the correct capitalization, and then make</span>
<a name="l00318"></a>00318 <span class="comment"> ** dp into a special dummy entry.</span>
<a name="l00319"></a>00319 <span class="comment"> */</span>
<a name="l00320"></a>00320 tdent = <span class="keyword">static_cast<</span>struct dent *<span class="keyword">></span>(malloc(<span class="keyword">sizeof</span> (<span class="keyword">struct</span> dent)));
<a name="l00321"></a>00321 <span class="keywordflow">if</span> (tdent == NULL)
<a name="l00322"></a>00322 {
<a name="l00323"></a>00323 fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE, dp->word);
<a name="l00324"></a>00324 <span class="keywordflow">return</span> -1;
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 *tdent = *dp;
<a name="l00327"></a>00327 <span class="keywordflow">if</span> (captype (tdent->flagfield) != FOLLOWCASE)
<a name="l00328"></a>00328 tdent->word = NULL;
<a name="l00329"></a>00329 <span class="keywordflow">else</span>
<a name="l00330"></a>00330 {
<a name="l00331"></a>00331 <span class="comment">/* Followcase words need a copy of the capitalization */</span>
<a name="l00332"></a>00332 tdent->word = <span class="keyword">static_cast<</span><span class="keywordtype">char</span> *<span class="keyword">></span>(malloc (static_cast<unsigned int>(strlen(tdent->word)) + 1));
<a name="l00333"></a>00333 <span class="keywordflow">if</span> (tdent->word == NULL)
<a name="l00334"></a>00334 {
<a name="l00335"></a>00335 fprintf (stderr, MAKEDENT_C_NO_WORD_SPACE, dp->word);
<a name="l00336"></a>00336 free (reinterpret_cast<char *>(tdent));
<a name="l00337"></a>00337 <span class="keywordflow">return</span> -1;
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339 strcpy (tdent->word, dp->word);
<a name="l00340"></a>00340 }
<a name="l00341"></a>00341 chupcase (dp->word);
<a name="l00342"></a>00342 dp->next = tdent;
<a name="l00343"></a>00343 dp->flagfield &= ~CAPTYPEMASK;
<a name="l00344"></a>00344 dp->flagfield |= (ALLCAPS | MOREVARIANTS);
<a name="l00345"></a>00345 <span class="keywordflow">return</span> 0;
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347 <span class="preprocessor">#endif </span><span class="comment">/* NO_CAPITALIZATION_SUPPORT */</span>
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="comment">/*</span>
<a name="l00350"></a>00350 <span class="comment">** Combine and resolve the entries describing two capitalizations of the same</span>
<a name="l00351"></a>00351 <span class="comment">** word. This may require allocating yet more entries.</span>
<a name="l00352"></a>00352 <span class="comment">**</span>
<a name="l00353"></a>00353 <span class="comment">** Hdrp is a pointer into a hash table. If the word covered by hdrp has</span>
<a name="l00354"></a>00354 <span class="comment">** variations, hdrp must point to the header. Newp is a pointer to temporary</span>
<a name="l00355"></a>00355 <span class="comment">** storage, and space is malloc'ed if newp is to be kept. The newp->word</span>
<a name="l00356"></a>00356 <span class="comment">** field must have been allocated with mymalloc, so that this routine may free</span>
<a name="l00357"></a>00357 <span class="comment">** the space if it keeps newp but not the word.</span>
<a name="l00358"></a>00358 <span class="comment">**</span>
<a name="l00359"></a>00359 <span class="comment">** Return value: 0 if the word was added, 1 if the word was combined</span>
<a name="l00360"></a>00360 <span class="comment">** with an existing entry, and -1 if trouble occurred (e.g., malloc).</span>
<a name="l00361"></a>00361 <span class="comment">** If 1 is returned, newp->word may have been be freed using myfree.</span>
<a name="l00362"></a>00362 <span class="comment">**</span>
<a name="l00363"></a>00363 <span class="comment">** Life is made much more difficult by the KEEP flag's possibilities. We</span>
<a name="l00364"></a>00364 <span class="comment">** must ensure that a !KEEP word doesn't find its way into the personal</span>
<a name="l00365"></a>00365 <span class="comment">** dictionary as a result of this routine's actions. However, a !KEEP</span>
<a name="l00366"></a>00366 <span class="comment">** word that has affixes must have come from the main dictionary, so it</span>
<a name="l00367"></a>00367 <span class="comment">** is acceptable to combine entries in that case (got that?).</span>
<a name="l00368"></a>00368 <span class="comment">**</span>
<a name="l00369"></a>00369 <span class="comment">** The net result of all this is a set of rules that is a bloody pain</span>
<a name="l00370"></a>00370 <span class="comment">** to figure out. Basically, we want to choose one of the following actions:</span>
<a name="l00371"></a>00371 <span class="comment">**</span>
<a name="l00372"></a>00372 <span class="comment">** (1) Add newp's affixes and KEEP flag to oldp, and discard newp.</span>
<a name="l00373"></a>00373 <span class="comment">** (2) Add oldp's affixes and KEEP flag to newp, replace oldp with</span>
<a name="l00374"></a>00374 <span class="comment">** newp, and discard newp.</span>
<a name="l00375"></a>00375 <span class="comment">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00376"></a>00376 <span class="comment">** (3) Insert newp as a new entry in the variants list. If there is</span>
<a name="l00377"></a>00377 <span class="comment">** currently no variant header, this requires adding one. Adding a</span>
<a name="l00378"></a>00378 <span class="comment">** header splits into two sub-cases:</span>
<a name="l00379"></a>00379 <span class="comment">**</span>
<a name="l00380"></a>00380 <span class="comment">** (3a) If oldp is ALLCAPS and the KEEP flags match, just turn it</span>
<a name="l00381"></a>00381 <span class="comment">** into the header.</span>
<a name="l00382"></a>00382 <span class="comment">** (3b) Otherwise, add a new entry to serve as the header.</span>
<a name="l00383"></a>00383 <span class="comment">** To ease list linking, this is done by copying oldp into</span>
<a name="l00384"></a>00384 <span class="comment">** the new entry, and then performing (3a).</span>
<a name="l00385"></a>00385 <span class="comment">**</span>
<a name="l00386"></a>00386 <span class="comment">** After newp has been added as a variant, its affixes and KEEP</span>
<a name="l00387"></a>00387 <span class="comment">** flag are OR-ed into the variant header.</span>
<a name="l00388"></a>00388 <span class="comment">#endif</span>
<a name="l00389"></a>00389 <span class="comment">**</span>
<a name="l00390"></a>00390 <span class="comment">** So how to choose which? The default is always case (3), which adds newp</span>
<a name="l00391"></a>00391 <span class="comment">** as a new entry in the variants list. Cases (1) and (2) are symmetrical</span>
<a name="l00392"></a>00392 <span class="comment">** except for which entry is discarded. We can use case (1) or (2) whenever</span>
<a name="l00393"></a>00393 <span class="comment">** one entry "covers" the other. "Covering" is defined as follows:</span>
<a name="l00394"></a>00394 <span class="comment">**</span>
<a name="l00395"></a>00395 <span class="comment">** (4) For entries with matching capitalization types, A covers B</span>
<a name="l00396"></a>00396 <span class="comment">** if:</span>
<a name="l00397"></a>00397 <span class="comment">**</span>
<a name="l00398"></a>00398 <span class="comment">** (4a) B's affix flags are a subset of A's, or the KEEP flags</span>
<a name="l00399"></a>00399 <span class="comment">** match, and</span>
<a name="l00400"></a>00400 <span class="comment">** (4b) either the KEEP flags match, or A's KEEP flag is set.</span>
<a name="l00401"></a>00401 <span class="comment">** (Since A has more suffixes, combining B with it won't</span>
<a name="l00402"></a>00402 <span class="comment">** cause any extra suffixes to be added to the dictionary.)</span>
<a name="l00403"></a>00403 <span class="comment">** (4c) If the words are FOLLOWCASE, the capitalizations match</span>
<a name="l00404"></a>00404 <span class="comment">** exactly.</span>
<a name="l00405"></a>00405 <span class="comment">**</span>
<a name="l00406"></a>00406 <span class="comment">#ifndef NO_CAPITALIZATION_SUPPORT</span>
<a name="l00407"></a>00407 <span class="comment">** (5) For entries with mismatched capitalization types, A covers B</span>
<a name="l00408"></a>00408 <span class="comment">** if (4a) and (4b) are true, and:</span>
<a name="l00409"></a>00409 <span class="comment">**</span>
<a name="l00410"></a>00410 <span class="comment">** (5a) B is ALLCAPS, or</span>
<a name="l00411"></a>00411 <span class="comment">** (5b) A is ANYCASE, and B is CAPITALIZED.</span>
<a name="l00412"></a>00412 <span class="comment">#endif</span>
<a name="l00413"></a>00413 <span class="comment">**</span>
<a name="l00414"></a>00414 <span class="comment">** For any "hdrp" without variants, oldp is the same as hdrp. Otherwise,</span>
<a name="l00415"></a>00415 <span class="comment">** the above tests are applied using each variant in turn for oldp.</span>
<a name="l00416"></a>00416 <span class="comment">int combinecaps (hdrp, newp)</span>
<a name="l00417"></a>00417 <span class="comment">static void forcevheader (hdrp, oldp, newp)</span>
<a name="l00418"></a>00418 <span class="comment">static int combine_two_entries (hdrp, oldp, newp)</span>
<a name="l00419"></a>00419 <span class="comment">static int acoversb (enta, entb)</span>
<a name="l00420"></a>00420 <span class="comment">*/</span>
<a name="l00421"></a>00421
<a name="l00422"></a>00422 <span class="comment">/*</span>
<a name="l00423"></a>00423 <span class="comment"> * \param s</span>
<a name="l00424"></a>00424 <span class="comment"> */</span>
<a name="l00425"></a>00425 <span class="keywordtype">void</span>
<a name="l00426"></a>00426 ISpellChecker::upcase (ichar_t *s)
<a name="l00427"></a>00427 {
<a name="l00428"></a>00428
<a name="l00429"></a>00429 <span class="keywordflow">while</span> (*s)
<a name="l00430"></a>00430 {
<a name="l00431"></a>00431 *s = mytoupper (*s);
<a name="l00432"></a>00432 s++;
<a name="l00433"></a>00433 }
<a name="l00434"></a>00434 }
<a name="l00435"></a>00435
<a name="l00436"></a>00436 <span class="comment">/*</span>
<a name="l00437"></a>00437 <span class="comment"> * \param s</span>
<a name="l00438"></a>00438 <span class="comment"> */</span>
<a name="l00439"></a>00439 <span class="keywordtype">void</span>
<a name="l00440"></a>00440 ISpellChecker::lowcase (ichar_t *s)
<a name="l00441"></a>00441 {
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <span class="keywordflow">while</span> (*s)
<a name="l00444"></a>00444 {
<a name="l00445"></a>00445 *s = mytolower (*s);
<a name="l00446"></a>00446 s++;
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448 }
<a name="l00449"></a>00449
<a name="l00456"></a>00456 <span class="keywordtype">void</span>
<a name="l00457"></a>00457 ISpellChecker::chupcase (<span class="keywordtype">char</span> *s)
<a name="l00458"></a>00458 {
<a name="l00459"></a>00459 ichar_t * is;
<a name="l00460"></a>00460
<a name="l00461"></a>00461 is = strtosichar (s, 1);
<a name="l00462"></a>00462 upcase (is);
<a name="l00463"></a>00463 ichartostr (s, is, strlen (s) + 1, 1);
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465
<a name="l00466"></a>00466 <span class="comment">/*</span>
<a name="l00467"></a>00467 <span class="comment">** See if one affix field is a subset of another. Returns NZ if ent1</span>
<a name="l00468"></a>00468 <span class="comment">** is a subset of ent2. The KEEP flag is not taken into consideration.</span>
<a name="l00469"></a>00469 <span class="comment">static int issubset (ent1, ent2)</span>
<a name="l00470"></a>00470 <span class="comment">static void combineaffixes (ent1, ent2)</span>
<a name="l00471"></a>00471 <span class="comment">*/</span>
<a name="l00472"></a>00472
<a name="l00473"></a>00473 <span class="comment">/*</span>
<a name="l00474"></a>00474 <span class="comment">** Write out a dictionary entry, including capitalization variants.</span>
<a name="l00475"></a>00475 <span class="comment">** If onlykeep is true, only those variants with KEEP set will be</span>
<a name="l00476"></a>00476 <span class="comment">** written.</span>
<a name="l00477"></a>00477 <span class="comment">Removed -- not used by Abiword</span>
<a name="l00478"></a>00478 <span class="comment">void toutent_ (toutfile, hent, onlykeep)</span>
<a name="l00479"></a>00479 <span class="comment">static void toutword (toutfile, word, cent)</span>
<a name="l00480"></a>00480 <span class="comment">static void flagout (toutfile, flag)</span>
<a name="l00481"></a>00481 <span class="comment">*/</span>
<a name="l00482"></a>00482
<a name="l00498"></a>00498 <span class="keywordtype">int</span>
<a name="l00499"></a>00499 ISpellChecker::stringcharlen (<span class="keywordtype">char</span> *bufp, <span class="keywordtype">int</span> canonical)
<a name="l00500"></a>00500 {
<a name="l00501"></a>00501 <span class="preprocessor">#ifdef SLOWMULTIPLY</span>
<a name="l00502"></a>00502 <span class="preprocessor"></span> <span class="keyword">static</span> <span class="keywordtype">char</span> * sp[MAXSTRINGCHARS];
<a name="l00503"></a>00503 <span class="keyword">static</span> <span class="keywordtype">int</span> inited = 0;
<a name="l00504"></a>00504 <span class="preprocessor">#endif </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00505"></a>00505 <span class="keyword">register</span> <span class="keywordtype">char</span> * bufcur;
<a name="l00506"></a>00506 <span class="keyword">register</span> <span class="keywordtype">char</span> * stringcur;
<a name="l00507"></a>00507 <span class="keyword">register</span> <span class="keywordtype">int</span> stringno;
<a name="l00508"></a>00508 <span class="keyword">register</span> <span class="keywordtype">int</span> lowstringno;
<a name="l00509"></a>00509 <span class="keyword">register</span> <span class="keywordtype">int</span> highstringno;
<a name="l00510"></a>00510 <span class="keywordtype">int</span> dupwanted;
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="preprocessor">#ifdef SLOWMULTIPLY</span>
<a name="l00513"></a>00513 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!inited)
<a name="l00514"></a>00514 {
<a name="l00515"></a>00515 inited = 1;
<a name="l00516"></a>00516 <span class="keywordflow">for</span> (stringno = 0; stringno < MAXSTRINGCHARS; stringno++)
<a name="l00517"></a>00517 sp[stringno] = &hashheader.stringchars[stringno][0];
<a name="l00518"></a>00518 }
<a name="l00519"></a>00519 <span class="preprocessor">#endif </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00520"></a>00520 lowstringno = 0;
<a name="l00521"></a>00521 highstringno = m_hashheader.nstrchars - 1;
<a name="l00522"></a>00522 dupwanted = canonical ? 0 : m_defdupchar;
<a name="l00523"></a>00523 <span class="keywordflow">while</span> (lowstringno <= highstringno)
<a name="l00524"></a>00524 {
<a name="l00525"></a>00525 stringno = (lowstringno + highstringno) >> 1;
<a name="l00526"></a>00526 <span class="preprocessor">#ifdef SLOWMULTIPLY</span>
<a name="l00527"></a>00527 <span class="preprocessor"></span> stringcur = sp[stringno];
<a name="l00528"></a>00528 <span class="preprocessor">#else </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00529"></a>00529 stringcur = &m_hashheader.stringchars[stringno][0];
<a name="l00530"></a>00530 <span class="preprocessor">#endif </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00531"></a>00531 bufcur = bufp;
<a name="l00532"></a>00532 <span class="keywordflow">while</span> (*stringcur)
<a name="l00533"></a>00533 {
<a name="l00534"></a>00534 <span class="preprocessor">#ifdef NO8BIT</span>
<a name="l00535"></a>00535 <span class="preprocessor"></span> <span class="keywordflow">if</span> (((*bufcur++ ^ *stringcur) & 0x7F) != 0)
<a name="l00536"></a>00536 #<span class="keywordflow">else</span> <span class="comment">/* NO8BIT */</span>
<a name="l00537"></a>00537 <span class="keywordflow">if</span> (*bufcur++ != *stringcur)
<a name="l00538"></a>00538 <span class="preprocessor">#endif </span><span class="comment">/* NO8BIT */</span>
<a name="l00539"></a>00539 <span class="keywordflow">break</span>;
<a name="l00540"></a>00540 <span class="comment">/*</span>
<a name="l00541"></a>00541 <span class="comment"> ** We can't use autoincrement above because of the</span>
<a name="l00542"></a>00542 <span class="comment"> ** test below.</span>
<a name="l00543"></a>00543 <span class="comment"> */</span>
<a name="l00544"></a>00544 stringcur++;
<a name="l00545"></a>00545 }
<a name="l00546"></a>00546 <span class="keywordflow">if</span> (*stringcur == <span class="charliteral">'\0'</span>)
<a name="l00547"></a>00547 {
<a name="l00548"></a>00548 <span class="keywordflow">if</span> (m_hashheader.dupnos[stringno] == dupwanted)
<a name="l00549"></a>00549 {
<a name="l00550"></a>00550 <span class="comment">/* We have a match */</span>
<a name="l00551"></a>00551 m_laststringch = m_hashheader.stringdups[stringno];
<a name="l00552"></a>00552 <span class="preprocessor">#ifdef SLOWMULTIPLY</span>
<a name="l00553"></a>00553 <span class="preprocessor"></span> <span class="keywordflow">return</span> stringcur - sp[stringno];
<a name="l00554"></a>00554 <span class="preprocessor">#else </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00555"></a>00555 <span class="keywordflow">return</span> stringcur - &m_hashheader.stringchars[stringno][0];
<a name="l00556"></a>00556 <span class="preprocessor">#endif </span><span class="comment">/* SLOWMULTIPLY */</span>
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558 <span class="keywordflow">else</span>
<a name="l00559"></a>00559 --stringcur;
<a name="l00560"></a>00560 }
<a name="l00561"></a>00561 <span class="comment">/* No match - choose which side to search on */</span>
<a name="l00562"></a>00562 <span class="preprocessor">#ifdef NO8BIT</span>
<a name="l00563"></a>00563 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((*--bufcur & 0x7F) < (*stringcur & 0x7F))
<a name="l00564"></a>00564 highstringno = stringno - 1;
<a name="l00565"></a>00565 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*bufcur & 0x7F) > (*stringcur & 0x7F))
<a name="l00566"></a>00566 lowstringno = stringno + 1;
<a name="l00567"></a>00567 <span class="preprocessor">#else </span><span class="comment">/* NO8BIT */</span>
<a name="l00568"></a>00568 <span class="keywordflow">if</span> (*--bufcur < *stringcur)
<a name="l00569"></a>00569 highstringno = stringno - 1;
<a name="l00570"></a>00570 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*bufcur > *stringcur)
<a name="l00571"></a>00571 lowstringno = stringno + 1;
<a name="l00572"></a>00572 <span class="preprocessor">#endif </span><span class="comment">/* NO8BIT */</span>
<a name="l00573"></a>00573 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (dupwanted < m_hashheader.dupnos[stringno])
<a name="l00574"></a>00574 highstringno = stringno - 1;
<a name="l00575"></a>00575 <span class="keywordflow">else</span>
<a name="l00576"></a>00576 lowstringno = stringno + 1;
<a name="l00577"></a>00577 }
<a name="l00578"></a>00578 m_laststringch = <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>(-1);
<a name="l00579"></a>00579 <span class="keywordflow">return</span> 0; <span class="comment">/* Not a string character */</span>
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="comment">/* MACROS CONVERTED TO FUNCTIONS</span>
<a name="l00583"></a>00583 <span class="comment">** These macros are similar to the ones above, but they take into account</span>
<a name="l00584"></a>00584 <span class="comment">** the possibility of string characters. Note well that they take a POINTER,</span>
<a name="l00585"></a>00585 <span class="comment">** not a character.</span>
<a name="l00586"></a>00586 <span class="comment">**</span>
<a name="l00587"></a>00587 <span class="comment">** The "l_" versions set "len" to the length of the string character as a</span>
<a name="l00588"></a>00588 <span class="comment">** handy side effect. (Note that the global "laststringch" is also set,</span>
<a name="l00589"></a>00589 <span class="comment">** and sometimes used, by these macros.)</span>
<a name="l00590"></a>00590 <span class="comment">**</span>
<a name="l00591"></a>00591 <span class="comment">** The "l1_" versions go one step further and guarantee that the "len"</span>
<a name="l00592"></a>00592 <span class="comment">** field is valid for *all* characters, being set to 1 even if the macro</span>
<a name="l00593"></a>00593 <span class="comment">** returns false. This macro is a great example of how NOT to write</span>
<a name="l00594"></a>00594 <span class="comment">** readable C.</span>
<a name="l00595"></a>00595 <span class="comment">*/</span>
<a name="l00596"></a>00596 <span class="preprocessor">#define isstringch(ptr, canon) (isstringstart (*(ptr)) \</span>
<a name="l00597"></a>00597 <span class="preprocessor"> && stringcharlen ((ptr), (canon)) > 0)</span>
<a name="l00598"></a>00598 <span class="preprocessor"></span><span class="comment">/*</span>
<a name="l00599"></a>00599 <span class="comment">int isstringch(char *ptr, int canon) {</span>
<a name="l00600"></a>00600 <span class="comment"> return (isstringstart (*(ptr)) && (len = stringcharlen ((ptr), (canon))) > 0);</span>
<a name="l00601"></a>00601 <span class="comment">}</span>
<a name="l00602"></a>00602 <span class="comment">*/</span>
<a name="l00603"></a>00603
<a name="l00604"></a>00604 <span class="preprocessor">#define l_isstringch(ptr, len, canon) \</span>
<a name="l00605"></a>00605 <span class="preprocessor"> (isstringstart (*(ptr)) \</span>
<a name="l00606"></a>00606 <span class="preprocessor"> && (len = stringcharlen ((ptr), (canon))) \</span>
<a name="l00607"></a>00607 <span class="preprocessor"> > 0)</span>
<a name="l00608"></a>00608 <span class="preprocessor"></span><span class="comment">/*</span>
<a name="l00609"></a>00609 <span class="comment">int l_isstringch(char *ptr, int len, int canon) {</span>
<a name="l00610"></a>00610 <span class="comment"> return (isstringstart (*(ptr)) && (len = stringcharlen ((ptr), (canon))) > 0);</span>
<a name="l00611"></a>00611 <span class="comment">}</span>
<a name="l00612"></a>00612 <span class="comment">*/</span>
<a name="l00613"></a>00613
<a name="l00614"></a>00614 <span class="preprocessor">#define l1_isstringch(ptr, len, canon) \</span>
<a name="l00615"></a>00615 <span class="preprocessor"> (len = 1, \</span>
<a name="l00616"></a>00616 <span class="preprocessor"> isstringstart ((unsigned char)(*(ptr))) \</span>
<a name="l00617"></a>00617 <span class="preprocessor"> && ((len = \</span>
<a name="l00618"></a>00618 <span class="preprocessor"> stringcharlen ((ptr), (canon))) \</span>
<a name="l00619"></a>00619 <span class="preprocessor"> > 0 \</span>
<a name="l00620"></a>00620 <span class="preprocessor"> ? 1 : (len = 1, 0)))</span>
<a name="l00621"></a>00621 <span class="preprocessor"></span><span class="comment">/*</span>
<a name="l00622"></a>00622 <span class="comment">int l1_isstringch(char *ptr, int len, int canon) {</span>
<a name="l00623"></a>00623 <span class="comment"> return (len = 1, isstringstart ((unsigned char)(*(ptr))) && </span>
<a name="l00624"></a>00624 <span class="comment"> ((len = stringcharlen ((ptr), (canon))) > 0 ? 1 : (len = 1, 0)));</span>
<a name="l00625"></a>00625 <span class="comment">}</span>
<a name="l00626"></a>00626 <span class="comment">*/</span>
<a name="l00627"></a>00627
<a name="l00628"></a>00628 <span class="comment">/*** END MACRO CONVERSION ***/</span>
<a name="l00629"></a>00629
<a name="l00641"></a>00641 <span class="keywordtype">int</span>
<a name="l00642"></a>00642 ISpellChecker::strtoichar (ichar_t *out, <span class="keywordtype">char</span> *in, <span class="keywordtype">int</span> outlen, <span class="keywordtype">int</span> canonical)
<a name="l00643"></a>00643 {
<a name="l00644"></a>00644 <span class="keyword">register</span> <span class="keywordtype">int</span> len = 1; <span class="comment">/* Length of next character */</span>
<a name="l00645"></a>00645
<a name="l00646"></a>00646 outlen /= <span class="keyword">sizeof</span> (ichar_t); <span class="comment">/* Convert to an ichar_t count */</span>
<a name="l00647"></a>00647 <span class="keywordflow">for</span> ( ; --outlen > 0 && *in != <span class="charliteral">'\0'</span>; in += len)
<a name="l00648"></a>00648 {
<a name="l00649"></a>00649 <span class="keywordflow">if</span> (l1_isstringch (in, len , canonical)) {
<a name="l00650"></a>00650 *out++ = SET_SIZE + m_laststringch;
<a name="l00651"></a>00651 } <span class="keywordflow">else</span> {
<a name="l00652"></a>00652 *out++ = (<span class="keywordtype">unsigned</span> char)( *in );
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654 }
<a name="l00655"></a>00655 *out = 0;
<a name="l00656"></a>00656 <span class="keywordflow">return</span> outlen <= 0;
<a name="l00657"></a>00657 }
<a name="l00658"></a>00658
<a name="l00674"></a>00674 <span class="keywordtype">int</span>
<a name="l00675"></a>00675 ISpellChecker::ichartostr ( <span class="keywordtype">char</span> *out, ichar_t *in, <span class="keywordtype">int</span> outlen, <span class="keywordtype">int</span> canonical)
<a name="l00676"></a>00676 {
<a name="l00677"></a>00677 <span class="keyword">register</span> <span class="keywordtype">int</span> ch; <span class="comment">/* Next character to store */</span>
<a name="l00678"></a>00678 <span class="keyword">register</span> <span class="keywordtype">int</span> i; <span class="comment">/* Index into duplicates list */</span>
<a name="l00679"></a>00679 <span class="keyword">register</span> <span class="keywordtype">char</span> * scharp; <span class="comment">/* Pointer into a string char */</span>
<a name="l00680"></a>00680
<a name="l00681"></a>00681 <span class="keywordflow">while</span> (--outlen > 0 && (ch = *in++) != 0)
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683 <span class="keywordflow">if</span> (ch < SET_SIZE)
<a name="l00684"></a>00684 *out++ = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(ch);
<a name="l00685"></a>00685 <span class="keywordflow">else</span>
<a name="l00686"></a>00686 {
<a name="l00687"></a>00687 ch -= SET_SIZE;
<a name="l00688"></a>00688 <span class="keywordflow">if</span> (!canonical)
<a name="l00689"></a>00689 {
<a name="l00690"></a>00690 <span class="keywordflow">for</span> (i = m_hashheader.nstrchars; --i >= 0; )
<a name="l00691"></a>00691 {
<a name="l00692"></a>00692 <span class="keywordflow">if</span> (m_hashheader.dupnos[i] == m_defdupchar
<a name="l00693"></a>00693 && (static_cast<int>(m_hashheader.stringdups[i])) == ch)
<a name="l00694"></a>00694 {
<a name="l00695"></a>00695 ch = i;
<a name="l00696"></a>00696 <span class="keywordflow">break</span>;
<a name="l00697"></a>00697 }
<a name="l00698"></a>00698 }
<a name="l00699"></a>00699 }
<a name="l00700"></a>00700 scharp = m_hashheader.stringchars[<span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span><span class="keyword">></span>(ch)];
<a name="l00701"></a>00701 <span class="keywordflow">while</span> ((*out++ = *scharp++) != <span class="charliteral">'\0'</span>)
<a name="l00702"></a>00702 ;
<a name="l00703"></a>00703 out--;
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705 }
<a name="l00706"></a>00706 *out = <span class="charliteral">'\0'</span>;
<a name="l00707"></a>00707 <span class="keywordflow">return</span> outlen <= 0;
<a name="l00708"></a>00708 }
<a name="l00709"></a>00709
<a name="l00718"></a>00718 ichar_t *
<a name="l00719"></a>00719 ISpellChecker::strtosichar ( <span class="keywordtype">char</span> *in, <span class="keywordtype">int</span> canonical)
<a name="l00720"></a>00720 {
<a name="l00721"></a>00721 <span class="keyword">static</span> ichar_t out[STRTOSICHAR_SIZE / <span class="keyword">sizeof</span> (ichar_t)];
<a name="l00722"></a>00722
<a name="l00723"></a>00723 <span class="keywordflow">if</span> (strtoichar (out, in, <span class="keyword">sizeof</span> out, canonical))
<a name="l00724"></a>00724 fprintf (stderr, WORD_TOO_LONG (in));
<a name="l00725"></a>00725 <span class="keywordflow">return</span> out;
<a name="l00726"></a>00726 }
<a name="l00727"></a>00727
<a name="l00736"></a>00736 <span class="keywordtype">char</span> *
<a name="l00737"></a>00737 ISpellChecker::ichartosstr (ichar_t *in, <span class="keywordtype">int</span> canonical)
<a name="l00738"></a>00738 {
<a name="l00739"></a>00739 <span class="keyword">static</span> <span class="keywordtype">char</span> out[ICHARTOSSTR_SIZE];
<a name="l00740"></a>00740
<a name="l00741"></a>00741 <span class="keywordflow">if</span> (ichartostr (out, in, <span class="keyword">sizeof</span> out, canonical))
<a name="l00742"></a>00742 fprintf (stderr, WORD_TOO_LONG (out));
<a name="l00743"></a>00743 <span class="keywordflow">return</span> out;
<a name="l00744"></a>00744 }
<a name="l00745"></a>00745
<a name="l00754"></a>00754 <span class="keywordtype">char</span> *
<a name="l00755"></a>00755 ISpellChecker::printichar (<span class="keywordtype">int</span> in)
<a name="l00756"></a>00756 {
<a name="l00757"></a>00757 <span class="keyword">static</span> <span class="keywordtype">char</span> out[MAXSTRINGCHARLEN + 1];
<a name="l00758"></a>00758
<a name="l00759"></a>00759 <span class="keywordflow">if</span> (in < SET_SIZE)
<a name="l00760"></a>00760 {
<a name="l00761"></a>00761 out[0] = <span class="keyword">static_cast<</span><span class="keywordtype">char</span><span class="keyword">></span>(in);
<a name="l00762"></a>00762 out[1] = <span class="charliteral">'\0'</span>;
<a name="l00763"></a>00763 }
<a name="l00764"></a>00764 <span class="keywordflow">else</span>
<a name="l00765"></a>00765 strcpy (out, m_hashheader.stringchars[static_cast<unsigned>(in) - SET_SIZE]);
<a name="l00766"></a>00766 <span class="keywordflow">return</span> out;
<a name="l00767"></a>00767 }
<a name="l00768"></a>00768
<a name="l00769"></a>00769 <span class="preprocessor">#ifndef ICHAR_IS_CHAR</span>
<a name="l00770"></a>00770 <span class="preprocessor"></span>
<a name="l00778"></a>00778 ichar_t *
<a name="l00779"></a>00779 icharcpy (ichar_t *out, ichar_t *in)
<a name="l00780"></a>00780 {
<a name="l00781"></a>00781 ichar_t * origout; <span class="comment">/* Copy of destination for return */</span>
<a name="l00782"></a>00782
<a name="l00783"></a>00783 origout = out;
<a name="l00784"></a>00784 <span class="keywordflow">while</span> ((*out++ = *in++) != 0)
<a name="l00785"></a>00785 ;
<a name="l00786"></a>00786 <span class="keywordflow">return</span> origout;
<a name="l00787"></a>00787 }
<a name="l00788"></a>00788
<a name="l00796"></a>00796 <span class="keywordtype">int</span>
<a name="l00797"></a>00797 icharlen (ichar_t * in)
<a name="l00798"></a>00798 {
<a name="l00799"></a>00799 <span class="keyword">register</span> <span class="keywordtype">int</span> len; <span class="comment">/* Length so far */</span>
<a name="l00800"></a>00800
<a name="l00801"></a>00801 <span class="keywordflow">for</span> (len = 0; *in++ != 0; len++)
<a name="l00802"></a>00802 ;
<a name="l00803"></a>00803 <span class="keywordflow">return</span> len;
<a name="l00804"></a>00804 }
<a name="l00805"></a>00805
<a name="l00814"></a>00814 <span class="keywordtype">int</span>
<a name="l00815"></a>00815 icharcmp (ichar_t * s1, ichar_t * s2)
<a name="l00816"></a>00816 {
<a name="l00817"></a>00817
<a name="l00818"></a>00818 <span class="keywordflow">while</span> (*s1 != 0)
<a name="l00819"></a>00819 {
<a name="l00820"></a>00820 <span class="keywordflow">if</span> (*s1++ != *s2++)
<a name="l00821"></a>00821 <span class="keywordflow">return</span> *--s1 - *--s2;
<a name="l00822"></a>00822 }
<a name="l00823"></a>00823 <span class="keywordflow">return</span> *s1 - *s2;
<a name="l00824"></a>00824 }
<a name="l00825"></a>00825
<a name="l00835"></a>00835 <span class="keywordtype">int</span>
<a name="l00836"></a>00836 icharncmp (ichar_t *s1, ichar_t *s2, <span class="keywordtype">int</span> n)
<a name="l00837"></a>00837 {
<a name="l00838"></a>00838
<a name="l00839"></a>00839 <span class="keywordflow">while</span> (--n >= 0 && *s1 != 0)
<a name="l00840"></a>00840 {
<a name="l00841"></a>00841 <span class="keywordflow">if</span> (*s1++ != *s2++)
<a name="l00842"></a>00842 <span class="keywordflow">return</span> *--s1 - *--s2;
<a name="l00843"></a>00843 }
<a name="l00844"></a>00844 <span class="keywordflow">if</span> (n < 0)
<a name="l00845"></a>00845 <span class="keywordflow">return</span> 0;
<a name="l00846"></a>00846 <span class="keywordflow">else</span>
<a name="l00847"></a>00847 <span class="keywordflow">return</span> *s1 - *s2;
<a name="l00848"></a>00848 }
<a name="l00849"></a>00849
<a name="l00850"></a>00850 <span class="preprocessor">#endif </span><span class="comment">/* ICHAR_IS_CHAR */</span>
<a name="l00851"></a>00851
<a name="l00852"></a>00852 <span class="comment">/*</span>
<a name="l00853"></a>00853 <span class="comment"> * \param istate</span>
<a name="l00854"></a>00854 <span class="comment"> * \param name</span>
<a name="l00855"></a>00855 <span class="comment"> * \param searchnames</span>
<a name="l00856"></a>00856 <span class="comment"> * \param deformatter</span>
<a name="l00857"></a>00857 <span class="comment"> *</span>
<a name="l00858"></a>00858 <span class="comment"> * \return</span>
<a name="l00859"></a>00859 <span class="comment"> */</span>
<a name="l00860"></a>00860 <span class="keywordtype">int</span>
<a name="l00861"></a>00861 ISpellChecker::findfiletype (<span class="keyword">const</span> <span class="keywordtype">char</span> *name, <span class="keywordtype">int</span> searchnames, <span class="keywordtype">int</span> *deformatter)
<a name="l00862"></a>00862 {
<a name="l00863"></a>00863 <span class="keywordtype">char</span> * cp; <span class="comment">/* Pointer into suffix list */</span>
<a name="l00864"></a>00864 <span class="keywordtype">int</span> cplen; <span class="comment">/* Length of current suffix */</span>
<a name="l00865"></a>00865 <span class="keyword">register</span> <span class="keywordtype">int</span> i; <span class="comment">/* Index into type table */</span>
<a name="l00866"></a>00866 <span class="keywordtype">int</span> len; <span class="comment">/* Length of the name */</span>
<a name="l00867"></a>00867
<a name="l00868"></a>00868 <span class="comment">/*</span>
<a name="l00869"></a>00869 <span class="comment"> * Note: for now, the deformatter is set to 1 for tex, 0 for nroff.</span>
<a name="l00870"></a>00870 <span class="comment"> * Further, we assume that it's one or the other, so that a test</span>
<a name="l00871"></a>00871 <span class="comment"> * for tex is sufficient. This needs to be generalized.</span>
<a name="l00872"></a>00872 <span class="comment"> */</span>
<a name="l00873"></a>00873 len = strlen (name);
<a name="l00874"></a>00874 <span class="keywordflow">if</span> (searchnames)
<a name="l00875"></a>00875 {
<a name="l00876"></a>00876 <span class="keywordflow">for</span> (i = 0; i < m_hashheader.nstrchartype; i++)
<a name="l00877"></a>00877 {
<a name="l00878"></a>00878 <span class="keywordflow">if</span> (strcmp (name, m_chartypes[i].name) == 0)
<a name="l00879"></a>00879 {
<a name="l00880"></a>00880 <span class="keywordflow">if</span> (deformatter != NULL)
<a name="l00881"></a>00881 *deformatter =
<a name="l00882"></a>00882 (strcmp (m_chartypes[i].deformatter, <span class="stringliteral">"tex"</span>) == 0);
<a name="l00883"></a>00883 <span class="keywordflow">return</span> i;
<a name="l00884"></a>00884 }
<a name="l00885"></a>00885 }
<a name="l00886"></a>00886 }
<a name="l00887"></a>00887 <span class="keywordflow">for</span> (i = 0; i < m_hashheader.nstrchartype; i++)
<a name="l00888"></a>00888 {
<a name="l00889"></a>00889 <span class="keywordflow">for</span> (cp = m_chartypes[i].suffixes; *cp != <span class="charliteral">'\0'</span>; cp += cplen + 1)
<a name="l00890"></a>00890 {
<a name="l00891"></a>00891 cplen = strlen (cp);
<a name="l00892"></a>00892 <span class="keywordflow">if</span> (len >= cplen && strcmp (&name[len - cplen], cp) == 0)
<a name="l00893"></a>00893 {
<a name="l00894"></a>00894 <span class="keywordflow">if</span> (deformatter != NULL)
<a name="l00895"></a>00895 *deformatter =
<a name="l00896"></a>00896 (strcmp (m_chartypes[i].deformatter, <span class="stringliteral">"tex"</span>) == 0);
<a name="l00897"></a>00897 <span class="keywordflow">return</span> i;
<a name="l00898"></a>00898 }
<a name="l00899"></a>00899 }
<a name="l00900"></a>00900 }
<a name="l00901"></a>00901 <span class="keywordflow">return</span> -1;
<a name="l00902"></a>00902 }
<a name="l00903"></a>00903
<a name="l00904"></a>00904 <span class="comment">/*</span>
<a name="l00905"></a>00905 <span class="comment"> HACK: macros replaced with function implementations </span>
<a name="l00906"></a>00906 <span class="comment"> so we could do a side-effect-free check for unicode</span>
<a name="l00907"></a>00907 <span class="comment"> characters which aren't in hashheader</span>
<a name="l00908"></a>00908 <span class="comment"></span>
<a name="l00909"></a>00909 <span class="comment"> TODO: this is just a workaround to keep us from crashing. </span>
<a name="l00910"></a>00910 <span class="comment"> more sophisticated logic needed here. </span>
<a name="l00911"></a>00911 <span class="comment">*/</span>
<a name="l00912"></a>00912 <span class="keywordtype">char</span> ISpellChecker::myupper(ichar_t c)
<a name="l00913"></a>00913 {
<a name="l00914"></a>00914 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00915"></a>00915 <span class="keywordflow">return</span> m_hashheader.upperchars[c];
<a name="l00916"></a>00916 <span class="keywordflow">else</span>
<a name="l00917"></a>00917 <span class="keywordflow">return</span> 0;
<a name="l00918"></a>00918 }
<a name="l00919"></a>00919
<a name="l00920"></a>00920 <span class="keywordtype">char</span> ISpellChecker::mylower(ichar_t c)
<a name="l00921"></a>00921 {
<a name="l00922"></a>00922 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00923"></a>00923 <span class="keywordflow">return</span> m_hashheader.lowerchars[c];
<a name="l00924"></a>00924 <span class="keywordflow">else</span>
<a name="l00925"></a>00925 <span class="keywordflow">return</span> 0;
<a name="l00926"></a>00926 }
<a name="l00927"></a>00927
<a name="l00928"></a>00928 <span class="keywordtype">int</span> myspace(ichar_t c)
<a name="l00929"></a>00929 {
<a name="l00930"></a>00930 <span class="keywordflow">return</span> ((c > 0) && (c < 0x80) && isspace(static_cast<unsigned char>(c)));
<a name="l00931"></a>00931 }
<a name="l00932"></a>00932
<a name="l00933"></a>00933 <span class="keywordtype">char</span> ISpellChecker::iswordch(ichar_t c)
<a name="l00934"></a>00934 {
<a name="l00935"></a>00935 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00936"></a>00936 <span class="keywordflow">return</span> m_hashheader.wordchars[c];
<a name="l00937"></a>00937 <span class="keywordflow">else</span>
<a name="l00938"></a>00938 <span class="keywordflow">return</span> 0;
<a name="l00939"></a>00939 }
<a name="l00940"></a>00940
<a name="l00941"></a>00941 <span class="keywordtype">char</span> ISpellChecker::isboundarych(ichar_t c)
<a name="l00942"></a>00942 {
<a name="l00943"></a>00943 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00944"></a>00944 <span class="keywordflow">return</span> m_hashheader.boundarychars[c];
<a name="l00945"></a>00945 <span class="keywordflow">else</span>
<a name="l00946"></a>00946 <span class="keywordflow">return</span> 0;
<a name="l00947"></a>00947 }
<a name="l00948"></a>00948
<a name="l00949"></a>00949 <span class="keywordtype">char</span> ISpellChecker::isstringstart(ichar_t c)
<a name="l00950"></a>00950 {
<a name="l00951"></a>00951 <span class="keywordflow">if</span> (c < (SET_SIZE))
<a name="l00952"></a>00952 <span class="keywordflow">return</span> m_hashheader.stringstarts[<span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">char</span><span class="keyword">></span>(c)];
<a name="l00953"></a>00953 <span class="keywordflow">else</span>
<a name="l00954"></a>00954 <span class="keywordflow">return</span> 0;
<a name="l00955"></a>00955 }
<a name="l00956"></a>00956
<a name="l00957"></a>00957 ichar_t ISpellChecker::mytolower(ichar_t c)
<a name="l00958"></a>00958 {
<a name="l00959"></a>00959 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00960"></a>00960 <span class="keywordflow">return</span> m_hashheader.lowerconv[c];
<a name="l00961"></a>00961 <span class="keywordflow">else</span>
<a name="l00962"></a>00962 <span class="keywordflow">return</span> c;
<a name="l00963"></a>00963 }
<a name="l00964"></a>00964
<a name="l00965"></a>00965 ichar_t ISpellChecker::mytoupper (ichar_t c)
<a name="l00966"></a>00966 {
<a name="l00967"></a>00967 <span class="keywordflow">if</span> (c < (SET_SIZE + MAXSTRINGCHARS))
<a name="l00968"></a>00968 <span class="keywordflow">return</span> m_hashheader.upperconv[c];
<a name="l00969"></a>00969 <span class="keywordflow">else</span>
<a name="l00970"></a>00970 <span class="keywordflow">return</span> c;
<a name="l00971"></a>00971 }
<a name="l00972"></a>00972
</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>
