|
|
|
|
|
by lederhosen
2855 days ago
|
|
I can not create a really mean example because Go is Turing complete. That means that everything can (with a few extra lines) be expressed in Go. The problem with your mutex solution is at least two: 1) it is more complex * more lines to type and read and check and thus harder to understand * you can forget the mutex * if you have data structures of hastables, you will have to pass mutexes around or store them together with the tables. 2) it is not nearly as performent as a lock free hash table (edit indentation) |
|