StefanKarpinski

# Uninstallable versions in the General registry
# Complete SAT census, 2026-07-29 (registry state: 14,014 packages / 157,194 versions)
# Method: non-exclusive whole-registry SAT instance; a version is listed iff it
# appears in NO valid solution (its dependency cone is unsatisfiable).
# 587 versions across 161 packages; 362 detectable by arc-consistency, 225 SAT-only.
# Columns: package <TAB> version_rank (1 = newest) <TAB> version
#
Amaru	1	0.6.5
Amaru	2	0.6.4
Amaru	3	0.6.3

StefanKarpinski

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=")

StefanKarpinski

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)

StefanKarpinski

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"

StefanKarpinski

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"
-

StefanKarpinski

## 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)

StefanKarpinski

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

StefanKarpinski

• 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.

StefanKarpinski

StefanKarpinski

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)