com.clearnlp.util.UTArray Maven / Gradle / Ivy

Go to download
/**
 * Copyright (c) 2009/09-2012/08, Regents of the University of Colorado
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright notice, this
 *    list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
/**
 * Copyright 2012/09-2013/04, 2013/11-Present, University of Massachusetts Amherst
 * Copyright 2013/05-2013/10, IPSoft Inc.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *     http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License. 
 */
package com.clearnlp.util;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Random;
import java.util.Set;
import java.util.regex.Pattern;

import com.carrotsearch.hppc.FloatArrayList;
import com.carrotsearch.hppc.IntArrayList;
import com.google.common.collect.Lists;

/**
 * Array utilities.
 * @author Jinho D. Choi ([email protected])
 */
public class UTArray
{
	static public String[] merge(String[]... arrays)
	{
		int size = 0;
		
		for (String[] array : arrays)
			size += array.length;
		
		String[] merge = new String[size];
		int i = 0;
		
		for (String[] array : arrays)
		{
			for (String s : array)
				merge[i++] = s;
		}
		
		return merge;
	}
	
	static public double[] toDoubleArray(String line, Pattern p)
	{
		String[] t = p.split(line);
		int i, size = t.length;
		
		double[] d = new double[size];
		
		for (i=0; i array.length)
			throw new IndexOutOfBoundsException();
		
		double[] newArray = new double[newLength];
		int i;
		
		for (i=0; i>void sortReverseOrder(T[] array)
	{
		Arrays.sort(array, Collections.reverseOrder());
	}
	
	static public int[] range(int size)
	{
		int[] arr = new int[size];
		int i;
		
		for (i=0; i list, String delim)
	{
		StringBuilder builder = new StringBuilder();
		
		for (Object item : list)
		{
			builder.append(delim);
			builder.append(item.toString());
		}
		
		return builder.substring(delim.length());
	}
	
	static public String join(Object[] arr, String delim)
	{
		StringBuilder builder = new StringBuilder();
		
		for (Object item : arr)
		{
			builder.append(delim);
			builder.append(item.toString());
		}
		
		return builder.substring(delim.length());
	}
	
	static public int[] toIntArray(String[] sArr)
	{
		int i, size = sArr.length;
		int[] iArr = new int[size];
		
		for (i=0; i list, int bIdx, int eIdx)
	{
		String[] arr = new String[eIdx - bIdx];
		int i;
		
		for (i=0; bIdx toList(String[] arr)
	{
		List list = new ArrayList(arr.length);
		
		for (String item : arr)
			list.add(item);
		
		return list;
	}
	
	static public Set toSet(String... sArr)
	{
		Set set = new HashSet();
		
		for (String item : sArr)
			set.add(item);
				
		return set;
	}
	
	static public int max(int[] arr)
	{
		int i, size = arr.length, m = arr[0];
		
		for (i=1; iList toList(T[]... arrays)
	{
		List list = Lists.newArrayList();
		
		for (T[] array : arrays)
			for (T item : array)
				list.add(item);

		return list;
	}
}