Are there any plans to ever move from bitvectors to
bitfields? A lot of people quickly hit that 32 bit
limit, and the array of bit vectors seems like kind
of kludgy solution (well-written though the code for
it is!). And an AFF2_xxx bitvector seems like an even
worse solution!
Bitfields offer unlimited potential for expansion
and are quite trivial to use and to add new bits.
---
eglamkowski@angelfire.com http://www.angelfire.com/nj/eglamkowski
Check out my webring: http://www.angelfire.com/nj/eglamkowski/null.html
"Guns cause violence like flies cause garbage." -Rich Loether
On Fri, 7 Aug 1998 10:47:08 George wrote:
>On Fri, 7 Aug 1998, Andrew Ritchie wrote:
>
>>I was wondering if there was a maximum number of bitvectors you can implement
>>into your MUD - the number 26 occured to me, as there is a letter which
>>corresponds to every mobile bitvector, and there are 26 letters in the
>>alphabet, but I thought this was a bit restrictive. If this is the case, does
>>anyone know how you could get around the problem? Alternatively, if this
>>isn't the case, could someone tell me whats the maximum number of bitvectors
>>you can implement, and why? Thanks for your time,
>
>32 normally, 64 if you change to 'long long'.
>
>abc...=26, ABC...=26, 123...=10, !@#..=more
>
>Just have to extend the function...
>
>--
>George Greer, greerga@circlemud.org | Genius may have its limitations, but
>http://mouse.van.ml.org/ (not done) | stupidity is not thus handicapped.
>http://www.van.ml.org/CircleMUD/ | -- Elbert Hubbard
Angelfire for your free web-based e-mail. http://www.angelfire.com
+------------------------------------------------------------+
| Ensure that you have read the CircleMUD Mailing List FAQ: |
| http://democracy.queensu.ca/~fletcher/Circle/list-faq.html |
+------------------------------------------------------------+
This archive was generated by hypermail 2b30 : 12/15/00 PST