mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2024-11-10 11:26:16 +01:00
45fb71949a
Wed Mar 14 18:46:54 2001 Tim Janik <timj@gtk.org>
* gscanner.[hc]: removed archaic gpointer derived_data; relict and
added a GData member instead.
* glist.[hc]: added g_list_remove_all().
* gslist.[hc]: added g_slist_remove_all().
Sat Mar 17 23:18:36 2001 Tim Janik <timj@gtk.org>
* gobject.c (g_object_get_property): minor bug-fix.
* gbsearcharray.[hc]: provide a macro for static initialization and
functions g_bsearch_array_new() and g_bsearch_array_destroy() for
dynamic allocations.
* gboxed.c: introduce G_TYPE_GSTRING, boxed type for GString.
* gclosure.[hc]: naming corrections.
Fri Mar 9 16:42:08 2001 Tim Janik <timj@gtk.org>
* gvaluetypes.[hc]: moved g_strdup_value_contents() into this file as
a public function (was static in gobject.c before). it's a bit odd
to have that function here, especially since it requires extra includes,
but then it doesn't very well fit somewhere else either.
* gparamspecs.c: added default/max/min checks to param spec creation
functions.
149 lines
4.0 KiB
C
149 lines
4.0 KiB
C
/* GObject - GLib Type, Object, Parameter and Signal Library
|
|
* Copyright (C) 2000-2001 Tim Janik
|
|
*
|
|
* 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 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., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307, USA.
|
|
*
|
|
* gbsearcharray.h: binary searchable sorted array maintenance
|
|
*/
|
|
#ifndef __G_BSEARCH_ARRAY_H__
|
|
#define __G_BSEARCH_ARRAY_H__
|
|
|
|
#include <gobject/gtype.h>
|
|
|
|
G_BEGIN_DECLS
|
|
|
|
/* helper macro to avoid signed overflow for value comparisions */
|
|
#define G_BSEARCH_ARRAY_CMP(v1,v2) ((v1) < (v2) ? -1 : (v1) > (v2) ? 1 : 0)
|
|
|
|
|
|
/* --- typedefs --- */
|
|
typedef struct _GBSearchArray GBSearchArray;
|
|
typedef gint (*GBSearchCompareFunc) (gconstpointer bsearch_node1,
|
|
gconstpointer bsearch_node2);
|
|
typedef enum
|
|
{
|
|
G_BSEARCH_ARRAY_ALIGN_POWER2 = 1 << 0,
|
|
G_BSEARCH_ARRAY_DEFER_SHRINK = 1 << 1
|
|
} GBSearchArrayFlags;
|
|
|
|
|
|
/* --- structures --- */
|
|
struct _GBSearchArray
|
|
{
|
|
GBSearchCompareFunc cmp_nodes;
|
|
guint16 flags;
|
|
guint16 sizeof_node;
|
|
guint n_nodes;
|
|
gpointer nodes;
|
|
};
|
|
|
|
|
|
/* --- prototypes --- */
|
|
GBSearchArray* g_bsearch_array_new (guint16 sizeof_node,
|
|
GBSearchCompareFunc node_cmp_func,
|
|
GBSearchArrayFlags flags);
|
|
void g_bsearch_array_destroy (GBSearchArray *barray);
|
|
gpointer g_bsearch_array_insert (GBSearchArray *barray,
|
|
gconstpointer key_node,
|
|
gboolean replace_existing);
|
|
void g_bsearch_array_remove (GBSearchArray *barray,
|
|
gconstpointer key_node);
|
|
void g_bsearch_array_remove_node (GBSearchArray *barray,
|
|
gpointer node_in_array);
|
|
G_INLINE_FUNC
|
|
gpointer g_bsearch_array_lookup (GBSearchArray *barray,
|
|
gconstpointer key_node);
|
|
G_INLINE_FUNC
|
|
gpointer g_bsearch_array_get_nth (GBSearchArray *barray,
|
|
guint n);
|
|
G_INLINE_FUNC
|
|
guint g_bsearch_array_get_index (GBSearchArray *barray,
|
|
gpointer node_in_array);
|
|
|
|
|
|
/* initialization of static arrays */
|
|
#define G_STATIC_BSEARCH_ARRAY_INIT(sizeof_node, cmp_nodes, flags) \
|
|
{ (cmp_nodes), (flags), (sizeof_node), 0, NULL }
|
|
|
|
|
|
/* --- implementation details --- */
|
|
#if defined (G_CAN_INLINE) || defined (__G_BSEARCHARRAY_C__)
|
|
G_INLINE_FUNC gpointer
|
|
g_bsearch_array_lookup (GBSearchArray *barray,
|
|
gconstpointer key_node)
|
|
{
|
|
if (barray->n_nodes > 0)
|
|
{
|
|
GBSearchCompareFunc cmp_nodes = barray->cmp_nodes;
|
|
gint sizeof_node = barray->sizeof_node;
|
|
guint n_nodes = barray->n_nodes;
|
|
guint8 *nodes = (guint8 *) barray->nodes;
|
|
|
|
nodes -= sizeof_node;
|
|
do
|
|
{
|
|
guint8 *check;
|
|
guint i;
|
|
register gint cmp;
|
|
|
|
i = (n_nodes + 1) >> 1;
|
|
check = nodes + i * sizeof_node;
|
|
cmp = cmp_nodes (key_node, check);
|
|
if (cmp == 0)
|
|
return check;
|
|
else if (cmp > 0)
|
|
{
|
|
n_nodes -= i;
|
|
nodes = check;
|
|
}
|
|
else /* if (cmp < 0) */
|
|
n_nodes = i - 1;
|
|
}
|
|
while (n_nodes);
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
G_INLINE_FUNC gpointer
|
|
g_bsearch_array_get_nth (GBSearchArray *barray,
|
|
guint n)
|
|
{
|
|
if (n < barray->n_nodes)
|
|
{
|
|
guint8 *nodes = (guint8*) barray->nodes;
|
|
|
|
return nodes + n * barray->sizeof_node;
|
|
}
|
|
else
|
|
return NULL;
|
|
}
|
|
G_INLINE_FUNC
|
|
guint
|
|
g_bsearch_array_get_index (GBSearchArray *barray,
|
|
gpointer node_in_array)
|
|
{
|
|
guint distance = ((guint8*) node_in_array) - ((guint8*) barray->nodes);
|
|
|
|
distance /= barray->sizeof_node;
|
|
|
|
return MIN (distance, barray->n_nodes);
|
|
}
|
|
#endif /* G_CAN_INLINE || __G_BSEARCHARRAY_C__ */
|
|
|
|
G_END_DECLS
|
|
|
|
#endif /* __G_BSEARCH_ARRAY_H__ */
|