<< Previous Message | Main Index | Next Message >> |
<< Previous Message in Thread | This Month | Next Message in Thread >> |
Date : Thu, 04 Nov 2010 15:57:07 +0000 From : jgh@... (J.G.Harston) Subject: Programming: Colour names in Sigsumeidsi Jules Richardson wrote: > Storage is cheap - with a constraint placed on simplicity of the algorithm > rather than performance, how about a monster[1] lookup table? :-) > [1] anyone care to work out how monster? 20 characters per name, 256*256*256 names, &14000000 bytes of storage. Only 5120M ;) -- J.G.Harston - jgh@...
<< Previous Message | Main Index | Next Message >> |
<< Previous Message in Thread | This Month | Next Message in Thread >> |