- Team Project #2 in 2018 Open Source Software Project Course, Chung-Ang Univ.
- Implementation of integer set data structure in several ways.
- by using Array structure.
- by using Bins structure.
- by using BitVector structure.
- by using Binary Search Tree structure.
- by using Linked-list structure.
- Measure time complexity & space complexity of implemented sets.
| Role | Name | Assigned Part | Github ID |
|---|---|---|---|
| Leader | 신형철 | Simple List, Analysis & Writing Report | nErumin |
| Member | 김정민 | Array, Bins | minn951120 |
| Member | 임기찬 | Bit Vector, Binary Search Tree | dispe1 |
- Fork this repository first.
- Clone the copied repository to local.
- Work on the local.
- Push the work to the copied repository.
- Make a pull request to upstream.
- Must be confirmed that there is no failing tests.
- Create a new implemented set.
- Extend the 'IntSet' class.
- It provides all needed interfaces and utilities.
- Implement abstract methods in the new implemented set.
- Create a new test class for the new implemented set.
- Write test cases for new implemented set.
- Make sure that the new implemented set passes all test cases.
- Create a new simulator for the new implemented set.
- Extend the 'IntSetSimulator' class.
- It provides all utilities for measuring complexity.
- Implement abstract methods in the new simulator.
- Create the new simulation in 'main' method to make it run.
- Java 9
- Gradle 4.7
- JUnit
- Testing Framework
- Travis CI
- Continuous, Automatic build & test tool
- Any pull requests cannot be accepted while the Travis checking isn't passed.
- To build the project, move to a root project folder in terminal.
- Enter the below command.
- Please make sure that the above working environment is ready.
gradle jar- If you just need to test all test cases, enter the below command.
gradle test- After the project is built, it can be executed by using the below command in terminal.
java -jar {PROJECT_FOLDER}/build/libs/DevSet9.jar