This is an implementation of an associative array written by C. it is similar as C++ but it is implemented by C; thus, this repo calls it cmap (C++ ).
Implementation
The goal of this repo is providing a binary search tree for the programmers using C language to work on thier projects. But, here is only a simple implementation of Red-Black Tree, which is known as a self-balancing binary search tree, and hopes it can be a helpful data structure for the projects written by C language.
cmap is an implementation with OOP style; when using cmap, you must manipulate it as an 'object' in any OOP language.
Usage
Before using cmap, you have to define the three functions with the specific types by yourself.
// A comparator for keys of Red-Black Tree.intcmp(constvoid *key1, constvoid *key2) {
/* return -1, 0, 1. */;
/* You may understant this quickly if you had used qsort in your C projects. */
}
// A function for getting the memory size of key.size_tkey_size_get(constvoid *key) {
/* returning the size of key. */
}
// A function for getting the memory size of value.size_tval_size_get(constvoid *val) {
/* returning the size of value */
}
A C++ implemented set of 8,16,32,64 bit cyclic redundancy check (CRC) functions conforming to the CRC spec given by AUTOSAR. Written in C++ and compiled as a 'C++ addon' for use in JavaScript. Available on NPM.
ToPS is an objected-oriented framework implemented using C++ that facilitates the integration of probabilistic models for sequences over a user defined alphabet
DigiMahal is the First Project of Our Team in Sharif University of Technology for Basics of Programming That in this Code we Implemented an Online Shop like DigiKala.