bundle: move tree-sitter as a bundled dep

fixup! bundle: move tree-sitter as a bundled dep

fixup! bundle: move tree-sitter as a bundled dep

1 files changed, 0 insertions, 158 deletions

diff --git a/src/tree_sitter/array.h b/src/tree_sitter/array.h
deleted file mode 100644
index 26cb8448f1..0000000000
--- a/src/tree_sitter/array.h
+++ /dev/null
@@ -1,158 +0,0 @@
-#ifndef TREE_SITTER_ARRAY_H_
-#define TREE_SITTER_ARRAY_H_
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <string.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <assert.h>
-#include <stdbool.h>
-#include "./alloc.h"
-
-#define Array(T)     \
-  struct {           \
-    T *contents;     \
-    uint32_t size;     \
-    uint32_t capacity; \
-  }
-
-#define array_init(self) \
-  ((self)->size = 0, (self)->capacity = 0, (self)->contents = NULL)
-
-#define array_new() \
-  { NULL, 0, 0 }
-
-#define array_get(self, index) \
-  (assert((uint32_t)index < (self)->size), &(self)->contents[index])
-
-#define array_front(self) array_get(self, 0)
-
-#define array_back(self) array_get(self, (self)->size - 1)
-
-#define array_clear(self) ((self)->size = 0)
-
-#define array_reserve(self, new_capacity) \
-  array__reserve((VoidArray *)(self), array__elem_size(self), new_capacity)
-
-#define array_erase(self, index) \
-  array__erase((VoidArray *)(self), array__elem_size(self), index)
-
-#define array_delete(self) array__delete((VoidArray *)self)
-
-#define array_push(self, element)                            \
-  (array__grow((VoidArray *)(self), 1, array__elem_size(self)), \
-   (self)->contents[(self)->size++] = (element))
-
-#define array_grow_by(self, count) \
-  (array__grow((VoidArray *)(self), count, array__elem_size(self)), \
-   memset((self)->contents + (self)->size, 0, (count) * array__elem_size(self)), \
-   (self)->size += (count))
-
-#define array_push_all(self, other)                                       \
-  array_splice((self), (self)->size, 0, (other)->size, (other)->contents)
-
-#define array_splice(self, index, old_count, new_count, new_contents)          \
-  array__splice((VoidArray *)(self), array__elem_size(self), index, old_count, \
-                new_count, new_contents)
-
-#define array_insert(self, index, element) \
-  array__splice((VoidArray *)(self), array__elem_size(self), index, 0, 1, &element)
-
-#define array_pop(self) ((self)->contents[--(self)->size])
-
-#define array_assign(self, other) \
-  array__assign((VoidArray *)(self), (const VoidArray *)(other), array__elem_size(self))
-
-// Private
-
-typedef Array(void) VoidArray;
-
-#define array__elem_size(self) sizeof(*(self)->contents)
-
-static inline void array__delete(VoidArray *self) {
-  ts_free(self->contents);
-  self->contents = NULL;
-  self->size = 0;
-  self->capacity = 0;
-}
-
-static inline void array__erase(VoidArray *self, size_t element_size,
-                                uint32_t index) {
-  assert(index < self->size);
-  char *contents = (char *)self->contents;
-  memmove(contents + index * element_size, contents + (index + 1) * element_size,
-          (self->size - index - 1) * element_size);
-  self->size--;
-}
-
-static inline void array__reserve(VoidArray *self, size_t element_size, uint32_t new_capacity) {
-  if (new_capacity > self->capacity) {
-    if (self->contents) {
-      self->contents = ts_realloc(self->contents, new_capacity * element_size);
-    } else {
-      self->contents = ts_calloc(new_capacity, element_size);
-    }
-    self->capacity = new_capacity;
-  }
-}
-
-static inline void array__assign(VoidArray *self, const VoidArray *other, size_t element_size) {
-  array__reserve(self, element_size, other->size);
-  self->size = other->size;
-  memcpy(self->contents, other->contents, self->size * element_size);
-}
-
-static inline void array__grow(VoidArray *self, size_t count, size_t element_size) {
-  size_t new_size = self->size + count;
-  if (new_size > self->capacity) {
-    size_t new_capacity = self->capacity * 2;
-    if (new_capacity < 8) new_capacity = 8;
-    if (new_capacity < new_size) new_capacity = new_size;
-    array__reserve(self, element_size, new_capacity);
-  }
-}
-
-static inline void array__splice(VoidArray *self, size_t element_size,
-                                 uint32_t index, uint32_t old_count,
-                                 uint32_t new_count, const void *elements) {
-  uint32_t new_size = self->size + new_count - old_count;
-  uint32_t old_end = index + old_count;
-  uint32_t new_end = index + new_count;
-  assert(old_end <= self->size);
-
-  array__reserve(self, element_size, new_size);
-
-  char *contents = (char *)self->contents;
-  if (self->size > old_end) {
-    memmove(
-      contents + new_end * element_size,
-      contents + old_end * element_size,
-      (self->size - old_end) * element_size
-    );
-  }
-  if (new_count > 0) {
-    if (elements) {
-      memcpy(
-        (contents + index * element_size),
-        elements,
-        new_count * element_size
-      );
-    } else {
-      memset(
-        (contents + index * element_size),
-        0,
-        new_count * element_size
-      );
-    }
-  }
-  self->size += new_count - old_count;
-}
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif  // TREE_SITTER_ARRAY_H_