SILENT KILLERPanel

Current Path: > > opt > alt > libicu65 > usr > > include > > unicode


Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

Files and Folders in: //opt/alt/libicu65/usr//include//unicode

NameTypeSizeLast ModifiedActions
alphaindex.h File 27118 bytes February 08 2022 16:22:58.
appendable.h File 8694 bytes February 08 2022 16:22:58.
basictz.h File 9365 bytes February 08 2022 16:22:58.
brkiter.h File 28464 bytes February 08 2022 16:22:58.
bytestream.h File 9829 bytes February 08 2022 16:22:58.
bytestrie.h File 21266 bytes February 08 2022 16:22:58.
bytestriebuilder.h File 7248 bytes February 08 2022 16:22:58.
calendar.h File 108278 bytes February 08 2022 16:22:58.
caniter.h File 7611 bytes February 08 2022 16:22:58.
casemap.h File 25933 bytes February 08 2022 16:22:58.
char16ptr.h File 7393 bytes February 08 2022 16:22:58.
chariter.h File 24632 bytes February 08 2022 16:22:58.
choicfmt.h File 24482 bytes February 08 2022 16:22:58.
coleitr.h File 14094 bytes February 08 2022 16:22:58.
coll.h File 57581 bytes February 08 2022 16:22:58.
compactdecimalformat.h File 7047 bytes February 08 2022 16:22:58.
curramt.h File 3851 bytes February 08 2022 16:22:58.
currpinf.h File 7473 bytes February 08 2022 16:22:58.
currunit.h File 4149 bytes February 08 2022 16:22:58.
datefmt.h File 41641 bytes February 08 2022 16:22:58.
dbbi.h File 1223 bytes February 08 2022 16:22:58.
dcfmtsym.h File 20611 bytes February 08 2022 16:22:59.
decimfmt.h File 89480 bytes February 08 2022 16:22:59.
docmain.h File 7142 bytes February 08 2022 16:22:58.
dtfmtsym.h File 38609 bytes February 08 2022 16:22:59.
dtintrv.h File 3930 bytes February 08 2022 16:22:58.
dtitvfmt.h File 47745 bytes February 08 2022 16:22:59.
dtitvinf.h File 18959 bytes February 08 2022 16:22:59.
dtptngen.h File 25684 bytes February 08 2022 16:22:59.
dtrule.h File 8888 bytes February 08 2022 16:22:59.
edits.h File 21237 bytes February 08 2022 16:22:58.
enumset.h File 2130 bytes February 08 2022 16:22:58.
errorcode.h File 4956 bytes February 08 2022 16:22:58.
fieldpos.h File 8899 bytes February 08 2022 16:22:59.
filteredbrk.h File 5501 bytes February 08 2022 16:22:58.
fmtable.h File 25007 bytes February 08 2022 16:22:59.
format.h File 12802 bytes February 08 2022 16:22:59.
formattedvalue.h File 10521 bytes February 08 2022 16:22:59.
fpositer.h File 3109 bytes February 08 2022 16:22:59.
gender.h File 3408 bytes February 08 2022 16:22:59.
gregocal.h File 32472 bytes February 08 2022 16:22:59.
icudataver.h File 1051 bytes February 08 2022 16:22:58.
icuplug.h File 12166 bytes February 08 2022 16:22:58.
idna.h File 13000 bytes February 08 2022 16:22:58.
listformatter.h File 9701 bytes February 08 2022 16:22:59.
localebuilder.h File 11540 bytes February 08 2022 16:22:58.
localematcher.h File 23043 bytes February 08 2022 16:22:58.
localpointer.h File 20159 bytes February 08 2022 16:22:58.
locdspnm.h File 7292 bytes February 08 2022 16:22:58.
locid.h File 48536 bytes February 08 2022 16:22:58.
measfmt.h File 11603 bytes February 08 2022 16:22:59.
measunit.h File 95554 bytes February 08 2022 16:22:59.
measure.h File 4423 bytes February 08 2022 16:22:59.
messagepattern.h File 34521 bytes February 08 2022 16:22:58.
msgfmt.h File 45168 bytes February 08 2022 16:22:59.
normalizer2.h File 34851 bytes February 08 2022 16:22:58.
normlzr.h File 31682 bytes February 08 2022 16:22:58.
nounit.h File 2754 bytes February 08 2022 16:22:59.
numberformatter.h File 88383 bytes February 08 2022 16:22:59.
numberrangeformatter.h File 30865 bytes February 08 2022 16:22:59.
numfmt.h File 51001 bytes February 08 2022 16:22:59.
numsys.h File 7364 bytes February 08 2022 16:22:59.
parseerr.h File 3155 bytes February 08 2022 16:22:58.
parsepos.h File 5692 bytes February 08 2022 16:22:58.
platform.h File 28752 bytes February 08 2022 16:22:58.
plurfmt.h File 25800 bytes February 08 2022 16:22:59.
plurrule.h File 18835 bytes February 08 2022 16:22:59.
ptypes.h File 3577 bytes February 08 2022 16:22:58.
putil.h File 6487 bytes February 08 2022 16:22:58.
rbbi.h File 27218 bytes February 08 2022 16:22:58.
rbnf.h File 49899 bytes February 08 2022 16:22:59.
rbtz.h File 15979 bytes February 08 2022 16:22:59.
regex.h File 86382 bytes February 08 2022 16:22:59.
region.h File 9404 bytes February 08 2022 16:22:59.
reldatefmt.h File 23159 bytes February 08 2022 16:22:59.
rep.h File 9599 bytes February 08 2022 16:22:58.
resbund.h File 18503 bytes February 08 2022 16:22:58.
schriter.h File 6475 bytes February 08 2022 16:22:58.
scientificnumberformatter.h File 6553 bytes February 08 2022 16:22:59.
search.h File 22757 bytes February 08 2022 16:22:59.
selfmt.h File 14643 bytes February 08 2022 16:22:59.
simpleformatter.h File 12888 bytes February 08 2022 16:22:58.
simpletz.h File 46527 bytes February 08 2022 16:22:59.
smpdtfmt.h File 72670 bytes February 08 2022 16:22:59.
sortkey.h File 11444 bytes February 08 2022 16:22:59.
std_string.h File 1076 bytes February 08 2022 16:22:58.
strenum.h File 10158 bytes February 08 2022 16:22:58.
stringoptions.h File 5926 bytes February 08 2022 16:22:58.
stringpiece.h File 7556 bytes February 08 2022 16:22:58.
stringtriebuilder.h File 15698 bytes February 08 2022 16:22:58.
stsearch.h File 21810 bytes February 08 2022 16:22:59.
symtable.h File 4374 bytes February 08 2022 16:22:58.
tblcoll.h File 37489 bytes February 08 2022 16:22:59.
timezone.h File 42005 bytes February 08 2022 16:22:59.
tmunit.h File 3461 bytes February 08 2022 16:22:59.
tmutamt.h File 5015 bytes February 08 2022 16:22:59.
tmutfmt.h File 8042 bytes February 08 2022 16:22:59.
translit.h File 67400 bytes February 08 2022 16:22:59.
tzfmt.h File 43916 bytes February 08 2022 16:22:59.
tznames.h File 17252 bytes February 08 2022 16:22:59.
tzrule.h File 36215 bytes February 08 2022 16:22:59.
tztrans.h File 6271 bytes February 08 2022 16:22:59.
ubidi.h File 91711 bytes February 08 2022 16:22:58.
ubiditransform.h File 12950 bytes February 08 2022 16:22:58.
ubrk.h File 24547 bytes February 08 2022 16:22:58.
ucal.h File 58265 bytes February 08 2022 16:22:59.
ucasemap.h File 15546 bytes February 08 2022 16:22:58.
ucat.h File 5484 bytes February 08 2022 16:22:58.
uchar.h File 143936 bytes February 08 2022 16:22:58.
ucharstrie.h File 23120 bytes February 08 2022 16:22:58.
ucharstriebuilder.h File 7378 bytes February 08 2022 16:22:58.
uchriter.h File 13521 bytes February 08 2022 16:22:58.
uclean.h File 11474 bytes February 08 2022 16:22:58.
ucnv.h File 85085 bytes February 08 2022 16:22:58.
ucnv_cb.h File 6748 bytes February 08 2022 16:22:58.
ucnv_err.h File 21492 bytes February 08 2022 16:22:58.
ucnvsel.h File 6283 bytes February 08 2022 16:22:58.
ucol.h File 62939 bytes February 08 2022 16:22:59.
ucoleitr.h File 9684 bytes February 08 2022 16:22:59.
uconfig.h File 12356 bytes February 08 2022 16:22:58.
ucpmap.h File 5663 bytes February 08 2022 16:22:58.
ucptrie.h File 23002 bytes February 08 2022 16:22:58.
ucsdet.h File 15018 bytes February 08 2022 16:22:59.
ucurr.h File 16507 bytes February 08 2022 16:22:58.
udat.h File 62342 bytes February 08 2022 16:22:59.
udata.h File 15930 bytes February 08 2022 16:22:58.
udateintervalformat.h File 10272 bytes February 08 2022 16:22:59.
udatpg.h File 26639 bytes February 08 2022 16:22:59.
udisplaycontext.h File 6029 bytes February 08 2022 16:22:58.
uenum.h File 7970 bytes February 08 2022 16:22:58.
ufieldpositer.h File 4461 bytes February 08 2022 16:22:59.
uformattable.h File 11198 bytes February 08 2022 16:22:59.
uformattedvalue.h File 12431 bytes February 08 2022 16:22:59.
ugender.h File 2052 bytes February 08 2022 16:22:59.
uidna.h File 34169 bytes February 08 2022 16:22:58.
uiter.h File 23319 bytes February 08 2022 16:22:58.
uldnames.h File 10702 bytes February 08 2022 16:22:58.
ulistformatter.h File 9047 bytes February 08 2022 16:22:59.
uloc.h File 53805 bytes February 08 2022 16:22:58.
ulocdata.h File 11533 bytes February 08 2022 16:22:59.
umachine.h File 14877 bytes February 08 2022 16:22:58.
umisc.h File 1365 bytes February 08 2022 16:22:58.
umsg.h File 24812 bytes February 08 2022 16:22:59.
umutablecptrie.h File 8435 bytes February 08 2022 16:22:58.
unifilt.h File 4055 bytes February 08 2022 16:22:58.
unifunct.h File 4141 bytes February 08 2022 16:22:58.
unimatch.h File 6244 bytes February 08 2022 16:22:58.
unirepl.h File 3464 bytes February 08 2022 16:22:59.
uniset.h File 66459 bytes February 08 2022 16:22:58.
unistr.h File 174523 bytes February 08 2022 16:22:58.
unorm.h File 21015 bytes February 08 2022 16:22:58.
unorm2.h File 25254 bytes February 08 2022 16:22:58.
unum.h File 54906 bytes February 08 2022 16:22:59.
unumberformatter.h File 25972 bytes February 08 2022 16:22:59.
unumsys.h File 7387 bytes February 08 2022 16:22:59.
uobject.h File 10936 bytes February 08 2022 16:22:58.
upluralrules.h File 8068 bytes February 08 2022 16:22:59.
uregex.h File 73784 bytes February 08 2022 16:22:59.
uregion.h File 10073 bytes February 08 2022 16:22:59.
ureldatefmt.h File 17670 bytes February 08 2022 16:22:59.
urename.h File 134109 bytes February 08 2022 16:22:58.
urep.h File 5507 bytes February 08 2022 16:22:58.
ures.h File 37415 bytes February 08 2022 16:22:58.
uscript.h File 27510 bytes February 08 2022 16:22:58.
usearch.h File 39039 bytes February 08 2022 16:22:59.
uset.h File 40958 bytes February 08 2022 16:22:58.
usetiter.h File 9781 bytes February 08 2022 16:22:58.
ushape.h File 18432 bytes February 08 2022 16:22:58.
uspoof.h File 67480 bytes February 08 2022 16:22:59.
usprep.h File 8331 bytes February 08 2022 16:22:58.
ustdio.h File 39469 bytes February 08 2022 16:22:59.
ustream.h File 1934 bytes February 08 2022 16:22:59.
ustring.h File 74211 bytes February 08 2022 16:22:58.
ustringtrie.h File 3224 bytes February 08 2022 16:22:58.
utext.h File 59527 bytes February 08 2022 16:22:58.
utf.h File 8046 bytes February 08 2022 16:22:58.
utf16.h File 23878 bytes February 08 2022 16:22:58.
utf32.h File 763 bytes February 08 2022 16:22:58.
utf8.h File 31700 bytes February 08 2022 16:22:58.
utf_old.h File 46929 bytes February 08 2022 16:22:58.
utmscale.h File 14113 bytes February 08 2022 16:22:59.
utrace.h File 16112 bytes February 08 2022 16:22:58.
utrans.h File 26130 bytes February 08 2022 16:22:59.
utypes.h File 31481 bytes February 08 2022 16:22:58.
uvernum.h File 6832 bytes February 08 2022 16:22:58.
uversion.h File 6145 bytes February 08 2022 16:22:58.
vtzone.h File 20784 bytes February 08 2022 16:22:59.

Reading File: //opt/alt/libicu65/usr//include//unicode/stsearch.h

// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
**********************************************************************
*   Copyright (C) 2001-2014 IBM and others. All rights reserved.
**********************************************************************
*   Date        Name        Description
*  03/22/2000   helena      Creation.
**********************************************************************
*/

#ifndef STSEARCH_H
#define STSEARCH_H

#include "unicode/utypes.h"

#if U_SHOW_CPLUSPLUS_API

/**
 * \file 
 * \brief C++ API: Service for searching text based on RuleBasedCollator.
 */
 
#if !UCONFIG_NO_COLLATION && !UCONFIG_NO_BREAK_ITERATION

#include "unicode/tblcoll.h"
#include "unicode/coleitr.h"
#include "unicode/search.h"

U_NAMESPACE_BEGIN

/** 
 *
 * <tt>StringSearch</tt> is a <tt>SearchIterator</tt> that provides
 * language-sensitive text searching based on the comparison rules defined
 * in a {@link RuleBasedCollator} object.
 * StringSearch ensures that language eccentricity can be
 * handled, e.g. for the German collator, characters &szlig; and SS will be matched
 * if case is chosen to be ignored.
 * See the <a href="http://source.icu-project.org/repos/icu/icuhtml/trunk/design/collation/ICU_collation_design.htm">
 * "ICU Collation Design Document"</a> for more information.
 * <p>
 * There are 2 match options for selection:<br>
 * Let S' be the sub-string of a text string S between the offsets start and
 * end [start, end].
 * <br>
 * A pattern string P matches a text string S at the offsets [start, end]
 * if
 * <pre> 
 * option 1. Some canonical equivalent of P matches some canonical equivalent
 *           of S'
 * option 2. P matches S' and if P starts or ends with a combining mark,
 *           there exists no non-ignorable combining mark before or after S?
 *           in S respectively.
 * </pre>
 * Option 2. will be the default.
 * <p>
 * This search has APIs similar to that of other text iteration mechanisms 
 * such as the break iterators in <tt>BreakIterator</tt>. Using these 
 * APIs, it is easy to scan through text looking for all occurrences of 
 * a given pattern. This search iterator allows changing of direction by 
 * calling a <tt>reset</tt> followed by a <tt>next</tt> or <tt>previous</tt>.
 * Though a direction change can occur without calling <tt>reset</tt> first,
 * this operation comes with some speed penalty.
 * Match results in the forward direction will match the result matches in
 * the backwards direction in the reverse order
 * <p>
 * <tt>SearchIterator</tt> provides APIs to specify the starting position
 * within the text string to be searched, e.g. <tt>setOffset</tt>,
 * <tt>preceding</tt> and <tt>following</tt>. Since the
 * starting position will be set as it is specified, please take note that
 * there are some danger points which the search may render incorrect
 * results:
 * <ul>
 * <li> The midst of a substring that requires normalization.
 * <li> If the following match is to be found, the position should not be the
 *      second character which requires to be swapped with the preceding
 *      character. Vice versa, if the preceding match is to be found,
 *      position to search from should not be the first character which
 *      requires to be swapped with the next character. E.g certain Thai and
 *      Lao characters require swapping.
 * <li> If a following pattern match is to be found, any position within a
 *      contracting sequence except the first will fail. Vice versa if a
 *      preceding pattern match is to be found, a invalid starting point
 *      would be any character within a contracting sequence except the last.
 * </ul>
 * <p>
 * A <tt>BreakIterator</tt> can be used if only matches at logical breaks are desired.
 * Using a <tt>BreakIterator</tt> will only give you results that exactly matches the
 * boundaries given by the breakiterator. For instance the pattern "e" will
 * not be found in the string "\u00e9" if a character break iterator is used.
 * <p>
 * Options are provided to handle overlapping matches.
 * E.g. In English, overlapping matches produces the result 0 and 2
 * for the pattern "abab" in the text "ababab", where else mutually
 * exclusive matches only produce the result of 0.
 * <p>
 * Though collator attributes will be taken into consideration while
 * performing matches, there are no APIs here for setting and getting the
 * attributes. These attributes can be set by getting the collator
 * from <tt>getCollator</tt> and using the APIs in <tt>coll.h</tt>.
 * Lastly to update <tt>StringSearch</tt> to the new collator attributes,
 * <tt>reset</tt> has to be called.
 * <p> 
 * Restriction: <br>
 * Currently there are no composite characters that consists of a
 * character with combining class > 0 before a character with combining
 * class == 0. However, if such a character exists in the future,
 * <tt>StringSearch</tt> does not guarantee the results for option 1.
 * <p>
 * Consult the <tt>SearchIterator</tt> documentation for information on
 * and examples of how to use instances of this class to implement text
 * searching.
 * <pre><code>
 * UnicodeString target("The quick brown fox jumps over the lazy dog.");
 * UnicodeString pattern("fox");
 *
 * UErrorCode      error = U_ZERO_ERROR;
 * StringSearch iter(pattern, target, Locale::getUS(), NULL, status);
 * for (int pos = iter.first(error);
 *      pos != USEARCH_DONE; 
 *      pos = iter.next(error))
 * {
 *     printf("Found match at %d pos, length is %d\n", pos, iter.getMatchedLength());
 * }
 * </code></pre>
 * <p>
 * Note, <tt>StringSearch</tt> is not to be subclassed.
 * </p>
 * @see SearchIterator
 * @see RuleBasedCollator
 * @since ICU 2.0
 */

class U_I18N_API StringSearch U_FINAL : public SearchIterator
{
public:

    // public constructors and destructors --------------------------------

    /**
     * Creating a <tt>StringSearch</tt> instance using the argument locale 
     * language rule set. A collator will be created in the process, which 
     * will be owned by this instance and will be deleted during 
     * destruction
     * @param pattern The text for which this object will search.
     * @param text    The text in which to search for the pattern.
     * @param locale  A locale which defines the language-sensitive 
     *                comparison rules used to determine whether text in the 
     *                pattern and target matches. 
     * @param breakiter A <tt>BreakIterator</tt> object used to constrain 
     *                the matches that are found. Matches whose start and end 
     *                indices in the target text are not boundaries as 
     *                determined by the <tt>BreakIterator</tt> are 
     *                ignored. If this behavior is not desired, 
     *                <tt>NULL</tt> can be passed in instead.
     * @param status  for errors if any. If pattern or text is NULL, or if
     *               either the length of pattern or text is 0 then an 
     *               U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    StringSearch(const UnicodeString &pattern, const UnicodeString &text,
                 const Locale        &locale,       
                       BreakIterator *breakiter,
                       UErrorCode    &status);

    /**
     * Creating a <tt>StringSearch</tt> instance using the argument collator 
     * language rule set. Note, user retains the ownership of this collator, 
     * it does not get destroyed during this instance's destruction.
     * @param pattern The text for which this object will search.
     * @param text    The text in which to search for the pattern.
     * @param coll    A <tt>RuleBasedCollator</tt> object which defines 
     *                the language-sensitive comparison rules used to 
     *                determine whether text in the pattern and target 
     *                matches. User is responsible for the clearing of this
     *                object.
     * @param breakiter A <tt>BreakIterator</tt> object used to constrain 
     *                the matches that are found. Matches whose start and end 
     *                indices in the target text are not boundaries as 
     *                determined by the <tt>BreakIterator</tt> are 
     *                ignored. If this behavior is not desired, 
     *                <tt>NULL</tt> can be passed in instead.
     * @param status for errors if any. If either the length of pattern or 
     *               text is 0 then an U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    StringSearch(const UnicodeString     &pattern, 
                 const UnicodeString     &text,
                       RuleBasedCollator *coll,       
                       BreakIterator     *breakiter,
                       UErrorCode        &status);

    /**
     * Creating a <tt>StringSearch</tt> instance using the argument locale 
     * language rule set. A collator will be created in the process, which 
     * will be owned by this instance and will be deleted during 
     * destruction
     * <p>
     * Note: No parsing of the text within the <tt>CharacterIterator</tt> 
     * will be done during searching for this version. The block of text 
     * in <tt>CharacterIterator</tt> will be used as it is.
     * @param pattern The text for which this object will search.
     * @param text    The text iterator in which to search for the pattern.
     * @param locale  A locale which defines the language-sensitive 
     *                comparison rules used to determine whether text in the 
     *                pattern and target matches. User is responsible for 
     *                the clearing of this object.
     * @param breakiter A <tt>BreakIterator</tt> object used to constrain 
     *                the matches that are found. Matches whose start and end 
     *                indices in the target text are not boundaries as 
     *                determined by the <tt>BreakIterator</tt> are 
     *                ignored. If this behavior is not desired, 
     *                <tt>NULL</tt> can be passed in instead.
     * @param status for errors if any. If either the length of pattern or 
     *               text is 0 then an U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    StringSearch(const UnicodeString &pattern, CharacterIterator &text,
                 const Locale        &locale, 
                       BreakIterator *breakiter,
                       UErrorCode    &status);

    /**
     * Creating a <tt>StringSearch</tt> instance using the argument collator 
     * language rule set. Note, user retains the ownership of this collator, 
     * it does not get destroyed during this instance's destruction.
     * <p>
     * Note: No parsing of the text within the <tt>CharacterIterator</tt> 
     * will be done during searching for this version. The block of text 
     * in <tt>CharacterIterator</tt> will be used as it is.
     * @param pattern The text for which this object will search.
     * @param text    The text in which to search for the pattern.
     * @param coll    A <tt>RuleBasedCollator</tt> object which defines 
     *                the language-sensitive comparison rules used to 
     *                determine whether text in the pattern and target 
     *                matches. User is responsible for the clearing of this
     *                object.
     * @param breakiter A <tt>BreakIterator</tt> object used to constrain 
     *                the matches that are found. Matches whose start and end 
     *                indices in the target text are not boundaries as 
     *                determined by the <tt>BreakIterator</tt> are 
     *                ignored. If this behavior is not desired, 
     *                <tt>NULL</tt> can be passed in instead.
     * @param status for errors if any. If either the length of pattern or 
     *               text is 0 then an U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    StringSearch(const UnicodeString     &pattern, CharacterIterator &text,
                       RuleBasedCollator *coll, 
                       BreakIterator     *breakiter,
                       UErrorCode        &status);

    /**
     * Copy constructor that creates a StringSearch instance with the same 
     * behavior, and iterating over the same text.
     * @param that StringSearch instance to be copied.
     * @stable ICU 2.0
     */
    StringSearch(const StringSearch &that);

    /**
    * Destructor. Cleans up the search iterator data struct.
    * If a collator is created in the constructor, it will be destroyed here.
    * @stable ICU 2.0
    */
    virtual ~StringSearch(void);

    /**
     * Clone this object.
     * Clones can be used concurrently in multiple threads.
     * If an error occurs, then NULL is returned.
     * The caller must delete the clone.
     *
     * @return a clone of this object
     *
     * @see getDynamicClassID
     * @stable ICU 2.8
     */
    StringSearch *clone() const;

    // operator overloading ---------------------------------------------

    /**
     * Assignment operator. Sets this iterator to have the same behavior,
     * and iterate over the same text, as the one passed in.
     * @param that instance to be copied.
     * @stable ICU 2.0
     */
    StringSearch & operator=(const StringSearch &that);

    /**
     * Equality operator. 
     * @param that instance to be compared.
     * @return TRUE if both instances have the same attributes, 
     *         breakiterators, collators and iterate over the same text 
     *         while looking for the same pattern.
     * @stable ICU 2.0
     */
    virtual UBool operator==(const SearchIterator &that) const;

    // public get and set methods ----------------------------------------

    /**
     * Sets the index to point to the given position, and clears any state 
     * that's affected.
     * <p>
     * This method takes the argument index and sets the position in the text 
     * string accordingly without checking if the index is pointing to a 
     * valid starting point to begin searching. 
     * @param position within the text to be set. If position is less
     *          than or greater than the text range for searching, 
     *          an U_INDEX_OUTOFBOUNDS_ERROR will be returned
     * @param status for errors if it occurs
     * @stable ICU 2.0
     */
    virtual void setOffset(int32_t position, UErrorCode &status);

    /**
     * Return the current index in the text being searched.
     * If the iteration has gone past the end of the text
     * (or past the beginning for a backwards search), USEARCH_DONE
     * is returned.
     * @return current index in the text being searched.
     * @stable ICU 2.0
     */
    virtual int32_t getOffset(void) const;

    /**
     * Set the target text to be searched.
     * Text iteration will hence begin at the start of the text string. 
     * This method is 
     * useful if you want to re-use an iterator to search for the same 
     * pattern within a different body of text.
     * @param text text string to be searched
     * @param status for errors if any. If the text length is 0 then an 
     *        U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    virtual void setText(const UnicodeString &text, UErrorCode &status);
    
    /**
     * Set the target text to be searched.
     * Text iteration will hence begin at the start of the text string. 
     * This method is 
     * useful if you want to re-use an iterator to search for the same 
     * pattern within a different body of text.
     * Note: No parsing of the text within the <tt>CharacterIterator</tt> 
     * will be done during searching for this version. The block of text 
     * in <tt>CharacterIterator</tt> will be used as it is.
     * @param text text string to be searched
     * @param status for errors if any. If the text length is 0 then an 
     *        U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    virtual void setText(CharacterIterator &text, UErrorCode &status);

    /**
     * Gets the collator used for the language rules.
     * <p>
     * Caller may modify but <b>must not</b> delete the <tt>RuleBasedCollator</tt>!
     * Modifications to this collator will affect the original collator passed in to 
     * the <tt>StringSearch></tt> constructor or to setCollator, if any.
     * @return collator used for string search
     * @stable ICU 2.0
     */
    RuleBasedCollator * getCollator() const;
    
    /**
     * Sets the collator used for the language rules. User retains the 
     * ownership of this collator, thus the responsibility of deletion lies 
     * with the user. The iterator's position will not be changed by this method.
     * @param coll    collator 
     * @param status  for errors if any
     * @stable ICU 2.0
     */
    void setCollator(RuleBasedCollator *coll, UErrorCode &status);
    
    /**
     * Sets the pattern used for matching.
     * The iterator's position will not be changed by this method.
     * @param pattern search pattern to be found
     * @param status for errors if any. If the pattern length is 0 then an 
     *               U_ILLEGAL_ARGUMENT_ERROR is returned.
     * @stable ICU 2.0
     */
    void setPattern(const UnicodeString &pattern, UErrorCode &status);
    
    /**
     * Gets the search pattern.
     * @return pattern used for matching
     * @stable ICU 2.0
     */
    const UnicodeString & getPattern() const;

    // public methods ----------------------------------------------------

    /** 
     * Reset the iteration.
     * Search will begin at the start of the text string if a forward 
     * iteration is initiated before a backwards iteration. Otherwise if 
     * a backwards iteration is initiated before a forwards iteration, the 
     * search will begin at the end of the text string.
     * @stable ICU 2.0
     */
    virtual void reset();

    /**
     * Returns a copy of StringSearch with the same behavior, and 
     * iterating over the same text, as this one. Note that all data will be
     * replicated, except for the user-specified collator and the
     * breakiterator.
     * @return cloned object
     * @stable ICU 2.0
     */
    virtual StringSearch * safeClone() const;
    
    /**
     * ICU "poor man's RTTI", returns a UClassID for the actual class.
     *
     * @stable ICU 2.2
     */
    virtual UClassID getDynamicClassID() const;

    /**
     * ICU "poor man's RTTI", returns a UClassID for this class.
     *
     * @stable ICU 2.2
     */
    static UClassID U_EXPORT2 getStaticClassID();

protected:

    // protected method -------------------------------------------------

    /**
     * Search forward for matching text, starting at a given location.
     * Clients should not call this method directly; instead they should 
     * call {@link SearchIterator#next }.
     * <p>
     * If a match is found, this method returns the index at which the match
     * starts and calls {@link SearchIterator#setMatchLength } with the number 
     * of characters in the target text that make up the match. If no match 
     * is found, the method returns <tt>USEARCH_DONE</tt>.
     * <p>
     * The <tt>StringSearch</tt> is adjusted so that its current index 
     * (as returned by {@link #getOffset }) is the match position if one was 
     * found.
     * If a match is not found, <tt>USEARCH_DONE</tt> will be returned and
     * the <tt>StringSearch</tt> will be adjusted to the index USEARCH_DONE.
     * @param position The index in the target text at which the search 
     *                 starts
     * @param status for errors if any occurs
     * @return The index at which the matched text in the target starts, or 
     *         USEARCH_DONE if no match was found.
     * @stable ICU 2.0
     */
    virtual int32_t handleNext(int32_t position, UErrorCode &status);

    /**
     * Search backward for matching text, starting at a given location.
     * Clients should not call this method directly; instead they should call
     * <tt>SearchIterator.previous()</tt>, which this method overrides.
     * <p>
     * If a match is found, this method returns the index at which the match
     * starts and calls {@link SearchIterator#setMatchLength } with the number 
     * of characters in the target text that make up the match. If no match 
     * is found, the method returns <tt>USEARCH_DONE</tt>.
     * <p>
     * The <tt>StringSearch</tt> is adjusted so that its current index 
     * (as returned by {@link #getOffset }) is the match position if one was 
     * found.
     * If a match is not found, <tt>USEARCH_DONE</tt> will be returned and
     * the <tt>StringSearch</tt> will be adjusted to the index USEARCH_DONE.
     * @param position The index in the target text at which the search 
     *                 starts.
     * @param status for errors if any occurs
     * @return The index at which the matched text in the target starts, or 
     *         USEARCH_DONE if no match was found.
     * @stable ICU 2.0
     */
    virtual int32_t handlePrev(int32_t position, UErrorCode &status);
    
private :
    StringSearch(); // default constructor not implemented

    // private data members ----------------------------------------------

    /**
    * Pattern text
    * @stable ICU 2.0
    */
    UnicodeString      m_pattern_;
    /**
    * String search struct data
    * @stable ICU 2.0
    */
    UStringSearch     *m_strsrch_;

};

U_NAMESPACE_END

#endif /* #if !UCONFIG_NO_COLLATION */

#endif /* U_SHOW_CPLUSPLUS_API */

#endif


SILENT KILLER Tool