lancejpollard

const { uniq, omit } = require('lodash')
const serialization = require('./serialization')
const knex = require('../../knex')
const toneText = require('../../../../../../drumwork/deck/tone')
const callText = require('../../../../../../drumwork/deck/call')

let objectKeyToIdMap
let objectIdToKeyMap
let languageMap

lancejpollard

lancejpollard

// http://web.mnstate.edu/goytadam/talks/DBS.pdf
const SIZE = 8

const vertices = getEveryBitPermutation(SIZE).reduce((m, x) => {
  m.set(x.toString(2).padStart(SIZE, 0), new Array)
  return m
}, new Map)

for (let [v, edges] of vertices) {

lancejpollard

class Iterator {
  constructor(k, n) {
    this.k = k // alphabetSize
    this.n = n // wordSize
    this.power = new Uint32Array(n + 1)
    this.power[0] = 1;
    for (let i = 1; i <= n; i++) {
      this.power[i] = k * this.power[i - 1];
    }

lancejpollard

// ported from C from http://debruijnsequence.org/db/home

const MAX = 100

function isZeroes(a, n) {
  for (let i = 1; i <= n; i++) {
    if (a[i] === 1) {
      return false;
    }
  }

lancejpollard

// from https://www.klittlepage.com/2013/12/21/twelve-days-2013-de-bruijn-sequences/
import java.util.Random;

/**
* @author Kelly Littlepage
*/
public class DeBruijn {

    /***
    * Generate a De Bruijn Sequence using the recursive FKM algorithm as given

lancejpollard

#include <Frigo/all>
#include <Frigo/all.cpp>
  
// from https://stackoverflow.com/questions/7365562/de-bruijn-like-sequence-for-2n-1-how-is-it-constructed/7369288#7369288

using namespace Frigo::Lang;
using namespace std;

class MagicNumberGenerator
{

lancejpollard

const BINARY_LEADING_ZERO_TABLE = makeLeadingZeroTable()
const BINARY_TRAILING_ZERO_CONSTANT = 0x077cb531
const BINARY_TRAILING_ZERO_TABLE = makeDeBruijnTrailingZeroTable(5, BINARY_TRAILING_ZERO_CONSTANT)

function countTrailingZeroes32(n) {
  return BINARY_TRAILING_ZERO_TABLE[((n & -n) * BINARY_TRAILING_ZERO_CONSTANT) >>> 27];
}

function countTrailingZeroes16(n) {

lancejpollard

def deBruijn(n, k):
   '''
   An implementation of the FKM algorithm for generating the de Bruijn
   sequence containing all k-ary strings of length n, as described in
   "Combinatorial Generation" by Frank Ruskey.
   '''
 
   a = [ 0 ] * (n + 1)
   
   def gen(t, p):

lancejpollard

function makeLeadingZeroTable() {
  let i = 0
  const table = new Uint8Array(256)
  while (i < 256) {
    let count = 8
    let index = i
    while (index > 0) {
      index = (index / 2) | 0
      count--
    }