removeall() in list

[castironpi]

Nothing else should have direct access to the list.


If the list is not too long, that is reasonable. If it -is- long, the
remove operations can be slow, but that's ok if there's not too many.
If the list is long -and- there's a lot of adds/removes, maybe you
want something like an AVL tree.

But items[ item ]= index is the best I can do in Python.

 

[castironpi]

Nothing else should have direct access to the list.

Impossible to guarantee in Python. If you do, the reference to you
does.

 

[Paul Rubin]

Impossible to guarantee in Python. If you do, the reference to you does.

Well, ok. Nothing else should USE that access.

 

[castironpi]

Well, ok. Nothing else should USE that access.

Ah, very agreed. Access directly at your own risk.

Will you engage with me over e-mail to discuss the Locker
implementation I'm developing? Aaron

 

[Paul Rubin]

Will you engage with me over e-mail to discuss the Locker
implementation I'm developing? Aaron

I really can't, sorry. I'm finding it hard enough to follow over the
newsgroup. If you just have a single one of these lists, it's
probably simplest to do what Frederik Lundh suggested. The other
stuff we've discussed is mostly about how to organize having a lot of
them.

 

[castironpi]

I really can't, sorry. I'm finding it hard enough to follow over the
newsgroup. If you just have a single one of these lists, it's
probably simplest to do what Frederik Lundh suggested. The other
stuff we've discussed is mostly about how to organize having a lot of
them.

Highlight from the working solution:

def onfulfill( self, func, *args, **kwargs ):
'''decorator launches its function in separate thread
upon completion of func. todo: cancel and reference
check.'''
locfunc= Ref()
def honorth():
result= self.op( func, *args, **kwargs )
locfunc.val( result )
def prefulfill( func ):
locfunc.val= func
th= threading.Thread( target= honorth )
th.start()
return prefulfill