1327 lines
74 KiB
HTML
1327 lines
74 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
|
<!-- NewPage -->
|
|
<html lang="en">
|
|
<head>
|
|
<!-- Generated by javadoc (version 1.7.0_51) on Wed Apr 06 13:11:12 EDT 2016 -->
|
|
<title>Sorting (Parallel Java 2 Library Documentation)</title>
|
|
<meta name="date" content="2016-04-06">
|
|
<link rel="stylesheet" type="text/css" href="../../../stylesheet.css" title="Style">
|
|
</head>
|
|
<body>
|
|
<script type="text/javascript"><!--
|
|
if (location.href.indexOf('is-external=true') == -1) {
|
|
parent.document.title="Sorting (Parallel Java 2 Library Documentation)";
|
|
}
|
|
//-->
|
|
</script>
|
|
<noscript>
|
|
<div>JavaScript is disabled on your browser.</div>
|
|
</noscript>
|
|
<!-- ========= START OF TOP NAVBAR ======= -->
|
|
<div class="topNav"><a name="navbar_top">
|
|
<!-- -->
|
|
</a><a href="#skip-navbar_top" title="Skip navigation links"></a><a name="navbar_top_firstrow">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="navList" title="Navigation">
|
|
<li><a href="../../../overview-summary.html">Overview</a></li>
|
|
<li><a href="package-summary.html">Package</a></li>
|
|
<li class="navBarCell1Rev">Class</li>
|
|
<li><a href="class-use/Sorting.html">Use</a></li>
|
|
<li><a href="package-tree.html">Tree</a></li>
|
|
<li><a href="../../../deprecated-list.html">Deprecated</a></li>
|
|
<li><a href="../../../index-files/index-1.html">Index</a></li>
|
|
<li><a href="../../../help-doc.html">Help</a></li>
|
|
</ul>
|
|
</div>
|
|
<div class="subNav">
|
|
<ul class="navList">
|
|
<li><a href="../../../edu/rit/util/Set.html" title="class in edu.rit.util"><span class="strong">Prev Class</span></a></li>
|
|
<li><a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util"><span class="strong">Next Class</span></a></li>
|
|
</ul>
|
|
<ul class="navList">
|
|
<li><a href="../../../index.html?edu/rit/util/Sorting.html" target="_top">Frames</a></li>
|
|
<li><a href="Sorting.html" target="_top">No Frames</a></li>
|
|
</ul>
|
|
<ul class="navList" id="allclasses_navbar_top">
|
|
<li><a href="../../../allclasses-noframe.html">All Classes</a></li>
|
|
</ul>
|
|
<div>
|
|
<script type="text/javascript"><!--
|
|
allClassesLink = document.getElementById("allclasses_navbar_top");
|
|
if(window==top) {
|
|
allClassesLink.style.display = "block";
|
|
}
|
|
else {
|
|
allClassesLink.style.display = "none";
|
|
}
|
|
//-->
|
|
</script>
|
|
</div>
|
|
<div>
|
|
<ul class="subNavList">
|
|
<li>Summary: </li>
|
|
<li><a href="#nested_class_summary">Nested</a> | </li>
|
|
<li>Field | </li>
|
|
<li>Constr | </li>
|
|
<li><a href="#method_summary">Method</a></li>
|
|
</ul>
|
|
<ul class="subNavList">
|
|
<li>Detail: </li>
|
|
<li>Field | </li>
|
|
<li>Constr | </li>
|
|
<li><a href="#method_detail">Method</a></li>
|
|
</ul>
|
|
</div>
|
|
<a name="skip-navbar_top">
|
|
<!-- -->
|
|
</a></div>
|
|
<!-- ========= END OF TOP NAVBAR ========= -->
|
|
<!-- ======== START OF CLASS DATA ======== -->
|
|
<div class="header">
|
|
<div class="subTitle">edu.rit.util</div>
|
|
<h2 title="Class Sorting" class="title">Class Sorting</h2>
|
|
</div>
|
|
<div class="contentContainer">
|
|
<ul class="inheritance">
|
|
<li><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">java.lang.Object</a></li>
|
|
<li>
|
|
<ul class="inheritance">
|
|
<li>edu.rit.util.Sorting</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<div class="description">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<hr>
|
|
<br>
|
|
<pre>public class <span class="strong">Sorting</span>
|
|
extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</a></pre>
|
|
<div class="block">Class Sorting provides static methods for sorting arrays and lists of
|
|
primitive types and object types.
|
|
<P>
|
|
<I>Note:</I> The operations in class Sorting are not multiple thread safe.</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div class="summary">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<!-- ======== NESTED CLASS SUMMARY ======== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="nested_class_summary">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Nested Class Summary</h3>
|
|
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Nested Class Summary table, listing nested classes, and an explanation">
|
|
<caption><span>Nested Classes</span><span class="tabEnd"> </span></caption>
|
|
<tr>
|
|
<th class="colFirst" scope="col">Modifier and Type</th>
|
|
<th class="colLast" scope="col">Class and Description</th>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util">Sorting.Byte</a></strong></code>
|
|
<div class="block">Class Sorting.Byte is the base class for a helper object used to sort an
|
|
array of type <TT>byte[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Character.html" title="class in edu.rit.util">Sorting.Character</a></strong></code>
|
|
<div class="block">Class Sorting.Character is the base class for a helper object used to
|
|
sort an array of type <TT>char[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a></strong></code>
|
|
<div class="block">Class Sorting.Double is the base class for a helper object used to sort
|
|
an array of type <TT>double[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a></strong></code>
|
|
<div class="block">Class Sorting.Float is the base class for a helper object used to sort an
|
|
array of type <TT>float[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a></strong></code>
|
|
<div class="block">Class Sorting.Integer is the base class for a helper object used to sort
|
|
an array of type <TT>int[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a></strong></code>
|
|
<div class="block">Class Sorting.Long is the base class for a helper object used to sort an
|
|
array of type <TT>long[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><<a href="../../../edu/rit/util/Sorting.Object.html" title="type parameter in Sorting.Object">T</a>></strong></code>
|
|
<div class="block">Class Sorting.Object is the abstract base class for a helper object used
|
|
to sort an array of objects of type <TT>T[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Short.html" title="class in edu.rit.util">Sorting.Short</a></strong></code>
|
|
<div class="block">Class Sorting.Short is the base class for a helper object used to sort an
|
|
array of type <TT>short[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static class </code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.Sortable.html" title="class in edu.rit.util">Sorting.Sortable</a><<a href="../../../edu/rit/util/Sorting.Sortable.html" title="type parameter in Sorting.Sortable">T</a>></strong></code>
|
|
<div class="block">Class Sorting.Sortable is the base class for a helper object used to sort
|
|
an array of objects of type <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><TT><C>[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
</li>
|
|
</ul>
|
|
<!-- ========== METHOD SUMMARY =========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="method_summary">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Method Summary</h3>
|
|
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
|
|
<caption><span>Methods</span><span class="tabEnd"> </span></caption>
|
|
<tr>
|
|
<th class="colFirst" scope="col">Modifier and Type</th>
|
|
<th class="colLast" scope="col">Method and Description</th>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> <br><a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.AList)">sort</a></strong>(<a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> x)</code>
|
|
<div class="block">Sort the given comparable object list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <T> <a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.AList, edu.rit.util.Sorting.Object)">sort</a></strong>(<a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> x,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</code>
|
|
<div class="block">Sort the given object list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static byte[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(byte[])">sort</a></strong>(byte[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>byte[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static byte[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(byte[], int, int)">sort</a></strong>(byte[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>byte[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static byte[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(byte[], int, int, edu.rit.util.Sorting.Byte)">sort</a></strong>(byte[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util">Sorting.Byte</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>byte[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static byte[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(byte[], edu.rit.util.Sorting.Byte)">sort</a></strong>(byte[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util">Sorting.Byte</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>byte[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static char[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(char[])">sort</a></strong>(char[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>char[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static char[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(char[], int, int)">sort</a></strong>(char[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>char[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static char[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(char[], int, int, edu.rit.util.Sorting.Character)">sort</a></strong>(char[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Character.html" title="class in edu.rit.util">Sorting.Character</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>char[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static char[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(char[], edu.rit.util.Sorting.Character)">sort</a></strong>(char[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Character.html" title="class in edu.rit.util">Sorting.Character</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>char[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static double[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(double[])">sort</a></strong>(double[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>double[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static double[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(double[], int, int)">sort</a></strong>(double[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>double[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static double[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(double[], int, int, edu.rit.util.Sorting.Double)">sort</a></strong>(double[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>double[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static double[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(double[], edu.rit.util.Sorting.Double)">sort</a></strong>(double[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>double[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.DoubleList)">sort</a></strong>(<a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> x)</code>
|
|
<div class="block">Sort the given double list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.DoubleList, edu.rit.util.Sorting.Double)">sort</a></strong>(<a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</code>
|
|
<div class="block">Sort the given double list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static float[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(float[])">sort</a></strong>(float[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>float[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static float[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(float[], int, int)">sort</a></strong>(float[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>float[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static float[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(float[], int, int, edu.rit.util.Sorting.Float)">sort</a></strong>(float[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>float[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static float[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(float[], edu.rit.util.Sorting.Float)">sort</a></strong>(float[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>float[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.FloatList)">sort</a></strong>(<a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> x)</code>
|
|
<div class="block">Sort the given float list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.FloatList, edu.rit.util.Sorting.Float)">sort</a></strong>(<a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</code>
|
|
<div class="block">Sort the given float list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static int[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(int[])">sort</a></strong>(int[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>int[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static int[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(int[], int, int)">sort</a></strong>(int[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>int[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static int[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(int[], int, int, edu.rit.util.Sorting.Integer)">sort</a></strong>(int[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>int[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static int[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(int[], edu.rit.util.Sorting.Integer)">sort</a></strong>(int[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>int[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.IntList)">sort</a></strong>(<a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> x)</code>
|
|
<div class="block">Sort the given integer list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.IntList, edu.rit.util.Sorting.Integer)">sort</a></strong>(<a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</code>
|
|
<div class="block">Sort the given integer list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static long[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(long[])">sort</a></strong>(long[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>long[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static long[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(long[], int, int)">sort</a></strong>(long[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>long[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static long[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(long[], int, int, edu.rit.util.Sorting.Long)">sort</a></strong>(long[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>long[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static long[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(long[], edu.rit.util.Sorting.Long)">sort</a></strong>(long[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>long[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.LongList)">sort</a></strong>(<a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> x)</code>
|
|
<div class="block">Sort the given long integer list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(edu.rit.util.LongList, edu.rit.util.Sorting.Long)">sort</a></strong>(<a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</code>
|
|
<div class="block">Sort the given long integer list.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static short[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(short[])">sort</a></strong>(short[] x)</code>
|
|
<div class="block">Sort the given array of type <TT>short[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static short[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(short[], int, int)">sort</a></strong>(short[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>short[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static short[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(short[], int, int, edu.rit.util.Sorting.Short)">sort</a></strong>(short[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Short.html" title="class in edu.rit.util">Sorting.Short</a> helper)</code>
|
|
<div class="block">Sort a portion of the given array of type <TT>short[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static short[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(short[], edu.rit.util.Sorting.Short)">sort</a></strong>(short[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Short.html" title="class in edu.rit.util">Sorting.Short</a> helper)</code>
|
|
<div class="block">Sort the given array of type <TT>short[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> <br>T[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(T[])">sort</a></strong>(T[] x)</code>
|
|
<div class="block">Sort the given comparable object array of type <TT>T[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> <br>T[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(T[], int, int)">sort</a></strong>(T[] x,
|
|
int off,
|
|
int len)</code>
|
|
<div class="block">Sort a portion of the given comparable object array of type <TT>T[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <T> T[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(T[], int, int, edu.rit.util.Sorting.Object)">sort</a></strong>(T[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</code>
|
|
<div class="block">Sort a portion of the given object array of type <TT>T[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>static <T> T[]</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../edu/rit/util/Sorting.html#sort(T[], edu.rit.util.Sorting.Object)">sort</a></strong>(T[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</code>
|
|
<div class="block">Sort the given object array of type <TT>T[]</TT>.</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="methods_inherited_from_class_java.lang.Object">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Methods inherited from class java.lang.<a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</a></h3>
|
|
<code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#clone()" title="class or interface in java.lang">clone</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#equals(java.lang.Object)" title="class or interface in java.lang">equals</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#finalize()" title="class or interface in java.lang">finalize</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#getClass()" title="class or interface in java.lang">getClass</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#hashCode()" title="class or interface in java.lang">hashCode</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#notify()" title="class or interface in java.lang">notify</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#notifyAll()" title="class or interface in java.lang">notifyAll</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#toString()" title="class or interface in java.lang">toString</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait()" title="class or interface in java.lang">wait</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait(long)" title="class or interface in java.lang">wait</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait(long, int)" title="class or interface in java.lang">wait</a></code></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div class="details">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<!-- ============ METHOD DETAIL ========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="method_detail">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Method Detail</h3>
|
|
<a name="sort(byte[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static byte[] sort(byte[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>byte[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(byte[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static byte[] sort(byte[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>byte[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(byte[], edu.rit.util.Sorting.Byte)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static byte[] sort(byte[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util">Sorting.Byte</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>byte[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(byte[], int, int, edu.rit.util.Sorting.Byte)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static byte[] sort(byte[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util">Sorting.Byte</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>byte[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(char[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static char[] sort(char[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>char[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(char[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static char[] sort(char[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>char[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(char[], edu.rit.util.Sorting.Character)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static char[] sort(char[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Character.html" title="class in edu.rit.util">Sorting.Character</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>char[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(char[], int, int, edu.rit.util.Sorting.Character)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static char[] sort(char[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Character.html" title="class in edu.rit.util">Sorting.Character</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>char[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(short[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static short[] sort(short[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>short[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(short[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static short[] sort(short[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>short[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(short[], edu.rit.util.Sorting.Short)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static short[] sort(short[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Short.html" title="class in edu.rit.util">Sorting.Short</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>short[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(short[], int, int, edu.rit.util.Sorting.Short)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static short[] sort(short[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Short.html" title="class in edu.rit.util">Sorting.Short</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>short[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(int[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static int[] sort(int[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>int[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(int[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static int[] sort(int[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>int[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(int[], edu.rit.util.Sorting.Integer)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static int[] sort(int[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>int[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(int[], int, int, edu.rit.util.Sorting.Integer)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static int[] sort(int[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>int[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.IntList)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> sort(<a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> x)</pre>
|
|
<div class="block">Sort the given integer list. The list is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.IntList, edu.rit.util.Sorting.Integer)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> sort(<a href="../../../edu/rit/util/IntList.html" title="class in edu.rit.util">IntList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Integer.html" title="class in edu.rit.util">Sorting.Integer</a> helper)</pre>
|
|
<div class="block">Sort the given integer list. The given helper object is used to determine
|
|
the desired ordering of the list elements and to swap the list elements.
|
|
An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(long[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static long[] sort(long[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>long[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(long[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static long[] sort(long[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>long[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(long[], edu.rit.util.Sorting.Long)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static long[] sort(long[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>long[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(long[], int, int, edu.rit.util.Sorting.Long)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static long[] sort(long[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>long[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.LongList)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> sort(<a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> x)</pre>
|
|
<div class="block">Sort the given long integer list. The list is sorted into ascending
|
|
order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is
|
|
used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.LongList, edu.rit.util.Sorting.Long)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> sort(<a href="../../../edu/rit/util/LongList.html" title="class in edu.rit.util">LongList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Long.html" title="class in edu.rit.util">Sorting.Long</a> helper)</pre>
|
|
<div class="block">Sort the given long integer list. The given helper object is used to
|
|
determine the desired ordering of the list elements and to swap the list
|
|
elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm
|
|
is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(float[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static float[] sort(float[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>float[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(float[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static float[] sort(float[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>float[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(float[], edu.rit.util.Sorting.Float)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static float[] sort(float[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>float[]</TT>. The given helper object is
|
|
used to determine the desired ordering of the array elements and to swap
|
|
the array elements. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(float[], int, int, edu.rit.util.Sorting.Float)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static float[] sort(float[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>float[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.FloatList)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> sort(<a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> x)</pre>
|
|
<div class="block">Sort the given float list. The list is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.FloatList, edu.rit.util.Sorting.Float)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> sort(<a href="../../../edu/rit/util/FloatList.html" title="class in edu.rit.util">FloatList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Float.html" title="class in edu.rit.util">Sorting.Float</a> helper)</pre>
|
|
<div class="block">Sort the given float list. The given helper object is used to determine
|
|
the desired ordering of the list elements and to swap the list elements.
|
|
An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(double[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static double[] sort(double[] x)</pre>
|
|
<div class="block">Sort the given array of type <TT>double[]</TT>. The array is sorted into
|
|
ascending order. An <I>O</I>(<I>n</I> log <I>n</I>) heapsort
|
|
algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(double[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static double[] sort(double[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>double[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The array
|
|
portion is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(double[], edu.rit.util.Sorting.Double)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static double[] sort(double[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</pre>
|
|
<div class="block">Sort the given array of type <TT>double[]</TT>. The given helper object
|
|
is used to determine the desired ordering of the array elements and to
|
|
swap the array elements. An <I>O</I>(<I>n</I> log <I>n</I>)
|
|
heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(double[], int, int, edu.rit.util.Sorting.Double)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static double[] sort(double[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</pre>
|
|
<div class="block">Sort a portion of the given array of type <TT>double[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.DoubleList)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> sort(<a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> x)</pre>
|
|
<div class="block">Sort the given double list. The list is sorted into ascending order. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.DoubleList, edu.rit.util.Sorting.Double)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> sort(<a href="../../../edu/rit/util/DoubleList.html" title="class in edu.rit.util">DoubleList</a> x,
|
|
<a href="../../../edu/rit/util/Sorting.Double.html" title="class in edu.rit.util">Sorting.Double</a> helper)</pre>
|
|
<div class="block">Sort the given double list. The given helper object is used to determine
|
|
the desired ordering of the list elements and to swap the list elements.
|
|
An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(java.lang.Comparable[])">
|
|
<!-- -->
|
|
</a><a name="sort(T[])">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> T[] sort(T[] x)</pre>
|
|
<div class="block">Sort the given comparable object array of type <TT>T[]</TT>. The array is
|
|
sorted into the element's natural ordering as determined by the element's
|
|
<a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true#compareTo(T)" title="class or interface in java.lang"><code>compareTo()</code></a> method. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>T</code> - Data type of the array elements.</dd><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(java.lang.Comparable[],int,int)">
|
|
<!-- -->
|
|
</a><a name="sort(T[], int, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> T[] sort(T[] x,
|
|
int off,
|
|
int len)</pre>
|
|
<div class="block">Sort a portion of the given comparable object array of type <TT>T[]</TT>.
|
|
Elements <TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The
|
|
array portion is sorted into the element's natural ordering as determined
|
|
by the element's <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true#compareTo(T)" title="class or interface in java.lang"><code>compareTo()</code></a> method.
|
|
An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>T</code> - Data type of the array elements.</dd><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(java.lang.Object[],edu.rit.util.Sorting.Object)">
|
|
<!-- -->
|
|
</a><a name="sort(T[], edu.rit.util.Sorting.Object)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T> T[] sort(T[] x,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</pre>
|
|
<div class="block">Sort the given object array of type <TT>T[]</TT>. The given helper object
|
|
is used to determine the desired ordering of the array elements and to
|
|
swap the array elements. An <I>O</I>(<I>n</I> log <I>n</I>)
|
|
heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>T</code> - Data type of the array elements.</dd><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(java.lang.Object[],int,int,edu.rit.util.Sorting.Object)">
|
|
<!-- -->
|
|
</a><a name="sort(T[], int, int, edu.rit.util.Sorting.Object)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T> T[] sort(T[] x,
|
|
int off,
|
|
int len,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</pre>
|
|
<div class="block">Sort a portion of the given object array of type <TT>T[]</TT>. Elements
|
|
<TT>off</TT> through <TT>off+len-1</TT> are sorted in place. The given
|
|
helper object is used to determine the desired ordering of the array
|
|
elements and to swap the array elements. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - Array to be sorted.</dd><dd><code>off</code> - Index of first element to be sorted.</dd><dd><code>len</code> - Number of elements to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The array that was sorted (<TT>x</TT>).</dd>
|
|
<dt><span class="strong">Throws:</span></dt>
|
|
<dd><code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/IndexOutOfBoundsException.html?is-external=true" title="class or interface in java.lang">IndexOutOfBoundsException</a></code> - (unchecked exception) Thrown if <TT>off</TT> < 0, <TT>len</TT>
|
|
< 0, or <TT>off</TT>+<TT>len</TT> > <TT>x.length</TT>.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.AList)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true" title="class or interface in java.lang">Comparable</a><T>> <a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> sort(<a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> x)</pre>
|
|
<div class="block">Sort the given comparable object list. The list is sorted into the
|
|
element's natural ordering as determined by the element's <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Comparable.html?is-external=true#compareTo(T)" title="class or interface in java.lang"><code>compareTo()</code></a> method. An
|
|
<I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>T</code> - Data type of the list elements.</dd><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="sort(edu.rit.util.AList, edu.rit.util.Sorting.Object)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockListLast">
|
|
<li class="blockList">
|
|
<h4>sort</h4>
|
|
<pre>public static <T> <a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> sort(<a href="../../../edu/rit/util/AList.html" title="class in edu.rit.util">AList</a><T> x,
|
|
<a href="../../../edu/rit/util/Sorting.Object.html" title="class in edu.rit.util">Sorting.Object</a><T> helper)</pre>
|
|
<div class="block">Sort the given object list. The given helper object is used to determine
|
|
the desired ordering of the list elements and to swap the list elements.
|
|
An <I>O</I>(<I>n</I> log <I>n</I>) heapsort algorithm is used.</div>
|
|
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>T</code> - Data type of the list elements.</dd><dt><span class="strong">Parameters:</span></dt><dd><code>x</code> - List to be sorted.</dd><dd><code>helper</code> - Helper object.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>The list that was sorted (<TT>x</TT>).</dd></dl>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
<!-- ========= END OF CLASS DATA ========= -->
|
|
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
|
<div class="bottomNav"><a name="navbar_bottom">
|
|
<!-- -->
|
|
</a><a href="#skip-navbar_bottom" title="Skip navigation links"></a><a name="navbar_bottom_firstrow">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="navList" title="Navigation">
|
|
<li><a href="../../../overview-summary.html">Overview</a></li>
|
|
<li><a href="package-summary.html">Package</a></li>
|
|
<li class="navBarCell1Rev">Class</li>
|
|
<li><a href="class-use/Sorting.html">Use</a></li>
|
|
<li><a href="package-tree.html">Tree</a></li>
|
|
<li><a href="../../../deprecated-list.html">Deprecated</a></li>
|
|
<li><a href="../../../index-files/index-1.html">Index</a></li>
|
|
<li><a href="../../../help-doc.html">Help</a></li>
|
|
</ul>
|
|
</div>
|
|
<div class="subNav">
|
|
<ul class="navList">
|
|
<li><a href="../../../edu/rit/util/Set.html" title="class in edu.rit.util"><span class="strong">Prev Class</span></a></li>
|
|
<li><a href="../../../edu/rit/util/Sorting.Byte.html" title="class in edu.rit.util"><span class="strong">Next Class</span></a></li>
|
|
</ul>
|
|
<ul class="navList">
|
|
<li><a href="../../../index.html?edu/rit/util/Sorting.html" target="_top">Frames</a></li>
|
|
<li><a href="Sorting.html" target="_top">No Frames</a></li>
|
|
</ul>
|
|
<ul class="navList" id="allclasses_navbar_bottom">
|
|
<li><a href="../../../allclasses-noframe.html">All Classes</a></li>
|
|
</ul>
|
|
<div>
|
|
<script type="text/javascript"><!--
|
|
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
|
if(window==top) {
|
|
allClassesLink.style.display = "block";
|
|
}
|
|
else {
|
|
allClassesLink.style.display = "none";
|
|
}
|
|
//-->
|
|
</script>
|
|
</div>
|
|
<div>
|
|
<ul class="subNavList">
|
|
<li>Summary: </li>
|
|
<li><a href="#nested_class_summary">Nested</a> | </li>
|
|
<li>Field | </li>
|
|
<li>Constr | </li>
|
|
<li><a href="#method_summary">Method</a></li>
|
|
</ul>
|
|
<ul class="subNavList">
|
|
<li>Detail: </li>
|
|
<li>Field | </li>
|
|
<li>Constr | </li>
|
|
<li><a href="#method_detail">Method</a></li>
|
|
</ul>
|
|
</div>
|
|
<a name="skip-navbar_bottom">
|
|
<!-- -->
|
|
</a></div>
|
|
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
|
<p class="legalCopy"><small><FONT SIZE="-2">Copyright © 2013–2016 by Alan Kaminsky. All rights reserved. Send comments to ark</FONT><FONT SIZE="1" COLOR="#FFFFFF">­</FONT><FONT SIZE="-2">@</FONT><FONT SIZE="1" COLOR="#FFFFFF">­</FONT><FONT SIZE="-2">cs.rit.edu.</FONT></small></p>
|
|
</body>
|
|
</html>
|