If you want, you could use a
number other than 1, such as 23 or 127, which would equate to count = count + 23 or count =
count + -127 , respectively.
You could also perform other mathematical equations, such as division or multiplication, by substituting
the addition symbol for the relevant required operator.
Bitwise Operators
You do not want to get too involved in the discussion of bitwise operators as bitwise mathematics
venture beyond the scope of this book, however, it is important to know these operators and the
possibilities they can bring to your applications. When working through the examples in this part of the
chapter remember the Neko 31 - bit limit for integers and perhaps try to compile the examples in Flash
where necessary.
Bitwise mathematics involves moving, altering, and comparing the bits of a given value. For those who
do not know, bits are the basic building blocks of characters, numbers, and mathematical equations
within a computers memory. When discussing a simple equation such as:
15 + 20 = 35
You are really saying:
00000000 00000000 00000000 00001111
+
00000000 00000000 00000000 00010100
=
00000000 00000000 00000000 00100011
Each of the previous lines of 1 ??™ s and 0 ??™ s form a pattern that represents the construction of a 32 - bit integer.
Pages:
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154