How to use

getValue

method

in

org.milyn.edisax.model.EdifactModel$Node

  private List<T> getUniqueValuesForNode(Node<T> node, List<T> list) {
    if ( node.getValue() != null && !list.contains( node.getValue() ) ) {
      list.add(node.getValue());
    }
    return list;
  }
}

  private List<T> getUniqueValuesForNode(Node<T> node, List<T> list) {
    if ( node.getValue() != null && !list.contains( node.getValue() ) ) {
      list.add(node.getValue());
    }
    return list;
  }
}

  private List<T> getUniqueValuesForNode(Node<T> node, List<T> list) {
    if ( node.getValue() != null && !list.contains( node.getValue() ) ) {
      list.add(node.getValue());
    }
    return list;
  }
}

  private List<T> getUniqueValuesForNode(Node<T> node, List<T> list) {
    if ( node.getValue() != null && !list.contains( node.getValue() ) ) {
      list.add(node.getValue());
    }
    return list;
  }
}

/**
 * Add child to parent Node if value does not exist in direct path from child to root
 * node, i.e. in any ancestralnode.
 * @param parent parent node
 * @param child the child node to add.
 * @return null if the value in child is not in confilct with value in any ancestor Node, otherwise return the conflicting ancestor Node. 
 */
public Node<T> add(Node<T> parent, Node<T> child){
  Node<T> node = parent;
  while (node != null ) {
    if (node != root && node.getValue().equals(child.getValue())) {
      return node;
    }
    node = node.getParent();
  }
  child.setParent(parent);
  parent.getChildren().add(child);
  return null;
}

/**
 * Add child to parent Node if value does not exist in direct path from child to root
 * node, i.e. in any ancestralnode.
 * @param parent parent node
 * @param child the child node to add.
 * @return null if the value in child is not in confilct with value in any ancestor Node, otherwise return the conflicting ancestor Node. 
 */
public Node<T> add(Node<T> parent, Node<T> child){
  Node<T> node = parent;
  while (node != null ) {
    if (node != root && node.getValue().equals(child.getValue())) {
      return node;
    }
    node = node.getParent();
  }
  child.setParent(parent);
  parent.getChildren().add(child);
  return null;
}

/**
 * Add child to parent Node if value does not exist in direct path from child to root
 * node, i.e. in any ancestralnode.
 * @param parent parent node
 * @param child the child node to add.
 * @return null if the value in child is not in confilct with value in any ancestor Node, otherwise return the conflicting ancestor Node. 
 */
public Node<T> add(Node<T> parent, Node<T> child){
  Node<T> node = parent;
  while (node != null ) {
    if (node != root && node.getValue().equals(child.getValue())) {
      return node;
    }
    node = node.getParent();
  }
  child.setParent(parent);
  parent.getChildren().add(child);
  return null;
}

conflictNode = tree.add(parent, child);
if ( conflictNode != null ) {
  throw new EDIParseException(edimap, "Circular dependency encountered in edi-message-mapping with imported files [" + importUri + "] and [" + conflictNode.getValue() + "]");

conflictNode = tree.add(parent, child);
if ( conflictNode != null ) {
  throw new EDIParseException(edimap, "Circular dependency encountered in edi-message-mapping with imported files [" + importUri + "] and [" + conflictNode.getValue() + "]");

conflictNode = tree.add(parent, child);
if ( conflictNode != null ) {
  throw new EDIParseException(edimap, "Circular dependency encountered in edi-message-mapping with imported files [" + importUri + "] and [" + conflictNode.getValue() + "]");

conflictNode = tree.add(parent, child);
if ( conflictNode != null ) {
  throw new EDIParseException(edimap, "Circular dependency encountered in edi-message-mapping with imported files [" + importUri + "] and [" + conflictNode.getValue() + "]");

/**
 * Add child to parent Node if value does not exist in direct path from child to root
 * node, i.e. in any ancestralnode.
 * @param parent parent node
 * @param child the child node to add.
 * @return null if the value in child is not in confilct with value in any ancestor Node, otherwise return the conflicting ancestor Node. 
 */
public Node<T> add(Node<T> parent, Node<T> child){
  Node<T> node = parent;
  while (node != null ) {
    if (node != root && node.getValue().equals(child.getValue())) {
      return node;
    }
    node = node.getParent();
  }
  child.setParent(parent);
  parent.getChildren().add(child);
  return null;
}