org.boon.datarepo.impl.indexes.UniqueSearchIndex Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of boon Show documentation
Simple opinionated Java for the novice to expert level Java Programmer. Low Ceremony. High Productivity. A real boon to Java to developers!
There is a newer version: 0.34
Show newest version
/*
 * Copyright 2013-2014 Richard M. Hightower
 * 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.
 *
 * __________                              _____          __   .__
 * \______   \ ____   ____   ____   /\    /     \ _____  |  | _|__| ____    ____
 *  |    |  _//  _ \ /  _ \ /    \  \/   /  \ /  \\__  \ |  |/ /  |/    \  / ___\
 *  |    |   (  <_> |  <_> )   |  \ /\  /    Y    \/ __ \|    <|  |   |  \/ /_/  >
 *  |______  /\____/ \____/|___|  / \/  \____|__  (____  /__|_ \__|___|  /\___  /
 *         \/                   \/              \/     \/     \/       \//_____/
 *      ____.                     ___________   _____    ______________.___.
 *     |    |____ ___  _______    \_   _____/  /  _  \  /   _____/\__  |   |
 *     |    \__  \\  \/ /\__  \    |    __)_  /  /_\  \ \_____  \  /   |   |
 * /\__|    |/ __ \\   /  / __ \_  |        \/    |    \/        \ \____   |
 * \________(____  /\_/  (____  / /_______  /\____|__  /_______  / / ______|
 *               \/           \/          \/         \/        \/  \/
 */

package org.boon.datarepo.impl.indexes;

import org.boon.datarepo.spi.SPIFactory;
import org.boon.datarepo.spi.SearchIndex;
import org.boon.core.Function;
import org.boon.primitive.CharBuf;

import java.util.*;

import static org.boon.Lists.list;

/**
 * Default Search Index which uses a TreeMap
 *
 * @param   Key we are indexing on.
 * @param  The items we are indexing.
 */
public class UniqueSearchIndex extends UniqueLookupIndex implements SearchIndex {
    private Class keyType;

    private NavigableMap navigableMap;
    private Comparator collator;

    public UniqueSearchIndex( Class keyType ) {
        super( keyType );
        this.keyType = keyType;

    }

    public UniqueSearchIndex( Class keyType, List items, Function keyGetter ) {
        super( keyType );
        super.keyGetter = keyGetter;
        super.map
                = SPIFactory.getMapCreatorFactory().get().createMap( keyType );

        this.navigableMap = ( NavigableMap ) super.map;

        for ( ITEM item : items ) {
            add( item );
        }


    }

    @Override
    public void setComparator( Comparator collator ) {
        this.collator = collator;
    }

    @Override
    public void init() {
        super.map
                = SPIFactory.getMapCreatorFactory().get().createNavigableMap( keyType, collator );

        this.navigableMap = ( NavigableMap ) super.map;

    }

    @Override
    public ITEM findFirst() {
        return this.navigableMap.firstEntry().getValue();
    }

    @Override
    public ITEM findLast() {
        return this.navigableMap.lastEntry().getValue();
    }

    @Override
    public KEY findFirstKey() {
        return this.navigableMap.firstEntry().getKey();
    }

    @Override
    public KEY findLastKey() {
        return this.navigableMap.lastEntry().getKey();
    }

    @Override
    public List findEquals( KEY key ) {
        key = getKey( key );
        return list( navigableMap.get( key ) );
    }

    @Override
    public List findStartsWith( KEY keyFrag ) {
        keyFrag = getKey( keyFrag );

        List results;

        if ( keyFrag instanceof String ) {
            String start = ( String ) keyFrag;
            if ( start.length() == 0 || start == null ) {
                return Collections.EMPTY_LIST;
            }

            char endLetter = start.charAt( start.length() - 1 );
            String sub = start.substring( 0, start.length() - 1 );

            CharBuf after = CharBuf.create( start.length() );

            after.add( String.valueOf( sub ) );
            after.add( ( char ) ( endLetter + 1 ) );

            NavigableMap> sortMap = ( NavigableMap> ) this.navigableMap;


            SortedMap> sortedSubMap = sortMap.subMap( start, after.toString() );

            if ( sortedSubMap.size() > 0 ) {
                results = new ArrayList<>();
                for ( MultiValue values : sortedSubMap.values() ) {
                    values.addTo( results );
                }
                return results;
            }
            return Collections.EMPTY_LIST;
        }
        return Collections.EMPTY_LIST;

    }

    @Override
    public List findEndsWith( KEY keyFrag ) {
        throw new UnsupportedOperationException( "findEndsWith Not supported" );
    }

    @Override
    public List findContains( KEY keyFrag ) {
        throw new UnsupportedOperationException( "findContains Not supported" );
    }

    @Override
    public List findBetween( KEY start, KEY end ) {
        start = getKey( start );
        end = getKey( end );

        SortedMap keyMultiValueSortedMap = this.navigableMap.subMap( start, end );

        return new ArrayList<>( keyMultiValueSortedMap.values() );

    }


    @Override
    public List findGreaterThan( KEY key ) {
        key = getKey( key );

        SortedMap keyMultiValueSortedMap = this.navigableMap.tailMap( key, false );
        return new ArrayList<>( keyMultiValueSortedMap.values() );
    }

    @Override
    public List findLessThan( KEY key ) {
        key = getKey( key );
        SortedMap keyMultiValueSortedMap = this.navigableMap.headMap( key, false );
        return new ArrayList<>( keyMultiValueSortedMap.values() );
    }

    @Override
    public List findGreaterThanEqual( KEY key ) {
        key = getKey( key );
        SortedMap keyMultiValueSortedMap = this.navigableMap.tailMap( key );
        return new ArrayList<>( keyMultiValueSortedMap.values() );
    }

    @Override
    public List findLessThanEqual( KEY key ) {
        key = getKey( key );
        SortedMap keyMultiValueSortedMap = this.navigableMap.headMap( key );
        return new ArrayList<>( keyMultiValueSortedMap.values() );
    }

    @Override
    public ITEM min() {
        return this.navigableMap.firstEntry().getValue();
    }

    @Override
    public ITEM max() {
        return this.navigableMap.lastEntry().getValue();
    }

    @Override
    public List getAll( KEY key ) {
        return this.findEquals( key );
    }

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


    @Override
    public int count( KEY key ) {
        return this.navigableMap.containsKey( key ) ? 1 : 0;
    }


}