An open API service indexing awesome lists of open source software.

https://github.com/dujeonglee/basiclibrary

Basic data structure libraries for C++. It is simple to use but still powerful.
https://github.com/dujeonglee/basiclibrary

avl-tree avltree binary-search-tree binary-tree binary-trees c-plus-plus data-structures header-only headeronly linked-data linkedlist thread-pool threading threadpool tree-structure

Last synced: 9 days ago
JSON representation

Basic data structure libraries for C++. It is simple to use but still powerful.

Awesome Lists containing this project

README

          

# basic data structures and libraries
Implementation of basic data structures and libraries for own study.

## Header only data structures
- AVL Tree: Insert, find, remove functions are provided.
```
AVLTree map;
map[1] = std::string("Jake");
map[2] = std::string("Tim");
std::cout<

int main()
{
std::cout<<"--------------------------------------------------------------------"< timer;// Timer is automatically started when instanciation.
timer.Stop();/*If one does not call "Stop", Dtor will call "Stop".*/
}
std::cout<<"--------------------------------------------------------------------"< timer;
timer.ScheduleTaskNoExcept(1000, []()->void{
std::cout<<"Do something"< timer;
uint32_t task1 = timer.ScheduleTaskNoExcept(1000, []()->void{
std::cout<<"This task will not be served."<void{
std::cout<<"Only this task is served."< timer;
uint32_t data = 0;
std::cout<<"Periodic task ends when counting 49.";
timer.PeriodicTask(10, [&data]()->bool{
std::cout<<"Count down "<

int main(int argc, char *argv[])
{
std::cout<<"--------------------------------------------------------------------"< threadpool;
for(unsigned int i = 0 ; i < 10 ; i++)
{
threadpool.Enqueue([i](){
std::cout<<"Task "< threadpool;
for(unsigned int i = 0 ; i < 10 ; i++)
{
threadpool.Enqueue([i](){
std::cout<<"Task "< threadpool;
for(unsigned int i = 0 ; i < 10 ; i++)
{
threadpool.Enqueue([i](){
std::cout<<"Task "<