Lookup, Search and Sort
draft-faltstrom-i18n-sorting-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Patrik Fältström | ||
| Last updated | 2001-11-20 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Lookup, searching and sorting is somewhat defined when using a limited set of characters, and especially only one or a few scripts. When operating in a more complex environment, the algorithms get more complex, and in many cases need information about locale. This document describes some of the problems which one encounter in an international environment.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)