🌐 Mailman 3 September 2016 - Python-list - python.org

Re: ldap or active directory module
by John Gordon Sept. 9, 2016

Sept. 9, 2016

In <mailman.80.1473414113.2411.python-list(a)python.org> Robert Clove <cloverobert(a)gmail.com> writes: > I want to find if the particular group exist in my active directory Search on the group's DN, specifying SCOPE_BASE as the search scope. If you get a result, then the group exists, otherwise it doesn't. > also another function to find the user in a particular group Do the same search as above, returning the "member" attribute. Get the search result and then inspect the list of returned members. -- John Gordon A is for Amy, who fell down the stairs gordon(a)panix.com B is for Basil, assaulted by bears -- Edward Gorey, "The Gashlycrumb Tinies"

1 0

ldap or active directory module
by Robert Clove Sept. 9, 2016

Sept. 9, 2016

Is it possible to find the following things using python ldap or active directory module I want to find if the particular group exist in my active directory also another function to find the user in a particular group

2 1

Where to store finalized python programs
by ast Sept. 9, 2016

Sept. 9, 2016

hi Is there a web site to store python programs in order to make them accessible for every boby ? I know pypy, but I understood that it is for modules only.

3 2

Re: How to extend a tuple of tuples?
by Rustom Mody Sept. 9, 2016

Sept. 9, 2016

On Friday, September 9, 2016 at 5:58:16 PM UTC+5:30, Chris Angelico wrote: > On Fri, Sep 9, 2016 at 10:21 PM, Frank Millman wrote: > > I am building a series of JOINs for a SQL statement. Some of them can be > > nested - table A is joined from table B is joined from table C. In other > > parts of the same SQL statement, table A could be joined from table D which > > is joined from table E. > > > > For each potential candidate, I need to check if I have already built the > > JOIN. If so, just use it. If not, build it, and update a dictionary to > > indicate that it has been built. > > > > The key to the dictionary is the path to the joined table, which could be > > several levels deep. I build up a tuple to represent the path. Each table > > needs two pieces of information to identify it, so I use a tuple for each > > identifier. > > > > The value portion of the dictionary is simply the alias generated for the > > joined table. I use the alias in the body of the SQL statement. > > Sounds fair enough. A tuple is a pretty reasonable way to do this. > > The other approach would be to craft the aliases directly, as strings. > For instance, your first example could be JOIN_A_B_C, and your second > JOIN_A_D_E. (Sort the table names alphabetically before "_".join()ing > them if you want order to be insignificant.) If the requirement is to have ('A', 'B') == ('B', 'A') the correct data structure to use is set(['A','B']) In this case frozenset for immutability or allowed-for-dict-key requirements [Disclaimer: Ive never used it like this so dont know rough edges; just talking ‘theoretically’!!]

1 0

Re: PEP 492: isn't the "await" redundant?
by Steve D'Aprano Sept. 9, 2016

Sept. 9, 2016

On Fri, 9 Sep 2016 07:28 pm, Chris Angelico wrote: > We don't > have a problem with threading and multiprocessing having very similar > APIs, do we? Yet they exist to solve distinctly different problems. Surely not? I would think that threading and multiprocessing are two distinct implementations of the same problem: how to run two or more chunks of code at the same time. In CPython we usually say "use threads for I/O bound tasks, processes for CPU bound tasks" but that's only because of the GIL. One doesn't need such a distinction in Jython or IronPython. -- Steve “Cheer up,” they said, “things could be worse.” So I cheered up, and sure enough, things got worse.

2 1

Re: How to extend a tuple of tuples?
by Ned Batchelder Sept. 9, 2016

Sept. 9, 2016

On Friday, September 9, 2016 at 6:13:37 AM UTC-4, Frank Millman wrote: > "Frank Millman" wrote in message news:nqtlue$unj$1@blaine.gmane.org... > > > Assume you have a tuple of tuples - > > > a = ((1, 2), (3, 4)) > > > You want to add a new tuple to it, so that it becomes - > > > ((1, 2), (3, 4), (5, 6)) > > Thanks all. > > The one I was looking for was > > a += (5, 6), > > I understand it now - makes perfect sense. I'm curious why you are using a growing tuple, instead of a list. This seems like a much more natural use for a list. --Ned.

3 2

Re: PEP 492: isn't the "await" redundant?
by Marko Rauhamaa Sept. 9, 2016

Sept. 9, 2016

Chris Angelico <rosuav(a)gmail.com>: > FWIW I think it's great that they have similar coding styles. We don't > have a problem with threading and multiprocessing having very similar > APIs, do we? Yet they exist to solve distinctly different problems. Well, Ext4, BtrFS, XFS and ReiserFS have very similar APIs. In fact, they exist to solve the same problems. One day, a file system might emerge that supersedes all other file systems. It's a similar deal between asyncio and threading. The problem space is the same: managing concurrency with almost identical programming models. Marko

2 1

Suggestions to improve a code
by GP Sept. 9, 2016

Sept. 9, 2016

I have a list: shelves2 =[{'Part No': '1', 'Length': 610.0, 'Width': 50.0}, {'Part No': '2', 'Length': 2319.0, 'Width': 465.0 }, {'Part No': '3', 'Length': 5.0,'Width': 465.0}] The length of shelf is calculated as follows: 1. Calculate the maximum length of all items in the shelf. 2. Calculate width of shelf = 610 (in this case). 3. Length of shelf : maxlength of all items + length ( if it less than width of shelf) or width of other items such that length of shelf is less than maximum allowed length. In the above case the length is 2319+50+5 = 2374. I have the following code which generates it correctly but would like to know if there is a better way to write it. I would like to know some smarter way to write the code ( especially if the "for", "if" statements can be avoided). list_1=[] list_2=[] WidthOfShelf = max([x['Width'] for x in shelves2]) MaxLengthOfItem = max([x['Length'] for x in shelves2]) f_LMax=lambda seq, m: [ii for ii in range(0, len(seq)) if seq[ii] ['Length'] >= m][0] MaxLengthOfItem_Index =f_LMax(shelves2,MaxLengthOfItem) current= MaxLengthOfItem list_1=[shelves2[MaxLengthOfItem_Index]] list_2 = [MaxLengthOfItem] del shelves2[MaxLengthOfItem_Index] for i in range(0,len(shelves2)): if shelves2[i]['Length'] <= Width: if (current + shelves2[i]['Length']) or (current + shelves2 [i]['Width'])<= 2438.5 : q_2= min(shelves2[i]['Length'], shelves2[i]['Width']) q=shelves2[i] list_1.append(q) list_2.append(q_2) current += (shelves2[i]['Length'] or shelves2[i] ['Width']) length = sum(list_2) print("LENGTH:",length)

3 2

import pybel in python error code
by talari.gopiprashanth.gopi2＠gmail.com Sept. 9, 2016

Sept. 9, 2016

ValueError Traceback (most recent call last) <ipython-input-6-7eb32949e76e> in <module>() 1 from django.conf import settings ----> 2 import pybel 3 import random, os C:\Miniconda2\lib\site-packages\pybel.py in <module>() 67 _obconv = ob.OBConversion() 68 _builder = ob.OBBuilder() ---> 69 informats = _formatstodict(_obconv.GetSupportedInputFormat()) 70 """A dictionary of supported input formats""" 71 outformats = _formatstodict(_obconv.GetSupportedOutputFormat()) C:\Miniconda2\lib\site-packages\pybel.py in _formatstodict(list) 63 list = [list.get(i) for i in range(list.size())] 64 broken = [x.replace("[Read-only]", "").replace("[Write-only]","").split(" -- ") for x in list] ---> 65 broken = [(x,y.strip()) for x,y in broken] 66 return dict(broken) 67 _obconv = ob.OBConversion() ValueError: need more than 1 value to unpack

2 1

nested loops in Python
by Igor Kozin Sept. 9, 2016

Sept. 9, 2016

Why nested loops are so slow in Python? Is it because new contexts are created? For more details, see http://stackoverflow.com/questions/26611043/numpy-vs-cython-nested-loop-so-… http://stackoverflow.com/questions/39371021/efficient-loop-over-numpy-array Thanks!

3 3