rearranging map keys to prove sort function
This commit is contained in:
parent
725abe45d5
commit
c5ef11690e
@ -40,7 +40,7 @@
|
||||
|
||||
"Often you will need to get the keys, but the order is undependable"
|
||||
(= (list __ __ __)
|
||||
(sort (keys {2006 "Torino" 2010 "Vancouver" 2014 "Sochi"})))
|
||||
(sort (keys {2010 "Vancouver" 2014 "Sochi" 2006 "Torino"})))
|
||||
|
||||
"You can get the values in a similar way"
|
||||
(= (list "Sochi" "Torino" __)
|
||||
|
Loading…
Reference in New Issue
Block a user