2006, I think. Or _maybe_ the early part of 2007, I can't remember exactly. Didn't really get popular until 2014 though.
As other top-level posts have pointed out they're only removing it from the build process, it's still available to users. I wouldn't worry too much about about GCC going away, it's still the default compiler for most…
> Somehow this works even across SSH connections… The source code[1] is quite simple to read (as long as you know Bash) but basically imgcat prints a special OSC[2] sequence (some bytes that tell the terminal to do…
The article refers to that as escaping output rather than sanitising input: > And of course use your SQL engine’s parameterized query features so it properly escapes variables when building SQL:
> an incomplete microservice migration where you've now got hobbled together half-service weirdware that you have to support forever. Ugh I have to deal with this at my current job, except it's not an incomplete…
Am I reading that correctly? A porcelain command is one that's not supposed to be used in scripts, but the --porcelain flag is for when you do want to use things in scripts?
> If I can reduce my entire desktop environment into a single config file and have it reliably reconstruct itself, it would be magical. I might be missing something, but it sounds like that's what home-manager[1] was…
I actually did some benchmarking on this once upon a time[1] and it turns out that it's actually really easy to write something that is only ~5x slower[2] (until you get to matrices that don't fit in RAM): (4, 4, 4) (5,…
What would it even mean for a container to be ordered if you can't iterate through it?
It's extra annoying because collections.OrderedDict has been in the standard library for ages.
My main issue with it is that if someone figures out an even better way to do dictionaries but it doesn't preserve insertion order, then that technique can't be used. But I certainly wouldn't call it a stupid decision,…
It is but in the context of this discussion it's very clear that they meant a tracing garbage collector, which has a very different cost than atomic reference counting. Or to put it another way: you're technically…
Nah, it's true for all columns: SQL*Plus: Release 11.2.0.4.0 Production on Mon Feb 3 15:56:30 2020 Copyright (c) 1982, 2013, Oracle. All rights reserved. Connected to: Oracle Database 11g Express Edition Release…
> AFAICT there's no easy way to measure the LoC actually compiled I take it you can't just run it through the preprocessor then count the lines of code that are output from that?
Firstly, I think you're taking this waaaayyyy more seriously than it was intended. Secondly double foo = 1.2; printf(foo); puts(foo); won't compile, while double foo = 1.2; display(foo); works fine. Incidentally I…
Maybe I'm missing a joke here, but if that's your workflow then there's absolutely no advantage to notebooks over something like Spyder or even VS Code.
Remember the paper is talking about entropy[1] rather than any kind of human-encoded information. [1]: https://www.port.ac.uk/about-us/structure-and-governance/our...
What kind of storage device? I'm fairly sure in a HDD the 1 and 0 states have the same energy, and from what I know about SSDs I think the same is true there.
From the paper: > For 1Tb device the estimated mass change is 2.5 × 10^-25 Kg. I don't actually know how precise we're currently able to measure mass, though.
Isn't this basically what SystemD is, except it just so happens that all of those components are in one git repo?
To be honest sitting in a car with 2 "crazies" and a drunk doesn't sound any worse than sitting on a bus with 50 "crazies" and 25 drunks would be for the other 25 people.
> most GC gives no guarantees that memory will immediately be cleaned up once the last reference goes out of scope But in this example the last reference hasn't gone out of scope, the last reference is in the closure.…
It's impossible to write a compose function with the declaration fn compose<T, F: Fn(T) -> T>(f1: F, f2: F) -> F As far as I'm aware the only way to write a function like that is fn compose<T, F: Fn(T) -> T>(f1: F, f2:…
> It is effectively a slow ... raw pointer. In my experience (unless I've misunderstood what you're trying to say) this is the fastest way to write graphs because of how much more cache-friendly it is than having to…
> Is it possible on one of the other hosting services, like Gitlab? Looks like you can on GitLab under "Settings" > "General" > "Visibility, project features, permissions".
2006, I think. Or _maybe_ the early part of 2007, I can't remember exactly. Didn't really get popular until 2014 though.
As other top-level posts have pointed out they're only removing it from the build process, it's still available to users. I wouldn't worry too much about about GCC going away, it's still the default compiler for most…
> Somehow this works even across SSH connections… The source code[1] is quite simple to read (as long as you know Bash) but basically imgcat prints a special OSC[2] sequence (some bytes that tell the terminal to do…
The article refers to that as escaping output rather than sanitising input: > And of course use your SQL engine’s parameterized query features so it properly escapes variables when building SQL:
> an incomplete microservice migration where you've now got hobbled together half-service weirdware that you have to support forever. Ugh I have to deal with this at my current job, except it's not an incomplete…
Am I reading that correctly? A porcelain command is one that's not supposed to be used in scripts, but the --porcelain flag is for when you do want to use things in scripts?
> If I can reduce my entire desktop environment into a single config file and have it reliably reconstruct itself, it would be magical. I might be missing something, but it sounds like that's what home-manager[1] was…
I actually did some benchmarking on this once upon a time[1] and it turns out that it's actually really easy to write something that is only ~5x slower[2] (until you get to matrices that don't fit in RAM): (4, 4, 4) (5,…
What would it even mean for a container to be ordered if you can't iterate through it?
It's extra annoying because collections.OrderedDict has been in the standard library for ages.
My main issue with it is that if someone figures out an even better way to do dictionaries but it doesn't preserve insertion order, then that technique can't be used. But I certainly wouldn't call it a stupid decision,…
It is but in the context of this discussion it's very clear that they meant a tracing garbage collector, which has a very different cost than atomic reference counting. Or to put it another way: you're technically…
Nah, it's true for all columns: SQL*Plus: Release 11.2.0.4.0 Production on Mon Feb 3 15:56:30 2020 Copyright (c) 1982, 2013, Oracle. All rights reserved. Connected to: Oracle Database 11g Express Edition Release…
> AFAICT there's no easy way to measure the LoC actually compiled I take it you can't just run it through the preprocessor then count the lines of code that are output from that?
Firstly, I think you're taking this waaaayyyy more seriously than it was intended. Secondly double foo = 1.2; printf(foo); puts(foo); won't compile, while double foo = 1.2; display(foo); works fine. Incidentally I…
Maybe I'm missing a joke here, but if that's your workflow then there's absolutely no advantage to notebooks over something like Spyder or even VS Code.
Remember the paper is talking about entropy[1] rather than any kind of human-encoded information. [1]: https://www.port.ac.uk/about-us/structure-and-governance/our...
What kind of storage device? I'm fairly sure in a HDD the 1 and 0 states have the same energy, and from what I know about SSDs I think the same is true there.
From the paper: > For 1Tb device the estimated mass change is 2.5 × 10^-25 Kg. I don't actually know how precise we're currently able to measure mass, though.
Isn't this basically what SystemD is, except it just so happens that all of those components are in one git repo?
To be honest sitting in a car with 2 "crazies" and a drunk doesn't sound any worse than sitting on a bus with 50 "crazies" and 25 drunks would be for the other 25 people.
> most GC gives no guarantees that memory will immediately be cleaned up once the last reference goes out of scope But in this example the last reference hasn't gone out of scope, the last reference is in the closure.…
It's impossible to write a compose function with the declaration fn compose<T, F: Fn(T) -> T>(f1: F, f2: F) -> F As far as I'm aware the only way to write a function like that is fn compose<T, F: Fn(T) -> T>(f1: F, f2:…
> It is effectively a slow ... raw pointer. In my experience (unless I've misunderstood what you're trying to say) this is the fastest way to write graphs because of how much more cache-friendly it is than having to…
> Is it possible on one of the other hosting services, like Gitlab? Looks like you can on GitLab under "Settings" > "General" > "Visibility, project features, permissions".