org.jpmml.evaluator.SparseArrayUtil Maven / Gradle / Ivy

Go to download
/*
 * Copyright (c) 2013 KNIME.com AG, Zurich, Switzerland
 * Copyright (c) 2014 Villu Ruusmann
 * 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.
 * 3. Neither the name of the copyright holder nor the names of its contributors
 *    may be used to endorse or promote products derived from this software without
 *    specific prior written permission.
 *
 * 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 HOLDER 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.
 */
package org.jpmml.evaluator;

import java.util.AbstractList;
import java.util.List;
import java.util.SortedMap;
import java.util.TreeMap;

import com.google.common.cache.CacheLoader;
import com.google.common.cache.LoadingCache;
import com.google.common.collect.ImmutableSortedMap;
import org.dmg.pmml.SparseArray;
import org.jpmml.model.InvalidElementException;

public class SparseArrayUtil {

	private SparseArrayUtil(){
	}

	@SuppressWarnings("unchecked")
	static
	public  SortedMap getContent(SparseArray sparseArray){
		return (SortedMap)CacheUtil.getValue(sparseArray, SparseArrayUtil.contentCache);
	}

	static
	public  List asNumberList(SparseArray sparseArray){
		SortedMap content = getContent(sparseArray);

		int size;

		Integer n = sparseArray.getN();
		if(n != null){
			size = n;
		} else

		{
			size = content.size();
		}

		E defaultValue = sparseArray.getDefaultValue();

		List result = new AbstractList(){

			@Override
			public int size(){
				return size;
			}

			@Override
			public E get(int index){
				E value = content.get(index + 1);

				if(value == null){
					value = defaultValue;
				}

				return value;
			}
		};

		return result;
	}

	static
	public  SortedMap parse(SparseArray sparseArray){
		SortedMap result = new TreeMap<>();

		if(!sparseArray.hasIndices() && !sparseArray.hasEntries()){
			return result;
		}

		List indices = sparseArray.getIndices();
		List entries = sparseArray.getEntries();

		// "Both arrays must have the same length"
		if(indices.size() != entries.size()){
			throw new InvalidElementException(sparseArray);
		}

		Integer n = sparseArray.getN();

		for(int i = 0, max = indices.size(); i < max; i++){
			Integer index = indices.get(i);
			E entry = entries.get(i);

			if((index < 1) || (n != null && index > n)){
				throw new InvalidElementException(sparseArray);
			}

			result.put(index, entry);
		}

		if(n != null && n < result.size()){
			throw new InvalidElementException(sparseArray);
		}

		return result;
	}

	private static final LoadingCache, SortedMap> contentCache = CacheUtil.buildLoadingCache(new CacheLoader, SortedMap>(){

		@Override
		public SortedMap load(SparseArray sparseArray){
			return ImmutableSortedMap.copyOf(parse(sparseArray));
		}
	});
}