Implementing find and remember
lWe must store every
OpenList ever produced (sharing tails,
etc.)
lWe must be able to find a list with equal firsts and rests.
lA na•ve implementation would store an internal list of all OpenLists (not itself a OpenList) and search the list with find.
lWe must be able to find a list with equal firsts and rests.
lA na•ve implementation would store an internal list of all OpenLists (not itself a OpenList) and search the list with find.
lThis process can
become slow.