SortedSet_dh.c

/*@HEADER
// ***********************************************************************
//
//       Ifpack: Object-Oriented Algebraic Preconditioner Package
//                 Copyright (2009) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
//@HEADER
*/

#include "SortedSet_dh.h"
#include "shellSort_dh.h"
#include "Mem_dh.h"


#undef __FUNC__
#define __FUNC__ "SortedSet_dhCreate"
void
SortedSet_dhCreate (SortedSet_dh * ss, int size)
{
  START_FUNC_DH
    struct _sortedset_dh *tmp =
    (struct _sortedset_dh *) MALLOC_DH (sizeof (struct _sortedset_dh));
  CHECK_V_ERROR;
  *ss = tmp;

  tmp->n = size;
  tmp->list = (int *) MALLOC_DH (size * sizeof (int));
  CHECK_V_ERROR;
  tmp->count = 0;
END_FUNC_DH}

#undef __FUNC__
#define __FUNC__ "SortedSet_dhDestroy"
void
SortedSet_dhDestroy (SortedSet_dh ss)
{
  START_FUNC_DH if (ss->list != NULL)
    {
      FREE_DH (ss->list);
      CHECK_V_ERROR;
    }
  FREE_DH (ss);
  CHECK_V_ERROR;
END_FUNC_DH}


#undef __FUNC__
#define __FUNC__ "SortedSet_dhInsert"
void
SortedSet_dhInsert (SortedSet_dh ss, int idx)
{
  START_FUNC_DH bool isInserted = false;
  int ct = ss->count;
  int *list = ss->list;
  int i, n = ss->n;

  /* determine if item was already inserted */
  for (i = 0; i < ct; ++i)
    {
      if (list[i] == idx)
    {
      isInserted = true;
      break;
    }
    }

  /* is we need to insert the item, first check for overflow
     and reallocate if necessary, then append the index to the
     end of the list.
   */
  if (!isInserted)
    {
      if (ct == n)
    {
      int *tmp = (int *) MALLOC_DH (n * 2 * sizeof (int));
      CHECK_V_ERROR;
      memcpy (tmp, list, n * sizeof (int));
      FREE_DH (list);
      CHECK_V_ERROR;
      list = ss->list = tmp;
      ss->n *= 2;
    }

      list[ct] = idx;
      ss->count += 1;
    }
END_FUNC_DH}


#undef __FUNC__
#define __FUNC__ "SortedSet_dhGetList"
void
SortedSet_dhGetList (SortedSet_dh ss, int **list, int *count)
{
  START_FUNC_DH shellSort_int (ss->count, ss->list);
  *list = ss->list;
  *count = ss->count;
END_FUNC_DH}