Add some notes on complexity in glib/gqueue.c

Related to issue #3
This commit is contained in:
Emmanuel Fleury 2019-08-06 19:12:51 +02:00
parent 69e5e12c95
commit a62fcb9af1

View File

@ -29,7 +29,8 @@
* *
* The #GQueue structure and its associated functions provide a standard * The #GQueue structure and its associated functions provide a standard
* queue data structure. Internally, GQueue uses the same data structure * queue data structure. Internally, GQueue uses the same data structure
* as #GList to store elements. * as #GList to store elements with the same complexity over
* insertion/deletion (O(1)) and access/search (O(n)) operations.
* *
* The data contained in each element can be either integer values, by * The data contained in each element can be either integer values, by
* using one of the [Type Conversion Macros][glib-Type-Conversion-Macros], * using one of the [Type Conversion Macros][glib-Type-Conversion-Macros],