# J. Templon NIKHEF, written May 2001 while at University of Georgia.

from treedefs import *
import sys

class dvCounter:
    def __init__(self,prefix):
        self.value = 0
        self.prefix = prefix
    def next(self):
        self.value = self.value + 1
        return self.prefix + repr(self.value)

nodec = dvCounter('N')
refc  = dvCounter('R')
        
def dvref(tnode, fmt):
    indent = len(Lparent)*' '
    fmt.of.write(indent + 'r("' + tnode.name + '")\n')

def dvnode(tnode, fmt):
    indent = len(Lparent)*' '
    fmt.of.write(indent)
    fmt.of.write('l("' + tnode.name + '",n("hmmm",[a("OBJECT","' + tnode.name)
    if tnode.shape :
        fmt.of.write('"),\n')
        fmt.of.write(indent+indent)
        fmt.of.write('a("_GO","' + tnode.shape)
    fmt.of.write('")],[')

def dvb4child(tnode,fmt):
    indent = len(Lparent)*' '
    fmt.of.write('\n' + indent + 'l("' + refc.next() + '",e("fred",[],')

def dvafterchild(fmt):
    indent = len(Lparent)*' '
    fmt.of.write('))')

def dvb4next(fmt):
    indent = len(Lparent)*' '
    fmt.of.write(',\n')
    
def dvafterchildren(fmt):
    indent = len(Lparent)*' '
    fmt.of.write(']))\n')