module
Version:
v0.0.0-...-4ff26d5
Opens a new window with list of versions in this module.
Published: May 4, 2014
License: BSD-3-Clause
Opens a new window with license information.
README
¶
#coconut
Coconut is a foundation library fully written in Go which includes frequent used data structures and algorithms.
##Aims of this project
- Avoid to reinvent frequent used data structures and algorithms every time in different projects
- Avoid to import from different places for different data structure and algorithms
- Trying to be a good candidate as the foundation library
##Status of coconut
Before I release coconut v0.1, donot use this library in your project, 'cause:
- I haven't add enough data structure and algorithms in
- Probably I will modify the API frequently
- Probably I will regroup the packages like merging different individual small packages into a more meaningful one
- Should have many bugs and places can be optimized
##Planned data strucutre and algorithms
_* means already done, but probably I will still refactor it. _
-
Cache
-
Scheduling
-
Bloom Filter
- Standard Bloom Filter
- Counting Bloom Filter
- Scalable Bloom Filter
-
Tree
- B(+/*) Tree
- AVL
- Red Black Tree
- Trie
- R-trees
-
Binary Search
-
Hash
-
Set
-
Bitmap
-
SkipList
-
FSM
-
Utils
-
To be added
##Docs
Currently I haven't finished any docs even valuable comments inside the codes, I will find time to finish this.
Directories
¶
Package bitmap provides a sparsed bitmap implementation.
|
Package bitmap provides a sparsed bitmap implementation. |
Package cache provides interfaces for cache functions
|
Package cache provides interfaces for cache functions |
lfu
This package implements a O(1) LFU Followed the origin paper http://dhruvbird.com/lfu.pdf
|
This package implements a O(1) LFU Followed the origin paper http://dhruvbird.com/lfu.pdf |
lru
Package lru provides one implementation of the LRU cache
|
Package lru provides one implementation of the LRU cache |
scheduling
|
|
|
|
|
|
Click to show internal directories.
Click to hide internal directories.