From mboxrd@z Thu Jan 1 00:00:00 1970 Path: news.gmane.org!not-for-mail From: Philipp Stephani
> From: Philipp Stephani <p.stephani2@gmail.com>
> Date: Sun, 06 Mar 2016 15:24:47 +0000
>
> I've attached a patch with an initial implementation.
Thanks.
> +/* Hash table that maps Unicode character names to code points.=C2=A0= */
> +static Lisp_Object character_names;
> +
> +/* Length of the longest Unicode character name, in bytes. */
> +static ptrdiff_t max_character_name_length;
> +
> +/* Initializes `character_names' and `max_character_name_length= 39;.
> +=C2=A0 =C2=A0Called by `read_escape'.=C2=A0 */
I wonder if there's a better way, in particular with a smaller memory footprint.=C2=A0 Doesn't map-char-table work well enough to avoid
generating all the names up front?
> +=C2=A0 =C2=A0 =C2=A0 =C2=A0 if (! RANGED_INTEGERP (0, code, 0x10FFFF)= )
This should use MAX_UNICODE_CHAR.