- 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.
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
module.exports = { | |
defaultBrowser: "Safari", | |
options: { hideIcon: true }, | |
rewrite: [ | |
{// rewrite meet.google.com URLs with `authuser=1` query string | |
match: ({ url }) => url.host == "meet.google.com", | |
url: ({ url }) => { | |
var parts = url.search == "" ? [] : | |
url.search.split(/[&;]/).filter( | |
part => !part.startsWith("authuser=") |
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
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) |
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
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" |
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
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" | |
- |
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
## 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) |
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
Subject: [julia] Euclidean division: `div`, `rem` and friends (#9283) | |
------------------------ | |
From: Simon Byrne <[email protected]> | |
Date: Tue, Dec 9, 2014 at 6:35 AM | |
To: JuliaLang/julia <[email protected]> | |
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 |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
- 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)
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:
NewerOlder