git.iko.soy/urbit.org
on fd4ee29 help sign in
urbit.org/docs/programming/hoon/exercises/data-structures.md
22 lines 504 B history raw
1---
2sort: 4
3comments: true
4---
6# Sets, Maps, and Queues
8Sets are constructed with `++silt`. A set is a non-ordered
9collection of unique elements.
11```
12(silt `(list @t)`['urbit' 'arvo' 'hoon' 'arvo' ~])
13```
15We'll refer to this particular set as `s` in the exercises. It
16is of type `(set @t)` since each element is a `@t`.
18The `++in` core contains library functions for dealing with sets.
19For example, `++has:in` checks whether an element is in the set.
20Thus, `(~(has in s) 'arvo')` returns yes.