33-3-4

Author	SHA1	Message	Date
Jirka Sejkora	287f799b69	Optimize combines by storing the closest house in a direction. This is a huge speedup. It's equivalent to using prefix sums. Needs a lot of memory.	3 years ago
Jirka Sejkora	f207d61455	Optimize combines by using a lookup table for layout pairs This is significantly faster than having to go through lower bound hash tables all the time (20% of time was spent in there).	3 years ago
Jirka Sejkora	58c35762a2	Add subcity optimization	3 years ago
Jirka Sejkora	083d6a97b9	Add in-memory only databases	3 years ago
Jirka Sejkora	f694e4701a	Allow Cities of any sizes This will be useful for optimizing parts of the map independently.	3 years ago
Jirka Sejkora	b629369169	Remove spammy prints	3 years ago
Jirka Sejkora	affb99472c	Cache lowest bounds for combining pairs	3 years ago
Jirka Sejkora	3facf2f297	Cache by last updates of left and right side instead of just coord	3 years ago
Jirka Sejkora	dacb278ef3	Add a cache; only try combining while merges lower price	3 years ago
Jirka Sejkora	148f59010e	Stop combining if finished, update layouts between x and y	3 years ago
Jirka Sejkora	2b08da0809	Combining forever; adding to DB	3 years ago
Jirka Sejkora	63ed9e7fe0	Horizontal cuts (through transpose)	3 years ago
Jirka Sejkora	dfedf7b3ae	Start combining from best pairs, stop at cheapest valid	3 years ago
Jirka Sejkora	751e0d81ff	Vertical combines	3 years ago
Jirka Sejkora	5b10766ab9	Combination early implementation (vertical line)	3 years ago