/**
* Copyright (C) 2001-2017 by RapidMiner and the contributors
*
* Complete list of developers available at our web site:
*
* http://rapidminer.com
*
* This program is free software: you can redistribute it and/or modify it under the terms of the
* GNU Affero General Public License as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* 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
* Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License along with this program.
* If not, see http://www.gnu.org/licenses/.
*/
package com.rapidminer.operator.learner.associations.gsp;
import java.util.ArrayList;
import java.util.HashMap;
/**
* @author Sebastian Land
*
*/
public class HashTreeInnerNode implements HashTreeNode {
protected HashMap<Item, HashTreeNode> children = new HashMap<Item, HashTreeNode>();
@Override
public void addSequence(Sequence candidate, int candidateIndex, int depth, HashTreeNode father,
ArrayList<Sequence> allCandidates) {
Item currentDepthItem = candidate.getItem(depth);
HashTreeNode child = children.get(currentDepthItem);
if (child == null) {
child = new HashTreeLeafNode();
children.put(currentDepthItem, child);
}
child.addSequence(candidate, candidateIndex, depth + 1, this, allCandidates);
}
@Override
public void replaceNode(Item whichItem, HashTreeNode replacement) {
children.put(whichItem, replacement);
}
@Override
public void countCoveredCandidates(DataSequence sequence, double t, CountingInformations counting) {
double minTransactionTime = t - counting.windowSize;
double maxTransactionTime = t + Math.max(counting.windowSize, counting.maxGap);
for (Transaction transaction : sequence) {
double transactionTime = transaction.getTime();
if (transactionTime < maxTransactionTime && transactionTime > minTransactionTime) {
for (Item item : transaction) {
HashTreeNode child = children.get(item);
if (child != null) {
child.countCoveredCandidates(sequence, transactionTime, counting);
}
}
}
}
}
}