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

Re: listdir
by Smith Sept. 5, 2016

Sept. 5, 2016

On 05/09/2016 17:57, jmp wrote: > > Is that what you're expecting ? > A slightly different version: > > import glob, os > > a = input("search for files with the extension .py into directory: ") > print glob.glob(os.path.join(a, '*.py')) > > jm Thank you Sorry, but i'm newbie :-(

1 0

Re: Extend unicodedata with a name/pattern/regex search for character entity references?
by Ned Batchelder Sept. 5, 2016

Sept. 5, 2016

On Monday, September 5, 2016 at 2:15:58 AM UTC-4, Thomas 'PointedEars' Lahn wrote: > How can I trust a person > who does not even have the decency and the courage to stand by their > statements with their real name? Feel free to ignore people you don't trust. We'll help them. --Ned.

1 0

Re: Would like some thoughts on a grouped iterator.
by Jussi Piitulainen Sept. 5, 2016

Sept. 5, 2016

Peter Otten writes: > Jussi Piitulainen wrote: [- -] >> while more: >> yield gp() [- -] > As usual I couldn't stop and came up with something very similar: [- -] > while more: > g = group() > yield g > for _ in g: pass [- -] > The one thing I think you should adopt from this is that the current > group is consumed before yielding the next. Oh yes. I see now that it's also easy to do so.

1 0

Re: Would like some thoughts on a grouped iterator.
by Jussi Piitulainen Sept. 5, 2016

Sept. 5, 2016

Antoon Pardon writes: > I need an interator that takes an already existing iterator and > divides it into subiterators of items belonging together. > > For instance take the following class, wich would check whether > the argument is greater or equal to the previous argument. > > class upchecker: > def __init__(self): > self.prev = None > def __call__(self, arg): > if self.last is None: > self.prev = arg > return True > elif arg >= self.last: > self.prev = arg > return True > else: > self.prev = arg > return False > > So the iterator I need --- I call it grouped --- in combination with > the above class would be used someting like: > > for itr in grouped([8, 10, 13, 11, 2, 17, 5, 12, 7, 14, 4, 6, 15, 16, 19, 9, 0, 1, 3, 18], upchecker()): > print list(itr) > > and the result would be: > > [8, 10, 13] > [11] > [2, 17] > [5, 12] > [7, 14] > [4, 6, 15, 16, 19] > [9] > [0, 1, 3, 18] > > Anyone an idea how I best tackle this? Perhaps something like this when building from scratch (not wrapping itertools.groupby). The inner grouper needs to communicate to the outer grouper whether it ran out of this group but it obtained a next item, or it ran out of items altogether. Your design allows inclusion conditions that depend on more than just the previous item in the group. This doesn't. I think itertools.groupby may raise an error if the caller didn't consumer a group before stepping to a new group. This doesn't. I'm not sure that itertools.groupby does either, and I'm too lazy to check. def gps(source, belong): def gp(): nonlocal prev, more keep = True while keep: yield prev try: this = next(source) except StopIteration: more = False raise prev, keep = this, belong(prev, this) source = iter(source) prev = next(source) more = True while more: yield gp() from operator import eq, lt, gt for data in ([], [3], [3,1], [3,1,4], [3,1,4,1,5,9,2,6]): for tag, op in (('=', eq), ('<', lt), ('>', gt)): print(tag, data, '=>', [list(g) for g in gps(data, op)])

2 1

Re: Would like some thoughts on a grouped iterator.
by Steven D'Aprano Sept. 5, 2016

Sept. 5, 2016

On Monday 05 September 2016 18:46, Antoon Pardon wrote: > I need an interator that takes an already existing iterator and > divides it into subiterators of items belonging together. > > For instance take the following class, wich would check whether > the argument is greater or equal to the previous argument. These sorts of filtering jobs are often so simple that its hardly worth generalising them unless you have a whole lot of them. def group_increasing(seq): it = iter(seq) accum = [] try: last = next(it) except StopIterator: return accum.append(last) for item in it: if item >= last: accum.append(item) else: yield tuple(accum) accum = [item] last = item if accum: yield tuple(accum) If you do need to generalise, using itertools.groupby is probably the right way to do it. -- Steve

1 0

Re: Would like some thoughts on a grouped iterator.
by breamoreboy＠gmail.com Sept. 5, 2016

Sept. 5, 2016

On Monday, September 5, 2016 at 10:42:27 AM UTC+1, Peter Otten wrote: > Antoon Pardon wrote: > > > I need an interator that takes an already existing iterator and > > divides it into subiterators of items belonging together. > > > > For instance take the following class, wich would check whether > > the argument is greater or equal to the previous argument. > > > > class upchecker: > > def __init__(self): > > self.prev = None > > def __call__(self, arg): > > if self.last is None: > > self.prev = arg > > return True > > elif arg >= self.last: > > self.prev = arg > > return True > > else: > > self.prev = arg > > return False > > > > So the iterator I need --- I call it grouped --- in combination with > > the above class would be used someting like: > > > > for itr in grouped([8, 10, 13, 11, 2, 17, 5, 12, 7, 14, 4, 6, 15, 16, 19, > > 9, 0, 1, 3, 18], upchecker()): > > print list(itr) > > > > and the result would be: > > > > [8, 10, 13] > > [11] > > [2, 17] > > [5, 12] > > [7, 14] > > [4, 6, 15, 16, 19] > > [9] > > [0, 1, 3, 18] > > > > Anyone an idea how I best tackle this? > > I always start thinking "There must be an elegant way to do this" and then > end with a clumsy wrapper around itertools.groupby(). > > $ cat grouped.py > from itertools import groupby > > > class Check: > def __init__(self, check): > self.first = True > self.prev = None > self.toggle = False > self.check = check > > def __call__(self, item): > if self.first: > self.first = False > else: > if not self.check(self.prev, item): > self.toggle = not self.toggle > self.prev = item > return self.toggle > > > def grouped(items, check): > return (g for k, g in groupby(items, Check(check))) > > > if __name__ == "__main__": > def upchecker(a, b): > return a < b > > items = [ > 8, 10, 13, 11, 2, 17, 5, 12, 7, 14, 4, 6, 15, 16, 19, 9, 0, 1, 3, 18 > ] > for itr in grouped(items, upchecker): > print(list(itr)) > > $ python grouped.py > [8, 10, 13] > [11] > [2, 17] > [5, 12] > [7, 14] > [4, 6, 15, 16, 19] > [9] > [0, 1, 3, 18] As usual you beat me to it, but I'd spell "upchecker" as "from operator import lt" :)

1 0

Would like some thoughts on a grouped iterator.
by Antoon Pardon Sept. 5, 2016

Sept. 5, 2016

I need an interator that takes an already existing iterator and divides it into subiterators of items belonging together. For instance take the following class, wich would check whether the argument is greater or equal to the previous argument. class upchecker: def __init__(self): self.prev = None def __call__(self, arg): if self.last is None: self.prev = arg return True elif arg >= self.last: self.prev = arg return True else: self.prev = arg return False So the iterator I need --- I call it grouped --- in combination with the above class would be used someting like: for itr in grouped([8, 10, 13, 11, 2, 17, 5, 12, 7, 14, 4, 6, 15, 16, 19, 9, 0, 1, 3, 18], upchecker()): print list(itr) and the result would be: [8, 10, 13] [11] [2, 17] [5, 12] [7, 14] [4, 6, 15, 16, 19] [9] [0, 1, 3, 18] Anyone an idea how I best tackle this?

2 1

Re: Extend unicodedata with a name/pattern/regex search for character entity references?
by alister Sept. 5, 2016

Sept. 5, 2016

On Mon, 05 Sep 2016 08:15:42 +0200, Thomas 'PointedEars' Lahn wrote: > >> So Veek should be able to appease P.E. by calling himself 'Veek "David >> Smith" M'. > > That would not help. “Veek” might be (the transcription of) a given > name or a family name, but “Veek M” is not a real name. [Real name > filter rules need to be adapted, though, because “O” is the > transcription of an East Asian family name.] > How can you possible know that Veek M is not a reall name? what rules for real names have you found that is 100% reliable I suggest you read the following. https://www.kalzumeus.com/2010/06/17/falsehoods-programmers-believe-about- names/ provided people always* refer to themselves the same way then they can be identified, continually changing name to hide ones identity is another issue & there are not many legitimate reasons to do so *personally I don't even care about that. -- Lawn mower blade in your fan need sharpening

1 0

testfixtures 4.10.1 Released!
by Chris Withers Sept. 5, 2016

Sept. 5, 2016

Hi All, I'm pleased to announce the release of testfixtures 4.10.1 featuring the following: - Better docs for TempDirectory.compare(). - Remove the need for expected paths supplied to TempDirectory.compare() to be in sorted order. - Document a good way of restoring stdout when in a debugger. - Fix handling of trailing slashes in TempDirectory.compare(). Thanks to Maximilian Albert for the TempDirectory.compare() docs. The package is on PyPI and a full list of all the links to docs, issue trackers and the like can be found here: https://github.com/Simplistix/testfixtures Any questions, please do ask on the Testing in Python list or on the Simplistix open source mailing list... cheers, Chris

1 0

Re: Extend unicodedata with a name/pattern/regex search for character entity references?
by Veek. M Sept. 5, 2016

Sept. 5, 2016

Thomas 'PointedEars' Lahn wrote: > Gregory Ewing wrote: > >> Larry Hudson wrote: >>> If you continue to read this forum, you will quickly learn to ignore >>> "Pointy-Ears". He rarely has anything worth while to post, and his >>> unique fetish about Real Names shows him to be a hypocrite as well. >> >> To be fair, it's likely that Thomas Lahn is his real >> name, > > Of course it is my real name. > >> and he's never claimed that one shouldn't also >> include a nickname in one's posted identifier. > > In fact, I have recommended doing that several times to people who > only used their nickname in the “From” header field value. > >> So Veek should be able to appease P.E. by calling >> himself 'Veek "David Smith" M'. > > That would not help. “Veek” might be (the transcription of) a given > name or > a family name, but “Veek M” is not a real name. [Real name filter > rules need to be adapted, though, because “O” is the transcription of > an East Asian family name.] > >> The quotes clearly mark the middle part as an invented addition, so >> he's not lying, > > He is lying and would be. That is the main issue. How can I trust a > person who does not even have the decency and the courage to stand by > their statements with their real name? > >> and it looks enough like a Western style real name to avoid >> triggering P.E.'s "fake name" reflex. :-) > > It is not a reflex, but a request for something so basic that no > request should be necessary: showing the simple politeness of > introducing yourself properly when meeting strangers – of not lying to > them about one’s identity – especially if one asks them for help. > Ah! Now that's the root of his troubles, right there. Just in case anyone else is confused, I DON'T feel helped, thankful, grateful when someone answers my posts/questions. I expect you to have a whale of a good time when you post (I've always found it to be rather pleasant and fun to post). However I'm shhing on the subject of Thomas more or less permanently. This sort of humor works only when you're in a good mood and feeling chirpy, but that's not always the case so.. He's more or less Steve's baby anyhow (sorry Steve).

1 0