unionFilter.c

/* 
 * 
 * Copyright (c) Year(s), 2013, Luis M. S. Russo and Alexandre 
 * P. Francisco / KDBIO / INESC-ID, <qhv@kdbio.inesc-id.pt> 
 *  
 * Any published media that is related with to use of the distributed 
 * software, or derived software, must contain a reference to "Extending 
 * quick hypervolume. Luís M. S. Russo, Alexandre P. Francisco: 
 * J. Heuristics 22(3): 245-271 (2016)".
 *  
 * Permission to use, copy, modify, and/or distribute this software for 
 * any purpose with or without fee is hereby granted, provided that the 
 * above copyright notice and this permission notice appear in all 
 * copies. 
 *  
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL 
 * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED 
 * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE 
 * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER 
 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 
 * PERFORMANCE OF THIS SOFTWARE. 
 * 
 */

#include "unionFilter.h"
#include "counterHash.h"
#include "arrayList.h"

/*** global variables *************************************/

/*** file scope macro definitions *************************/

/*** file scope type declarations *************************/
    
/*** file scope variables *********************************/
    
/*** file scope functions declarations ********************/

/*** public functions declarations ************************/

/*** file scope functions *********************************/

/* ------------------------------------------------------ */

/*** public functions *************************************/

void initUnion(int n, struct unionData* ud)
{
  if(ud->size < n)
    {
      if(ud->size != 0)
        { /* Free current structs first */
          freeArrayList(&(ud->members));
          CHfree(&(ud->presences));
        }

      ud->size = 2*n; /*trick to avoid quadratic problems */

      ud->members = newArrayList(ud->size);
      ud->presences = CHalloc(ud->size);
    }
}

void finishUnion(struct unionData* ud)
{
  freeArrayList(&(ud->members));
  CHfree(&(ud->presences));
}

void resetUnion(struct unionData* ud)
{
  int i;

  arrayList members = ud->members;              
  counterHash presences = ud->presences;        
  i = 0;
  while(i < size(members))
    {
      CHzero(presences, get(members)[i]);
      i++;
    }
  clean(members);
}

int member(int i, struct unionData* ud)
{
  return CHget(ud->presences, i);
}

void insertUnion(int i, struct unionData* ud)
{
  if(!member(i, ud))
    pushAL(ud->members, i);

  CHinc(ud->presences, i, 1);
}