sebleier

i
me
my
myself
we
our
ours
ourselves
you
your

pksunkara

# vi: ft=dosini
[user]
	name = Pavan Kumar Sunkara
	email = [email protected]
	username = pksunkara
[core]
	editor = nvim
	whitespace = fix,-indent-with-non-tab,trailing-space,cr-at-eol
	pager = delta
[column]

Olical

Number.round = function() {
    return (this + 0.5) << 0;
};

jashkenas

// Here is a proposal for minimalist JavaScript classes, humbly offered.

// There are (at least) two different directions in which classes can be steered.
// If we go for a wholly new semantics and implementation, then fancier classical
// inheritance can be supported with parallel prototype chains for true inheritance
// of properties at both the class and instance level.

// If however, we keep current JavaScript prototype semantics, and add a form that
// can desugar to ES3, things must necessarily stay simpler. This is the direction
// I'm assuming here.

bgrins

// Detecting data URLs
// data URI - MDN https://developer.mozilla.org/en-US/docs/data_URIs
// The "data" URL scheme: http://tools.ietf.org/html/rfc2397
// Valid URL Characters: http://tools.ietf.org/html/rfc2396#section2

function isDataURL(s) {
    return !!s.match(isDataURL.regex);
}
isDataURL.regex = /^\s*data:([a-z]+\/[a-z]+(;[a-z\-]+\=[a-z\-]+)?)?(;base64)?,[a-z0-9\!\$\&\'\,\(\)\*\+\,\;\=\-\.\_\~\:\@\/\?\%\s]*\s*$/i;

huyhong

Nymphs blitz quick vex dwarf jog. (27 letters) 
DJs flock by when MTV ax quiz prog. (27 letters) (2 acronyms and a US spelling) 
Big fjords vex quick waltz nymph. (27 letters) 
Bawds jog, flick quartz, vex nymph. (27 letters) 
Junk MTV quiz graced by fox whelps. (28 letters) (Includes proper noun) 
Bawds jog, flick quartz, vex nymphs. (28 letters) 
Waltz, bad nymph, for quick jigs vex! (28 letters) 
Fox nymphs grab quick-jived waltz. (28 letters) 
Brick quiz whangs jumpy veldt fox. (28 letters) 
Glib jocks quiz nymph to vex dwarf. (28 letters) 

ondrek

data:image/gif;base64,R0lGODlhAQABAAAAACw=

MoOx

module.exports = function(options) {
      var el
        , a
        , i
      if (!options.tagName) {
        el = document.createDocumentFragment()
      }
      else {
        el = document.createElement(options.tagName)
        if (options.className) {

kleem

This experiment converts an SQL version of WordNet 3.0 into a graph, using the python library graph-tool. In order to create a taxonomical structure, only noun synsets, hyponym links and hypernym links are considered.

The result of the conversion is saved as GraphML, then rendered as the following hairball:

Since the graph can be considered a tangled tree, i.e. a tree in which some nodes have multiple parents, two untangled versions (using longest and shortest paths) are also provided as GraphML. Only a few links are lost (about 2%), making the tree a good approximation of the noun taxonomy graph.

patriciogonzalezvivo

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);