-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Op 16-12-10 09:22, Frederik Ramm schreef: > If someone feels like (a) re-implementing this in C
I think Mitja did this in the GSoC program this summer (the cutout thing). It would be valuable to figure out a way to do 'proper' full ways and relations in a low memory setting, but probably I/O itself is always an issue too. I can imagine that you create a cutout of the nodes first, quicksort it in a mmap-file and then run it over the ways table. Storing a mmap file with only the way ids,quicksort on it and walk over the relations part. Now a second run would grab the missing ways, and the remaining nodes. I wonder if it can be done more efficiently. Stefan -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.16 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEAREKAAYFAk0J2EYACgkQYH1+F2Rqwn2GZACdGY9IsHcY0lNBhymukjztL62P 9xoAoII1oyPOfGd1bjpaGTBPu8oihJIt =80mv -----END PGP SIGNATURE----- _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/dev
