diff --git a/docs/index.html b/docs/index.html index ee248ca05..6e91cc01b 100644 --- a/docs/index.html +++ b/docs/index.html @@ -1,38 +1,30 @@ -
30 seconds of codeCurated collection of useful JavaScript snippets
that you can understand in 30 seconds or less.
320
snippets
125
contributors
3588
commits
21496
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:
Splits values into two groups. If an element in filter is truthy, the corresponding element in the collection belongs to the first group; otherwise, it belongs to the second group.
Use Array.reduce() and Array.push() to add elements to groups, based on filter.
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'] ] -
Makes a GET request to the passed URL.
Use XMLHttpRequest web api to make a get request to the given url. Handle the onload event, by calling the given callback the responseText. Handle the onerror event, by running the provided err function. Omit the third argument, err, to log errors to the console's error stream by default.
const httpGet = (url, callback, err = console.error) => { - const request = new XMLHttpRequest(); - request.open('GET', url, true); - request.onload = () => callback(request.responseText); - request.onerror = () => err(request); - request.send(); +30 seconds of code
30 seconds of code
Curated collection of useful JavaScript snippets
that you can understand in 30 seconds or less.320
snippets125
contributors3589
commits21515
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:
lcm
Returns the least common multiple of two or more numbers.
Use the greatest common divisor (GCD) formula and the fact that
lcm(x,y) = x * y / gcd(x,y)to determine the least common multiple. The GCD formula uses recursion.const lcm = (...arr) => { + const gcd = (x, y) => (!y ? x : gcd(y, x % y)); + const _lcm = (x, y) => (x * y) / gcd(x, y); + return [...arr].reduce((a, b) => _lcm(a, b)); }; -httpGet( - 'https://jsonplaceholder.typicode.com/posts/1', - console.log -); /* -Logs: { - "userId": 1, - "id": 1, - "title": "sunt aut facere repellat provident occaecati excepturi optio reprehenderit", - "body": "quia et suscipit\nsuscipit recusandae consequuntur expedita et cum\nreprehenderit molestiae ut ut quas totam\nnostrum rerum est autem sunt rem eveniet architecto" -} -*/ -isAnagram
Checks if a string is an anagram of another string (case-insensitive, ignores spaces, punctuation and special characters).
Use
String.toLowerCase(),String.replace()with an appropriate regular expression to remove unnecessary characters,String.split(''),Array.sort()andArray.join('')on both strings to normalize them, then check if their normalized forms are equal.const isAnagram = (str1, str2) => { - const normalize = str => - str - .toLowerCase() - .replace(/[^a-z0-9]/gi, '') - .split('') - .sort() - .join(''); - return normalize(str1) === normalize(str2); +lcm(12, 7); // 84 +lcm(...[1, 3, 4, 5]); // 60 +shuffle
Randomizes the order of the values of an array, returning a new array.
Uses the Fisher-Yates algorithm to reorder the elements of the array.
const shuffle = ([...arr]) => { + let m = arr.length; + while (m) { + const i = Math.floor(Math.random() * m--); + [arr[m], arr[i]] = [arr[i], arr[m]]; + } + return arr; }; -isAnagram('iceman', 'cinema'); // true +const foo = [1, 2, 3]; +shuffle(foo); // [2,3,1], foo = [1,2,3] +sortedIndexBy
Returns the lowest index at which value should be inserted into array in order to maintain its sort order, based on a provided iterator function.
Check if the array is sorted in descending order (loosely). Use
Array.findIndex()to find the appropriate index where the element should be inserted, based on the iterator functionfn.const sortedIndexBy = (arr, n, fn) => { + const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]); + const val = fn(n); + const index = arr.findIndex(el => (isDescending ? val >= fn(el) : val <= fn(el))); + return index === -1 ? arr.length : index; +}; +sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 0Getting 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 implemented 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.