commit | 6a23043927deb7a409d4d03a34a0aefd749c5eb1 | [log] [tgz] |
---|---|---|
author | Emir Pasic <emirpasic@hotmail.com> | Thu Mar 05 20:21:55 2015 |
committer | Emir Pasic <emirpasic@hotmail.com> | Thu Mar 05 20:21:55 2015 |
tree | add0e8c9fb76b5e8191936c3a17711086af0c07b | |
parent | 09f75253fec0de23cf8f5b556ea5296533e3fde7 [diff] |
readme update
Implementation of various data structures in Go.
Collections and data structures found in other languages: Java Collections, C++ Standard Template Library (STL) containers, Qt Containers, etc.
Fast algorithms:
Memory efficient algorithms:
Easy to use library:
Stable library:
Solid documentation and examples:
Production ready:
There is often a tug of war between speed and memory when crafting algorithms. We choose to optimize for speed in most cases within reasonable limits on memory consumption.
Thread safety is not a concern of this project, this should be handled at a higher level.
go test -v -bench . -benchmem -benchtime 1s ./...
Copyright (c) Emir Pasic, All rights reserved.
GNU Lesser General Public License Version 3, see LICENSE for more details.