robtrew / prelude-jxa Goto Github PK

View Code? Open in Web Editor NEW

66.0 9.0 2.0 3.79 MB

Generic functions for macOS and iOS scripting in Javascript – function names as in Hoogle

License: MIT License

JavaScript 100.00%

javascript macos prelude-based applescript jxa

prelude-jxa's People

Contributors

Stargazers

Watchers

Forkers

twleung unlocked2412

prelude-jxa's Issues

go definition is not curried

prelude-jxa/jsPrelude.js

Line 4644 in bc566ea

const go = (subNest, xs) =>

enumFromThenTo gives incorrect results

prelude-jxa/jsPrelude.js

Lines 1143 to 1153 in 3c93392

 // enumFromThenTo :: Int -> Int -> Int -> [Int] 

 const enumFromThenTo = m => 

 // Integer values enumerated from m to n 

 // with a step defined by (nxt - m). 

 nxt => n => { 

 const d = nxt - m; 

 return Array.from({ 

 length: (Math.floor(n - nxt) / d) + 2 

 }, (_, i) => m + (d * i)); 

 };

I've just executed

enumFromThenTo(1)(11)(2)

and got

[1]

Typo in type signature

prelude-jxa/JS Prelude MD/traverse.md

Line 2 in 7877435

// traverse :: (Applicative f" Traversable t) ->

Missing closing brace in `levels` function.

prelude-jxa/jsPrelude.js

Lines 2400 to 2417 in 6692da1

 const levels = tree => { 

 // A list of lists, grouping the root 

 // values of each level of the tree. 

 const go = (a, node) => { 

 const [h, ...t] = 0 < a.length ? ( 

 a 

 ) : [ 

 [], 

 [] 

 ]; 

 return [ 

 [node.root, ...h], 

 ...node.nest.slice(0) 

 .reverse() 

 .reduce(go, t) 

 ]; 

 };

Do you think go definition could be curried ?

Type signature missing parameter

prelude-jxa/jxaSystemIO.js

Line 410 in 0ceed4e

// writeFileLR :: FilePath -> Either String IO FilePath

Evaluation of `typeName(null)` gives an error.

prelude-jxa/jsPrelude.js

Lines 4888 to 4912 in 3532094

 const typeName = v => { 

 const t = typeof v; 

 return "object" === t ? ( 

 Array.isArray(v) ? ( 

 "List" 

 ) : "Date" === v.constructor.name ? ( 

 "Date" 

 ) : null !== v ? (() => { 

 const ct = v.type; 

 return Boolean(ct) ? ( 

 (/Tuple\d+/u).test(ct) ? ( 

 "TupleN" 

 ) : ct 

 ) : "Dict"; 

 })() : "Bottom" 

 ) : { 

 "boolean": "Bool", 

 "date": "Date", 

 "number": "Num", 

 "string": "String", 

 "function": "(a -> b)" 

 } [t] || "Bottom"; 

 };

Possible bug in `treeLeaves` ?

prelude-jxa/jsPrelude.js

Lines 4757 to 4764 in 8234535

 // treeLeaves :: Tree -> [Tree] 

 const treeLeaves = tree => { 

 const subNest = tree.nest; 

 return (0 < nest.length) ? ( 

 subNest.flatMap(treeLeaves) 

 ) : [tree]; 

 };

I think there is a typo in the following comparison:

(0 < nest.length)

this is so elegant! is there a way to learn how to use this?

for someone who has some generic python scripting experience and attempted to learn functional programming sometimes. i understand Monads at a basic level and think it is a good way to manage error handling. and the idea of declarative programming makes it less error prone.

all this for someone who wants to learn this for its elegance and not for work...

thanks!

Typo in break comment

prelude-jxa/JS Prelude MD/break.md

Line 4 in 8e929fb

// The longest prefix of xs for in which

Introducing equality for `Date` objects

prelude-jxa/jsPrelude.js

Lines 1199 to 1218 in 3532094

 const eq = a => 

 // True when a and b are equivalent in the terms 

 // defined below for their shared data type. 

 b => { 

 const t = typeof a; 

 return t !== typeof b ? ( 

 false 

 ) : "object" !== t ? ( 

 "function" !== t ? ( 

 a === b 

 ) : a.toString() === b.toString() 

 ) : (() => { 

 const kvs = Object.entries(a); 

 return kvs.length !== Object.keys(b).length ? ( 

 false 

 ) : kvs.every(([k, v]) => eq(v)(b[k])); 

 })(); 

 };

Missing application of snd inside `indexedTree`

prelude-jxa/jsPrelude.js

Lines 1951 to 1961 in 5e84ff4

 // indexedTree :: Int -> Tree a -> Tree (a, Int) 

 const indexedTree = rootIndex => 

 // A tree in which each root value 

 // is paired with a top-down 

 // left-right index, where the root node 

 // starts at the supplied rootIndex; 

 mapAccumLTree( 

 i => x => [1 + i, [x, { 

 index: i 

 }]] 

 )(rootIndex);

I think there is a missing application of snd function in indexedTree

prelude-jxa/jsPrelude.js

Line 1951 in 5e84ff4

// indexedTree :: Int -> Tree a -> Tree (a, Int)

	// enumFromThenTo :: Int -> Int -> Int -> [Int]
	const enumFromThenTo = m =>
	// Integer values enumerated from m to n
	// with a step defined by (nxt - m).
	nxt => n => {
	const d = nxt - m;

	return Array.from({
	length: (Math.floor(n - nxt) / d) + 2
	}, (_, i) => m + (d * i));
	};

	const levels = tree => {
	// A list of lists, grouping the root
	// values of each level of the tree.
	const go = (a, node) => {
	const [h, ...t] = 0 < a.length ? (
	a
	) : [
	[],
	[]
	];

	return [
	[node.root, ...h],
	...node.nest.slice(0)
	.reverse()
	.reduce(go, t)
	];
	};

	const typeName = v => {
	const t = typeof v;

	return "object" === t ? (
	Array.isArray(v) ? (
	"List"
	) : "Date" === v.constructor.name ? (
	"Date"
	) : null !== v ? (() => {
	const ct = v.type;

	return Boolean(ct) ? (
	(/Tuple\d+/u).test(ct) ? (
	"TupleN"
	) : ct
	) : "Dict";
	})() : "Bottom"
	) : {
	"boolean": "Bool",
	"date": "Date",
	"number": "Num",
	"string": "String",
	"function": "(a -> b)"
	} [t] \|\| "Bottom";
	};

	// treeLeaves :: Tree -> [Tree]
	const treeLeaves = tree => {
	const subNest = tree.nest;

	return (0 < nest.length) ? (
	subNest.flatMap(treeLeaves)
	) : [tree];
	};

	const eq = a =>
	// True when a and b are equivalent in the terms
	// defined below for their shared data type.
	b => {
	const t = typeof a;

	return t !== typeof b ? (
	false
	) : "object" !== t ? (
	"function" !== t ? (
	a === b
	) : a.toString() === b.toString()
	) : (() => {
	const kvs = Object.entries(a);

	return kvs.length !== Object.keys(b).length ? (
	false
	) : kvs.every(([k, v]) => eq(v)(b[k]));
	})();
	};

	// indexedTree :: Int -> Tree a -> Tree (a, Int)
	const indexedTree = rootIndex =>
	// A tree in which each root value
	// is paired with a top-down
	// left-right index, where the root node
	// starts at the supplied rootIndex;
	mapAccumLTree(
	i => x => [1 + i, [x, {
	index: i
	}]]
	)(rootIndex);

robtrew / prelude-jxa Goto Github PK

prelude-jxa's People

Contributors

Stargazers

Watchers

Forkers

prelude-jxa's Issues

Recommend Projects

Recommend Topics

Recommend Org