RudySeidinger (Rudy Seidinger)
- Login: RudySeidinger
- Registered on: 03/21/2018
- Last sign in: 03/21/2018
Issues
| open | closed | Total | |
|---|---|---|---|
| Assigned issues | 0 | 0 | 0 |
| Reported issues | 1 | 0 | 1 |
Activity
03/28/2018
-
09:42 AM Ruby Feature #14636: `Hash` has a method for accessing the shortest path towards a certain key
- nobu (Nobuyoshi Nakada) wrote:
> RudySeidinger (Rudy Seidinger) wrote:
> ...
Hmmm, interesting. What would use the block for, in the first scenario? the `yield` of the block would be execute in which context? inside the enumerator? -
- nobu (Nobuyoshi Nakada) wrote:
> RudySeidinger (Rudy Seidinger) wrote:
> ...
Sure. I just thought that the iterative approach would not justify not using recursion. The implementation would be way more complex with no clear advantage. ...
03/27/2018
-
- Hanmac (Hans Mackowiak) wrote:
> i have some thoughts about it ...
> ...
In this case, is the shortest path towards the first key containing the specified parameter, so would be
~~~ ruby
[:a]
~~~
-
- ## Abstract
Hashes, as a collection of key-value pairs, are often used to represent trees. Having a way of traversing the nodes quicker is very valuable when analyzing big hashes.
## Use-case
As pointed here, in the question https:/...