Skip to content
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: klaudiosinani/shtack
Failed to load repositories. Confirm that selected base ref is valid, then try again.
Loading
base: v1.0.0
Choose a base ref
...
head repository: klaudiosinani/shtack
Failed to load repositories. Confirm that selected head ref is valid, then try again.
Loading
compare: master
Choose a head ref
  • 6 commits
  • 2 files changed
  • 1 contributor

Commits on Jul 9, 2019

  1. Copy the full SHA
    8b0f9cf View commit details
  2. Copy the full SHA
    291c4e2 View commit details

Commits on Jul 11, 2019

  1. Copy the full SHA
    b672a79 View commit details

Commits on Aug 20, 2019

  1. Copy the full SHA
    e0665eb View commit details

Commits on Aug 21, 2019

  1. Copy the full SHA
    380a406 View commit details
  2. Copy the full SHA
    c1a370f View commit details
Showing with 6 additions and 4 deletions.
  1. +3 −3 package.json
  2. +3 −1 readme.md
6 changes: 3 additions & 3 deletions package.json
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
{
"name": "shtack",
"version": "1.0.0",
"description": "Stacks for ES6",
"description": "LIFO Stacks for ES6",
"license": "MIT",
"repository": "klaussinani/shtack",
"author": {
@@ -33,10 +33,10 @@
"coveralls": "nyc report --reporter=text-lcov | coveralls"
},
"devDependencies": {
"ava": "2.1.0",
"ava": "2.3.0",
"coveralls": "^3.0.3",
"nyc": "^13.3.0",
"typescript": "^3.3.4000",
"typescript": "^3.5.3",
"xo": "^0.24.0"
},
"xo": {
4 changes: 3 additions & 1 deletion readme.md
Original file line number Diff line number Diff line change
@@ -3,7 +3,7 @@
</h1>

<h4 align="center">
Stacks for ES6
LIFO Stacks for ES6
</h4>

<p align="center">
@@ -550,8 +550,10 @@ For more info on how to contribute to the project, please read the [contributing
## Related

- [avlbinstree](https://github.com/klaussinani/avlbinstree) - AVL self-balancing binary search trees for ES6
- [binoheap](https://github.com/klaussinani/binoheap) - Binomial heaps for ES6
- [binstree](https://github.com/klaussinani/binstree) - Binary search trees for ES6
- [doublie](https://github.com/klaussinani/doublie) - Doubly circular & linear linked lists for ES6
- [kiu](https://github.com/klaussinani/kiu) - FIFO Queues for ES6
- [mheap](https://github.com/klaussinani/mheap) - Binary min & max heaps for ES6
- [prioqueue](https://github.com/klaussinani/prioqueue) - Priority queues for ES6
- [singlie](https://github.com/klaussinani/singlie) - Singly circular & linear linked lists for ES6