🌐 Mailman 3 November 2001 - Python-list - python.org

IP address to binary conversion
by Jeroen Wolff May 9, 2020

May 9, 2020

Hi, Can somebody help me (a newbee) to convert an ip address to is 32 bits representation? i would like to store these 32bits interger into a MYSQL database together with the mask. Jeroen

7 12

Einstein's Riddle
by Steve Graham Sept. 17, 2015

Sept. 17, 2015

Who would be interested in using his/her brain (and his computer) to solve the following? Steve Graham === Einstein's Riddle Albert Einstein wrote this riddle this century [ed. 20th century]. He said 98% of the world could not solve it. There are 5 houses in 5 different colors. In each house lives a person with a different nationality. The 5 owners drink a certain type of beverage, smoke a certain brand of cigar, and keep a certain pet. No owners have the same pet, smoke the same brand of cigar or drink the same beverage. The question is: "Who owns the fish?" Hints: The Brit lives in the red house. The Sweed keeps dogs as pets. The Dane drinks tea. The green house is on the left of the white house. The green house's owner drinks coffee. The person who smokes Pall Mall rears birds. The owner of the yellow house smokes Dunhill. The man living in the center house drinks milk. The Norwegian lives in the first house. The man who smokes Blends lives next to the one who keeps cats. The man who keeps the horse lives next to the man who smokes Dunhill. The owner who smokes Bluemasters drinks beer. The German smokes Prince. The Norwegian lives next to the blue house. The man who smokes Blends has a neighbor who drinks water.

36 56

Python to C++ in a pickle
by Larry Whitley April 2, 2015

April 2, 2015

I'd like to pickle an object in python and unpickle it in C++. The object in question is a python dictionary so it will have to go into a C++ map. Has someone done this and is willing to share? Or, is the cPickle source available on the web somewhere? Larry

4 3

OPC for Python ?? (Win32)
by Armin Steinhoff March 24, 2014

March 24, 2014

Hi All, is there an implementation of OPC for Win32 Python available ?? ( http://www.opcfoundation.org ) Regards Armin

2 1

Python OPC -wrapper for data collection, anyone seen it ?
by pekka niiranen March 24, 2014

March 24, 2014

Has anybody seen OPC -wrapper done in python ? In industry OPC -servers are breaking thru. It is a microsoft based technoloqy to gather process information. Many Control System manufacturers have their own OPC -servers. There exists a visual basic wrapper -library so that one write VB - programs to enquire data from OPC -server.Wrapper done to python would be cool. Mark Hammond was not interested, but I am not giving up yet... -pekka-

2 1

Editor for Python
by MANUEL FERNANDEZ PEREZ Jan. 9, 2014

Jan. 9, 2014

Hello, I'm looking for an editor for Python.I' m interested it works on Windows.Can anybody help me? Thank you Manuel

20 23

AIX installation can't find zlib
by Larry Whitley Nov. 3, 2011

Nov. 3, 2011

I've just installed the 1.5.2 source distribution on an AIX system and when I say "import zlib" it responds: >>> import zlib Traceback (innermost last): File "<stdin>", line 1, in ? ImportError: No module named zlib >>> I'm not sure where zlib is supposed to be. It's not in the Lib subdirectory of Python-1.5.2. In the Modules subdirectory I find zlibmodule.c. Nothing germaine in the Objects subdirectory. Looked at config.log and config.status, no mention of zlib. Looking at the sys.path I see: .../ldw/Python-1.5.2> python Python 1.5.2 (#1, Jul 26 2000, 14:21:56) [C] on aix4 Copyright 1991-1995 Stichting Mathematisch Centrum, Amsterdam >>> import sys >>> sys.path ['', '/.../rchland.ibm.com/fs/u1/ldw/Projects/Programs/wtCache', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/plat-aix4', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/lib-tk', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Modules'] >>> Any suggestions? Larry

3 2

TopSort in Python?
by Tim Peters Jan. 21, 2008

Jan. 21, 2008

From: "Tim Peters" <tim_one(a)email.msn.com> [Dinu C. Gherman] > Does anybody have a simple-minded-but-working full-Python > implementation of topsort, the topological sorting algorithm? > Or maybe *any* topsort? I remember only one such algorithm... > python.org/search doesn't reveal any... Searching for "topological" instead turns up two hits there, a few more on DejaNews. Apparently "the std" algorithm I posted years ago predates DejaNews, though. So here's a fancier version ... check-out-aaron's-kjbuckets-too-ly y'rs - tim # topsort takes a list of pairs, where each pair (x, y) is taken to # mean that x <= y wrt some abstract partial ordering. The return # value is a list, representing a total ordering that respects all # the input constraints. # E.g., # topsort( [(1,2), (3,3)] ) # may return any of (but nothing other than) # [3, 1, 2] # [1, 3, 2] # [1, 2, 3] # because those are the permutations of the input elements that # respect the "1 precedes 2" and "3 precedes 3" input constraints. # Note that a constraint of the form (x, x) is really just a trick # to make sure x appears *somewhere* in the output list. # # If there's a cycle in the constraints, say # topsort( [(1,2), (2,1)] ) # then CycleError is raised, and the exception object supports # many methods to help analyze and break the cycles. This requires # a good deal more code than topsort itself! from exceptions import Exception class CycleError(Exception): def __init__(self, sofar, numpreds, succs): Exception.__init__(self, "cycle in constraints", sofar, numpreds, succs) self.preds = None # return as much of the total ordering as topsort was able to # find before it hit a cycle def get_partial(self): return self[1] # return remaining elt -> count of predecessors map def get_pred_counts(self): return self[2] # return remaining elt -> list of successors map def get_succs(self): return self[3] # return remaining elements (== those that don't appear in # get_partial()) def get_elements(self): return self.get_pred_counts().keys() # Return a list of pairs representing the full state of what's # remaining (if you pass this list back to topsort, it will raise # CycleError again, and if you invoke get_pairlist on *that* # exception object, the result will be isomorphic to *this* # invocation of get_pairlist). # The idea is that you can use pick_a_cycle to find a cycle, # through some means or another pick an (x,y) pair in the cycle # you no longer want to respect, then remove that pair from the # output of get_pairlist and try topsort again. def get_pairlist(self): succs = self.get_succs() answer = [] for x in self.get_elements(): if succs.has_key(x): for y in succs[x]: answer.append( (x, y) ) else: # make sure x appears in topsort's output! answer.append( (x, x) ) return answer # return remaining elt -> list of predecessors map def get_preds(self): if self.preds is not None: return self.preds self.preds = preds = {} remaining_elts = self.get_elements() for x in remaining_elts: preds[x] = [] succs = self.get_succs() for x in remaining_elts: if succs.has_key(x): for y in succs[x]: preds[y].append(x) if __debug__: for x in remaining_elts: assert len(preds[x]) > 0 return preds # return a cycle [x, ..., x] at random def pick_a_cycle(self): remaining_elts = self.get_elements() # We know that everything in remaining_elts has a predecessor, # but don't know that everything in it has a successor. So # crawling forward over succs may hit a dead end. Instead we # crawl backward over the preds until we hit a duplicate, then # reverse the path. preds = self.get_preds() from random import choice x = choice(remaining_elts) answer = [] index = {} in_answer = index.has_key while not in_answer(x): index[x] = len(answer) # index of x in answer answer.append(x) x = choice(preds[x]) answer.append(x) answer = answer[index[x]:] answer.reverse() return answer def topsort(pairlist): numpreds = {} # elt -> # of predecessors successors = {} # elt -> list of successors for first, second in pairlist: # make sure every elt is a key in numpreds if not numpreds.has_key(first): numpreds[first] = 0 if not numpreds.has_key(second): numpreds[second] = 0 # if they're the same, there's no real dependence if first == second: continue # since first < second, second gains a pred ... numpreds[second] = numpreds[second] + 1 # ... and first gains a succ if successors.has_key(first): successors[first].append(second) else: successors[first] = [second] # suck up everything without a predecessor answer = filter(lambda x, numpreds=numpreds: numpreds[x] == 0, numpreds.keys()) # for everything in answer, knock down the pred count on # its successors; note that answer grows *in* the loop for x in answer: assert numpreds[x] == 0 del numpreds[x] if successors.has_key(x): for y in successors[x]: numpreds[y] = numpreds[y] - 1 if numpreds[y] == 0: answer.append(y) # following "del" isn't needed; just makes # CycleError details easier to grasp del successors[x] if numpreds: # everything in numpreds has at least one predecessor -> # there's a cycle if __debug__: for x in numpreds.keys(): assert numpreds[x] > 0 raise CycleError(answer, numpreds, successors) return answer

8 9

Win32 drive mapping... aka "net use"
by lshuler＠my-deja.com March 5, 2005

March 5, 2005

Is there an API using Win32 extensions to map a drive share? I have not found one yet and have tried searching "Win32 map drive". I am looking for the equivalent of: net use <share path> If not, is there an alternative other than making a call to system("net use <path>"). Thanks in advance, Lance Sent via Deja.com http://www.deja.com/ Before you buy.

11 15

Gate Oxide thickness of CMOS
by hasi＠rediffmail.com Jan. 2, 2005

Jan. 2, 2005

Hi, I would like to know the following details for a CMOS 1.gate oxide thickness 2.The Number of masks 3.Number of transistors per chip Thanks, Hasi!

3 2