arfon

Fixing problems when compiling programs

Most of us in science learn to write and build computer program in an ad-hoc way, copying bits of Makefile from other people, and using trial and error to change things.

That's fine when everything works, but when stuff starts to go wrong it's useful to have an idea of what different steps are happening during compilation, so you can figure out what's going wrong. In this post I'll talk at a a fairly high level about what happens when you compile code, and in a bit more detail about fixing problems you might see when you doing so.

Interpreted vs Compiled

arfon

Fraction of pull requests to Atom that end up being merged vs time (grouped by month). The size of the dot is proportional to the number of pull requests in that time period (mouseover to see the count).

Data pulled from the GitHub API:

• Code
• Data

arfon

date	C	Io	JavaScript	Lua	Ruby	Arc	Erlang	Objective-C	VimL	Ragel in Ruby Host	Scala	Emacs Lisp	Python	Shell	Assembly	Java	Perl	C++	Objective-J	ActionScript	OCaml	Nu	PHP	Common Lisp	CSS	Clojure	Matlab	CoffeeScript	ooc	Fancy	Racket	Rust	TeX	Haskell	TypeScript	Elixir	wisp	Go	C#
2008-02	4.545454545454546	4.545454545454546	9.090909090909092	2.272727272727273	79.54545454545455	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
2008-03	7.4074074074074066	0	7.4074074074074066	7.4074074074074066	62.96296296296296	3.7037037037037033	3.7037037037037033	3.7037037037037033	3.7037037037037033	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
2008-04	6.25	0	9.375	0	78.125	0	0	0	0	3.125	3.125	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
2008-05	3.225806451612903	0	6.451612903225806	0	83.87096774193549	0	0	0	0	0	0	3.225806451612903	3.225806451612903	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0	0
2008-06	3.0303030303030303	0	9.090909090909092	0	78.78787878787878	0	0	3.0303030303030303	

arfon

A  AH0
A(1)  EY1
A'S  EY1 Z
A.  EY1
A.'S  EY1 Z
A.S  EY1 Z
A42128  EY1 F AO1 R T UW1 W AH1 N T UW1 EY1 T
AAA  T R IH2 P AH0 L EY1
AABERG  AA1 B ER0 G
AACHEN  AA1 K AH0 N

arfon

###Title

Academic publishing using Git and GitHub

###Additional faciliators

Jessica Lord
Chrissie Brodigan
Andrew Nesbitt
Karthik Ram

arfon

{
  "@context": "http://schema.org",
  "@type": "ScholarlyArticle",
  "headline": "Implementing Transitive Credit",
  "dateCreated": "2014-07-10",
  "keywords": "transitive credit, credit for code, json-ld, linked data",
  "author": [
    {
    "@type": "Person",
    "name": "Daniel S. Katz",

arfon

arfon

{
  "@context": "http://schema.org",
  "@type": "Code",
  "name": "Fidgit",
  "codeRepository": "https://github.com/arfon/fidgit",
  "citation": "http://dx.doi.org/10.6084/m9.figshare.828487",
  "description": "An ungodly union of GitHub and Figshare http://fidgit.arfon.org",
  "dateCreated": "2013-10-19",
  "license": "http://opensource.org/licenses/MIT",
  "author": [

arfon

{
  "@context": "http://schema.org",
  "@type": "Code",
  "name": "Fidgit",
  "codeRepository": "https://github.com/arfon/fidgit",
  "citation": "http://dx.doi.org/10.6084/m9.figshare.828487",
  "description": "An ungodly union of GitHub and Figshare http://fidgit.arfon.org",
  "dateCreated": "2013-10-19",
  "license": "http://opensource.org/licenses/MIT",
  "author": {

arfon

@Grapes([
    @Grab('redis.clients:jedis:1.5.1'),
    @GrabConfig(systemClassLoader=true)
])
 
import redis.clients.jedis.*

performTest("unencoded", null) {n, e->
    n.toString()
}