still, the question that brought me here, a bitwise AND that can retrieve flags from my integer – anyone any clues?

“for my soon-to-be-launched website”
Look forward to that,

and…

“A digital watch using Excel cells for display ? Wow. Only men do things like that”

…. Abso-bloodly-lutely!

I use AND a lot to store/hide multiple TRUE/FALSE or YES/NO settings in a single Long variable. Not complicated, extremely useful. Writing a tutorial on it these days for my soon-to-be-launched website.

A digital watch using Excel cells for display ? Wow. Only men do things like that

Juan Pablo has a nice digital clock that I hope to post later this week. It’s a good stepping stone to where I want to go.

I studied 2′s comp for my A-level computers, never thought i’d see the day when it would crop up agian. Best of all was Reverse Polish Notation, kinda makes sense, see, http://www-stone.ch.cam.ac.uk/documentation/rrf/rpn.html

Hex and Oct arithmetic where a brigde to far for me i’m afraid.

Intresting topic, i dont think i would ever use it, but you just don’t know – Any luck with that scoreboard matrix/light thing?

“There are 10 kinds of people. Those who read binary and those who don’t.”

Jonathon – what’s the difference?

Here’s an explanation lifted from www4.wittenberg.edu

Two’s complement representation is a convention used to represent signed binary integers. In binary representation (positional notation), each bit has a weight which a power of two. The weights increase from right to left. For example

011101 = 0 x 2^5 + 1 x 2^4 + 1 x 2^3 + 1 x 2^2 + 0 x 2^1 + 1 x 2^0 = 16 + 8 + 4 + 1 = 29

The same positional notation is used with decimal numbers, except using powers of 10.

With two’s complement notation, all integers are represented using a fixed number of bits with the leftmost bit given a negative weight. So 100011 would be

100011 = -1 x 2^5 + 0 x 2^4 + 0 x 2^3 + 0 x 2^2 + 1 x 2^1 + 1 x 2^ 0 = -32 + 2 + 1 = -29

There are a number of nice features to two’s complement representation. The first is that the normal rules used in the addition of (unsigned) binary integers still work (throw away any bit carried out of the left-most position). Second, it’s easy to negate any integers: simply complement each bit and add 1 to the result (011101 complemented is 100010 plus 1 is 100011; 100011 complemented is 011100 plus 1 is 011101). Finally, the left most bit tells you if the integer is positive (0) or negative (1).

The range of integers and the ordering does change. For example, four bits can represent the unsigned integers values 0 (0000) through 15 (1111). However, four bit two’s complement representation represents the signed values – 8 through +7 ordered as below

1000 1001 1010 1011 1100 1101 1110 1111 0000 0001 0010 0011 0100 0101 0110 0111
-8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7

I now know why the negative value is 1 larger than the positive.

2. It’s not necessary to use the ^ operator in SplitBit above. Instead, put

lPower = 1

before the For i loop, and

lPower = lPower * 2

at the end of the loop.