mirror of
https://github.com/zeux/pugixml.git
synced 2025-01-22 07:31:11 +08:00
0cac815b63
git-svn-id: http://pugixml.googlecode.com/svn/trunk@225 99668b35-9821-0410-8761-19e4c4f06640
99 lines
3.2 KiB
C++
99 lines
3.2 KiB
C++
#ifndef PUGIXML_NO_XPATH
|
|
|
|
#include "common.hpp"
|
|
|
|
TEST_XML(xpath_document_order, "<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>")
|
|
{
|
|
CHECK(xml_node().document_order() == 0);
|
|
CHECK(doc.child("node").document_order() == 0);
|
|
CHECK(doc.document_order() == 0);
|
|
|
|
doc.precompute_document_order();
|
|
|
|
CHECK(doc.document_order() == 1);
|
|
CHECK(doc.child("node").document_order() == 2);
|
|
CHECK(doc.child("node").child("child1").document_order() == 3);
|
|
CHECK(doc.child("node").child("child1").attribute("attr1").document_order() == 4);
|
|
CHECK(doc.child("node").child("child1").attribute("attr2").document_order() == 5);
|
|
CHECK(doc.child("node").child("child2").document_order() == 6);
|
|
CHECK(doc.child("node").child("child2").attribute("attr1").document_order() == 7);
|
|
CHECK(doc.child("node").child("child2").first_child().document_order() == 8);
|
|
}
|
|
|
|
TEST(xpath_allocator_many_pages)
|
|
{
|
|
std::string query = "0";
|
|
|
|
for (int i = 0; i < 128; ++i) query += "+string-length('abcdefgh')";
|
|
|
|
CHECK_XPATH_NUMBER(xml_node(), query.c_str(), 1024);
|
|
}
|
|
|
|
TEST(xpath_allocator_large_page)
|
|
{
|
|
std::string query;
|
|
|
|
for (int i = 0; i < 1024; ++i) query += "abcdefgh";
|
|
|
|
CHECK_XPATH_NUMBER(xml_node(), ("string-length('" + query + "')").c_str(), 8192);
|
|
}
|
|
|
|
TEST_XML(xpath_sort_complex, "<node><child1 attr1='value1' attr2='value2'/><child2 attr1='value1'>test</child2></node>")
|
|
{
|
|
// just some random union order, it should not matter probably?
|
|
xpath_node_set ns = doc.child("node").select_nodes("child1 | child2 | child1/@* | . | child2/@* | child2/text()");
|
|
|
|
ns.sort(false);
|
|
xpath_node_set sorted = ns;
|
|
|
|
ns.sort(true);
|
|
xpath_node_set reverse_sorted = ns;
|
|
|
|
doc.precompute_document_order();
|
|
|
|
xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8;
|
|
xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2;
|
|
}
|
|
|
|
TEST_XML(xpath_sort_children, "<node><child><subchild id='1'/></child><child><subchild id='2'/></child></node>")
|
|
{
|
|
xpath_node_set ns = doc.child("node").select_nodes("child/subchild[@id=1] | child/subchild[@id=2]");
|
|
|
|
ns.sort(false);
|
|
xpath_node_set sorted = ns;
|
|
|
|
ns.sort(true);
|
|
xpath_node_set reverse_sorted = ns;
|
|
|
|
doc.precompute_document_order();
|
|
|
|
xpath_node_set_tester(sorted, "sorted order failed") % 4 % 7;
|
|
xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 7 % 4;
|
|
}
|
|
|
|
TEST_XML(xpath_sort_attributes, "<node/>")
|
|
{
|
|
xml_node n = doc.child("node");
|
|
|
|
// we need to insert attributes manually since unsorted node sets are (always?) sorted via pointers because of remove_duplicates,
|
|
// so we need to have different document and pointer order to cover all comparator cases
|
|
n.append_attribute("attr2");
|
|
n.append_attribute("attr3");
|
|
n.insert_attribute_before("attr1", n.attribute("attr2"));
|
|
|
|
xpath_node_set ns = n.select_nodes("@*");
|
|
|
|
ns.sort(true);
|
|
xpath_node_set reverse_sorted = ns;
|
|
|
|
ns.sort(false);
|
|
xpath_node_set sorted = ns;
|
|
|
|
doc.precompute_document_order();
|
|
|
|
xpath_node_set_tester(sorted, "sorted order failed") % 3 % 4 % 5;
|
|
xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 5 % 4 % 3;
|
|
}
|
|
|
|
#endif
|