2000-01-10 21:10:21 +00:00
|
|
|
/*
|
2002-06-27 21:14:47 +00:00
|
|
|
***************************************************************************
|
2011-04-29 17:49:01 +00:00
|
|
|
* Copyright (C) 1999-2011 International Business Machines Corporation *
|
2002-06-27 21:14:47 +00:00
|
|
|
* and others. All rights reserved. *
|
|
|
|
***************************************************************************
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
**********************************************************************
|
|
|
|
* Date Name Description
|
|
|
|
* 10/22/99 alan Creation.
|
|
|
|
* 11/11/99 rgillam Complete port from Java.
|
|
|
|
**********************************************************************
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef RBBI_H
|
|
|
|
#define RBBI_H
|
|
|
|
|
2000-01-11 00:46:58 +00:00
|
|
|
#include "unicode/utypes.h"
|
2002-10-01 01:26:49 +00:00
|
|
|
|
2005-06-22 22:39:36 +00:00
|
|
|
/**
|
2005-06-23 05:51:28 +00:00
|
|
|
* \file
|
2005-06-22 22:39:36 +00:00
|
|
|
* \brief C++ API: Rule Based Break Iterator
|
|
|
|
*/
|
2005-06-23 05:51:28 +00:00
|
|
|
|
2002-10-01 01:26:49 +00:00
|
|
|
#if !UCONFIG_NO_BREAK_ITERATION
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
#include "unicode/brkiter.h"
|
2000-07-12 05:01:53 +00:00
|
|
|
#include "unicode/udata.h"
|
2002-06-25 17:23:07 +00:00
|
|
|
#include "unicode/parseerr.h"
|
2006-05-08 16:08:53 +00:00
|
|
|
#include "unicode/schriter.h"
|
|
|
|
#include "unicode/uchriter.h"
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2005-06-22 22:39:36 +00:00
|
|
|
|
2002-07-22 22:02:08 +00:00
|
|
|
struct UTrie;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
2001-10-08 23:26:58 +00:00
|
|
|
U_NAMESPACE_BEGIN
|
|
|
|
|
2004-06-10 16:43:49 +00:00
|
|
|
/** @internal */
|
2002-07-22 22:02:08 +00:00
|
|
|
struct RBBIDataHeader;
|
2002-08-08 00:39:13 +00:00
|
|
|
class RuleBasedBreakIteratorTables;
|
|
|
|
class BreakIterator;
|
|
|
|
class RBBIDataWrapper;
|
2006-03-23 00:54:12 +00:00
|
|
|
class UStack;
|
|
|
|
class LanguageBreakEngine;
|
|
|
|
class UnhandledEngine;
|
2003-11-09 06:52:44 +00:00
|
|
|
struct RBBIStateTable;
|
2000-01-18 19:57:46 +00:00
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
|
|
|
|
|
2006-05-08 16:08:53 +00:00
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
2005-06-22 22:39:36 +00:00
|
|
|
*
|
2002-12-12 01:22:09 +00:00
|
|
|
* A subclass of BreakIterator whose behavior is specified using a list of rules.
|
2002-08-01 18:40:05 +00:00
|
|
|
* <p>Instances of this class are most commonly created by the factory methods of
|
2002-12-04 18:21:09 +00:00
|
|
|
* BreakIterator::createWordInstance(), BreakIterator::createLineInstance(), etc.,
|
|
|
|
* and then used via the abstract API in class BreakIterator</p>
|
|
|
|
*
|
2002-08-01 18:40:05 +00:00
|
|
|
* <p>See the ICU User Guide for information on Break Iterator Rules.</p>
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
2002-12-04 18:21:09 +00:00
|
|
|
* <p>This class is not intended to be subclassed. (Class DictionaryBasedBreakIterator
|
2004-08-24 17:21:14 +00:00
|
|
|
* is a subclass, but that relationship is effectively internal to the ICU
|
2002-12-04 18:21:09 +00:00
|
|
|
* implementation. The subclassing interface to RulesBasedBreakIterator is
|
|
|
|
* not part of the ICU API, and may not remain stable.</p>
|
|
|
|
*
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2002-06-25 17:23:07 +00:00
|
|
|
class U_COMMON_API RuleBasedBreakIterator : public BreakIterator {
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
/**
|
2006-04-22 05:29:27 +00:00
|
|
|
* The UText through which this BreakIterator accesses the text
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2006-04-22 05:29:27 +00:00
|
|
|
UText *fText;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* A character iterator that refers to the same text as the UText, above.
|
|
|
|
* Only included for compatibility with old API, which was based on CharacterIterators.
|
2006-05-08 16:08:53 +00:00
|
|
|
* Value may be adopted from outside, or one of fSCharIter or fDCharIter, below.
|
2006-04-22 05:29:27 +00:00
|
|
|
*/
|
|
|
|
CharacterIterator *fCharIter;
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2006-05-08 16:08:53 +00:00
|
|
|
/**
|
|
|
|
* When the input text is provided by a UnicodeString, this will point to
|
|
|
|
* a characterIterator that wraps that data. Needed only for the
|
|
|
|
* implementation of getText(), a backwards compatibility issue.
|
|
|
|
*/
|
|
|
|
StringCharacterIterator *fSCharIter;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* When the input text is provided by a UText, this
|
|
|
|
* dummy CharacterIterator over an empty string will
|
|
|
|
* be returned from getText()
|
|
|
|
*/
|
|
|
|
UCharCharacterIterator *fDCharIter;
|
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
/**
|
|
|
|
* The rule data for this BreakIterator instance
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-07-26 17:19:16 +00:00
|
|
|
*/
|
2002-06-25 17:23:07 +00:00
|
|
|
RBBIDataWrapper *fData;
|
2002-06-27 21:14:47 +00:00
|
|
|
|
2004-08-24 17:21:14 +00:00
|
|
|
/** Index of the Rule {tag} values for the most recent match.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
|
|
|
*/
|
2004-03-05 05:04:10 +00:00
|
|
|
int32_t fLastRuleStatusIndex;
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
/**
|
|
|
|
* Rule tag value valid flag.
|
|
|
|
* Some iterator operations don't intrinsically set the correct tag value.
|
2002-08-01 18:40:05 +00:00
|
|
|
* This flag lets us lazily compute the value if we are ever asked for it.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-07-26 17:19:16 +00:00
|
|
|
*/
|
2004-03-05 05:04:10 +00:00
|
|
|
UBool fLastStatusIndexValid;
|
2002-07-22 22:02:08 +00:00
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
/**
|
|
|
|
* Counter for the number of characters encountered with the "dictionary"
|
2006-03-23 00:54:12 +00:00
|
|
|
* flag set.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-07-26 17:19:16 +00:00
|
|
|
*/
|
2006-03-23 00:54:12 +00:00
|
|
|
uint32_t fDictionaryCharCount;
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2006-03-23 00:54:12 +00:00
|
|
|
/**
|
|
|
|
* When a range of characters is divided up using the dictionary, the break
|
|
|
|
* positions that are discovered are stored here, preventing us from having
|
|
|
|
* to use either the dictionary or the state table again until the iterator
|
|
|
|
* leaves this range of text. Has the most impact for line breaking.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t* fCachedBreakPositions;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* The number of elements in fCachedBreakPositions
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t fNumCachedBreakPositions;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* if fCachedBreakPositions is not null, this indicates which item in the
|
|
|
|
* cache the current iteration position refers to
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t fPositionInCache;
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* If present, UStack of LanguageBreakEngine objects that might handle
|
|
|
|
* dictionary characters. Searched from top to bottom to find an object to
|
|
|
|
* handle a given character.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
UStack *fLanguageBreakEngines;
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* If present, the special LanguageBreakEngine used for handling
|
|
|
|
* characters that are in the dictionary set, but not handled by any
|
|
|
|
* LangugageBreakEngine.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
UnhandledEngine *fUnhandledBreakEngine;
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* The type of the break iterator, or -1 if it has not been set.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t fBreakType;
|
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
protected:
|
2000-01-10 21:10:21 +00:00
|
|
|
//=======================================================================
|
|
|
|
// constructors
|
|
|
|
//=======================================================================
|
2002-06-27 21:14:47 +00:00
|
|
|
|
2008-09-25 05:48:27 +00:00
|
|
|
/**
|
|
|
|
* Constant to be used in the constructor
|
|
|
|
* RuleBasedBreakIterator(RBBIDataHeader*, EDontAdopt, UErrorCode &);
|
|
|
|
* which does not adopt the memory indicated by the RBBIDataHeader*
|
|
|
|
* parameter.
|
|
|
|
*
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
enum EDontAdopt {
|
|
|
|
kDontAdopt
|
|
|
|
};
|
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
/**
|
|
|
|
* Constructor from a flattened set of RBBI data in malloced memory.
|
|
|
|
* RulesBasedBreakIterators built from a custom set of rules
|
|
|
|
* are created via this constructor; the rules are compiled
|
|
|
|
* into memory, then the break iterator is constructed here.
|
|
|
|
*
|
|
|
|
* The break iterator adopts the memory, and will
|
|
|
|
* free it when done.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-07-26 17:19:16 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator(RBBIDataHeader* data, UErrorCode &status);
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2008-09-25 05:48:27 +00:00
|
|
|
/**
|
|
|
|
* Constructor from a flattened set of RBBI data in memory which need not
|
|
|
|
* be malloced (e.g. it may be a memory-mapped file, etc.).
|
|
|
|
*
|
|
|
|
* This version does not adopt the memory, and does not
|
|
|
|
* free it when done.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator(const RBBIDataHeader* data, enum EDontAdopt dontAdopt, UErrorCode &status);
|
|
|
|
|
2006-03-23 00:54:12 +00:00
|
|
|
|
2005-06-22 21:07:14 +00:00
|
|
|
friend class RBBIRuleBuilder;
|
|
|
|
/** @internal */
|
2002-07-26 17:19:16 +00:00
|
|
|
friend class BreakIterator;
|
2002-06-25 17:23:07 +00:00
|
|
|
|
|
|
|
|
2002-06-27 21:14:47 +00:00
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
public:
|
2001-03-22 00:09:10 +00:00
|
|
|
|
2002-07-26 17:19:16 +00:00
|
|
|
/** Default constructor. Creates an empty shell of an iterator, with no
|
2002-08-08 00:39:13 +00:00
|
|
|
* rules or text to iterate over. Object can subsequently be assigned to.
|
2003-11-18 02:37:24 +00:00
|
|
|
* @stable ICU 2.2
|
2002-07-26 17:19:16 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator();
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
2002-06-25 17:23:07 +00:00
|
|
|
* Copy constructor. Will produce a break iterator with the same behavior,
|
2000-01-10 21:10:21 +00:00
|
|
|
* and which iterates over the same text, as the one passed in.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param that The RuleBasedBreakIterator passed to be copied
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator(const RuleBasedBreakIterator& that);
|
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
/**
|
2002-07-26 17:19:16 +00:00
|
|
|
* Construct a RuleBasedBreakIterator from a set of rules supplied as a string.
|
2002-08-01 18:40:05 +00:00
|
|
|
* @param rules The break rules to be used.
|
|
|
|
* @param parseError In the event of a syntax error in the rules, provides the location
|
|
|
|
* within the rules of the problem.
|
|
|
|
* @param status Information on any errors encountered.
|
2003-11-18 02:37:24 +00:00
|
|
|
* @stable ICU 2.2
|
2002-06-25 17:23:07 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator( const UnicodeString &rules,
|
2002-08-01 18:40:05 +00:00
|
|
|
UParseError &parseError,
|
|
|
|
UErrorCode &status);
|
2003-10-17 23:27:36 +00:00
|
|
|
|
|
|
|
|
2011-04-29 17:49:01 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Contruct a RuleBasedBreakIterator from a set of precompiled binary rules.
|
|
|
|
* Binary rules are obtained from RulesBasedBreakIterator::getBinaryRules().
|
|
|
|
* Construction of a break iterator in this way is substantially faster than
|
|
|
|
* constuction from source rules.
|
|
|
|
*
|
|
|
|
* Ownership of the storage containing the compiled rules remains with the
|
|
|
|
* caller of this function. The compiled rules must not be modified or
|
|
|
|
* deleted during the life of the break iterator.
|
|
|
|
*
|
|
|
|
* The compiled rules are not compatible across different major versions of ICU.
|
|
|
|
* The compiled rules are comaptible only between machines with the same
|
|
|
|
* byte ordering (little or big endian) and the same base character set family
|
|
|
|
* (ASCII or EBCDIC).
|
|
|
|
*
|
|
|
|
* @see #getBinaryRules
|
|
|
|
* @param compiledRules A pointer to the compiled break rules to be used.
|
|
|
|
* @param ruleLength The length of the compiled break rules, in bytes. This
|
|
|
|
* corresponds to the length value produced by getBinaryRules().
|
|
|
|
* @param status Information on any errors encountered, including invalid
|
|
|
|
* binary rules.
|
|
|
|
* @draft ICU 4.8
|
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator(const uint8_t *compiledRules,
|
|
|
|
uint32_t ruleLength,
|
|
|
|
UErrorCode &status);
|
|
|
|
|
|
|
|
|
2003-10-17 23:27:36 +00:00
|
|
|
/**
|
|
|
|
* This constructor uses the udata interface to create a BreakIterator
|
2004-08-24 17:21:14 +00:00
|
|
|
* whose internal tables live in a memory-mapped file. "image" is an
|
2003-10-17 23:27:36 +00:00
|
|
|
* ICU UDataMemory handle for the pre-compiled break iterator tables.
|
|
|
|
* @param image handle to the memory image for the break iterator data.
|
2004-01-23 01:25:19 +00:00
|
|
|
* Ownership of the UDataMemory handle passes to the Break Iterator,
|
|
|
|
* which will be responsible for closing it when it is no longer needed.
|
2003-10-17 23:27:36 +00:00
|
|
|
* @param status Information on any errors encountered.
|
|
|
|
* @see udata_open
|
|
|
|
* @see #getBinaryRules
|
2005-06-22 23:38:06 +00:00
|
|
|
* @stable ICU 2.8
|
2003-10-17 23:27:36 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator(UDataMemory* image, UErrorCode &status);
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
|
|
|
* Destructor
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual ~RuleBasedBreakIterator();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Assignment operator. Sets this iterator to have the same behavior,
|
|
|
|
* and iterate over the same text, as the one passed in.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param that The RuleBasedBreakItertor passed in
|
|
|
|
* @return the newly created RuleBasedBreakIterator
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
RuleBasedBreakIterator& operator=(const RuleBasedBreakIterator& that);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Equality operator. Returns TRUE if both BreakIterators are of the
|
|
|
|
* same class, have the same behavior, and iterate over the same text.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param that The BreakIterator to be compared for equality
|
2004-06-08 22:53:49 +00:00
|
|
|
* @return TRUE if both BreakIterators are of the
|
2002-07-03 12:05:56 +00:00
|
|
|
* same class, have the same behavior, and iterate over the same text.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-05-18 22:08:39 +00:00
|
|
|
virtual UBool operator==(const BreakIterator& that) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Not-equal operator. If operator== returns TRUE, this returns FALSE,
|
|
|
|
* and vice versa.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param that The BreakIterator to be compared for inequality
|
|
|
|
* @return TRUE if both BreakIterators are not same.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-05-18 22:08:39 +00:00
|
|
|
UBool operator!=(const BreakIterator& that) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a newly-constructed RuleBasedBreakIterator with the same
|
|
|
|
* behavior, and iterating over the same text, as this one.
|
2002-06-25 17:23:07 +00:00
|
|
|
* Differs from the copy constructor in that it is polymorphic, and
|
2004-06-08 21:47:15 +00:00
|
|
|
* will correctly clone (copy) a derived class.
|
2002-08-01 18:40:05 +00:00
|
|
|
* clone() is thread safe. Multiple threads may simultaeneously
|
|
|
|
* clone the same source break iterator.
|
2004-06-08 21:47:15 +00:00
|
|
|
* @return a newly-constructed RuleBasedBreakIterator
|
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2002-06-25 17:23:07 +00:00
|
|
|
virtual BreakIterator* clone() const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Compute a hash code for this BreakIterator
|
|
|
|
* @return A hash code
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-01-14 00:13:59 +00:00
|
|
|
virtual int32_t hashCode(void) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the description used to create this iterator
|
2002-07-03 12:05:56 +00:00
|
|
|
* @return the description used to create this iterator
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-01-14 00:13:59 +00:00
|
|
|
virtual const UnicodeString& getRules(void) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
//=======================================================================
|
|
|
|
// BreakIterator overrides
|
|
|
|
//=======================================================================
|
|
|
|
|
|
|
|
/**
|
2006-08-11 05:46:59 +00:00
|
|
|
* <p>
|
2006-04-22 05:29:27 +00:00
|
|
|
* Return a CharacterIterator over the text being analyzed.
|
|
|
|
* The returned character iterator is owned by the break iterator, and must
|
|
|
|
* not be deleted by the caller. Repeated calls to this function may
|
|
|
|
* return the same CharacterIterator.
|
2006-08-11 05:46:59 +00:00
|
|
|
* </p>
|
|
|
|
* <p>
|
2006-04-22 05:29:27 +00:00
|
|
|
* The returned character iterator must not be used concurrently with
|
|
|
|
* the break iterator. If concurrent operation is needed, clone the
|
|
|
|
* returned character iterator first and operate on the clone.
|
2006-08-11 05:46:59 +00:00
|
|
|
* </p>
|
|
|
|
* <p>
|
2006-04-26 04:01:00 +00:00
|
|
|
* When the break iterator is operating on text supplied via a UText,
|
|
|
|
* this function will fail. Lacking any way to signal failures, it
|
2006-05-08 16:08:53 +00:00
|
|
|
* returns an CharacterIterator containing no text.
|
2006-04-26 04:01:00 +00:00
|
|
|
* The function getUText() provides similar functionality,
|
|
|
|
* is reliable, and is more efficient.
|
2006-08-11 05:46:59 +00:00
|
|
|
* </p>
|
2006-04-26 04:01:00 +00:00
|
|
|
*
|
2006-04-22 05:29:27 +00:00
|
|
|
* TODO: deprecate this function?
|
|
|
|
*
|
2000-01-10 21:10:21 +00:00
|
|
|
* @return An iterator over the text being analyzed.
|
2006-04-22 05:29:27 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2006-04-22 05:29:27 +00:00
|
|
|
virtual CharacterIterator& getText(void) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
|
2005-06-23 05:51:28 +00:00
|
|
|
/**
|
|
|
|
* Get a UText for the text being analyzed.
|
|
|
|
* The returned UText is a shallow clone of the UText used internally
|
|
|
|
* by the break iterator implementation. It can safely be used to
|
|
|
|
* access the text without impacting any break iterator operations,
|
|
|
|
* but the underlying text itself must not be altered.
|
|
|
|
*
|
|
|
|
* @param fillIn A UText to be filled in. If NULL, a new UText will be
|
|
|
|
* allocated to hold the result.
|
2005-06-27 16:08:36 +00:00
|
|
|
* @param status receives any error codes.
|
2005-06-23 05:51:28 +00:00
|
|
|
* @return The current UText for this break iterator. If an input
|
|
|
|
* UText was provided, it will always be returned.
|
2007-08-19 08:59:28 +00:00
|
|
|
* @stable ICU 3.4
|
2005-06-23 05:51:28 +00:00
|
|
|
*/
|
|
|
|
virtual UText *getUText(UText *fillIn, UErrorCode &status) const;
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
|
|
|
* Set the iterator to analyze a new piece of text. This function resets
|
|
|
|
* the current iteration position to the beginning of the text.
|
2001-03-07 22:42:46 +00:00
|
|
|
* @param newText An iterator over the text to analyze. The BreakIterator
|
|
|
|
* takes ownership of the character iterator. The caller MUST NOT delete it!
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2001-03-07 22:42:46 +00:00
|
|
|
virtual void adoptText(CharacterIterator* newText);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Set the iterator to analyze a new piece of text. This function resets
|
|
|
|
* the current iteration position to the beginning of the text.
|
|
|
|
* @param newText The text to analyze.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2001-03-07 22:42:46 +00:00
|
|
|
virtual void setText(const UnicodeString& newText);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
2005-06-23 05:51:28 +00:00
|
|
|
/**
|
|
|
|
* Reset the break iterator to operate over the text represented by
|
|
|
|
* the UText. The iterator position is reset to the start.
|
|
|
|
*
|
|
|
|
* This function makes a shallow clone of the supplied UText. This means
|
|
|
|
* that the caller is free to immediately close or otherwise reuse the
|
|
|
|
* Utext that was passed as a parameter, but that the underlying text itself
|
|
|
|
* must not be altered while being referenced by the break iterator.
|
|
|
|
*
|
|
|
|
* @param text The UText used to change the text.
|
|
|
|
* @param status Receives any error codes.
|
2007-08-19 08:59:28 +00:00
|
|
|
* @stable ICU 3.4
|
2005-06-23 05:51:28 +00:00
|
|
|
*/
|
|
|
|
virtual void setText(UText *text, UErrorCode &status);
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
|
|
|
* Sets the current iteration position to the beginning of the text.
|
|
|
|
* @return The offset of the beginning of the text.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t first(void);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets the current iteration position to the end of the text.
|
|
|
|
* @return The text's past-the-end offset.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t last(void);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Advances the iterator either forward or backward the specified number of steps.
|
|
|
|
* Negative values move backward, and positive values move forward. This is
|
|
|
|
* equivalent to repeatedly calling next() or previous().
|
|
|
|
* @param n The number of steps to move. The sign indicates the direction
|
|
|
|
* (negative is backwards, and positive is forwards).
|
|
|
|
* @return The character offset of the boundary position n boundaries away from
|
|
|
|
* the current one.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t next(int32_t n);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Advances the iterator to the next boundary position.
|
|
|
|
* @return The position of the first boundary after this one.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t next(void);
|
|
|
|
|
|
|
|
/**
|
2002-08-01 18:40:05 +00:00
|
|
|
* Moves the iterator backwards, to the last boundary preceding this one.
|
2000-01-10 21:10:21 +00:00
|
|
|
* @return The position of the last boundary position preceding this one.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t previous(void);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets the iterator to refer to the first boundary position following
|
|
|
|
* the specified position.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param offset The position from which to begin searching for a break position.
|
2000-01-10 21:10:21 +00:00
|
|
|
* @return The position of the first break after the current position.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t following(int32_t offset);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets the iterator to refer to the last boundary position before the
|
|
|
|
* specified position.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @param offset The position to begin searching for a break from.
|
2000-01-10 21:10:21 +00:00
|
|
|
* @return The position of the last boundary before the starting position.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t preceding(int32_t offset);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns true if the specfied position is a boundary position. As a side
|
|
|
|
* effect, leaves the iterator pointing to the first boundary position at
|
|
|
|
* or after "offset".
|
|
|
|
* @param offset the offset to check.
|
|
|
|
* @return True if "offset" is a boundary position.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-05-18 22:08:39 +00:00
|
|
|
virtual UBool isBoundary(int32_t offset);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the current iteration position.
|
|
|
|
* @return The current iteration position.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t current(void) const;
|
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
|
|
|
|
/**
|
2002-08-01 18:40:05 +00:00
|
|
|
* Return the status tag from the break rule that determined the most recently
|
2004-05-17 18:38:33 +00:00
|
|
|
* returned break position. For break rules that do not specify a
|
|
|
|
* status, a default value of 0 is returned. If more than one break rule
|
|
|
|
* would cause a boundary to be located at some position in the text,
|
|
|
|
* the numerically largest of the applicable status values is returned.
|
2003-05-29 18:51:43 +00:00
|
|
|
* <p>
|
2004-05-17 18:38:33 +00:00
|
|
|
* Of the standard types of ICU break iterators, only word break and
|
|
|
|
* line break provide status values. The values are defined in
|
|
|
|
* the header file ubrk.h. For Word breaks, the status allows distinguishing between words
|
2003-05-29 18:51:43 +00:00
|
|
|
* that contain alphabetic letters, "words" that appear to be numbers,
|
|
|
|
* punctuation and spaces, words containing ideographic characters, and
|
2004-05-17 18:38:33 +00:00
|
|
|
* more. For Line Break, the status distinguishes between hard (mandatory) breaks
|
|
|
|
* and soft (potential) break positions.
|
|
|
|
* <p>
|
|
|
|
* <code>getRuleStatus()</code> can be called after obtaining a boundary
|
2004-08-24 17:21:14 +00:00
|
|
|
* position from <code>next()</code>, <code>previous()</code>, or
|
2003-05-29 18:51:43 +00:00
|
|
|
* any other break iterator functions that returns a boundary position.
|
|
|
|
* <p>
|
2004-05-17 18:38:33 +00:00
|
|
|
* When creating custom break rules, one is free to define whatever
|
|
|
|
* status values may be convenient for the application.
|
|
|
|
* <p>
|
|
|
|
* Note: this function is not thread safe. It should not have been
|
|
|
|
* declared const, and the const remains only for compatibility
|
|
|
|
* reasons. (The function is logically const, but not bit-wise const).
|
|
|
|
* <p>
|
2002-07-03 12:05:56 +00:00
|
|
|
* @return the status from the break rule that determined the most recently
|
|
|
|
* returned break position.
|
2003-05-29 18:51:43 +00:00
|
|
|
*
|
|
|
|
* @see UWordBreak
|
2003-11-18 02:37:24 +00:00
|
|
|
* @stable ICU 2.2
|
2002-06-25 17:23:07 +00:00
|
|
|
*/
|
2002-06-27 01:50:22 +00:00
|
|
|
virtual int32_t getRuleStatus() const;
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2004-03-05 05:04:10 +00:00
|
|
|
/**
|
2004-08-24 17:21:14 +00:00
|
|
|
* Get the status (tag) values from the break rule(s) that determined the most
|
|
|
|
* recently returned break position.
|
2004-03-05 17:27:42 +00:00
|
|
|
* <p>
|
2004-05-17 18:38:33 +00:00
|
|
|
* The returned status value(s) are stored into an array provided by the caller.
|
2004-05-28 20:17:39 +00:00
|
|
|
* The values are stored in sorted (ascending) order.
|
2004-03-05 17:27:42 +00:00
|
|
|
* If the capacity of the output array is insufficient to hold the data,
|
|
|
|
* the output will be truncated to the available length, and a
|
|
|
|
* U_BUFFER_OVERFLOW_ERROR will be signaled.
|
|
|
|
*
|
2004-08-24 17:21:14 +00:00
|
|
|
* @param fillInVec an array to be filled in with the status values.
|
2004-03-05 05:04:10 +00:00
|
|
|
* @param capacity the length of the supplied vector. A length of zero causes
|
|
|
|
* the function to return the number of status values, in the
|
|
|
|
* normal way, without attemtping to store any values.
|
2004-08-24 17:21:14 +00:00
|
|
|
* @param status receives error codes.
|
|
|
|
* @return The number of rule status values from rules that determined
|
2004-03-05 05:04:10 +00:00
|
|
|
* the most recent boundary returned by the break iterator.
|
2004-03-05 17:27:42 +00:00
|
|
|
* In the event of a U_BUFFER_OVERFLOW_ERROR, the return value
|
|
|
|
* is the total number of status values that were available,
|
|
|
|
* not the reduced number that were actually returned.
|
2004-05-17 18:38:33 +00:00
|
|
|
* @see getRuleStatus
|
2006-01-18 03:34:19 +00:00
|
|
|
* @stable ICU 3.0
|
2004-03-05 05:04:10 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t getRuleStatusVec(int32_t *fillInVec, int32_t capacity, UErrorCode &status);
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
|
|
|
* Returns a unique class ID POLYMORPHICALLY. Pure virtual override.
|
|
|
|
* This method is to implement a simple version of RTTI, since not all
|
|
|
|
* C++ compilers support genuine RTTI. Polymorphic operator==() and
|
|
|
|
* clone() methods call this method.
|
|
|
|
*
|
|
|
|
* @return The class ID for this object. All objects of a
|
|
|
|
* given class have the same class ID. Objects of
|
|
|
|
* other classes have different class IDs.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2003-08-27 01:01:42 +00:00
|
|
|
virtual UClassID getDynamicClassID(void) const;
|
2000-01-10 21:10:21 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the class ID for this class. This is useful only for
|
|
|
|
* comparing to a return value from getDynamicClassID(). For example:
|
|
|
|
*
|
|
|
|
* Base* polymorphic_pointer = createPolymorphicObject();
|
|
|
|
* if (polymorphic_pointer->getDynamicClassID() ==
|
|
|
|
* Derived::getStaticClassID()) ...
|
|
|
|
*
|
|
|
|
* @return The class ID for all objects of this class.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2004-08-24 17:21:14 +00:00
|
|
|
static UClassID U_EXPORT2 getStaticClassID(void);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
2002-08-01 18:40:05 +00:00
|
|
|
/*
|
|
|
|
* Create a clone (copy) of this break iterator in memory provided
|
|
|
|
* by the caller. The idea is to increase performance by avoiding
|
|
|
|
* a storage allocation. Use of this functoin is NOT RECOMMENDED.
|
|
|
|
* Performance gains are minimal, and correct buffer management is
|
|
|
|
* tricky. Use clone() instead.
|
|
|
|
*
|
|
|
|
* @param stackBuffer The pointer to the memory into which the cloned object
|
|
|
|
* should be placed. If NULL, allocate heap memory
|
|
|
|
* for the cloned object.
|
|
|
|
* @param BufferSize The size of the buffer. If zero, return the required
|
|
|
|
* buffer size, but do not clone the object. If the
|
|
|
|
* size was too small (but not zero), allocate heap
|
|
|
|
* storage for the cloned object.
|
2002-08-08 00:39:13 +00:00
|
|
|
*
|
2002-08-01 18:40:05 +00:00
|
|
|
* @param status Error status. U_SAFECLONE_ALLOCATED_WARNING will be
|
|
|
|
* returned if the the provided buffer was too small, and
|
|
|
|
* the clone was therefore put on the heap.
|
|
|
|
*
|
|
|
|
* @return Pointer to the clone object. This may differ from the stackBuffer
|
|
|
|
* address if the byte alignment of the stack buffer was not suitable
|
|
|
|
* or if the stackBuffer was too small to hold the clone.
|
2002-12-04 23:39:56 +00:00
|
|
|
* @stable ICU 2.0
|
2002-08-01 18:40:05 +00:00
|
|
|
*/
|
2001-11-05 23:38:59 +00:00
|
|
|
virtual BreakIterator * createBufferClone(void *stackBuffer,
|
2001-02-21 23:40:41 +00:00
|
|
|
int32_t &BufferSize,
|
|
|
|
UErrorCode &status);
|
2002-06-25 17:23:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
2002-06-27 01:50:22 +00:00
|
|
|
* Return the binary form of compiled break rules,
|
2002-06-25 17:23:07 +00:00
|
|
|
* which can then be used to create a new break iterator at some
|
2002-08-01 18:40:05 +00:00
|
|
|
* time in the future. Creating a break iterator from pre-compiled rules
|
2002-06-25 17:23:07 +00:00
|
|
|
* is much faster than building one from the source form of the
|
|
|
|
* break rules.
|
|
|
|
*
|
2003-10-17 23:27:36 +00:00
|
|
|
* The binary data can only be used with the same version of ICU
|
2002-06-27 01:50:22 +00:00
|
|
|
* and on the same platform type (processor endian-ness)
|
|
|
|
*
|
2002-08-01 18:40:05 +00:00
|
|
|
* @param length Returns the length of the binary data. (Out paramter.)
|
|
|
|
*
|
2002-06-27 01:50:22 +00:00
|
|
|
* @return A pointer to the binary (compiled) rule data. The storage
|
2002-08-01 18:40:05 +00:00
|
|
|
* belongs to the RulesBasedBreakIterator object, not the
|
2002-06-25 17:23:07 +00:00
|
|
|
* caller, and must not be modified or deleted.
|
2011-04-29 17:49:01 +00:00
|
|
|
* @draft ICU 4.8
|
2002-06-25 17:23:07 +00:00
|
|
|
*/
|
2002-06-27 01:50:22 +00:00
|
|
|
virtual const uint8_t *getBinaryRules(uint32_t &length);
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2011-06-09 22:49:40 +00:00
|
|
|
/**
|
|
|
|
* Set the subject text string upon which the break iterator is operating
|
|
|
|
* without changing any other aspect of the matching state.
|
|
|
|
* The new and previous text strings must have the same content.
|
|
|
|
*
|
|
|
|
* This function is intended for use in environments where ICU is operating on
|
|
|
|
* strings that may move around in memory. It provides a mechanism for notifying
|
|
|
|
* ICU that the string has been relocated, and providing a new UText to access the
|
|
|
|
* string in its new position.
|
|
|
|
*
|
|
|
|
* Note that the break iterator implementation never copies the underlying text
|
|
|
|
* of a string being processed, but always operates directly on the original text
|
|
|
|
* provided by the user. Refreshing simply drops the references to the old text
|
|
|
|
* and replaces them with references to the new.
|
|
|
|
*
|
|
|
|
* Caution: this function is normally used only by very specialized,
|
|
|
|
* system-level code. One example use case is with garbage collection that moves
|
|
|
|
* the text in memory.
|
|
|
|
*
|
|
|
|
* @param input The new (moved) text string.
|
|
|
|
* @param status Receives errors detected by this function.
|
|
|
|
* @return *this
|
|
|
|
*
|
|
|
|
* @draft ICU 5.0
|
|
|
|
*/
|
|
|
|
virtual RuleBasedBreakIterator &refreshInputText(UText *input, UErrorCode &status);
|
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
protected:
|
|
|
|
//=======================================================================
|
|
|
|
// implementation
|
|
|
|
//=======================================================================
|
|
|
|
/**
|
|
|
|
* Dumps caches and performs other actions associated with a complete change
|
2006-03-23 00:54:12 +00:00
|
|
|
* in text or iteration position.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2000-01-10 21:10:21 +00:00
|
|
|
*/
|
2000-01-14 00:13:59 +00:00
|
|
|
virtual void reset(void);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
2006-05-26 00:57:09 +00:00
|
|
|
#if 0
|
2000-01-10 21:10:21 +00:00
|
|
|
/**
|
2002-06-25 17:23:07 +00:00
|
|
|
* Return true if the category lookup for this char
|
|
|
|
* indicates that it is in the set of dictionary lookup chars.
|
|
|
|
* This function is intended for use by dictionary based break iterators.
|
2002-07-03 12:05:56 +00:00
|
|
|
* @return true if the category lookup for this char
|
|
|
|
* indicates that it is in the set of dictionary lookup chars.
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-06-27 21:14:47 +00:00
|
|
|
*/
|
2002-06-25 17:23:07 +00:00
|
|
|
virtual UBool isDictionaryChar(UChar32);
|
2000-01-10 21:10:21 +00:00
|
|
|
|
2006-03-23 00:54:12 +00:00
|
|
|
/**
|
|
|
|
* Get the type of the break iterator.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
virtual int32_t getBreakType() const;
|
2006-05-26 00:57:09 +00:00
|
|
|
#endif
|
2006-03-23 00:54:12 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Set the type of the break iterator.
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
virtual void setBreakType(int32_t type);
|
|
|
|
|
2002-06-25 17:23:07 +00:00
|
|
|
/**
|
|
|
|
* Common initialization function, used by constructors and bufferClone.
|
|
|
|
* (Also used by DictionaryBasedBreakIterator::createBufferClone().)
|
2002-12-04 18:21:09 +00:00
|
|
|
* @internal
|
2002-06-25 17:23:07 +00:00
|
|
|
*/
|
|
|
|
void init();
|
2001-02-21 23:40:41 +00:00
|
|
|
|
2003-11-07 02:02:06 +00:00
|
|
|
private:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method backs the iterator back up to a "safe position" in the text.
|
|
|
|
* This is a position that we know, without any context, must be a break position.
|
|
|
|
* The various calling methods then iterate forward from this safe position to
|
|
|
|
* the appropriate position to return. (For more information, see the description
|
|
|
|
* of buildBackwardsStateTable() in RuleBasedBreakIterator.Builder.)
|
2003-11-09 06:52:44 +00:00
|
|
|
* @param statetable state table used of moving backwards
|
2003-11-07 02:02:06 +00:00
|
|
|
* @internal
|
|
|
|
*/
|
2003-11-09 06:52:44 +00:00
|
|
|
int32_t handlePrevious(const RBBIStateTable *statetable);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method is the actual implementation of the next() method. All iteration
|
|
|
|
* vectors through here. This method initializes the state machine to state 1
|
|
|
|
* and advances through the text character by character until we reach the end
|
|
|
|
* of the text or the state machine transitions to state 0. We update our return
|
|
|
|
* value every time the state machine passes through a possible end state.
|
|
|
|
* @param statetable state table used of moving forwards
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t handleNext(const RBBIStateTable *statetable);
|
2004-03-05 05:04:10 +00:00
|
|
|
|
2007-05-02 22:56:37 +00:00
|
|
|
protected:
|
|
|
|
|
2006-03-23 00:54:12 +00:00
|
|
|
/**
|
|
|
|
* This is the function that actually implements dictionary-based
|
|
|
|
* breaking. Covering at least the range from startPos to endPos,
|
|
|
|
* it checks for dictionary characters, and if it finds them determines
|
|
|
|
* the appropriate object to deal with them. It may cache found breaks in
|
|
|
|
* fCachedBreakPositions as it goes. It may well also look at text outside
|
|
|
|
* the range startPos to endPos.
|
|
|
|
* If going forward, endPos is the normal Unicode break result, and
|
|
|
|
* if goind in reverse, startPos is the normal Unicode break result
|
|
|
|
* @param startPos The start position of a range of text
|
|
|
|
* @param endPos The end position of a range of text
|
|
|
|
* @param reverse The call is for the reverse direction
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
int32_t checkDictionary(int32_t startPos, int32_t endPos, UBool reverse);
|
|
|
|
|
2007-05-02 22:56:37 +00:00
|
|
|
private:
|
|
|
|
|
2006-03-23 00:54:12 +00:00
|
|
|
/**
|
|
|
|
* This function returns the appropriate LanguageBreakEngine for a
|
|
|
|
* given character c.
|
|
|
|
* @param c A character in the dictionary set
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
const LanguageBreakEngine *getLanguageBreakEngine(UChar32 c);
|
|
|
|
|
2004-03-05 05:04:10 +00:00
|
|
|
/**
|
|
|
|
* @internal
|
|
|
|
*/
|
|
|
|
void makeRuleStatusValid();
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
};
|
|
|
|
|
2003-08-27 01:01:42 +00:00
|
|
|
//------------------------------------------------------------------------------
|
2002-06-25 17:23:07 +00:00
|
|
|
//
|
|
|
|
// Inline Functions Definitions ...
|
|
|
|
//
|
2003-08-27 01:01:42 +00:00
|
|
|
//------------------------------------------------------------------------------
|
2002-06-25 17:23:07 +00:00
|
|
|
|
2000-05-18 22:08:39 +00:00
|
|
|
inline UBool RuleBasedBreakIterator::operator!=(const BreakIterator& that) const {
|
2000-01-10 21:10:21 +00:00
|
|
|
return !operator==(that);
|
|
|
|
}
|
|
|
|
|
2001-10-08 23:26:58 +00:00
|
|
|
U_NAMESPACE_END
|
|
|
|
|
2002-10-01 01:26:49 +00:00
|
|
|
#endif /* #if !UCONFIG_NO_BREAK_ITERATION */
|
|
|
|
|
2000-01-10 21:10:21 +00:00
|
|
|
#endif
|