com.bigdata.btree.proc.SplitValuePair Maven / Gradle / Ivy
/**
Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016. All rights reserved.
Contact:
SYSTAP, LLC DBA Blazegraph
2501 Calvert ST NW #106
Washington, DC 20008
[email protected]
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package com.bigdata.btree.proc;
import java.util.Comparator;
import com.bigdata.service.Split;
/**
* A key/value pair where the key is a Split.
*
* @param
* @param
*
* @author bryan
*/
public class SplitValuePair {
final public K key;
final public V val;
public SplitValuePair(final K key, final V val) {
this.key = key;
this.val = val;
}
/**
* Sorts {@link SplitValuePair}s.
*
* @author bryan
*/
public static class PairComparator implements Comparator> {
@Override
public int compare(final SplitValuePair o1, final SplitValuePair o2) {
if (o1.key.fromIndex < o2.key.fromIndex)
return -1;
if (o1.key.fromIndex > o2.key.fromIndex)
return 1;
return 0;
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy