GitHub supports several lightweight markup languages for documentation; the most popular ones (generally, not just at GitHub) are Markdown and reStructuredText. Markdown is sometimes considered easier to use, and is often preferred when the purpose is simply to generate HTML. On the other hand, reStructuredText is more extensible and powerful, with native support (not just embedded HTML) for tables, as well as things like automatic generation of tables of contents.
This file contains 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
#!/usr/bin/python3 | |
# By Steve Hanov, 2011. Released to the public domain. | |
# Please see http://stevehanov.ca/blog/index.php?id=115 for the accompanying article. | |
# | |
# Based on Daciuk, Jan, et al. "Incremental construction of minimal acyclic finite-state automata." | |
# Computational linguistics 26.1 (2000): 3-16. | |
# | |
# Updated 2014 to use DAWG as a mapping; see | |
# Kowaltowski, T.; CL. Lucchesi (1993), "Applications of finite automata representing large vocabularies", | |
# Software-Practice and Experience 1993 |
This file contains 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
/** | |
* Created by Barrett Sonntag barretts@github on 3/2/2015. | |
* http://www.sosuke.com/writing-custom-extensions-for-the-remarkable-javascript-markdown-parser | |
* | |
* A plugin tutorial for Remarkable https://github.com/jonschlinkert/remarkable | |
*/ | |
var markdownParser = new Remarkable(); | |
// open links in new windows |
This file contains 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
let recordedChanges = [] | |
let startRecordingSVG = () => { recordedChanges = [] } | |
let stopRecordingSVG = () => { console.log(JSON.stringify(recordedChanges)) } | |
let observer = new MutationObserver(mutationRecords => { | |
for(const record of mutationRecords) { | |
if(record.attributeName === 'd') { | |
recordedChanges.push(record.target.getAttribute('d')) | |
} | |
} |
This file contains 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
[zack@leto ~]$ sudo tee << EOF /etc/wpa_supplicant.conf > /dev/null | |
ctrl_interface=/run/wpa_supplicant | |
EOF | |
[zack@leto ~]$ sudo wpa_supplicant -iwlp1s0 -Dnl80211 -c/etc/wpa_supplicant.conf -B | |
Successfully initialized wpa_supplicant | |
[zack@leto ~]$ sudo wpa_cli | |
wpa_cli v2.0 | |
Copyright (c) 2004-2012, Jouni Malinen <[email protected]> and contributors | |
This software may be distributed under the terms of the BSD license. |
We will be creating dual boot for OS X and Linux with no special boot loader. For other setup, refer to [1]. We will keep all data on an external hard drive, so we do not need huge amount of space for the linux system. We will install from an USB thumb drive (will need at least 1GB in size), newer Minis do not have CD roms.
This file contains 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
import tensorflow as tf #We need tensorflow 2.x | |
import numpy as np | |
#The hashlength in bits | |
hashLength = 256 | |
def buildModel(): | |
#we can set the seed to simulate the fact that this network is known and doesn't change between runs | |
#tf.random.set_seed(42) | |
model = tf.keras.Sequential() |
This file contains 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
if(typeof(ArrayBuffer.prototype.transfer) === "undefined") { | |
ArrayBuffer.prototype.transfer = function transfer(old) { | |
var dva, dvb, i, mod; | |
dva = new DataView(this); | |
dvb = new DataView(old); | |
mod = this.byteLength%8+1; | |
for(i = 0; i <= old.byteLength-mod; i+=8) dva.setFloat64(i, dvb.getFloat64(i)); | |
mod = this.byteLength%4+1; | |
if(i < old.byteLength-mod) { | |
dva.setUint32(i, dvb.getUint32(i)); |
This file contains 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
function memcpy (src, srcOffset, dst, dstOffset, length) { | |
var i | |
src = src.subarray || src.slice ? src : src.buffer | |
dst = dst.subarray || dst.slice ? dst : dst.buffer | |
src = srcOffset ? src.subarray ? | |
src.subarray(srcOffset, length && srcOffset + length) : | |
src.slice(srcOffset, length && srcOffset + length) : src |
This file contains 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
// This is free and unencumbered software released into the public domain. | |
// Marshals a string to an Uint8Array. | |
function encodeUTF8(s) { | |
var i = 0, bytes = new Uint8Array(s.length * 4); | |
for (var ci = 0; ci != s.length; ci++) { | |
var c = s.charCodeAt(ci); | |
if (c < 128) { | |
bytes[i++] = c; | |
continue; |
NewerOlder