Travis build: 1474

README.md

@@ -314,6 +314,7 @@ _30s.average(1, 2, 3);
 * [`isDivisible`](#isdivisible)
 * [`isEven`](#iseven)
 * [`isNegativeZero`](#isnegativezero)
+* [`isOdd`](#isodd)
 * [`isPrime`](#isprime)
 * [`lcm`](#lcm)
 * [`luhnCheck`](#luhncheck-)
@@ -5692,6 +5693,27 @@ isNegativeZero(0); // false
 
 <br>[⬆ Back to top](#contents)
 
+### isOdd
+
+Returns `true` if the given number is odd, `false` otherwise.
+
+Checks whether a number is odd or even using the modulo (`%`) operator.
+Returns `true` if the number is odd, `false` if the number is even.
+
+```js
+const isOdd = num => num % 2 === 1;
+```
+
+<details>
+<summary>Examples</summary>
+
+```js
+isOdd(3); // true
+```
+</details>
+
+<br>[⬆ Back to top](#contents)
+
 ### isPrime
 
 Checks if the provided integer is a prime number.

snippet_data/snippetList.json

@@ -412,7 +412,7 @@
         ]
       },
       "meta": {
-        "hash": "57c13349b29a4d306650795dd94ced736ecd5ecdda13c74257aabd33eb82887a"
+        "hash": "d6cecd4bcef92ac6a01f89a4f766fbe1eb006a48ef5181d095cb2f59446f5ca5"
       }
     },
     {
@@ -835,7 +835,7 @@
         ]
       },
       "meta": {
-        "hash": "e45dca3875c65fe1af16b1dc48e9dd8264f4ab397994e6bbbd19741940ac7d4d"
+        "hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
       }
     },
     {
@@ -898,7 +898,7 @@
         ]
       },
       "meta": {
-        "hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
+        "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
       }
     },
     {
@@ -1037,7 +1037,7 @@
         ]
       },
       "meta": {
-        "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
+        "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
       }
     },
     {
@@ -1273,7 +1273,7 @@
         ]
       },
       "meta": {
-        "hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
+        "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
       }
     },
     {
@@ -1678,7 +1678,7 @@
         ]
       },
       "meta": {
-        "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
+        "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
       }
     },
     {
@@ -2524,6 +2524,21 @@
         "hash": "c3424342e1ccfaff2b8f0b0727595fc2cd8063a185ecc42708fa41a2a7c25fc4"
       }
     },
+    {
+      "id": "isOdd",
+      "type": "snippetListing",
+      "title": "isOdd",
+      "attributes": {
+        "text": "Returns `true` if the given number is odd, `false` otherwise.\n\nChecks whether a number is odd or even using the modulo (`%`) operator.\nReturns `true` if the number is odd, `false` if the number is even.\n\n",
+        "tags": [
+          "math",
+          "beginner"
+        ]
+      },
+      "meta": {
+        "hash": "9d259b2877b38e255222f876d6f00247b6449da44082d24eadd48f46d71ccd9d"
+      }
+    },
     {
       "id": "isPlainObject",
       "type": "snippetListing",
@@ -2805,7 +2820,7 @@
         ]
       },
       "meta": {
-        "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
+        "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
       }
     },
     {
@@ -3698,7 +3713,7 @@
         ]
       },
       "meta": {
-        "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
+        "hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
       }
     },
     {

snippet_data/snippets.json

@@ -568,7 +568,7 @@
         ]
       },
       "meta": {
-        "hash": "57c13349b29a4d306650795dd94ced736ecd5ecdda13c74257aabd33eb82887a"
+        "hash": "d6cecd4bcef92ac6a01f89a4f766fbe1eb006a48ef5181d095cb2f59446f5ca5"
       }
     },
     {
@@ -1153,7 +1153,7 @@
         ]
       },
       "meta": {
-        "hash": "e45dca3875c65fe1af16b1dc48e9dd8264f4ab397994e6bbbd19741940ac7d4d"
+        "hash": "cdf3e756a5a73f7e6925d51b141089e991ef579ee8bfff99f194da8fb0ef6dc8"
       }
     },
     {
@@ -1240,7 +1240,7 @@
         ]
       },
       "meta": {
-        "hash": "7a228b650ff668f697e524e0d27ebeff1bfa35e04333b6cd5e742ff63bfea25d"
+        "hash": "a4e1e33c0688dbf1ca231d9d8ea315ffed93b7f83f5d8cbf0714f10fdfeda8cf"
       }
     },
     {
@@ -1433,7 +1433,7 @@
         ]
       },
       "meta": {
-        "hash": "5f38360819f9225b887a94221bfee1a80f1bcc224a364440b3388f60491b03ba"
+        "hash": "484bd222e636e8a8409c30ddb1fe6e3fe72ab7a43f2edf089b2758d5e9bee528"
       }
     },
     {
@@ -1759,7 +1759,7 @@
         ]
       },
       "meta": {
-        "hash": "55b1ce0a892110d792a9487e40331774015525479faa2b8961f6c2ea6291c27b"
+        "hash": "0eac852db7a7add352b0d36677b22718b342ed9dc12f11780cac87e3b8260a05"
       }
     },
     {
@@ -2320,7 +2320,7 @@
         ]
       },
       "meta": {
-        "hash": "16c3b724b653dcb31f3e59f1664a59951abb15a93eb3697cade4d3ae0e63c532"
+        "hash": "9e39c6a3a8ec5b51c5e16f69107fc9e90b2697b2cf2689850872071bb968723e"
       }
     },
     {
@@ -3484,6 +3484,27 @@
         "hash": "c3424342e1ccfaff2b8f0b0727595fc2cd8063a185ecc42708fa41a2a7c25fc4"
       }
     },
+    {
+      "id": "isOdd",
+      "title": "isOdd",
+      "type": "snippet",
+      "attributes": {
+        "fileName": "isOdd.md",
+        "text": "Returns `true` if the given number is odd, `false` otherwise.\n\nChecks whether a number is odd or even using the modulo (`%`) operator.\nReturns `true` if the number is odd, `false` if the number is even.\n\n",
+        "codeBlocks": {
+          "es6": "const isOdd = num => num % 2 === 1;",
+          "es5": "var isOdd = function isOdd(num) {\n  return num % 2 === 1;\n};",
+          "example": "isOdd(3); // true"
+        },
+        "tags": [
+          "math",
+          "beginner"
+        ]
+      },
+      "meta": {
+        "hash": "9d259b2877b38e255222f876d6f00247b6449da44082d24eadd48f46d71ccd9d"
+      }
+    },
     {
       "id": "isPlainObject",
       "title": "isPlainObject",
@@ -3873,7 +3894,7 @@
         ]
       },
       "meta": {
-        "hash": "362fddaa6244404741e84bca6fc442a101fdb642af53b299e8b9994d0d7162d8"
+        "hash": "3db3faac666ee61ab86c70766d2ab5d1293ffd818da87edb971bfff7a366364a"
       }
     },
     {
@@ -5102,7 +5123,7 @@
         ]
       },
       "meta": {
-        "hash": "17bcf3f13980b7f804d9f0fe274324b2a35ab7d479c03d77322dabba81e1a34a"
+        "hash": "7ccbf66d8d55c60bcf12baa980cf32d67a4ba567894d59e2d798c9af792424ff"
       }
     },
     {

snippets/checkProp.md

@@ -29,6 +29,7 @@ const checkProp = (predicate, prop) => obj => !!predicate(obj[prop]);
 
 
 
+
 const lengthIs4 = checkProp(l => l === 4, 'length');
 lengthIs4([]); // false
 lengthIs4([1,2,3,4]); // true

snippets/deepClone.md

@@ -10,7 +10,6 @@ Use `Object.assign()` and an empty object (`{}`) to create a shallow clone of th
 Use `Object.keys()` and `Array.prototype.forEach()` to determine which key-value pairs need to be deep cloned.
 
 ```js
-
 const deepClone = obj => {
   let clone = Object.assign({}, obj);
   Object.keys(clone).forEach(

snippets/deepMapKeys.md

@@ -10,7 +10,6 @@ Use `Object.keys(obj)` to iterate over the object's keys.
 Use `Array.prototype.reduce()` to create a new object with the same values and mapped keys using `fn`.
 
 ```js
-
 const deepMapKeys = (obj, f) =>
   Array.isArray(obj)
     ? obj.map(val => deepMapKeys(val, f))

snippets/dig.md

@@ -9,7 +9,6 @@ Use the `in` operator to check if `target` exists in `obj`.
 If found, return the value of `obj[target]`, otherwise use `Object.values(obj)` and `Array.prototype.reduce()` to recursively call `dig` on each nested object until the first matching key/value pair is found.
 
 ```js
-
 const dig = (obj, target) =>
   target in obj
     ? obj[target]

snippets/factorial.md

@@ -11,7 +11,6 @@ Otherwise, return the product of `n` and the factorial of `n - 1`.
 Throws an exception if `n` is a negative number.
 
 ```js
-
 const factorial = n =>
   n < 0
     ? (() => {

snippets/getMeridiemSuffixOfInteger.md

@@ -8,7 +8,6 @@ Converts an integer to a suffixed string, adding `am` or `pm` based on its value
 Use the modulo operator (`%`) and conditional checks to transform an integer to a stringified 12-hour format with meridiem suffix.
 
 ```js
-
 const getMeridiemSuffixOfInteger = num =>
   num === 0 || num === 24
     ? 12 + 'am'

snippets/join.md

@@ -11,7 +11,6 @@ Omit the second argument, `separator`, to use a default separator of `','`.
 Omit the third argument, `end`, to use the same value as `separator` by default.
 
 ```js
-
 const join = (arr, separator = ',', end = separator) =>
   arr.reduce(
     (acc, val, i) =>

snippets/pipeAsyncFunctions.md

@@ -14,7 +14,6 @@ const pipeAsyncFunctions = (...fns) => arg => fns.reduce((p, f) => p.then(f), Pr
 ```
 
 ```js
-
 const sum = pipeAsyncFunctions(
   x => x + 1,
   x => new Promise(resolve => setTimeout(() => resolve(x + 2), 1000)),

vscode_snippets/snippets.json

@@ -1543,6 +1543,13 @@
     ],
     "description": "Checks if a value is object-like.\n\nCheck if the provided value is not `null` and its `typeof` is equal to `'object'`.\n"
   },
+  "isOdd": {
+    "prefix": "30s_isOdd",
+    "body": [
+      "const isOdd = num => num % 2 === 1;"
+    ],
+    "description": "Returns `true` if the given number is odd, `false` otherwise.\n\nChecks whether a number is odd or even using the modulo (`%`) operator.\nReturns `true` if the number is odd, `false` if the number is even.\n"
+  },
   "isPlainObject": {
     "prefix": "30s_isPlainObject",
     "body": [