text
stringlengths
0
15.7k
source
stringlengths
6
112
set lst to nest of x
asPrelude.applescript
if 0 < length of lst then
asPrelude.applescript
concatMap(my treeLeaves, lst)
asPrelude.applescript
|λ|(oNode) of go
asPrelude.applescript
end treeLeaves
asPrelude.applescript
on treeMatches(p, tree)
asPrelude.applescript
property pf : mReturn(p)'s |λ|
asPrelude.applescript
if pf(root of x) then
asPrelude.applescript
concatMap(go, nest of x)
asPrelude.applescript
end treeMatches
asPrelude.applescript
on treeMenu(tree)
asPrelude.applescript
set menuTitle to root of tree
asPrelude.applescript
set subTrees to nest of tree
asPrelude.applescript
set menuItems to map(my root, subTrees)
asPrelude.applescript
set blnNoSubMenus to {} = concatMap(my nest, subTrees)
asPrelude.applescript
script menuCancelledOrChoiceMade
asPrelude.applescript
on |λ|(statusAndChoices)
asPrelude.applescript
(not my fst(statusAndChoices)) or ({} ≠ my snd(statusAndChoices))
asPrelude.applescript
script choicesOrSubMenu
asPrelude.applescript
on |λ|(choices)
asPrelude.applescript
set k to item 1 of choices
asPrelude.applescript
script match
asPrelude.applescript
k = root of x
asPrelude.applescript
set chosenSubTree to (Just of find(match, subTrees))
asPrelude.applescript
if {} ≠ (nest of chosenSubTree) then
asPrelude.applescript
|Right|(|λ|(chosenSubTree) of go)
asPrelude.applescript
|Right|(choices)
asPrelude.applescript
script nothingFromThisMenu
asPrelude.applescript
Tuple(false, {})
asPrelude.applescript
script selectionsFromThisMenu
asPrelude.applescript
Tuple(true, xs)
asPrelude.applescript
script nextStepInNestedMenu
asPrelude.applescript
on |λ|(statusAndChoice)
asPrelude.applescript
either(nothingFromThisMenu, selectionsFromThisMenu, ¬
asPrelude.applescript
bindLR(showMenuLR(blnNoSubMenus, menuTitle, menuItems), ¬
asPrelude.applescript
choicesOrSubMenu))
asPrelude.applescript
snd(|until|(menuCancelledOrChoiceMade, ¬
asPrelude.applescript
nextStepInNestedMenu, ¬
asPrelude.applescript
Tuple(true, {}))) -- (Status, Choices) pair
asPrelude.applescript
end treeMenu
asPrelude.applescript
on truncate(x)
asPrelude.applescript
item 1 of properFraction(x)
asPrelude.applescript
end truncate
asPrelude.applescript
on tupleFromList(xs)
asPrelude.applescript
if 1 < lng then
asPrelude.applescript
if 2 < lng then
asPrelude.applescript
set strSuffix to lng as string
asPrelude.applescript
set strSuffix to ""
asPrelude.applescript
script kv
asPrelude.applescript
insertDict((i as string), x, a)
asPrelude.applescript
foldl(kv, {type:"Tuple" & strSuffix}, xs) & {length:lng}
asPrelude.applescript
end tupleFromList
asPrelude.applescript
on typeName(x)
asPrelude.applescript
set mb to lookupDict((class of x) as string, ¬
asPrelude.applescript
{|list|:"List", |integer|:"Int", |real|:"Float", |text|:¬ "String", |string|:"String", |record|:¬ "Record", |boolean|:"Bool", |handler|:"(a -> b)", |script|:"(a -> b"})
asPrelude.applescript
"Bottom"
asPrelude.applescript
set k to Just of mb
asPrelude.applescript
if k = "Record" then
asPrelude.applescript
if keys(x) contains "type" then
asPrelude.applescript
type of x
asPrelude.applescript
"Dict"
asPrelude.applescript
k
asPrelude.applescript
end typeName
asPrelude.applescript
on unDigits(ds)
asPrelude.applescript
10 * a + x
asPrelude.applescript
foldl(go, 0, ds)
asPrelude.applescript
end unDigits
asPrelude.applescript
on unQuoted(s)
asPrelude.applescript
34 = id of x
asPrelude.applescript
dropAround(p, s)
asPrelude.applescript
end unQuoted
asPrelude.applescript
on uncons(xs)
asPrelude.applescript
if 0 = lng then
asPrelude.applescript
if (2 ^ 29 - 1) as integer > lng then
asPrelude.applescript
set cs to text items of xs
asPrelude.applescript
Just(Tuple(item 1 of cs, rest of cs))
asPrelude.applescript
Just(Tuple(item 1 of xs, rest of xs))
asPrelude.applescript
set nxt to take(1, xs)
asPrelude.applescript
if {} is nxt then
asPrelude.applescript
Just(Tuple(item 1 of nxt, xs))
asPrelude.applescript
end uncons
asPrelude.applescript
on uncurry(f)
asPrelude.applescript
if 1 < argvLength(f) then
asPrelude.applescript
on |λ|(ab)
asPrelude.applescript
if class of ab is list then
asPrelude.applescript
mReturn(f)'s |λ|(item 1 of ab, item 2 of ab)
asPrelude.applescript
mReturn(f)'s |λ|(|1| of ab, |2| of ab)
asPrelude.applescript
f's |λ|(item 1 of ab)'s |λ|(item 2 of ab)
asPrelude.applescript
f's |λ|(|1| of ab)'s |λ|(|2| of ab)
asPrelude.applescript
end uncurry
asPrelude.applescript
on unfoldForest(f, xs)
asPrelude.applescript
set g to mReturn(f)
asPrelude.applescript
unfoldTree(g, x)
asPrelude.applescript
map(result, xs)
asPrelude.applescript
end unfoldForest
asPrelude.applescript
on unfoldTree(f, b)
asPrelude.applescript
set tpl to g's |λ|(b)
asPrelude.applescript
Node(|1| of tpl, unfoldForest(g, |2| of tpl))
asPrelude.applescript
end unfoldTree
asPrelude.applescript
on unfoldl(f, v)
asPrelude.applescript