🌐 Mailman 3 December 2000 - Tutor - python.org

Windons Task tray
by rhicks＠rma.edu July 4, 2001

July 4, 2001

Is it possible to minimize a python program to the task tray area of the taskbar in Windows95/98? Bob pop3.rma.edu

3 2

Re:[Tutor] Where to find example source codes.
by John Murray Jan. 4, 2001

Jan. 4, 2001

> It is said that the best way of learning a programing language > is that you read some example souces and write some by your own. This reminds me of something I've been thinking about for a while, ie; should we be making our individual python project's code available to each other? There must be quite a few scripts in various stages of completion spread throughout the tutor subscribers. As a newbie (to programming as well as python), I would normally be embarrassed about releasing my hideously amateurish code, though I would have no problems sharing it with other list members. Ugly as my code may be, some of it has actually proven to be useful, so surely others here have written useful stuff as well. Making projects available to each other would give those without a project something to get into, and who knows, some stuff might get developed to the point of public release. What do you think? Sorry to sound like an open source evangelist........... Happy New Year Johnno

5 4

Class inheiritance question
by Brad Chandler Jan. 2, 2001

Jan. 2, 2001

I have created a sub class called Positionrlgn of a base class called Position. I've redefinded one of the functions successfully, but now I need to redefine a variable. How do I redefine a value which is set in the __init__ function. For example, my base class starts like this: class Position: def __init__(self, dbrow): self.currentsalary=dbrow[0] my sub class starts like this: class Positionrlgn(projectclass.Position): #currentsalary needs to be redefined here. Can I modify the __init__ function so that only the one value is altered and the rest are left intact?

3 3

list problem
by W.W.van den Broek Jan. 1, 2001

Jan. 1, 2001

Hi all, Trying to make a little "program" for myself, i am working my way through: "Teach yourself python..". Found out that mathematical subject are the topics to begin with in simple programming. I am a psychiatrist so i am used to associative thinking and pattern recognition instead of logical thinking so bare with me please. As a psychiatrist i am doing some research. I wanted to program some simple statistics, like finding the median of a list or a mean, range and quartiles. Lists are probably useful in this, so started making a list in a file: list.txt: l= [n, n1, n2,.....] Next tried to make a program with a sorted list as output #!/usr/local/bin/python x = open("list.txt", "rb") x.read () x.sort () print x Tried different options cannot figure out the problem. Can somebody please enlighten me or point me in a direction, thanks walter W.W. van den Broek e-mail: vandenbroek(a)psyd.azr.nl AZR-Dijkzigt fax: 010-4633217 afdeling psychiatrie tel: 010-4639222 Postbus 2040 e-mail vdbroekw(a)wxs.nl (thuis) 3000 CA Rotterdam homepage: http://home.planet.nl/~vdbroekw

3 3

Re: flattening and clumping lists
by kevin parks Dec. 31, 2000

Dec. 31, 2000

I would love to know how to flatten a list. For example if i write the following code to make a palendrome # mirror.py -- [1,2,3] returns [1,2,3,2,1] # how to make it return [1,2,3,2,1,2,3,2,1] # this should really be a tuple so that it is preserved. l=[1, 2, 3, 4, 5, 6, 7] foo=l[:-1] #copy list, excluding last element foo.reverse() #flip it l.append(foo) #stick it on the end of the other list #we need to flatten it some how in to a single list print l ------- snip ------ but i get in return a list with the appended list tacked on as a single element like: [1, 2, 3, 4, 5, 6, 7, [6, 5, 4, 3, 2, 1]] I thought that there was a thing where you could say flatten(l), but i'll be damned if i can find it now. additionally i would like to make a single list into a list of sublists with a random number of elements with a list like this: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] i might get: [[1], [2], [3, 4, 5], [6, 7], [8,9,10]] but i would need to know how to flatten and clump lists first to be able to do this. I am trying to make some list processing funcs (or eventually classes). I also wonder if such funcs already exists. I found a few that were on the "Vaults" page, but not as much as i'd thought of the flavors i was a seeking. I have many in mind, but am trying to just take a few baby steps to start with. cheers & happy new year, kevin parks, seoul, korea Get FREE Email/Voicemail with 15MB at Lycos Communications at http://comm.lycos.com

1 0

Where to find example source codes?
by bxuef＠freemail.sx.cn Dec. 30, 2000

Dec. 30, 2000

Dear everyone, It is said that the best way of learning a programing language is that you read some example souces and write some by your own. My question is where can I download some good source codes of Python as resources of learning? thank you! ----------------------------------------------------------- »¶ÓÊ¹ÓÃÉœÎ÷µçÐÅÃâ·Ñµç×ÓÓÊŒþÏµÍ³ <http://freemail.sx.cn> ¡£ ÈçÓÐÎÊÌâ£¬ÇëÓë webmaster(a)freemail.sx.cn <mailto:webmaster@freemail.sx.cn> ÁªÏµ¡£ Ð»Ð»ÄúµÄÊ¹ÓÃ£¡

4 3

(No Subject)
by kevin parks Dec. 30, 2000

Dec. 30, 2000

What i am trying to do is perhaps easy for seasoned pythonites, but confronted with a new langauge and a wonderful new array of data types i am a bit baffled as to how to best approach it. I suppose that what i need is a some kind of dictionary and tuple to function as a classic table look up type structure. It is very hard to decribe the problem abstractly so i will just deal with exactly what it is i am trying to do and hope that someone here can get their head around the problem. I have a set of sound samples that are set at discreet values. However i want to use them any tuning scheme. So what i have is an algorhythm that figures out the frequency that i want based on some tuning mombo-jumbo that i wrote. What i need now is to use that frequency (the desired frequency) as a key or index and to do the following: 1. find the frequnce in the list below that is closest. 2. return that frequency and the name of the associated sample. e.g.: if i arrive at a frequency of 31.001 Hz, the code should look up and see that 32.703 is my closest available sample base frequency. It should return that number along with the name of the sample 'sh.forte C_1' so that i now have the desired frequency (31.001), the base frequency (32.703) and the sample name ('sh.forte C_1') which i can then use to calulate a transposition factor (31.001/32.703). What is the best way to do this? In my old language i would use a look-up table to choose the base freq. and then a table with a step function to choose the sample. so that all frequncies from 0-27.500 chose sample1, all frequncies from 27.500 to 32.703 choose sample2, etc. (we want the samples to be responsible for the frequncies, up to and including it as we usually want to transpose down to get our note, as up sounds "micky mouse"). { 'sh.forte A_0' : 27.500 , 'sh.forte C_1' : 32.703 , 'sh.forte D#1' : 38.891 , 'sh.forte F#1' : 46.249 , 'sh.forte A_1' : 55.000 , 'sh.forte C_2' : 65.406 , 'sh.forte D#2' : 77.782 , 'sh.forte F#2' : 92.499 , 'sh.forte A_2' : 110.000 , 'sh.forte C_3' : 130.813 , 'sh.forte D#3' : 155.563 , 'sh.forte F#3' : 184.997 , 'sh.forte A_3' : 220.000 , 'sh.forte C_4' : 261.626 , 'sh.forte D#4' : 311.127, 'sh.forte F#4' : 369.994 , 'sh.forte A_4' : 440.000 , 'sh.forte C_5' : 523.251 , 'sh.forte D#5' : 622.254 , 'sh.forte F#5' : 739.989 , 'sh.forte A_5' : 880.000 , 'sh.forte C_6' : 1046.502 , 'sh.forte D#6' : 1244.508 , 'sh.forte F#6' : 1479.978 , 'sh.forte A_6' : 1760.000 , 'sh.forte C_7' : 2093.005 , 'sh.forte D#7' : 2489.016 , 'sh.forte F#7' : 2959.955 , 'sh.forte A_7' : 3520.000 , 'sh.forte C_8' : 4186.009 } Sorry this is so long winded, i tried to explain the problem as simply as i could. i am just certain this is easier to do with python's built in structures, but can't quite get my head around it just yet. best, kevin parks seoul, korea Get FREE Email/Voicemail with 15MB at Lycos Communications at http://comm.lycos.com

3 2

Compile python to executable binary?
by Chua Kia Loong Dec. 30, 2000

Dec. 30, 2000

Hi, (1) I am wonder can *.py scripts be compile to excutable binary file? If yes, (2) What are the steps that need to taken for compilation. (3) With the compiled binary file, can it be run in the mechine which does not have python installed? Thank you. -- Regards, /Chua Kia Loong Email: klchua(a)apis.dhl.com Asia Pacific Information Services, DHL Worldwide Express, Kuala Lumpur.

3 3

help
by MUSAJADAKISS＠aol.com Dec. 30, 2000

Dec. 30, 2000

can you help me in debugging this to do an a* search although there is no heuristic distance measured but just put any figure there on the textfile pleasee happy newyear """An implementation of A*. Given a start state and a goal state, as well as a heuristic function h(m), return the shortest path between start and goal. In the algorithm, we keep a priority queue, and continuously look at the element with the lowest heuristic cost f(m). We define f(m) = g(m) + h(m), where g(m) is the cost from the start state to m, and h(m) is the heuristic from m to the goal state. """ def myMin(L, f): """Return the index of the minimal element, using f to calculate the cost.""" if len(L) == 0: return None index = 0 minCost = f(L[index]) for i in range(1, len(L)): if f(L[i]) < minCost: index = i mincost = f(L[i]) return index class Node: def __init__(self, name, distance_func): self.name = name self.distance_func = distance_func self.predecessor = None self.neighbors = [] def f(self): return self.g() + self.h() def g(self): if self.getPred() in [None, self]: return 0 return (self.distance_func(self, self.getPred()) + self.getPred().g()) def h(self): return 0 # the heuristic cost from self to the goal def __str__(self): return self.name def __repr__(self): return str(self) def getName(self): return self.name def getPred(self): return self.predecessor def setPred(self, value): self.predecessor = value def getNeighbors(self): return self.neighbors def setNeighbors(self, neighbors): self.neighbors = neighbors class DistanceDictWrapper: def __init__(self, dict): self.dict = dict def __call__(self, m, n): """Return the distance between m and n. Since distance is symmetric, we'll try from m->n, or n->m""" if m == n: return 0 if self.dict.has_key((m.name, n.name)): return self.dict[(m.name, n.name)] if self.dict.has_key((n.name, m.name)): return self.dict[(n.name, m.name)] return None def aStarSearch(nodes, start, goal): start.predecessor = start pqueue = [start] while 1: next_choice_index = myMin(pqueue, lambda n: n.f()) next_choice = pqueue[next_choice_index] ## print "queue:", pqueue # debug ## print "choosing", next_choice, next_choice.f() # debug del pqueue[next_choice_index] if next_choice == goal: break _updatePqueue(next_choice, pqueue) path = _resultHelper(nodes, start, goal) _resetPredLinks(nodes) return path def zeroFunc(): return 0 def _resultHelper(nodes, start, goal): result = [goal] node = goal while node != start: node = node.predecessor result.append(node) result.reverse() return result def _resetPredLinks(nodes): for x in nodes: x.setPred(None) def _updatePqueue(parent, pqueue): children = parent.getNeighbors() for x in children: if (x.predecessor is None or parent.g() + x.distance_func(parent, x) < x.g()): x.predecessor = parent pqueue.append(x) def main(): "TUBEREAD : Main line!" global citysign, NL args = sys.argv[:] ## gets command-line arguments na = len(args) print args[0],"[version 1.0]" print "command-line args. =",na if na < 2: print "normal usage: python tuberead.py <textfile>" args.append(raw_input("please give input textfile name: ")) na = len(args) textname = args[1] textfile = open(textname,"r") if textfile == None: print "Can't open file:",textname lc = 0 ; sc = 0 lines = {} ## empty dictionary (station names) citylist = [] ## empty list (line names) thisline = "Zonk" citydic = {} while 1: textline = textfile.readline() if not textline: break name = string.capwords(string.strip(textline)) sc = sc + 1 if citysign in name: newline = 1 print "city = ", name thiscity = string.replace(name,citysign,'') if not citydic.has_key(thiscity): citydic[thiscity] = [] ## citylist.append(thiscity) else: x = string.split(name,',') ##print x c = x[0] ##print c if not citydic.has_key(c): lc = lc + 1 citydic[c] = [] d = eval(x[1]) t1 = (c,d) citydic[thiscity].append(t1) ## also append symmetric link : t2 = (thiscity,d) citydic[c].append(t2) citylist = citydic.keys() citylist.sort() print citylist print print print len(citylist),"distinct cities read." print ##print citydic while 1: sn = raw_input("Enter city name: ") sn = string.strip(sn) if len(sn) < 1: break ## user hits CRLF to quit loop sd = raw_input("Enter destination city name: ") if len(sd) < 1: break ## user hits CRLF to quit loop sl = citydic.get(sn,[]) ra = len(sl) st = citydic.get(sd,[]) mu = len(st) print sn,sl,ra print sd,st,mu citylist = textfile.readline() dfunc = DistanceDictWrapper(citylist) sq = Node(sn, dfunc) sq.setNeighbors([sn,sd]) node = {} print aStarSearch(sq,sn,node) return 0 if __name__ == '__main__': try: main() except KeyboardInterrupt: sys.exit(1) this is the textfile just put any second figure as the hueristic distance Amsterdam:123 Berlin,650 Brussels,197 Calais,367 Cologne,256 Edinburgh,1093 Hamburg,447 Paris,510 Athens:123,124 Sofia,828,857 Belfast: cork,416 Dublin,167 Kilkenny,277 Berlin: Edinburgh,1696 Hamburg,285 Prague,345 Rostock,222 Stuttgart,629 Warsaw,606 Budapest: Burcharest,852 Prague,537 Sofia,790 Vienna,242 Cork: Kilkenny,148 Dublin: Cork,259 Kilkenny,119 Edinburgh,346 Edinburgh: Copenhagen,479 Hamburg: Rostock,175 Stuttgart,659 Istanbul: Athens,1145 Burcharest,690 Sofia,550 London: Brussele,333 Dublin,430 Cologne,508 Edinburgh,608 Paris,399 Madrid: Bercelona,617 Lisbon,651 Paris,1280 Munich: Berlin,594 Cologne,580 Frankfurt,398 Paris,810 Parague,388 Vienna,430 Oslo: Copenhagen,590 Hamburg,900 stocholm,530 Paris: Brussels,320 Cologne,495 Prague: Frankfurt,512 Hamburg,652 Oslo,1350 Warsaw,616 Vienna,295 Rome: Athens,1140 Milan,606 Vienna: Berlin,640 Warsaw,727 Warsaw: Moscow,1245 Zurich: Milan,292 Munich,303 Paris,592 Vienna,743

1 0

please!!!!!!!!!!!!!!
by MUSAJADAKISS＠aol.com Dec. 30, 2000

Dec. 30, 2000

can you help me in debugging this to do an a* search although there is no heuristic distance measured but just put any figure there on the textfile pleasee happy newyear """An implementation of A*. Given a start state and a goal state, as well as a heuristic function h(m), return the shortest path between start and goal. In the algorithm, we keep a priority queue, and continuously look at the element with the lowest heuristic cost f(m). We define f(m) = g(m) + h(m), where g(m) is the cost from the start state to m, and h(m) is the heuristic from m to the goal state. """ def myMin(L, f): """Return the index of the minimal element, using f to calculate the cost.""" if len(L) == 0: return None index = 0 minCost = f(L[index]) for i in range(1, len(L)): if f(L[i]) < minCost: index = i mincost = f(L[i]) return index class Node: def __init__(self, name, distance_func): self.name = name self.distance_func = distance_func self.predecessor = None self.neighbors = [] def f(self): return self.g() + self.h() def g(self): if self.getPred() in [None, self]: return 0 return (self.distance_func(self, self.getPred()) + self.getPred().g()) def h(self): return 0 # the heuristic cost from self to the goal def __str__(self): return self.name def __repr__(self): return str(self) def getName(self): return self.name def getPred(self): return self.predecessor def setPred(self, value): self.predecessor = value def getNeighbors(self): return self.neighbors def setNeighbors(self, neighbors): self.neighbors = neighbors class DistanceDictWrapper: def __init__(self, dict): self.dict = dict def __call__(self, m, n): """Return the distance between m and n. Since distance is symmetric, we'll try from m->n, or n->m""" if m == n: return 0 if self.dict.has_key((m.name, n.name)): return self.dict[(m.name, n.name)] if self.dict.has_key((n.name, m.name)): return self.dict[(n.name, m.name)] return None def aStarSearch(nodes, start, goal): start.predecessor = start pqueue = [start] while 1: next_choice_index = myMin(pqueue, lambda n: n.f()) next_choice = pqueue[next_choice_index] ## print "queue:", pqueue # debug ## print "choosing", next_choice, next_choice.f() # debug del pqueue[next_choice_index] if next_choice == goal: break _updatePqueue(next_choice, pqueue) path = _resultHelper(nodes, start, goal) _resetPredLinks(nodes) return path def zeroFunc(): return 0 def _resultHelper(nodes, start, goal): result = [goal] node = goal while node != start: node = node.predecessor result.append(node) result.reverse() return result def _resetPredLinks(nodes): for x in nodes: x.setPred(None) def _updatePqueue(parent, pqueue): children = parent.getNeighbors() for x in children: if (x.predecessor is None or parent.g() + x.distance_func(parent, x) < x.g()): x.predecessor = parent pqueue.append(x) def main(): "TUBEREAD : Main line!" global citysign, NL args = sys.argv[:] ## gets command-line arguments na = len(args) print args[0],"[version 1.0]" print "command-line args. =",na if na < 2: print "normal usage: python tuberead.py <textfile>" args.append(raw_input("please give input textfile name: ")) na = len(args) textname = args[1] textfile = open(textname,"r") if textfile == None: print "Can't open file:",textname lc = 0 ; sc = 0 lines = {} ## empty dictionary (station names) citylist = [] ## empty list (line names) thisline = "Zonk" citydic = {} while 1: textline = textfile.readline() if not textline: break name = string.capwords(string.strip(textline)) sc = sc + 1 if citysign in name: newline = 1 print "city = ", name thiscity = string.replace(name,citysign,'') if not citydic.has_key(thiscity): citydic[thiscity] = [] ## citylist.append(thiscity) else: x = string.split(name,',') ##print x c = x[0] ##print c if not citydic.has_key(c): lc = lc + 1 citydic[c] = [] d = eval(x[1]) t1 = (c,d) citydic[thiscity].append(t1) ## also append symmetric link : t2 = (thiscity,d) citydic[c].append(t2) citylist = citydic.keys() citylist.sort() print citylist print print print len(citylist),"distinct cities read." print ##print citydic while 1: sn = raw_input("Enter city name: ") sn = string.strip(sn) if len(sn) < 1: break ## user hits CRLF to quit loop sd = raw_input("Enter destination city name: ") if len(sd) < 1: break ## user hits CRLF to quit loop sl = citydic.get(sn,[]) ra = len(sl) st = citydic.get(sd,[]) mu = len(st) print sn,sl,ra print sd,st,mu citylist = textfile.readline() dfunc = DistanceDictWrapper(citylist) sq = Node(sn, dfunc) sq.setNeighbors([sn,sd]) node = {} print aStarSearch(sq,sn,node) return 0 if __name__ == '__main__': try: main() except KeyboardInterrupt: sys.exit(1) this is the textfile just put any second figure as the hueristic distance Amsterdam:123 Berlin,650 Brussels,197 Calais,367 Cologne,256 Edinburgh,1093 Hamburg,447 Paris,510 Athens:123,124 Sofia,828,857 Belfast: cork,416 Dublin,167 Kilkenny,277 Berlin: Edinburgh,1696 Hamburg,285 Prague,345 Rostock,222 Stuttgart,629 Warsaw,606 Budapest: Burcharest,852 Prague,537 Sofia,790 Vienna,242 Cork: Kilkenny,148 Dublin: Cork,259 Kilkenny,119 Edinburgh,346 Edinburgh: Copenhagen,479 Hamburg: Rostock,175 Stuttgart,659 Istanbul: Athens,1145 Burcharest,690 Sofia,550 London: Brussele,333 Dublin,430 Cologne,508 Edinburgh,608 Paris,399 Madrid: Bercelona,617 Lisbon,651 Paris,1280 Munich: Berlin,594 Cologne,580 Frankfurt,398 Paris,810 Parague,388 Vienna,430 Oslo: Copenhagen,590 Hamburg,900 stocholm,530 Paris: Brussels,320 Cologne,495 Prague: Frankfurt,512 Hamburg,652 Oslo,1350 Warsaw,616 Vienna,295 Rome: Athens,1140 Milan,606 Vienna: Berlin,640 Warsaw,727 Warsaw: Moscow,1245 Zurich: Milan,292 Munich,303 Paris,592 Vienna,743

1 0