dhermes

dhermes

How many nan values exist?

It turns out a lot (2**52). Anything where the 12 exponent bits are all 1, independent of the values of the other 52 bits).

$ python main.py
binary(1.0)  = 0011111111110000000000000000000000000000000000000000000000000000
binary(2.0)  = 0100000000000000000000000000000000000000000000000000000000000000
binary(-1.0) = 1011111111110000000000000000000000000000000000000000000000000000

dhermes

package main

import (
	"fmt"
	"os"

	"github.com/google/uuid"
)

type mapKey struct {

dhermes

/__pycache__/
/supervisord.log
/supervisord.pid

dhermes

WITH raw_relation_sizes AS (
  SELECT
    n.nspname || '.' || c.relname as table_name,
    pg_relation_size(n.nspname || '.' || c.relname) AS relation_size
  FROM
    pg_catalog.pg_class AS c
  LEFT OUTER JOIN
    pg_catalog.pg_namespace AS n
  ON
    n.oid = c.relnamespace

dhermes

package main

import (
	"fmt"
)

type Interface interface {
	Foo() int
	Bar() string
}

dhermes

package main

import (
	"fmt"
	"math"
)

type EmbeddedType struct {
	X int
	Y int

dhermes

package main

import (
	"encoding/json"
	"fmt"
)

type T struct {
	X float64 `json:"x"`
	Y float64 `json:"y"`

dhermes

{
    "source": "https://stripe.com/docs/api/events/types",
    "length": 194,
    "names": [
        "account.updated",
        "account.application.authorized",
        "account.application.deauthorized",
        "account.external_account.created",
        "account.external_account.deleted",
        "account.external_account.updated",

dhermes

FYI, nanoid is lossy

I was scratching my head trying to understand where some of the bits went in a Nano ID. A Nano ID is 16 characters from the [Crockford base 32 alphabet][1]. Since 2**5 == 32, this means each character comes with 5 bits, for a total of 80 bits (5 * 16).

However a UUID has 128 bits, so 3 out of every 8 bits are missing.