FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

merge: Fix spellings (#821) · chezandrei/JavaScript@072523d · GitHub

/ JavaScript Public
forked from TheAlgorithms/JavaScript

Commit 072523d

Browse files
authored
merge: Fix spellings (TheAlgorithms#821)
* chore: remove codespell from ci * feat: add codespell workflow * fix: codespell workflow * fix: ignore spellings in directory * chore: fix spellings ./Dynamic-Programming/KadaneAlgo.js:2: contiguos ==> contiguous ./Dynamic-Programming/KadaneAlgo.js:14: posible ==> possible * chore: fix spelling ./Dynamic-Programming/SieveOfEratosthenes.js:4: upto ==> up to * chore: fix spellings ./Dynamic-Programming/MaxNonAdjacentSum.js:22: Exmaple ==> Example * chore: fix spelling ./Project-Euler/test/Problem010.test.js:4: upto ==> up to ./Project-Euler/test/Problem010.test.js:8: upto ==> up to ./Project-Euler/test/Problem010.test.js:12: upto ==> up to * chore: fix spelling ./String/AlphaNumericPalindrome.js:10: recieves ==> receives ./String/AlphaNumericPalindrome.js:10: sting ==> string ./String/AlphaNumericPalindrome.js:46: varaible ==> variable * chore: fix spelling ./String/DiceCoefficient.js:3: stings ==> strings * chore: fix spelling ./String/test/DiceCoefficient.test.js:9: atleast ==> at least * chore: fix spelling ./String/test/MaxWord.test.js:8: ba ==> be * chore: ignore `PermutateString.test.js` * chore: fix spelling ./String/test/CheckVowels.test.js:62: occurances ==> occurrences * chore: ignore `SubsequenceRecursive.js` * chore: fix spelling ./Conversions/TemperatureConversion.js:2: arguement ==> argument * chore: fix spelling ./Conversions/RailwayTimeConversion.js:7: Formate ==> Format ./Conversions/RailwayTimeConversion.js:8: Formate ==> Format * chore: remove Linear Algebra The deleted directory hosted a package which are not accepted by this repository. * Auto-update DIRECTORY.md * chore: fix spelling * chore: fix spellings * merge: Created composite Simpson's integration method. Tests included. (TheAlgorithms#819) * Created composite Simpson's integration method.Tests included * Minor corrections * Auto-update DIRECTORY.md * Styled with standard.js * chore: remove blank line * chore: remove blank line Co-authored-by: ggkogkou <ggkogkou@ggkogkou.gr> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Rak Laptudirm <raklaptudirm@gmail.com> * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: remove codespell from ci * feat: add codespell workflow * fix: codespell workflow * fix: ignore spellings in directory * chore: fix spellings ./Dynamic-Programming/KadaneAlgo.js:2: contiguos ==> contiguous ./Dynamic-Programming/KadaneAlgo.js:14: posible ==> possible * chore: fix spelling ./Dynamic-Programming/SieveOfEratosthenes.js:4: upto ==> up to * chore: fix spellings ./Dynamic-Programming/MaxNonAdjacentSum.js:22: Exmaple ==> Example * chore: fix spelling ./Project-Euler/test/Problem010.test.js:4: upto ==> up to ./Project-Euler/test/Problem010.test.js:8: upto ==> up to ./Project-Euler/test/Problem010.test.js:12: upto ==> up to * chore: fix spelling ./String/AlphaNumericPalindrome.js:10: recieves ==> receives ./String/AlphaNumericPalindrome.js:10: sting ==> string ./String/AlphaNumericPalindrome.js:46: varaible ==> variable * chore: fix spelling ./String/DiceCoefficient.js:3: stings ==> strings * chore: fix spelling ./String/test/DiceCoefficient.test.js:9: atleast ==> at least * chore: fix spelling ./String/test/MaxWord.test.js:8: ba ==> be * chore: ignore `PermutateString.test.js` * chore: fix spelling ./String/test/CheckVowels.test.js:62: occurances ==> occurrences * chore: ignore `SubsequenceRecursive.js` * chore: fix spelling ./Conversions/TemperatureConversion.js:2: arguement ==> argument * chore: fix spelling ./Conversions/RailwayTimeConversion.js:7: Formate ==> Format ./Conversions/RailwayTimeConversion.js:8: Formate ==> Format * chore: remove Linear Algebra The deleted directory hosted a package which are not accepted by this repository. * Auto-update DIRECTORY.md * chore: fix spelling * chore: fix spellings * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: no need to check filenames Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: ggkogkou <76820848+ggkogkou@users.noreply.github.com> Co-authored-by: ggkogkou <ggkogkou@ggkogkou.gr>
1 parent 7722870 commit 072523d

34 files changed

Lines changed: 69 additions & 897 deletions

‎.github/workflows/ci.yml‎

Lines changed: 1 addition & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -20,11 +20,4 @@ jobs:
2020

2121
- name: 💄 Code style
2222
run: npm run style
23-
codespell:
24-
name: Check for spelling errors
25-
runs-on: ubuntu-latest
26-
steps:
27-
- uses: actions/checkout@v2
28-
- uses: codespell-project/actions-codespell@master
29-
with:
30-
check_filenames: true
23+

‎.github/workflows/codespell.yml‎

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
name: codespell
2+
on: [push, pull_request]
3+
jobs:
4+
codespell:
5+
name: Check for spelling errors
6+
runs-on: ubuntu-latest
7+
steps:
8+
- uses: actions/checkout@v2
9+
- uses: codespell-project/actions-codespell@master
10+
with:
11+
# file types to ignore
12+
skip: "*.json,*.yml,DIRECTORY.md,PermutateString.test.js,SubsequenceRecursive.js"
13+

‎Backtracking/AllCombinationsOfSizeK.js‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
Problem: Given two numbers, n and k, make all unique combinations of k numbers from 1 to n and in sorted order
33
44
What is combinations?
5-
- Combinations is selecting items froms a collections without considering order of selection
5+
- Combinations is selecting items from a collections without considering order of selection
66
77
Example:
88
- We have an apple, a banana, and a jackfruit

‎Conversions/RailwayTimeConversion.js‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@
44
some changes on hours and minutes and if the time in 'PM' it means the only
55
want some changes in hour value.
66
7-
Input Formate -> 07:05:45PM
8-
Output Formate -> 19:05:45
7+
Input Format -> 07:05:45PM
8+
Output Format -> 19:05:45
99
1010
Problem & Explanation Source : https://www.mathsisfun.com/time.html
1111
*/

‎Conversions/TemperatureConversion.js‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// This files has functions to convert different temperature units
2-
// Functions take temperature value as a arguement and returns corresponding converted value
2+
// Functions take temperature value as a argument and returns corresponding converted value
33

44
const celsiusToFahrenheit = (celsius) => {
55
// Wikipedia reference: https://en.wikipedia.org/wiki/Celsius
@@ -40,7 +40,7 @@ const fahrenheitToRankine = (fahrenheit) => {
4040
const kelvinToCelsius = (kelvin) => {
4141
// Wikipedia reference: https://en.wikipedia.org/wiki/Kelvin
4242
// Wikipedia reference: https://en.wikipedia.org/wiki/Celsius
43-
return Math.round((kelvin) - 273.15)
43+
return Math.round((kelvin) - 273.15)
4444
}
4545

4646
const kelvinToFahrenheit = (kelvin) => {

‎DIRECTORY.md‎

Lines changed: 0 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -135,12 +135,6 @@
135135
* [SHA1](https://github.com/TheAlgorithms/Javascript/blob/master/Hashes/SHA1.js)
136136
* [SHA256](https://github.com/TheAlgorithms/Javascript/blob/master/Hashes/SHA256.js)
137137

138-
## Linear-Algebra
139-
* src
140-
* [la_lib](https://github.com/TheAlgorithms/Javascript/blob/master/Linear-Algebra/src/la_lib.js)
141-
* test
142-
* [test](https://github.com/TheAlgorithms/Javascript/blob/master/Linear-Algebra/test/test.js)
143-
144138
## Maths
145139
* [Abs](https://github.com/TheAlgorithms/Javascript/blob/master/Maths/Abs.js)
146140
* [AliquotSum](https://github.com/TheAlgorithms/Javascript/blob/master/Maths/AliquotSum.js)

‎Data-Structures/Array/NumberOfLocalMaximumPoints.js‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
* [NumberOfLocalMaximumPoints](https://www.geeksforgeeks.org/find-indices-of-all-local-maxima-and-local-minima-in-an-array/) is an algorithm to find relative bigger numbers compared to their neighbors
33
*
44
* Notes:
5-
* - like the other similar local maxima search function find relative maxima points in array but doesnt stop at one but returns total point count
5+
* - like the other similar local maxima search function find relative maxima points in array but doesn't stop at one but returns total point count
66
* - runs on array A of size n and returns the local maxima count using divide and conquer methodology
77
*
88
* @complexity: O(n) (on average )

‎Data-Structures/Array/test/LocalMaximomPoint.test.js‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,17 @@
11
import { LocalMaximomPoint } from '../LocalMaximomPoint'
22

3-
describe('LocalMaximomPoint tests', () => {
4-
it('test boundry maximom points - last element', () => {
3+
describe('LocalMaximumPoint tests', () => {
4+
it('test boundary maximum points - last element', () => {
55
const Array = [1, 2, 3, 4, 5, 6, 12]
66
expect(LocalMaximomPoint(Array)).toEqual(6)
77
})
88

9-
it('test boundry maximom points - first element', () => {
9+
it('test boundary maximum points - first element', () => {
1010
const Array2 = [13, 6, 5, 4, 3, 2, 1]
1111
expect(LocalMaximomPoint(Array2)).toEqual(0)
1212
})
1313

14-
it('test boundry maximom points - should find first maximom point from the top', () => {
14+
it('test boundary maximum points - should find first maximom point from the top', () => {
1515
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
1616
const Array = [13, 2, 3, 4, 5, 6, 12]
1717
expect(LocalMaximomPoint(Array)).toEqual(6)

‎Data-Structures/Array/test/NumberOfLocalMaximumPoints.test.js‎

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,41 +1,41 @@
11
import { NumberOfLocalMaximumPoints } from '../NumberOfLocalMaximumPoints'
22

33
describe('LocalMaximomPoint tests', () => {
4-
it('test boundry maximom points - last element', () => {
4+
it('test boundary maximum points - last element', () => {
55
const Array = [1, 2, 3, 4, 5, 6, 12]
66
expect(NumberOfLocalMaximumPoints(Array)).toEqual(1)
77
})
88

9-
it('test boundry maximom points - first element', () => {
9+
it('test boundary maximum points - first element', () => {
1010
const Array = [13, 6, 5, 4, 3, 2, 1]
1111
expect(NumberOfLocalMaximumPoints(Array)).toEqual(1)
1212
})
1313

14-
it('test boundry maximom points - both boundries have maximum points', () => {
14+
it('test boundary maximum points - both boundaries have maximum points', () => {
1515
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
1616
const Array = [13, 2, 3, 4, 5, 6, 12]
1717
expect(NumberOfLocalMaximumPoints(Array)).toEqual(2)
1818
})
1919

20-
it('multiple maximom points in the middle', () => {
20+
it('multiple maximum points in the middle', () => {
2121
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
2222
const Array = [1, 3, 2, 5, 6, 9, 2, 7, 12, 1, 0]
2323
expect(NumberOfLocalMaximumPoints(Array)).toEqual(3)
2424
})
2525

26-
it('multiple maximom points in the middle with one at end', () => {
26+
it('multiple maximum points in the middle with one at end', () => {
2727
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
2828
const Array = [1, 3, 2, 5, 6, 9, 2, 7, 12, 1, 10]
2929
expect(NumberOfLocalMaximumPoints(Array)).toEqual(4)
3030
})
3131

32-
it('multiple maximom points in the middle with one at start', () => {
32+
it('multiple maximum points in the middle with one at start', () => {
3333
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
3434
const Array = [10, 3, 2, 5, 6, 9, 2, 7, 12, 1, 0]
3535
expect(NumberOfLocalMaximumPoints(Array)).toEqual(3)
3636
})
3737

38-
it('multiple maximom points in the middle with two more at both ends', () => {
38+
it('multiple maximum points in the middle with two more at both ends', () => {
3939
// Test a mix of number types (i.e., positive/negative, numbers with decimals, fractions)
4040
const Array = [10, 3, 11, 5, 6, 9, 2, 7, 12, 1, 10]
4141
expect(NumberOfLocalMaximumPoints(Array)).toEqual(5)

‎Data-Structures/Heap/MinPriorityQueue.js‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ class MinPriorityQueue {
5757
output(this.heap.slice(1))
5858
}
5959

60-
// heap reverse can be done by performing swaping the first
60+
// heap reverse can be done by performing swapping the first
6161
// element with the last, removing the last element to
6262
// new array and calling sink function.
6363
heapReverse () {

0 commit comments

Comments
 (0)
Back | FazBrowse Home | New Git URL