    class
    	LINKED_QUEUE [G]

    General
    	cluster: base
    	description: "Unbounded queues implemented as linked lists"
    	create: ll_make, make

    Ancestors
    	LINKED_LIST [G]
    	QUEUE* [G]

    Queries
    	after: BOOLEAN
    	before: BOOLEAN
    	changeable_comparison_criterion: BOOLEAN
    	count: INTEGER_32
    	duplicate (n: INTEGER_32): [like Current] LINKED_QUEUE [G]
    	Extendible: BOOLEAN
    	Full: BOOLEAN
    	has (v: [like ll_item] G): BOOLEAN
    	index: INTEGER_32
    	is_empty: BOOLEAN
    	is_equal (other: [like Current] LINKED_QUEUE [G]): BOOLEAN
    	is_inserted (v: G): BOOLEAN
    	item: G
    	linear_representation: ARRAYED_LIST [G]
    	object_comparison: BOOLEAN
    	occurrences (v: [like ll_item] G): INTEGER_32
    	off: BOOLEAN
    	prunable: BOOLEAN
    	readable: BOOLEAN
    	writable: BOOLEAN

    Commands
    	append (s: SEQUENCE [G])
    	compare_objects
    	compare_references
    	copy (other: [like Current] LINKED_QUEUE [G])
    	extend (v: G)
    	fill (other: CONTAINER [G])
    	force (v: G)
    	make
    	put (v: G)
    	remove
    	replace (v: [like ll_item] G)
    	wipe_out

    Constraints
    	is always after