at what complexity, a comparison fails ?
- From: Stef Mientki <stef.mientki@xxxxxxxxx>
- Date: Mon, 31 Dec 2007 11:45:55 +0100
hello,
I had a program that worked perfectly well.
In this program modules were dynamically added,
just by putting the file in a predefined directory.
Now one of the interface mechanisms was to see if some parameter was changed in a an instance,
by comparing the value from the instance with its previous value
This went all well, untill I added a too complex variable,
then the program stopped working, without generating exceptions.
So it seems that comparing a too complex value isn't allowed.
the variable was something like:
A = [ <ndarray>, <ndarray>, ..., [<color>,<color>,...], [<float>, <float>, ... ] ]
So what I need was something like:
if A != A_prev :
... do something
A_prev = A
And this crashes, or at least it doesn't work but also doesn't generate exceptions.
It does seems to work, if A only contains 1 array.
Why am I not allowed to compare A and A_prev ??
And in general, how complex might a list be to make a valid comparison,
or what are the rules ?
thanks,
Stef Mientki
.
- Follow-Ups:
- Re: at what complexity, a comparison fails ?
- From: Hans Nowak
- Re: at what complexity, a comparison fails ?
- From: Zentrader
- Re: at what complexity, a comparison fails ?
- From: Steven D'Aprano
- Re: at what complexity, a comparison fails ?
- From: Marc 'BlackJack' Rintsch
- Re: at what complexity, a comparison fails ?
- Prev by Date: Re: Is there a string function to trim all non-ascii characters out of a string
- Next by Date: Re: Bizarre behavior with mutable default arguments
- Previous by thread: online dating with modern girs near you'r place
- Next by thread: Re: at what complexity, a comparison fails ?
- Index(es):
Relevant Pages
|