stabbles

55 ms·

751.
by stabbles 8y ago
I must say my experiences with the Julia community were great ever since I joined their chat and forum in summer 2017 :).
752.
by stabbles 8y ago
Julia uses semantic versioning now, so there's a guarantee there will be no breaking changes.
753.
Live: A conversation with Gilbert Strang(youtube.com)
2 points by stabbles 8y ago|0 comments
754.
by stabbles 8y ago
Maybe you could use complex numbers to index matrices
755.
by stabbles 8y ago
Many things in Base have moved to separate packages to make it light-weight. FFTW is available in a package under the MIT license [1]. Also its author is a top contributor to Julia ;). [1] https://github.com/JuliaMath/F
756.
by stabbles 8y ago
If you feel uncomfortable, note that Julia internally has some indirection to allow for custom offsets. See for instance OffsetArrays.jl [1] [1] https://github.com/JuliaArrays/OffsetArrays.jl
757.
by stabbles 8y ago
There's Juno [1], works great. [1] http://junolab.org/
758.
by stabbles 8y ago
You don't even need to annotate things with types! > square(x) = x * x > @code_typed square(2.0) CodeInfo( 1 1 ─ %1 = Base.mul_float(%%x, %%x)::Float64 └── return %1 ) => Float64 > @co
759.
by stabbles 8y ago
Julia is such a delightful language! It allows rapid prototyping and at the same time it runs fast. It has a great REPL, package manager and workflow with Revise.jl.
760.
Making the Julia test-debug cycle more efficient(youtube.com)
6 points by stabbles 8y ago|0 comments
761.
An introduction to Julia(youtube.com)
3 points by stabbles 8y ago|0 comments
762.
by stabbles 8y ago
No, it's really just an iterator in Julia 0.7 or 1.0. At the same time it's just a function call. for x in itr println(x) end Is exactly equivalent to and syntactic sugar for y = iterate(itr) while y !
763.
by stabbles 8y ago
It all depends on the boundary conditions.
764.
by stabbles 8y ago
There is another theory which states that this has already happened
765.
by stabbles 8y ago
It's not legal, it's tolerated in law ( https://en.wikipedia.org/wiki/Gedogen )
766.
Automatic differentiation in Julia [video](youtube.com)
5 points by stabbles 8y ago|0 comments
767.
by stabbles 8y ago
Fortunately there is documentation about performance [1], which is about everything from type stability to SIMD. [1] https://docs.julialang.org/en/latest/manual/performance-tips...
768.
by stabbles 8y ago
Concerning the "Giving up on Julia" article, it's very dated and dubious. Please read [1]. About the second quote: this is not about Julia being slower than Python; it's about avoiding cache misses. Obviously you should
769.
by stabbles 8y ago
It's definitely targeting Python and R to the same extent as MATLAB, in the sense that it claims to solve the two-language problem that is so apparent in these languages. MATLAB, Python and R are easy scripting languages, but as soon a
770.
LCZero plays Stockfish 1.0 at TCEC(tcec.chessdom.com)
1 points by stabbles 9y ago|0 comments
771.
by stabbles 9y ago
Only tried GCC on Godbolt
772.
by stabbles 9y ago
True, I had hoped GCC would optimize that -- it doesn't :(.
773.
by stabbles 9y ago
You can get automatic vectorization (with -O3) like this: bool is_sorted(const int32_t* input, size_t n) { int32_t sorted = true; for (size_t i = 1; i < n; ++i) { sorted &= input[i - 1] <= input[i];
774.
by stabbles 9y ago
Would be interesting to provide videos of the evolved robots rather than just the anecdotes.
775.
Ask HN: What password manager do you recommend for non-technical people?
7 points by stabbles 9y ago|13 comments
776.
[video] Intro to JuliaDB, a package for working with large persistent data sets(youtube.com)
2 points by stabbles 9y ago|0 comments
777.
by stabbles 9y ago
Switch to Julia! Hit @edit unique([1,2,3,2]) in the REPL and you see the implementation.
778.
by stabbles 9y ago
pass [1] is great. The simple folder structure is great, it's built on git, it works with multiple pgp keys, and different folders can have different keys. [1] https://www.passwordstore.org/
779.
by stabbles 9y ago
Cramer's rule is unstable even for 2x2 problems
780.
by stabbles 9y ago
This article makes no sense at all. It compares a numerically unstable O(n!) algorithm (Cramer's rule) to a numerically stable O(n^3) algorithm (Gaussian elimination).

More ›