This is a implementation of multiple rectangle algorithms for a coding assignments
- Intersection
- Determine if two rectangles have one or more lines intersecting. if so returns the points of intersection
- Containment
- Determine if a rectangle fully contains another rectangle
- Adjacency
- Determine if two rectangles share a side either fully, partial or sub-line
This project acts a library and does not have anything to run. instead to check the library run npm test
This project was generated using typescript-starter and trimmed down
- yarn 2
- this project uses the newest version of yarn berry.. for this project i have disabled plug n play and not included the yarn cache folder. npm should work normally
- Typescript
- used to help catch logic errors
- ava
- small test runner for unit tests
- nyc
- istanbul code coverage runner for node