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

Classes
 CircularListIterator

Methods
 _equal()
 _get_iterator()
 _indices()
 _insert_element()
 _remove_element()
 _search()
 _sizeof()
 _values()
 `+()
 `[]()
 `[]=()
 add()
 allocate()
 cast()
 clear()
 create()
 delete_value()
 first()
 is_empty()
 last()
 max_size()
 peek_back()
 peek_front()
 pop_back()
 pop_front()
 push_back()
 push_front()
previousADT.BitBuffer()->read()
ADT.CircularList()->CircularListIteratornext

Class ADT.CircularList

Description

This is an circular list implemented by an array. It has a constant time complexity for pop and push. It has a limited max size but it can be increased with the method allocate.