Support python 2.7 as the rest of the project does

Might not be worth the effort

legipy/common.py

@@ -82,17 +82,21 @@ def parse_roman(string):
  return total
 
 
-def find_all_non_nested(parent, *args, bfs=False, **kwargs):
+def find_all_non_nested(parent, *args, **kwargs):
  """ find_all for non-nested elements
 
  I.e. the same semantics as find_all(..., recursive=True),
  except we don’t search children of matched nodes
  """
+ # Indulge python 2 ?
+ bfs = kwargs.pop('bfs', False)
+ kwargs['recursive'] = False
+
  search = [parent]
  found = []
  while search:
  node = search.pop(0 if bfs else -1)
- found_at_node = node.find_all(*args, **kwargs, recursive=False)
+ found_at_node = node.find_all(*args, **kwargs)
  found += found_at_node
  search.extend(child for child in node.children if (
  isinstance(child, Tag) and child not in found_at_node