Skip navigation links


Classes to sort a table.

See: Description

Package Description

Classes to sort a table. The sorting is done in a disk-based k-way merge sort using a MemoryService that observes the JVM's memory consumption. The implementation reads in the input table sequentially into chunks, whereby the chunk size is determined at runtime based on available memory. Each chunk is then sorted in memory and flushed out into a temporary container. The final step is to compose the output table by merging the temporary containers.

TableSorter produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output.

The implementation itself is contained in the abstract TableSorter class, two extensions allow for sorting arbitrary tables and BufferedDataTables in particular.

Skip navigation links

Copyright, 2003 - 2016. All rights reserved.
KNIME GmbH, Konstanz, Germany
You may not modify, publish, transmit, transfer or sell, reproduce, create derivative works from, distribute, perform, display, or in any way exploit any of the content, in whole or in part, except as otherwise expressly permitted in writing by the copyright owner or as specified in the license file distributed with this product.