146f5ddd1ac881fbebdeff83c0be0322bf7e1d74,dit/math/sigmaalgebra.py,,is_sigma_algebra__brute,#Any#Any#,161
Before Change
if X is None:
X = set([])
for cet in F:
X.update(cet)
X = frozenset(X)
After Change
// This works because its not necessary to test countable unions if the
// base set X is finite. One need only consider pairwise unions.
if X is None:
X = frozenset().union(*F)
else:
X = frozenset(X)
for subset1 in F:
In pattern: SUPERPATTERN
Frequency: 4
Non-data size: 4
Instances Project Name: dit/dit
Commit Name: 146f5ddd1ac881fbebdeff83c0be0322bf7e1d74
Time: 2013-09-27
Author: chebee7i@gmail.com
File Name: dit/math/sigmaalgebra.py
Class Name:
Method Name: is_sigma_algebra__brute
Project Name: EducationalTestingService/skll
Commit Name: 6fd93e2722e5073975d190d6b6acb5cc45f64ecf
Time: 2013-02-11
Author: dblanchard@ets.org
File Name: classifier.py
Class Name:
Method Name:
Project Name: CyberReboot/NetworkML
Commit Name: cd83fed56a184063215f932ef768f8834328654c
Time: 2020-04-01
Author: josh@vandervecken.com
File Name: networkml/featurizers/funcs/host.py
Class Name: HostBase
Method Name: HostBase_1
Project Name: dit/dit
Commit Name: 146f5ddd1ac881fbebdeff83c0be0322bf7e1d74
Time: 2013-09-27
Author: chebee7i@gmail.com
File Name: dit/math/sigmaalgebra.py
Class Name:
Method Name: sets2matrix