xyz.cofe.collection.map

Class Bijection<X extends Comparable,Y extends Comparable>

java.lang.Object

xyz.cofe.collection.map.Bijection<X,Y>

Type Parameters:

X - Тип значений x

Y - Тип значений y

public class Bijection<X extends Comparable,Y extends Comparable>
extends Object

Карта биективного отображения.

Каждый элемент x из X сопоставляется только один элемент y из Y,
и соответсвенно есть обратное отображение: Каждый элемент x из X сопоставляется только один элемент y из Y.

X множество	← →	Y множество
x1	← →	ya
x2	← →	yb
x3	← →	yc
x4	← →	yd

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	Bijection.ResolveDuplicate
static class	Bijection.ResolveNull
class	Bijection.Update

Field Summary

Fields

Modifier and Type	Field and Description
protected Object	sync
protected TreeMap<X,Y>	xToYmap
protected TreeMap<Y,X>	yToXmap

Constructor Summary

Constructors

Constructor and Description
Bijection()
Bijection(Bijection sample, Object sync)
Bijection(Object sync)

Method Summary

Modifier and Type	Method and Description
void	assign(Bijection<X,Y> sample)
void	clear()
Bijection<X,Y>	clone()
void	eachXY(Func2<Object,X,Y> reciver)
void	eachXY(Reciver<Pair<X,Y>> reciver)
Set<Pair<X,Y>>	getEntries()
X	getXbyY(Y y)
X	getXMax()
X	getXMin()
NavigableSet<X>	getXSet()
Y	getYbyX(X x)
Y	getYMax()
Y	getYMin()
NavigableSet<Y>	getYSet()
boolean	hasX(X x)
boolean	hasY(Y y)
LinkedHashSet<Pair<X,Y>>	removeX(Iterable<X> itr)
LinkedHashSet<Pair<X,Y>>	removeX(X x)
LinkedHashSet<Pair<X,Y>>	removeY(Iterable<Y> itr)
LinkedHashSet<Pair<X,Y>>	removeY(Y y)
LinkedHashSet<Pair<X,Y>>	setXY(Iterable<Pair<X,Y>> itr)
LinkedHashSet<Pair<X,Y>>	setXY(X x, Y y)
LinkedHashSet<Pair<X,Y>>	setXYMap(Map<X,Y> itr)
LinkedHashSet<Pair<X,Y>>	setXYMapEntries(Iterable<Map.Entry<X,Y>> itr)
int	size()
Bijection.Update	update()
Bijection.Update	update(Func2<Pair<X,Y>,X,Y> fn)
Bijection.Update	update(Func2<Pair<X,Y>,X,Y> fn, boolean strong)
Y	x(X x)
X	y(Y y)

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

sync

protected final Object sync

xToYmap

protected final TreeMap<X extends Comparable,Y extends Comparable> xToYmap

yToXmap

protected final TreeMap<Y extends Comparable,X extends Comparable> yToXmap

Constructor Detail

Bijection

public Bijection()

Bijection

public Bijection(Object sync)

Bijection

public Bijection(Bijection sample,
                 Object sync)

Method Detail

getEntries

public Set<Pair<X,Y>> getEntries()

eachXY

public void eachXY(Func2<Object,X,Y> reciver)

eachXY

public void eachXY(Reciver<Pair<X,Y>> reciver)

setXY

public LinkedHashSet<Pair<X,Y>> setXY(X x,
                                      Y y)

setXY

public LinkedHashSet<Pair<X,Y>> setXY(Iterable<Pair<X,Y>> itr)

setXYMapEntries

public LinkedHashSet<Pair<X,Y>> setXYMapEntries(Iterable<Map.Entry<X,Y>> itr)

setXYMap

public LinkedHashSet<Pair<X,Y>> setXYMap(Map<X,Y> itr)

removeX

public LinkedHashSet<Pair<X,Y>> removeX(X x)

removeX

public LinkedHashSet<Pair<X,Y>> removeX(Iterable<X> itr)

removeY

public LinkedHashSet<Pair<X,Y>> removeY(Y y)

removeY

public LinkedHashSet<Pair<X,Y>> removeY(Iterable<Y> itr)

size

public int size()

clear

public void clear()

hasX

public boolean hasX(X x)

hasY

public boolean hasY(Y y)

getXSet

public NavigableSet<X> getXSet()

getYSet

public NavigableSet<Y> getYSet()

getXMin

public X getXMin()

getXMax

public X getXMax()

getYMin

public Y getYMin()

getYMax

public Y getYMax()

getYbyX

public Y getYbyX(X x)

x

public Y x(X x)

getXbyY

public X getXbyY(Y y)

y

public X y(Y y)

update

public Bijection.Update update()

update

public Bijection.Update update(Func2<Pair<X,Y>,X,Y> fn,
                               boolean strong)

update

public Bijection.Update update(Func2<Pair<X,Y>,X,Y> fn)

assign

public void assign(Bijection<X,Y> sample)

clone

public Bijection<X,Y> clone()

Overrides:

clone in class Object