com.rathravane.till.nv.impl.nvReadableStack Maven / Gradle / Ivy

Go to download
/*
 *	Copyright 2006-2012, Rathravane LLC
 *
 *	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.rathravane.till.nv.impl;

import java.util.Collection;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.TreeSet;

import com.rathravane.till.nv.rrNvReadable;

public class nvReadableStack extends nvBaseReadable implements rrNvReadable
{
	public nvReadableStack ()
	{
		super ();
		fStack = new LinkedList ();
	}

	public void push ( rrNvReadable p )
	{
		fStack.addFirst ( p );
	}

	public void pushBelow ( rrNvReadable below, rrNvReadable above )
	{
		int i = fStack.indexOf ( above );
		if ( i < 0 )
		{
			push ( below );
		}
		else
		{
			fStack.add ( i+1, below );
		}
	}

	public String getString ( String key ) throws missingReqdSetting
	{
		String result = null;
		boolean found = false;
		for ( rrNvReadable p : fStack )
		{
			if ( p.hasValueFor ( key ) )
			{
				result = p.getString ( key );
				found = true;
				break;
			}
		}

		if ( !found )
		{
			throw new missingReqdSetting ( key );
		}

		return eval ( result );
	}

	// different implementations handle string sets differently; we can't assume that getString returns a comma-delimited array
	@Override
	public String[] getStrings ( String key ) throws missingReqdSetting
	{
		String[] result = null;
		boolean found = false;
		for ( rrNvReadable p : fStack )
		{
			if ( p.hasValueFor ( key ) )
			{
				result = p.getStrings ( key );
				found = true;
				break;
			}
		}

		if ( !found )
		{
			throw new missingReqdSetting ( key );
		}

		if ( result != null )
		{
			for ( int i=0; i fStack;

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

	@Override
	public Collection getAllKeys ()
	{
		final TreeSet set = new TreeSet ();
		for ( rrNvReadable r : fStack )
		{
			set.addAll ( r.getAllKeys () );
		}
		return set;
	}

	@Override
	public Map getCopyAsMap ()
	{
		// this could be faster, but it's an easy way to get the correct values
		final HashMap map = new HashMap ();
		for ( String key : getAllKeys () )
		{
			final String val = getString ( key, null );
			if ( val != null )
			{
				map.put ( key, val );
			}
		}
		return map;
	}
}