Calculate the longest common prefix of all keys in a tree and write
out an array of the key names relative to that prefix and,
optionally, the value to store at each of those keys.
You must free the value returned in path, keys and values using
g_free(). You should not attempt to free or unref the contents of
keys or values.
Calculate the longest common prefix of all keys in a tree and write out an array of the key names relative to that prefix and, optionally, the value to store at each of those keys.
You must free the value returned in path, keys and values using g_free(). You should not attempt to free or unref the contents of keys or values.