Renamed sorted_by_idx to _sorted_by_idx

astrodendro/dendrogram.py

@@ -12,7 +12,8 @@
 from . import pruning
 from . import six
 
-def sorted_by_idx(d):
+
+def _sorted_by_idx(d):
     return sorted(d, key=lambda s: s.idx)
 
 
@@ -195,7 +196,7 @@ def next_idx():
             adjacent = [structures[a].ancestor for a in adjacent]
 
             # Remove duplicates
-            adjacent = sorted_by_idx(list(set(adjacent)))
+            adjacent = _sorted_by_idx(list(set(adjacent)))
 
             # What happens next depends on how many unique adjacent structures there are
 
@@ -276,7 +277,7 @@ def next_idx():
             print("")  # newline
 
         # Create trunk from objects with no ancestors
-        self.trunk = sorted_by_idx([structure for structure in six.itervalues(structures) if structure.parent is None])
+        self.trunk = _sorted_by_idx([structure for structure in six.itervalues(structures) if structure.parent is None])
 
         # Remove orphan leaves that aren't large enough
         leaves_in_trunk = [structure for structure in self.trunk if structure.is_leaf]