|
Almost need to split discussion into 2 threads, one for ideas, one for usage discussion. *ponder*
I had thought of using an array of longs, with bitvectors (as a dodgy hash table'esq setup with the key being [code] (char.id % sizeof(long))[/quote], but still debating with others whether to do it)
I was also asking, since I have never been involved with any of the hosting issues related to muds, whether on shared machines it is better (preferable) to use CPU or memory time/space.
|