Gustavo Niemeyer <niemeyer at conectiva.com>: > Is it true that the current list comparison algorithm > goes trough every element doing identity comparison, and > if every element in the first list *is* the element at > the same position in the second list, and the list has > the same size, then lists are considered equal? > If that's true, then I belive there's no reason for > not comparing if the first list *is* the second list at > the top of list_richcompare(), right? What if the list contains a NaN? Greg Ewing, Computer Science Dept, +--------------------------------------+ University of Canterbury, | A citizen of NewZealandCorp, a | Christchurch, New Zealand | wholly-owned subsidiary of USA Inc. | greg at cosc.canterbury.ac.nz +--------------------------------------+
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4