but this approach isn't quite what I'm looking for, since it is possible - I should even say probable - that the data structure has different key names from time to time. Therefore the real need is for a routine, that finds every key-value pair from an anonymous hash and after parsing the values return an exact copy of the original structure.