[
Lists Home |
Date Index |
Thread Index
]
- From: Richard Tobin <richard@cogsci.ed.ac.uk>
- To: David Megginson <ak117@freenet.carleton.ca>, xml-dev@ic.ac.uk
- Date: Fri, 28 Nov 1997 14:08:26 GMT
> The fastest solution would be to maintain a static 65,536
> (or at least 32,768) entry array, with bit flags for different
> character properties. That would be fine for big programs, but it
> would kill Java applets
Bear in mind that the main problem of size for Java applets is the
time taken for downloading, rather than the memory used at runtime.
So it may well be practical to store the data in a compact-but-slow
form and use that to initialise a large-but-fast lookup table.
-- Richard
xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:majordomo@ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@ic.ac.uk)
|
