Algorithms: Bit Manipulation

"use strict";
// Brian Kernighan Population Count in JavaScript
//
// PURPOSE
// The expression n AND (n-1) clears the lowest set bit. Repeating it counts the ones in a
// nonnegative integer without visiting zero bits individually.
//
// METHOD
// Clear one set bit per iteration and increment the counter. The loop stops exactly when all
// original set bits have been removed.
//
// COMPLEXITY
// O(k) iterations for k set bits and O(1) auxiliary space under fixed-width arithmetic.
//
// CONTRACT
// n must be nonnegative. Negative integers have different width/sign behavior between
// languages and are excluded.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// Node.js 18+: Int32Array inputs and workspaces provide compact integer storage. Automatic
// lengths and checked arithmetic reject values outside signed 32-bit. Invalid inputs or
// overflow throw RangeError.
//
// EXAMPLE
// Expected return: 0.
// Run: node example.js
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(valid) { if (!valid) throw new RangeError("invalid algorithm input"); }
function alg_checked(v) { if (!Number.isInteger(v) || v < -2147483648 || v > 2147483647) throw new RangeError("32-bit result overflow"); return v; }
function alg_add(a,b) { return alg_checked(a+b); }
function alg_sub(a,b) { return alg_checked(a-b); }
function alg_mul(a,b) { return alg_checked(a*b); }
function alg_size(n) { alg_require(Number.isInteger(n) && n>=0 && n<=4000000); return n; }

function population_count(n) {
    alg_require(Number.isInteger(n) && n >= -2147483648 && n <= 2147483647);
    alg_require((n >= 0));
    let count = 0;
    while ((n != 0)) {
        n = (n & alg_sub(n, 1));
        count = alg_add(count, 1);
    }
    return count;
}

let n = 0;
let result = population_count(n);
console.log(result);

// Brian Kernighan Population Count in Java
//
// PURPOSE
// The expression n AND (n-1) clears the lowest set bit. Repeating it counts the ones in a
// nonnegative integer without visiting zero bits individually.
//
// METHOD
// Clear one set bit per iteration and increment the counter. The loop stops exactly when all
// original set bits have been removed.
//
// COMPLEXITY
// O(k) iterations for k set bits and O(1) auxiliary space under fixed-width arithmetic.
//
// CONTRACT
// n must be nonnegative. Negative integers have different width/sign behavior between
// languages and are excluded.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// Java 17+: primitive int arrays, Arrays.binarySearch for LIS, and Math exact arithmetic.
// Invalid input throws IllegalArgumentException; arithmetic overflow throws
// ArithmeticException.
//
// EXAMPLE
// Expected return: 0.
// Run: javac AlgorithmExample.java && java AlgorithmExample
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

class AlgorithmExample {
    static void alg_require(boolean valid) { if (!valid) throw new IllegalArgumentException("invalid algorithm input"); }
    static int alg_size(int n) { alg_require(n>=0 && n<=4000000); return n; }

    static int population_count(int n) {
        alg_require((n >= 0));
        int count = 0;
        while ((n != 0)) {
            n = (n & Math.subtractExact(n, 1));
            count = Math.addExact(count, 1);
        }
        return count;
    }

    public static void main(String[] args) {
        int n = 0;
        int result = population_count(n);
        System.out.println(result);
    }
}