Remove ZixBitset

1 files changed, 0 insertions, 107 deletions

diff --git a/src/bitset.c b/src/bitset.c
deleted file mode 100644
index d180ccd..0000000
--- a/src/bitset.c
+++ /dev/null
@@ -1,107 +0,0 @@
-// Copyright 2014-2020 David Robillard <d@drobilla.net>
-// SPDX-License-Identifier: ISC
-
-#include "zix/bitset.h"
-
-#ifdef _MSC_VER
-#  include <intrin.h>
-#endif
-
-#include <string.h>
-
-/// Number of bits per ZixBitset element (ala CHAR_BIT)
-#define ZIX_BITSET_ELEM_BIT (CHAR_BIT * sizeof(ZixBitset))
-
-static inline size_t
-zix_bitset_popcount(const ZixBitset value)
-{
-#ifdef _MSC_VER
-  return (size_t)__popcnt(value);
-#else
-  return (size_t)__builtin_popcountl(value);
-#endif
-}
-
-void
-zix_bitset_clear(ZixBitset* b, ZixBitsetTally* t, size_t n_bits)
-{
-  memset(b, 0, ZIX_BITSET_ELEMS(n_bits) * sizeof(ZixBitset));
-  memset(t, 0, ZIX_BITSET_ELEMS(n_bits) * sizeof(ZixBitsetTally));
-}
-
-void
-zix_bitset_set(ZixBitset* b, ZixBitsetTally* t, size_t i)
-{
-  const size_t    e      = i / ZIX_BITSET_ELEM_BIT;
-  const size_t    ebit   = i & (ZIX_BITSET_ELEM_BIT - 1); // i % ELEM_BIT
-  const ZixBitset mask   = (ZixBitset)1 << ebit;
-  const bool      is_set = (b[e] & mask);
-
-  t[e] = (ZixBitsetTally)(t[e] + !is_set);
-  b[e] |= mask;
-}
-
-void
-zix_bitset_reset(ZixBitset* b, ZixBitsetTally* t, size_t i)
-{
-  const size_t    e      = i / ZIX_BITSET_ELEM_BIT;
-  const size_t    ebit   = i & (ZIX_BITSET_ELEM_BIT - 1); // i % ELEM_BIT
-  const ZixBitset mask   = (ZixBitset)1 << ebit;
-  const bool      is_set = b[e] & mask;
-
-  t[e] = (ZixBitsetTally)(t[e] - is_set);
-  b[e] &= ~mask;
-}
-
-bool
-zix_bitset_get(const ZixBitset* b, size_t i)
-{
-  const size_t    e    = i / ZIX_BITSET_ELEM_BIT;
-  const size_t    ebit = i & (ZIX_BITSET_ELEM_BIT - 1); // i % ELEM_BIT
-  const ZixBitset mask = (ZixBitset)1 << ebit;
-
-  return b[e] & mask;
-}
-
-size_t
-zix_bitset_count_up_to(const ZixBitset* b, const ZixBitsetTally* t, size_t i)
-{
-  const size_t full_elems = i / ZIX_BITSET_ELEM_BIT;
-  const size_t extra      = i & (ZIX_BITSET_ELEM_BIT - 1); // i % ELEM_BIT
-
-  size_t count = 0;
-  for (size_t e = 0; e < full_elems; ++e) {
-    count += t[e];
-  }
-
-  if (extra) {
-    const ZixBitset mask = ~(~(ZixBitset)0U << extra);
-    count += zix_bitset_popcount(b[full_elems] & mask);
-  }
-
-  return count;
-}
-
-size_t
-zix_bitset_count_up_to_if(const ZixBitset* b, const ZixBitsetTally* t, size_t i)
-{
-  const size_t full_elems = i / ZIX_BITSET_ELEM_BIT;
-  const size_t extra      = i & (ZIX_BITSET_ELEM_BIT - 1); // i % ELEM_BIT
-
-  const ZixBitset get_mask = (ZixBitset)1 << extra;
-  if (!(b[full_elems] & get_mask)) {
-    return (size_t)-1;
-  }
-
-  size_t count = 0;
-  for (size_t e = 0; e < full_elems; ++e) {
-    count += t[e];
-  }
-
-  if (extra) {
-    const ZixBitset mask = ~(~(ZixBitset)0 << extra);
-    count += zix_bitset_popcount(b[full_elems] & mask);
-  }
-
-  return count;
-}