Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Hashes and Arrays - Selecting a memory structure

by bruceb3 (Pilgrim)
on Sep 20, 2007 at 05:54 UTC ( [id://640045]=note: print w/replies, xml ) Need Help??


in reply to Hashes and Arrays - Selecting a memory structure

Do you think that you will ever have a need to do more then just find the highest value for each index? Basically you want to know when an index is making new highes, right? I ask because I have similar requirements for equities traded locally (I live in Australia). My solution was to process each log file and store the daily data for each stock in a separate file. I have code that uses WWW::Mechanize and friends, to log into my broker's web site and dl the end of day data. This file is then used to update the data for each stock.

In the code that I use to try and find a profitable way to trade options, I load the stock into a hash of arrays. The keys to the hash is date, open, high, low, close and volume. I have actually wrapped the hash up in a class for convenience and to handle any possible changes to the data that might cause a change to the implementation.

This method has worked well for me over a number of years and I would recommend doing something similar.

  • Comment on Re: Hashes and Arrays - Selecting a memory structure

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (2)
As of 2024-04-19 19:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found