Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re^4: Split a file based on column

by Anonymous Monk
on Jan 17, 2013 at 10:56 UTC ( #1013754=note: print w/ replies, xml ) Need Help??

in reply to Re^3: Split a file based on column
in thread Split a file based on column

FileCache - keep more files open than the system permits

Comment on Re^4: Split a file based on column
Replies are listed 'Best First'.
Re^5: Split a file based on column
by davido (Archbishop) on Jan 17, 2013 at 18:04 UTC O(n log n) time per handle fetch (if I'm reading the code right).

    The module seems to implement a Least Frequently Used cache (though it calls it Least Recently Used cache), and does so by incrementing and re-sorting on each request for a handle. And then there's this: "The module functionality relies on symbolic references, so things will break under 'use strict' unless 'no strict "refs"' is also specified." So the only way to use the module is to wrap the code that uses it in a scope block and specify no strict 'refs'; for that block. Talk about the implementation leaking outward into the interface!

    It's hard to believe it's still in the core.

    I think that a Fibonacci Heap solution would work nicely. Inserts (adding a handle) are constant time, remove least (dropping a seldom-used handle) is O(log n) time, change priority (calling for a handle and incrementing its use count) is a delete+insert (O(log n)). Of course the devil is in the details. If I find some free time I might give it a go and see how it works out.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1013754]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2015-11-26 16:57 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (703 votes), past polls