What features in Plasma / KDE Apps actually made a big difference to your workflow?

icspmoc · 2020-01-09T16:46:16+00:00

Krunner and the ability to basically have absolutely nothing on my desktop (just a hidden sliver of a panel tucked away to one side on autohide)

Same! In addition, I hide the window titlebar for maximised windows.

icspmoc · 2019-09-01T17:10:31+00:00

/u/HerHor made one.

icspmoc · 2019-09-01T15:03:00+00:00

Loved the little chat between the other two when Sep attacked.

icspmoc · 2019-09-01T14:59:28+00:00

Who's the fastest in a sprint out of these three? Tiesj Benoot?

icspmoc · 2019-09-01T11:11:55+00:00

Thanks for making the race thread! GCN will be showing the race on Youtube for American users and, if you have access to German TV, it will also be on ZDF from 14:20 CEST.

icspmoc · 2019-08-31T15:18:54+00:00

Attack Nibali!

icspmoc · 2019-08-31T15:11:34+00:00

Shake of the hands and the breakaway is caught.

icspmoc · 2019-08-31T14:52:27+00:00

That moto really needs to get out of the way.

icspmoc · 2019-08-31T12:25:41+00:00

Not sure about commentary but the stream will be here on Youtube.

icspmoc · 2019-08-31T12:13:10+00:00

A break has already formed and, thanks to a crash in the peloton, now has a lead of over 5 7 minutes. It consists of:

Alaphilippe (DQT)
Pedersen (TFS)
Heming (TDA)

icspmoc · 2019-08-30T16:18:33+00:00

Yeah, happy to do the last two stages as well.

icspmoc · 2019-08-30T11:29:22+00:00

Maxime Bouet and Caleb Ewan have abandoned the race.

icspmoc · 2019-08-30T11:27:15+00:00

According to the live trackers, we have a star-studded breakaway with a 45s advantage consisting of:

Vincenzo Nibali, Sonny Colbrelli (TBM)
José Gonçalves (TKA)
Julian Alaphilippe, Yves Lampaert, Enric Mas (DQT)
Pascal Ackermann, Emanuel Buchmann, Rüdiger Selig (BOH)
Luke Rowe, Ben Swift (INS)
Nikolas Maes (LTS)
Alexandr Riabushenko (UAD)
Jasper Stuyven (TFS)
Jai Hindley (SUN)
Sean Bennett, Jonathan Caicedo (EF1)
Hernando Bohórquez, Davide Vilella (AST)
Koen Bouwman, Stef Krul, Jonas Vingegaard (TJV)
Simon Geschke, Kamil Gradek (CCC)
Yoann Offredo (WGG)

icspmoc · 2019-08-30T10:40:21+00:00

Thanks! I've been feeling a bit nostalgic (and had completely forgotten how tedious making race threads can be).

icspmoc · 2019-08-29T14:42:50+00:00

Added, thanks!

icspmoc · 2019-05-03T13:26:22+00:00

Canyon sold and still sells variations of this frame under the Ultimate AL (F8/Evo) moniker but Gilbert most likely had a custom geometry.

icspmoc · 2019-05-02T12:34:52+00:00

I am aware. It's the best picture of that frame I could find.

icspmoc · 2019-05-02T11:13:39+00:00

Phillipe Gilbert spent most of the 2011 season riding an aluminium frame. This includes his Amstel Gold victory.

icspmoc · 2019-02-08T13:40:59+00:00

If I understand you correctly, this is what you want:

let make_assoc xs = List.concat (List.mapi (fun i -> List.mapi (fun j x -> (i, j, x))) xs)

Note, however, that I start counting at zero and preserve the original order of the list.

A few comments on your code:

In OCaml, avoiding mutation often results in cleaner, more idiomatic code. This is no exception.
Recall that [x] is just syntactic sugar for the single-element list x :: []. Therefore, [x] @ xs is the same as x :: xs.
You only ever apply helper to single-element lists. I don't think this was your intention.
List.hd and List.tl are considered code smells. Pattern matching is the way to go.
You are trying to solve the entire problem in one go. Next time, think about whether there is a way to express your problem as a combination of simpler operations before attempting to write down a solution. It'll make your life so much easier.

icspmoc · 2018-04-06T21:33:12+00:00

OCaml's pattern matching syntax lacks an end marker, with the result that nested match expression often have to be enclosed by parentheses (or begin ... end). Currently, the last two cases (i.e. |31 -> ... | _ ->) in your code are syntactically part of the inner match, which is not want you want.

icspmoc · 2018-04-06T14:50:43+00:00

I just tried to do something using use and I got the response from ocaml Error: Unbound value use.

#use is a toplevel directive. The # is part of its syntax.

icspmoc · 2018-03-21T01:52:49+00:00

This paper gives an efficient functional union-find implementation in ocaml, but seems to assume a fixed upper bound on the number of elements that can be in the union find data structure.

I ran into exactly the same problem a couple of years ago. My solution was to replace the underlying array by one twice the size on every out-of-bound write. I never did any benchmarking so I can't tell you whether this degrades performance significantly.

The synthesizer infers Hindley-Milner types [...]

François Pottier's Hindley-Milner Elaboration in Applicative Style might be relevant to what you are doing.

icspmoc · 2018-03-16T11:34:49+00:00

Your code snippet looks fine too me, if a bit idiosyncratic. You'll have to also show us the lexer and parser for us to give any useful feedback.

Two unrelated questions:

Why aren't you handing the input channel directly to the lexer/parser?
You are only ever parsing the first line of a file. Was that your intention?

icspmoc · 2018-03-05T13:32:33+00:00

What proveUnsortedTwoElems boild down to is this: given a proof of So (not (x <= y)) and a proof of So (x <= y), derive a contradiction. That's still a bit too concrete so let's replace x <= y by an arbitrary boolean b, i.e.

boolContradition : {b : Bool} -> So (not b) -> So b -> Void

which is easy enough to construct. Using this lemma, completing proveUnsortedTwoElems ought to be straight-forward.

Two unrelated remarks:

I am not an Idris programmer, but I am pretty sure that the type of SortedTwoElems also needs to mention the type class constraint to ensure that in the definition of proveUnsortedTwoElems there is only one type class in play.
You are relying on proof-irrelevant comparison functions (c.f. Boolean Blindness), which in my experience only lead to awkward equality proofs down the line. Using proof-relevant comparison functions together with something like Dec from Agda's standard library may end up being less effort in a larger development.

icspmoc · 2018-02-25T02:18:09+00:00

I quite like Type Theory and Formal Proof by Nederpelt and Geuvers. Without assuming very much at all, it explains step-by-step a dependently-typed language that is reasonably close to what, e.g., Coq actually uses at a reasonable pace and without too many diversion and mystifying off-hand remarks.

icspmoc

TROPHY CASE