Progeneric.Ptl.Utils

Class Numeric

java.lang.Object

Progeneric.Ptl.Utils.Numeric

public final class Numeric
extends java.lang.Object

Contains methods for performing basic numeric operations that are not in the java.lang.Math class.

Method Summary

Methods

Modifier and Type	Method and Description
static long	Arrangements(int n, int count) Calculates the number of possible combinations when n objects are taken count at a time, and then, expands each combination into all of its possible permutations.
static long	Combinations(int n, int count) Calculates the number of possible combinations when n objects are taken count at a time.
static long	Factorial(int n) Calculates the factorial of a specified number.
static int	Log2(int n) Finds the binary logarithm of a specified number.
static int	Log2(long n) Finds the binary logarithm of a specified number.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

Log2

public static int Log2(int n)

Finds the binary logarithm of a specified number.

Parameters:

n - A number whose binary logarithm is to be found.

Returns:

The binary logarithm of a specified number.

Log2

public static int Log2(long n)

Finds the binary logarithm of a specified number.

Parameters:

n - A number whose binary logarithm is to be found.

Returns:

The binary logarithm of a specified number.

Factorial

public static long Factorial(int n)

Calculates the factorial of a specified number.

Parameters:

n - The number whose factorial is to be calculated.

Returns:

The factorial of n.

Arrangements

public static long Arrangements(int n,
                int count)

Calculates the number of possible combinations when n objects are taken count at a time, and then, expands each combination into all of its possible permutations.

Parameters:

n - The number of objects to be arranged.

count - The number of objects to be taken at one time.

Returns:

The total number of arrangements of n objects taken count at a time.

Combinations

public static long Combinations(int n,
                int count)

Calculates the number of possible combinations when n objects are taken count at a time.

Parameters:

n - The number of objects to be combined.

count - The number of objects to be taken at one time.

Returns:

The total number of combinations of n objects taken count at a time.