Computes the lowest set bit (rightmost `1` bit) of a number. This function isolates the lowest set bit in the binary representation of `x`. It's used to navigate the Fenwick Tree by determining the next index to update or query. In a Fenwick Tree, operations like updating and querying use bitwise manipulation (via the lowbit function). These operations naturally align with 1-based indexing, mak
(x: usize)
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected