Singly-linked list/Traversal: Difference between revisions
→{{header|jq}}: make the map function behave like jq's built-in map
(→{{header|jq}}: empty => remove) |
(→{{header|jq}}: make the map function behave like jq's built-in map) |
||
Line 996:
def items:
while(.; .next) | .item;
def to_singly_linked_list(s):
reduce ([s]|reverse[]) as $item (null; {$item, next:.});
# If f evaluates to empty at any item, that item is removed;
# if f evaluates to more than one item,
def map_singly_linked_list(f): to_singly_linked_list( items | f );</lang>
'''Examples'''
<lang jq>{
|