AfflictionNetworks/samskivert
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Moved a bunch of int[] specific stuff to IntListUtil.

Browse Source 
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1048 6335cc39-0255-0410-8fd6-9bcaacd3b74c
This commit is contained in:
mdb
2003-02-04 03:12:30 +00:00
parent 84abf220b6
commit d6aee14e80
2 changed files with 111 additions and 111 deletions
Download Patch File Download Diff File Expand all files Collapse all files
projects/samskivert/src/java/com/samskivert/util/ArrayUtil.java
+1 -109
View File
@@ -1,5 +1,5 @@
//
// $Id: ArrayUtil.java,v 1.23 2003/01/17 01:27:16 mdb Exp $
// $Id: ArrayUtil.java,v 1.24 2003/02/04 03:12:30 mdb Exp $
//
// samskivert library - useful routines for java programs
// Copyright (C) 2001 Walter Korman
@@ -31,114 +31,6 @@ import com.samskivert.Log;
*/
public class ArrayUtil
{
/**
* Returns the maximum value in the given array of values, or {@link
* Integer#MIN_VALUE} if the array is null or zero-length.
*/
public static int getMaxValue (int[] values)
{
int max = Integer.MIN_VALUE;
int vcount = (values == null) ? 0 : values.length;
for (int ii = 0; ii < vcount; ii++) {
if (values[ii] > max) {
// new max
max = values[ii];
}
}
return max;
}
/**
* Returns the minimum value in the given array of values, or {@link
* Integer#MAX_VALUE} if the array is null or zero-length.
*/
public static int getMinValue (int[] values)
{
int min = Integer.MAX_VALUE;
int vcount = (values == null) ? 0 : values.length;
for (int ii = 0; ii < vcount; ii++) {
if (values[ii] < min) {
// new min
min = values[ii];
}
}
return min;
}
/**
* Returns the index of the maximum value in the given array of
* values, or <code>-1</code> if the array is <code>null</code> or
* zero-length.
*/
public static int getMaxValueIndex (int[] values)
{
if (values == null || values.length == 0) {
return -1;
}
int idx = 0;
int max = values[idx];
for (int ii = 1; ii < values.length; ii++) {
if (values[ii] > max) {
max = values[ii];
idx = ii;
}
}
return idx;
}
/**
* Returns an array of the indexes in the given array of values that
* have the maximum value in the array, or a zero-length array if the
* supplied array of values is <code>null</code> or zero-length.
*/
public static int[] getMaxIndexes (int[] values)
{
int max = Integer.MIN_VALUE;
int num = 0;
int vcount = (values == null) ? 0 : values.length;
for (int ii=0; ii < vcount; ii++) {
int value = values[ii];
if (value < max) {
// common case- stop checking things..
continue;
} else if (value > max) {
// new max
max = value;
num = 1;
} else {
// another sighting of max
num++;
}
}
// now find the indexes that have max
int[] maxes = new int[num];
for (int ii=0, pos=0; pos < num; ii++) {
if (values[ii] == max) {
maxes[pos++] = ii;
}
}
return maxes;
}
/**
* Returns the sum of the values in the supplied integer array.
*/
public static int sum (int[] values)
{
int sum = 0;
for (int ii = 0; ii < values.length; ii++) {
sum += values[ii];
}
return sum;
}
/**
* Looks for an element that is equal to the supplied value and
* returns its index in the array.
projects/samskivert/src/java/com/samskivert/util/IntListUtil.java
+110 -2
View File
@@ -1,5 +1,5 @@
//
// $Id: IntListUtil.java,v 1.3 2002/11/12 05:23:41 mdb Exp $
// $Id: IntListUtil.java,v 1.4 2003/02/04 03:12:30 mdb Exp $
package com.samskivert.util;
@@ -290,7 +290,7 @@ public class IntListUtil
/**
* Returns the total of all of the values in the list.
*/
public static int total (int[] list)
public static int sum (int[] list)
{
int total = 0, lsize = list.length;
for (int ii = 0; ii < lsize; ii++) {
@@ -299,6 +299,114 @@ public class IntListUtil
return total;
}
/**
* Returns the maximum value in the given array of values, or {@link
* Integer#MIN_VALUE} if the array is null or zero-length.
*/
public static int getMaxValue (int[] values)
{
int max = Integer.MIN_VALUE;
int vcount = (values == null) ? 0 : values.length;
for (int ii = 0; ii < vcount; ii++) {
if (values[ii] > max) {
// new max
max = values[ii];
}
}
return max;
}
/**
* Returns the minimum value in the given array of values, or {@link
* Integer#MAX_VALUE} if the array is null or zero-length.
*/
public static int getMinValue (int[] values)
{
int min = Integer.MAX_VALUE;
int vcount = (values == null) ? 0 : values.length;
for (int ii = 0; ii < vcount; ii++) {
if (values[ii] < min) {
// new min
min = values[ii];
}
}
return min;
}
/**
* Returns the index of the maximum value in the given array of
* values, or <code>-1</code> if the array is <code>null</code> or
* zero-length.
*/
public static int getMaxValueIndex (int[] values)
{
if (values == null || values.length == 0) {
return -1;
}
int idx = 0;
int max = values[idx];
for (int ii = 1; ii < values.length; ii++) {
if (values[ii] > max) {
max = values[ii];
idx = ii;
}
}
return idx;
}
/**
* Creates a new array one larger than the supplied array and with the
* specified value inserted into the last slot.
*/
public static int[] append (int[] values, int value)
{
int[] nvalues = new int[values.length+1];
System.arraycopy(values, 0, nvalues, 0, values.length);
nvalues[values.length] = value;
return nvalues;
}
/**
* Returns an array of the indexes in the given array of values that
* have the maximum value in the array, or a zero-length array if the
* supplied array of values is <code>null</code> or zero-length.
*/
public static int[] getMaxIndexes (int[] values)
{
int max = Integer.MIN_VALUE;
int num = 0;
int vcount = (values == null) ? 0 : values.length;
for (int ii=0; ii < vcount; ii++) {
int value = values[ii];
if (value < max) {
// common case- stop checking things..
continue;
} else if (value > max) {
// new max
max = value;
num = 1;
} else {
// another sighting of max
num++;
}
}
// now find the indexes that have max
int[] maxes = new int[num];
for (int ii=0, pos=0; pos < num; ii++) {
if (values[ii] == max) {
maxes[pos++] = ii;
}
}
return maxes;
}
/**
* Creates a new list that will accomodate the specified index and
* copies the contents of the old list to the first.