13 ms·
Do you really need to debug errors from implementing a stack? If you mean compile-time errors, I would look into getting your editor to report them while you ty
by skybrian 8y ago
Do you really need to debug errors from implementing a stack? If you mean compile-time errors, I would look into getting your editor to report them while you type.
- z0r 8y agoPeople constantly screw up the simplest and easiest things, especially when there are hundreds of simple and easy things in a program. And Go makes sure that you have to write a hundred simple and easy things every time you work with it to solve problems.
- kjksf 8y agoI just finished porting 50k loc from Java to Go: https://github.com/ravendb/ravendb-go-client https://github.com/ravendb/ravendb-go-client You won't find hundreds of purported simple/easy things that are exclusive to Go code. There's probably less than 10 cases where I implemented some simple thing (like a set of strings) that Java gave for free because of library function that used generics. Among 50k loc that's background noise.
- maximente 8y agodon't forget the defer keyword: from README: // ... use session session.Close() can be changed to this right after you get a session: defer session.Close()
- linuxftw 8y ago> Go makes sure that you have to write a hundred simple and easy things every time you work with it to solve problems. This is precisely how I feel, could never capture it in words myself.
- newen 8y agoPoint is you shouldn't have to implement a stack. I have never had to do that in any language I used except C. Sounds like a nightmare.
- courtf 8y agoLuckily you can implement a stack in 10 very simple lines. And if you don't want to do that, there are many existing implementations.
- tsimionescu 8y agoWell, not ones as efficient as the one showed here, since those can't be expressed in the language as it currently stands.
- tonyedgecombe 8y ago>there are many existing implementations Sounds like JavaScript/Node all over again, which shouldn't surprise anybody as many of the prominent Node developers hopped over to Go.
- kjksf 8y agopush: a = append(a, el) pop: n := len(a) el := a[n-1] a = a[:n-1] It took me, literally, 10 seconds to write.
- newen 8y agoIs that an O(n) implementation of pop? I hope you realize my point.. I looked it up and it's not but the point is that you shouldn't have to worry about these things, including implementation details of trees and hundreds of other data structures.
- oconnor663 8y agoIt isn't. It re-slices the backing array and retains its capacity. (Maybe that's what you looked up at the end?)
- stouset 8y agoMore importantly, this will take me a minute to read and two minutes to make sure it’s doing the right thing every time I encounter it somewhere new. I don’t think I will ever understand why so many go advocates seem so openly hostile to encapsulation. If go had used C-style for loops, I swear there would be people here defending the decision saying: sum := 0 for (i := 0; i <= len(a); i++) { sum = sum + a[1] } “See? Only four lines. What’s the big deal? It took me literally thirty seconds to write.”