Optimize mate_panel_applet_settings_get_g*list()

- Build the list in reverse order, then reverse the result.  This is
  useful because GS?List are list nodes, not containers of nodes, and
  thus don't contain a pointer to the list's end, meaning to append one
  has to walk the entire list to find the end each time.  To avoid this
  we use the common idiom of prepending to the list (which is cheap, as
  it's adding a node before the given one), and then reversing the
  resulting list to get back the original order.
- Avoid unnecessary memory copy by stealing the GStrv's members.  We
  get the array as a copy, so we can simply steal the members and free
  the container array only, saving a copy for each member.

0 files changed, 0 insertions, 0 deletions