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
..
2010-12-06 12:05:11 +01:00
2011-09-28 12:17:34 -07:00
2013-01-11 16:44:15 -08:00
2013-06-18 13:07:18 -07:00
2010-01-15 15:57:02 -08:00
2012-09-13 16:54:57 -07:00
2009-03-03 19:28:35 -08:00
2009-03-03 19:28:35 -08:00
2010-01-15 15:01:44 -08:00
2013-06-05 18:05:36 -07:00
2010-06-11 14:39:39 -07:00
2012-09-04 14:11:28 +02:00