Package org.aksw.commons.collector.core

Class AggLcaMap<T,E>

java.lang.Object

org.aksw.commons.collector.core.AggLcaMap<T,E>

All Implemented Interfaces:

Serializable, Aggregator<T,E,Map<T,T>>, ParallelAggregator<T,E,Map<T,T>,Accumulator<T,E,Map<T,T>>>

public class AggLcaMap<T,E>
extends Object
implements ParallelAggregator<T,E,Map<T,T>,Accumulator<T,E,Map<T,T>>>, Serializable

Accumulate mappings of least common ancestors Assume a backing tree structure: For each node passed to accumulate assemble a mapping to its LCA with any other lca found so far. If for a node there is no lca with another entry then the node is mapped to itself. Hence, the resulting map's key set contains the set of nodes passed to accumulate. Note: The backing graph must form a tree (not a dag): There must be at most a single lca for any two nodes. TODO Extend with counting TODO Add the AggLcaMap with the combine function

Author:

raven

See Also:

• Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	AggLcaMap.AccLcaMap<T,E>

Field Summary

Fields

Modifier and Type	Field	Description
protected BiFunction<? super T,? super T,? extends T>	lcaFinder

Constructor Summary

Constructors

Constructor	Description
AggLcaMap(BiFunction<? super T,? super T,? extends T> lcaFinder)

Method Summary

Modifier and Type	Method	Description
Accumulator<T,E,Map<T,T>>	combine(Accumulator<T,E,Map<T,T>> a, Accumulator<T,E,Map<T,T>> b)	Combine accumulators.
static <T, E> AggLcaMap<T,E>	create(SerializableBiFunction<? super T,? super T,? extends T> lcaFinder)
Accumulator<T,E,Map<T,T>>	createAccumulator()
boolean	equals(Object obj)
int	hashCode()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface org.aksw.commons.collector.domain.Aggregator

accumulateAll, accumulateAll, accumulateAll, finish

Methods inherited from interface org.aksw.commons.collector.domain.ParallelAggregator

asCollector, asCollector, combineRaw

Field Details

lcaFinder

protected BiFunction<? super T,? super T,? extends T> lcaFinder

Constructor Details

AggLcaMap

public AggLcaMap(BiFunction<? super T,? super T,? extends T> lcaFinder)

Method Details

createAccumulator

public Accumulator<T,E,Map<T,T>> createAccumulator()

Specified by:

createAccumulator in interface Aggregator<T,E,Map<T,T>>

Specified by:

createAccumulator in interface ParallelAggregator<T,E,Map<T,T>,Accumulator<T,E,Map<T,T>>>

combine

public Accumulator<T,E,Map<T,T>> combine(Accumulator<T,E,Map<T,T>> a,
 Accumulator<T,E,Map<T,T>> b)

Description copied from interface: ParallelAggregator

Combine accumulators. This method is allowed to mutate any of if its arguments, hence accumulators should be considered exhausted after combination.

Specified by:

combine in interface ParallelAggregator<T,E,Map<T,T>,Accumulator<T,E,Map<T,T>>>

Parameters:

a - First participant of combination

b - Second participant of combination

Returns:

Combined accumulator

hashCode

public int hashCode()

Overrides:

hashCode in class Object

equals

public boolean equals(Object obj)

Overrides:

equals in class Object

create

public static <T,
E> AggLcaMap<T,E> create(SerializableBiFunction<? super T,? super T,? extends T> lcaFinder)