Greg Hackmann 6ac8e6a46d 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: I491305bc7aca59609abcd871a5f33d97f89ce714 Signed-off-by: Greg Hackmann <ghackmann@google.com>		2013-06-24 13:14:09 -07:00
libc	bionic: reimplement property area as hybrid trie/binary tree	2013-06-24 13:14:09 -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.	2013-03-15 16:12:58 -07:00
libthread_db	Fix the pthread_setname_np test.	2013-02-15 12:08:59 -08:00
linker	am 53ddcc90: Merge "linker: Emit a warning on text relocations"	2013-06-21 15:39:21 -07:00
tests	am 5fed0eea: am 0ce28d20: Merge "libc: enable FORTIFY_SOURCE clang strlcpy"	2013-06-20 12:34:11 -07:00
.gitignore	Merge memory checking functionality from sandbox	2010-02-16 11:43:18 -08:00
ABI-bugs.txt	Regenerate NOTICE files.	2013-03-07 11:51:10 -08:00
Android.mk	Remove the simulator target from all makefiles.	2011-07-11 22:11:41 -07:00
CleanSpec.mk	Add an empty CleanSpec.mk	2010-03-08 18:04:02 -08:00