public BidirectionalMap<ExtendedNode, ExtendedNode> getNodesMap() throws TeEngineMlException { if (null==treeCopier) throw new TeEngineMlException("Not generated"); return treeCopier.getNodesMap(); }
public void set() throws TeEngineMlException { TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedNode> copier = new TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedNode>(tree, new SelfTrace_InfoConverter(), new ExtendedNodeConstructor()); copier.copy(); if (this.exception!=null) { throw this.exception; } newTree = copier.getGeneratedTree(); mapping = copier.getNodesMap(); }
public void set() throws TeEngineMlException { TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedNode> copier = new TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedNode>(inputGeneratedTree, new OriginalInfoTrace_InfoConverter(), new ExtendedNodeConstructor()); copier.copy(); if (this.exception!=null) throw exception; newGeneratedTree = copier.getGeneratedTree(); mapInputToNew = copier.getNodesMap(); }
treeCopier.copy(); BasicNode textTreeAsBasicNode = treeCopier.getGeneratedTree(); BidirectionalMap<ExtendedNode, BasicNode> mapTextTree = treeCopier.getNodesMap(); copiedTextTreeNodes = AbstractNodeUtils.treeToLinkedHashSet(textTreeAsBasicNode);
/** * @param constructionTree * @return * @throws AnnotatorException */ public static TwoTreesAndTheirBidirectionalMap<ExtendedConstructionNode, ExtendedNode> dupConstructionTreeToTree(ExtendedConstructionNode constructionTree) throws AnnotatorException { InfoConverter<ExtendedConstructionNode, ExtendedInfo> constructionNodeToNodeInfoConverter = new InfoConverter<ExtendedConstructionNode, ExtendedInfo>() { @Override public ExtendedInfo convert(ExtendedConstructionNode node) { return node.getInfo(); } }; TreeCopier<ExtendedInfo, ExtendedConstructionNode, ExtendedInfo, ExtendedNode> treeCopier = new TreeCopier<ExtendedInfo, ExtendedConstructionNode, ExtendedInfo, ExtendedNode>(constructionTree, constructionNodeToNodeInfoConverter, new ExtendedNodeConstructor()); treeCopier.copy(); try { return new TwoTreesAndTheirBidirectionalMap<ExtendedConstructionNode, ExtendedNode>(constructionTree, treeCopier.getGeneratedTree(), treeCopier.getNodesMap()); } catch (AnnotatorException e) { throw new AnnotatorException("Error duplicating " + constructionTree, e); } }
/** * @param tree * @return * @throws AnnotatorException */ public static TwoTreesAndTheirBidirectionalMap<ExtendedNode, ExtendedConstructionNode> dupTreeToConstructionTree( ExtendedNode tree) throws AnnotatorException { InfoConverter<ExtendedNode, ExtendedInfo> nodeToConstructionInfoConverter = new InfoConverter<ExtendedNode, ExtendedInfo>() { @Override public ExtendedInfo convert(ExtendedNode node) { return node.getInfo(); } }; TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedConstructionNode> treeCopier = new TreeCopier<ExtendedInfo, ExtendedNode, ExtendedInfo, ExtendedConstructionNode>(tree, nodeToConstructionInfoConverter, new ExtendedConstructionNodeConstructor()); treeCopier.copy(); try { return new TwoTreesAndTheirBidirectionalMap<ExtendedNode, ExtendedConstructionNode>(tree, treeCopier.getGeneratedTree(), treeCopier.getNodesMap()); } catch (AnnotatorException e) { throw new AnnotatorException("Error duplicating " + tree, e); } }
public void generate() { TreeCopier<I, S, I, S> copier = new TreeCopier<I, S, I, S>( originalTree, new TreeCopier.InfoConverter<S, I>() { @Override public I convert(S os) { return os.getInfo(); } }, nodeConstructor ); copier.copy(); generatedTree = copier.getGeneratedTree(); generatedTree.addChild(treeToPatch); BidirectionalMap<S, S> copierMap = copier.getNodesMap(); mapOriginalToGenerated = new SimpleValueSetMap<>(); for (S node : copierMap.leftSet()) { mapOriginalToGenerated.put(node, copierMap.leftGet(node)); } }
treeCopier.copy(); annotatedTree = treeCopier.getGeneratedTree(); mapOriginalToAnnotated = treeCopier.getNodesMap();
BidirectionalMap<BasicNode, ExtendedNode> mapping = treeCopier.getNodesMap();