| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

Tomato Chutney v4; Have to add...; Culturally Liberal and Nothing More; Weird Finite / Infinite Result; Your diamond is a beaten up mess; Maths Books; Good Bike Route from Providencia / Las Condes to Panul\; Iain Pears (Author of Complex Plots); Plum Jam; Excellent; More Recently; For a moment I forgot StackOverflow sucked; A Few Weeks On...; Chilean Book Recommendations; How To Write Shared Libraries; Jenny Erpenbeck (Author); Dijkstra, Coins, Tables; Python libraries error on OpenSuse; Deserving Trump; And Smugness; McCloskey Economics Trilogy; cmocka - Mocks for C; Concept Creep (Americans); Futhark - OpenCL Language; Moved / Gone; Fan and USB issues; Burgers in Santiago; The Origin of Icosahedral Symmetry in Viruses; autoenum on PyPI; Jars Explains; Tomato Chutney v3; REST; US Elections and Gender: 24 Point Swing; PPPoE on OpenSuse Leap 42.1; SuperMicro X10SDV-TLN4F/F with Opensuse Leap 42.1; Big Data AI Could Be Very Bad Indeed....; Cornering; Postcapitalism (Paul Mason); Black Science Fiction; Git is not a CDN; Mining of Massive Data Sets; Rachel Kaadzi Ghansah; How great republics meet their end; Raspberry, Strawberry and Banana Jam; Interesting Dead Areas of Math; Later Taste; For Sale; Death By Bean; It's Good!; Tomato Chutney v2; Time ATAC MX 2 Pedals - First Impressions; Online Chilean Crafts; Intellectual Variety; Taste + Texture; Time Invariance and Gauge Symmetry; Jodorowsky; Tomato Chutney; Analysis of Support for Trump; Indian SF; TP-Link TL-WR841N DNS TCP Bug; TP-Link TL-WR841N as Wireless Bridge; Sending Email On Time; Maybe run a command; Sterile Neutrinos; Strawberry and Banana Jam; The Best Of All Possible Worlds; Kenzaburo Oe: The Changeling; Peach Jam; Taste Test; Strawberry and Raspberry Jam; flac to mp3 on OpenSuse 42.1; Also, Sebald; Kenzaburo Oe Interview; Otake (Kitani Minoru) move Black 121; Is free speech in British universities under threat?; I am actually good at computers; Was This Mansplaining?; WebFaction / LetsEncrypt / General Disappointment; Sensible Philosophy of Science; George Ellis; Misplaced Intuition and Online Communities; More Reading About Japan; Visibilty / Public Comments / Domestic Violence; Ferias de Santiago; More (Clearly Deliberate); Deleted Obit Post; And then a 50 yo male posts this...; We Have Both Kinds Of Contributors; Free Springer Books; Books on Religion; Books on Linguistics; Palestinan Electronica; Books In Anthropology; Taylor Expansions of Spacetime; Info on Juniper; Efficient Stream Processing; The Moral Character of Crypto; Hearing Aid Info; Small Success With Go!; Re: Quick message - This link is broken; Adding Reverb To The Echo Chamber

© 2006-2015 Andrew Cooke (site) / post authors (content).

ASCII Display of Trees

From: andrew cooke <andrew@...>

Date: Mon, 30 May 2011 21:50:58 -0400

Here's an example in Python that I hope is simple enough to be used in other
languages too:


  #!/usr/bin/python

  class Tree(object):

      def __init__(self, name, *children):
	  self.name = name
	  self.children = children

      def __str__(self):
	  return '\n'.join(self.tree_lines())

      def tree_lines(self):
	  yield self.name
	  last = self.children[-1] if self.children else None
	  for child in self.children:
	      prefix = '`-' if child is last else '+-'
	      for line in child.tree_lines():
		  yield prefix + line
		  prefix = '  ' if child is last else '| '

      # an alternative without generators
      def tree_lines_2(self):
	  lines = []
	  lines.append(self.name)
	  last = self.children[-1] if self.children else None
	  for child in self.children:
	      prefix = '`-' if child is last else '+-'
	      for line in child.tree_lines():
		  lines.append(prefix + line)
		  prefix = '  ' if child is last else '| '
	  return lines


  tree = Tree('a',
	   Tree('b',
	     Tree('c'),
	     Tree('d',
	       Tree('e')),
	     Tree('f',
	       Tree('g'),
	       Tree('h'))),
	   Tree('i'))

  # this calls __str__() and tree_lines()
  print tree

  # an alternative, avoiding Python-specific idioms
  for line in tree.tree_lines_2():
      print line


The output is (twice):

  > ./tree.py
  a
  +-b
  | +-c
  | +-d
  | | `-e
  | `-f
  |   +-g
  |   `-h
  `-i


Also foo[-1] is the last element of array foo.

Andrew

PS This code in public domain.

Comment on this post