2002-04-25 Christopher James Lahey <clahey@ximian.com> * gal/e-paned/e-paned.c, gal/e-text/e-entry.c, gal/util/e-bit-array.c, gal/util/e-sorter-array.c, gal/util/e-sorter.c, gal/util/e-text-event-processor.c, gal/widgets/color-group.c, gal/widgets/color-palette.c, gal/widgets/e-canvas-vbox.c, gal/widgets/e-canvas.c, gal/widgets/e-canvas.h, gal/widgets/e-categories-master-list-array.c, gal/widgets/e-categories-master-list-combo.c, gal/widgets/e-categories-master-list-dialog-model.c, gal/widgets/e-categories-master-list-dialog.c, gal/widgets/e-categories.c, gal/widgets/e-reflow-model.c, gal/widgets/e-reflow.c, gal/widgets/e-selection-model-array.c, gal/widgets/e-selection-model-simple.c, gal/widgets/e-selection-model.c, gal/widgets/e-selection-model.h, gal/widgets/gtk-combo-box.c, gal/widgets/gtk-combo-stack.c, gal/widgets/widget-color-combo.c, gal/widgets/widget-pixmap-combo.c: Ansification patch from danw. svn path=/trunk/; revision=16589
157 lines
3.5 KiB
C
157 lines
3.5 KiB
C
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
|
|
/*
|
|
* e-sorter.c
|
|
* Copyright 2000, 2001, Ximian, Inc.
|
|
*
|
|
* Authors:
|
|
* Chris Lahey <clahey@ximian.com>
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Library General Public
|
|
* License, version 2, as published by the Free Software Foundation.
|
|
*
|
|
* 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., 59 Temple Place - Suite 330, Boston, MA
|
|
* 02111-1307, USA.
|
|
*/
|
|
|
|
#include <config.h>
|
|
#include <stdlib.h>
|
|
#include <gtk/gtksignal.h>
|
|
#include <string.h>
|
|
#include "gal/util/e-util.h"
|
|
#include "e-sorter.h"
|
|
|
|
#define d(x)
|
|
|
|
#define PARENT_TYPE gtk_object_get_type()
|
|
|
|
static GtkObjectClass *parent_class;
|
|
|
|
#define ES_CLASS(es) ((ESorterClass *)((GtkObject *)(es))->klass)
|
|
|
|
static gint es_model_to_sorted (ESorter *es, int row);
|
|
static gint es_sorted_to_model (ESorter *es, int row);
|
|
static void es_get_model_to_sorted_array (ESorter *es, int **array, int *count);
|
|
static void es_get_sorted_to_model_array (ESorter *es, int **array, int *count);
|
|
static gboolean es_needs_sorting(ESorter *es);
|
|
|
|
static void
|
|
es_class_init (ESorterClass *klass)
|
|
{
|
|
parent_class = gtk_type_class (PARENT_TYPE);
|
|
|
|
klass->model_to_sorted = es_model_to_sorted;
|
|
klass->sorted_to_model = es_sorted_to_model;
|
|
klass->get_model_to_sorted_array = es_get_model_to_sorted_array;
|
|
klass->get_sorted_to_model_array = es_get_sorted_to_model_array;
|
|
klass->needs_sorting = es_needs_sorting;
|
|
}
|
|
|
|
static void
|
|
es_init (ESorter *es)
|
|
{
|
|
}
|
|
|
|
E_MAKE_TYPE(e_sorter, "ESorter", ESorter, es_class_init, es_init, PARENT_TYPE)
|
|
|
|
ESorter *
|
|
e_sorter_new (void)
|
|
{
|
|
ESorter *es = gtk_type_new (E_SORTER_TYPE);
|
|
|
|
return es;
|
|
}
|
|
|
|
|
|
static gint
|
|
es_model_to_sorted (ESorter *es, int row)
|
|
{
|
|
return row;
|
|
}
|
|
|
|
static gint
|
|
es_sorted_to_model (ESorter *es, int row)
|
|
{
|
|
return row;
|
|
}
|
|
|
|
|
|
static void
|
|
es_get_model_to_sorted_array (ESorter *es, int **array, int *count)
|
|
{
|
|
}
|
|
|
|
static void
|
|
es_get_sorted_to_model_array (ESorter *es, int **array, int *count)
|
|
{
|
|
}
|
|
|
|
|
|
static gboolean
|
|
es_needs_sorting(ESorter *es)
|
|
{
|
|
return FALSE;
|
|
}
|
|
|
|
gint
|
|
e_sorter_model_to_sorted (ESorter *es, int row)
|
|
{
|
|
g_return_val_if_fail(es != NULL, -1);
|
|
g_return_val_if_fail(row >= 0, -1);
|
|
|
|
if (ES_CLASS(es)->model_to_sorted)
|
|
return ES_CLASS(es)->model_to_sorted (es, row);
|
|
else
|
|
return -1;
|
|
}
|
|
|
|
gint
|
|
e_sorter_sorted_to_model (ESorter *es, int row)
|
|
{
|
|
g_return_val_if_fail(es != NULL, -1);
|
|
g_return_val_if_fail(row >= 0, -1);
|
|
|
|
if (ES_CLASS(es)->sorted_to_model)
|
|
return ES_CLASS(es)->sorted_to_model (es, row);
|
|
else
|
|
return -1;
|
|
}
|
|
|
|
|
|
void
|
|
e_sorter_get_model_to_sorted_array (ESorter *es, int **array, int *count)
|
|
{
|
|
g_return_if_fail(es != NULL);
|
|
|
|
if (ES_CLASS(es)->get_model_to_sorted_array)
|
|
ES_CLASS(es)->get_model_to_sorted_array (es, array, count);
|
|
}
|
|
|
|
void
|
|
e_sorter_get_sorted_to_model_array (ESorter *es, int **array, int *count)
|
|
{
|
|
g_return_if_fail(es != NULL);
|
|
|
|
if (ES_CLASS(es)->get_sorted_to_model_array)
|
|
ES_CLASS(es)->get_sorted_to_model_array (es, array, count);
|
|
}
|
|
|
|
|
|
gboolean
|
|
e_sorter_needs_sorting(ESorter *es)
|
|
{
|
|
g_return_val_if_fail (es != NULL, FALSE);
|
|
|
|
if (ES_CLASS(es)->needs_sorting)
|
|
return ES_CLASS(es)->needs_sorting (es);
|
|
else
|
|
return FALSE;
|
|
}
|