meta user
network profile
| bio | website | |
|---|---|---|
| location | California | |
| age | ||
| visits | member for | 2 years |
| seen | yesterday | |
| stats | profile views | 136 |
|
May 14 |
awarded | Scholar |
|
May 14 |
accepted | Single codebase for client and server with Node.js |
|
May 14 |
comment |
Single codebase for client and server with Node.js Thank you. To be clear, I think the platform, the async model, the community, and the ecosystem are pretty awesome. Those are selling points, and big ones. I just don't think the language itself it a selling point, but everyone seems to use it as one. |
|
May 14 |
comment |
Single codebase for client and server with Node.js @hippietrail: the drawbacks have nothing to do with speed of the implementation. |
|
May 14 |
comment |
Single codebase for client and server with Node.js I don't think it's a stretch to say that javascript, the language, has problems. I mean, the most popular book is called "the good parts" and basically outlines a long list of gotchas. Even the "good parts" are full of gotchas. When I read that book, I was reminded of c++, and not in a good way. |
|
May 14 |
asked | Single codebase for client and server with Node.js |
|
May 7 |
awarded | Yearling |
|
Mar 8 |
awarded | Pundit |
|
Jan 2 |
comment |
Software Architecture: How to divide work to a network of computers? I'm surprised nobody has mentioned hadoop. |
|
Dec 28 |
comment |
What do Java developers think of Scala? this is neither true nor an answer to the original question. |
|
Nov 22 |
awarded | Nice Answer |
|
Oct 29 |
comment |
Is Perl still a useful, viable language? CPAN is just snake oil. |
|
Aug 19 |
comment |
Best approach for writing a chess engine? I hope alpha beta doesnt take years to write |
|
Aug 7 |
comment |
Space complexity of Iterative Deepening DFS Am I wrong or is iterative deepening (in chess at least) used with a transposition table (cache of positions) so branches times depth is the cache size (space used)? |
|
Aug 5 |
comment |
How to prevent intentional over-estimation in user stories? My point was that hiring that team is not so easy. |
|
Aug 5 |
comment |
How to prevent intentional over-estimation in user stories? Great answer. I provided padded estimates to a recent project (double what I thought realistic). Every sprint, every milestone, right on time. And devs were working full speed--there was just more to it than I had originally considered. |
|
Aug 5 |
comment |
How to prevent intentional over-estimation in user stories? So...first hire rock stars ("true professionals") and then sit back and smoke a cigar? |
|
Aug 5 |
comment |
How to prevent intentional over-estimation in user stories? @bryan: and if all devs do it their way then it's the scrum master who isn't working together as a team. Now who should be let go? |
|
Jul 21 |
awarded | Enthusiast |
|
Jul 19 |
comment |
Understanding comparison using Big O notation this is basically correct, but the linked list vs array list example is terrible. If a list is small the time to find the nth element will be about equal for either an array list or a linked list. Big O doesn't really matter until N is large. A better example is a binary search tree with O(log n) vs a hash map with O(1). The hash function is constant in time, but could be slower than binary search tree O(log n) for small values of N. Since it's constant, it will at some point (for large n) be less than log n. |
