4 commits

Author	SHA1	Message	Date
Eelco Dolstra	0b305c534f	* Store attribute sets as a vector instead of a map (i.e. a red-black ... tree). This saves a lot of memory. The vector should be sorted so that names can be looked up using binary search, but this is not the case yet. (Surprisingly, looking up attributes using linear search doesn't have a big impact on performance.) Memory consumption for $ nix-instantiate /etc/nixos/nixos/tests -A bittorrent.test --readonly-mode on x86_64-linux with GC enabled is now 185 MiB (compared to 946 MiB on the trunk).	2010-10-24 00:41:29 +00:00
Eelco Dolstra	95f4f2cf61	* If std::tr1::unordered_set is unavailable, use std::set.	2010-10-04 16:16:19 +00:00
Eelco Dolstra	816f9c0f6f	* Use std::tr1::unordered_set instead of std::set for the symbol ... table. This gives a 10% speed increase on `nix-instantiate /etc/nixos/nixos -A system --readonly-mode'.	2010-04-13 14:34:11 +00:00
Eelco Dolstra	ac1e8f40d4	* Use a symbol table to represent identifiers and attribute names ... efficiently. The symbol table ensures that there is only one copy of each symbol, thus allowing symbols to be compared efficiently using a pointer equality test.	2010-04-13 12:25:42 +00:00