Adam easyrider

How to get on Rinkeby Testnet in less than 10 minutes

Following instructions from the excellent https://www.rinkeby.io/

Synchronizing a Full Node

A full node lets you access all state. There is a light node (state-on-demand) and wallet-only (no state) instructions as well,

Say we have a prop.users of the shape:

const users = [
    {username: 'bob', age: 30, tags: [{name: 'work', id: 1}, {name: 'boring', id: 2}]},
    {username: 'jim', age: 25, tags: [{name: 'home', id: 3}, {name: 'fun', id: 4}]},
    {username: 'jane', age: 30, tags: [{name: 'vacation', id: 5}, {name: 'fun', id: 4}]}
];

Vanilla JavaScript Quick Reference / Cheatsheet

Just migrated it from Codepen.io to markdown. Credit goes to David Conner.

Working with DOM	Working with JS	Working With Functions
Accessing Dom Elements	Add/Remove Array Item	Add Default Arguments to Function
Grab Children/Parent Node(s)	Add/Remove Object Properties	Throttle/Debounce Functions
Create DOM Elements	Conditionals

	var insertionSort = function (a) {
	// Iterate through our array
	for (var i = 1, value; i < a.length; i++) {
	// Our array is split into two parts: values preceeding i are sorted, while others are unsorted
	// Store the unsorted value at i
	value = a[i];
	// Interate backwards through the unsorted values until we find the correct location for our `next` value
	for (var j = i; a[j-1] > value; j--) {
	// Shift the value to the right
	a[j] = a[j-1];

	function(array, value) {
	var j = 0, length = array.length;
	// A for loop was used to save space. More easily understood as a while loop. Exits if our pointer moves out of range.
	while (j < length) {
	var i = (length + j - 1) >> 1; // move the pointer to the median value using a shift in place of Math.floor() (to save characters)
	// If the value we're searching for is greater than the median, move our lower-bound past the median
	if (value > a[i])
	j = i + 1;
	// Otherwise, if the value we're searching for is less than the median, move our upper-bound to the median value
	else if (value < array[i])

	var nodes = [
	{
	links: [ 1 ], // node 0 is linked to node 1
	visited: false
	}, {
	links: [ 0, 2 ], // node 1 is linked to node 0 and 2
	path: [],
	visited: false
	},
	...

	import sys


	def to_octets(ip):
	return [int(i) for i in ip.split('.')]


	def dotless_decimal(ip):
	octets = to_octets(ip)
	result = octets[0] * 16777216 + octets[1] * \

	import requests
	import re
	import sys
	from multiprocessing.dummy import Pool


	def robots(host):
	r = requests.get(
	'https://web.archive.org/cdx/search/cdx\
	?url=%s/robots.txt&output=json&fl=timestamp,original&filter=statuscode:200&collapse=digest' % host)

	import requests
	import sys
	import json


	def waybackurls(host, with_subs):
	if with_subs:
	url = 'http://web.archive.org/cdx/search/cdx?url=.%s/&output=json&fl=original&collapse=urlkey' % host
	else:
	url = 'http://web.archive.org/cdx/search/cdx?url=%s/*&output=json&fl=original&collapse=urlkey' % host

	var kurento = require('kurento-client');
	var express = require('express');
	var app = express();
	var path = require('path');
	var wsm = require('ws');

	app.set('port', process.env.PORT \|\| 8080);

	/*
	* Definition of constants