OPTIMIZATION BENCHMARKS: 32 BIT BITWISE AND

This example attempts to calculate the time required to perform bitwise AND between 32 bit numbers.

source compile sandbox issues? back to examples

SOURCE CODE ()

	CONST maxCounter = 20000

	CLS

	DIM originalValue1 AS WORD
	DIM originalValue2 AS WORD
	DIM targetValue AS WORD
	
	originalValue1 = &H55
	originalValue2 = &H11
	
	startTime = TIME
	
	counter = 0
	DO
		targetValue = originalValue1 AND originalValue2
		INC counter
		EXIT IF counter = maxCounter
	LOOP
	
	PRINT (TIME - startTime); " jiffy(s)"
	
	PRINT originalValue1;" AND ";originalValue2;" = ";targetValue

How to compile and run the example

The instructions here refer to compiling the example from the command line. For Microsoft Windows users we suggest using UGBASIC-IDE, which allows you to download and compile each single example with just one click.

Are instructions for your specific home computer / console missing? First of all, check if your computer is supported by clicking here. If so, since ugBASIC is a language which does not provide abstractions, it is possible that this example will not work on your target. If you think this is an issue, please click here.

Any problem?

If you have found a problem trying to run this example, if you think there is a bug or, more simply, you would like it to be improved, open an issue for this example on GitHub.
Thank you!

open an issue BACK TO EXAMPLES