[EMAIL PROTECTED] wrote:
>
> Theo's comment leads me to a question I've pondered recently:
>
> Assumptions:
>
>Many apps, from independent sources, need to access the Unicode
>character data,
>
>A lot of these apps aren't overly concerned with the slight overhead of
>parsing th
Theo's comment leads me to a question I've pondered recently:
Assumptions:
Many apps, from independent sources, need to access the Unicode
character data,
A lot of these apps aren't overly concerned with the slight overhead of
parsing the data as needed from Unicode-supplied data f
andreas palsson wrote:
>
> Hi.
>
> I would just like to know if someone could give me a tip on how to
> structure all the unicode-information in memory?
>
> All the UNIDATA does contain quite a bit of information and I can't see
> any obvious method of which is memory-efficient and gives fast a
t; <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Sunday, April 21, 2002 03:28
Subject: Re: unidata is big
> > I would just like to know if someone could give me a tip on how to
> > structure all the unicode-information in memory?
> >
> > All the UNIDATA does
> I would just like to know if someone could give me a tip on how to
> structure all the unicode-information in memory?
>
> All the UNIDATA does contain quite a bit of information and I can't see
> any obvious method of which is memory-efficient and gives fast access.
a) you see if there is a Uni
Hi.
I would just like to know if someone could give me a tip on how to
structure all the unicode-information in memory?
All the UNIDATA does contain quite a bit of information and I can't see
any obvious method of which is memory-efficient and gives fast access.
TIA
/A
--
... "When all think al
6 matches
Mail list logo
