diff --git a/docs/index.html b/docs/index.html index 737f1ad81..395a2a9ad 100644 --- a/docs/index.html +++ b/docs/index.html @@ -1,20 +1,21 @@ -
30 seconds of codeCurated collection of useful JavaScript snippets
that you can understand in 30 seconds or less.
313
snippets
120
contributors
3367
commits
20994
stars
The core goal of 30 seconds of code is to provide a quality resource for beginner and advanced JavaScript developers alike. We want to help improve the JavaScript ecosystem, by lowering the barrier of entry for newcomers and help seasoned veterans pick up new tricks and remember old ones. In order to achieve this, we have collected hundreds of snippets that can be of use in a wide range of situations. We welcome new contributors and we like fresh ideas, as long as the code is short and easy to grasp in about 30 seconds. The only catch, if you may, is that a few of our snippets are not perfectly optimized for large, enterprise applications and they might not be deemed production-ready.
In order for 30 seconds of code to be as accessible and useful as possible, all of the snippets in the collection are licensed under the CC0-1.0 License, meaning they are absolutely free to use in any project you like. If you like what we do, you can always credit us, but that is not mandatory.
Our sophisticated robot helpers pick new snippets from our collection daily, so that you can discover new snippets to enhance your projects:
Calculates the greatest common divisor between two or more numbers/arrays.
The inner _gcd function uses recursion. Base case is when y equals 0. In this case, return x. Otherwise, return the GCD of y and the remainder of the division x/y.
const gcd = (...arr) => { - const _gcd = (x, y) => (!y ? x : gcd(y, x % y)); - return [...arr].reduce((a, b) => _gcd(a, b)); -}; -
gcd(8, 36); // 4 -gcd(...[12, 8, 32]); // 4 -
Returns the head of a list.
Use arr[0] to return the first element of the passed array.
const head = arr => arr[0]; -
head([1, 2, 3]); // 1 -
Takes any number of iterable objects or objects with a length property and returns the longest one.
Use Array.sort() to sort all arguments by length, return the first (longest) one.
const longestItem = (...vals) => [...vals].sort((a, b) => b.length - a.length)[0]; -
longestItem('this', 'is', 'a', 'testcase'); // 'testcase' -longestItem(...['a', 'ab', 'abc']); // 'abc' -longestItem(...['a', 'ab', 'abc'], 'abcd'); // 'abcd' -longestItem([1, 2, 3], [1, 2], [1, 2, 3, 4, 5]); // [1, 2, 3, 4, 5] -longestItem([1, 2, 3], 'foobar'); // 'foobar' +30 seconds of code
30 seconds of code
Curated collection of useful JavaScript snippets
that you can understand in 30 seconds or less.313
snippets120
contributors3372
commits21011
starsOur philosophy
The core goal of 30 seconds of code is to provide a quality resource for beginner and advanced JavaScript developers alike. We want to help improve the JavaScript ecosystem, by lowering the barrier of entry for newcomers and help seasoned veterans pick up new tricks and remember old ones. In order to achieve this, we have collected hundreds of snippets that can be of use in a wide range of situations. We welcome new contributors and we like fresh ideas, as long as the code is short and easy to grasp in about 30 seconds. The only catch, if you may, is that a few of our snippets are not perfectly optimized for large, enterprise applications and they might not be deemed production-ready.
In order for 30 seconds of code to be as accessible and useful as possible, all of the snippets in the collection are licensed under the CC0-1.0 License, meaning they are absolutely free to use in any project you like. If you like what we do, you can always credit us, but that is not mandatory.
Today's picks
Our sophisticated robot helpers pick new snippets from our collection daily, so that you can discover new snippets to enhance your projects:
bifurcate
Splits values into two groups. If an element in
filteris truthy, the corresponding element in the collection belongs to the first group; otherwise, it belongs to the second group.Use
Array.reduce()andArray.push()to add elements to groups, based onfilter.const bifurcate = (arr, filter) => + arr.reduce((acc, val, i) => (acc[filter[i] ? 0 : 1].push(val), acc), [[], []]); +bifurcate(['beep', 'boop', 'foo', 'bar'], [true, true, false, true]); // [ ['beep', 'boop', 'bar'], ['foo'] ] +coalesce
Returns the first non-null/undefined argument.
Use
Array.find()to return the first nonnull/undefinedargument.const coalesce = (...args) => args.find(_ => ![undefined, null].includes(_)); +coalesce(null, undefined, '', NaN, 'Waldo'); // "" +renameKeys
Replaces the names of multiple object keys with the values provided.
Use
Object.keys()in combination withArray.reduce()and the spread operator (...) to get the object's keys and rename them according tokeysMap.const renameKeys = (keysMap, obj) => + Object.keys(obj).reduce( + (acc, key) => ({ + ...acc, + ...{ [keysMap[key] || key]: obj[key] } + }), + {} + ); +const obj = { name: 'Bobo', job: 'Front-End Master', shoeSize: 100 }; +renameKeys({ name: 'firstName', job: 'passion' }, obj); // { firstName: 'Bobo', passion: 'Front-End Master', shoeSize: 100 }Getting started
- If you are new to JavaScript, we suggest you start by taking a look at the Beginner's snippets
- If you want to level up your JavaScript skills, check out the full Snippet collection
- If you want to see how the project was built and contribute, visit our Github repository
- If you want to check out some more complex snippets, you can visit the Archive
Related projects
The idea behind 30 seconds of code has inspired some people to create similar collections in other programming languages and environments. Here are the ones we like the most:
- 30 seconds of CSS by atomiks
- 30 seconds of Interviews by fejes713
- 30 seconds of Python by kriadmin
How to contribute
Do you have a cool idea for a new snippet? Maybe some code you use often and is not part of our collection? Contributing to 30 seconds of code is as simple as 1,2,3,4!
1Create
Start by creating a snippet, according to the snippet template. Make sure to follow these simple guidelines:
- Your snippet title must be unique and the same as the name of the implemented function.
- Use the snippet description to explain what your snippet does and how it works.
- Try to keep the snippet's code short and to the point. Use modern techniques and features.
- Remember to provide an example of how your snippet works.
- Your snippet should solve a real-world problem, no matter how simple.
- Never modify README.md or any of the HTML files.
2Tag
Run
npm run taggerfrom your terminal, then open the tag_database file and tag your snippet appropriately. Multitagging is also supported, just make sure the first tag you specify is on of the major tags and the one that is most relevant to the implemneted function.3Test
You can optionally test your snippet to make our job easier. Simply run
npm run testerto generate the test files for your snippet. Find the related folder for you snippet under the test directory and write some tests. Remember to runnpm run testeragain to make sure your tests are passing.4Pull request
If you have done everything mentioned above, you should now have an awesome snippet to add to our collection. Simply start a pull request and follow the guidelines provided. Remember to only submit one snippet per pull request, so that we can quickly evaluate and merge your code into the collection.
If you need additional pointers about writing a snippet, be sure to read the complete contribution guidelines.