| Index: source/common/unicode/ucharstriebuilder.h
|
| diff --git a/source/common/unicode/ucharstriebuilder.h b/source/common/unicode/ucharstriebuilder.h
|
| index ccfb86e16d10546de88e8855e3c9baa94aefc825..35e353d41b515eea8ff6ad972031501e21644f39 100644
|
| --- a/source/common/unicode/ucharstriebuilder.h
|
| +++ b/source/common/unicode/ucharstriebuilder.h
|
| @@ -1,6 +1,6 @@
|
| /*
|
| *******************************************************************************
|
| -* Copyright (C) 2010-2013, International Business Machines
|
| +* Copyright (C) 2010-2014, International Business Machines
|
| * Corporation and others. All Rights Reserved.
|
| *******************************************************************************
|
| * file name: ucharstriebuilder.h
|
| @@ -148,7 +148,6 @@ private:
|
| virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; }
|
| virtual int32_t getMaxLinearMatchLength() const { return UCharsTrie::kMaxLinearMatchLength; }
|
|
|
| -#ifndef U_HIDE_INTERNAL_API
|
| class UCTLinearMatchNode : public LinearMatchNode {
|
| public:
|
| UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode);
|
| @@ -157,7 +156,6 @@ private:
|
| private:
|
| const UChar *s;
|
| };
|
| -#endif
|
|
|
| virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
|
| Node *nextNode) const;
|
|
|