3 #ifndef _GTKMM_TREEPATH_H 
    4 #define _GTKMM_TREEPATH_H 
    9 #include <glibmm/ustring.h> 
   10 #include <sigc++/sigc++.h> 
   38 #ifndef DOXYGEN_SHOULD_SKIP_THIS 
   39 extern "C" { 
typedef struct _GtkTreePath 
GtkTreePath; }
 
   59 #ifndef DOXYGEN_SHOULD_SKIP_THIS 
  106 #ifndef GLIBMM_HAVE_SUN_REVERSE_ITERATOR 
  113   typedef std::reverse_iterator<
iterator, std::random_access_iterator_tag,
 
  116   typedef std::reverse_iterator<
const_iterator, std::random_access_iterator_tag,
 
  125   template <
class In> 
inline TreePath(In pbegin, In pend);
 
  134   operator bool() 
const;
 
  136   template <
class In> 
inline void assign(In pbegin, In pend);
 
  137   template <
class In>        
void append(In pbegin, In pend);
 
  223 #ifndef GTKMM_DISABLE_DEPRECATED 
  236 #ifndef GTKMM_DISABLE_DEPRECATED 
  249 #ifndef GTKMM_DISABLE_DEPRECATED 
  261 #ifndef GTKMM_DISABLE_DEPRECATED 
  305 #ifndef DOXYGEN_SHOULD_SKIP_THIS 
  311   for(; pbegin != pend; ++pbegin)
 
  315 template <
class In> 
inline 
  318   this->
append(pbegin, pend);
 
  321 template <
class In> 
inline 
  331 struct TreePath_Traits
 
  333   typedef TreePath            CppType;
 
  337   static CType to_c_type(
const CppType& item)
 
  338     { 
return item.gobj(); }
 
  340   static CType to_c_type(CType item)
 
  343   static CppType to_cpp_type(CType item)
 
  344     { 
return CppType(
const_cast<CTypeNonConst
>(item)); }
 
  346   static void release_c_type(CType item)
 
  430 #ifndef DOXYGEN_SHOULD_SKIP_THIS 
bool is_ancestor(const TreePath &descendant) const
TreePath & operator=(const TreeModel::iterator &iter)
reverse_iterator rbegin()
static bool get_from_selection_data(const SelectionData &selection_data, Glib::RefPtr< TreeModel > &model, TreePath &path)
bool operator!=(const TreePath &lhs, const TreePath &rhs)
void push_back(int index)
TreePath(const TreeModel::iterator &iter)
Gtk::TreePath wrap(GtkTreePath *object, bool take_copy=false)
GtkTreePath * gobj_copy() const
Provides access to the underlying C instance. The caller is responsible for freeing it....
static bool get_from_selection_data(const SelectionData &selection_data, TreePath &path)
See description in the other overload.
void assign(In pbegin, In pend)
const_reverse_iterator rbegin() const
bool is_descendant(const TreePath &ancestor) const
void prepend_index(int index)
void swap(TreePath &other)
bool operator>=(const TreePath &lhs, const TreePath &rhs)
GtkTreePath * gobj()
Provides access to the underlying C instance.
const GtkTreePath * gobj() const
Provides access to the underlying C instance.
const_reverse_iterator rend() const
bool operator<(const TreePath &lhs, const TreePath &rhs)
bool operator>(const TreePath &lhs, const TreePath &rhs)
const int & const_reference
void push_front(int index)
TreePath(size_type n, value_type value=0)
Glib::ArrayHandle< int > get_indices() const
Glib::ustring to_string() const
TreePath(In pbegin, In pend)
bool set_in_selection_data(SelectionData &selection_data, const Glib::RefPtr< const TreeModel > &model) const
bool operator==(const TreePath &lhs, const TreePath &rhs)
const_reference front() const
TreePath(const Glib::ustring &path)
const_reference back() const
reference operator[](size_type i)
static GType get_type() G_GNUC_CONST
const_iterator begin() const
std::reverse_iterator< const_iterator > const_reverse_iterator
void append(In pbegin, In pend)
void append_index(int index)
const_reference operator[](size_type i) const
bool operator<=(const TreePath &lhs, const TreePath &rhs)
const_iterator end() const
const int * const_iterator
std::reverse_iterator< iterator > reverse_iterator
void swap(TreePath &lhs, TreePath &rhs)
struct _GtkTreePath GtkTreePath
void gtk_tree_path_free(GtkTreePath *path)