Lines Matching +full:itu +full:- +full:r
33 algorithms for character-based matching rules defined for use in
46 True - the attribute contains a matching value,
48 False - the attribute contains no matching value,
50 Undefined - it cannot be determined whether the attribute contains
75 defined as being a case-insensitive comparison where insignificant
79 universalString, this is not sufficient. For example, a case-
99 comparison so that a character-by-character comparison yields the
153 to ITU/ISO Joint Study Group 2.
189 The following six-step process SHALL be applied to each presented and
204 Note that this six-step process specification is intended to describe
212 Each non-Unicode string value is transcoded to Unicode.
217 transcoded as they are Unicode-based strings (in the case of
239 VARIATION SELECTORs (U+180B-180D, FF00-FE0F) code points are also
249 a complete list of these code points: U+0000-0008, 000E-001F, 007F-
250 0084, 0086-009F, 06DD, 070F, 180E, 200C-200F, 202A-202E, 2060-2063,
251 206A-206F, FEFF, FFF9-FFFB, 1D173-1D17A, E0001, E0020-E007F.
256 list of these code points: U+0020, 00A0, 1680, 2000-200A, 2028-2029,
290 All non-character code points are prohibited. These code points are
320 NOTE - The previous steps ensure that the string cannot contain
324 For input strings that are attribute values or non-substring
325 assertion values: If the input string contains no non-space
327 input string contains at least one non-space character), the string
330 (non-empty) sequence of space characters is replaced with exactly two
344 being prepared contains no non-space characters, then the output
348 - If the input string is an initial substring, it is modified to
351 - If the input string is an initial or an any substring that ends in
355 - If the input string is an any or a final substring that starts in
359 - If the input string is a final substring, it is modified to end
388 HYPHEN-MINUS (U+002D), ARMENIAN HYPHEN (U+058A), HYPHEN (U+2010),
389 NON-BREAKING HYPHEN (U+2011), MINUS SIGN (U+2212), SMALL HYPHEN-MINUS
390 (U+FE63), or FULLWIDTH HYPHEN-MINUS (U+FF0D) code point followed by
461 3.0" (Reading, MA, Addison-Wesley, 2000. ISBN 0-201-
462 61633-5), as amended by the "Unicode Standard Annex
470 <http://www.unicode.org/unicode/reports/tr15/tr15-
473 [X.680] International Telecommunication Union -
475 Syntax Notation One (ASN.1) - Specification of Basic
476 Notation", X.680(2002) (also ISO/IEC 8824-1:2002).
480 [X.500] International Telecommunication Union -
482 Directory -- Overview of concepts, models and
483 services," X.500(1993) (also ISO/IEC 9594-1:1994).
485 [X.501] International Telecommunication Union -
487 Directory -- Models," X.501(1993) (also ISO/IEC 9594-
490 [X.520] International Telecommunication Union -
493 ISO/IEC 9594-6:1994).
511 [RFC3377] Hodges, J. and R. Morgan, "Lightweight Directory Access
576 0300-034F 0360-036F 0483-0486 0488-0489 0591-05A1
577 05A3-05B9 05BB-05BC 05BF 05C1-05C2 05C4 064B-0655 0670
578 06D6-06DC 06DE-06E4 06E7-06E8 06EA-06ED 0711 0730-074A
579 07A6-07B0 0901-0903 093C 093E-094F 0951-0954 0962-0963
580 0981-0983 09BC 09BE-09C4 09C7-09C8 09CB-09CD 09D7
581 09E2-09E3 0A02 0A3C 0A3E-0A42 0A47-0A48 0A4B-0A4D
582 0A70-0A71 0A81-0A83 0ABC 0ABE-0AC5 0AC7-0AC9 0ACB-0ACD
583 0B01-0B03 0B3C 0B3E-0B43 0B47-0B48 0B4B-0B4D 0B56-0B57
584 0B82 0BBE-0BC2 0BC6-0BC8 0BCA-0BCD 0BD7 0C01-0C03
585 0C3E-0C44 0C46-0C48 0C4A-0C4D 0C55-0C56 0C82-0C83
586 0CBE-0CC4 0CC6-0CC8 0CCA-0CCD 0CD5-0CD6 0D02-0D03
587 0D3E-0D43 0D46-0D48 0D4A-0D4D 0D57 0D82-0D83 0DCA
588 0DCF-0DD4 0DD6 0DD8-0DDF 0DF2-0DF3 0E31 0E34-0E3A
589 0E47-0E4E 0EB1 0EB4-0EB9 0EBB-0EBC 0EC8-0ECD 0F18-0F19
590 0F35 0F37 0F39 0F3E-0F3F 0F71-0F84 0F86-0F87 0F90-0F97
591 0F99-0FBC 0FC6 102C-1032 1036-1039 1056-1059 1712-1714
592 1732-1734 1752-1753 1772-1773 17B4-17D3 180B-180D 18A9
593 20D0-20EA 302A-302F 3099-309A FB1E FE00-FE0F FE20-FE23
594 1D165-1D169 1D16D-1D172 1D17B-1D182 1D185-1D18B
595 1D1AA-1D1AD
599 This appendix is non-normative.
605 contains non-space characters, removal of all leading spaces and
638 cause sub-partitioning failures. That is, if a prepared any
650 - the specified substrings (initial, any, final) match
654 - initial, if present, matches the first portion of the value;
656 - final, if present, matches the last portion of the value;
658 - any, if present, matches some arbitrary portion of the
683 - leading spaces (i.e., those preceding the first character
686 - trailing spaces (i.e., those following the last character
689 - multiple consecutive spaces (these are taken as equivalent
713 algorithm to be used in conjunction with character-by-character
766 specification can be obtained from the IETF on-line IPR repository at
773 ietf-ipr@ietf.org.