Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright (c) 2012, Metron, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Metron, Inc. 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 METRON, INC. 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 com.metsci.glimpse.layout;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import com.metsci.glimpse.context.GlimpseBounds;
import com.metsci.glimpse.context.GlimpseContext;
import com.metsci.glimpse.context.GlimpseTarget;
import com.metsci.glimpse.context.GlimpseTargetStack;
import com.metsci.glimpse.util.Pair;
/**
* Stores the bounds of a GlimpseLayout keyed off of the sequence of nested
* parent GlimpseLayouts leading back to the GlimpseCanvas. If a given GlimpseLayout
* is rendered to the same sequence of parent GlimpseLayouts and none of the parent
* GlimpseLayouts have changed shape, then the layout algorithm does not need to be
* run, the cached LayoutBounds can be used.
*
* @author ulman
*/
public class GlimpseLayoutCache
{
protected Map, Pair, D>> map;
public GlimpseLayoutCache( )
{
this.map = new HashMap, Pair, D>>( );
}
public D getValue( GlimpseContext context )
{
return getValue( context.getTargetStack( ) );
}
public D getValue( GlimpseTargetStack layoutStack )
{
Pair, D> entry = map.get( layoutStack.getTargetList( ) );
if ( entry != null )
{
List cachedBounds = entry.first( );
List contextBounds = layoutStack.getBoundsList( );
if ( compareBounds( cachedBounds, contextBounds ) )
{
return entry.second( );
}
}
return null;
}
public D getValueNoBoundsCheck( GlimpseContext context )
{
return getValueNoBoundsCheck( context.getTargetStack( ) );
}
public D getValueNoBoundsCheck( GlimpseTargetStack layoutStack )
{
Pair, D> entry = map.get( layoutStack.getTargetList( ) );
if ( entry != null )
{
return entry.second( );
}
else
{
return null;
}
}
public void setValue( GlimpseTargetStack stack, D value )
{
List targetList = Collections.unmodifiableList( new ArrayList( stack.getTargetList( ) ) );
List boundsList = Collections.unmodifiableList( new ArrayList( stack.getBoundsList( ) ) );
map.put( targetList, new Pair, D>( boundsList, value ) );
}
public void setValue( GlimpseContext context, D value )
{
setValue( context.getTargetStack( ), value );
}
/**
* Removes all mappings from the cache, the component associated with this cache
* will have to be laid out again for each of its RenderTargets.
*/
public void clear( )
{
this.map.clear( );
}
public static boolean compareBounds( List list1, List list2 )
{
if ( list1 == null || list2 == null ) return false;
if ( list1.size( ) != list2.size( ) ) return false;
Iterator iter1 = list1.iterator( );
Iterator iter2 = list2.iterator( );
while ( iter1.hasNext( ) )
{
GlimpseBounds bounds1 = iter1.next( );
GlimpseBounds bounds2 = iter2.next( );
if ( !bounds1.equals( bounds2 ) ) return false;
}
return true;
}
}