Home
last modified time | relevance | path

Searched refs:ptree (Results 1 – 25 of 27) sorted by relevance

12

/third_party/boost/libs/property_tree/test/
Dtest_ini_parser.cpp88 void test_erroneous_write(const boost::property_tree::ptree &pt) in test_erroneous_write()
162 ptree pt; in test_unmappable_trees()
163 pt.put_child("section.key.bogus", ptree()); in test_unmappable_trees()
169 ptree pt; in test_unmappable_trees()
170 pt.push_back(std::make_pair("section", ptree())); in test_unmappable_trees()
171 pt.push_back(std::make_pair("section", ptree())); in test_unmappable_trees()
177 ptree pt; in test_unmappable_trees()
178 ptree &child = pt.put_child("section", ptree()); in test_unmappable_trees()
179 child.push_back(std::make_pair("key", ptree())); in test_unmappable_trees()
180 child.push_back(std::make_pair("key", ptree())); in test_unmappable_trees()
[all …]
Dtest_json_parser2.cpp137 BOOST_TEST_DONT_PRINT_LOG_VALUE(ptree::iterator)
138 BOOST_TEST_DONT_PRINT_LOG_VALUE(ptree::const_iterator) in BOOST_TEST_DONT_PRINT_LOG_VALUE()
336 ptree tree; in BOOST_AUTO_TEST_CASE()
379 ptree tree; in BOOST_AUTO_TEST_CASE()
388 ptree::iterator it = tree.begin(); in BOOST_AUTO_TEST_CASE()
405 ptree tree; in BOOST_AUTO_TEST_CASE()
410 ptree::iterator it = tree.begin(); in BOOST_AUTO_TEST_CASE()
413 ptree& sub = it->second; in BOOST_AUTO_TEST_CASE()
416 ptree::iterator iit = sub.begin(); in BOOST_AUTO_TEST_CASE()
431 ptree& sub = it->second; in BOOST_AUTO_TEST_CASE()
[all …]
Dtest_json_parser.cpp371 generic_parser_test_error<ptree, ReadFunc, WriteFunc, json_parser_error> in test_json_parser()
377 generic_parser_test_error<ptree, ReadFunc, WriteFunc, json_parser_error> in test_json_parser()
383 generic_parser_test_error<ptree, ReadFunc, WriteFunc, json_parser_error> in test_json_parser()
389 generic_parser_test_error<ptree, ReadFunc, WriteFunc, json_parser_error> in test_json_parser()
434 test_json_parser<ptree>(); in test_main()
Dtest_property_tree.cpp82 #define PTREE boost::property_tree::ptree
176 ptree *pt = 0; in test_main()
Dsandbox.cpp19 ptree pt; in main()
Dtest_xml_parser_rapidxml.cpp23 test_xml_parser<ptree>(); in test_main()
Dtest_info_parser.cpp242 test_info_parser<ptree>(); in test_main()
/third_party/boost/libs/property_tree/examples/
Dspeed_test.cpp43 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_push_back()
51 ptree &pt = pt_array[n]; in clock_push_back()
53 pt.push_back(ptree::value_type(shuffled_keys[i], ptree())); in clock_push_back()
66 ptree pt; in clock_find()
68 pt.push_back(ptree::value_type(keys[i], ptree("data"))); in clock_find()
89 shared_array<ptree> pt_array(new ptree[max_repeats]); in clock_erase()
91 ptree pt; in clock_erase()
94 pt_array[n].push_back(ptree::value_type(keys[i], ptree("data"))); in clock_erase()
102 ptree &pt = pt_array[n]; in clock_erase()
Dempty_ptree_trick.cpp23 ptree pt; in process_settings()
25 const ptree &settings = pt.get_child("settings", empty_ptree<ptree>()); in process_settings()
35 ptree pt; in process_settings_without_trick()
37 if (boost::optional<ptree &> settings = pt.get_child_optional("settings")) in process_settings_without_trick()
Ddebug_settings.cpp35 pt::ptree tree; in load()
51 BOOST_FOREACH(pt::ptree::value_type &v, tree.get_child("debug.modules")) { in load()
62 pt::ptree tree; in save()
/third_party/boost/libs/graph/src/
Dgraphml.cpp32 static boost::property_tree::ptree::path_type path(const std::string& str) in path()
34 return boost::property_tree::ptree::path_type(str, '/'); in path()
37 void get_graphs(const boost::property_tree::ptree& top, in get_graphs()
39 std::vector< const boost::property_tree::ptree* >& result) in get_graphs()
41 using boost::property_tree::ptree; in get_graphs()
44 BOOST_FOREACH (const ptree::value_type& n, top) in get_graphs()
54 BOOST_FOREACH (const ptree::value_type& attr, n.second) in get_graphs()
76 using boost::property_tree::ptree; in run()
77 ptree pt; in run()
81 ptree gml = pt.get_child(path("graphml")); in run()
[all …]
/third_party/boost/libs/compute/include/boost/compute/detail/
Dparameter_cache.hpp147 boost::property_tree::ptree pt; in write_to_disk()
168 boost::property_tree::ptree pt; in read_from_disk()
194 typedef boost::property_tree::ptree::const_iterator pt_iter; in read_from_disk()
201 boost::property_tree::ptree child_pt = pt.get_child(iter->first); in read_from_disk()
/third_party/boost/boost/compute/detail/
Dparameter_cache.hpp147 boost::property_tree::ptree pt; in write_to_disk()
168 boost::property_tree::ptree pt; in read_from_disk()
194 typedef boost::property_tree::ptree::const_iterator pt_iter; in read_from_disk()
201 boost::property_tree::ptree child_pt = pt.get_child(iter->first); in read_from_disk()
/third_party/openssl/crypto/x509v3/
Dv3_ncons.c126 STACK_OF(GENERAL_SUBTREE) **ptree = NULL; in v2i_NAME_CONSTRAINTS()
136 ptree = &ncons->permittedSubtrees; in v2i_NAME_CONSTRAINTS()
139 ptree = &ncons->excludedSubtrees; in v2i_NAME_CONSTRAINTS()
151 if (*ptree == NULL) in v2i_NAME_CONSTRAINTS()
152 *ptree = sk_GENERAL_SUBTREE_new_null(); in v2i_NAME_CONSTRAINTS()
153 if (*ptree == NULL || !sk_GENERAL_SUBTREE_push(*ptree, sub)) in v2i_NAME_CONSTRAINTS()
Dpcy_tree.c101 static int tree_init(X509_POLICY_TREE **ptree, STACK_OF(X509) *certs, in tree_init() argument
115 *ptree = NULL; in tree_init()
249 *ptree = tree; in tree_init()
655 int X509_policy_check(X509_POLICY_TREE **ptree, int *pexplicit_policy, in X509_policy_check() argument
665 *ptree = NULL; in X509_policy_check()
708 *ptree = tree; in X509_policy_check()
/third_party/boost/libs/property_tree/doc/
Dsynopsis.qbk10 [def __ptree__ [classref boost::property_tree::ptree ptree]]
Dintro.qbk25 struct ptree
28 list< pair<key_type, ptree> > children; // ordered list of named children
Dproperty_tree.qbk28 [def __ptree__ [classref boost::property_tree::ptree ptree]]
113 * Mathematical relations: ptree difference, union, intersection.
Daccessing.qbk12 Property tree resembles (almost is) a standard container with value type of `pair<string, ptree>`. …
24 ptree pt;
63 typedef ptree::path_type path;
Dcmd_line_parser.qbk73 size_t count = pt.__ptree_get_child__("N", empty_ptree<ptree>()).size();
/third_party/boost/boost/property_tree/
Dptree_fwd.hpp95 typedef basic_ptree<std::string, std::string> ptree; typedef
/third_party/boost/libs/beast/doc/qbk/04_http/
D09_custom_body.qbk78 #include <boost/property_tree/ptree.hpp>
83 using value_type = boost::property_tree::ptree;
/third_party/mksh/
Dtree.c30 static void ptree(struct op *, int, struct shf *);
59 ptree(struct op *t, int indent, struct shf *shf) in ptree() function
498 ptree(va_arg(va, struct op *), indent, shf); in vfptreef()
/third_party/boost/libs/bimap/doc/
Dhistory.qbk188 The reason why ptree does not use multi index is because implementation
195 Although ptree has large interface with many functions modifying state of
/third_party/openssl/include/openssl/
Dx509_vfy.h598 int X509_policy_check(X509_POLICY_TREE **ptree, int *pexplicit_policy,

12