| Index: source/common/unicode/bytestriebuilder.h
|
| diff --git a/source/common/unicode/bytestriebuilder.h b/source/common/unicode/bytestriebuilder.h
|
| index 6bbd8a212bb26fea0d03ba6a70fbf0c370cbe2a1..d00ab9b3b0947d0d05c8935f98efe15073da6218 100644
|
| --- a/source/common/unicode/bytestriebuilder.h
|
| +++ b/source/common/unicode/bytestriebuilder.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: bytestriebuilder.h
|
| @@ -141,7 +141,6 @@ private:
|
| virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; }
|
| virtual int32_t getMaxLinearMatchLength() const { return BytesTrie::kMaxLinearMatchLength; }
|
|
|
| -#ifndef U_HIDE_INTERNAL_API
|
| /**
|
| * @internal
|
| */
|
| @@ -153,7 +152,6 @@ private:
|
| private:
|
| const char *s;
|
| };
|
| -#endif /* U_HIDE_INTERNAL_API */
|
|
|
| virtual Node *createLinearMatchNode(int32_t i, int32_t byteIndex, int32_t length,
|
| Node *nextNode) const;
|
|
|