Gobo Eiffel Structure Library
Copyright (c) 2004, Eric Bezault and others
Eiffel Forum License v2 (see forum.txt)
$Date: 2005/07/13 17:52:51 $
$Revision: 1.5 $
-- Create a new sorter.
-- (From DS_INDEXABLE_SORTER)
-- Comparison criterion
-- (From DS_INDEXABLE_SORTER)
-- Is a_container sorted in decreasing order?
-- (From DS_SORTER)
-- Is a_container sorted in decreasing order
-- within bounds lower..upper?
-- (From DS_INDEXABLE_SORTER)
-- Is a_container sorted in increasing order?
-- (From DS_SORTER)
-- Is a_container sorted according to
-- a_comparator's comparison criterion?
-- (From DS_SORTER)
-- Is a_container sorted in increasing order
-- within bounds lower..upper?
-- (From DS_INDEXABLE_SORTER)
-- Is a_container sorted according to a_comparator's
-- comparison criterion within bounds lower..upper?
-- (From DS_INDEXABLE_SORTER)
-- Sort a_container in decreasing order.
-- (From DS_SORTER)
-- Sort a_container in decreasing order
-- within bounds lower..upper.
-- (From DS_INDEXABLE_SORTER)
-- Sort a_container according to
-- a_comparator's comparison criterion?
-- (From DS_SORTER)
-- Sort a_container in increasing order
-- within bounds lower..upper.
-- (From DS_INDEXABLE_SORTER)
-- Sort a_container according to a_comparator's comparison criterion within bounds lower..upper.
-- Build a heap into container, where lower is the root, then iterate k from upper to lower,
-- swapping root element with k-th, and maintaining the heap property of [lower..k-1] .
-- (From DS_INDEXABLE_SORTER)
Indexable data structure sorters using heap sort algorithm