IndexSet.c

Go to the documentation of this file.

/*
 * Objectively: Ultra-lightweight object oriented framework for GNU C.
 * Copyright (C) 2014 Jay Dolan <jay@jaydolan.com>
 *
 * This software is provided 'as-is', without any express or implied
 * warranty. In no event will the authors be held liable for any damages
 * arising from the use of this software.
 *
 * Permission is granted to anyone to use this software for any purpose,
 * including commercial applications, and to alter it and redistribute it
 * freely, subject to the following restrictions:
 *
 * 1. The origin of this software must not be misrepresented; you must not
 * claim that you wrote the original software. If you use this software
 * in a product, an acknowledgment in the product documentation would be
 * appreciated but is not required.
 *
 * 2. Altered source versions must be plainly marked as such, and must not be
 * misrepresented as being the original software.
 *
 * 3. This notice may not be removed or altered from any source distribution.
 */
 
#include <assert.h>
#include <stdlib.h>
#include <string.h>
 
#include "Hash.h"
#include "IndexSet.h"
#include "String.h"
 
static int compare(const void *a, const void *b) {
 
  const size_t sa = *(size_t *) a;
  const size_t sb = *(size_t *) b;
 
  return sa < sb ? -1 : sa > sb ? 1 : 0;
}
 
static size_t compact(size_t *indexes, size_t count) {
 
  size_t size = 0;
 
  if (count) {
    qsort(indexes, count, sizeof(size_t), compare);
 
    for (size_t i = 1; i < count; i++) {
      if (indexes[i] != indexes[size]) {
        indexes[++size] = indexes[i];
      }
    }
 
    size++;
  }
 
  return size;
}
 
#define _Class _IndexSet
 
#define INDEX_SET_CHUNK_SIZE 8
 
#pragma mark - Object
 
static Object *copy(const Object *self) {
 
  IndexSet *this = (IndexSet *) self;
  IndexSet *that = $(alloc(IndexSet), initWithIndexes, this->indexes, this->count);
 
  return (Object *) that;
}
 
static void dealloc(Object *self) {
 
  IndexSet *this = (IndexSet *) self;
 
  free(this->indexes);
 
  super(Object, self, dealloc);
}
 
static String *description(const Object *self) {
 
  const IndexSet *this = (IndexSet *) self;
  String *desc = str("[");
 
  for (size_t i = 0; i < this->count; i++) {
    $(desc, appendFormat, "%d", this->indexes[i]);
    if (i < this->count - 1) {
      $(desc, appendCharacters, ", ");
    }
  }
 
  $(desc, appendCharacters, "]");
  return (String *) desc;
}
 
static int hash(const Object *self) {
 
  int hash = HASH_SEED;
 
  const IndexSet *this = (IndexSet *) self;
 
  for (size_t i = 0; i < this->count; i++) {
    hash = HashForInteger(hash, this->indexes[i]);
  }
 
  return hash;
}
 
static bool isEqual(const Object *self, const Object *other) {
 
  if (super(Object, self, isEqual, other)) {
    return true;
  }
 
  if (other && $(other, isKindOfClass, _IndexSet())) {
 
    const IndexSet *this = (IndexSet *) self;
    const IndexSet *that = (IndexSet *) other;
 
    if (this->count == that->count) {
      return memcmp(this->indexes, that->indexes, this->count * sizeof(size_t)) == 0;
    }
  }
 
  return false;
}
 
#pragma mark - IndexSet
 
static bool containsIndex(const IndexSet *self, size_t index) {
 
  for (size_t i = 0; i < self->count; i++) {
    if (self->indexes[i] == index) {
      return true;
    }
  }
 
  return false;
}
 
static IndexSet *initWithIndex(IndexSet *self, size_t index) {
  return $(self, initWithIndexes, &index, 1);
}
 
static IndexSet *initWithIndexes(IndexSet *self, size_t *indexes, size_t count) {
 
  self = (IndexSet *) super(Object, self, init);
  if (self) {
 
    self->count = compact(indexes, count);
    self->capacity = self->count;
    if (self->count) {
 
      self->indexes = calloc(sizeof(size_t), self->count);
      assert(self->indexes);
 
      memcpy(self->indexes, indexes, sizeof(size_t) * self->count);
    }
  }
 
  return self;
}
 
#pragma mark - IndexSet mutation
 
static void addIndex(IndexSet *self, size_t index) {
 
  IndexSet *this = self;
 
  size_t i;
  for (i = 0; i < this->count; i++) {
    if (this->indexes[i] == index) {
      return;
    }
    if (this->indexes[i] > index) {
      break;
    }
  }
 
  if (this->count == self->capacity) {
    self->capacity += INDEX_SET_CHUNK_SIZE;
 
    this->indexes = realloc(this->indexes, self->capacity * sizeof(size_t));
    assert(this->indexes);
  }
 
  for (size_t j = this->count; j > i; j--) {
    this->indexes[j] = this->indexes[j - 1];
  }
 
  this->indexes[i] = index;
  this->count++;
}
 
static void addIndexes(IndexSet *self, size_t *indexes, size_t count) {
 
  for (size_t i = 0; i < count; i++) {
    $(self, addIndex, indexes[i]);
  }
}
 
static void addIndexesInRange(IndexSet *self, const Range range) {
 
  for (size_t i = range.location; i < range.location + range.length; i++) {
    $(self, addIndex, i);
  }
}
 
static IndexSet *init(IndexSet *self) {
  return $(self, initWithCapacity, INDEX_SET_CHUNK_SIZE);
}
 
static IndexSet *initWithCapacity(IndexSet *self, size_t capacity) {
 
  self = (IndexSet *) super(Object, self, init);
  if (self) {
    self->capacity = capacity;
 
    self->indexes = malloc(self->capacity * sizeof(size_t));
    assert(self->indexes);
  }
 
  return self;
}
 
static void removeAllIndexes(IndexSet *self) {
 
  IndexSet *this = self;
 
  free(this->indexes);
  this->indexes = NULL;
 
  this->count = 0;
  self->capacity = 0;
}
 
static void removeIndex(IndexSet *self, size_t index) {
 
  IndexSet *this = self;
  for (size_t i = 0; i < this->count; i++) {
    if (this->indexes[i] == index) {
      this->count--;
      for (size_t j = i; j < this->count; j++) {
        this->indexes[j] = this->indexes[j + 1];
      }
      return;
    }
  }
}
 
static void removeIndexes(IndexSet *self, size_t *indexes, size_t count) {
 
  for (size_t i = 0; i < count; i++) {
    $(self, removeIndex, indexes[i]);
  }
}
 
static void removeIndexesInRange(IndexSet *self, const Range range) {
 
  for (size_t i = range.location; i < range.location + range.length; i++) {
    $(self, removeIndex, i);
  }
}
 
#pragma mark - Class lifecycle
 
static void initialize(Class *clazz) {
 
  ((ObjectInterface *) clazz->interface)->copy = copy;
  ((ObjectInterface *) clazz->interface)->dealloc = dealloc;
  ((ObjectInterface *) clazz->interface)->description = description;
  ((ObjectInterface *) clazz->interface)->hash = hash;
  ((ObjectInterface *) clazz->interface)->isEqual = isEqual;
 
  ((IndexSetInterface *) clazz->interface)->containsIndex = containsIndex;
  ((IndexSetInterface *) clazz->interface)->addIndex = addIndex;
  ((IndexSetInterface *) clazz->interface)->addIndexes = addIndexes;
  ((IndexSetInterface *) clazz->interface)->addIndexesInRange = addIndexesInRange;
  ((IndexSetInterface *) clazz->interface)->init = init;
  ((IndexSetInterface *) clazz->interface)->initWithCapacity = initWithCapacity;
  ((IndexSetInterface *) clazz->interface)->initWithIndex = initWithIndex;
  ((IndexSetInterface *) clazz->interface)->initWithIndexes = initWithIndexes;
  ((IndexSetInterface *) clazz->interface)->removeAllIndexes = removeAllIndexes;
  ((IndexSetInterface *) clazz->interface)->removeIndex = removeIndex;
  ((IndexSetInterface *) clazz->interface)->removeIndexes = removeIndexes;
  ((IndexSetInterface *) clazz->interface)->removeIndexesInRange = removeIndexesInRange;
}
 
Class *_IndexSet(void) {
  static Class *clazz;
  static Once once;
 
  do_once(&once, {
    clazz = _initialize(&(const ClassDef) {
      .name = "IndexSet",
      .superclass = _Object(),
      .instanceSize = sizeof(IndexSet),
      .interfaceOffset = offsetof(IndexSet, interface),
      .interfaceSize = sizeof(IndexSetInterface),
      .initialize = initialize,
    });
  });
 
  return clazz;
}
 
#undef _Class