moab::TupleList Class Reference

#include <TupleList.hpp>

List of all members.

Classes
class	buffer
struct	SortData
Public Member Functions
	TupleList (uint mi, uint ml, uint mul, uint mr, uint max)
	TupleList ()
	~TupleList ()
void	initialize (uint mi, uint ml, uint mul, uint mr, uint max)
ErrorCode	resize (uint max)
ErrorCode	sort (uint key, TupleList::buffer *buf)
void	reset ()
void	reserve ()
int	find (unsigned int key_num, sint value)
int	find (unsigned int key_num, slong value)
int	find (unsigned int key_num, ulong value)
int	find (unsigned int key_num, realType value)
sint	get_sint (unsigned int index, unsigned int m)
slong	get_int (unsigned int index, unsigned int m)
ulong	get_ulong (unsigned int index, unsigned int m)
realType	get_double (unsigned int index, unsigned int m)
ErrorCode	get (unsigned int index, const sint *&sp, const slong *&ip, const ulong *&lp, const realType *&dp)
unsigned int	push_back (sint *sp, slong *ip, ulong *lp, realType *dp)
void	enableWriteAccess ()
void	disableWriteAccess ()
void	getTupleSize (uint &mi_out, uint &ml_out, uint &mul_out, uint &mr_out) const
void	set_n (uint n_in)
uint	get_n () const
uint	get_max () const
bool	get_writeEnabled () const
uint	inc_n ()
void	print (const char *) const
Public Attributes
sint *	vi_wr
slong *	vl_wr
ulong *	vul_wr
realType *	vr_wr
const sint *	vi_rd
slong *	vl_rd
ulong *	vul_rd
realType *	vr_rd
Private Types
typedef uint	Index
Private Member Functions
void	permute (uint *perm, void *work)
Static Private Member Functions
template<class Value >
static Value	radix_count (const Value *A, const Value *end, Index stride, Index count[DIGITS][DIGIT_VALUES])
static void	radix_offsets (Index *c)
template<class Value >
static unsigned	radix_zeros (Value bitorkey, Index count[DIGITS][DIGIT_VALUES], unsigned *shift, Index **offsets)
template<class Value >
static void	radix_index_pass_b (const Value *A, Index n, Index stride, unsigned sh, Index *off, SortData< Value > *out)
template<class Value >
static void	radix_index_pass_m (const SortData< Value > *src, const SortData< Value > *end, unsigned sh, Index *off, SortData< Value > *out)
template<class Value >
static void	radix_index_pass_e (const SortData< Value > *src, const SortData< Value > *end, unsigned sh, Index *off, Index *out)
template<class Value >
static void	radix_index_pass_be (const Value *A, Index n, Index stride, unsigned sh, Index *off, Index *out)
template<class Value >
static void	radix_index_sort (const Value *A, Index n, Index stride, Index *idx, SortData< Value > *work)
template<class Value >
static void	merge_index_sort (const Value *A, const Index An, Index stride, Index *idx, SortData< Value > *work)
template<class Value >
static void	index_sort (const Value *A, Index n, Index stride, Index *idx, SortData< Value > *work)
Private Attributes
uint	mi
uint	ml
uint	mul
uint	mr
uint	n
uint	max
sint *	vi
slong *	vl
ulong *	vul
realType *	vr
int	last_sorted
bool	writeEnabled

---

Detailed Description

Examples:

CrystalRouterExample.cpp.

Definition at line 102 of file TupleList.hpp.

---

Member Typedef Documentation

typedef uint moab::TupleList::Index [private]

Definition at line 329 of file TupleList.hpp.

---

Constructor & Destructor Documentation

moab::TupleList::TupleList	(	uint	mi,
		uint	ml,
		uint	mul,
		uint	mr,
		uint	max
	)

Constructor that takes all parameters and initializes the TupleList

Definition at line 66 of file TupleList.cpp.

{
  vi = NULL;
  vl = NULL;
  vul = NULL;
  vr = NULL;
  initialize(p_mi, p_ml, p_mul, p_mr, p_max);
}

moab::TupleList::TupleList

(

)

Default constructor (Note: TupleList must be initialized before use!)

Definition at line 75 of file TupleList.cpp.

{
  vi = NULL;
  vl = NULL;
  vul = NULL;
  vr = NULL;
  disableWriteAccess();
}

moab::TupleList::~TupleList

(

)

[inline]

Definition at line 159 of file TupleList.hpp.

{ reset(); };

---

Member Function Documentation

void moab::TupleList::disableWriteAccess

(

)

Definition at line 438 of file TupleList.cpp.

{
  writeEnabled = false;
  vi_wr = NULL;
  vl_wr = NULL;
  vul_wr = NULL;
  vr_wr = NULL;
}

void moab::TupleList::enableWriteAccess

(

)

Examples:

CrystalRouterExample.cpp.

Definition at line 428 of file TupleList.cpp.

{
  writeEnabled = true;
  last_sorted = -1;
  vi_wr = vi;
  vl_wr = vl;
  vul_wr = vul;
  vr_wr = vr;
}

int moab::TupleList::find	(	unsigned int	key_num,
		sint	value
	)

Finds index of the tuple containing 'value' at the key_numth index of said tuple; return -1 if key_num is out of bounds or if 'value' not found Uses binary search if TupleList is sorted by the key_numth field, seqential otherwise (very slow for large TupleLists; please sort before you search)

param key_num index of the tuple where to search for value param value value to search for at the given key_num return the index of the tuple that contains value

Definition at line 247 of file TupleList.cpp.

{
  ulong uvalue = (ulong) value;
  if (!(key_num > mi))
  {
    // Binary search: only if the tuple_list is sorted
    if (last_sorted == (int) key_num)
    {
      int lb = 0, ub = n, index; // lb=lower bound, ub=upper bound, index=mid
      for (; lb <= ub;)
      {
        index = (lb + ub) / 2;
        if (vi[index * mi + key_num] == (long) uvalue)
          return index;
        else if (vi[index * mi + key_num] > (long) uvalue)
          ub = index - 1;
        else if (vi[index * mi + key_num] < (long) uvalue)
          lb = index + 1;
      }
    }
    else
    {
      // Sequential search: if tuple_list is not sorted
      for (long index = 0; index < n; index++)
      {
        if (vi[index * mi + key_num] == (long) uvalue)
          return index;
      }
    }
  }
  return -1; // If the value wasn't present or an invalid key was given
}

int moab::TupleList::find	(	unsigned int	key_num,
		slong	value
	)

Definition at line 280 of file TupleList.cpp.

{
  ulong uvalue = (ulong) value;
  if (!(key_num > ml))
  {
    if (last_sorted - mi == key_num)
    {
      int lb = 0, ub = n, index; // lb=lower bound, ub=upper bound, index=mid
      for (; lb <= ub;)
      {
        index = (lb + ub) / 2;
        if (vl[index * ml + key_num] == (long) uvalue)
          return index;
        else if (vl[index * ml + key_num] > (long) uvalue)
          ub = index - 1;
        else if (vl[index * ml + key_num] < (long) uvalue)
          lb = index + 1;
      }
    }
    else
    {
      // Sequential search: if tuple_list is not sorted
      for (uint index = 0; index < n; index++)
      {
        if (vl[index * ml + key_num] == (long) uvalue)
          return index;
      }
    }
  }
  return -1; // If the value wasn't present or an invalid key was given
}

int moab::TupleList::find	(	unsigned int	key_num,
		ulong	value
	)

Definition at line 312 of file TupleList.cpp.

{
  if (!(key_num > mul))
  {
    if (last_sorted - mi - ml == key_num)
    {
      int lb = 0, ub = n - 1, index; // lb=lower bound, ub=upper bound, index=mid
      for (; lb <= ub;)
      {
        index = (lb + ub) / 2;
        if (vul[index * mul + key_num] == value)
          return index;
        else if (vul[index * mul + key_num] > value)
          ub = index - 1;
        else if (vul[index * mul + key_num] < value)
          lb = index + 1;
      }
    }
    else
    {
      // Sequential search: if tuple_list is not sorted
      for (uint index = 0; index < n; index++)
      {
        if (vul[index * mul + key_num] == value)
          return index;
      }
    }
  }
  return -1; // If the value wasn't present or an invalid key was given
}

int moab::TupleList::find	(	unsigned int	key_num,
		realType	value
	)

Definition at line 343 of file TupleList.cpp.

{
  if (!key_num > mr)
  {
    // Sequential search: TupleList cannot be sorted by reals
    for (uint index = 0; index < n; index++)
    {
      if (vr[index * mr + key_num] == value)
        return index;
    }
  }
  return -1; // If the value wasn't present or an invalid key was given
}

ErrorCode moab::TupleList::get	(	unsigned int	index,
		const sint *&	sp,
		const slong *&	ip,
		const ulong *&	lp,
		const realType *&	dp
	)

get pointers to the data for the index'th tuple; ptr is NULL if that type is not part of this tuple

param index index of the tuple needed param *&sp, *&ip, *&lp, *&dp pointers to each piece of the tuple

Definition at line 385 of file TupleList.cpp.

{
  if (index <= n)
  {
    if (mi)
      *&sp = &vi[index * mi];
    else
      *&sp = NULL;
    if (ml)
      *&ip = &vl[index * ml];
    else
      *&ip = NULL;
    if (mul)
      *&lp = &vul[index * mul];
    else
      *&lp = NULL;
    if (mr)
      *&dp = &vr[index * mr];
    else
      *&dp = NULL;

    return MB_SUCCESS;
  }
  return MB_FAILURE;
}

realType moab::TupleList::get_double	(	unsigned int	index,
		unsigned int	m
	)

Definition at line 378 of file TupleList.cpp.

{
  if (mr > m && n > index)
    return vr[index * mr + m];
  return 0;
}

slong moab::TupleList::get_int	(	unsigned int	index,
		unsigned int	m
	)

Definition at line 364 of file TupleList.cpp.

{
  if (ml > m && n > index)
    return vl[index * ml + m];
  return 0;
}

uint moab::TupleList::get_max

(

)

const [inline]

Definition at line 407 of file TupleList.hpp.

{ return max; }

uint moab::TupleList::get_n

(

)

const [inline]

Examples:

CrystalRouterExample.cpp.

Definition at line 408 of file TupleList.hpp.

{ return n; }

sint moab::TupleList::get_sint	(	unsigned int	index,
		unsigned int	m
	)

get the mth number of return type in the index'th tuple returns 0 if m or index is out of bounds

param index index of the tuple within the TupleList param m index of the value within the tuple return the value at the given position

Definition at line 357 of file TupleList.cpp.

{
  if (mi > m && n > index)
    return vi[index * mi + m];
  return 0;
}

ulong moab::TupleList::get_ulong	(	unsigned int	index,
		unsigned int	m
	)

Definition at line 371 of file TupleList.cpp.

{
  if (mul > m && n > index)
    return vul[index * mul + m];
  return 0;
}

bool moab::TupleList::get_writeEnabled

(

)

const [inline]

Definition at line 409 of file TupleList.hpp.

{ return writeEnabled; }

void moab::TupleList::getTupleSize	(	uint &	mi_out,
		uint &	ml_out,
		uint &	mul_out,
		uint &	mr_out
	)		const

Definition at line 447 of file TupleList.cpp.

{
  mi_out = mi;
  ml_out = ml;
  mul_out = mul;
  mr_out = mr;
}

uint moab::TupleList::inc_n

(

)

Examples:

CrystalRouterExample.cpp.

Definition at line 456 of file TupleList.cpp.

{
  //Check for direct write access
  if (!writeEnabled)
  {
    enableWriteAccess();
  }
  n++;
  return n;
}

template<class Value >

void moab::TupleList::index_sort	(	const Value *	A,
		Index	n,
		Index	stride,
		Index *	idx,
		SortData< Value > *	work
	)		[static, private]

Definition at line 834 of file TupleList.cpp.

{
  if (n < DIGIT_VALUES)
  {
    if (n == 0)
      return;
    if (n == 1)
      *idx = 0;
    else
      merge_index_sort(A, n, stride, idx, work);
  }
  else
    radix_index_sort(A, n, stride, idx, work);
}

void moab::TupleList::initialize	(	uint	mi,
		uint	ml,
		uint	mul,
		uint	mr,
		uint	max
	)

Initializes the starting memory to be used by the TupleList Note: TupleLists must be initialized before they can be used

param mi number of signed ints in each tuple param ml number of long ints in each tuple param mul number of unsigned long ints in each tuple param mr number of reals in each tuple param max starting capacity of max tuples in the TupleList

Examples:

CrystalRouterExample.cpp.

Definition at line 85 of file TupleList.cpp.

{
  this->n = 0;
  this->max = p_max;
  this->mi = p_mi;
  this->ml = p_ml;
  this->mul = p_mul;
  this->mr = p_mr;
  size_t sz;

  if (max * mi > 0)
  {
    sz = max * mi * sizeof(sint);
    void *resi = malloc(sz);
    if (!resi && max * mi > 0)
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
    vi = (sint*) resi;
  }
  else
    vi = NULL;
  if (max * ml > 0)
  {
    sz = max * ml * sizeof(slong);
    void *resl = malloc(sz);
    if (!resl && max * ml > 0)
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
    vl = (slong*) resl;
  }
  else
    vl = NULL;
  if (max * mul > 0)
  {
    sz = max * mul * sizeof(ulong);
    void *resu = malloc(sz);
    if (!resu && max * mul > 0)
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
    vul = (ulong*) resu;
  }
  else
    vul = NULL;
  if (max * mr > 0)
  {
    sz = max * mr * sizeof(realType);
    void *resr = malloc(sz);
    if (!resr && max * ml > 0)
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
    vr = (realType*) resr;
  }
  else
    vr = NULL;

  //Begin with write access disabled
  this->disableWriteAccess();

  //Set read variables
  vi_rd = vi;
  vl_rd = vl;
  vul_rd = vul;
  vr_rd = vr;
}

template<class Value >

void moab::TupleList::merge_index_sort	(	const Value *	A,
		const Index	An,
		Index	stride,
		Index *	idx,
		SortData< Value > *	work
	)		[static, private]

Definition at line 733 of file TupleList.cpp.

{
  SortData<Value> * const buf[2] = { work + An, work };
  Index n = An, base = -n, odd = 0, c = 0, b = 1;
  Index i = 0;
  for (;;)
  {
    SortData<Value> *p;
    if ((c & 1) == 0)
    {
      base += n, n += (odd & 1), c |= 1, b ^= 1;
      while (n > 3)
        odd <<= 1, odd |= (n & 1), n >>= 1, c <<= 1, b ^= 1;
    }
    else
      base -= n - (odd & 1), n <<= 1, n -= (odd & 1), odd >>= 1, c >>= 1;
    if (c == 0)
      break;
    p = buf[b] + base;
    if (n == 2)
    {
      Value v[2];
      v[0] = *A, A += stride, v[1] = *A, A += stride;
      if (v[1] < v[0])
        p[0].v = v[1], p[0].i = i + 1, p[1].v = v[0], p[1].i = i;
      else
        p[0].v = v[0], p[0].i = i, p[1].v = v[1], p[1].i = i + 1;
      i += 2;
    }
    else if (n == 3)
    {
      Value v[3];
      v[0] = *A, A += stride, v[1] = *A, A += stride, v[2] = *A, A += stride;
      if (v[1] < v[0])
      {
        if (v[2] < v[1])
          p[0].v = v[2], p[1].v = v[1], p[2].v = v[0], p[0].i = i + 2, p[1].i =
              i + 1, p[2].i = i;
        else
        {
          if (v[2] < v[0])
            p[0].v = v[1], p[1].v = v[2], p[2].v = v[0], p[0].i = i + 1, p[1].i =
                i + 2, p[2].i = i;
          else
            p[0].v = v[1], p[1].v = v[0], p[2].v = v[2], p[0].i = i + 1, p[1].i =
                i, p[2].i = i + 2;
        }
      }
      else
      {
        if (v[2] < v[0])
          p[0].v = v[2], p[1].v = v[0], p[2].v = v[1], p[0].i = i + 2, p[1].i =
              i, p[2].i = i + 1;
        else
        {
          if (v[2] < v[1])
            p[0].v = v[0], p[1].v = v[2], p[2].v = v[1], p[0].i = i, p[1].i = i
                + 2, p[2].i = i + 1;
          else
            p[0].v = v[0], p[1].v = v[1], p[2].v = v[2], p[0].i = i, p[1].i = i
                + 1, p[2].i = i + 2;
        }
      }
      i += 3;
    }
    else
    {
      const Index na = n >> 1, nb = (n + 1) >> 1;
      const SortData<Value> *ap = buf[b ^ 1] + base, *ae = ap + na;
      SortData<Value> *bp = p + na, *be = bp + nb;
      for (;;)
      {
        if (bp->v < ap->v)
        {
          *p++ = *bp++;
          if (bp != be)
            continue;
          do
            *p++ = *ap++;
          while (ap != ae);
          break;
        }
        else
        {
          *p++ = *ap++;
          if (ap == ae)
            break;
        }
      }
    }
  }
  {
    const SortData<Value> *p = buf[0], *pe = p + An;
    do
      *idx++ = (p++)->i;
    while (p != pe);
  }
}

void moab::TupleList::permute	(	uint *	perm,
		void *	work
	)		[private]

Definition at line 505 of file TupleList.cpp.

{
  const unsigned int_size = mi * sizeof(sint), long_size = ml * sizeof(slong),
      ulong_size = mul * sizeof(ulong), real_size = mr * sizeof(realType);
  if (mi)
  {
    uint *p = perm, *pe = p + n;
    char *sorted = (char *) work;
    while (p != pe)
      memcpy((void *) sorted, &vi[mi * (*p++)], int_size), sorted += int_size;
    memcpy(vi, work, int_size * n);
  }
  if (ml)
  {
    uint *p = perm, *pe = p + n;
    char *sorted = (char *) work;
    while (p != pe)
      memcpy((void *) sorted, &vl[ml * (*p++)], long_size), sorted += long_size;
    memcpy(vl, work, long_size * n);
  }
  if (mul)
  {
    uint *p = perm, *pe = p + n;
    char *sorted = (char *) work;
    while (p != pe)
      memcpy((void *) sorted, &vul[mul * (*p++)], ulong_size), sorted +=
          ulong_size;
    memcpy(vul, work, ulong_size * n);
  }
  if (mr)
  {
    uint *p = perm, *pe = p + n;
    char *sorted = (char *) work;
    while (p != pe)
      memcpy((void *) sorted, &vr[mr * (*p++)], real_size), sorted += real_size;
    memcpy(vr, work, real_size * n);
  }
}

void moab::TupleList::print

(

const char *

name

)

const

Examples:

CrystalRouterExample.cpp.

Definition at line 477 of file TupleList.cpp.

{
  std::cout << "Printing Tuple " << name << "===================" << std::endl;
  unsigned long i = 0, l = 0, ul = 0, r = 0;
  for (uint k = 0; k < n; k++)
  {
    for (uint j = 0; j < mi; j++)
    {
      std::cout << vi[i++] << " | ";
    }
    for (uint j = 0; j < ml; j++)
    {
      std::cout << vl[l++] << " | ";
    }
    for (uint j = 0; j < mul; j++)
    {
      std::cout << vul[ul++] << " | ";
    }
    for (uint j = 0; j < mr; j++)
    {
      std::cout << vr[r++] << " | ";
    }
    std::cout << std::endl;
  }
  std::cout << "=======================================" << std::endl
      << std::endl;
}

unsigned int moab::TupleList::push_back	(	sint *	sp,
		slong *	ip,
		ulong *	lp,
		realType *	dp
	)

push back a new tuple on the TupleList;

param *sp pointer to a list of signed ints param *ip pointer to a list of signed longs param *lp pointer to a list of unsigned longs param *dp pointer to a list of reals return index of that tuple

Definition at line 412 of file TupleList.cpp.

{
  reserve();
  if (mi)
    memcpy(&vi[mi * (n - 1)], sp, mi * sizeof(sint));
  if (ml)
    memcpy(&vl[ml * (n - 1)], ip, ml * sizeof(long));
  if (mul)
    memcpy(&vul[mul * (n - 1)], lp, mul * sizeof(ulong));
  if (mr)
    memcpy(&vr[mr * (n - 1)], dp, mr * sizeof(realType));

  last_sorted = -1;
  return n - 1;
}

template<class Value >

Value moab::TupleList::radix_count	(	const Value *	A,
		const Value *	end,
		Index	stride,
		Index	count[DIGITS][DIGIT_VALUES]
	)		[static, private]

Definition at line 599 of file TupleList.cpp.

{
  Value bitorkey = 0;
  memset(count, 0, COUNT_SIZE * sizeof(Index));
  do
  {
    Value val = *A;
    bitorkey |= val;
    COUNT_DIGIT_64(DIGITS, 0);
    // above macro expands to:
    //if(DIGITS> 0) count[ 0][val&DIGIT_MASK]++, val>>=DIGIT_BITS;
    //if(DIGITS> 1) count[ 1][val&DIGIT_MASK]++, val>>=DIGIT_BITS;
    //  ...
    //if(DIGITS>63) count[63][val&DIGIT_MASK]++, val>>=DIGIT_BITS;

  } while (A += stride, A != end);
  return bitorkey;
}

template<class Value >

void moab::TupleList::radix_index_pass_b	(	const Value *	A,
		Index	n,
		Index	stride,
		unsigned	sh,
		Index *	off,
		SortData< Value > *	out
	)		[static, private]

Definition at line 651 of file TupleList.cpp.

{
  Index i = 0;
  do
  {
    Value v = *A;
    SortData<Value> *d = &out[off[(v >> sh) & DIGIT_MASK]++];
    d->v = v, d->i = i++;
  } while (A += stride, i != n);
}

template<class Value >

void moab::TupleList::radix_index_pass_be	(	const Value *	A,
		Index	n,
		Index	stride,
		unsigned	sh,
		Index *	off,
		Index *	out
	)		[static, private]

Definition at line 684 of file TupleList.cpp.

{
  Index i = 0;
  do
    out[off[(*A >> sh) & DIGIT_MASK]++] = i++;
  while (A += stride, i != n);
}

template<class Value >

void moab::TupleList::radix_index_pass_e	(	const SortData< Value > *	src,
		const SortData< Value > *	end,
		unsigned	sh,
		Index *	off,
		Index *	out
	)		[static, private]

Definition at line 675 of file TupleList.cpp.

{
  do
    out[off[(src->v >> sh) & DIGIT_MASK]++] = src->i;
  while (++src != end);
}

template<class Value >

void moab::TupleList::radix_index_pass_m	(	const SortData< Value > *	src,
		const SortData< Value > *	end,
		unsigned	sh,
		Index *	off,
		SortData< Value > *	out
	)		[static, private]

Definition at line 664 of file TupleList.cpp.

{
  do
  {
    SortData<Value> *d = &out[off[(src->v >> sh) & DIGIT_MASK]++];
    d->v = src->v, d->i = src->i;
  } while (++src != end);
}

template<class Value >

void moab::TupleList::radix_index_sort	(	const Value *	A,
		Index	n,
		Index	stride,
		Index *	idx,
		SortData< Value > *	work
	)		[static, private]

Definition at line 694 of file TupleList.cpp.

{
  Index count[DIGITS][DIGIT_VALUES];
  Value bitorkey = radix_count(A, A + n * stride, stride, count);
  unsigned shift[DIGITS];
  Index *offsets[DIGITS];
  unsigned digits = radix_zeros(bitorkey, count, shift, offsets);
  if (digits == 0)
  {
    Index i = 0;
    do
      *idx++ = i++;
    while (i != n);
  }
  else if (digits == 1)
  {
    radix_index_pass_be(A, n, stride, shift[0], offsets[0], idx);
  }
  else
  {
    SortData<Value> *src, *dst;
    unsigned d;
    if ((digits & 1) == 0)
      dst = work, src = dst + n;
    else
      src = work, dst = src + n;
    radix_index_pass_b(A, n, stride, shift[0], offsets[0], src);
    for (d = 1; d != digits - 1; ++d)
    {
      SortData<Value> *t;
      radix_index_pass_m(src, src + n, shift[d], offsets[d], dst);
      t = src, src = dst, dst = t;
    }
    radix_index_pass_e(src, src + n, shift[d], offsets[d], idx);
  }
}

void moab::TupleList::radix_offsets

(

Index *

c

)

[static, private]

Definition at line 627 of file TupleList.cpp.

{
  Index sum = 0, t, *ce = c + DIGIT_VALUES;
  do
    t = *c, *c++ = sum, sum += t;
  while (c != ce);
}

template<class Value >

unsigned moab::TupleList::radix_zeros	(	Value	bitorkey,
		Index	count[DIGITS][DIGIT_VALUES],
		unsigned *	shift,
		Index **	offsets
	)		[static, private]

Definition at line 636 of file TupleList.cpp.

{
  unsigned digits = 0, sh = 0;
  Index *c = &count[0][0];
  do
  {
    if (bitorkey & DIGIT_MASK)
      *shift++ = sh, *offsets++ = c, ++digits, radix_offsets(c);
  } while (bitorkey >>= DIGIT_BITS,sh += DIGIT_BITS,c += DIGIT_VALUES,sh
      != VALUE_BITS);
  return digits;
}

void moab::TupleList::reserve

(

)

Adds one to the total number of in-use tuples and resizes if necessary

Definition at line 237 of file TupleList.cpp.

{
  n++;
  while (n > max)
    resize((max ? max + max / 2 + 1 : 2));
  last_sorted = -1;
}

void moab::TupleList::reset

(

)

Frees all allocated memory in use by the TupleList

Definition at line 216 of file TupleList.cpp.

{
  //free up the pointers
  free(vi);
  free(vl);
  free(vul);
  free(vr);
  //Set them all to null
  vr = NULL;
  vi = NULL;
  vul = NULL;
  vl = NULL;
  //Set the read and write pointers to null
  disableWriteAccess();
  vi_rd = NULL;
  vl_rd = NULL;
  vul_rd = NULL;
  vr_rd = NULL;
}

ErrorCode moab::TupleList::resize

(

uint

max

)

Resizes the TupleList to a new max

param max the new max capacity of the TupleList

Definition at line 148 of file TupleList.cpp.

{
  this->max = maxIn;
  size_t sz;

  if (vi || (max * mi > 0))
  {
    sz = max * mi * sizeof(sint);
    void *resi = realloc(vi, sz);
    if (!resi && max * mi > 0)
    {
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
      return moab::MB_MEMORY_ALLOCATION_FAILED;
    }
    vi = (sint*) resi;
  }
  if (vl || (max * ml > 0))
  {
    sz = max * ml * sizeof(slong);
    void *resl = realloc(vl, sz);
    if (!resl && max * ml > 0)
    {
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
      return moab::MB_MEMORY_ALLOCATION_FAILED;
    }
    vl = (slong*) resl;
  }
  if (vul || (max * mul > 0))
  {
    sz = max * mul * sizeof(ulong);
    void *resu = realloc(vul, sz);
    if (!resu && max * mul > 0)
    {
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
      return moab::MB_MEMORY_ALLOCATION_FAILED;
    }
    vul = (ulong*) resu;
  }
  if (vr || (max * mr > 0))
  {
    sz = max * mr * sizeof(realType);
    void *resr = realloc(vr, sz);
    if (!resr && max * mr > 0)
    {
      fail("%s: allocation of %d bytes failed\n", __FILE__, (int) sz);
      return moab::MB_MEMORY_ALLOCATION_FAILED;
    }
    vr = (realType*) resr;
  }

  //Set read variables
  vi_rd = vi;
  vl_rd = vl;
  vul_rd = vul;
  vr_rd = vr;

  //Set the write variables if necessary
  if (writeEnabled)
  {
    vi_wr = vi;
    vl_wr = vl;
    vul_wr = vul;
    vr_wr = vr;
  }
  return moab::MB_SUCCESS;
}

void moab::TupleList::set_n

(

uint

n_in

)

Definition at line 467 of file TupleList.cpp.

{
  //Check for direct write access;
  if (!writeEnabled)
  {
    enableWriteAccess();
  }
  n = n_in;
}

ErrorCode moab::TupleList::sort	(	uint	key,
		TupleList::buffer *	buf
	)

Sorts the TupleList by 'key' if key<mi: key represents the key'th index in vi if mi<key<ml: key represents the (key-mi)'th index in vl if ml<key<mul: key represents the (key-mi-ml)'th index in vul

param key index to be sorted by param *buf buffer space used for sorting

Definition at line 546 of file TupleList.cpp.

{
  const unsigned int_size = mi * sizeof(sint);
  const unsigned long_size = ml * sizeof(slong);
  const unsigned ulong_size = mul * sizeof(ulong);
  const unsigned real_size = mr * sizeof(realType);
  const unsigned width = umax_2(umax_2(int_size,long_size),
      umax_2(ulong_size,real_size));
  const unsigned data_size =
      key >= mi ? sizeof(SortData<long> ) : sizeof(SortData<uint> );

  uint work_min = n * umax_2(2*data_size,sizeof(sint)+width);
  uint *work;
  buf->buffer_reserve(work_min);
  work = (uint *) buf->ptr;
  if (key < mi)
    index_sort((uint *) &vi[key], n, mi, work, (SortData<uint>*) work);
  else if (key < mi + ml)
    index_sort((long*) &vl[key - mi], n, ml, work, (SortData<long>*) work);
  else if (key < mi + ml + mul)
    index_sort((ulong*) &vul[key - mi - ml], n, mul, work,
        (SortData<ulong>*) work);
  else
    return MB_NOT_IMPLEMENTED;

  permute(work, work + n);

  if (!writeEnabled)
    last_sorted = key;
  return MB_SUCCESS;
}

---

Member Data Documentation

int moab::TupleList::last_sorted [private]

Definition at line 324 of file TupleList.hpp.

uint moab::TupleList::max [private]

Definition at line 314 of file TupleList.hpp.

uint moab::TupleList::mi [private]

Definition at line 313 of file TupleList.hpp.

uint moab::TupleList::ml [private]

Definition at line 313 of file TupleList.hpp.

uint moab::TupleList::mr [private]

Definition at line 313 of file TupleList.hpp.

uint moab::TupleList::mul [private]

Definition at line 313 of file TupleList.hpp.

uint moab::TupleList::n [private]

Definition at line 314 of file TupleList.hpp.

sint* moab::TupleList::vi [private]

Definition at line 315 of file TupleList.hpp.

const sint* moab::TupleList::vi_rd

Examples:

CrystalRouterExample.cpp.

Definition at line 306 of file TupleList.hpp.

sint* moab::TupleList::vi_wr

Examples:

CrystalRouterExample.cpp.

Definition at line 303 of file TupleList.hpp.

slong* moab::TupleList::vl [private]

Definition at line 315 of file TupleList.hpp.

slong* moab::TupleList::vl_rd

Examples:

CrystalRouterExample.cpp.

Definition at line 306 of file TupleList.hpp.

slong* moab::TupleList::vl_wr

Examples:

CrystalRouterExample.cpp.

Definition at line 303 of file TupleList.hpp.

realType* moab::TupleList::vr [private]

Definition at line 315 of file TupleList.hpp.

realType* moab::TupleList::vr_rd

Definition at line 306 of file TupleList.hpp.

realType* moab::TupleList::vr_wr

Examples:

CrystalRouterExample.cpp.

Definition at line 303 of file TupleList.hpp.

ulong* moab::TupleList::vul [private]

Definition at line 315 of file TupleList.hpp.

ulong* moab::TupleList::vul_rd

Definition at line 306 of file TupleList.hpp.

ulong* moab::TupleList::vul_wr

Definition at line 303 of file TupleList.hpp.

bool moab::TupleList::writeEnabled [private]

Definition at line 327 of file TupleList.hpp.

---

The documentation for this class was generated from the following files:

• TupleList.hpp
• TupleList.cpp