luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2024-11-13 12:56:15 +01:00
Code Issues Packages Projects Releases Wiki Activity
e231132fc3
glib/glib/gbsearcharray.h

300 lines
12 KiB
C
Raw Normal View History

license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
/* GBSearchArray - Binary Searchable Array implementation
* Copyright (C) 2000-2003 Tim Janik
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
*
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
* This software is provided "as is"; redistribution and modification
* is permitted, provided that the following disclaimer is retained.
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
*
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
* This software is distributed in the hope that it will be useful,
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
* but WITHOUT ANY WARRANTY; without even the implied warranty of
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* In no event shall the authors or contributors be liable for any
* direct, indirect, incidental, special, exemplary, or consequential
* damages (including, but not limited to, procurement of substitute
* goods or services; loss of use, data, or profits; or business
* interruption) however caused and on any theory of liability, whether
* in contract, strict liability, or tort (including negligence or
* otherwise) arising in any way out of the use of this software, even
* if advised of the possibility of such damage.
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
*/
#ifndef __G_BSEARCH_ARRAY_H__
#define __G_BSEARCH_ARRAY_H__
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
#include <glib.h>
#include <string.h>
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
G_BEGIN_DECLS /* c++ guards */
/* this implementation is intended to be usable in third-party code
* simply by pasting the contents of this file. as such, the
* implementation needs to be self-contained within this file.
*/
Spelling fixes Spelling fixes in comments and docs, provided by Kjartan Maraas in bug 657336.
2011-08-29 20:49:32 +02:00
/* convenience macro to avoid signed overflow for value comparisons */
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
#define G_BSEARCH_ARRAY_CMP(v1,v2) ((v1) > (v2) ? +1 : (v1) == (v2) ? 0 : -1)
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
/* --- typedefs --- */
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
typedef gint (*GBSearchCompareFunc) (gconstpointer bsearch_node1, /* key */
gconstpointer bsearch_node2);
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
typedef enum
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
G_BSEARCH_ARRAY_ALIGN_POWER2 = 1 << 0, /* align memory to power2 sizes */
G_BSEARCH_ARRAY_AUTO_SHRINK = 1 << 1 /* shrink array upon removal */
removed archaic gpointer derived_data; relict and added a GData member 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.
2001-03-18 05:44:38 +01:00
} GBSearchArrayFlags;
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
/* --- structures --- */
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
typedef struct
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
guint sizeof_node;
removed archaic gpointer derived_data; relict and added a GData member 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.
2001-03-18 05:44:38 +01:00
GBSearchCompareFunc cmp_nodes;
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
guint flags;
} GBSearchConfig;
typedef union
API revamp to shorten GValueArray structure. Thu Dec 13 05:37:51 2001 Tim Janik <timj@gtk.org> * glib/gbsearcharray.[hc]: API revamp to shorten GValueArray structure.
2001-12-13 08:06:56 +01:00
{
guint n_nodes;
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
/*< private >*/
API revamp to shorten GValueArray structure. Thu Dec 13 05:37:51 2001 Tim Janik <timj@gtk.org> * glib/gbsearcharray.[hc]: API revamp to shorten GValueArray structure.
2001-12-13 08:06:56 +01:00
gpointer alignment_dummy1;
glong alignment_dummy2;
gdouble alignment_dummy3;
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
} GBSearchArray;
/* --- public API --- */
static inline GBSearchArray* g_bsearch_array_create (const GBSearchConfig *bconfig);
static inline gpointer g_bsearch_array_get_nth (GBSearchArray *barray,
const GBSearchConfig *bconfig,
guint nth);
static inline guint g_bsearch_array_get_index (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer node_in_array);
static inline GBSearchArray* g_bsearch_array_remove (GBSearchArray *barray,
const GBSearchConfig *bconfig,
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
guint index_);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
/* provide uninitialized space at index for node insertion */
static inline GBSearchArray* g_bsearch_array_grow (GBSearchArray *barray,
const GBSearchConfig *bconfig,
guint index);
/* insert key_node into array if it does not exist, otherwise do nothing */
static inline GBSearchArray* g_bsearch_array_insert (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node);
/* insert key_node into array if it does not exist,
* otherwise replace the existing node's contents with key_node
*/
static inline GBSearchArray* g_bsearch_array_replace (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node);
static inline void g_bsearch_array_free (GBSearchArray *barray,
const GBSearchConfig *bconfig);
#define g_bsearch_array_get_n_nodes(barray) (((GBSearchArray*) (barray))->n_nodes)
/* g_bsearch_array_lookup():
* return NULL or exact match node
*/
#define g_bsearch_array_lookup(barray, bconfig, key_node) \
g_bsearch_array_lookup_fuzzy ((barray), (bconfig), (key_node), 0)
/* g_bsearch_array_lookup_sibling():
* return NULL for barray->n_nodes==0, otherwise return the
* exact match node, or, if there's no such node, return the
* node last visited, which is pretty close to an exact match
* (will be one off into either direction).
*/
#define g_bsearch_array_lookup_sibling(barray, bconfig, key_node) \
g_bsearch_array_lookup_fuzzy ((barray), (bconfig), (key_node), 1)
/* g_bsearch_array_lookup_insertion():
* return NULL for barray->n_nodes==0 or exact match, otherwise
* return the node where key_node should be inserted (may be one
* after end, i.e. g_bsearch_array_get_index(result) <= barray->n_nodes).
*/
#define g_bsearch_array_lookup_insertion(barray, bconfig, key_node) \
g_bsearch_array_lookup_fuzzy ((barray), (bconfig), (key_node), 2)
/* --- implementation --- */
/* helper macro to cut down realloc()s */
#define G_BSEARCH_UPPER_POWER2(n) ((n) ? 1 << g_bit_storage ((n) - 1) : 0)
#define G_BSEARCH_ARRAY_NODES(barray) (((guint8*) (barray)) + sizeof (GBSearchArray))
static inline GBSearchArray*
g_bsearch_array_create (const GBSearchConfig *bconfig)
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
GBSearchArray *barray;
guint size;
g_return_val_if_fail (bconfig != NULL, NULL);
size = sizeof (GBSearchArray) + bconfig->sizeof_node;
if (bconfig->flags & G_BSEARCH_ARRAY_ALIGN_POWER2)
size = G_BSEARCH_UPPER_POWER2 (size);
[gbsearcharray] Use malloc() instead of realloc(NULL,...)
2009-06-06 05:24:28 +02:00
barray = (GBSearchArray *) g_malloc (size);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
memset (barray, 0, sizeof (GBSearchArray));
return barray;
}
static inline gpointer
g_bsearch_array_lookup_fuzzy (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node,
const guint sibling_or_after);
static inline gpointer
g_bsearch_array_lookup_fuzzy (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node,
const guint sibling_or_after)
{
GBSearchCompareFunc cmp_nodes = bconfig->cmp_nodes;
guint8 *check = NULL, *nodes = G_BSEARCH_ARRAY_NODES (barray);
guint n_nodes = barray->n_nodes, offs = 0;
guint sizeof_node = bconfig->sizeof_node;
gint cmp = 0;
while (offs < n_nodes)
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
guint i = (offs + n_nodes) >> 1;
check = nodes + i * sizeof_node;
cmp = cmp_nodes (key_node, check);
if (cmp == 0)
return sibling_or_after > 1 ? NULL : check;
else if (cmp < 0)
n_nodes = i;
else /* (cmp > 0) */
offs = i + 1;
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
}
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
/* check is last mismatch, cmp > 0 indicates greater key */
return G_LIKELY (!sibling_or_after) ? NULL : (sibling_or_after > 1 && cmp > 0) ? check + sizeof_node : check;
}
static inline gpointer
g_bsearch_array_get_nth (GBSearchArray *barray,
const GBSearchConfig *bconfig,
guint nth)
{
return (G_LIKELY (nth < barray->n_nodes) ?
G_BSEARCH_ARRAY_NODES (barray) + nth * bconfig->sizeof_node :
NULL);
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
}
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
static inline guint
g_bsearch_array_get_index (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer node_in_array)
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
guint distance = ((guint8*) node_in_array) - G_BSEARCH_ARRAY_NODES (barray);
g_return_val_if_fail (node_in_array != NULL, barray->n_nodes);
distance /= bconfig->sizeof_node;
return MIN (distance, barray->n_nodes + 1); /* may return one after end */
}
static inline GBSearchArray*
g_bsearch_array_grow (GBSearchArray *barray,
const GBSearchConfig *bconfig,
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
guint index_)
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
{
guint old_size = barray->n_nodes * bconfig->sizeof_node;
guint new_size = old_size + bconfig->sizeof_node;
guint8 *node;
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
g_return_val_if_fail (index_ <= barray->n_nodes, NULL);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
if (G_UNLIKELY (bconfig->flags & G_BSEARCH_ARRAY_ALIGN_POWER2))
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
{
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
new_size = G_BSEARCH_UPPER_POWER2 (sizeof (GBSearchArray) + new_size);
old_size = G_BSEARCH_UPPER_POWER2 (sizeof (GBSearchArray) + old_size);
if (old_size != new_size)
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
barray = (GBSearchArray *) g_realloc (barray, new_size);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
}
else
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
barray = (GBSearchArray *) g_realloc (barray, sizeof (GBSearchArray) + new_size);
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node;
Require C90 compliance Assume all supported platforms implement C90, and therefore they (correctly) implement atexit(), memmove(), setlocale(), strerror(), and vprintf(), and have <float.h> and <limits.h>. (Also remove the configure check testing that "do ... while (0)" works correctly; the non-do/while-based version of G_STMT_START and G_STMT_END was removed years ago, but the check remained. Also, remove some checks that configure.ac claimed were needed for libcharset, but aren't actually used.) Note that removing the g_memmove() function is not an ABI break even on systems where g_memmove() was previously not a macro, because it was never marked GLIB_AVAILABLE_IN_ALL or listed in glib.symbols, so it would have been glib-internal since 2004. https://bugzilla.gnome.org/show_bug.cgi?id=710519
2013-10-19 19:03:58 +02:00
memmove (node + bconfig->sizeof_node, node, (barray->n_nodes - index_) * bconfig->sizeof_node);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
barray->n_nodes += 1;
return barray;
}
static inline GBSearchArray*
g_bsearch_array_insert (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node)
{
guint8 *node;
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
if (G_UNLIKELY (!barray->n_nodes))
{
barray = g_bsearch_array_grow (barray, bconfig, 0);
node = G_BSEARCH_ARRAY_NODES (barray);
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
}
else
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
{
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
node = (guint8 *) g_bsearch_array_lookup_insertion (barray, bconfig, key_node);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
if (G_LIKELY (node))
{
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
guint index_ = g_bsearch_array_get_index (barray, bconfig, node);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
/* grow and insert */
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
barray = g_bsearch_array_grow (barray, bconfig, index_);
node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node;
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
}
else /* no insertion needed, node already there */
return barray;
}
memcpy (node, key_node, bconfig->sizeof_node);
return barray;
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
}
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
static inline GBSearchArray*
g_bsearch_array_replace (GBSearchArray *barray,
const GBSearchConfig *bconfig,
gconstpointer key_node)
changed prototype of g_boxed_type_register_static() to contain an optional Wed Mar 7 09:36:33 2001 Tim Janik <timj@gtk.org> * gboxed.[hc]: changed prototype of g_boxed_type_register_static() to contain an optional init function and a hint at whether the boxed structure uses ref counting internally. added g_value_set_boxed_take_ownership(). made G_TYPE_BOXED an abstract value type. * genums.[hc]: made G_TYPE_ENUM and G_TYPE_FLAGS abstract value types. * glib-genmarshal.c: argument type changes, preparation for third-party arg specification. * gobject.[hc]: cleaned up get/set property code. added g_strdup_value_contents() to improve warnings. * gparam.[hc]: added g_param_value_convert(), taking over responsibility of the old g_value_convert(). added G_PARAM_LAX_VALIDATION flag so validation alterations may be valid a part of the property setting process. * gparamspecs.[hc]: made value comparisons stable (for sort applications). added GParamSpecValueArray, a param spec for value arrays and GParamSpecClosure. nuked the value exchange functions and GParamSpecCCallback. * gtype.[hc]: catch unintialized usages of the type system with g_return_val_if_uninitialized(). introduced G_TYPE_FLAG_VALUE_ABSTRACT to flag types that introduce a value table, but can't be used for g_value_init(). cleaned up reserved type ids. * gvalue.[hc]: code cleanups and saner checking. nuked the value exchange API. implemented value transformations, we can't really "convert" values, rather transforms are an anylogy to C casts, real conversions need a param spec for validation, which is why g_param_value_convert() does real conversions now. * gvaluearray.[hc]: new files that implement a GValueArray, a struct that can hold inhomogeneous arrays of value (to that extend that it also allowes undefined values, i.e. G_VALUE_TYPE(value)==0). this is exposed to the type system as a boxed type. * gvaluetransform.c: new file implementing most of the former value exchange functions as single-sided transformations. * gvaluetypes.[hc]: nuked G_TYPE_CCALLBACK, added g_value_set_string_take_ownership(). * *.h: s/G_IS_VALUE_/G_VALUE_HOLDS_/. * *.[hc]: many fixes and cleanups. * many warning improvements. Tue Feb 27 18:35:15 2001 Tim Janik <timj@gtk.org> * gobject.c (g_object_get_valist): urg, pass G_VALUE_NOCOPY_CONTENTS into G_VALUE_LCOPY(), this needs proper documenting. * gparam.c: fixed G_PARAM_USER_MASK. * gtype.c (type_data_make_W): (type_data_last_unref_Wm): fixed invalid memory freeing. * gobject.c (g_object_last_unref): destroy signal handlers associated with object, right before finalization. * gsignal.c (g_signal_parse_name): catch destroyed nodes or signals that don't actually support details. * gobject.[hc]: got rid of property trailers. nuked GObject properties "data" and the "signal" variants. (g_object_connect): new convenience function to do multiple signal connections at once. (g_object_disconnect): likewise, for disconnections. * gparam.[hc] (g_param_spec_pool_lookup): took out trailer support. * gvalue.[hc]: marked g_value_fits_pointer() and g_value_peek_pointer() as private (the latter got renamed from g_value_get_as_pointer()). Wed Mar 7 09:32:06 2001 Tim Janik <timj@gtk.org> * glib-object.h: add gvaluearray.h. * gstring.[hc]: fixup naming of g_string_sprint*. * gtypes.h: fixed GCompareDataFunc naming. Wed Mar 7 09:33:27 2001 Tim Janik <timj@gtk.org> * gobject/Makefile.am: shuffled rules to avoid excessive rebuilds. * gobject/gobject-sections.txt: updates. * gobject/tmpl/*: bunch of updates, added another patch from Eric Lemings <eric.b.lemings@lmco.com>.
2001-03-07 15:46:45 +01:00
{
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
guint8 *node = (guint8 *) g_bsearch_array_lookup (barray, bconfig, key_node);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
if (G_LIKELY (node)) /* expected path */
memcpy (node, key_node, bconfig->sizeof_node);
else /* revert to insertion */
barray = g_bsearch_array_insert (barray, bconfig, key_node);
return barray;
}
static inline GBSearchArray*
g_bsearch_array_remove (GBSearchArray *barray,
const GBSearchConfig *bconfig,
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
guint index_)
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
{
guint8 *node;
changed prototype of g_boxed_type_register_static() to contain an optional Wed Mar 7 09:36:33 2001 Tim Janik <timj@gtk.org> * gboxed.[hc]: changed prototype of g_boxed_type_register_static() to contain an optional init function and a hint at whether the boxed structure uses ref counting internally. added g_value_set_boxed_take_ownership(). made G_TYPE_BOXED an abstract value type. * genums.[hc]: made G_TYPE_ENUM and G_TYPE_FLAGS abstract value types. * glib-genmarshal.c: argument type changes, preparation for third-party arg specification. * gobject.[hc]: cleaned up get/set property code. added g_strdup_value_contents() to improve warnings. * gparam.[hc]: added g_param_value_convert(), taking over responsibility of the old g_value_convert(). added G_PARAM_LAX_VALIDATION flag so validation alterations may be valid a part of the property setting process. * gparamspecs.[hc]: made value comparisons stable (for sort applications). added GParamSpecValueArray, a param spec for value arrays and GParamSpecClosure. nuked the value exchange functions and GParamSpecCCallback. * gtype.[hc]: catch unintialized usages of the type system with g_return_val_if_uninitialized(). introduced G_TYPE_FLAG_VALUE_ABSTRACT to flag types that introduce a value table, but can't be used for g_value_init(). cleaned up reserved type ids. * gvalue.[hc]: code cleanups and saner checking. nuked the value exchange API. implemented value transformations, we can't really "convert" values, rather transforms are an anylogy to C casts, real conversions need a param spec for validation, which is why g_param_value_convert() does real conversions now. * gvaluearray.[hc]: new files that implement a GValueArray, a struct that can hold inhomogeneous arrays of value (to that extend that it also allowes undefined values, i.e. G_VALUE_TYPE(value)==0). this is exposed to the type system as a boxed type. * gvaluetransform.c: new file implementing most of the former value exchange functions as single-sided transformations. * gvaluetypes.[hc]: nuked G_TYPE_CCALLBACK, added g_value_set_string_take_ownership(). * *.h: s/G_IS_VALUE_/G_VALUE_HOLDS_/. * *.[hc]: many fixes and cleanups. * many warning improvements. Tue Feb 27 18:35:15 2001 Tim Janik <timj@gtk.org> * gobject.c (g_object_get_valist): urg, pass G_VALUE_NOCOPY_CONTENTS into G_VALUE_LCOPY(), this needs proper documenting. * gparam.c: fixed G_PARAM_USER_MASK. * gtype.c (type_data_make_W): (type_data_last_unref_Wm): fixed invalid memory freeing. * gobject.c (g_object_last_unref): destroy signal handlers associated with object, right before finalization. * gsignal.c (g_signal_parse_name): catch destroyed nodes or signals that don't actually support details. * gobject.[hc]: got rid of property trailers. nuked GObject properties "data" and the "signal" variants. (g_object_connect): new convenience function to do multiple signal connections at once. (g_object_disconnect): likewise, for disconnections. * gparam.[hc] (g_param_spec_pool_lookup): took out trailer support. * gvalue.[hc]: marked g_value_fits_pointer() and g_value_peek_pointer() as private (the latter got renamed from g_value_get_as_pointer()). Wed Mar 7 09:32:06 2001 Tim Janik <timj@gtk.org> * glib-object.h: add gvaluearray.h. * gstring.[hc]: fixup naming of g_string_sprint*. * gtypes.h: fixed GCompareDataFunc naming. Wed Mar 7 09:33:27 2001 Tim Janik <timj@gtk.org> * gobject/Makefile.am: shuffled rules to avoid excessive rebuilds. * gobject/gobject-sections.txt: updates. * gobject/tmpl/*: bunch of updates, added another patch from Eric Lemings <eric.b.lemings@lmco.com>.
2001-03-07 15:46:45 +01:00
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
g_return_val_if_fail (index_ < barray->n_nodes, NULL);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
barray->n_nodes -= 1;
Quell some compiler wanrings svn path=/trunk/; revision=7814
2009-01-18 07:44:04 +01:00
node = G_BSEARCH_ARRAY_NODES (barray) + index_ * bconfig->sizeof_node;
Require C90 compliance Assume all supported platforms implement C90, and therefore they (correctly) implement atexit(), memmove(), setlocale(), strerror(), and vprintf(), and have <float.h> and <limits.h>. (Also remove the configure check testing that "do ... while (0)" works correctly; the non-do/while-based version of G_STMT_START and G_STMT_END was removed years ago, but the check remained. Also, remove some checks that configure.ac claimed were needed for libcharset, but aren't actually used.) Note that removing the g_memmove() function is not an ABI break even on systems where g_memmove() was previously not a macro, because it was never marked GLIB_AVAILABLE_IN_ALL or listed in glib.symbols, so it would have been glib-internal since 2004. https://bugzilla.gnome.org/show_bug.cgi?id=710519
2013-10-19 19:03:58 +02:00
memmove (node, node + bconfig->sizeof_node, (barray->n_nodes - index_) * bconfig->sizeof_node);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
if (G_UNLIKELY (bconfig->flags & G_BSEARCH_ARRAY_AUTO_SHRINK))
{
guint new_size = barray->n_nodes * bconfig->sizeof_node;
guint old_size = new_size + bconfig->sizeof_node;
if (G_UNLIKELY (bconfig->flags & G_BSEARCH_ARRAY_ALIGN_POWER2))
{
new_size = G_BSEARCH_UPPER_POWER2 (sizeof (GBSearchArray) + new_size);
old_size = G_BSEARCH_UPPER_POWER2 (sizeof (GBSearchArray) + old_size);
if (old_size != new_size)
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
barray = (GBSearchArray *) g_realloc (barray, new_size);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
}
else
inserted casts for C++. Mon Sep 8 00:31:10 2003 Stefan Westerfeld <stefan@space.twc.de> * glib/gbsearcharray.h: inserted casts for C++.
2003-09-08 00:36:58 +02:00
barray = (GBSearchArray *) g_realloc (barray, sizeof (GBSearchArray) + new_size);
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
}
return barray;
}
static inline void
g_bsearch_array_free (GBSearchArray *barray,
const GBSearchConfig *bconfig)
{
g_return_if_fail (barray != NULL);
changed prototype of g_boxed_type_register_static() to contain an optional Wed Mar 7 09:36:33 2001 Tim Janik <timj@gtk.org> * gboxed.[hc]: changed prototype of g_boxed_type_register_static() to contain an optional init function and a hint at whether the boxed structure uses ref counting internally. added g_value_set_boxed_take_ownership(). made G_TYPE_BOXED an abstract value type. * genums.[hc]: made G_TYPE_ENUM and G_TYPE_FLAGS abstract value types. * glib-genmarshal.c: argument type changes, preparation for third-party arg specification. * gobject.[hc]: cleaned up get/set property code. added g_strdup_value_contents() to improve warnings. * gparam.[hc]: added g_param_value_convert(), taking over responsibility of the old g_value_convert(). added G_PARAM_LAX_VALIDATION flag so validation alterations may be valid a part of the property setting process. * gparamspecs.[hc]: made value comparisons stable (for sort applications). added GParamSpecValueArray, a param spec for value arrays and GParamSpecClosure. nuked the value exchange functions and GParamSpecCCallback. * gtype.[hc]: catch unintialized usages of the type system with g_return_val_if_uninitialized(). introduced G_TYPE_FLAG_VALUE_ABSTRACT to flag types that introduce a value table, but can't be used for g_value_init(). cleaned up reserved type ids. * gvalue.[hc]: code cleanups and saner checking. nuked the value exchange API. implemented value transformations, we can't really "convert" values, rather transforms are an anylogy to C casts, real conversions need a param spec for validation, which is why g_param_value_convert() does real conversions now. * gvaluearray.[hc]: new files that implement a GValueArray, a struct that can hold inhomogeneous arrays of value (to that extend that it also allowes undefined values, i.e. G_VALUE_TYPE(value)==0). this is exposed to the type system as a boxed type. * gvaluetransform.c: new file implementing most of the former value exchange functions as single-sided transformations. * gvaluetypes.[hc]: nuked G_TYPE_CCALLBACK, added g_value_set_string_take_ownership(). * *.h: s/G_IS_VALUE_/G_VALUE_HOLDS_/. * *.[hc]: many fixes and cleanups. * many warning improvements. Tue Feb 27 18:35:15 2001 Tim Janik <timj@gtk.org> * gobject.c (g_object_get_valist): urg, pass G_VALUE_NOCOPY_CONTENTS into G_VALUE_LCOPY(), this needs proper documenting. * gparam.c: fixed G_PARAM_USER_MASK. * gtype.c (type_data_make_W): (type_data_last_unref_Wm): fixed invalid memory freeing. * gobject.c (g_object_last_unref): destroy signal handlers associated with object, right before finalization. * gsignal.c (g_signal_parse_name): catch destroyed nodes or signals that don't actually support details. * gobject.[hc]: got rid of property trailers. nuked GObject properties "data" and the "signal" variants. (g_object_connect): new convenience function to do multiple signal connections at once. (g_object_disconnect): likewise, for disconnections. * gparam.[hc] (g_param_spec_pool_lookup): took out trailer support. * gvalue.[hc]: marked g_value_fits_pointer() and g_value_peek_pointer() as private (the latter got renamed from g_value_get_as_pointer()). Wed Mar 7 09:32:06 2001 Tim Janik <timj@gtk.org> * glib-object.h: add gvaluearray.h. * gstring.[hc]: fixup naming of g_string_sprint*. * gtypes.h: fixed GCompareDataFunc naming. Wed Mar 7 09:33:27 2001 Tim Janik <timj@gtk.org> * gobject/Makefile.am: shuffled rules to avoid excessive rebuilds. * gobject/gobject-sections.txt: updates. * gobject/tmpl/*: bunch of updates, added another patch from Eric Lemings <eric.b.lemings@lmco.com>.
2001-03-07 15:46:45 +01:00
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
g_free (barray);
changed prototype of g_boxed_type_register_static() to contain an optional Wed Mar 7 09:36:33 2001 Tim Janik <timj@gtk.org> * gboxed.[hc]: changed prototype of g_boxed_type_register_static() to contain an optional init function and a hint at whether the boxed structure uses ref counting internally. added g_value_set_boxed_take_ownership(). made G_TYPE_BOXED an abstract value type. * genums.[hc]: made G_TYPE_ENUM and G_TYPE_FLAGS abstract value types. * glib-genmarshal.c: argument type changes, preparation for third-party arg specification. * gobject.[hc]: cleaned up get/set property code. added g_strdup_value_contents() to improve warnings. * gparam.[hc]: added g_param_value_convert(), taking over responsibility of the old g_value_convert(). added G_PARAM_LAX_VALIDATION flag so validation alterations may be valid a part of the property setting process. * gparamspecs.[hc]: made value comparisons stable (for sort applications). added GParamSpecValueArray, a param spec for value arrays and GParamSpecClosure. nuked the value exchange functions and GParamSpecCCallback. * gtype.[hc]: catch unintialized usages of the type system with g_return_val_if_uninitialized(). introduced G_TYPE_FLAG_VALUE_ABSTRACT to flag types that introduce a value table, but can't be used for g_value_init(). cleaned up reserved type ids. * gvalue.[hc]: code cleanups and saner checking. nuked the value exchange API. implemented value transformations, we can't really "convert" values, rather transforms are an anylogy to C casts, real conversions need a param spec for validation, which is why g_param_value_convert() does real conversions now. * gvaluearray.[hc]: new files that implement a GValueArray, a struct that can hold inhomogeneous arrays of value (to that extend that it also allowes undefined values, i.e. G_VALUE_TYPE(value)==0). this is exposed to the type system as a boxed type. * gvaluetransform.c: new file implementing most of the former value exchange functions as single-sided transformations. * gvaluetypes.[hc]: nuked G_TYPE_CCALLBACK, added g_value_set_string_take_ownership(). * *.h: s/G_IS_VALUE_/G_VALUE_HOLDS_/. * *.[hc]: many fixes and cleanups. * many warning improvements. Tue Feb 27 18:35:15 2001 Tim Janik <timj@gtk.org> * gobject.c (g_object_get_valist): urg, pass G_VALUE_NOCOPY_CONTENTS into G_VALUE_LCOPY(), this needs proper documenting. * gparam.c: fixed G_PARAM_USER_MASK. * gtype.c (type_data_make_W): (type_data_last_unref_Wm): fixed invalid memory freeing. * gobject.c (g_object_last_unref): destroy signal handlers associated with object, right before finalization. * gsignal.c (g_signal_parse_name): catch destroyed nodes or signals that don't actually support details. * gobject.[hc]: got rid of property trailers. nuked GObject properties "data" and the "signal" variants. (g_object_connect): new convenience function to do multiple signal connections at once. (g_object_disconnect): likewise, for disconnections. * gparam.[hc] (g_param_spec_pool_lookup): took out trailer support. * gvalue.[hc]: marked g_value_fits_pointer() and g_value_peek_pointer() as private (the latter got renamed from g_value_get_as_pointer()). Wed Mar 7 09:32:06 2001 Tim Janik <timj@gtk.org> * glib-object.h: add gvaluearray.h. * gstring.[hc]: fixup naming of g_string_sprint*. * gtypes.h: fixed GCompareDataFunc naming. Wed Mar 7 09:33:27 2001 Tim Janik <timj@gtk.org> * gobject/Makefile.am: shuffled rules to avoid excessive rebuilds. * gobject/gobject-sections.txt: updates. * gobject/tmpl/*: bunch of updates, added another patch from Eric Lemings <eric.b.lemings@lmco.com>.
2001-03-07 15:46:45 +01:00
}
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
G_END_DECLS /* c++ guards */
added newly added gobject/ headers. Tue Oct 24 22:09:14 2000 Tim Janik <timj@gtk.org> * glib-object.h: added newly added gobject/ headers. * gmesage.c: print g_message() output to stderr instead of stdout. Wed Oct 25 20:27:02 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_free_instance): for the moment, freeing object structures will fill their memory portion with 0xAA. there's a FIXME there, remove this line at a later point. Tue Oct 24 23:10:26 2000 Tim Janik <timj@gtk.org> * glib-genmarshal.1: * glib-genmarshal.c: added publically installed marshaller generator. * gtype.h: added G_TYPE_INSTANCE_GET_INTERFACE() to retrive a certain interface VTable from instances. Mon Oct 23 08:28:15 2000 Tim Janik <timj@gtk.org> * gobject.[hc]: new functions for closure maintenance: (g_object_watch_closure): maintain validity of the object and the closure for objects that are used as data part of a closure. (g_cclosure_new_object): convenience function to create C closures that have an object as data argument. (g_closure_new_object): convenience function to create closures that have an object as data argument. * gclosure.[hc]: implementation of GClosure mechanism. a closure is basically an encapsulation of a callback function and its environment. ideally, most places supporting callback functions will simply take a GClosure* pointer and thus unify callback environments wrg destroy notification etc. GClosure provides destroy notifiers for arbitrary data pointers, reference counting, invalidation notification (it can be invalidated which is merely a deactivate state) and a marshallinbg abstraction. GCClosure is also provided in these files, they present a specialized GClosure implementation for C language callbacks. * genum.c: macro cleanups. * gboxed.[hc]: new files, for boxed type abstraction. (g_boxed_copy): copy a boxed structure (g_boxed_free): free a boxed structure (g_value_set_boxed): (g_value_get_boxed): standard GValue functions for boxed types (g_boxed_type_register_static): convenience function for easy introduction of new G_TYPE_BOXED derivatives. * gparam.[hc]: introduced g_param_type_register_static(), a short hand for creation of new GParamSpec derived types. * gtype.[hc]: many fixes, introduced ability to flag individual type nodes as ABSTRACT upon registration, added value_peek_pointer() to the value table to peek at GValue contents as a pointer for types that support this. fixed up GValue checks. * gvalue.[hc]: added g_value_fits_pointer() and g_value_get_as_pointer() to peek at the value contents as pointer. * *.[hc]: adaptions to type macro fixes and changes in the type registration API. * many const corrections over the place. Sat Oct 21 02:49:56 2000 Tim Janik <timj@gtk.org> * gtype.c (g_type_conforms_to): this function basically behaves like and is_a check, except that it _additionally_ features interfaces for instantiatable types. enforce this in the second branch as well (`type' conforms_to `type') even if `type' is not an interface type. Fri Oct 20 15:31:04 2000 Tim Janik <timj@gtk.org> * gvaluetypes.[hc]: added G_TYPE_POINTER implementation from jrb. * gtype.[hc]: * gobject.c: * gvaluetypes.c: added GTypeValueTable.value_peek_pointer and suitable implementations of this for G_TYPE_STRING, G_TYPE_OBJECT and G_TYPE_POINTER. Mon Aug 21 04:13:37 2000 Tim Janik <timj@gtk.org> * gbsearcharray.[hc]: long standing needed generic implementation of a binary searchable, sorted and dynamically sized array.
2000-10-25 22:36:35 +02:00
license change, no restrictions are made in the new license at all, the Tue Aug 19 03:55:29 2003 Tim Janik <timj@gtk.org> * glib/gbsearcharray.h: license change, no restrictions are made in the new license at all, the implmentation is simply provided "as is" to allow copy-pasting the code into any third-party app. naturally, the implementation is self-contained within the header file to allow this. default to non-shrinking behaviour, allow users to request shrinking via G_BSEARCH_ARRAY_AUTO_SHRINK. creation, deletion functions are now named g_bsearch_array_create() and g_bsearch_array_free(). fixed const in prototypes, removed cruft. (g_bsearch_array_insert): take only three arguments, do nothing if the node to insert is already there. (g_bsearch_array_replace): insert or replace if the node is already there. (g_bsearch_array_remove): remove nodes by index, the index of a node can be found via g_bsearch_array_get_index(). removed other g_bsearch_array_remove*() variants. (g_bsearch_array_lookup): minor optimizations. (g_bsearch_array_lookup_sibling): return nodes on mismatches. * glib/gbsearcharray.c: removed.
2003-08-19 04:16:00 +02:00
#endif /* !__G_BSEARCH_ARRAY_H__ */
Reference in New Issue Copy Permalink