mirror of
https://github.com/rdkit/rdkit.git
synced 2026-06-04 21:54:27 +08:00
- add bulk Dice similarity for SIVs to wrapper - speed up bulk Dice similarity for bit vects - test a bit more
146 lines
2.8 KiB
Python
146 lines
2.8 KiB
Python
# $Id$
|
|
#
|
|
# Copyright (C) 2007,2008 Greg Landrum
|
|
#
|
|
# @@ All Rights Reserved @@
|
|
#
|
|
import RDConfig
|
|
import os,sys,cPickle
|
|
import unittest
|
|
import DataStructs as ds
|
|
|
|
def feq(v1,v2,tol=1e-4):
|
|
return abs(v1-v2)<tol
|
|
class TestCase(unittest.TestCase):
|
|
def setUp(self) :
|
|
pass
|
|
|
|
def test1Int(self):
|
|
"""
|
|
|
|
"""
|
|
v1 = ds.IntSparseIntVect(5)
|
|
self.failUnlessRaises(IndexError,lambda:v1[5])
|
|
v1[0]=1
|
|
v1[2]=2
|
|
v1[3]=3
|
|
self.failUnless(v1==v1)
|
|
self.failUnless(v1.GetLength()==5)
|
|
|
|
v2= ds.IntSparseIntVect(5)
|
|
self.failUnless(v1!=v2)
|
|
v2|=v1
|
|
self.failUnless(v2==v1)
|
|
|
|
v3=v2|v1
|
|
self.failUnless(v3==v1)
|
|
|
|
onVs = v1.GetNonzeroElements()
|
|
self.failUnless(onVs=={0:1,2:2,3:3})
|
|
|
|
|
|
def test2Long(self):
|
|
"""
|
|
|
|
"""
|
|
l=1L<<42
|
|
v1 = ds.LongSparseIntVect(l)
|
|
self.failUnlessRaises(IndexError,lambda:v1[l])
|
|
v1[0]=1
|
|
v1[2]=2
|
|
v1[1L<<35]=3
|
|
self.failUnless(v1==v1)
|
|
self.failUnless(v1.GetLength()==l)
|
|
|
|
v2= ds.LongSparseIntVect(l)
|
|
self.failUnless(v1!=v2)
|
|
v2|=v1
|
|
self.failUnless(v2==v1)
|
|
|
|
v3=v2|v1
|
|
self.failUnless(v3==v1)
|
|
|
|
onVs = v1.GetNonzeroElements()
|
|
self.failUnless(onVs=={0L:1,2L:2,1L<<35:3})
|
|
|
|
def test3Pickle(self):
|
|
"""
|
|
|
|
"""
|
|
l=1L<<42
|
|
v1 = ds.LongSparseIntVect(l)
|
|
self.failUnlessRaises(IndexError,lambda:v1[l+1])
|
|
v1[0]=1
|
|
v1[2]=2
|
|
v1[1L<<35]=3
|
|
self.failUnless(v1==v1)
|
|
|
|
v2= cPickle.loads(cPickle.dumps(v1))
|
|
self.failUnless(v2==v1)
|
|
|
|
v3= ds.LongSparseIntVect(v2.ToBinary())
|
|
self.failUnless(v2==v3)
|
|
self.failUnless(v1==v3)
|
|
|
|
def test4Update(self):
|
|
"""
|
|
|
|
"""
|
|
v1 = ds.IntSparseIntVect(5)
|
|
self.failUnlessRaises(IndexError,lambda:v1[6])
|
|
v1[0]=1
|
|
v1[2]=2
|
|
v1[3]=3
|
|
self.failUnless(v1==v1)
|
|
|
|
v2 = ds.IntSparseIntVect(5)
|
|
v2.UpdateFromSequence((0,2,3,3,2,3))
|
|
self.failUnless(v1==v2)
|
|
|
|
def test5Dice(self):
|
|
"""
|
|
|
|
"""
|
|
v1 = ds.IntSparseIntVect(5)
|
|
v1[4]=4;
|
|
v1[0]=2;
|
|
v1[3]=1;
|
|
self.failUnless(feq(ds.DiceSimilarity(v1,v1),1.0))
|
|
|
|
v1 = ds.IntSparseIntVect(5)
|
|
v1[0]=2;
|
|
v1[2]=1;
|
|
v1[3]=4;
|
|
v1[4]=6;
|
|
v2 = ds.IntSparseIntVect(5)
|
|
v2[1]=2;
|
|
v2[2]=3;
|
|
v2[3]=4;
|
|
v2[4]=4;
|
|
self.failUnless(feq(ds.DiceSimilarity(v1,v2),18.0/26.))
|
|
self.failUnless(feq(ds.DiceSimilarity(v2,v1),18.0/26.))
|
|
|
|
def test6BulkDice(self):
|
|
"""
|
|
|
|
"""
|
|
sz=10
|
|
nToSet=5
|
|
nVs=6
|
|
import random
|
|
vs = []
|
|
for i in range(nVs):
|
|
v = ds.IntSparseIntVect(sz)
|
|
for j in range(nToSet):
|
|
v[random.randint(0,sz-1)]=random.randint(1,10)
|
|
vs.append(v)
|
|
|
|
baseDs = [ds.DiceSimilarity(vs[0],vs[x]) for x in range(1,nVs)]
|
|
bulkDs = ds.BulkDiceSimilarity(vs[0],vs[1:])
|
|
for i in range(len(baseDs)):
|
|
self.failUnless(feq(baseDs[i],bulkDs[i]))
|
|
|
|
|
|
if __name__ == '__main__':
|
|
unittest.main()
|