Categories: None [Edit]
splaytreemap
A Splay Tree is a self adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This makes it useful for caches because the most commonly accessed elements will be the fastest ones to access. This tree has an additional feature that allows it's maximum size to be restricted. When it exceeds it's maximum size, it will drop all of the nodes which are at the terminal ends of the tree structure, leaving many of the more commonly accessed nodes intact. This implementation is written in C++ with a Ruby wrapper.
Total
Ranking: 160,175 of 180,469
Downloads: 2,506
Daily
Ranking: 37,537 of 180,459
Downloads: 1
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
Rank | Downloads | Name |
---|
Depends on
Rank | Downloads | Name |
---|---|---|
1 | 2,076,932,340 | bundler |
16 | 854,040,010 | rake |
20 | 801,054,890 | minitest |
1,696 | 11,824,858 | rake-compiler |
Owners
# | Gravatar | Handle |
---|---|---|
1 | wyhaines |