[pydotorg-www] Edit & Contribute at wiki.python.org

[Kok Dictionary]

Hello Mam/Sir I am interested to edit & contribute at wiki.python.org. My
wiki account name is Jupiter Debbarma
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Help regarding editing page.

[Mats Wichmann]

On 8/17/20 11:39 AM, Abhishek Singh wrote:
> Yes, Sir. Please change it to AbhishekSingh.

okay, try it now.

___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Help regarding editing page.

[Abhishek Singh]

Yes, Sir. Please change it to AbhishekSingh.


On Mon, 17 Aug 2020, 11:07 p.m. Mats Wichmann,  wrote:

> On 8/17/20 11:33 AM, Abhishek Singh wrote:
> > Hello,
> > I am Abhishek Singh. Recently i have been added as an editor with my
> > wiki account abhi16.2007. My username is AbhishekSingh.
> > I want to create my home page and I want to add a resource in reference
> > book section for regular expression.
> > Kindly allow me the editing permission. Thank you.
>
> Sorry, Abishek, which one is actually the wiki account name?  I added
> you with the first one when you requested, do we just need to change to
> the second? If so hopefully someone can get to that quickly.
>
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Help regarding editing page.

[Mats Wichmann]

On 8/17/20 11:33 AM, Abhishek Singh wrote:
> Hello,
> I am Abhishek Singh. Recently i have been added as an editor with my
> wiki account abhi16.2007. My username is AbhishekSingh.
> I want to create my home page and I want to add a resource in reference
> book section for regular expression. 
> Kindly allow me the editing permission. Thank you.

Sorry, Abishek, which one is actually the wiki account name?  I added
you with the first one when you requested, do we just need to change to
the second? If so hopefully someone can get to that quickly.
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

[pydotorg-www] Help regarding editing page.

[Abhishek Singh]

Hello,
I am Abhishek Singh. Recently i have been added as an editor with my wiki
account abhi16.2007. My username is AbhishekSingh.
I want to create my home page and I want to add a resource in reference
book section for regular expression.
Kindly allow me the editing permission. Thank you.
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] TimeComplexity page on the wiki, pop_intermediate for lists

[M.-A. Lemburg]

I've added you to the editors, so you should be all set...

On 17.08.2020 09:49, Jan Christoph Terasa wrote:
> Hi Marc-Andre,
> 
> sorry, my user name is JanChristophTerasa, using this mail address.
> 
> regards,
> Christoph
> 
> On August 17, 2020 9:42:45 AM GMT+02:00, "M.-A. Lemburg"
>  wrote:
> 
> Hi Christoph,
> 
> we can make you editor, but need your wiki user name in order
> to do so.
> 
> Thanks,
> Marc-Andre
> 
> On 17.08.2020 08:57, Jan Christoph Terasa wrote:
> 
> Moin moin,
> 
> I partook in a discussion on stack overflow regarding time
> complexity of
> popping the first element off of a list:
> 
> https://stackoverflow.com/questions/63445069/what-are-effects-on-overhead-of-using-list-pop0
> 
> As paxdiablo correctly points out there, popping anything except the
> last element involves a memmove/memcpy , which essentially has a
> runtime
> of O(N-k), with k being the argument. Assuming choosing k at random
> uniformly, this is O(N/2) = O(N).
> 
> During the discussion I referred to the Python Wiki page
> https://wiki.python.org/moin/TimeComplexity and the information
> there is
> kind of misleading. It introduces k as the "value of the
> parameter", and
> also states that "The Average Case assumes parameters generated
> uniformly at random" It then shows in the table that average and
> amortized worst time complexity of popping intermediate elements
> from a
> list is O(k). From my understanding the statement "The Average Case
> assumes parameters generated uniformly at random" is essentially
> what I
> stated above, so the value in the table should *not* depend
> (only) on k,
> but on N, and it should thus be O(N) in both cases.
> 
> I think stating O(k) is misleading, since it looks like the
> complexity
> depends only on k, and thus popping the first element should be
> O(1),
> while in reality it depends on N as well (being N-k), and in the
> "average case" we get O(N) as shown above. In general it could be
> helpful to add a footnote explanation of how pop behaves, since it
> depends both on the size of N and k, and it certainly is not
> proportional to k, quite the contrary.
> 
> 
> 
> If you are willing to give me edit permissions for that page I
> can help
> with some suggestions (I hope that page has a "Discussion"
> subpage to
> "stage" some proposed changes first).
> 
> 
> kind regards,
> Christoph Terasa
> 
> 
> pydotorg-www mailing list
> pydotorg-www@python.org
> https://mail.python.org/mailman/listinfo/pydotorg-www
> 
> 
> -- 
> Diese Nachricht wurde von meinem Android-Mobiltelefon mit K-9 Mail
> gesendet.

-- 
Marc-Andre Lemburg
Python Software Foundation
http://www.python.org/psf/
http://www.malemburg.com/
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Enlisting my book in python.org reference book section.

[Abhishek Singh]

Thanks a lot Sir. Thank you so much.

On Mon, 17 Aug 2020, 6:16 p.m. Mats Wichmann,  wrote:

> On 8/16/20 6:59 AM, Abhishek Singh wrote:
> > Hello Python,
> > This is Asst.Professor Abhishek Singh. My wiki account is abhi16.2007. I
> > have recently created it. I am learning it at the moment that how can I
> > contribute through it.
> > I have written a book "Simplifying Regular Expression using Python:
> > Learn Regex Like Never Before."
> > It's on Amazon and Bookauthority.org has rated it in top 10 books of
> > 2020 in the concerned topic. It's a good book for beginners.
>
> you've been added as an editor.
>
>
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Enlisting my book in python.org reference book section.

[Mats Wichmann]

On 8/16/20 6:59 AM, Abhishek Singh wrote:
> Hello Python,
> This is Asst.Professor Abhishek Singh. My wiki account is abhi16.2007. I
> have recently created it. I am learning it at the moment that how can I
> contribute through it.
> I have written a book "Simplifying Regular Expression using Python:
> Learn Regex Like Never Before."
> It's on Amazon and Bookauthority.org has rated it in top 10 books of
> 2020 in the concerned topic. It's a good book for beginners.

you've been added as an editor.

___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] Editing rights

[Chris Angelico]

On Mon, Aug 17, 2020 at 8:20 PM Joris Hoendervangers
 wrote:
>
> Dear receiver,
>
> Hope you are well and safe! Could I please get editing rights to the wiki? 
> Since 2018 I am offering Python trainings in The Netherlands.
> If possible, I would like to list my name to the following page: 
> https://wiki.python.org/moin/PythonTraining
> My wiki name is “JorisHoendervangers”.
>
> Looking forward to hearing from you and many thanks for all your 
> contributions to the community!
>

Cool, go for it! You're an editor.

ChrisA
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

[pydotorg-www] Editing rights

[Joris Hoendervangers]

Dear receiver,

Hope you are well and safe! Could I please get editing rights to the wiki? 
Since 2018 I am offering Python trainings in The Netherlands.
If possible, I would like to list my name to the following page: 
https://wiki.python.org/moin/PythonTraining 

My wiki name is “JorisHoendervangers”. 

Looking forward to hearing from you and many thanks for all your contributions 
to the community!

Kind regards,

Joris Hoendervangers
https://www.pythonsherpa.com



___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] TimeComplexity page on the wiki, pop_intermediate for lists

[Jan Christoph Terasa]

Hi Marc-Andre,

sorry, my user name is JanChristophTerasa, using this mail address.

regards,
Christoph 

On August 17, 2020 9:42:45 AM GMT+02:00, "M.-A. Lemburg"  
wrote:
>Hi Christoph,
>
>we can make you editor, but need your wiki user name in order
>to do so.
>
>Thanks,
>Marc-Andre
>
>On 17.08.2020 08:57, Jan Christoph Terasa wrote:
>> Moin moin,
>> 
>> I partook in a discussion on stack overflow regarding time complexity
>of
>> popping the first element off of a list:
>>
>https://stackoverflow.com/questions/63445069/what-are-effects-on-overhead-of-using-list-pop0
>> 
>> As paxdiablo correctly points out there, popping anything except the
>> last element involves a memmove/memcpy , which essentially has a
>runtime
>> of O(N-k), with k being the argument. Assuming choosing k at random
>> uniformly, this is O(N/2) = O(N).
>> 
>> During the discussion I referred to the Python Wiki page
>> https://wiki.python.org/moin/TimeComplexity and the information there
>is
>> kind of misleading. It introduces k as the "value of the parameter",
>and
>> also states that "The Average Case assumes parameters generated
>> uniformly at random" It then shows in the table that average and
>> amortized worst time complexity of popping intermediate elements from
>a
>> list is O(k). From my understanding the statement "The Average Case
>> assumes parameters generated uniformly at random" is essentially what
>I
>> stated above, so the value in the table should *not* depend (only) on
>k,
>> but on N, and it should thus be O(N) in both cases.
>> 
>> I think stating O(k) is misleading, since it looks like the
>complexity
>> depends only on k, and thus popping the first element should be O(1),
>> while in reality it depends on N as well (being N-k), and in the
>> "average case" we get O(N) as shown above. In general it could be
>> helpful to add a footnote explanation of how pop behaves, since it
>> depends both on the size of N and k, and it certainly is not
>> proportional to k, quite the contrary.
>> 
>> 
>> 
>> If you are willing to give me edit permissions for that page I can
>help
>> with some suggestions (I hope that page has a "Discussion" subpage to
>> "stage" some proposed changes first).
>> 
>> 
>> kind regards,
>> Christoph Terasa
>> 
>> ___
>> pydotorg-www mailing list
>> pydotorg-www@python.org
>> https://mail.python.org/mailman/listinfo/pydotorg-www
>> 

-- 
Diese Nachricht wurde von meinem Android-Mobiltelefon mit K-9 Mail gesendet.___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

Re: [pydotorg-www] TimeComplexity page on the wiki, pop_intermediate for lists

[M.-A. Lemburg]

Hi Christoph,

we can make you editor, but need your wiki user name in order
to do so.

Thanks,
Marc-Andre

On 17.08.2020 08:57, Jan Christoph Terasa wrote:
> Moin moin,
> 
> I partook in a discussion on stack overflow regarding time complexity of
> popping the first element off of a list:
> https://stackoverflow.com/questions/63445069/what-are-effects-on-overhead-of-using-list-pop0
> 
> As paxdiablo correctly points out there, popping anything except the
> last element involves a memmove/memcpy , which essentially has a runtime
> of O(N-k), with k being the argument. Assuming choosing k at random
> uniformly, this is O(N/2) = O(N).
> 
> During the discussion I referred to the Python Wiki page
> https://wiki.python.org/moin/TimeComplexity and the information there is
> kind of misleading. It introduces k as the "value of the parameter", and
> also states that "The Average Case assumes parameters generated
> uniformly at random" It then shows in the table that average and
> amortized worst time complexity of popping intermediate elements from a
> list is O(k). From my understanding the statement "The Average Case
> assumes parameters generated uniformly at random" is essentially what I
> stated above, so the value in the table should *not* depend (only) on k,
> but on N, and it should thus be O(N) in both cases.
> 
> I think stating O(k) is misleading, since it looks like the complexity
> depends only on k, and thus popping the first element should be O(1),
> while in reality it depends on N as well (being N-k), and in the
> "average case" we get O(N) as shown above. In general it could be
> helpful to add a footnote explanation of how pop behaves, since it
> depends both on the size of N and k, and it certainly is not
> proportional to k, quite the contrary.
> 
> 
> 
> If you are willing to give me edit permissions for that page I can help
> with some suggestions (I hope that page has a "Discussion" subpage to
> "stage" some proposed changes first).
> 
> 
> kind regards,
> Christoph Terasa
> 
> ___
> pydotorg-www mailing list
> pydotorg-www@python.org
> https://mail.python.org/mailman/listinfo/pydotorg-www
> 
___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www

[pydotorg-www] TimeComplexity page on the wiki, pop_intermediate for lists

[Jan Christoph Terasa]

Moin moin,

I partook in a discussion on stack overflow regarding time complexity of
popping the first element off of a list:
https://stackoverflow.com/questions/63445069/what-are-effects-on-overhead-of-using-list-pop0

As paxdiablo correctly points out there, popping anything except the
last element involves a memmove/memcpy , which essentially has a runtime
of O(N-k), with k being the argument. Assuming choosing k at random
uniformly, this is O(N/2) = O(N).

During the discussion I referred to the Python Wiki page
https://wiki.python.org/moin/TimeComplexity and the information there is
kind of misleading. It introduces k as the "value of the parameter", and
also states that "The Average Case assumes parameters generated
uniformly at random" It then shows in the table that average and
amortized worst time complexity of popping intermediate elements from a
list is O(k). From my understanding the statement "The Average Case
assumes parameters generated uniformly at random" is essentially what I
stated above, so the value in the table should *not* depend (only) on k,
but on N, and it should thus be O(N) in both cases.

I think stating O(k) is misleading, since it looks like the complexity
depends only on k, and thus popping the first element should be O(1),
while in reality it depends on N as well (being N-k), and in the
"average case" we get O(N) as shown above. In general it could be
helpful to add a footnote explanation of how pop behaves, since it
depends both on the size of N and k, and it certainly is not
proportional to k, quite the contrary.



If you are willing to give me edit permissions for that page I can help
with some suggestions (I hope that page has a "Discussion" subpage to
"stage" some proposed changes first).


kind regards,
Christoph Terasa

___
pydotorg-www mailing list
pydotorg-www@python.org
https://mail.python.org/mailman/listinfo/pydotorg-www