1. What is the advantage of persistent data structure? all data in the same block of memory,fast speed? It is suitable for what kind of needs?2. If not use nfreeze, I mean, just use
It is quite hard to answer those questions without seeing their actual use in context.
On the face of it, it doesn't make a lot of sense to freeze a hash in order to return it from a subroutine.
The only possible (tentative) clue I can glean from the snippet you've posted comes from the name %testresults. It is possible that the code goes on to compare those results with a pre-frozen, known good results hash; in which case the author might be relying upon doing a binary compare of the frozen hashes rather than having to do a looping, possibly recursive traversal to compare them. If so, it might be cleverly efficient; or just obscurely dangerous.
In reply to Re^5: parallel process on remote machines,read results and hanle timeout of those process
by BrowserUk
in thread parallel process on remote machines,read results and hanle timeout of those process
by x12345
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |