diff --git a/README.md b/README.md index 0fe4fa652..8ce0393a2 100644 --- a/README.md +++ b/README.md @@ -7114,7 +7114,7 @@ truthCheckCollection([{ user: 'Tinky-Winky', sex: 'male' }, { user: 'Dipsy', sex ### unflattenObject  -Unlatten an object with the paths for keys. +Unflatten an object with the paths for keys. Use `Object.keys(obj)` combined with `Array.reduce()` to convert flattened path node to a leaf node. If the value of a key contains a dot delimiter (`.`), use `Array.split('.')`, string transformations and `JSON.parse()` to create an object, then `Object.assign()` to create the leaf node. diff --git a/docs/index.html b/docs/index.html index 348c46c2a..e74a8a674 100644 --- a/docs/index.html +++ b/docs/index.html @@ -1,17 +1,24 @@ -
30 seconds of codeCurated collection of useful JavaScript snippets
that you can understand in 30 seconds or less.
309
snippets
118
contributors
3316
commits
20734
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 many of our snippets are not perfectly suited 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:
Returns true if the provided predicate function returns true for at least one element in a collection, false otherwise.
Use Array.some() to test if any elements in the collection return true based on fn. Omit the second argument, fn, to use Boolean as a default.
const any = (arr, fn = Boolean) => arr.some(fn); -
any([0, 1, 2, 0], x => x >= 2); // true -any([0, 0, 1, 0]); // true -
Hides all the elements specified.
Use the spread operator (...) and Array.forEach() to apply display: none to each element specified.
const hide = (...el) => [...el].forEach(e => (e.style.display = 'none')); -
hide(...document.querySelectorAll('img')); // Hides all <img> elements on the page -
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.309
snippets120
contributors3336
commits20789
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 many of our snippets are not perfectly suited 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:
binomialCoefficient
Evaluates the binomial coefficient of two integers
nandk.Use
Number.isNaN()to check if any of the two values isNaN. Check ifkis less than0, greater than or equal ton, equal to1orn - 1and return the appropriate result. Check ifn - kis less thankand switch their values accordingly. Loop from2throughkand calculate the binomial coefficient. UseMath.round()to account for rounding errors in the calculation.const binomialCoefficient = (n, k) => { + if (Number.isNaN(n) || Number.isNaN(k)) return NaN; + if (k < 0 || k > n) return 0; + if (k === 0 || k === n) return 1; + if (k === 1 || k === n - 1) return n; + if (n - k < k) k = n - k; + let res = n; + for (let j = 2; j <= k; j++) res *= (n - j + 1) / j; + return Math.round(res); +}; +binomialCoefficient(8, 2); // 28 +overArgs
Creates a function that invokes the provided function with its arguments transformed.
Use
Array.map()to applytransformstoargsin combination with the spread operator (...) to pass the transformed arguments tofn.const overArgs = (fn, transforms) => (...args) => fn(...args.map((val, i) => transforms[i](val))); +const square = n => n * n; +const double = n => n * 2; +const fn = overArgs((x, y) => [x, y], [square, double]); +fn(9, 3); // [81, 6] +removeNonASCII
Removes non-printable ASCII characters.
Use a regular expression to remove non-printable ASCII characters.
const removeNonASCII = str => str.replace(/[^\x20-\x7E]/g, ''); +removeNonASCII('äÄçÇéÉêlorem-ipsumöÖÐþúÚ'); // 'lorem-ipsum'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.