Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/recp/ds
🔗 Common Data Structures and Algorithms
https://github.com/recp/ds
algorithm algorithms algorithms-datastructures balanced-search-trees binary-search-tree data-structure forward-list hash hash-table libds list octree rbtree red-black-tree search-trees tree
Last synced: 2 months ago
JSON representation
🔗 Common Data Structures and Algorithms
- Host: GitHub
- URL: https://github.com/recp/ds
- Owner: recp
- License: mit
- Created: 2017-06-24T07:40:28.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2023-09-14T19:11:57.000Z (over 1 year ago)
- Last Synced: 2024-10-15T10:49:16.455Z (3 months ago)
- Topics: algorithm, algorithms, algorithms-datastructures, balanced-search-trees, binary-search-tree, data-structure, forward-list, hash, hash-table, libds, list, octree, rbtree, red-black-tree, search-trees, tree
- Language: C
- Homepage:
- Size: 102 KB
- Stars: 50
- Watchers: 7
- Forks: 5
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# 🔗 Data Structures and Algorithms
[](https://travis-ci.org/recp/ds)
[](https://ci.appveyor.com/project/recp/libds/branch/master)
[](https://coveralls.io/github/recp/libds?branch=master)
[](https://www.codacy.com/app/recp/libds?utm_source=github.com&utm_medium=referral&utm_content=recp/libds&utm_campaign=Badge_Grade)
This library provides common data structures. It will also provide some data structures which needed in render or game engines. In the future I'll try to optimize memmory access.
There may multiple way to implement a data structure but I tried to implement best way to do that. For instance Red-Black Trees are only implemented as top down insertion/deletion to make it faster.
There are some convenient constructors for common use cases. For instance `rb_newtree_str()` creates new rb-tree that uses strings as key, `rb_newtree_ptr()` creates new rb-tree that uses pointers as key. When you use these functions to alloc a data structure then you don't need to provide compare or print functions.
This library prodives allocator api so you can override default allocator.
## Usage
```C
#include // Red-Black Tree
int
main(int argc, const char * argv[]) {
RBTree *tree;
/* ... */
/* use string keys */
tree = rb_newtree_str();
rb_insert(tree, "key", value);
/* ... */
value = rb_find(tree, "key");
rb_destroy(tree);
}
```
## Todo
- [x] rbtree
- [x] top-down insertion
- [x] top-down deletion
- [x] forward-list
- [x] forward-list-separate (reduces FList struct)
- [x] hash-table
- [x] builtin hash functions e.g. djb2
- [x] resizing hash table
- [x] quick sort implementation for float, double, i32, u32, i64, u64
- [ ] queue (working on this)
- [ ] stack
- [ ] binary heap / priority queue
- [ ] dynamic array
- [ ] octree
- [ ] quadtree
- [ ] kd-tree
- [ ] bvh
- [ ] b-tree
## Build
### Unix (Autotools)
```bash
$ sh autogen.sh
$ ./configure
$ make
$ make check # [Optional]
$ [sudo] make install # [Optional]
```
### Windows (MSBuild)
Windows related build, project files are located in `win` folder,
make sure that you are inside in the `libds/win` folder.
Code Analysis are enabled, it may take awhile to finish build
```Powershell
$ cd win
$ .\build.bat
```
if `msbuild` didn't work then you can try to build it with `devenv`:
```Powershell
$ devenv libds.sln /Build Release
```
## License
MIT. check the LICENSE file