commit bd1749a730922694ff95fec04ed68fbedd63623b
author scottb@google.com <scottb@google.com@8db76d5a-ed1c-0410-87a9-c151d255dfc7> Wed Apr 01 19:12:02 2009 +0000
committer scottb@google.com <scottb@google.com@8db76d5a-ed1c-0410-87a9-c151d255dfc7> Wed Apr 01 19:12:02 2009 +0000
tree b50eb6cf2893a3688c46651b6bccf20896162fdf
parent 15b9f4f5a648cc267df7f2ac6a2088ca4d48ebd6

Created a set of memory-friendly collections specifically for use in the compiler.

The goal is to provide API compatibility with the JRE versions, yet use a lot less memory.  I particularly am focusing on optimizing the case of empty and singleton collections, which is an extremely common case in the compiler, and an easy win for memory.  Having lots of nodes refer to the single-instance empty set or list takes almost no memory, a default empty ArrayList or HashSet is very expensive by comparison.

Review by: spoon

git-svn-id: https://google-web-toolkit.googlecode.com/svn/trunk@5149 8db76d5a-ed1c-0410-87a9-c151d255dfc7