#ifndef _INCLUDE_LRU_H
#define _INCLUDE_LRU_H

/* functions for least recently used algorithm */

/* number of items in list */
int lru_count(void);

/* add or update an item */
void lru_use(dbref);

/* remove an item */
dbref lru_old(void);

/* return 1 if item is in list, 0 otherwise */
int lru_hasp(dbref);

/* return the head item */
dbref lru_head(void);

#endif