Go to the documentation of this file.
12 #ifndef BOOST_PROPERTY_TREE_PTREE_HPP_INCLUDED
13 #define BOOST_PROPERTY_TREE_PTREE_HPP_INCLUDED
31 namespace boost {
namespace property_tree
47 template<
class Key,
class Data,
class KeyCompare>
50 #if defined(BOOST_PROPERTY_TREE_DOXYGEN_INVOKED)
134 template<
class It>
void insert(
iterator where, It first, It last);
168 template<
class Compare>
void sort(Compare comp);
211 std::pair<assoc_iterator, assoc_iterator>
215 std::pair<const_assoc_iterator, const_assoc_iterator>
304 template<
class Type,
class Translator>
319 template<
class Type,
class Translator>
320 Type
get_value(
const Type &default_value, Translator tr)
const;
323 template <
class Ch,
class Translator>
326 std::basic_string<Ch>
328 get_value(
const Ch *default_value, Translator tr)
const;
336 get_value(
const Type &default_value)
const;
342 std::basic_string<Ch>
350 template<
class Type,
class Translator>
364 template<
class Type,
class Translator>
365 void put_value(
const Type &value, Translator tr);
375 template<
class Type,
class Translator>
388 template<
class Type,
class Translator>
390 const Type &default_value,
391 Translator tr)
const;
394 template <
class Ch,
class Translator>
397 std::basic_string<Ch>
414 std::basic_string<Ch>
426 template<
class Type,
class Translator>
446 template<
class Type,
class Translator>
470 template<
class Type,
class Translator>
iterator to_iterator(assoc_iterator it)
boost::enable_if< detail::is_translator< Translator >, Type >::type get(const path_type &path, Translator tr) const
optional< Type > get_value_optional() const
size_type max_size() const
self_type * walk_path(path_type &p) const
optional< Type > get_optional(const path_type &path, Translator tr) const
BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE.
std::pair< assoc_iterator, assoc_iterator > equal_range(const key_type &key)
iterator erase(iterator where)
iterator push_back(const value_type &value)
optional< self_type & > get_child_optional(const path_type &path)
assoc_iterator not_found()
size_type count(const key_type &key) const
path_of< Key >::type path_type
self_type & put(const path_type &path, const Type &value, Translator tr)
self_type & force_path(path_type &p)
assoc_iterator ordered_begin()
bool operator!=(const self_type &rhs) const
void swap(self_type &rhs)
iterator insert(iterator where, const value_type &value)
self_type & operator=(const self_type &rhs)
self_type & put_child(const path_type &path, const self_type &value)
basic_ptree< Key, Data, KeyCompare > self_type
self_type & add_child(const path_type &path, const self_type &value)
std::pair< const Key, self_type > value_type
iterator push_front(const value_type &value)
self_type & get_child(const path_type &path)
void put_value(const Type &value, Translator tr)
bool operator==(const self_type &rhs) const
assoc_iterator find(const key_type &key)
self_type & add(const path_type &path, const Type &value, Translator tr)
reverse_iterator rbegin()
sick_visionary_ros
Author(s): SICK AG TechSupport 3D Snapshot
autogenerated on Thu Feb 8 2024 03:45:47