marvinhagemeister

/* eslint-disable no-unused-vars */
/* eslint-disable no-else-return */

// JSX constructor, similar to createElement()
export const h = (type, props, ...children) => {
	return {
		type,
		// Props will be an object for components and DOM nodes, but a string for
		// text nodes
		props,

WebReflection

Handy Custom Elements' Patterns

^{Photo by Ricardo Gomez Angel on Unsplash}

This gist is a collection of common patterns I've personally used here and there with Custom Elements.

These patterns are all basic suggestions that could be improved, enriched, readapted, accordingly with your needs.

briancavalier

export type Cancel = void | ((k: (r: void) => void) => void)

export const runCancel = (c: Cancel, k: (r: void) => void): void =>
  c ? c(k) : k()

export type Fx<H, A> = (handler: H, k: (a: A) => void) => Cancel
export type Pure<A> = Fx<{}, A>

export const handle = <H0, H1, A>(fx: Fx<H0 & H1, A>, h1: H1): Fx<H0, A> =>
  (h0, k) => fx({ ...h0, ...h1 } as H0 & H1, k)

Frikki

{
    "lerna": "2.11.0",
    "version": "independent",
    "npmClient": "yarn",
    "useWorkspaces": true,
    "command": {
        "publish": {
            "allowBranch": "master"
        }
    }

developit

lit-html + unistore

import { html, render } from 'lit'
import { provide, connect } from './unlit'

const app = provide(store)( () => html`<div>${counter}</div>` )

const counter = connect('count', {

avanslaars

[alias]
	aliases = config --get-regexp '^alias\\.'
	br = branch
	branch-name = rev-parse --abbrev-ref HEAD
	ci = commit -m
	cm = !git add -A && git commit -m
	co = checkout
	cb = rev-parse --abbrev-ref HEAD
	cob = checkout -b
	cl = checkout -

buzzdecafe

CATEGORY THEORY FOR PROGRAMMERS

Category Theory 1.1: Motivation and Philosophy 
https://www.youtube.com/watch?v=I8LbkfSSR58&index=1&list=PLbgaMIhjbmEnaH_LTkxLI7FMa2HsnawM_

Composability, Abstraction, Reusability

Category Theory is a higher-level language.
Not a practical, executable language.

safareli

• Monads are Trees with Grafting
• Understanding F-Algebras
• The Interpreter Pattern Revisited
• Difference between free monads and fixpoints of functors?
• What is the “Free Monad + Interpreter” pattern?
• What are free monads?
• ScalaZ - Getting to grips with the Free Monad
• A Modern Architecture for FP
• Freer Monad, More Extensible Effects
• Dead-Simple Dependency Injection

yang-wei

Should be work with 0.18

Destructuring(or pattern matching) is a way used to extract data from a data structure(tuple, list, record) that mirros the construction. Compare to other languages, Elm support much less destructuring but let's see what it got !

Tuple

myTuple = ("A", "B", "C")
myNestedTuple = ("A", "B", "C", ("X", "Y", "Z"))

DrBoolean

const daggy = require('daggy');
const {foldMap} = require('pointfree-fantasy')
const {concat, toUpper, prop, identity, range, compose} = require('ramda');

// Contravariant functors usually have this shape F(a -> ConcreteType).
// In other words, some type holding a function which is parametric on its input, but not output.
// They don't always have that shape, but it's a good intuition
// Covariant functors are what we're used to, which are parametric in their output
//================================================================