mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2025-01-15 08:46:18 +01:00
c5d2417d07
It is useful to provide a "reference counted allocation" API that can add reference counting semantics to any memory allocation. This allows turning data structures that usually are placed on the stack into memory that can be placed on the heap without: - adding a public reference count field - implementing copy/free semantics This mechanism is similar to Rust's Rc<Box<T>> combination of traits, and uses a Valgrind-friendly overallocation mechanism to store the reference count into a private data segment, like we do with GObject's private instance data. |
||
---|---|---|
.. | ||
xml | ||
building.xml | ||
changes.xml | ||
compiling.xml | ||
cross.xml | ||
file-name-encodings.png | ||
file-name-encodings.sxd | ||
glib-docs.xml | ||
glib-gettextize.xml | ||
glib-overrides.txt | ||
glib-sections.txt | ||
gtester-report.xml | ||
gtester.xml | ||
gvariant-text.xml | ||
gvariant-varargs.xml | ||
mainloop-states.eps | ||
mainloop-states.fig | ||
mainloop-states.gif | ||
mainloop-states.png | ||
Makefile.am | ||
meson.build | ||
programming.xml | ||
regex-syntax.xml | ||
resources.xml | ||
running.xml | ||
Sorted_binary_tree_breadth-first_traversal.svg | ||
Sorted_binary_tree_inorder.svg | ||
Sorted_binary_tree_postorder.svg | ||
Sorted_binary_tree_preorder.svg | ||
version.xml.in |