Referencia de la Clase GenHashTable

#include <genHashTable.H>

Métodos públicos estáticos
static int	nextPrimeIndex (unsigned long n)
static int	prevPrimeIndex (unsigned long n)

Atributos públicos estáticos
static const unsigned int	numPrimes = 28
	Number of primes saved in primeList array.
static const unsigned long	primeList []
	Array of prime numbers.
static const unsigned int	DefaultIndex = 0
	Default index in primeList array.
static const unsigned long	DefaultPrime
	Default prime number (this is primeList[DefaultIndex])

Descripción detallada

GenHashTable base class. Basic utilities for hash tables.

More than an abstract class, this class is a container for global definitions and functions that could be used for other classes implementing hash tables

Autor

Leandro Leon

Versión

1.0

Documentación de las funciones miembro

static int GenHashTable::nextPrimeIndex ( unsigned long  n )

inlinestatic

Searches in array primeList the next prime number immediately greater.

Parámetros

n	the base number. Result will be the next prime number immediately greater than n.

Devuelve

-1 if computation fails (n is greater than primeList[numPrimes-1]; the next prime number immediately greater than n otherwise

Hace referencia a numPrimes y primeList.

static int GenHashTable::prevPrimeIndex ( unsigned long  n )

inlinestatic

Searches in array primeList the previous prime number immediately lesser.

Parámetros

n	the base number. Result will be the previous prime number immediately lesser than n

Devuelve

-1 if computation fails (n is greater than primeList[numPrimes-1]; the previous prime number immediately greater than n otherwise

Hace referencia a numPrimes y primeList.

---

La documentación para esta clase fue generada a partir del siguiente fichero:

• genHashTable.H