lyj lengyijun

Using `<details>` in GitHub

Suppose you're opening an issue and there's a lot noisey logs that may be useful.

Rather than wrecking readability, wrap it in a <details> tag!

<details>
 Summary Goes Here

Clone your gist (replace <hash> with your gist's hash):

# with ssh
git clone [email protected]:<hash>.git mygist

# with https

Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to

Ok, I geeked out, and this is probably more information than you need. But it completely answers the question. Sorry. ☺

Locally, I'm at this commit:

$ git show
commit d6cd1e2bd19e03a81132a23b2025920577f84e37
Author: jnthn <[email protected]>
Date:   Sun Apr 15 16:35:03 2012 +0200

When I added FIRST/NEXT/LAST, it was idiomatic but not quite so fast. This makes it faster. Another little bit of masak++'s program.

	#!/bin/sh
	#
	# appimage-vivaldi.sh (version 0.9)
	#
	# A script to convert a Vivaldi rpm or deb into AppImage format.

	# Before you use this script, you may need to adjust the following
	# variable, based on the name and location of AppImageTool on your
	# system.
	#

	/*

	Goldbach's conjecture tested by a 47-state Turing machine

	Author: Jared Showalter

	If "a" and "i" were unbounded, this program would halt iff Goldbach's
	conjecture is false. Furthermore, the program structurally
	corresponds to a Turing machine with two symbols, one tape, and a
	small number of states. The array "a" corresponds to the tape (each

	import (
	"crypto/md5"
	"encoding/hex"
	)

	func GetMD5Hash(text string) string {
	hasher := md5.New()
	hasher.Write([]byte(text))
	return hex.EncodeToString(hasher.Sum(nil))
	}