Vector.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 "Config.h"
 
#include <assert.h>
#include <stdlib.h>
#include <string.h>
 
#include "Hash.h"
#include "Vector.h"
 
#define _Class _Vector
 
#define VECTOR_CHUNK_SIZE 64
 
#pragma mark - Object
 
static Object *copy(const Object *self) {
 
  const Vector *this = (Vector *) self;
 
  Vector *that = $(alloc(Vector), initWithSize, this->size);
 
  free(that->elements);
  that->elements = malloc(this->capacity * this->size);
  assert(that->elements);
  memcpy(that->elements, this->elements, this->count * this->size);
  that->count = this->count;
  that->capacity = this->capacity;
  that->destroy = this->destroy;
 
  return (Object *) that;
}
 
static void dealloc(Object *self) {
 
  Vector *this = (Vector *) self;
 
  $(this, removeAll);
 
  free(this->elements);
 
  super(Object, self, dealloc);
}
 
static int hash(const Object *self) {
 
  Vector *this = (Vector *) self;
 
  const Range range = {
    .location = 0,
    .length = this->count * this->size
  };
 
  return HashForBytes(HASH_SEED, this->elements, range);
}
 
static bool isEqual(const Object *self, const Object *other) {
 
  if (super(Object, self, isEqual, other)) {
    return true;
  }
 
  if (other && $(other, isKindOfClass, _Vector())) {
 
    const Vector *this = (Vector *) self;
    const Vector *that = (Vector *) other;
 
    if (this->count == that->count) {
      return memcmp(this->elements, that->elements, this->count * this->size) == 0;
    }
  }
 
  return false;
}
 
#pragma mark - Vector
 
static void add(Vector *self, const ident element) {
 
  if (self->count == self->capacity) {
 
    self->capacity += VECTOR_CHUNK_SIZE;
 
    if (self->elements) {
      self->elements = realloc(self->elements, self->capacity * self->size);
    } else {
      self->elements = calloc(self->capacity, self->size);
    }
 
    assert(self->elements);
  }
 
  memcpy(self->elements + self->count * self->size, element, self->size);
  self->count++;
}
 
static void enumerate(const Vector *self, VectorEnumerator enumerator, ident data) {
 
  assert(enumerator);
 
  for (size_t i = 0; i < self->count; i++) {
    enumerator(self, self->elements + i * self->size, data);
  }
}
 
static void filter(Vector *self, Predicate predicate, ident data) {
 
  assert(predicate);
 
  for (size_t i = 0; i < self->count; i++) {
    if (!predicate(self->elements + i * self->size, data)) {
      $(self, removeAt, i);
    }
  }
}
 
static ident find(const Vector *self, Predicate predicate, ident data) {
 
  assert(predicate);
 
  for (size_t i = 0; i < self->count; i++) {
    if (predicate(self->elements + i * self->size, data)) {
      return self->elements + i * self->size;
    }
  }
 
  return NULL;
}
 
static ssize_t indexOf(const Vector *self, const ident element) {
 
  for (size_t i = 0; i < self->count; i++) {
    if (memcmp(self->elements + i * self->size, element, self->size) == 0) {
      return i;
    }
  }
 
  return -1;
}
 
static Vector *initWithElements(Vector *self, size_t size, size_t count, ident elements) {
 
  self = $(self, initWithSize, size);
  if (self) {
    self->count = count;
    self->elements = elements;
  }
 
  return self;
}
 
static Vector *initWithSize(Vector *self, size_t size) {
 
  self = (Vector *) super(Object, self, init);
  if (self) {
    self->size = size;
    assert(self->size);
  }
  return self;
}
 
static void insert(Vector *self, const ident element, size_t index) {
 
  assert(index <= self->count);
 
  $(self, add, element);
 
  for (size_t i = self->count - 1; i > index; i--) {
    memcpy(self->elements + i * self->size, self->elements + (i - 1) * self->size, self->size);
  }
 
  memcpy(self->elements + index * self->size, element, self->size);
}
 
static Vector *mappedVector(const Vector *self, Functor functor, ident data) {
 
  assert(functor);
 
  Vector *vector = $(alloc(Vector), initWithSize, self->size);
  for (size_t i = 0; i < self->count; i++) {
    ident result = functor(self->elements + i * self->size, data);
    $(vector, add, result);
  }
  return vector;
}
 
static ident reduce(const Vector *self, Reducer reducer, ident accumulator, ident data) {
 
  assert(reducer);
 
  for (size_t i = 0; i < self->count; i++) {
    accumulator = reducer(self->elements + i * self->size, accumulator, data);
  }
 
  return accumulator;
}
 
static void removeAll(Vector *self) {
 
  if (self->destroy) {
    for (size_t i = 0; i < self->count; i++) {
      self->destroy(self->elements + i * self->size);
    }
  }
 
  self->count = 0;
}
 
static void removeAt(Vector *self, size_t index) {
 
  assert(index < self->count);
 
  if (self->destroy) {
    self->destroy(self->elements + index * self->size);
  }
 
  const size_t size = (self->count - index - 1) * self->size;
 
  memmove(self->elements + index * self->size, self->elements + (index + 1) * self->size, size);
 
  self->count--;
}
 
static void resize(Vector *self, size_t capacity) {
 
  if (self->destroy) {
    for (size_t i = capacity; i < self->count; i++) {
      self->destroy(self->elements + i * self->size);
    }
  }
 
  self->elements = realloc(self->elements, capacity * self->size);
  assert(self->elements);
 
  self->capacity = capacity;
  self->count = min(self->count, self->capacity);
}
 
#if defined(__APPLE__)
 
static int _sort(void *data, const void *a, const void *b) {
  return ((Comparator) data)((const ident) a, (const ident) b);
}
 
static void sort(Vector *self, Comparator comparator) {
  qsort_r(self->elements, self->count, self->size, comparator, _sort);
}
 
#elif defined(_WIN32)
 
static int _sort(void *data, const void *a, const void *b) {
  return ((Comparator) data)(((const ident) a), ((const ident) b));
}
 
static void sort(Vector *self, Comparator comparator) {
  qsort_s(self->elements, self->count, self->size, _sort, comparator);
}
 
#else
 
static int _sort(const void *a, const void *b, void *data) {
  return ((Comparator) data)(((const ident) a), ((const ident) b));
}
 
static void sort(Vector *self, Comparator comparator) {
  qsort_r(self->elements, self->count, self->size, _sort, comparator);
}
 
#endif
 
static Vector *vectorWithElements(size_t size, size_t count, ident elements) {
  return $(alloc(Vector), initWithElements, size, count, elements);
}
 
static Vector *vectorWithSize(size_t size) {
  return $(alloc(Vector), initWithSize, size);
}
 
#pragma mark - Class lifecycle
 
static void initialize(Class *clazz) {
 
  ((ObjectInterface *) clazz->interface)->copy = copy;
  ((ObjectInterface *) clazz->interface)->dealloc = dealloc;
  ((ObjectInterface *) clazz->interface)->hash = hash;
  ((ObjectInterface *) clazz->interface)->isEqual = isEqual;
 
  ((VectorInterface *) clazz->interface)->add = add;
  ((VectorInterface *) clazz->interface)->enumerate = enumerate;
  ((VectorInterface *) clazz->interface)->filter = filter;
  ((VectorInterface *) clazz->interface)->find = find;
  ((VectorInterface *) clazz->interface)->indexOf = indexOf;
  ((VectorInterface *) clazz->interface)->initWithElements = initWithElements;
  ((VectorInterface *) clazz->interface)->initWithSize = initWithSize;
  ((VectorInterface *) clazz->interface)->insert = insert;
  ((VectorInterface *) clazz->interface)->mappedVector = mappedVector;
  ((VectorInterface *) clazz->interface)->reduce = reduce;
  ((VectorInterface *) clazz->interface)->removeAll = removeAll;
  ((VectorInterface *) clazz->interface)->removeAt = removeAt;
  ((VectorInterface *) clazz->interface)->resize = resize;
  ((VectorInterface *) clazz->interface)->sort = sort;
  ((VectorInterface *) clazz->interface)->vectorWithElements = vectorWithElements;
  ((VectorInterface *) clazz->interface)->vectorWithSize = vectorWithSize;
}
 
Class *_Vector(void) {
  static Class *clazz;
  static Once once;
 
  do_once(&once, {
    clazz = _initialize(&(const ClassDef) {
      .name = "Vector",
      .superclass = _Object(),
      .instanceSize = sizeof(Vector),
      .interfaceOffset = offsetof(Vector, interface),
      .interfaceSize = sizeof(VectorInterface),
      .initialize = initialize,
    });
  });
 
  return clazz;
}
 
#undef _Class