[MrDeath537]

Thanks for the comments.

Quote:

Originally Posted by Double-O-Seven Very nice! //Edit: To the speed comparator above: This is no WTF. 8-bit and 32-bit is already built in in PAWN, 16-bit not. So 16-bit needs some calculations and this takes time. //Edit 2: Why is there a DBIT_VAR? pawn Код: #define Bit16_Get(%0,%1)                                                        \         (((DBITS_VAR=(%1)),DBITS_VAR&1)?(%0[(%1)/2]&0x0000FFFF):((%0[(%1)/2]>>>16)&0x0000FFFF)) You could just do this: pawn Код: #define Bit16_Get(%0,%1)                                                        \         ((((%1)&1)?(%0[(%1)/2]&0x0000FFFF):((%0[(%1)/2]>>>16)&0x0000FFFF)) //Edit 3: pawn Код: #define Bit16:%0<%1>                                                            \         %0[(%1)/2] I'm not sure, but maybe you should round the real array size up: pawn Код: #define Bit16:%0<%1>                                                            \         %0[((%1)+2)/2] // Round up here

If I didn't use DBITS_VAR, the compiler gives a warning because that's like doing:

pawn Код:

if (1 == 1)

EDIT: I added the round up. Thanks.

Quote:

Originally Posted by Anzipane! Nice, but I ran a speed test and the results are that your bit system is slower than the normal 32-bit array system. (Maybe I made some mistakes) Here's the script I used: http://pastebin.com/biN6NUC6 And the results are: Код: 8Bit: 115ms 16Bit: 768ms (wtf?) 32Bit: 107ms

There isn't support for 16-bit, like Double-O-Seven said. That's the reason of why it's slow.