python Programming Glossary: m_set
efficiently knowing if intersection of two list is empty or not, in python http://stackoverflow.com/questions/2197482/efficiently-knowing-if-intersection-of-two-list-is-empty-or-not-in-python some timings this seems to be a good option to try too m_set set M any x in m_set for x in L If the items in M or L are not.. seems to be a good option to try too m_set set M any x in m_set for x in L If the items in M or L are not hashable you have.. M for x in L 1000 loops best of 3 374 µs per loop timeit m_set frozenset M any x in m_set for x in L 10000 loops best of 3..
|
