úÎ+`)Å     =The values stored in the Map of the LRU cache. They embed a . doubly-linked list through the values of the . The actual value %the key of the value before this one $the key of the value after this one 2Stores the information that makes up an LRU cache ,the key of the most recently accessed entry -the key of the least recently accessed entry "the maximum size of the LRU cache  the backing  :Make an LRU. The LRU is guaranteed to not grow above the  specified number of entries. the maximum size of the LRU BBuild a new LRU from the given maximum size and list of contents, B in order from most recently accessed to least recently accessed. the maximum size of the LRU ;Retrieve a list view of an LRU. The items are returned in ? order from most recently accessed to least recently accessed. >Add an item to an LRU. If the key was already present in the < LRU, the value is changed to the new value passed in. The @ item added is marked as the most recently accessed item in the  LRU returned. <If this would cause the LRU to exceed its maximum size, the 5 least recently used item is dropped from the cache. ?Look up an item in an LRU. If it was present, it is marked as 0 the most recently accesed in the returned LRU. BRemove an item from an LRU. Returns the new LRU, and if the item  was present to be removed. ;Returns the number of elements the LRU currently contains. =Internal function. The key passed in must be present in the ; LRU. Moves the item associated with that key to the most  recently accessed position. @Internal function. This checks the three structural invariants  of the LRU cache structure:  The cache'/s size does not exceed the specified max size. E The linked list through the nodes is consistent in both directions. A The linked list contains the same number of nodes as the cache.           The opaque wrapper type 2Make a new AtomicLRU with the given maximum size. the maximum size 8Build a new LRU from the given maximum size and list of  contents. See   for the semantics. the maximum size +Retreive a list view of an AtomicLRU. See   for the  semantics.  Insert a key/#value pair into an AtomicLRU. See  for  the semantics. #Look up a key in an AtomicLRU. See  for the  semantics. @Remove an item from an AtomicLRU. Returns whether the item was  present to be removed. AReturns the number of elements the AtomicLRU currently contains.           lrucache-0.1Data.Cache.LRU.InternalData.Cache.LRUData.Cache.LRU.IO LinkedValLinkvalueprevnextLRUfirstlastmaxSizecontentnewLRUfromListtoListinsertlookupdeletesizehit'valid AtomicLRU newAtomicLRUcontainers-0.3.0.0Data.MapMapC