161–170 of 179 posts
Earlier quoted context omitted.
i don't know why your answer got downvoted. is HN community so devoid of a good sense of humor?
This is a super tired comment that gets posted endlessly. HN appreciates humor, but it loathes noise. A lot of humorous commentary is noise that adds no value. If you don't want your funny remarks down voted here, up your game.
Earlier quoted context omitted.
It is. Because everyone starts out knowing zero go, and so the learning curve of a language (and for people who know another programming language first) is very much a key metric.
I know pretty much nothing about Scala. Anybody cares for my criticism of its type system? And what's with Rust and those ampersands everywhere? GP wasn't discussing the language in general, just a small feature that depends on an idiomatic pattern used in many other places, saying "it looks gibberish." Of course it does, because it isn't idiomatic for you.
When I initially started Go, it felt so easy to pick up. Then I wrote a component in it and it felt overly verbose. Then I had to revisit the component and had to do some heavy refactoring/additional testing and realized that the language, to certain extent, didn't stand in the way. After all these iterations, I think Go is leaving an-even-bigger-adoption on the table for the want of following: 1. Functional operator…
>When I initially started Go, it felt so easy to pick up. Same. It felt freeing to just say "fuck it, I'll use a struct" and have the built-ins required to automagically marshall json on the wire to structs in memory. That was pretty cool. You're spawning threads^H^H^H^H^H^H^Hgoroutines and passing messages and not giving a fuck because the language protects you. Then I wanted to make v2 of my package. Go's packaging…
Gin for instance has a broken streaming api. No one is going to fix it. It would mean rewriting it from the ground up. Their contrib packages are mostly outdated and not functional. Gorilla is also in maintenance mode.
The talent is leaving Go. Go is also missing "the one true framework", e.g. what Spring is for Java. Or rails for Ruby or dotnet for C#. I've been with Go since mid 2013. I loved the Go+ community on Google+. I loved the language because it removed a lot of mental burden and allowed me to focus on problem solving instead of listening to people telling me "what's proper" when I had done it my way for 13 years before the new hype, successfully.
I loved the bright minds using and developing Go.
But now it feels like it's dying or stagnating.
I thought spf13 was a company, not a pseudonyme of a Google employee. I use cobra in 99% of my projects, but cobra and viper leave much to be desired especially the interoperability out of the box and documentation.
Earlier quoted context omitted.
*Much better than Google. Two Sigma is one of the top paying companies: https://www.levels.fyi/leaderboard/Software-Engineer/Entry-L... They pay _interns_ $70 per hour
Depends on the role, in general they’re not going to blow Google out of the water.
Two Sigma (and others) have been poaching senior level google talent at a quicker and quicker clip. Very exciting to watch the exodus happen!
Hedge funds/hf trading companies can't compete with monopolies in printing money. I wonder how they are getting all these people.
Are you saying trading companies aren't profitable enough?
Could use some editing to reduce the occurrence of "I".
Earlier quoted context omitted.
I haven't thought about this before, but I can't see how this would work. Instead, you'd convert to an adjacency matrix (with edge directions by only populating the upper rectangular region), then transpose the matrix, then convert back to a graph. The transpose should swap the i, j pair edge directions. Matrix inversion is super-expensive and I think it would produce somethign else entirely, probably not unlike matr…
Yep! It was not a serious suggestion, just a joke based on taking a circuitous route through the language.
Earlier quoted context omitted.
A tree is just a type of graph. A graph can be represented as an adjacency matrix. So come up with that matrix, then drop it into lapack for inversion. Lapack is well optimized so this is probably a very good solution.
Isn't that the idea behind graphBLAS? http://graphblas.engr.ucsb.edu/
My suggestion was just a joke, though, I don't think the inverse of the matrix that comes from a binary tree has any particular meaning.