Bit buckets

Here is the JavaScript code.

var bitLen1 = 5;
var numLen1 = 1;
var bucketsList1 = [];
console.log("Buckets:\n");
bitPos1 = 0;
while (bitPos1 != bitLen1) {
	console.log("\t2^"+bitPos1+" is "+numLen1+"\n");
	numLen1 *= 2;
	var bucketList1 = [];
	bucketsList1.push(bucketList1);
	bitPos1++;
	}
console.log("Numbers:\n");
numPos1 = 0;
while (numPos1 != numLen1) {
	var num1 = numPos1;
	var bits1 = "";
	bitPos1 = 0;
	while (bitPos1 != bitLen1) {
		bit1 = num1 % 2;
		num1 = Math.floor(num1 / 2);
		bits1 = "" + bit1 + bits1;
		if (bit1 == 1) {
			bucketList1 = bucketsList1[bitPos1];
			bucketList1.push(numPos1);
			}
		bitPos1++;
		}
	console.log("\t"+bits1+" "+numPos1+"\n");
	numPos1++;
	}
console.log("Bucket breakdown:\n");
numPos1 = 1;
bitPos1 = 0;
while (bitPos1 != bitLen1) {
	console.log("Bit "+bitPos1+" for 2^"+bitPos1+" as "+numPos1+" set for:\n");
	bucketList1 = bucketsList1[bitPos1];
	len1 = bucketList1.length;
	line1 = "";
	pos1 = 0;
	while (pos1 != len1) {
		num1 = bucketList1[pos1];
		nums1 = " " + num1;
		if (num1 < 10) {
			nums1 = " " + nums1;
			}
		line1 += " " + nums1;
		if ((pos1 % 4) == 3) {
			console.log("\t"+line1+"\n");
			line1 = "";
			}
		pos1++;
		}
	numPos1 *= 2;
	bitPos1++;
	}

Here is the output of the JavaScript code.

Buckets:

	2^0 is 1

	2^1 is 2

	2^2 is 4

	2^3 is 8

	2^4 is 16

Numbers:

	00000 0

	00001 1

	00010 2

	00011 3

	00100 4

	00101 5

	00110 6

	00111 7

	01000 8

	01001 9

	01010 10

	01011 11

	01100 12

	01101 13

	01110 14

	01111 15

	10000 16

	10001 17

	10010 18

	10011 19

	10100 20

	10101 21

	10110 22

	10111 23

	11000 24

	11001 25

	11010 26

	11011 27

	11100 28

	11101 29

	11110 30

	11111 31

Bucket breakdown:

Bit 0 for 2^0 as 1 set for:

	   1   3   5   7

	   9  11  13  15

	  17  19  21  23

	  25  27  29  31

Bit 1 for 2^1 as 2 set for:

	   2   3   6   7

	  10  11  14  15

	  18  19  22  23

	  26  27  30  31

Bit 2 for 2^2 as 4 set for:

	   4   5   6   7

	  12  13  14  15

	  20  21  22  23

	  28  29  30  31

Bit 3 for 2^3 as 8 set for:

	   8   9  10  11

	  12  13  14  15

	  24  25  26  27

	  28  29  30  31

Bit 4 for 2^4 as 16 set for:

	  16  17  18  19

	  20  21  22  23

	  24  25  26  27

	  28  29  30  31

Here is the PHP code.

<?php
$bitLen1 = 5;
$numLen1 = 1;
$bucketsList1 = array();
printf("Buckets:\n");
$bitPos1 = 0;
while ($bitPos1 != $bitLen1) {
	printf("\t2^%d is %d\n",$bitPos1,$numLen1);
	$numLen1 *= 2;
	$bucketList1 = array();
	array_push($bucketsList1,$bucketList1);
	$bitPos1++;
	}
printf("Numbers:\n");
$numPos1 = 0;
while ($numPos1 != $numLen1) {
	$num1 = $numPos1;
	$bits1 = "";
	$bitPos1 = 0;
	while ($bitPos1 != $bitLen1) {
		$bit1 = $num1 % 2;
		$num1 = intval($num1 / 2);
		$bits1 = "" . strval($bit1) . $bits1;
		if ($bit1 === 1) {
			$bucketList1 = $bucketsList1[$bitPos1];
			array_push($bucketList1,$numPos1);
			# PHP copies on assignment , updated bucketList1 needs reassigned
			$bucketsList1[$bitPos1] = $bucketList1;

			}
		$bitPos1++;
		}
	printf("\t%s %d\n",$bits1,$numPos1);
	$numPos1++;
	}
printf("Bucket breakdown:\n");
$numPos1 = 1;
$bitPos1 = 0;
while ($bitPos1 != $bitLen1) {
	printf("Bit %d for 2^%d as %d set for:\n",$bitPos1,$bitPos1,$numPos1);
	$bucketList1 = $bucketsList1[$bitPos1];
	$len1 = sizeof($bucketList1);
	$line1 = "";
	$pos1 = 0;
	while ($pos1 != $len1) {
		$num1 = $bucketList1[$pos1];
		$nums1 = " " . strval($num1);
		if ($num1 < 10) {
			$nums1 = " " . $nums1;
			}
		$line1 .= " " . $nums1;
		if (($pos1 % 4) === 3) {
			printf("\t%s\n",$line1);
			$line1 = "";
			}
		$pos1++;
		}
	$numPos1 *= 2;
	$bitPos1++;
	}
?>

Here is the output of the PHP code.

Buckets:
	2^0 is 1
	2^1 is 2
	2^2 is 4
	2^3 is 8
	2^4 is 16
Numbers:
	00000 0
	00001 1
	00010 2
	00011 3
	00100 4
	00101 5
	00110 6
	00111 7
	01000 8
	01001 9
	01010 10
	01011 11
	01100 12
	01101 13
	01110 14
	01111 15
	10000 16
	10001 17
	10010 18
	10011 19
	10100 20
	10101 21
	10110 22
	10111 23
	11000 24
	11001 25
	11010 26
	11011 27
	11100 28
	11101 29
	11110 30
	11111 31
Bucket breakdown:
Bit 0 for 2^0 as 1 set for:
	   1   3   5   7
	   9  11  13  15
	  17  19  21  23
	  25  27  29  31
Bit 1 for 2^1 as 2 set for:
	   2   3   6   7
	  10  11  14  15
	  18  19  22  23
	  26  27  30  31
Bit 2 for 2^2 as 4 set for:
	   4   5   6   7
	  12  13  14  15
	  20  21  22  23
	  28  29  30  31
Bit 3 for 2^3 as 8 set for:
	   8   9  10  11
	  12  13  14  15
	  24  25  26  27
	  28  29  30  31
Bit 4 for 2^4 as 16 set for:
	  16  17  18  19
	  20  21  22  23
	  24  25  26  27
	  28  29  30  31

Here is the Python code.

bitLen1 = 5
numLen1 = 1
bucketsList1 = []
print("Buckets:")
bitPos1 = 0
while bitPos1 != bitLen1:
	print("\t2^{0:d} is {1:d}".format(bitPos1,numLen1))
	numLen1 *= 2
	bucketList1 = []
	bucketsList1.append(bucketList1)
	bitPos1 += 1
print("Numbers:")
numPos1 = 0
while numPos1 != numLen1:
	num1 = numPos1
	bits1 = ""
	bitPos1 = 0
	while bitPos1 != bitLen1:
		bit1 = num1 % 2
		num1 = num1 / 2
		bits1 = "" + str(bit1) + bits1
		if bit1 == 1:
			bucketList1 = bucketsList1[bitPos1]
			bucketList1.append(numPos1)
		bitPos1 += 1
	print("\t{0:s} {1:d}".format(bits1,numPos1))
	numPos1 += 1
print("Bucket breakdown:")
numPos1 = 1
bitPos1 = 0
while bitPos1 != bitLen1:
	print("Bit {0:d} for 2^{1:d} as {2:d} set for:".format(bitPos1,bitPos1,numPos1))
	bucketList1 = bucketsList1[bitPos1]
	len1 = len(bucketList1)
	line1 = ""
	pos1 = 0
	while pos1 != len1:
		num1 = bucketList1[pos1]
		nums1 = " " + str(num1)
		if num1 < 10:
			nums1 = " " + nums1
		line1 += " " + nums1
		if (pos1 % 4) == 3:
			print("\t{0:s}".format(line1))
			line1 = ""
		pos1 += 1
	numPos1 *= 2
	bitPos1 += 1

Here is the output of the Python code.

Buckets:
	2^0 is 1
	2^1 is 2
	2^2 is 4
	2^3 is 8
	2^4 is 16
Numbers:
	0.00.00.00.00 0
	0.06250.1250.250.51 1
	0.1250.250.51.00 2
	0.18750.3750.751.51 3
	0.250.51.00.00 4
	0.31250.6251.250.51 5
	0.3750.751.51.00 6
	0.43750.8751.751.51 7
	0.51.00.00.00 8
	0.56251.1250.250.51 9
	0.6251.250.51.00 10
	0.68751.3750.751.51 11
	0.751.51.00.00 12
	0.81251.6251.250.51 13
	0.8751.751.51.00 14
	0.93751.8751.751.51 15
	1.00.00.00.00 16
	1.06250.1250.250.51 17
	1.1250.250.51.00 18
	1.18750.3750.751.51 19
	1.250.51.00.00 20
	1.31250.6251.250.51 21
	1.3750.751.51.00 22
	1.43750.8751.751.51 23
	1.51.00.00.00 24
	1.56251.1250.250.51 25
	1.6251.250.51.00 26
	1.68751.3750.751.51 27
	1.751.51.00.00 28
	1.81251.6251.250.51 29
	1.8751.751.51.00 30
	1.93751.8751.751.51 31
Bucket breakdown:
Bit 0 for 2^0 as 1 set for:
	   1   3   5   7
	   9  11  13  15
	  17  19  21  23
	  25  27  29  31
Bit 1 for 2^1 as 2 set for:
	   2   6  10  14
	  18  22  26  30
Bit 2 for 2^2 as 4 set for:
	   4  12  20  28
Bit 3 for 2^3 as 8 set for:
Bit 4 for 2^4 as 16 set for: