This algorithm returns the points that form an orthogonal path between two rectangles.
// Define shapes
const shapeA = {left: 50, top: 50, width: 100, height: 100};
const shapeB = {left: 200, top: 200, width: 50, height: 100};
This algorithm returns the points that form an orthogonal path between two rectangles.
// Define shapes
const shapeA = {left: 50, top: 50, width: 100, height: 100};
const shapeB = {left: 200, top: 200, width: 50, height: 100};
Unless otherwise noted (either in this file or in a file's copyright section) the contents of this gist are Copyright ©️2020 by Christopher Allen, and are shared under spdx:Creative Commons Attribution Share Alike 4.0 International (CC-BY-SA-4.) open-source license.
If you more tips and advice like these, you can become a monthly patron on my GitHub Sponsor Page for as little as $5 a month; and your contributions will be multipled, as GitHub is matching the first $5,000! This gist is all about Homebrew, so if you like it you can support it by donating to them or becoming one of their Github Sponsors.
package main | |
import ( | |
"context" | |
"grpc-tutorial/greeter" | |
"io" | |
"log" | |
"os" | |
"os/signal" | |
"sync" |
This content moved here: https://exploringjs.com/impatient-js/ch_arrays.html#quickref-arrays
let cache = new Map(); | |
let pending = new Map(); | |
function fetchTextSync(url) { | |
if (cache.has(url)) { | |
return cache.get(url); | |
} | |
if (pending.has(url)) { | |
throw pending.get(url); | |
} |
package main | |
import "fmt" | |
/* | |
Print 2-D array in spiral order | |
numbers := [ | |
[2, 4, 6, 8], |
package main | |
import ( | |
"fmt" | |
) | |
// Use map[string]interface{} to pair functions to name | |
// Could maybe use anonymous functions instead. Might be clean | |
// in certain cases | |
var funcMap = map[string]interface{}{ |