| 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.

Last 100 entries

Re: Python's sad, unimaginative Enum; Re: Some explanation; Some explanation; Printing binary trees sideways; Atoms in python; About "Python's sad, unimaginative Enum"; Frustration Understood; Some good feedback here; this is fucking useless; I agree with you #nt; What would be imaginative?; Re: Enum; Enum; Python's sad, unimaginative Enum; Possible Fix; Work, Exhaustion, Vacation; VirtualBox with Centos 6.3 to 6.4, client; Matasano - Programming Lessons Learned; PDF to HTML; Alternate Substitution; Why RSA Works; Trigger; Dreaming of Death; Example: Tracing; Using Coroutines In Protocol Simulations; Python 3.3 Only; Pure Python SHA1 and MD4 Implementations; Ubuntu on VirtualBox; Starting TOR as a service on OpenSuse 12.3; 1001 Albums; Using fail2ban on OpenSuse 12.3; PPPoE on OpenSuse 12.3; Good Article on Unified Physics; It's Police (Carabineros); Linux Software for Listening to and Exploring Music; Android is Pretty Bad; Lucky Number; 3D Printing for Casting; Cover Art for MPDroid; Who'd a thought the French were so bigoted?; PS Input Signal; Small Problem with Roksan K2 Amp; Roksan K2 Amp + ATC SCM7 Speakers; Do What Makes Sense; Re: Arguing About Tests, Still; Arguing About Tests, Still; Images; Good Article on NY Drummers; Related Bug Report; Getting Python 3.3 and Virtualenv Working in OpenSuse 12.3; How I Am; Awesome video about digital audio; The Difference Between Dimensional and Normalized Databases; The rise of the new Chinese bogeyman; Updated Syntax; Very First Steps to C-ORM; The Ideal User Interface For Music Exploration; Can The Republicans Be Saved?; Rate Limiting Calls to EchoNest; Mods to Cache; Comparing UYKFG and UYKFD/E/F; Someone Else is Concerned; EchoNest-based Playlist Generator for MPD; Example Voting Results; A Heavyweight Python Cache; Identifying Artists with EchoNest; Notes on Pregalex / Pregabalina / Lyrica; The Neil Cowley Trio; Drake - Make for Data; A Reliable Python Web Service; Useful Python Date/Time Library?; Need to Sleep, But this is Good; Command Line Set Difference; Little Details...; Linux Command Line Tricks; AutoTools Tutorial; Hangman Tactics; A Tor Proxy Embedded In A Web Page; Tree (Nested Dicts) in Python; Sleeping at Parties; I Know Someone Who Hurts Other People; Light and Tea; Description of the LCS35 Time Capsule Crypto-Puzzle; Re: I can relate to that ...; I can relate to that ...; Re: It's 2012 Why Does My IDE Suck?; My Own Alternative Medicine; Nice explanation of SVM; Why and How Writing Crypto is Hard; Re: It's 2012 Why Does My IDE Suck?; Incremental Regular Expressions; BBC Map Confused at Pole; Social Media: Ground Zero in the Culture War; My Visit to the Psycho Doc; Learning Modern 3D Graphics Programming; Hope you got some crackers to go with the cheese; Re: But how easy would it be ...; But how easy would it be ...; Powerline Freq Fingerprinting of Audio; The Folly of Scientism; Cheese - Because You're Going to Die Anyway

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

Python Code for ASCII Trees

From: "andrew cooke" <andrew@...>

Date: Sat, 7 Feb 2009 09:10:54 -0300 (CLST)

I doubt I could have written code like this a few years ago.  That's quite
a reassuring feeling - that in some ways you can continue to improve.

Anyway, this is a visitor.  It's the usual visitor pattern (a
catamorphism).  And it's invoked depth-first on a tree of objects.  node()
method is called with arguments that reflect the constructor arguments
used to construct the original tree.


 class GraphStr(Visitor):

   def __init__(self):
     super(GraphStr, self).__init__()
     self.loop = lambda first, rest, name: \
                   [first + name + ' <loop>']

   def node(self, *args, **kargs):
     def fun(first, rest, name, type_=self.type_):
       spec = []
       for arg in args:
	 spec.append(('+- ', '|  ', '', arg))
       for arg in kargs:
	 spec.append(('+- ', '|  ', arg, kargs[arg]))
       if spec:
	 spec[-1] = ('`- ', '   ', spec[-1][2], spec[-1][3])
       yield first + name + (' ' if name else '') + type_.__name__
       for (a, b, c, f) in spec:
	 for line in f(a, b, c):
	   yield rest + line
     return fun

   def arg(self, value):
     return lambda first, rest, name: \
       [first + name + ' ' + repr(value)]

   def postprocess(self, f):
     return '\n'.join(f('', '', ''))


Note the following:

- 'spec' is a list of calls.  Preparing a specification for the calls
  before making them allows the *last* call to be modified simply.

- Generators are used where appropriate (spec cannot be as we need to
  use a -1 index on it to access the last element)

- The walker is depth-first (bottom-up), but the final processing is
  top-down.  So the first stage generates a set of functions that
  implement the second stage (much like implementing foldr in foldl -
  or have I got that backwards? :o)


When applied to the tree generated by this code:

  expression  = Delayed()
  number      = Digit()[1:,...]
  expression += (number | '(' / expression / ')')

It generates:

Delayed
`- matcher Or
   +- Apply
   |  +- function <function add at 0x7f30bf3da738>
   |  +- matcher DepthFirst
   |  |  +- start 1
   |  |  +- stop None
   |  |  +- rest Any
   |  |  |  `- restrict '0123456789'
   |  |  `- first Any
   |  |     `- restrict '0123456789'
   |  +- args False
   |  `- raw True
   `- And
      +- And
      |  +- Literal
      |  |  `- text '('
      |  +- Apply
      |  |  +- function <function add at 0x7f30bef4d380>
      |  |  +- matcher DepthFirst
      |  |  |  +- start 0
      |  |  |  +- stop None
      |  |  |  +- rest Any
      |  |  |  |  `- restrict ' \t'
      |  |  |  `- first Any
      |  |  |     `- restrict ' \t'
      |  |  +- args False
      |  |  `- raw True
      |  `- Delayed
      |     `- matcher <loop>
      +- Apply
      |  +- function <function add at 0x7f30bf176d98>
      |  +- matcher DepthFirst
      |  |  +- start 0
      |  |  +- stop None
      |  |  +- rest Any
      |  |  |  `- restrict ' \t'
      |  |  `- first Any
      |  |     `- restrict ' \t'
      |  +- args False
      |  `- raw True
      `- Literal
         `- text ')'

Andrew

Simple Tree Rewriting

From: "andrew cooke" <andrew@...>

Date: Sat, 7 Feb 2009 09:18:08 -0300 (CLST)

The above is also an example of how some simple tree-rewriting would make
things more efficient by flattening the nested 'And()'.

Andrew

Alternative Representation

From: "andrew cooke" <andrew@...>

Date: Sat, 7 Feb 2009 09:22:55 -0300 (CLST)

And an example of a different visitor applied to the same data.  This is
used for 'repr' (but fails to work completely because the object graph
contains a cycle - hence '<loop>').  The aim here was to get as compact
a representation as possible while remaining readable and not exceeding
a certain width.

The implementation is a nightmare of ad-hoc fixes, but it works...

Delayed(
 matcher=Or(
  Apply(
   function=<function add at 0x7f30eb3ac738>,
   matcher=DepthFirst(
    start=1, stop=None, rest=Any(restrict='0123456789'),
    first=Any(restrict='0123456789')),
   args=False, raw=True),
  And(
   And(
    Literal(text='('),
    Apply(
     function=<function add at 0x7f30eaf1f380>,
     matcher=DepthFirst(
      start=0, stop=None, rest=Any(restrict=' \t'),
      first=Any(restrict=' \t')),
     args=False, raw=True),
    Delayed(matcher=<loop>)),
   Apply(
    function=<function add at 0x7f30eb148d98>,
    matcher=DepthFirst(
     start=0, stop=None, rest=Any(restrict=' \t'),
     first=Any(restrict=' \t')),
    args=False, raw=True),
   Literal(text=')'))))

Too Complicated!

From: andrew cooke <andrew@...>

Date: Tue, 31 May 2011 07:57:06 -0400

Maybe there was a reason for the complexity above, but you can print trees
without needing to construct intermediate functions as above.  See the code at
http://www.acooke.org/cute/ASCIIDispl0.html

(Embarassing that I was apparently so proud of this code, when it seems now
much too complicated for its own good....)

Andrew

Comment on this post