bnm3k

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/*
 * Takes an array of c-strings and joins them into a single string placed in buf
 * If the size of buf, i.e. buf_len, suffices, join_strs returns a non_negative
 * integer that's equal to the total chars written to the buf, minus the 
 * null terminating character '\0'. The caller can also supply a sep argument

bnm3k

#include "khash.h"
#include <stdbool.h>
#include <stdio.h>

void gen_rand_string(char *buf, size_t buf_len, bool should_randomize_str_len) {
    static char charset[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";

    size_t str_len = buf_len - 1;
    if (should_randomize_str_len)
        str_len = (rand() % str_len) + 1;

bnm3k

package main

import (
	"math/rand"
	"sync"
	"time"

	"github.com/google/btree"
)

bnm3k

package promises

import (
	"fmt"
	"time"
)

/*
Credits to github.com/Workiva/go-datastructures/blob/master/futures/futures.go
whose interface/API and tests for Futures I generously borrowed, but I restricted my version

bnm3k

package main

import (
	"fmt"
	"strings"
)

type node struct {
	val            string
	isIntermediary bool

bnm3k

package main

import (
	"fmt"
	"strings"
)

type node struct {
	val         string
	exact       *node

bnm3k

package main

import (
	"fmt"
	"strings"
)

func generateTopicStrings(tokens []string) (generatedTopics []string) {
	// the expected no. of generated topics. See either of the previous
	// gists for explanation as to why this formula is used

bnm3k

// RadixSort ...
// credits QuestDB impl for radix sort (7104a57)
// core/src/main/c/share/ooo.cpp
func RadixSort(array []uint64) {
	if len(array) <= 100 {
		insertionSort(array)
		return
	}
	// counts
	type rscounts struct {

bnm3k

with recursive p(hops, flights, last_stop, last_arrival, total_duration, closest, found) as (
  select *
  from (
    select 
      array[departure_airport, arrival_airport] as hops,
      array[flight_no] as flights,
      arrival_airport as last_stop,
      scheduled_arrival as last_arrival,
      scheduled_arrival - scheduled_departure as total_duration,
      rank() over(

bnm3k

Postgres indexing for overlaps operator doesn't work

Credits: Jonathan Katz: Lets Build a Complex Real Time Data Management Application -- PGCon 2018

Start with the following table:

create table bookings (
  id int generated by default as identity primary key,
  start_time timestamptz not null,
  end_time timestamptz not null,