5 ms·
that's the beauty of type after name, it's all left to right, even in special-cases of array, references, and the most confusing-contributor to cdecl: functions
by unrealhoang 2y ago
that's the beauty of type after name, it's all left to right, even in special-cases of array, references, and the most confusing-contributor to cdecl: functions `func(int)[5]*string`: perfectly clear, just read left to right.
- gf000 2y agoWhat about a Map<int, String>? You can't really encode a tree structure with only linear semantics (without at least something like s-expressions).
- unrealhoang 2y agoAnd type declarations are s-exprs. The advantage of type after name is that it keeps the traversing order consistently pre-order (node, left, right), instead of either: - the notoriously ridiculous spiral cdecl: reading stuff right (output), node (func name) and left (input) - create a new name to describe the function in pre-order: Func<Input, Output>
- gf000 2y agoBut you can't know how many parameters do a user-defined "node" have. I don't see how it can work for generic data structures without a specific syntax for "the children of this node". Go also uses [] for generics, doesn't it? At that point I find a uniform system (without special-casing arrays and pointers - they are also just types) would be simpler.