Interface for an object that knows how to swap elements at two positions (a,b).
Array manipulations; complements java.util.Arrays.
Generically reorders (permutes) arbitrary shaped data (for example, an array, three arrays, a 2-d matrix, two linked lists) using an in-place swapping algorithm.
Generically sorts arbitrary shaped data (for example multiple arrays, 1,2 or 3-d matrices, and so on) using a quicksort or mergesort.
Given some interval boundaries, partitions arrays such that all elements falling into an interval are placed next to each other.
This empty class is the common root for all persistent capable classes.
Quicksorts, mergesorts and binary searches; complements java.util.Arrays.
A handy stopwatch for benchmarking.
Information about the current release.
Copyright © 2006–2016 SYSTAP, LLC DBA Blazegraph. All rights reserved.