Question

I have a list of data that includes both command strings as well as the alphabet, upper and lowercase, totaling to 512+ (including sub-lists) strings. I want to parse the input data, but i cant think of any way to do it properly other than starting from the largest possible command size and cutting it down until i find a command that is the same as the string and then output the location of the command, but that takes forever. any other way i can think of will cause overlapping. im doing this in python

say:

L = ['a', 'b',['aa','bb','cc'], 'c']

for ‘bb’ the output would be ‘0201’ and ‘c’ would be ’03’

so how should i do this?

Answer 1

It sounds like you’re searching through the list for every substring. How about you built a dict to lookup the keys. Of cause you still have to start searching at the longest subkey.

L = ['a', 'b',['aa','bb','cc'], 'c']

def lookups( L ):
    """ returns `item`, `code` tuples """
    for i, item in enumerate(L):
        if isinstance(item, list):
            for j, sub in enumerate(item):
                yield sub, "%02d%02d" % (i,j)
        else:
            yield item, "%02d" % i

You could then lookup substrings with:

lookupdict = dict(lookups(L))
print lookupdict['bb'] # but you have to do 'bb' before trying 'b' ...

But if the key length is not just 1 or 2, it might also make sense to group the items into separate dicts where each key has the same length.