Given
fncs = [func1, func2, ..., funcN]
args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ?
Unfortunately "apply" takes a tuple of arguments, and there is no
"funcall"[*] in Python.
[*] def funcall(fn, *args):
return fn(*args) 8 1624
On 12 Dec 2003 10:47:50 +0100, Jacek Generowicz <ja**************@cern.ch> wrote: Given
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ? Unfortunately "apply" takes a tuple of arguments, and there is no "funcall"[*] in Python.
[*] def funcall(fn, *args): return fn(*args) fncs = [lambda x,f='func_%s(%%s)'%i:f%x for i in xrange(4)] args = 'zero one two three'.split() map(lambda f,a: f(a), fncs, args)
['func_0(zero)', 'func_1(one)', 'func_2(two)', 'func_3(three)']
I'd probably try a list comprehension
[f(a) for f,a in zip(fncs,args)]
['func_0(zero)', 'func_1(one)', 'func_2(two)', 'func_3(three)']
Regards,
Bengt Richter
Jacek Generowicz <ja**************@cern.ch> wrote in
news:ty*************@pcepsft001.cern.ch: Given
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ?
Well, the way you wrote it isn't actually bad. The obvious alternative
(using a list comprehension) is slightly slower, but there isn't an awful
lot to choos between any of them, I suspect most of the time goes in the
actual f(a) function call. Any of these methods runs at about 300,000
function calls/second on my slow laptop. setup = """import itertools
def fn1(a): pass
fns = [fn1] * 100
args = [0] * 100
""" stmt1 = "result = [ f(a) for (f,a) in itertools.izip(fns, args) ]" stmt2 = "result = [ f(a) for (f,a) in zip(fns, args) ]" t = timeit.Timer(stmt1, setup) t.repeat(3,10000)
[3.5571303056673855, 3.5537404893639177, 3.5594278043718077] t = timeit.Timer(stmt2, setup) t.repeat(3,10000)
[3.893281967400867, 3.87834794645687, 3.8829105375124868] setup = """import itertools
def fn1(a): pass
fns = [fn1] * 1000
args = [0] * 1000
""" t = timeit.Timer(stmt1, setup) t.repeat(3,1000)
[3.3503928571927304, 3.3343195853104248, 3.3495254285111287] t = timeit.Timer(stmt2, setup) t.repeat(3,1000)
[3.8062683944467608, 3.7946001516952492, 3.7881063096007779] stmt3 = "results = map(lambda f,a: f(a), fns, args)" t = timeit.Timer(stmt3, setup) t.repeat(3,1000)
[3.3275902384241363, 3.3010907810909202, 3.3174872784110789]
The f(a) call is taking about half the time in any of these methods, so you
aren't going to get very much improvement whatever you do to the loop.
--
Duncan Booth du****@rcp.co.uk
int month(char *p){return(124864/((p[0]+p[1]-p[2]&0x1f)+1)%12)["\5\x8\3"
"\6\7\xb\1\x9\xa\2\0\4"];} // Who said my code was obscure?
Jacek Generowicz wrote: Given
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ?
I dont know if it will be faster (timeit might tell you this), but what
about something as simple stupid as:
results = []
nbfuns = len(fncs)
for i in range(len):
results.append(fncs[i](args[i]))
Note that you must have at least len(fncs) args.
HTH,
Bruno bo**@oz.net (Bengt Richter) writes: I'd probably try a list comprehension
>>> [f(a) for f,a in zip(fncs,args)]
['func_0(zero)', 'func_1(one)', 'func_2(two)', 'func_3(three)']
Yup, been there, done that, it's slower. (I guess I should have
mentioned that in the original post.)
Jacek Generowicz wrote: Given
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ?
If you can afford to destroy the args list, a tiny speed gain might be in
for you (not verified):
for index, func in enumerate(fncs):
args[index] = func[index]
Peter
"Jacek Generowicz" <ja**************@cern.ch> wrote in message
news:ty*************@pcepsft001.cern.ch... Given
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN]
How should one spell
results = map(lambda f,a: f(a), fncs, args)
in order to get the result most quickly ? Unfortunately "apply" takes a tuple of arguments, and there is no "funcall"[*] in Python.
[*] def funcall(fn, *args): return fn(*args)
Building on a couple of other responses:
Untested code:
fncs = [func1, func2, ..., funcN]
args = [arg1, arg2, ..., argN]
results = []
for function, arguement in zip(fncs, args):
results.append(function(arguement))
Notice the use of zip() to put the two lists together.
I haven't timed it, but removing an extra layer of
function call has got to be faster. Likewise, zip
and tuple unpacking is most likely going to be
faster than indexing every time through the loop.
The append, on the other hand, might slow things
down a bit.
John Roth
"John Roth" <ne********@jhrothjr.com> wrote in
news:vt************@news.supernews.com: Building on a couple of other responses:
Untested code:
fncs = [func1, func2, ..., funcN] args = [arg1, arg2, ..., argN] results = [] for function, arguement in zip(fncs, args): results.append(function(arguement))
Notice the use of zip() to put the two lists together. I haven't timed it, but removing an extra layer of function call has got to be faster. Likewise, zip and tuple unpacking is most likely going to be faster than indexing every time through the loop. The append, on the other hand, might slow things down a bit.
Yes, getting rid of the append does indeed speed things up. On the same
system as I posted timings for the list comprehension, the fastest way I've
found so far is to get rid of the appends by preallocating the list, and to
go for the plain old simple technique of writing a for loop out explicitly.
Using 'enumerate' to avoid the lookup on one of the input lists is nearly
as fast, but not quite. setup = """import itertools
def fn1(a): pass
fns = [fn1] * 1000
args = [0] * 1000
"""
stmt1 = """result = args[:]
for i in range(len(fns)):
result[i] = fns[i](args[i])
""" min(timeit.Timer(stmt1, setup).repeat(3,1000))
2.9747384094916924 stmt3 = "results = map(lambda f,a: f(a), fns, args)" min(timeit.Timer(stmt3, setup).repeat(3,1000))
3.3257092731055309
--
Duncan Booth du****@rcp.co.uk
int month(char *p){return(124864/((p[0]+p[1]-p[2]&0x1f)+1)%12)["\5\x8\3"
"\6\7\xb\1\x9\xa\2\0\4"];} // Who said my code was obscure?
Peter Otten wrote: for index, func in enumerate(fncs): args[index] = func[index]
Oops,
args[index] = func(args[index])
And it's much slower than result.append(func(args[index]), too :-(
Peter This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Vin |
last post by:
Is it possible to access a function defined in python shell from c-code?
For example if I have defined
>>> def c(x):
.... return x*x
....
and defined in some module foo
|
by: Ken Fine |
last post by:
I have a menu system that has nodes that can be opened or closed. In an
effort to make my code more manageable, I programmed a little widget tonight
that keeps track of the open/active item and...
|
by: Mike Darrett |
last post by:
Hello,
First off, I'm a C++ newbie, so please turn your flame guns off. ;)
I'm wondering if this is the correct way to have a function return a
vector:
vector<int> GetVecData()
{...
|
by: Materialised |
last post by:
I am writing a simple function to initialise 3 variables to pesudo
random numbers.
I have a function which is as follows
int randomise( int x, int y, intz)
{
srand((unsigned)time(NULL));
x...
|
by: Jens.Toerring |
last post by:
Hi,
I have a possibly rather stupid question about the order of evaluation
in a statement like this:
result = foo( x ) - bar( y );
How can I make 100% sure that foo(x) is evaluated before...
|
by: pembed2003 |
last post by:
Hi all,
I need to write a function to search and replace part of a char*
passed in to the function. I came up with the following:
char* search_and_replace(char* source,char search,char*...
|
by: Ken Varn |
last post by:
I want to be able to determine my current line, file, and function in my C#
application. I know that C++ has the __LINE__, __FUNCTION__, and __FILE___
macros for getting this, but I cannot find a...
|
by: the_real_remi |
last post by:
Hi,
I'm writing a code that has to be as efficient as possible both in terms of
memory use and execution speed. I'll have to pass a class instance (which is
an 'intelligent' array) to a function...
|
by: bluejack |
last post by:
Ahoy... before I go off scouring particular platforms for specialized
answers, I thought I would see if there is a portable C answer to this
question:
I want a function pointer that, when...
|
by: thinktwice |
last post by:
i have just made a test project :(win32 console)
//file : func.h
#ifndef _FUNC_H_
#define _FUNC_H_
void func1()
{
return;
};
|
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: ryjfgjl |
last post by:
In our work, we often need to import Excel data into databases (such as MySQL, SQL Server, Oracle) for data analysis and processing. Usually, we use database tools like Navicat or the Excel import...
|
by: Charles Arthur |
last post by:
How do i turn on java script on a villaon, callus and itel keypad mobile phone
|
by: aa123db |
last post by:
Variable and constants
Use var or let for variables and const fror constants.
Var foo ='bar';
Let foo ='bar';const baz ='bar';
Functions
function $name$ ($parameters$) {
}
...
|
by: ryjfgjl |
last post by:
If we have dozens or hundreds of excel to import into the database, if we use the excel import function provided by database editors such as navicat, it will be extremely tedious and time-consuming...
|
by: ryjfgjl |
last post by:
In our work, we often receive Excel tables with data in the same format. If we want to analyze these data, it can be difficult to analyze them because the data is spread across multiple Excel files...
|
by: emmanuelkatto |
last post by:
Hi All, I am Emmanuel katto from Uganda. I want to ask what challenges you've faced while migrating a website to cloud.
Please let me know.
Thanks!
Emmanuel
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: Sonnysonu |
last post by:
This is the data of csv file
1 2 3
1 2 3
1 2 3
1 2 3
2 3
2 3
3
the lengths should be different i have to store the data by column-wise with in the specific length.
suppose the i have to...
| |