]> git.ipfire.org Git - thirdparty/strongswan.git/commit
projects / thirdparty / strongswan.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: b3613c4) | patch
settings: Implement subsections and key/value pairs with sorted arrays
authorTobias Brunner <tobias@strongswan.org>
Mon, 10 Feb 2014 14:34:29 +0000 (15:34 +0100)
committerTobias Brunner <tobias@strongswan.org>
Wed, 12 Feb 2014 13:34:33 +0000 (14:34 +0100)
commitf4da1989cd595785a4c3e2f6effcfbb28a103377
tree4146d8ce1413d978021874f043e17282f548d0d2tree
parentb3613c49a22e1156836891f3c76765044e01d684commit | diff
settings: Implement subsections and key/value pairs with sorted arrays

Is a bit more memory efficient (also due to lazy instantiation) and
lookups for sections with lots of subsections/keys (e.g. charon.plugins) are
faster.
src/libstrongswan/utils/settings.c diff | blob | blame | history
Unnamed repository; edit this file 'description' to name the repository.