create the given directory - and all directories leading to it return true on success or if the directory already exists

Deallocate memory allocated by the buffer.

try to dequeue item. if no item found. wait upto timeout and try again Return true, if succeeded dequeue item, false otherwise

Check whether the running window manager is EWMH-compliant

restore orig sinks and level and delete the backtrace sink

Computes floor(n / 10^(kappa + 1)) (float)

Returns true iff x is divisible by pow(2, exp).

create new backtrace sink and move to it all our child sinks

try to enqueue and block if no room left

enqueue immediately. overrun oldest message in the queue if no room left.

return vector of key/value pairs from sequence of "K1=V1,K2=V2,.." "a=AAA,b=BBB,c=CCC,.." => {("a","AAA"),("b","BBB"),("c", "CCC"),...}

Return file size according to open FILE* object

Computes floor(log10(pow(2, e))) for e in [-1700, 1700] using the method from https://fmt.dev/papers/Grisu-Exact.pdf#page=5, section 3.4.

pop all items in the q and apply the given fun on each of them.

Unload used libraries (DLLs)

Returns a description fitting the specified XInput capabilities