Skip to content

Latest commit

 

History

History
27 lines (22 loc) · 682 Bytes

README.md

File metadata and controls

27 lines (22 loc) · 682 Bytes

key-value-db

This project contains different implementations of hash maps
Currently developed:

  1. Using a Binary Search Tree as underlying data structure
  2. Using a Dynamic resizing array as underlying data structure

Dependencies:

This project depends on:

  1. googletest
  2. valgrind

How to build

  1. $./configure.sh This step will simply init the git submodule for googletest
  2. $make

Tests

To Run all unit tests, use:
$make test

To Run all tests using valgrind, use:
$make test-valgrind

Obs: All development and testing was made on Arch-Linux x86_64.