Edit

kc3-lang/kc3/libc3/set__fact.c

Branch :

  • libc3/set__fact.c 
  • /* c3
 * Copyright 2022 kmx.io <contact@kmx.io>
 *
 * Permission is hereby granted to use this software excepted
 * on Apple computers granted the above copyright notice and
 * this permission paragraph are included in all copies and
 * substantial portions of this software.
 *
 * THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
 * PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
 * AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
 * THIS SOFTWARE.
 */
/* Gen from set.c.in NAME=fact TYPE=s_fact */
#include <assert.h>
#include <stdlib.h>
#include "fact.h"
#include "set__fact.h"
#include "set_item__fact.h"

s_set_item__fact *
set_add__fact (s_set__fact *set, const s_fact *data)
{
  uw hash;
  assert(set);
  assert(data);
  hash = fact_hash(data);
  return set_add_h__fact(set, data, hash);
}

s_set_item__fact *
set_add_collision__fact (s_set__fact *set, const s_fact *data, uw hash, s_set_item__fact *item)
{
  s_set_item__fact *new_item;
  new_item = set_item_new__fact(data, hash, item->next);
  item->next = new_item;
  set->count++;
  set->collisions++;
  return new_item;
}

s_set_item__fact *
set_add_h__fact (s_set__fact *set, const s_fact *data, uw hash)
{
  uw h;
  s_set_item__fact *i;
  assert(set);
  assert(data);
  if ((i = set_get_h__fact(set, data, hash)))
    return i;
  h = hash % set->max;
  if ((i = set->items[h]))
    return set_add_collision__fact(set, data, hash, i);
  i = set_item_new__fact(data, hash, NULL);
  set->items[h] = i;
  set->count++;
  return i;
}
                 
void
set_clean__fact (s_set__fact *set)
{
  uw i;
  assert(set);
  for (i = 0; i < set->max; i++) {
    set_item_delete_all__fact(set->items[i]);
  }
  free(set->items);
}

s_set_item__fact *
set_get__fact (const s_set__fact *set, const s_fact *data)
{
  uw hash;
  assert(set);
  assert(data);
  hash = fact_hash(data);
  return set_get_h__fact(set, data, hash);
}

s_set_item__fact *
set_get_h__fact (const s_set__fact *set, const s_fact *data, uw hash)
{
  s_set_item__fact *i;
  assert(set);
  assert(data);
  i = set_get_hash__fact(set, hash);
  while (i) {
    if (fact_compare(&i->data, data) == 0)
      return i;
    i = set_get_hash_next__fact(i);
  }
  return NULL;
}

s_set_item__fact *
set_get_hash__fact (const s_set__fact *set, uw hash)
{
  uw h;
  s_set_item__fact *i;
  assert(set);
  h = hash % set->max;
  i = set->items[h];
  while (i && i->hash != hash)
    i = i->next;
  return i;
}

s_set_item__fact *
set_get_hash_next__fact (const s_set_item__fact *item)
{
  s_set_item__fact *i;
  assert(item);
  i = item->next;
  while (i && i->hash != item->hash)
    i = i->next;
  return i;
}

s_set__fact *
set_init__fact (s_set__fact *set, uw max)
{
  assert(set);
  assert(max > 0);
  set->max = max;
  set->items = calloc(max, sizeof(s_set_item__fact *));
  set->count = 0;
  set->collisions = 0;
  return set;
}

e_bool
set_remove__fact (s_set__fact *set, const s_fact *data)
{
  s_set_item__fact *item;
  if ((item = set_get__fact(set, data)))
    return set_remove_item__fact(set, item);
  return false;
}

e_bool
set_remove_item__fact (s_set__fact *set, s_set_item__fact *item)
{
  sw h;
  s_set_item__fact *i;
  s_set_item__fact **j;
  s_set_item__fact *k;
  assert(set);
  if (! item)
    return false;
  h = item->hash % set->max;
  j = set->items + h;
  while (*j && *j != item)
    j = &(*j)->next;
  if (!*j)
    return false;
  i = *j;
  k = i->next;
  set_item_delete__fact(i);
  *j = k;
  set->count--;
  if (set->items[h])
    set->collisions--;
  return true;
}

s_set__fact *
set_resize__fact (s_set__fact *set, uw max)
{
  uw i;
  s_set_item__fact *item;
  s_set__fact n;
  if (set->max == max)
    return set;
  set_init__fact(&n, max);
  for (i = 0; i < set->max; i++) {
    item = set->items[i];
    while (item) {
      set_add_h__fact(&n, &item->data, item->hash);
      item = item->next;
    }
  }
  set_clean__fact(set);
  set->max = n.max;
  set->items = n.items;
  set->count = n.count;
  set->collisions = n.collisions;
  return set;
}