🌐 Mailman 3 December 2009 - Python-list - python.org

webscrapping ringcentral.com using mechanize
by shrini Jan. 15, 2010

Jan. 15, 2010

Hi, I am trying to scrap the website 'http://service.ringcentral.com' It has a form with three input boxes. When trying to get the form with mechanize, it is throwing the following error. mechanize._mechanize.FormNotFoundError: no form matching name 'login' but, the page has the form with name "login". This form is submitted by javascript. Need your help to fill the form and login to that site using python +mechanize. My code is pasted here. http://pastebin.com/f339461b4 Thanks. Regards, Shrinivasan

3 4

Author of a Python Success Story Needs a Job!
by Andrew Jonathan Fine Jan. 15, 2010

Jan. 15, 2010

To whom it may concern, I am the author of "Honeywell Avoids Documentation Costs with Python and other Open Standards!" I was laid off by Honeywell several months after I had made my presentation in the 2005 Python Conference. Since then I have been unable to find work either as a software engineer or in any other capacity, even at service jobs. I've sent resumes and have been consistently ignored. What I have been doing in the meantime is to be a full time homemaker and parent. As a hobby to keep me sane, I am attempting to retrain part time at home as a jeweler and silversmith, and I sometimes used Python for generating and manipulating code for CNC machines. For my own peace of mind, however, I very much want to be doing software work again because I feel so greatly ashamed to have dedicated my life to learning and working in the field only to now find myself on the scrap heap. I find it highly ironic that my solution is still being advertised on the Python web site but that I, the author of that solution, am now a long term unemployment statistic. Please, if there is anyone out there who needs a highly creative and highly skilled software designer for new and completely original work, then for the love of God I implore you to contact me. A mind is a terrible thing to waste. Sincerely, Andrew Jonathan Fine BEE, MSCS, 15 years experience, 5 in Python, the rest in C/C++, about 1/3 embedded design and device drivers, and 2/3 in applications.

18 25

Difference Between Two datetimes
by W. eWatson Jan. 14, 2010

Jan. 14, 2010

According to one web source, this program: import datetime bree = datetime.datetime(1981, 6, 16, 4, 35, 25) nat = datetime.datetime(1973, 1, 18, 3, 45, 50) difference = bree - nat print "There were", difference, "minutes between Nat and Bree" yields: There were 3071 days, 0:49:35 minutes between Nat and Bree That's fine, but I'd like to start with two dates as strings, as "1961/06/16 04:35:25" and "1973/01/18 03:45:50" How do I get the strings into a shape that will accommodate a difference? For example, t1=datetime.datetime.strptime("2009/01/02 13:01:15","%y/%m/%d %H:%M:%S") doesn't do it. ValueError: time data did not match format: data=2009/01/02 13:01:15 fmt=%y/%m/%d %H:%M:%S

11 29

How to iterate the input over a particular size?
by joy99 Jan. 13, 2010

Jan. 13, 2010

Dear Group, I am encountering a small question. Suppose, I write the following code, input_string=raw_input("PRINT A STRING:") string_to_word=input_string.split() len_word_list=len(string_to_word) if len_word_list>9: rest_words=string_to_word[9:] len_rest_word=len(rest_words) if len_rest_word>9: remaining_words=rest_words[9:] In this program, I am trying to extract first 9 words from an indefinitely long string, until it reaches 0. Am I writing it ok, or should I use while, or lambda? If any one can suggest. Hope you are enjoying a nice vacation of Merry Christmas. If any one is bit free and may guide me up bit. Wishing you a happy day ahead, Best Regards, Subhabrata.

7 9

Join a thread and get the return value of a function
by mattia Jan. 13, 2010

Jan. 13, 2010

Hi all, is there a way in python to get back the value of the function passed to a thread once the thread is finished? Something like pthread_join() in C? Thanks, Mattia

3 5

Re: Problem with Dynamically unloading a module
by Steven D'Aprano Jan. 12, 2010

Jan. 12, 2010

On Wed, 23 Dec 2009 13:37:06 +0100, Jean-Michel Pichavant wrote: > 3/ if you really need to unload the previous module, it's a little bit > tedious. > > import mod1 > del mod1 > sys.modules['mod1'] = None Assigning sys.modules[name] to None is not the same as deleting the entry. None has special meaning to imports from packages, and for modules it is interpreted as meaning that the module doesn't exist. >>> import math >>> del math >>> sys.modules['math'] = None >>> import math Traceback (most recent call last): File "<stdin>", line 1, in <module> ImportError: No module named math > # will unload mod1 assuming mod1 was the only > reference to that module. Which is highly unlikely. Any classes or functions from the module will keep the module alive. > But believe me, you don't want to mess up with the python import > mechanism. Unless you understand how it works. -- Steven

5 6

Re: more efficient?
by Irmen de Jong Jan. 12, 2010

Jan. 12, 2010

On 12/22/09 7:13 AM, Zubin Mithra wrote: > I have the following two implementation techniques in mind. > > def myfunc(mystring): > check = "hello, there " + mystring + "!!!" > print check > > > OR > structure = ["hello, there",,"!!!"] > def myfunc(mystring): > structure[2] = mystring > output = ''.join(mystring) > > i heard that string concatenation is very slow in python; so should i > go for the second approach? could someone tell me why? Would there be > another 'best-practice-style'? > Please help. Thankx in advance! > > cheers!!! > Zubin 1) "premature optimization is the root of all evil." 2) if you're concerned about the speed difference of just a single string concat, you shouldn't be using Python. 3) if you're still concerned, use timeit. 4) string concat only gets slow if the number of strings get large. Personally I'm only using the join-style-concat if I know the number of strings is rather large, or unknown. Otherwise I stick with just the regular string concatenation or string formattting (with % or format). Much more readable. -irmen

2 1

problem with cheetah
by mlowicki Jan. 10, 2010

Jan. 10, 2010

Hi!, i get such error when I try to install cheetah: sudo easy_install cheetah Searching for cheetah Reading http://pypi.python.org/simple/cheetah/ Reading http://www.CheetahTemplate.org/ Reading http://sourceforge.net/project/showfiles.php?group_id=28961 Reading http://www.cheetahtemplate.org/ Best match: Cheetah 2.4.1.linux-x86-64 Downloading http://pypi.python.org/packages/2.6/C/Cheetah/Cheetah-2.4.1.linux-x86_64.ta… Processing Cheetah-2.4.1.linux-x86_64.tar.gz error: Couldn't find a setup script in /tmp/easy_install-uv6Ms_/ Cheetah-2.4.1.linux-x86_64.tar.gz

3 3

Regex help needed!
by Oltmans Jan. 7, 2010

Jan. 7, 2010

Hello,. everyone. I've a string that looks something like ---- lksjdfls <div id ='amazon_345343'> kdjff lsdfs </div> sdjfls <div id = "amazon_35343433">sdfsd</div><div id='amazon_8898'>welcome</div> ---- >From above string I need the digits within the ID attribute. For example, required output from above string is - 35343433 - 345343 - 8898 I've written this regex that's kind of working re.findall("\w+\s*\W+amazon_(\d+)",str) but I was just wondering that there might be a better RegEx to do that same thing. Can you kindly suggest a better/improved Regex. Thank you in advance.

10 12

Re: a huge shared read-only data in parallel accesses -- How? multithreading? multiprocessing?
by Klauss Jan. 7, 2010

Jan. 7, 2010

On Dec 11, 11:00 am, Antoine Pitrou <solip...(a)pitrou.net> wrote: > I was going to suggest memcached but it probably serializes non-atomic > types. Atomic as well. memcached communicates through sockets[3] (albeit possibly unix sockets, which are faster than TCP ones). multiprocessing has shared memory schemes, but does a lot of internal copying (uses ctypes)... and are particularly unhelpful when your shared data is highly structured, since you can't share objects, only primitive types. I finished a patch that pushes reference counters into packed pools. It has lots of drawbacks, but manages to solve this particular problem, if the data is prominently non-numeric (ie: lists and dicts, as mentioned before). Of the drawbacks, perhaps the bigger is a bigger memory footprint - yep... I don't believe there's anything that can be done to change that. It can be optimized, to make the overhead a little less though. This test code[1] consumes roughly 2G of RAM on an x86_64 with python 2.6.1, with the patch, it *should* use 2.3G of RAM (as specified by its output), so you can see the footprint overhead... but better page sharing makes it consume about 6 times less - roughly 400M... which is the size of the dataset. Ie: near-optimal data sharing. This patch[2] has other optimizations intermingled - if there's interest in the patch without those (which are both unproven and nonportable) I could try to separate them. I will have to, anyway, to upload for inclusion into CPython (if I manage to fix the shortcomings, and if it gets approved). The most important shortcomings of the refcount patch are: 1) Tripled memory overhead of reference counting. Before, it was a single Py_ssize_t per object. Now, it's two pointers plus the Py_ssize_t. This could perhaps be optimized (by getting rid of the arena pointer, for instance). 2) Increased code output for Py_INCREF/DECREF. It's small, but it adds up to a lot. Timings on test_decimal.py (a small numeric benchmark I use, which might not be representative at all) shows a 10% performance loss in CPU time. Again, this might be optimized with a lot of work and creativity. 3) Breaks binary compatibility, and in weird cases source compatibility with extension modules. PyObject layout is different, so statically-initialized variables need to stick to using CPython's macros (I've seen cases when they don't), and code should use Py_REFCNT () for accessing the refcount, but many just do ob->ob_refcnt, which will break with the patch. 4) I'm also not really sure (haven't tested) what happens when CPython runs out of memory - I tried real hard not to segfault, even recover nicely, but you know how hard that is... [3] http://code.google.com/p/memcached/wiki/FAQ#How_does_it_compare_to_a_server… [2] http://www.deeplayer.com/claudio/misc/Python-2.6.1-refcount.patch [1] test code below import time from multiprocessing import Pool def usoMemoria(): import os import subprocess pid = os.getpid() cmd = "ps -o vsz=,rss=,share= -p %s --ppid %s" % (pid,pid) p = subprocess.Popen(cmd.split(), stdout=subprocess.PIPE) info = p.stdout.readlines() s = sum( int(r) for v,r,s in map(str.split,map(str.strip, info)) ) return s def f(_): return sum(int(x) for d in huge_global_data for x in d if x != "state") # my sofisticated formula goes here if __name__ == '__main__': huge_global_data = [] for i in xrange(500000): d = {} d[str(i)] = str(i*10) d[str(i+1)] = str(i) d["state"] = 3 huge_global_data.append(d) p = Pool(7) res= list(p.map(f, xrange(20))) print "%.2fM" % (usoMemoria() / 1024.0)

2 2