git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.

Age	Commit message (Collapse)	Author
2020-06-09	BLI: generally improve C++ data structures	Jacques Lucke
	The main focus here was to improve the docs significantly. Furthermore, I reimplemented `Set`, `Map` and `VectorSet`. They are now (usually) faster, simpler and more customizable. I also rewrote `Stack` to make it more efficient by avoiding unnecessary copies. Thanks to everyone who helped with constructive feedback. Approved by brecht and sybren. Differential Revision: https://developer.blender.org/D7931
2020-04-28	BLI: add Map.lookup_or_add_default method	Jacques Lucke

2020-04-28	BLI: add Map.is_empty() method	Jacques Lucke

2020-04-21	BLI: Use .hh extension for C++ headers in blenlib	Jacques Lucke

2020-03-19	Cleanup: `make format` after SortedIncludes change	Dalai Felinto

2019-10-20	Cleanup: missing declaration warnings	Campbell Barton

2019-09-14	BLI: make Map.add_or_modify more powerful	Jacques Lucke
	The function now allows custom return types defined by the callbacks. This can be useful when a user of the data structure has to implement some custom behavior.
2019-09-14	BLI: Improve forwarding semantics of some data structures	Jacques Lucke
	This makes it possible to use e.g. `std::unique_ptr` in a map.
2019-09-13	BLI: add some missing methods to Map and SetVector	Jacques Lucke

2019-09-13	BLI: new C++ hash table data structures	Jacques Lucke
	This commit adds some new hashing based data structures to blenlib. All of them use open addressing with probing currently. Furthermore, they support small object optimization, but it is not customizable yet. I'll add support for this when necessary. The following main data structures are included: Set A collection of values, where every value must exist at most once. This is similar to a Python `set`. SetVector A combination of a Set and a Vector. It supports fast search for elements and maintains insertion order when there are no deletes. All elements are stored in a continuous array. So they can be iterated over using a normal `ArrayRef`. Map A set of key-value-pairs, where every key must exist at most once. This is similar to a Python `dict`. StringMap A special map for the case when the keys are strings. This case is fairly common and allows for some optimizations. Most importantly, many unnecessary allocations can be avoided by storing strings in a single buffer. Furthermore, the interface of this class uses `StringRef` to avoid unnecessary conversions. This commit is a continuation of rB369d5e8ad2bb7.