code: def keep_longest(head, update, down_path):
          
          if update is None:
              return 'f'
          if head is None:
              return 's'
  
          return 'f' if len(head) >= len(update) else 's'
docs: Keep longest field among `head` and `update`.