Greg Hackmann 996cdc4b1a 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).

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

(cherry picked from commit 6ac8e6a46d71a51bec16938efa89f275fa89cf7d)

Change-Id: Icbe31908572f33b4d9b85d5b62ac837cbd0f85e0
2013-06-24 16:35:32 -07:00
..
2013-06-12 14:14:53 -07:00
2011-12-06 08:39:18 -08:00
2013-02-25 13:14:31 -08:00
2013-06-12 14:14:53 -07:00
2013-02-15 12:08:59 -08:00
2009-03-03 19:28:35 -08:00
2012-11-19 11:46:33 -08:00
2013-03-15 16:12:58 -07:00
2011-07-07 22:46:16 +02:00
2012-12-10 11:20:57 -08:00
2013-02-25 13:14:31 -08:00
2012-10-16 17:58:17 -07:00
2012-10-16 17:58:17 -07:00
2013-03-15 16:12:58 -07:00
2010-10-15 02:16:16 +08:00