def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_above_x(n_tables, starting_size)
hb = CountingHash(k, primes)
c = _LabelHash.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
hb = Hashbits(k, starting_size, n_tables)
c = _LabelHash.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_above_x(n_tables, starting_size)
c = _LabelHash.__new__(cls, k, primes)
c.primes = primes
return c
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_above_x(n_tables, starting_size)
c = _LabelHash.__new__(cls, k, primes)
c.primes = primes
return c
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_near_x(n_tables, starting_size)
hb = _CountingHash(k, primes)
c = _LabelHash.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
hb = Hashbits(k, starting_size, n_tables)
c = _LabelHash.__new__(cls, hb)
c.graph = hb
return c
