AxonC / hasky-dict

University project to use a functional programming language to implement a dictionary using a binary search tree.

Dictionary Implementation using BST

This project implements a dictionary-type data structure with a binary search tree as its underlying implementation.

Project Structure

The project was generated using the Haskell language 'stack' tool.

• src/ contains all of the source code for the project.
• test/ contains all the test code ofr the project. This assumes the src directory is in the same project.
• package.yaml contains all dependencies as per a standard 'stack' project

Packages Used

• Tasty - automated test suite package
• HUnit - test case package
• QuickCheck - property-based testing framework for unit tests
• tasty-hunit - compatibility wrapper for tasty and HUnit
• tasty-quickcheck - compatibility wrapper for tasty and QuickCheck