On 03/11/16 16:18, Fillmore wrote:
>
> Hi there, apologies for the generic question. Here is my problem let's
> say that I have a list of lists of strings.
>
> list1:#strings are sort of similar to one another
>
> my_nice_string_blabla
> my_nice_string_blqbli
> my_nice_string_bl0bla
>
On Thursday, November 3, 2016 at 11:08:34 AM UTC+1, Heli wrote:
> Hi,
>
> I have a question about data interpolation using python. I have a big ascii
> file containg data in the following format and around 200M points.
>
> id, xcoordinate, ycoordinate, zcoordinate
>
> then I have a second fil
> If slice assignment is done as I hope it will optimize remain memory
operations.
Bad news.
http://stackoverflow.com/questions/4948293/python-slice-assignment-memory-usage/4948508#4948508
> If you want something like C++ move semantics, use C++.
I don't see anything like this in my proposal. I
On Fri, 4 Nov 2016 08:34 am, Chris Angelico wrote:
[...]
> List comps themselves involve one function call (zero in Py2). What
> you do inside the expression is your business. Do you agree that list
> comps don't have the overhead of opening and closing files?
/tongue firmly in cheek
I'd like to
On Sat, Nov 5, 2016 at 11:42 AM, Steve D'Aprano
wrote:
> On Fri, 4 Nov 2016 08:34 am, Chris Angelico wrote:
>
> [...]
>> List comps themselves involve one function call (zero in Py2). What
>> you do inside the expression is your business. Do you agree that list
>> comps don't have the overhead of
> I don't think that justifies the claim of "especially
> bad", which to me implies something much worse.
Quicksort has built its popularity by performing better by "a mere factor two"
better than mergesort and heapsort. It became the reference sorting algorithm
even though its worst case comple
Hi,All,
background:I have a python api like this,
def a(arg1,arg2,progress_callback = None)
obviously argument progress_callback is a callback function.In python,I can
define a function like this:
def pro_call(prog_arg1,prog_arg2):
#do something with arg1 & arg2
