Skip to content

Instantly share code, notes, and snippets.

View excellent.csv
perl1 2 4.38690185546875e-05
perl2 2 2.78949737548828e-05
perl1 2 2.09808349609375e-05
perl2 2 1.97887420654297e-05
perl1 2 2.00271606445312e-05
perl2 2 2.09808349609375e-05
perl1 2 2.09808349609375e-05
perl2 2 2.09808349609375e-05
perl1 2 1.9073486328125e-05
perl2 2 2.00271606445312e-05
View keybase.md

Keybase proof

I hereby claim:

  • I am StefanKarpinski on github.
  • I am stefankarpinski (https://keybase.io/stefankarpinski) on keybase.
  • I have a public key whose fingerprint is 4C10 BA15 852B 3B75 CECA D1CC 369C FB85 AAE3 CB1B

To claim this, I am signing this object:

View Arrays.md

Arrays as Containers

Definitely 0.5:

  • Flip the switch on the concatenation deprecation (#8599)
  • Deprecate partial linear indexing (#5396, #14770)
  • ReshapedArrays (#10507, #15449, https://groups.google.com/d/msg/julia-dev/7M5qzmXIChM/kOTlGSIvAwAJ)
  • Julia native bounds checking and removal (#7799, #14474)
  • Drop dimensions indexed by a scalar (#13612)
  • Full APL slicing (#15431)
View Gadfly demo.ipynb
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@StefanKarpinski
StefanKarpinski / cards.md
Last active Sep 14, 2016
Julia Project Cards
View cards.md
  • Decision Needed: should we do something? yes or no.
  • Design Needed: yes, we should do something, but what?
  • Accepted: yes, and we have a plan.
  • In Progress: someone is working on it (applies to issue and corresponding PR).
  • Blocked: waiting on something (other issue, external dependency).
  • Stalled: there's a PR but it's not mergable and not being actively worked on.
  • Review Needed: there's a PR that's ready and people should review it.
View 9283.txt
Subject: [julia] Euclidean division: `div`, `rem` and friends (#9283)
------------------------
From: Simon Byrne <notifications@github.com>
Date: Tue, Dec 9, 2014 at 6:35 AM
To: JuliaLang/julia <julia@noreply.github.com>
For any two real numbers x and y, Euclidean division is the problem of finding an integer q (the quotient) and number r (the remainder, on an interval of length abs(y)) such that
View graphutils.jl
## Some graph functions ##
using Iterators
using Combinatorics
using Base.LinAlg: checksquare
#=
X = sparse([1,1,2,2,3,4,4], [2,5,5,3,4,5,6], 1, 6, 6)
X += X'
G = dropzeros!(1 - X)
View registry.diff
diff --git a/A/ACME/Compat.toml b/A/ACME/Compat.toml
index 1a2352fc5..5fc55bd4e 100644
--- a/A/ACME/Compat.toml
+++ b/A/ACME/Compat.toml
@@ -38,14 +38,14 @@ Compat = "0.38-1.0"
julia = "0.5-0.7"
["0.6.1-0.6.2"]
-julia = "0.5-1.1"
-
View definitions.jl
f(x::Int) = "$x is an integer"
f(x::String) = "$x is a string"
g = x::Int -> "$x is an integer"
g = x::String -> "$x is a string"
View randmatstat_optimized.jl
using LinearAlgebra, Statistics
function randmatstat(t)
n = 5
v = zeros(t)
w = zeros(t)
a = zeros(n, n)
b = zeros(n, n)
c = zeros(n, n)
d = zeros(n, n)