Max Countryman maxcountryman

Please consider using http://lygia.xyz instead of copy/pasting this functions. It expand suport for voronoi, voronoise, fbm, noise, worley, noise, derivatives and much more, through simple file dependencies. Take a look to https://github.com/patriciogonzalezvivo/lygia/tree/main/generative

Generic 1,2,3 Noise

float rand(float n){return fract(sin(n) * 43758.5453123);}

float noise(float p){
	float fl = floor(p);
  float fc = fract(p);

Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
Models and Issues in Data Stream Systems
Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
[Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

	// DISCLAIMER : You can now probably use `data-turbo-action="advance"` on your frame to perform what this controller is aiming to do
	// https://turbo.hotwired.dev/handbook/frames#promoting-a-frame-navigation-to-a-page-visit
	// Note that you probably want to disable turbo cache as well for those page to make popstate work properly

	import { navigator } from '@hotwired/turbo'
	import { Controller } from '@hotwired/stimulus'
	import { useMutation } from 'stimulus-use'

	export default class extends Controller {
	connect (): void {

	import { useState, useEffect } from "react";
	import { useRouter } from "next/router";

	type IParam = string;
	type IValue = string \| string[] \| number \| number[] \| null \| undefined;
	type IState = { [k: string]: IValue };
	type IQuery = IState;
	type IRoute = string;

	function isEmpty(value: IValue): boolean {

	(ns merkle.tree
	(:import [java.security MessageDigest]))

	(defn sha-256-digest [bs]
	(.digest
	(doto (MessageDigest/getInstance "SHA-256")
	(.update bs))))

	(def double-sha-256 (comp sha-256-digest sha-256-digest))

	// Usage:
	// Copy and paste all of this into a debug console window of the "Who is Hiring?" comment thread
	// then use as follows:
	//
	// query(term \| [term, term, ...], term \| [term, term, ...], ...)
	//
	// When arguments are in an array then that means an "or" and when they are seperate that means "and"
	//
	// Term is of the format:
	// ((-)text/RegExp) ( '-' means negation )

	(ns foami.core
	"FOreign Asynchronous Mechanism Interop"
	(:require [clojure.core.async :as async]))

	(defn put!
	"Takes a `ch`, a `msg`, a single arg function that when passed `true` enables backpressure
	and when passed `false` disables it, and a no-arg function which, when invoked, closes the
	upstream source."
	[ch msg backpressure! close!]
	(let [status (atom :sending]

	// Playground - noun: a place where people can play

	import Cocoa

	var str = "Hello, playground"

	// Here's take 1. First, I defined the algebra like I would in
	// Scala, as separate protocols:
	protocol Semigroup {
	typealias T

	(defn timeout-line-seq
	"Takes a reader, and returns a line-seq that can time out on reading the next line."
	[^Reader reader timeout]
	(let [q (LinkedBlockingQueue. 10)
	q-seq (fn this []
	(lazy-seq
	(if-let [l (.poll q timeout TimeUnit/MILLISECONDS)]
	(when-not (= ::end l)
	(cons l (this)))
	(do

	import uuid
	import wtforms_json
	from sqlalchemy import not_
	from sqlalchemy.dialects.postgresql import UUID
	from wtforms import Form
	from wtforms.fields import FormField, FieldList
	from wtforms.validators import Length

	from flask import current_app as app
	from flask import request, json, jsonify, abort