public class Queue < G > {
public weak List< G > head ;
public weak List< G > tail ;
public uint length ;
public Queue ( ) ;
public bool is_empty ( ) ;
public uint get_length ( ) ;
public void reverse ( ) ;
public Queue copy ( ) ;
public weak List< G > find ( G data ) ;
public weak List< G > find_custom ( G data,
CompareFunc func ) ;
public void sort ( CompareDataFunc compare_func,
void** user_data ) ;
public void push_head ( G data ) ;
public void push_tail ( G data ) ;
public void push_nth ( G data ) ;
public G pop_head ( ) ;
public G pop_tail ( ) ;
public G pop_nth ( ) ;
public weak G peek_head ( ) ;
public weak G peek_tail ( ) ;
public weak G peek_nth ( ) ;
public int index ( G data ) ;
public void remove ( G data ) ;
public void remove_all ( G data ) ;
public void insert_before ( List< G > sibling,
G data ) ;
public void insert_after ( List< G > sibling,
G data ) ;
public void insert_sorted ( List< G > sibling,
G data,
CompareDataFunc func,
void** user_data ) ;
}

public Queue ( ) ;
public weak List< G > head ;
public weak List< G > tail ;
public uint length ;
public bool is_empty ( ) ;
public uint get_length ( ) ;
public void reverse ( ) ;
public Queue copy ( ) ;
public weak List< G > find ( G data ) ;
public weak List< G > find_custom ( G data,
CompareFunc func ) ;
public void sort ( CompareDataFunc compare_func,
void** user_data ) ;
public void push_head ( G data ) ;
public void push_tail ( G data ) ;
public void push_nth ( G data ) ;
public G pop_head ( ) ;
public G pop_tail ( ) ;
public G pop_nth ( ) ;
public weak G peek_head ( ) ;
public weak G peek_tail ( ) ;
public weak G peek_nth ( ) ;
public int index ( G data ) ;
public void remove ( G data ) ;
public void remove_all ( G data ) ;
public void insert_before ( List< G > sibling,
G data ) ;
public void insert_after ( List< G > sibling,
G data ) ;
public void insert_sorted ( List< G > sibling,
G data,
CompareDataFunc func,
void** user_data ) ;
Created by Valadoc