Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
alphaindex.h	25.29 KB	-rw-r--r--
appendable.h	8.38 KB	-rw-r--r--
basictz.h	8.77 KB	-rw-r--r--
bms.h	8.68 KB	-rw-r--r--
bmsearch.h	7.33 KB	-rw-r--r--
brkiter.h	24.24 KB	-rw-r--r--
bytestream.h	9.16 KB	-rw-r--r--
bytestrie.h	19.19 KB	-rw-r--r--
bytestriebuilder.h	6.73 KB	-rw-r--r--
calendar.h	102.76 KB	-rw-r--r--
caniter.h	7.23 KB	-rw-r--r--
chariter.h	23.71 KB	-rw-r--r--
choicfmt.h	27.82 KB	-rw-r--r--
coleitr.h	12.69 KB	-rw-r--r--
coll.h	53.44 KB	-rw-r--r--
colldata.h	12.42 KB	-rw-r--r--
curramt.h	3.57 KB	-rw-r--r--
currpinf.h	6.93 KB	-rw-r--r--
currunit.h	2.99 KB	-rw-r--r--
datefmt.h	33.67 KB	-rw-r--r--
dbbi.h	966 B	-rw-r--r--
dcfmtsym.h	14.91 KB	-rw-r--r--
decimfmt.h	97.38 KB	-rw-r--r--
docmain.h	6.28 KB	-rw-r--r--
dtfmtsym.h	30.27 KB	-rw-r--r--
dtintrv.h	3.65 KB	-rw-r--r--
dtitvfmt.h	39.24 KB	-rw-r--r--
dtitvinf.h	18.56 KB	-rw-r--r--
dtptngen.h	19.54 KB	-rw-r--r--
dtrule.h	8.51 KB	-rw-r--r--
enumset.h	1.8 KB	-rw-r--r--
errorcode.h	4.67 KB	-rw-r--r--
fieldpos.h	8.51 KB	-rw-r--r--
fmtable.h	22.09 KB	-rw-r--r--
format.h	12.33 KB	-rw-r--r--
fpositer.h	2.97 KB	-rw-r--r--
gender.h	3.02 KB	-rw-r--r--
gregocal.h	33.28 KB	-rw-r--r--
icudataver.h	990 B	-rw-r--r--
icuplug.h	11.49 KB	-rw-r--r--
idna.h	12.68 KB	-rw-r--r--
listformatter.h	3.97 KB	-rw-r--r--
localpointer.h	9.13 KB	-rw-r--r--
locdspnm.h	7.14 KB	-rw-r--r--
locid.h	30.48 KB	-rw-r--r--
measfmt.h	1.94 KB	-rw-r--r--
measunit.h	1.6 KB	-rw-r--r--
measure.h	3.24 KB	-rw-r--r--
messagepattern.h	33.6 KB	-rw-r--r--
msgfmt.h	43.59 KB	-rw-r--r--
normalizer2.h	28.34 KB	-rw-r--r--
normlzr.h	29.26 KB	-rw-r--r--
numfmt.h	43.59 KB	-rw-r--r--
numsys.h	5.37 KB	-rw-r--r--
parseerr.h	2.97 KB	-rw-r--r--
parsepos.h	5.34 KB	-rw-r--r--
platform.h	24.23 KB	-rw-r--r--
plurfmt.h	24.58 KB	-rw-r--r--
plurrule.h	14.56 KB	-rw-r--r--
ptypes.h	3.36 KB	-rw-r--r--
putil.h	5.61 KB	-rw-r--r--
rbbi.h	29.15 KB	-rw-r--r--
rbnf.h	45.32 KB	-rw-r--r--
rbtz.h	15.33 KB	-rw-r--r--
regex.h	83.1 KB	-rw-r--r--
rep.h	9.33 KB	-rw-r--r--
resbund.h	17.89 KB	-rw-r--r--
schriter.h	6.15 KB	-rw-r--r--
search.h	22.1 KB	-rw-r--r--
selfmt.h	14.13 KB	-rw-r--r--
simpletz.h	45.1 KB	-rw-r--r--
smpdtfmt.h	57.58 KB	-rw-r--r--
sortkey.h	10.98 KB	-rw-r--r--
std_string.h	783 B	-rw-r--r--
strenum.h	9.92 KB	-rw-r--r--
stringpiece.h	6.38 KB	-rw-r--r--
stringtriebuilder.h	14.75 KB	-rw-r--r--
stsearch.h	21.76 KB	-rw-r--r--
symtable.h	4.1 KB	-rw-r--r--
tblcoll.h	34.23 KB	-rw-r--r--
timezone.h	37.28 KB	-rw-r--r--
tmunit.h	3.39 KB	-rw-r--r--
tmutamt.h	4.69 KB	-rw-r--r--
tmutfmt.h	8.51 KB	-rw-r--r--
translit.h	53.76 KB	-rw-r--r--
tzfmt.h	32.06 KB	-rw-r--r--
tznames.h	14.83 KB	-rw-r--r--
tzrule.h	35.21 KB	-rw-r--r--
tztrans.h	5.96 KB	-rw-r--r--
ubidi.h	88.57 KB	-rw-r--r--
ubrk.h	19.13 KB	-rw-r--r--
ucal.h	50.49 KB	-rw-r--r--
ucasemap.h	16.45 KB	-rw-r--r--
ucat.h	5.25 KB	-rw-r--r--
uchar.h	115.43 KB	-rw-r--r--
ucharstrie.h	20.8 KB	-rw-r--r--
ucharstriebuilder.h	6.83 KB	-rw-r--r--
uchriter.h	12.82 KB	-rw-r--r--
uclean.h	10.38 KB	-rw-r--r--
ucnv.h	82.6 KB	-rw-r--r--
ucnv_cb.h	6.48 KB	-rw-r--r--
ucnv_err.h	20.87 KB	-rw-r--r--
ucnvsel.h	6.03 KB	-rw-r--r--
ucol.h	57.93 KB	-rw-r--r--
ucoleitr.h	12.25 KB	-rw-r--r--
uconfig.h	10.79 KB	-rw-r--r--
ucsdet.h	12.6 KB	-rw-r--r--
ucurr.h	12.96 KB	-rw-r--r--
udat.h	46.47 KB	-rw-r--r--
udata.h	14.81 KB	-rw-r--r--
udateintervalformat.h	6.5 KB	-rw-r--r--
udatpg.h	23.24 KB	-rw-r--r--
udisplaycontext.h	4.34 KB	-rw-r--r--
uenum.h	7.79 KB	-rw-r--r--
ugender.h	1.85 KB	-rw-r--r--
uidna.h	32.81 KB	-rw-r--r--
uiter.h	22.67 KB	-rw-r--r--
uldnames.h	10.5 KB	-rw-r--r--
uloc.h	44.07 KB	-rw-r--r--
ulocdata.h	10.37 KB	-rw-r--r--
umachine.h	10.23 KB	-rw-r--r--
umisc.h	1.23 KB	-rw-r--r--
umsg.h	24.12 KB	-rw-r--r--
unifilt.h	3.52 KB	-rw-r--r--
unifunct.h	3.87 KB	-rw-r--r--
unimatch.h	5.93 KB	-rw-r--r--
unirepl.h	3.21 KB	-rw-r--r--
uniset.h	63.07 KB	-rw-r--r--
unistr.h	164.33 KB	-rw-r--r--
unorm.h	22.89 KB	-rw-r--r--
unorm2.h	21.91 KB	-rw-r--r--
unum.h	39.21 KB	-rw-r--r--
uobject.h	12.21 KB	-rw-r--r--
upluralrules.h	4.47 KB	-rw-r--r--
uregex.h	71.47 KB	-rw-r--r--
urename.h	120.88 KB	-rw-r--r--
urep.h	5.27 KB	-rw-r--r--
ures.h	35.92 KB	-rw-r--r--
uscript.h	20.46 KB	-rw-r--r--
usearch.h	36.09 KB	-rw-r--r--
uset.h	39.45 KB	-rw-r--r--
usetiter.h	9.38 KB	-rw-r--r--
ushape.h	17.89 KB	-rw-r--r--
uspoof.h	38.91 KB	-rw-r--r--
usprep.h	8.02 KB	-rw-r--r--
ustdio.h	37.05 KB	-rw-r--r--
ustream.h	1.6 KB	-rw-r--r--
ustring.h	73.01 KB	-rw-r--r--
ustringtrie.h	3.04 KB	-rw-r--r--
utext.h	57.97 KB	-rw-r--r--
utf.h	7.64 KB	-rw-r--r--
utf16.h	18.24 KB	-rw-r--r--
utf32.h	653 B	-rw-r--r--
utf8.h	23.02 KB	-rw-r--r--
utf_old.h	42.5 KB	-rw-r--r--
utmscale.h	13.37 KB	-rw-r--r--
utrace.h	13.09 KB	-rw-r--r--
utrans.h	23.08 KB	-rw-r--r--
utypes.h	30.72 KB	-rw-r--r--
uvernum.h	5.53 KB	-rw-r--r--
uversion.h	6.29 KB	-rw-r--r--
vtzone.h	20.09 KB	-rw-r--r--

Code Editor : bmsearch.h

/*
 ******************************************************************************
 *   Copyright (C) 1996-2011, International Business Machines                 *
 *   Corporation and others.  All Rights Reserved.                            *
 ******************************************************************************
 */

/**
 * \file 
 * \brief C++ API: Boyer-Moore StringSearch technology preview
 * \internal ICU 4.0.1 technology preview
 */
 
#ifndef B_M_SEARCH_H
#define B_M_SEARCH_H

#include "unicode/utypes.h"

#if !UCONFIG_NO_COLLATION && !UCONFIG_NO_BREAK_ITERATION

#include "unicode/uobject.h"
#include "unicode/ucol.h"

#include "unicode/colldata.h"

U_NAMESPACE_BEGIN

class BadCharacterTable;
class GoodSuffixTable;
class Target;

#ifndef U_HIDE_INTERNAL_API
/**
 * BoyerMooreSearch
 *
 * This object holds the information needed to do a Collation sensitive Boyer-Moore search. It encapulates
 * the pattern, the "bad character" and "good suffix" tables, the Collator-based data needed to compute them,
 * and a reference to the text being searched.
 *
 * To do a search, you fist need to get a <code>CollData</code> object by calling <code>CollData::open</code>.
 * Then you construct a <code>BoyerMooreSearch</code> object from the <code>CollData</code> object, the pattern
 * string and the target string. Then you call the <code>search</code> method. Here's a code sample:
 *
 * <pre>
 * void boyerMooreExample(UCollator *collator, UnicodeString *pattern, UnicodeString *target)
 * {
 *     UErrorCode status = U_ZERO_ERROR;
 *     CollData *collData = CollData::open(collator, status);
 *
 *     if (U_FAILURE(status)) {
 *         // could not create a CollData object
 *         return;
 *     }
 *
 *     BoyerMooreSearch *search = new BoyerMooreSearch(collData, *patternString, target, status);
 *
 *     if (U_FAILURE(status)) {
 *         // could not create a BoyerMooreSearch object
 *         CollData::close(collData);
 *         return;
 *     }
 *
 *     int32_t offset = 0, start = -1, end = -1;
 *
 *     // Find all matches
 *     while (search->search(offset, start, end)) {
 *         // process the match between start and end
 *         ...
 *         // advance past the match
 *         offset = end; 
 *     }
 *
 *     // at this point, if offset == 0, there were no matches
 *     if (offset == 0) {
 *         // handle the case of no matches
 *     }
 *
 *     delete search;
 *     CollData::close(collData);
 *
 *     // CollData objects are cached, so the call to
 *     // CollData::close doesn't delete the object.
 *     // Call this if you don't need the object any more.
 *     CollData::flushCollDataCache();
 * }
 * </pre>
 *
 * NOTE: This is a technology preview. The final version of this API may not bear any resenblence to this API.
 *
 * Knows linitations:
 *   1) Backwards searching has not been implemented.
 *
 *   2) For Han and Hangul characters, this code ignores any Collation tailorings. In general,
 *      this isn't a problem, but in Korean locals, at strength 1, Hangul characters are tailored
 *      to be equal to Han characters with the same pronounciation. Because this code ignroes
 *      tailorings, searching for a Hangul character will not find a Han character and visa-versa.
 *
 *   3) In some cases, searching for a pattern that needs to be normalized and ends
 *      in a discontiguous contraction may fail. The only known cases of this are with
 *      the Tibetan script. For example searching for the pattern
 *      "\u0F7F\u0F80\u0F81\u0F82\u0F83\u0F84\u0F85" will fail. (This case is artificial. We've
 *      been unable to find a pratical, real-world example of this failure.)  
 *
 * @internal ICU 4.0.1 technology preview
 *
 * @see CollData
 */
class U_I18N_API BoyerMooreSearch : public UObject
{
public:
    /**
     * Construct a <code>BoyerMooreSearch</code> object.
     *
     * @param theData - A <code>CollData</code> object holding the Collator-sensitive data
     * @param patternString - the string for which to search
     * @param targetString - the string in which to search or <code>NULL</code> if youu will
     *                       set it later by calling <code>setTargetString</code>.
     * @param status - will be set if any errors occur. 
     *
     * Note: if on return, status is set to an error code,
     * the only safe thing to do with this object is to call
     * the destructor.
     *
     * @internal ICU 4.0.1 technology preview
     */
    BoyerMooreSearch(CollData *theData, const UnicodeString &patternString, const UnicodeString *targetString, UErrorCode &status);

/**
     * The desstructor
     *
     * @internal ICU 4.0.1 technology preview
     */
    ~BoyerMooreSearch();

/**
     * Test the pattern to see if it generates any CEs.
     *
     * @return <code>TRUE</code> if the pattern string did not generate any CEs
     *
     * @internal ICU 4.0.1 technology preview
     */
    UBool empty();

/**
     * Search for the pattern string in the target string.
     *
     * @param offset - the offset in the target string at which to begin the search
     * @param start - will be set to the starting offset of the match, or -1 if there's no match
     * @param end - will be set to the ending offset of the match, or -1 if there's no match
     *
     * @return <code>TRUE</code> if the match succeeds, <code>FALSE</code> otherwise.
     *
     * @internal ICU 4.0.1 technology preview
     */
    UBool search(int32_t offset, int32_t &start, int32_t &end);

/**
     * Set the target string for the match.
     *
     * @param targetString - the new target string
     * @param status - will be set if any errors occur. 
     *
     * @internal ICU 4.0.1 technology preview
     */
    void setTargetString(const UnicodeString *targetString, UErrorCode &status);

// **** no longer need these? ****
    /**
     * Return the <code>CollData</code> object used for searching
     *
     * @return the <code>CollData</code> object used for searching
     *
     * @internal ICU 4.0.1 technology preview
     */
    CollData *getData();

/**
     * Return the CEs generated by the pattern string.
     *
     * @return a <code>CEList</code> object holding the CEs generated by the pattern string.
     *
     * @internal ICU 4.0.1 technology preview
     */
    CEList   *getPatternCEs();

/**
     * Return the <code>BadCharacterTable</code> object computed for the pattern string.
     *
     * @return the <code>BadCharacterTable</code> object.
     *
     * @internal ICU 4.0.1 technology preview
     */
    BadCharacterTable *getBadCharacterTable();

/**
     * Return the <code>GoodSuffixTable</code> object computed for the pattern string.
     *
     * @return the <code>GoodSuffixTable</code> object computed for the pattern string.
     *
     * @internal ICU 4.0.1 technology preview
     */
    GoodSuffixTable   *getGoodSuffixTable();

/**
     * UObject glue...
     * @internal ICU 4.0.1 technology preview
     */
    virtual UClassID getDynamicClassID() const;
    /**
     * UObject glue...
     * @internal ICU 4.0.1 technology preview
     */
    static UClassID getStaticClassID();
    
private:
    CollData *data;
    CEList *patCEs;
    BadCharacterTable *badCharacterTable;
    GoodSuffixTable   *goodSuffixTable;
    UnicodeString pattern;
    Target *target;
};
#endif  /* U_HIDE_INTERNAL_API */

U_NAMESPACE_END

#endif // #if !UCONFIG_NO_COLLATION
#endif // #ifndef B_M_SEARCH_H

${this.title}

Code Editor : bmsearch.h