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 : bms.h

/*
 * Copyright (C) 1996-2012, International Business Machines Corporation and Others.
 * All rights reserved.
 */

/**
 * \file 
 * \brief C API: Boyer-Moore StringSearch prototype.
 * \internal
 */

#ifndef _BMS_H
#define _BMS_H

#include "unicode/utypes.h"

#if !UCONFIG_NO_COLLATION && !UCONFIG_NO_BREAK_ITERATION

#include "unicode/ucol.h"

#ifndef U_HIDE_INTERNAL_API

/**
 * A <code>UCD</code> object holds the Collator-specific data needed to
 * compute the length of the shortest string that can
 * generate a partcular list of CEs.
 *
 * <code>UCD</code> objects are quite expensive to compute. Because
 * of this, they are cached. When you call <code>ucd_open</code> it
 * returns a reference counted cached object. When you call <code>ucd_close</code>
 * the reference count on the object is decremented but the object is not deleted.
 *
 * If you do not need to reuse any unreferenced objects in the cache, you can call
 * <code>ucd_flushCCache</code>. If you no longer need any <code>UCD</code>
 * objects, you can call <code>ucd_freeCache</code>
 *
 * @internal ICU 4.0.1 technology preview
 */
typedef void UCD;

/**
 * Open a <code>UCD</code> object.
 *
 * @param coll - the collator
 * @param status - will be set if any errors occur. 
 *
 * @return the <code>UCD</code> object. You must call
 *         <code>ucd_close</code> when you are done using the object.
 *
 * Note: if on return status is set to an error, the only safe
 * thing to do with the returned object is to call <code>ucd_close</code>.
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL UCD * U_EXPORT2
ucd_open(UCollator *coll, UErrorCode *status);

/**
 * Release a <code>UCD</code> object.
 *
 * @param ucd - the object
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL void U_EXPORT2
ucd_close(UCD *ucd);

/**
 * Get the <code>UCollator</code> object used to create a <code>UCD</code> object.
 * The <code>UCollator</code> object returned may not be the exact
 * object that was used to create this object, but it will have the
 * same behavior.
 *
 * @param ucd - the <code>UCD</code> object
 *
 * @return the <code>UCollator</code> used to create the given
 *         <code>UCD</code> object.
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL UCollator * U_EXPORT2
ucd_getCollator(UCD *ucd);

/**
 * <code>UCD</code> objects are expensive to compute, and so
 * may be cached. This routine will free the cached objects and delete
 * the cache.
 *
 * WARNING: Don't call this until you are have called <code>close</code>
 * for each <code>UCD</code> object that you have used. also,
 * DO NOT call this if another thread may be calling <code>ucd_flushCache</code>
 * at the same time.
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL void U_EXPORT2
ucd_freeCache();

/**
 * <code>UCD</code> objects are expensive to compute, and so
 * may be cached. This routine will remove any unused <code>UCD</code>
 * objects from the cache.
 *
 * @internal 4.0.1 technology preview
 */
U_INTERNAL void U_EXPORT2
ucd_flushCache();

/**
 * BMS
 *
 * 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 first need to get a <code>UCD</code> object by calling <code>ucd_open</code>.
 * Then you construct a <code>BMS</code> object from the <code>UCD</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, UChar *pattern, int32_t patternLen, UChar *target, int32_t targetLength)
 * {
 *     UErrorCode status = U_ZERO_ERROR;
 *     int32_t offset = 0, start = -1, end = -1;
 *     UCD *ucd = NULL);
 *     BMS *bms = NULL;
 *
 *     ucd = ucd_open(collator, &status);
 *     if (U_FAILURE(status)) {
 *         // could not create a UCD object
 *         return;
 *     }
 *
 *     BMS *bms = bms_open(ucd, pattern, patternLength, target, targetlength, &status);
 *     if (U_FAILURE(status)) {
 *         // could not create a BMS object
 *         ucd_close(ucd);
 *         return;
 *     }
 *
 *
 *     // Find all matches
 *     while (bms_search(bms, 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
 *     }
 *
 *     bms_close(bms);
 *     ucd_close(ucd);
 *
 *     // UCD objects are cached, so the call to
 *     // ucd_close doesn't delete the object.
 *     // Call this if you don't need the object any more.
 *     ucd_flushCache();
 * }
 * </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.)  
 *
 * NOTE: This is a technology preview. The final version of this API may not bear any resenblence to this API.
 *
 * @internal ICU 4.0.1 technology preview
 */
struct BMS;
typedef struct BMS BMS; /**< @see BMS */

/**
 * Construct a <code>MBS</code> object.
 *
 * @param ucd - A <code>UCD</code> object holding the Collator-sensitive data
 * @param pattern - the string for which to search
 * @param patternLength - the length of the string for which to search
 * @param target - the string in which to search
 * @param targetLength - the length of the string in which to search
 * @param status - will be set if any errors occur. 
 *
 * @return the <code>BMS</code> object.
 *
 * Note: if on return status is set to an error, the only safe
 * thing to do with the returned object is to call
 * <code>bms_close</code>.
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL BMS * U_EXPORT2
bms_open(UCD *ucd,
         const UChar *pattern, int32_t patternLength,
         const UChar *target,  int32_t targetLength,
         UErrorCode  *status);

/**
 * Close a <code>BMS</code> object and release all the
 * storage associated with it.
 *
 * @param bms - the <code>BMS</code> object to close.
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL void U_EXPORT2
bms_close(BMS *bms);

/**
 * Test the pattern to see if it generates any CEs.
 *
 * @param bms - the <code>BMS</code> object
 * @return <code>TRUE</code> if the pattern string did not generate any CEs
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL UBool U_EXPORT2
bms_empty(BMS *bms);

/**
 * Get the <code>UCD</code> object used to create
 * a given <code>BMS</code> object.
 *
 * @param bms - the <code>BMS</code> object
 *
 * @return - the <code>UCD</code> object used to create
 *           the given <code>BMS</code> object.
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL UCD * U_EXPORT2
bms_getData(BMS *bms);

/**
 * Search for the pattern string in the target string.
 *
 * @param bms - the <code>BMS</code> object
 * @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
 */
U_INTERNAL UBool U_EXPORT2
bms_search(BMS *bms, int32_t offset, int32_t *start, int32_t *end);

/**
 * Set the target string for the match.
 *
 * @param bms - the <code>BMS</code> object
 * @param target - the new target string
 * @param targetLength - the length of the new target string
 * @param status - will be set if any errors occur. 
 *
 * @internal ICU 4.0.1 technology preview
 */
U_INTERNAL void U_EXPORT2
bms_setTargetString(BMS *bms, const UChar *target, int32_t targetLength, UErrorCode *status);

#endif  /* U_HIDE_INTERNAL_API */

#endif

#endif /* _BMS_H */

${this.title}

Code Editor : bms.h