[#7055] More on VC++ 2005 — Austin Ziegler <halostatue@...>

Okay. I've got Ruby compiling. I'm attempting to get everything in

17 messages 2006/01/05
[#7058] Re: More on VC++ 2005 — nobuyoshi nakada <nobuyoshi.nakada@...> 2006/01/06

Hi,

[#7084] mathn: ugly warnings — hadmut@... (Hadmut Danisch)

Hi,

22 messages 2006/01/10
[#7097] Re: mathn: ugly warnings — Daniel Berger <Daniel.Berger@...> 2006/01/10

Hadmut Danisch wrote:

[#7098] Design contracts and refactoring (was Re: mathn: ugly warnings) — mathew <meta@...> 2006/01/10

Daniel Berger wrote:

[#7118] Re: Design contracts and refactoring (was Re: mathn: ugly warnings) — mathew <meta@...> 2006/01/12

*Dean Wampler *<deanwampler gmail.com> writes:

[#7226] Fwd: Re: Question about massive API changes — "Sean E. Russell" <ser@...>

Hello,

23 messages 2006/01/28
[#7228] Re: Question about massive API changes — Caleb Tennis <caleb@...> 2006/01/28

>

Regular Expression Support, Defined by Unicode UTS#18 Requirements

From: Wolfgang N疆asi-Donner <wonado@...>
Date: 2006-01-14 19:35:27 UTC
List: ruby-core #7153
I have a question regarding future Ruby versions, that is the versions 2.x
and the experimental versions 1.9.x for Regular Expressions. So the question
concerns Ruby and Oniguruma provided that this combination is up-to-date.

The question is, how far the points defined by the technical report "Unicode
Technical Standard #18 - Unicode Regular Expressions"
(http://www.unicode.org/reports/tr18/) are fulfilled by Ruby/Oniguruma in
future.

It concerns the elements listed below which are described in detail in the
technical report.

>>>>> Extract from UTS#18 >>>>>

C0. An implementation claiming conformance to this specification at any
Level shall identify the version of this specification and the version of
the Unicode Standard.

C1. An implementation claiming conformance to Level 1 of this specification
shall meet the requirements described in the following sections:

RL1.1 Hex Notation
RL1.2 Properties
RL1.2a Compatibility Properties
RL1.3 Subtraction and Intersection
RL1.4 Simple Word Boundaries
RL1.5 Simple Loose Matches
RL1.6 Line Boundaries
RL1.7 Supplementary Code Points

C2. An implementation claiming conformance to Level 2 of this specification
shall satisfy C1, and meet the requirements described in the following
sections:

RL2.1 Canonical Equivalents
RL2.2 Default Grapheme Clusters
RL2.3 Default Word Boundaries
RL2.4 Default Loose Matches
RL2.5 Name Properties
RL2.6 Wildcard Properties

C3. An implementation claiming conformance to Level 3 of this specification
shall satisfy C1 and C2, and meet the requirements described in the
following sections:

RL3.1 Tailored Punctuation
RL3.2 Tailored Grapheme Clusters
RL3.3 Tailored Word Boundaries
RL3.4 Tailored Loose Matches
RL3.5 Tailored Ranges
RL3.6 Context Matching
RL3.7 Incremental Matches
RL3.9 Possible Match Sets
RL3.10 Folded Matching
RL3.11 Submatchers

C4. An implementation claiming partial conformance to this specification
shall clearly indicate which levels are completely supported (C1-C3), plus
any additional supported features from higher levels.

>>>>> End of Extract >>>>>

Wolfgang N疆asi-Donner


In This Thread

Prev Next