| // array utils | |
| // ================================================================================================= | |
| const combine = (...arrays) => [].concat(...arrays); | |
| const compact = arr => arr.filter(Boolean); | |
| const contains = (() => Array.prototype.includes | |
| ? (arr, value) => arr.includes(value) | |
| : (arr, value) => arr.some(el => el === value) |
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title>Popup without Javascript</title> | |
| <link rel="stylesheet" href="./style.css" /> | |
| </head> | |
| <body> | |
| <h1>Popup without javascript demo></h1> | |
| <p><a href="#my_popup">Open popup</a></p> | |
| <p>HTML visible body ends here</p> |
In this gist we are going to learn about basic goodies that we get from the library lodash/fp (fp stands for functional programming, great for ensuring immutability).We'll learn just by doing (step by step guided sample + codepens).
We'll cover lodash set and flow functions
Merge sort is one of the classic sorting algorithms. It divides the input array into two halves, recursively sorts each half, then merges the two sorted halves.
In this problem merge sort is used to sort an array of integers in ascending order. The exact behavior is given by the following pseudo-code:
function merge_sort(arr):
n = arr.length()
if n <= 1:
| // NOTE: https://medium.com/gitconnected/understand-javascript-promises-by-building-a-promise-from-scratch-84c0fd855720 | |
| class SimplePromise { | |
| constructor(executionFunction) { | |
| this.promiseChain = []; | |
| this.handleError = () => {}; | |
| this.onResolve = this.onResolve.bind(this); | |
| this.onReject = this.onReject.bind(this); | |
| // Keep in mind this could be simply retrieved in nodejs by | |
| // const { promisify } = require('util'); | |
| function promisify(fn) { | |
| return function(...args) { | |
| return new Promise((res, rej) => { | |
| fn(...args, function() { | |
| res(arguments) | |
| }) | |
| }) |
| function createObserver(listeners = {}) { | |
| function addListener(eventType, cb) { | |
| if (listeners.hasOwnProperty(eventType)) { | |
| listeners[eventType].push(cb); | |
| } else { | |
| listeners[eventType] = [cb]; | |
| } | |
| return function removeListener() { | |
| const index = listeners[eventType].indexOf(cb); |
Not for everyone. Each programmer has their own appreciation of what is good coding music.
(From most influential to least)
| // NOTE: you will NOT write code like this when using suspense | |
| // instead, you'll use react-cache (not yet officially published) | |
| // it'll handle things like pre-loading, handling rapid re-renders, etc. | |
| const cache = {} | |
| function FetchPokemon({pokemonName}) { | |
| const pokemon = cache[pokemonName] | |
| if (!pokemon) { | |
| const promise = fetchPokemon(pokemonName).then( |
| import { cloneElement } from 'react'; | |
| import PropTypes from 'prop-types'; | |
| function Compose(props) { | |
| return function renderRecursive(props.children, props.components, results = []) { | |
| if (!remaining[0]) { | |
| render(results); | |
| } | |
| function nextRender(value) { |