🤖 chore: Lint source files.

These changes were automatically generated by a transform whose code can be found at:
  - https://github.com/aureooms/rejuvenate/blob/84eaeb4142b3fee77a179bb93606956b18566d90/src/transforms/sources:initial-lint.js
Please contact the author of the transform if you believe there was an error.

Author: a-flying-potato

src/boolean.js

@@ -1,2 +1,2 @@
-export let truth = _ => true ;
-export let untruth = _ => false ;
+export const truth = (_) => true;
+export const untruth = (_) => false;

src/conjunction.js

@@ -1,3 +1 @@
-
-export let conjunction = ( p , q ) => x => p( x ) && q( x ) ;
-
+export const conjunction = (p, q) => (x) => p(x) && q(x);

src/conjunctions.js

@@ -1,19 +1,11 @@
+// Could use recursion
 
-// could use recursion
-
-export function conjunctions ( predicates ) {
-
-	return function ( input ) {
-
-		for ( let predicate of predicates ) {
-
-			if ( ! predicate( input ) ) return false ;
-
+export function conjunctions(predicates) {
+	return function (input) {
+		for (const predicate of predicates) {
+			if (!predicate(input)) return false;
 		}
 
-		return true ;
-
-	} ;
-
+		return true;
+	};
 }
-

src/disjunction.js

@@ -1,4 +1 @@
-
-export let disjunction = ( p , q ) => x => p( x ) || q( x ) ;
-
-
+export const disjunction = (p, q) => (x) => p(x) || q(x);

src/disjunctions.js

@@ -1,19 +1,11 @@
+// Could use recursion
 
-// could use recursion
-
-export function disjunctions ( predicates ) {
-
-	return function ( input ) {
-
-		for ( let predicate of predicates ) {
-
-			if ( predicate( input ) ) return true ;
-
+export function disjunctions(predicates) {
+	return function (input) {
+		for (const predicate of predicates) {
+			if (predicate(input)) return true;
 		}
 
-		return false ;
-
-	} ;
-
+		return false;
+	};
 }
-

src/equivalence.js

@@ -1,4 +1 @@
-
-export let equivalence = ( p , q ) => x => p( x ) === q( x ) ;
-
-
+export const equivalence = (p, q) => (x) => p(x) === q(x);

src/implication.js

@@ -1,3 +1 @@
-
-export let implication = ( p , q ) => x => ! p( x ) || q( x ) ;
-
+export const implication = (p, q) => (x) => !p(x) || q(x);

src/negation.js

@@ -1,3 +1 @@
-
-export let negation = p => x => ! p( x ) ;
-
+export const negation = (p) => (x) => !p(x);

src/numbers.js

@@ -1,4 +1,2 @@
-
-export let divides = y => x => y % x === 0 ;
-export let divisible = y => x => x % y === 0 ;
-
+export const divides = (y) => (x) => y % x === 0;
+export const divisible = (y) => (x) => x % y === 0;

src/operators.js

@@ -1,10 +1,8 @@
+export const lt = (y) => (x) => x < y;
+export const le = (y) => (x) => x <= y;
 
-export let lt = y => x => x < y ;
-export let le = y => x => x <= y ;
-
-export let gt = y => x => x > y ;
-export let ge = y => x => x >= y ;
-
-export let eq = y => x => x === y ;
-export let ne = y => x => x !== y ;
+export const gt = (y) => (x) => x > y;
+export const ge = (y) => (x) => x >= y;
 
+export const eq = (y) => (x) => x === y;
+export const ne = (y) => (x) => x !== y;