keel.Algorithms.Rule_Learning.Ripper

Class Utilities

java.lang.Object

keel.Algorithms.Rule_Learning.Ripper.Utilities

public class Utilities
extends java.lang.Object

Collection of auxiliar methods.

Since:

JDK1.2

Version:

1.2

Author:

Written by Alberto Fernández (University of Granada) 15/10/2008, Modified by Xavi Solé (La Salle, Ramón Llull University - Barcelona) 03/12/2008

Field Summary

Fields

Modifier and Type	Field and Description
static double	log2 The natural logarithm of 2.

Constructor Summary

Constructors

Constructor and Description
Utilities()

Method Summary

Modifier and Type	Method and Description
static double	log2(double a) Returns the logarithm of a for base 2.
static void	mergeSort(double[] theArray, int nElems) Mergesort algorithm for an array of long integers.
static void	mergeSort(long[] theArray, int nElems) Mergesort algorithm for an array of long integers.
static void	mergeSort(Pair[] theArray, int nElems) Mergesort algorithm for an array of Pairs.
static void	mergeSort(Trio[] theArray, int nElems) Mergesort algorithm for a vector of Trio.

Methods inherited from class java.lang.Object

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

Field Detail

log2

public static double log2

The natural logarithm of 2.

Constructor Detail

Utilities

public Utilities()

Method Detail

mergeSort

public static void mergeSort(long[] theArray,
                             int nElems)

Mergesort algorithm for an array of long integers.

Parameters:

theArray - long[] the Array to sort

nElems - int size of theArray

mergeSort

public static void mergeSort(double[] theArray,
                             int nElems)

Mergesort algorithm for an array of long integers.

Parameters:

theArray - double[] the Array to sort

nElems - int size of theArray

mergeSort

public static void mergeSort(Pair[] theArray,
                             int nElems)

Mergesort algorithm for an array of Pairs.

Parameters:

theArray - Pair[] the Array to sort

nElems - int size of theArray

mergeSort

public static void mergeSort(Trio[] theArray,
                             int nElems)

Mergesort algorithm for a vector of Trio.

Parameters:

theArray - Vector the Array to sort

nElems - int size of theArray

log2

public static double log2(double a)

Returns the logarithm of a for base 2.

Parameters:

a - a double

Returns:

the logarithm for base 2