0

我有以下输入：

<soapenv:Envelope xmlns:soapenv="http://schemas.xmlrest.org/soap/envelope/" xmlns:ws="http://somepage.net/sk/caf/ws">
   <soapenv:Header>
      <ws:messageIdHeader>
         <ws:messageId>1234545</ws:messageId>
      </ws:messageIdHeader>
      <ws:messageIdHeader>
         <ws:messageId>9999999</ws:messageId>
      </ws:messageIdHeader>
   </soapenv:Header>
   <soapenv:Body>
      <ws:getClientRequest>
         <ws:caid>000899</ws:caid>
      </ws:getClientRequest>
   </soapenv:Body>
</soapenv:Envelope>

在这种情况下，输出必须如下：

| Envelope.Header.messageIdHeader.0.messageId | 1234545 |
| Envelope.Header.messageIdHeader.1.messageId | 9999999 |
| Envelope.Body.getClientRequest.caid         | 0008997 |

我尝试了一些对 DOM 的操作，但仍然没有所需的结果。问题是何时调用方法 getNextSiblings.getNodeName()/getPreviousSiblings.getNodeName() 方法。他们不返回标签的名称，而是一些废话。而且我无法弄清楚哪个元素有兄弟姐妹。简单地说，我需要索引元素，它有兄弟姐妹，但我不知道该怎么做。请问您有什么建议吗？:)

那是我使用的代码，但没有必需的结果：

public static void main(String[] args) throws Exception {
        File file = new File("/Some/path/tothis.xml");
        XPath xPath =  XPathFactory.newInstance().newXPath();
        String expression = "//*[not(*)]";

        DocumentBuilderFactory builderFactory =
                DocumentBuilderFactory.newInstance();
        DocumentBuilder builder = builderFactory.newDocumentBuilder();
        Document document = builder.parse(file);
        document.getDocumentElement().normalize();

        NodeList nodeList = (NodeList)
                xPath.compile(expression).evaluate(document, XPathConstants.NODESET);
        for(int i = 0 ; i < nodeList.getLength(); i++) {
            System.out.println("| "+ new Parser2().getNodePath(nodeList.item(i)) +" | " + nodeList.item(i).getTextContent() + " |");
        }
    }

    public String getNodePath(Node node) {
        if(node == null) {
            throw new IllegalArgumentException("Node cannot be null");
        }
        StringBuilder pathBuilder = new StringBuilder(".");
        String [] lastNode = node.getNodeName().split(":");
        pathBuilder.append(lastNode[1]);

        Node currentNode = node;

        if(currentNode.getNodeType() != Node.DOCUMENT_NODE) {
            while (currentNode.getParentNode() != null) {
                currentNode = currentNode.getParentNode();

                if(currentNode.getNodeType() == Node.DOCUMENT_NODE) {
                    break;
                } else if(getIndexOfArrayNode(currentNode) != null) {
                    String [] nodeName = currentNode.getNodeName().split(":");
                    pathBuilder.insert(0, nodeName[1] +  getIndexOfArrayNode(currentNode).toString() +".");
                } else {
                    String [] nodeName = currentNode.getNodeName().split(":");
                    pathBuilder.insert(0, nodeName[1] +"." );
                }
            }
        }

        return pathBuilder.toString();
    }

    private boolean isArrayNode(Node node) {
        if (node.getNextSibling() == null && node.getPreviousSibling() == null) {
            // Node has no siblings
            return false;
        } else {
            // Check if node siblings are of the same name. If so, then we are inside an array.
            return (node.getNextSibling() != null && node.getNextSibling().getNodeName().equalsIgnoreCase(node.getNodeName()))
                    || (node.getPreviousSibling() != null && node.getPreviousSibling().getNodeName().equalsIgnoreCase(node.getNodeName()));
        }
    }

    private Integer getIndexOfArrayNode(Node node) {
        if(isArrayNode(node)) {
            int leftCount = 0;

            Node currentNode = node.getNextSibling();

            while(currentNode != null) {
                leftCount++;
                currentNode = currentNode.getPreviousSibling();
            }
            return leftCount;
        } else {
            return null;
        }
    }

非常感谢

4

0 回答 0