231 lines
6.4 KiB
C++
231 lines
6.4 KiB
C++
// Generated by gtkmmproc -- DO NOT MODIFY!
|
|
|
|
#include <gtkmm/treemodelsort.h>
|
|
#include <gtkmm/private/treemodelsort_p.h>
|
|
|
|
// -*- c++ -*-
|
|
/* $Id$ */
|
|
|
|
/* 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 Library General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 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
|
|
* Library General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Library General Public
|
|
* License along with this library; if not, write to the Free
|
|
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
*/
|
|
|
|
#include <gtk/gtktreemodelsort.h>
|
|
|
|
|
|
typedef Gtk::TreeModel::Path Path; //So that the generated method implemenations can use this a return type.
|
|
|
|
namespace Gtk
|
|
{
|
|
|
|
TreeModel::iterator TreeModelSort::convert_child_iter_to_iter(const iterator& child_iter) const
|
|
{
|
|
TreeIter sorted_iter (const_cast<TreeModelSort*>(this));
|
|
|
|
gtk_tree_model_sort_convert_child_iter_to_iter(
|
|
const_cast<GtkTreeModelSort*>(gobj()), sorted_iter.gobj(),
|
|
const_cast<GtkTreeIter*>(child_iter.gobj()));
|
|
|
|
return sorted_iter;
|
|
}
|
|
|
|
TreeModel::iterator TreeModelSort::convert_iter_to_child_iter(const iterator& sorted_iter) const
|
|
{
|
|
GtkTreeModel *const child_model = gtk_tree_model_sort_get_model(const_cast<GtkTreeModelSort*>(gobj()));
|
|
|
|
TreeIter child_iter (dynamic_cast<TreeModel*>(Glib::wrap_auto((GObject*) child_model, false)));
|
|
|
|
gtk_tree_model_sort_convert_iter_to_child_iter(
|
|
const_cast<GtkTreeModelSort*>(gobj()), child_iter.gobj(),
|
|
const_cast<GtkTreeIter*>(sorted_iter.gobj()));
|
|
|
|
return child_iter;
|
|
}
|
|
|
|
void TreeModelSort::set_value_impl(const iterator& row, int column, const Glib::ValueBase& value)
|
|
{
|
|
// Avoid two extra ref/unref cycles -- we don't store the child
|
|
// model pointer anywhere, so it's OK to do this _internally_.
|
|
|
|
TreeModel *const child_model = dynamic_cast<TreeModel*>(
|
|
Glib::wrap_auto((GObject*) gtk_tree_model_sort_get_model(gobj()), false));
|
|
|
|
TreeIter child_iter (child_model);
|
|
|
|
gtk_tree_model_sort_convert_iter_to_child_iter(
|
|
gobj(), child_iter.gobj(), const_cast<GtkTreeIter*>(row.gobj()));
|
|
|
|
child_model->set_value_impl(child_iter, column, value);
|
|
}
|
|
|
|
} // namespace Gtk
|
|
|
|
|
|
namespace
|
|
{
|
|
} // anonymous namespace
|
|
|
|
|
|
namespace Glib
|
|
{
|
|
|
|
Glib::RefPtr<Gtk::TreeModelSort> wrap(GtkTreeModelSort* object, bool take_copy)
|
|
{
|
|
return Glib::RefPtr<Gtk::TreeModelSort>( dynamic_cast<Gtk::TreeModelSort*> (Glib::wrap_auto ((GObject*)(object), take_copy)) );
|
|
//We use dynamic_cast<> in case of multiple inheritance.
|
|
}
|
|
|
|
} /* namespace Glib */
|
|
|
|
|
|
namespace Gtk
|
|
{
|
|
|
|
|
|
/* The *_Class implementation: */
|
|
|
|
const Glib::Class& TreeModelSort_Class::init()
|
|
{
|
|
if(!gtype_) // create the GType if necessary
|
|
{
|
|
// Glib::Class has to know the class init function to clone custom types.
|
|
class_init_func_ = &TreeModelSort_Class::class_init_function;
|
|
|
|
// This is actually just optimized away, apparently with no harm.
|
|
// Make sure that the parent type has been created.
|
|
//CppClassParent::CppObjectType::get_type();
|
|
|
|
// Create the wrapper type, with the same class/instance size as the base type.
|
|
register_derived_type(gtk_tree_model_sort_get_type());
|
|
|
|
// Add derived versions of interfaces, if the C type implements any interfaces:
|
|
TreeModel::add_interface(get_type());
|
|
TreeSortable::add_interface(get_type());
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
void TreeModelSort_Class::class_init_function(void* g_class, void* class_data)
|
|
{
|
|
BaseClassType *const klass = static_cast<BaseClassType*>(g_class);
|
|
CppClassParent::class_init_function(klass, class_data);
|
|
|
|
}
|
|
|
|
|
|
Glib::ObjectBase* TreeModelSort_Class::wrap_new(GObject* object)
|
|
{
|
|
return new TreeModelSort((GtkTreeModelSort*)object);
|
|
}
|
|
|
|
|
|
/* The implementation: */
|
|
|
|
GtkTreeModelSort* TreeModelSort::gobj_copy()
|
|
{
|
|
reference();
|
|
return gobj();
|
|
}
|
|
|
|
TreeModelSort::TreeModelSort(const Glib::ConstructParams& construct_params)
|
|
:
|
|
Glib::Object(construct_params)
|
|
{}
|
|
|
|
TreeModelSort::TreeModelSort(GtkTreeModelSort* castitem)
|
|
:
|
|
Glib::Object((GObject*)(castitem))
|
|
{}
|
|
|
|
TreeModelSort::~TreeModelSort()
|
|
{}
|
|
|
|
|
|
TreeModelSort::CppClassType TreeModelSort::treemodelsort_class_; // initialize static member
|
|
|
|
GType TreeModelSort::get_type()
|
|
{
|
|
return treemodelsort_class_.init().get_type();
|
|
}
|
|
|
|
GType TreeModelSort::get_base_type()
|
|
{
|
|
return gtk_tree_model_sort_get_type();
|
|
}
|
|
|
|
|
|
TreeModelSort::TreeModelSort(const Glib::RefPtr<TreeModel>& model)
|
|
:
|
|
Glib::ObjectBase(0), //Mark this class as gtkmmproc-generated, rather than a custom class, to allow vfunc optimisations.
|
|
Glib::Object(Glib::ConstructParams(treemodelsort_class_.init(), "model", Glib::unwrap(model), (char*) 0))
|
|
{
|
|
}
|
|
|
|
Glib::RefPtr<TreeModelSort> TreeModelSort::create(const Glib::RefPtr<TreeModel>& model)
|
|
{
|
|
return Glib::RefPtr<TreeModelSort>( new TreeModelSort(model) );
|
|
}
|
|
Glib::RefPtr<TreeModel> TreeModelSort::get_model()
|
|
{
|
|
|
|
Glib::RefPtr<TreeModel> retvalue = Glib::wrap(gtk_tree_model_sort_get_model(gobj()));
|
|
|
|
if(retvalue)
|
|
retvalue->reference(); //The function does not do a ref for us.
|
|
return retvalue;
|
|
}
|
|
|
|
Glib::RefPtr<const TreeModel> TreeModelSort::get_model() const
|
|
{
|
|
|
|
Glib::RefPtr<const TreeModel> retvalue = Glib::wrap(gtk_tree_model_sort_get_model(const_cast<GtkTreeModelSort*>(gobj())));
|
|
|
|
if(retvalue)
|
|
retvalue->reference(); //The function does not do a ref for us.
|
|
return retvalue;
|
|
}
|
|
|
|
Path TreeModelSort::convert_child_path_to_path(const Path& child_path) const
|
|
{
|
|
return Gtk::TreePath(gtk_tree_model_sort_convert_child_path_to_path(const_cast<GtkTreeModelSort*>(gobj()), const_cast<GtkTreePath*>((child_path).gobj())), false);
|
|
}
|
|
|
|
Path TreeModelSort::convert_path_to_child_path(const Path& sorted_path) const
|
|
{
|
|
return Gtk::TreePath(gtk_tree_model_sort_convert_path_to_child_path(const_cast<GtkTreeModelSort*>(gobj()), const_cast<GtkTreePath*>((sorted_path).gobj())), false);
|
|
}
|
|
|
|
void TreeModelSort::reset_default_sort_func()
|
|
{
|
|
gtk_tree_model_sort_reset_default_sort_func(gobj());
|
|
}
|
|
|
|
void TreeModelSort::clear_cache()
|
|
{
|
|
gtk_tree_model_sort_clear_cache(gobj());
|
|
}
|
|
|
|
bool TreeModelSort::iter_is_valid(const iterator& iter) const
|
|
{
|
|
return gtk_tree_model_sort_iter_is_valid(const_cast<GtkTreeModelSort*>(gobj()), const_cast<GtkTreeIter*>((iter).gobj()));
|
|
}
|
|
|
|
|
|
} // namespace Gtk
|
|
|
|
|