2title = "2b: List Logic"
11Produces the indices of all occurrences of `nedl` in `hstk` as a `list` of
29 |= [nedl=(list) hstk=(list)]
35 ?: |(?=($~ n) ?=($~ h))
39 ^$(i +(i), hstk +.hstk, fnd [i fnd])
41 ^$(i +(i), hstk +.hstk)
47 > (fand ~[3] ~[1 2 3])
50 > (fand ~[4] ~[1 2 3])
53 > (fand ~['a'] "cbabab")
56 > (fand "ba" "cbabab")
66Produces the index of the first occurrence of `nedl` in `hstk` as the `unit`
84 |= [nedl=(list) hstk=(list)]
89 ?: |(?=($~ n) ?=($~ h))
95 ^$(i +(i), hstk +.hstk)
101 > (find [3]~ ~[1 2 3])
104 > (find [4]~ ~[1 2 3])
107 > (find ['c']~ "cbabab")
110 > (find "ab" "cbabab")
113 > (find "bab" "cbabab")
122Produces the `list` `a` in reverse order.
163Produces a `list` composed of each consecutive integer starting from `a` and
164ending with `b`. `a` and `b` are themselves included.
182 ?:(=(a +(b)) ~ [a $(a +(a))])
191 > `(list @t)`(gulf 99 106)
200Produces a `list` whose type is a fork of all the contained types in the
201list `a`. Used when you want to make all the types of the elements of a list the
218 |% +- $ ?:(*? ~ [i=(snag 0 a) t=$])
227 [i=1 t=[i=97 t=[i=2 t=[i=98 t=[i=[~ u=10] t=~]]]]]
230 ~[1 97 2 98 [~ u=10]]
232 > =a (limo [1 2 3 ~])
234 [i=1 t=[i=2 t=[i=3 t=~]]]
244Constructs a new `list`, placing `sep` between every element of `lit`.
260 |* [sep=* lit=(list)]
261 =. sep `_?>(?=(^ lit) i.lit)`sep
263 =| out=(list _?>(?=(^ lit) i.lit))
267 $(out [sep i.lit out], lit t.lit)
276 > (join 0 `(list @)`~[1 2 3])
285Produces the length of any `list` `a` as an atom.
311 > (lent [1 2 3 4 ~]))
314 > (lent [1 'a' 2 'b' (some 10) ~])
324Computes the Boolean logical "and" on the results of gate `b` applied to each individual element in `list` `a`.
341 |* [a=(list) b=$-(* ?)]
351 > =a |=(a=@ (lte a 1))
352 > (levy `(list @)`[0 1 2 1 ~] a)
355 > =a |=(a=@ (lte a 3))
356 > (levy `(list @)`[0 1 2 1 ~] a)
367Computes the Boolean logical "or" on the results of applying `gate` `b` to
368every element of `++list` `a`.
381 |* [a=(list) b=$-(* ?)]
391 > =a |=(a=@ (gte a 1))
392 > (lien `(list @)`[0 1 2 1 ~] a)
395 > =a |=(a=@ (gte a 3))
396 > (lien `(list @)`[0 1 2 1 ~]) a)
406Turns a null-terminated tuple into a `list`.
410`a` is a null-terminated tuple.
422 |% +- $ ?~(a ~ ?:(_? i=-.a t=$ $(a +.a)))
431 [i=1 t=[i=2 t=[i=3 t=~]]]
440Passes each member of `list` `a` to gate `b`, which must produce a
441`unit`. Produces a new list with all the results that do not produce
448`b` is a gate that produces a unit.
457 ++ murn :: maybe transform
459 |* [a=(list) b=$-(* (unit))]
471 > =a |=(a=@ ?.((gte a 2) ~ (some (add a 10))))
472 > (murn `(list @)`[0 1 2 3 ~] a)
482Removes elements from list `c` beginning at inclusive index `a`, removing `b`
498 |* [[a=@ b=@] c=(list)]
499 (weld (scag a c) (slag (add a b) c))
505 > (oust [4 5] "good day, urbit!")
508 > (oust [2 2] `(list @)`[1 2 3 4 ~])
518Replicate: produces a `list` containing `a` copies of `b`.
545 ~[%a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a]
548 ~[~s1 ~s1 ~s1 ~s1 ~s1]
550 > `@dr`(roll (reap 5 ~s1) add)
560Right fold: moves right to left across a `list` `a`, recursively slamming
561a binary gate `b` with an element from `a` and an accumulator, producing
562the final value of the accumulator.
564(To "slam" means to call a gate and give it a sample/samples. In this instance,
565`a` is the list of samples that are given to the gate b.)
575The accumulator, which is a noun.
582 |* [a=(list) b=_|=([* *] +<+)]
592 > =sum =|([p=@ q=@] |.((add p q)))
593 > (reel (limo [1 2 3 4 5 ~]) sum)
596 > =a =|([p=@ q=@] |.((sub p q)))
597 > (reel (limo [6 3 1 ~]) a)
600 > (reel (limo [3 6 1 ~]) a)
611Left fold: moves left to right across a list `a`, recursively slamming a
612binary gate `b` with an element from the `list` and an accumulator,
613producing the final value of the accumulator.
615(To "slam" means to call a gate and give it a sample/samples. In this instance,
616`a` is the list of samples that are given to the gate b.)
626The accumulator, which is a noun.
633 |* [a=(list) b=_|=([* *] +<+)]
637 $(a t.a, b b(+<+ (b i.a +<+.b)))
643 > =sum =|([p=@ q=@] |.((add p q)))
644 > (roll (limo [1 2 3 4 5 ~]) sum)
647 > =a =|([p=@ q=@] |.((sub p q)))
648 > (roll (limo [6 3 1 ~]) a)
652 > (roll (limo [1 3 6 ~]) a)
662Accepts an atom `a` and `list` `b`, producing the first `a` elements of
663the front of the list.
673A list of the same type as `b`.
682 ?: |(?=(~ b) =(0 a)) ~
683 [i.b $(b t.b, a (dec a))]
689 > (scag 2 `(list @)`[1 2 3 4 ~])
692 > (scag 10 `(list @)`[1 2 3 4 ~])
702Separates a `list` `a` into two lists - Those elements of `a` who produce
703true when slammed to gate `b` and those who produce `%.n`.
705(To "slam" means to call a gate and give it a sample/samples. In this instance,
706`a` is the list of samples that are given to the gate `b`.)
712`b` is a gate that accepts one argument and produces a flag.
723 |* [a=(list) b=$-(* ?)]
727 ?:((b i.a) [[i.a p.c] q.c] [p.c [i.a q.c]])
734 > =a |=(a=@ (gth a 1))
735 > (skid `(list @)`[0 1 2 3 ~] a)
736 [p=[i=2 t=~[3]] q=[i=0 t=~[1]]]
745Cycles through the members of a list `a`, passing them to a gate `b` and
746producing a list of all of the members that produce `%.y`. Inverse of
753`b` is a gate that accepts one argument and produces a boolean.
764 |* [a=(list) b=$-(* ?)]
768 ?:((b i.a) [i.a $(a t.a)] $(a t.a))
774 > =a |=(a=@ (gth a 1))
775 > (skim `(list @)`[0 1 2 3 ~] a)
784Cycles through the members of `list` `a`, passing them to a gate `b`.
785Produces a list of all of the members that produce `%.n`. Inverse of
792`b` is a gate that accepts one argument and produces a flag.
796A list of the same type as `a`.
803 |* [a=(list) b=$-(* ?)]
807 ?:((b i.a) $(a t.a) [i.a $(a t.a)])
813 > =a |=(a=@ (gth a 1))
814 > (skip `(l)`[0 1 2 3 ~]) a)
824Accepts an atom `a` and list `b`, producing the remaining elements from
835A list of the same type as `b`.
852 > (slag 2 (limo [1 2 3 4 ~]))
854 > (slag 1 (limo [1 2 3 4 ~]))
855 [i=2 t=[i=3 t=[i=4 t=~]]]
864Accepts an atom `a` and a `++list` `b`, producing the element at the index
865of `a`and failing if the list is null. Lists are 0-indexed.
875Produces an element of `b`, or crashes if no element exists at that index.
895 > (snag 0 `(list @ud)`~[1 2 3 4])
905Accepts a `++list` `a` and a noun `b`, producing the list of `b` appended to `a`.
915Produces a list of `b` appended to `a`.
928 > `tape`(zing (snoc `(list tape)`~["a" "bc" "def"] "g"))
930 > (snoc `(list @ud)`~[1 2 3] 4)
939Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item at index `b` replaced with `c`.
952the list of `a` with the item at index `b` replaced with `c`.
958 |* [a/(list) b/@ c/*]
960 (weld (scag b a) [c (slag +(b) a)])
966 > (snap (limo ~[2 3 4]) 1 11)
975Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item `c` inserted at index `b`.
988the list of `a` with the item `c` inserted at index `b`.
994 |* [a/(list) b/@ c/*]
996 (weld (scag b a) [c (slag b a)])
1002 > (into (limo ~[2 3 4]) 1 11)
1011Quicksort: accepts a `++list` `a` and a gate `b` which accepts two nouns and
1012produces a flag. `++sort` then produces a list of the elements of `a`,
1013sorted according to `b`.
1019`b` is a gate that accepts two nouns and produces a boolean.
1028 ++ sort !. :: quicksort
1030 |* [a=(list) b=$-([* *] ?)]
1035 $(a (skim t.a |=(c/_i.a (b c i.a))))
1037 [i.a $(a (skim t.a |=(c/_i.a !(b c i.a))))]
1043 > =a =|([p/@ q/@] |.((gth p q)))
1044 > (sort (limo [0 1 2 3 ~]) a)
1052Gate to list, with state
1054Accepts a `++list` `a`, a gate `b`, and some state `c`. Produces a list with
1055the gate applied to each element of the original list. `b` is called with
1056a tuple -- the head is an element of `a` and the tail is the state `c`, and
1057should produce a tuple of the transformed element and the (potentially
1077 |* [a=(list) b=* c=_|=(^ [** +<+])]
1078 => .(c `$-([_?>(?=(^ a) i.a) _b] [_-:(c) _b])`c)
1079 =/ acc=(list _-:(c)) ~
1080 |- ^- (pair _acc _b)
1084 $(acc [res acc], a t.a)
1090 > %^ spin (limo ~[4 5 6]) :: trivial example -- does nothing with the state
1095 > %^ spin (limo ~[4 5 6]) :: `p` as the index and `q` as the list element
1096 |=([n=@ a=@] [`(pair)`[a n] +(a)])
1098 ~[[p=0 q=4] [p=1 q=5] [p=2 q=6]]
1100 > %^ spin (reap 10 0) :: Create 10 random numbers less than `10`
1101 |=([n=@ rng=_og] (rads:rng 10))
1103 ~[5 5 9 4 1 7 9 9 9 6]
1108`(~(rads og eny) 2)` creates a random number less than `2`, seeding the RNG
1109with entropy (`eny`). The head of the product is the random number, the tail
1110is the continuation of the RNG.
1117Gate to list, with state
1119Accepts a `list` `a` and a gate `b`. `c` is internal state, initially
1120derived by **bunting** the tail of the sample of gate `b`, instead of
1121being passed in explicitly as in `++spin`. Produces a list with the
1122gate applied to each element of the original list. `b` is called with a tuple --
1123the head is an element of `a` and the tail is the state `c`, and should
1124produce a tuple of the transformed element and the (potentially modified)
1142 |* [a=(list) b=_|=(^ [** +<+])]
1149 > %+ spun (limo ~[4 5 6]) :: `p` as the index and `q` as the list element
1150 |=([n=@ a=@] [`(pair)`[a n] +(a)])
1151 ~[[p=0 q=4] [p=1 q=5] [p=2 q=6]]
1153 > =l (limo ~[7 8 9])
1154 > %+ spun (limo ~[4 5 6]) :: joins two lists into a list of pairs
1155 |=([n=@ a=@] [`(pair)`[(snag a l) n] +(a)])
1156 ~[[p=7 q=4] [p=8 q=5] [p=9 q=6]]
1165Similar to `substr` in Javascript: extracts a string infix, beginning at
1166inclusive index `a`, producing `b` number of characters.
1178A list of the same type as `c`.
1184 |* [[a=@ b=@] c=(list)]
1185 (scag +<-> (slag +<-< c))
1191 > (swag [2 5] "roly poly")
1194 > (swag [2 2] (limo [1 2 3 4 ~]))
1204Accepts a `++list` `a` and a gate `b`. Produces a list with the gate applied
1205to each element of the original list.
1222 |* [a=(list) b=gate]
1225 [i=(b i.a) t=$(a t.a)]
1231 > (turn (limo [104 111 111 110 ~]) @t)
1234 > =a |=(a=@ (add a 4))
1235 > (turn (limo [1 2 3 4 ~]) a)
1241`turn` is Hoon's version of 'map' in Haskell.
1248Concatenate two `++list`s `a` and `b`.
1252`a` and `b` are lists.
1259 |* [a=(list) b=(list)]
1260 => .(a ^.(homo a), b ^.(homo b))
1270 ~[~~u ~~r ~~b ~~i ~~t]
1272 > (weld (limo [1 2 ~]) (limo [3 4 ~]))
1282Concatenate two `++list`s `a` and `b` without losing their type information
1311 > (welp "foo" "bar")
1314 > (welp ~[60 61 62] ~[%a %b %c])
1315 [60 61 62 %a %b %c ~]
1317 > ? (welp ~[60 61 62] ~[%a %b %c])
1318 {@ud @ud @ud $a $b $c $~}
1319 [60 61 62 %a %b %c ~]
1321 > (welp [sa+1 so+2 ~] si=3)
1322 [[%sa 1] [%so 2] si=3]
1329Turns a `++list` of lists into a single list by promoting the elements of
1330each sublist into the higher.
1349 (welp +<- $(+< +<+))
1357 > (zing (limo [(limo ['a' 'b' 'c' ~]) (limo ['e' 'f' 'g' ~]) (limo ['h' 'i' 'j' ~]) ~]))
1358 ~['a' 'b' 'c' 'e' 'f' 'g' 'h' 'i' 'j']
1360 > (zing (limo [(limo [1 'a' 2 'b' ~]) (limo [3 'c' 4 'd' ~]) ~]))
1361 ~[1 97 2 98 3 99 4 100]
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list