在线时间:8:00-16:00
迪恩网络APP
随时随地掌握行业动态
扫描二维码
关注迪恩网络微信公众号
开源软件名称:petar/GoLLRB开源软件地址:https://github.com/petar/GoLLRB开源编程语言:Go 100.0%开源软件介绍:GoLLRBGoLLRB is a Left-Leaning Red-Black (LLRB) implementation of 2-3 balanced binary search trees in Go Language. OverviewAs of this writing and to the best of the author's knowledge, Go still does not have a balanced binary search tree (BBST) data structure. These data structures are quite useful in a variety of cases. A BBST maintains elements in sorted order under dynamic updates (inserts and deletes) and can support various order-specific queries. Furthermore, in practice one often implements other common data structures like Priority Queues, using BBST's. 2-3 trees (a type of BBST's), as well as the runtime-similar 2-3-4 trees, are the de facto standard BBST algoritms found in implementations of Python, Java, and other libraries. The LLRB method of implementing 2-3 trees is a recent improvement over the traditional implementation. The LLRB approach was discovered relatively recently (in 2008) by Robert Sedgewick of Princeton University. GoLLRB is a Go implementation of LLRB 2-3 trees. MaturityGoLLRB has been used in some pretty heavy-weight machine learning tasks over many gigabytes of data. I consider it to be in stable, perhaps even production, shape. There are no known bugs. InstallationWith a healthy Go Language installed, simply run Example
AboutGoLLRB was written by Petar Maymounkov. Follow me on Twitter @maymounkov! |
2023-10-27
2022-08-15
2022-08-17
2022-09-23
2022-08-13
请发表评论