Kawe Mazidjatari 43fdbc94da CPackedStore::PackAll optimizations
* Hash chunk before compression to determine if it already exists or not (don't run compression if it does).
* Use the result of vector::insert for data sharing (insert already checks if it exists or not, and returns the iterator).
* This optimization saves around 20 seconds total when rebuilding all VPK's.
2022-10-02 02:16:51 +02:00
..
2022-07-08 00:55:01 +02:00
2022-08-09 03:02:00 +02:00
2022-09-25 13:36:55 +02:00
2022-09-14 01:14:51 +02:00
2022-09-25 20:20:25 +02:00
2022-08-09 15:19:12 +02:00
2022-09-09 19:47:31 +02:00
2022-09-22 21:20:14 +02:00
2022-09-25 12:15:49 +02:00
2022-10-01 00:27:51 +02:00
2022-09-14 01:14:51 +02:00
2022-08-09 15:19:12 +02:00
2022-09-25 13:36:55 +02:00
2022-09-14 01:14:51 +02:00
2022-08-14 15:19:03 +02:00
2022-02-22 15:19:32 +01:00
2022-04-16 00:30:46 +02:00
2021-04-13 04:45:22 -07:00
2022-02-22 15:20:08 +01:00