| Arduino | mBed |
|---|---|
| Basic GPIO | |
void foo() | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // An SSH and SFTP server. It doesn't support 'exec' commands yet (WIP). | |
| package main | |
| import ( | |
| "crypto/rand" | |
| "crypto/rsa" | |
| "encoding/binary" | |
| "fmt" | |
| "io" | |
| "io/ioutil" |
This page describes how to install Tomato on an Asus RT-N16 router (and possibly others) in Linux.
Note that the original Tomato is no longer developed. There are two maintained mods, as of 2016 - Toastman and Shibby.
There are loads of different version to download. The information about which to choose isn't very clear. There is some information here, here, here and here.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Copyright 2016 Alex Yanchenko | |
| * | |
| * Extracted from DroidParts by Tim Hutt, 1/8/2016. | |
| * | |
| * Licensed under the Apache License, Version 2.0 (the "License"); | |
| * you may not use this file except in compliance with the License. | |
| * You may obtain a copy of the License at | |
| * | |
| * http://www.apache.org/licenses/LICENSE-2.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // AppleScript to reload a Chrome tab. | |
| function run(argv) { | |
| if (argv.length !== 1) { | |
| console.log("Please supply a (partial) URL to reload"); | |
| return; | |
| } | |
| console.log("Trying to reload: " + argv[0]); | |
| let a = Application("Google Chrome"); | |
| for (let i = 0; i < a.windows.length; i++) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| use std::fmt::Write; | |
| // The layout algorithm works as follows. | |
| // | |
| // 1. You walk through the AST and build up a LayoutNode tree (see test for example). | |
| // 2. We walk through the LayoutNode tree. For each Group we check if can be laid | |
| // out over a single line. If so do that, otherwise splay it over multiple lines. | |
| // 3. Each time we get to a Nested node, increase the indentation level. | |
| // | |
| // This works pretty well, but it suffers from one issue: splayed lines can |