I have the following class:
class C1:
STORE = []
TYPE = []
ITEMS = []
PRICE = []
def __init__(self,STORE,TYPE,ITEMS,PRICE):
se
Items are alphanumerically ordered [...]
With all this data in a class, I run 'reports' with some 'complex' computation involved.
Are there data structures other than lists which would consume less memory and improve my performance?
I'm just guessing at your algorithms here: linear-time searching? If so, using an OrderedDict may improve performance greatly.
That won't solve the memory issue, though; consider using a proper database package instead, e.g. SQLite + SQLAlchemy or plain old bsddb with B-trees.