bionic

Go to file

Greg Hackmann 4482d85139 bionic: reimplement property area as hybrid trie/binary tree

See the comments for an explanation of how properties are stored.

The trie structure is designed to scale better than the previous
array-based implementation.  Searching an array with n properties
required average O(n) string compares of the entire key; searching the
trie requires average O(log n) string compares of each token (substrings
between '.' characters).

Change-Id: Ic28b3c5246004a3c502eb02d6e1c9b512884d872
Signed-off-by: Greg Hackmann <ghackmann@google.com>

2013-06-25 13:34:24 -07:00

libc

bionic: reimplement property area as hybrid trie/binary tree

2013-06-25 13:34:24 -07:00

libdl

Drop unnecessary execution permission for .cpp/.c/.h

2013-03-22 10:28:15 +08:00

libm

Take upstream libm changes.

2013-06-12 16:37:58 -07:00

libstdc++

Clean up internal libc logging.