luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2025-01-27 14:36:16 +01:00
Code Issues Packages Projects Releases Wiki Activity

Add some notes on complexity in glib/gslist.c

Browse Source 
Related to issue #3
This commit is contained in:
Emmanuel Fleury 2019-08-06 19:09:18 +02:00
parent 4d9cd832d1
commit 69e5e12c95
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
glib/gslist.c
View File

@ -39,7 +39,12 @@
* @short_description: linked lists that can be iterated in one direction * @short_description: linked lists that can be iterated in one direction
* *
* The #GSList structure and its associated functions provide a * The #GSList structure and its associated functions provide a
* standard singly-linked list data structure. * standard singly-linked list data structure. The benefit of this
* data-structure is to provide insertion/deletion operations in O(1)
* complexity where access/search operations are in O(n). The benefit
* of #GSList over #GList (doubly linked list) is that they are lighter
* in space as they only need to retain one pointer but it double the
* cost of the worst case access/search operations.
* *
* Each element in the list contains a piece of data, together with a * Each element in the list contains a piece of data, together with a
* pointer which links to the next element in the list. Using this * pointer which links to the next element in the list. Using this