473,320 Members | 1,991 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,320 software developers and data experts.

Need help porting Perl function

kj


Hi. I'd like to port a Perl function that does something I don't
know how to do in Python. (In fact, it may even be something that
is distinctly un-Pythonic!)

The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).

Can a Python function achieve the same effect? If not, how would
one code a similar functionality in Python? Basically the problem
is to split one list into two according to some criterion.

TIA!

Kynn

--
NOTE: In my address everything before the first period is backwards;
and the last period, and everything after it, should be discarded.
Jun 27 '08 #1
10 1143
Hi. I'd like to port a Perl function that does something I don't
know how to do in Python. (In fact, it may even be something that
is distinctly un-Pythonic!)

The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).

Can a Python function achieve the same effect? If not, how would
one code a similar functionality in Python? Basically the problem
is to split one list into two according to some criterion.
This function will take a list of integers and modify it in place such
that it removes even integers. The removed integers are returned as a
new list (disclaimer: I'm 100% sure it can be done better, more
optimized, etc, etc):

def mod( alist ):
old = alist[:]
ret = [ ]
for i in old:
if i % 2 == 0:
ret.append( alist.pop( alist.index( i ) ) )

return ret

x = range(10,20)

print x
r = mod( x )
print r
print x

HTH,
Daniel
--
Psss, psss, put it down! - http://www.cafepress.com/putitdown
Jun 27 '08 #2
kj
>This function will take a list of integers and modify it in place such
>that it removes even integers. The removed integers are returned as a
new list
<snip>

Great!

Thanks!

kynn

--
NOTE: In my address everything before the first period is backwards;
and the last period, and everything after it, should be discarded.
Jun 27 '08 #3
On Jun 7, 2:42*pm, "Daniel Fetchinson" <fetchin...@googlemail.com>
wrote:
Hi. *I'd like to port a Perl function that does something I don't
know how to do in Python. *(In fact, it may even be something that
is distinctly un-Pythonic!)
The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. *Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).
Can a Python function achieve the same effect? *If not, how would
one code a similar functionality in Python? *Basically the problem
is to split one list into two according to some criterion.

This function will take a list of integers and modify it in place such
that it removes even integers. The removed integers are returned as a
new list (disclaimer: I'm 100% sure it can be done better, more
optimized, etc, etc):

def mod( alist ):
* * old = alist[:]
* * ret = [ ]
* * for i in old:
* * * * if i % 2 == 0:
* * * * * * ret.append( alist.pop( alist.index( i ) ) )

* * return ret

x = range(10,20)

print x
r = mod( x )
print r
print x

HTH,
Daniel
--
Psss, psss, put it down! -http://www.cafepress.com/putitdown
def mod( alist ):
return [ alist.pop( alist.index( x ) ) for x in alist if x % 2 ==
0 ]

alist = range(10,20)
blist = mod( alist )

print alist
print blist

The same thing with list comprehensions.
Jun 27 '08 #4
kj wrote:
Hi. I'd like to port a Perl function that does something I don't
know how to do in Python. (In fact, it may even be something that
is distinctly un-Pythonic!)

The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).
The two solutions thus far use the .index() method, which itself runs in
O(n) time. This means that the provided functions run in O(n^2) time,
which can be a problem if the list is big. I'd go with this:

def partition(alist, criteria):
list1, list2 = [], []
for item in alist:
if criteria(item):
list1.append(item)
else:
list2.append(item)
return (list1, list2)

def mod(alist, criteria=lambda x: x % 2 == 0):
alist[:], blist = partition(alist, criteria)
return blist

>>partition(range(10), lambda x: x % 2 == 0)
([0, 2, 4, 6, 8], [1, 3, 5, 7, 9])
>>l=range(10)
mod(l)
[1, 3, 5, 7, 9]
>>l
[0, 2, 4, 6, 8]
Jun 27 '08 #5
On Jun 7, 1:24*pm, kj <so...@987jk.com.invalidwrote:
The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. *Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).

Can a Python function achieve the same effect? *If not, how would
one code a similar functionality in Python? *Basically the problem
is to split one list into two according to some criterion.
If you want to avoid side-effects completely, return two lists, the
list of matches and the list of non-matches. In this example,
partition creates two lists, and stores all matches in the first list,
and mismatches in the second. (partition assigns to the associated
element of retlists based on False evaluating to 0 and True evaluating
to 1.)

def partition(lst, ifcond):
retlists = ([],[])
for i in lst:
retlists[ifcond(i)].append(i)
return retlists[True],retlists[False]

hasLeadingVowel = lambda x: x[0].upper() in "AEIOU"
matched,unmatched = partition("The quick brown fox jumps over the lazy
indolent dog".split(),
hasLeadingVowel)

print matched
print unmatched

prints:
['over', 'indolent']
['The', 'quick', 'brown', 'fox', 'jumps', 'the', 'lazy', 'dog']

-- Paul
Jun 27 '08 #6
On Jun 8, 6:05 am, eat...@gmail.com wrote:
On Jun 7, 2:42 pm, "Daniel Fetchinson" <fetchin...@googlemail.com>
wrote:
Hi. I'd like to port a Perl function that does something I don't
know how to do in Python. (In fact, it may even be something that
is distinctly un-Pythonic!)
The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).
Can a Python function achieve the same effect? If not, how would
one code a similar functionality in Python? Basically the problem
is to split one list into two according to some criterion.
This function will take a list of integers and modify it in place such
that it removes even integers. The removed integers are returned as a
new list (disclaimer: I'm 100% sure it can be done better, more
optimized, etc, etc):
def mod( alist ):
old = alist[:]
ret = [ ]
for i in old:
if i % 2 == 0:
ret.append( alist.pop( alist.index( i ) ) )
return ret
x = range(10,20)
print x
r = mod( x )
print r
print x
HTH,
Daniel
--
Psss, psss, put it down! -http://www.cafepress.com/putitdown

def mod( alist ):
return [ alist.pop( alist.index( x ) ) for x in alist if x % 2 ==
0 ]

alist = range(10,20)
blist = mod( alist )

print alist
print blist

The same thing with list comprehensions.
Not the same. The original responder was careful not to iterate over
the list which he was mutating.
>>def mod(alist):
.... return [alist.pop(alist.index(x)) for x in alist if x % 2 == 0]
....
>>a = range(10)
print mod(a), a
[0, 2, 4, 6, 8] [1, 3, 5, 7, 9]
>>a = [2,2,2,2,2,2,2,2]
print mod(a), a
[2, 2, 2, 2] [2, 2, 2, 2]
# should be [2, 2, 2, 2, 2, 2, 2, 2] []
Jun 27 '08 #7
On Jun 7, 5:56*pm, John Machin <sjmac...@lexicon.netwrote:
On Jun 8, 6:05 am, eat...@gmail.com wrote:
On Jun 7, 2:42 pm, "Daniel Fetchinson" <fetchin...@googlemail.com>
wrote:
Hi. *I'd like to port a Perl function that does something I don't
know how to do in Python. *(In fact, it may even be something that
is distinctly un-Pythonic!)
The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. *Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).
Can a Python function achieve the same effect? *If not, how would
one code a similar functionality in Python? *Basically the problem
is to split one list into two according to some criterion.
This function will take a list of integers and modify it in place such
that it removes even integers. The removed integers are returned as a
new list (disclaimer: I'm 100% sure it can be done better, more
optimized, etc, etc):
def mod( alist ):
* * old = alist[:]
* * ret = [ ]
* * for i in old:
* * * * if i % 2 == 0:
* * * * * * ret.append( alist.pop( alist.index( i ) ) )
* * return ret
x = range(10,20)
print x
r = mod( x )
print r
print x
HTH,
Daniel
--
Psss, psss, put it down! -http://www.cafepress.com/putitdown
def mod( alist ):
* * return [ alist.pop( alist.index( x ) ) for x in alist if x % 2 ==
0 ]
alist = range(10,20)
blist = mod( alist )
print alist
print blist
The same thing with list comprehensions.

Not the same. The original responder was careful not to iterate over
the list which he was mutating.
>def mod(alist):

... * *return [alist.pop(alist.index(x)) for x in alist if x % 2 == 0]
...>>a = range(10)
>print mod(a), a

[0, 2, 4, 6, 8] [1, 3, 5, 7, 9]>>a = [2,2,2,2,2,2,2,2]
>print mod(a), a

[2, 2, 2, 2] [2, 2, 2, 2]
# should be [2, 2, 2, 2, 2, 2, 2, 2] []
Alas, it appears my understanding of list comprehensions is
significantly less comprehensive than I thought =)
Jun 27 '08 #8
On Jun 8, 8:17 am, eat...@gmail.com wrote:
On Jun 7, 5:56 pm, John Machin <sjmac...@lexicon.netwrote:
On Jun 8, 6:05 am, eat...@gmail.com wrote:
On Jun 7, 2:42 pm, "Daniel Fetchinson" <fetchin...@googlemail.com>
wrote:
Hi. I'd like to port a Perl function that does something I don't
know how to do in Python. (In fact, it may even be something that
is distinctly un-Pythonic!)
The original Perl function takes a reference to an array, removes
from this array all the elements that satisfy a particular criterion,
and returns the list consisting of the removed elements. Hence
this function returns a value *and* has a major side effect, namely
the target array of the original argument will be modified (this
is the part I suspect may be un-Pythonic).
Can a Python function achieve the same effect? If not, how would
one code a similar functionality in Python? Basically the problem
is to split one list into two according to some criterion.
This function will take a list of integers and modify it in place such
that it removes even integers. The removed integers are returned as a
new list (disclaimer: I'm 100% sure it can be done better, more
optimized, etc, etc):
def mod( alist ):
old = alist[:]
ret = [ ]
for i in old:
if i % 2 == 0:
ret.append( alist.pop( alist.index( i ) ) )
return ret
x = range(10,20)
print x
r = mod( x )
print r
print x
HTH,
Daniel
--
Psss, psss, put it down! -http://www.cafepress.com/putitdown
def mod( alist ):
return [ alist.pop( alist.index( x ) ) for x in alist if x % 2 ==
0 ]
alist = range(10,20)
blist = mod( alist )
print alist
print blist
The same thing with list comprehensions.
Not the same. The original responder was careful not to iterate over
the list which he was mutating.
>>def mod(alist):
... return [alist.pop(alist.index(x)) for x in alist if x % 2 == 0]
...>>a = range(10)
>>print mod(a), a
[0, 2, 4, 6, 8] [1, 3, 5, 7, 9]>>a = [2,2,2,2,2,2,2,2]
>>print mod(a), a
[2, 2, 2, 2] [2, 2, 2, 2]
# should be [2, 2, 2, 2, 2, 2, 2, 2] []

Alas, it appears my understanding of list comprehensions is
significantly less comprehensive than I thought =)
It's nothing to do with list comprehensions, which are syntactical
sugar for traditional loops. You could rewrite your list comprehension
in the traditional manner:

def mod(alist):
ret = []
for x in alist:
if x % 2 == 0:
ret.append(alist.pop(alist.index(x))
return ret

and it would still fail for the same reason: mutating the list over
which you are iterating.

At the expense of even more time and memory you can do an easy fix:
change 'for x in alist' to 'for x in alist[:]' so that you are
iterating over a copy.

Alternatively, go back to basics:
>>def modr(alist):
.... ret = []
.... for i in xrange(len(alist) - 1, -1, -1):
.... if alist[i] % 2 == 0:
.... ret.append(alist[i])
.... del alist[i]
.... return ret
....
>>a = [2,2,2,2,2,2,2,2,2]
print modr(a), a
[2, 2, 2, 2, 2, 2, 2, 2, 2] []
>>>
HTH,
John
Jun 27 '08 #9
kj
In <72**********************************@f24g2000prh. googlegroups.comJohn Machin <sj******@lexicon.netwrites:
>It's nothing to do with list comprehensions, which are syntactical
sugar for traditional loops. You could rewrite your list comprehension
in the traditional manner...
and it would still fail for the same reason: mutating the list over
which you are iterating.
I normally deal with this problem by iterating backwards over the
indices. Here's how I coded the function (in "Python-greenhorn
style"):

def cull(list):
culled = []
for i in range(len(list) - 1, -1, -1):
if not_wanted(list[i]):
culled.append(list.pop(i))
return culled

....where not_wanted() is defined elsewhere. (For my purposes at the
moment, the greater generality provided by making not_wanted() a
parameter to cull() was not necessary.)

The specification of the indices at the beginning of the for-loop
looks pretty ignorant, but aside from that I'm happy with it.

Kynn

--
NOTE: In my address everything before the first period is backwards;
and the last period, and everything after it, should be discarded.
Jun 27 '08 #10
kj
In <g2**********@reader2.panix.comkj <so***@987jk.com.invalidwrites:
>In <72**********************************@f24g2000prh. googlegroups.comJohn Machin <sj******@lexicon.netwrites:
>>It's nothing to do with list comprehensions, which are syntactical
sugar for traditional loops. You could rewrite your list comprehension
in the traditional manner...
and it would still fail for the same reason: mutating the list over
which you are iterating.
>I normally deal with this problem by iterating backwards over the
indices. Here's how I coded the function (in "Python-greenhorn
style"):
***BLUSH***

Somehow I missed that John Machin had posted almost the exact same
implementation that I posted in my reply to him.

Reading too fast. Reading too fast.

Kynn

--
NOTE: In my address everything before the first period is backwards;
and the last period, and everything after it, should be discarded.
Jun 27 '08 #11

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

4
by: MegaZone | last post by:
I'm having some issues with PHP DOMXML - in particular the get_elements_by_tagname method. Now, the PGP docs on this are, well, sparse, so maybe I'm just doing something stupid. I thought this...
0
by: Dorthe Luebbert | last post by:
Hi, there is a new(er) version of John McNammara's Excel package for Perl: http://homepage.eircom.net/~jmcnamara/perl/prerel/Spreadsheet-WriteExcel-0.49.7.tar.gz The package writes Excel97...
5
by: Ryan Liu | last post by:
Hi All, Now I am porting CC to GCC and I have some problems. Would you mind tell me some document which have some description how to port CC to GCC ?? Thank you very much. Ryan
5
by: Kenton Groombridge | last post by:
Hi, I previous posted this in a gcc and g++ groups since that is the compiler I am working with, but I didn't get any response. Hopefully these are the right groups for this question. I am...
28
by: Jed | last post by:
Hello to all! I have a couple of projects I intend starting on, and was wondering if someone here could make a suggestion for a good compiler and development environment. My goals are as...
20
by: Xah Lee | last post by:
Sort a List Xah Lee, 200510 In this page, we show how to sort a list in Python & Perl and also discuss some math of sort. To sort a list in Python, use the “sort” method. For example: ...
4
by: Chris Travers | last post by:
Hi all; A few years ago, I set about porting a PHP application from MySQL to PostgreSQL, after realizing that MySQL wasn't going to be able to handle it. In order to do this, I built a light,...
4
by: Stefko | last post by:
After a full day of attemping to port this PERL routine to PHP, I have given up on being able to do this myself, can anybody help? for($y=1;$y<=100;$y++){ $thename="NAME_$y";...
5
KevinADC
by: KevinADC | last post by:
Introduction This discussion of the sort function is targeted at beginners to perl coding. More experienced perl coders will find nothing new or useful. Sorting lists or arrays is a very common...
0
by: DolphinDB | last post by:
Tired of spending countless mintues downsampling your data? Look no further! In this article, youll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
0
by: ryjfgjl | last post by:
ExcelToDatabase: batch import excel into database automatically...
0
by: Vimpel783 | last post by:
Hello! Guys, I found this code on the Internet, but I need to modify it a little. It works well, the problem is this: Data is sent from only one cell, in this case B5, but it is necessary that data...
0
by: jfyes | last post by:
As a hardware engineer, after seeing that CEIWEI recently released a new tool for Modbus RTU Over TCP/UDP filtering and monitoring, I actively went to its official website to take a look. It turned...
0
by: ArrayDB | last post by:
The error message I've encountered is; ERROR:root:Error generating model response: exception: access violation writing 0x0000000000005140, which seems to be indicative of an access violation...
1
by: CloudSolutions | last post by:
Introduction: For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
1
by: Defcon1945 | last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
0
by: af34tf | last post by:
Hi Guys, I have a domain whose name is BytesLimited.com, and I want to sell it. Does anyone know about platforms that allow me to list my domain in auction for free. Thank you
0
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome former...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.