Extracted from Pike v7.8 release 866 at 2016-11-06.
pike.ida.liu.se
[Top]
ADT
ADT.History

Methods
 _indices()
 _sizeof()
 _values()
 `[]()
 `[]=()
 create()
 flush()
 get_first_entry_num()
 get_latest_entry_num()
 get_maxsize()
 push()
 query_no_adjacent_duplicates()
 set_maxsize()
 set_no_adjacent_duplicates()
previousADT.Heap()->top()
ADT.History()->_indices()next

Class ADT.History

Description

A history is a stack where you can only push entries. When the stack has reached a certain size the oldest entries are removed on every push. Other proposed names for this data type is leaking stack and table (where you push objects onto the table in one end and objects are falling off the table in the other.