1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
|
// Generated by gmmproc 2.42.0 -- DO NOT MODIFY!
#include <glibmm.h>
#include <gtkmm/treepath.h>
#include <gtkmm/private/treepath_p.h>
/*
* Copyright 1998-2002 The gtkmm Development Team
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <gtkmm/treemodel.h>
#include <glibmm/utility.h>
#include <gtk/gtk.h>
namespace Gtk
{
TreePath::TreePath(GtkTreePath* gobject, bool make_a_copy)
:
// For BoxedType wrappers, make_a_copy is true by default. The static
// BoxedType wrappers must always take a copy, thus make_a_copy = true
// ensures identical behaviour if the default argument is used.
gobject_ (gobject ? (make_a_copy ? gtk_tree_path_copy(gobject) : gobject) : gtk_tree_path_new())
{}
TreePath::TreePath(TreePath::size_type n, TreePath::value_type value)
:
gobject_(gtk_tree_path_new())
{
for(; n > 0; --n)
gtk_tree_path_append_index(gobject_, value);
}
TreePath::TreePath(const Glib::ustring& path)
:
gobject_ (gtk_tree_path_new_from_string(path.c_str()))
{
if (!gobject_)
gobject_ = gtk_tree_path_new();
}
TreePath::TreePath(const TreeModel::iterator& iter)
:
// The GtkTreePath* is always newly created.
gobject_ (gtk_tree_model_get_path(iter.get_model_gobject(), const_cast<GtkTreeIter*>(iter.gobj())))
{
if (!gobject_)
gobject_ = gtk_tree_path_new();
}
TreePath& TreePath::operator=(const TreeModel::iterator& iter)
{
TreePath temp(iter);
swap(temp);
return *this;
}
void TreePath::clear()
{
TreePath empty_path;
swap(empty_path);
}
TreePath::size_type TreePath::size() const
{
return gtk_tree_path_get_depth(gobject_);
}
TreePath::operator const void*() const
{
return !empty() ? GINT_TO_POINTER(1) : 0;
}
bool TreePath::empty() const
{
return (gtk_tree_path_get_depth(gobject_) == 0);
}
TreePath::reference TreePath::operator[](TreePath::size_type i)
{
int *const indices = gtk_tree_path_get_indices(gobject_);
return indices[i];
}
TreePath::const_reference TreePath::operator[](TreePath::size_type i) const
{
const int *const indices = gtk_tree_path_get_indices(gobject_);
return indices[i];
}
TreePath::iterator TreePath::begin()
{
return gtk_tree_path_get_indices(gobject_);
}
TreePath::iterator TreePath::end()
{
return gtk_tree_path_get_indices(gobject_) + gtk_tree_path_get_depth(gobject_);
}
TreePath::const_iterator TreePath::begin() const
{
return gtk_tree_path_get_indices(gobject_);
}
TreePath::const_iterator TreePath::end() const
{
return gtk_tree_path_get_indices(gobject_) + gtk_tree_path_get_depth(gobject_);
}
bool TreePath::get_from_selection_data(const SelectionData& selection_data, Glib::RefPtr<TreeModel>& model, TreePath& path) //static
{
GtkTreeModel* src_model = 0;
GtkTreePath* src_path = 0;
gboolean result = gtk_tree_get_row_drag_data(const_cast<GtkSelectionData*>(selection_data.gobj()), &src_model, &src_path);
model = Glib::wrap(src_model, true /* take_copy=true */);
//gtk_tree_get_row_drag_data gives us ownership of src_path.
path = Glib::wrap(src_path, false /* take_copy=false */);
return result;
}
bool TreePath::get_from_selection_data(const SelectionData& selection_data, TreePath& path) //static
{
GtkTreePath* src_path = 0;
gboolean result = gtk_tree_get_row_drag_data(const_cast<GtkSelectionData*>(selection_data.gobj()), 0, &src_path);
//gtk_tree_get_row_drag_data gives us ownership of src_path.
path = Glib::wrap(src_path, false /* take_copy=false */);
return result;
}
bool TreePath::set_in_selection_data(SelectionData& selection_data, const Glib::RefPtr<const TreeModel>& model) const
{
return gtk_tree_set_row_drag_data(selection_data.gobj(), const_cast<GtkTreeModel*>(model->gobj()), const_cast<GtkTreePath*>(gobj()));
}
} // namespace Gtk
namespace
{
} // anonymous namespace
namespace Glib
{
Gtk::TreePath wrap(GtkTreePath* object, bool take_copy)
{
return Gtk::TreePath(object, take_copy);
}
} // namespace Glib
namespace Gtk
{
// static
GType TreePath::get_type()
{
return gtk_tree_path_get_type();
}
TreePath::TreePath()
:
gobject_ (gtk_tree_path_new())
{}
TreePath::TreePath(const TreePath& other)
:
gobject_ ((other.gobject_) ? gtk_tree_path_copy(other.gobject_) : 0)
{}
TreePath& TreePath::operator=(const TreePath& other)
{
TreePath temp (other);
swap(temp);
return *this;
}
TreePath::~TreePath()
{
if(gobject_)
gtk_tree_path_free(gobject_);
}
void TreePath::swap(TreePath& other)
{
GtkTreePath *const temp = gobject_;
gobject_ = other.gobject_;
other.gobject_ = temp;
}
GtkTreePath* TreePath::gobj_copy() const
{
return gtk_tree_path_copy(gobject_);
}
void TreePath::push_back(int index)
{
gtk_tree_path_append_index(gobj(), index);
}
void TreePath::push_front(int index)
{
gtk_tree_path_prepend_index(gobj(), index);
}
void TreePath::next()
{
gtk_tree_path_next(gobj());
}
bool TreePath::prev()
{
return gtk_tree_path_prev(gobj());
}
bool TreePath::up()
{
return gtk_tree_path_up(gobj());
}
void TreePath::down()
{
gtk_tree_path_down(gobj());
}
bool TreePath::is_ancestor(const TreePath& descendant) const
{
return gtk_tree_path_is_ancestor(const_cast<GtkTreePath*>(gobj()), const_cast<GtkTreePath*>((descendant).gobj()));
}
bool TreePath::is_descendant(const TreePath& ancestor) const
{
return gtk_tree_path_is_descendant(const_cast<GtkTreePath*>(gobj()), const_cast<GtkTreePath*>((ancestor).gobj()));
}
Glib::ustring TreePath::to_string() const
{
return Glib::convert_return_gchar_ptr_to_ustring(gtk_tree_path_to_string(const_cast<GtkTreePath*>(gobj())));
}
bool operator==(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) == 0);
}
bool operator!=(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) != 0);
}
bool operator<(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) < 0);
}
bool operator>(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) > 0);
}
bool operator<=(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) <= 0);
}
bool operator>=(const TreePath& lhs, const TreePath& rhs)
{
return (gtk_tree_path_compare(lhs.gobj(), rhs.gobj()) >= 0);
}
} // namespace Gtk
|