( self )
| 831 | IECore.testPathMatcherFind() |
| 832 | |
| 833 | def testSubTree( self ) : |
| 834 | |
| 835 | paths = [ |
| 836 | "/a/b/c/d/e", |
| 837 | "/d/b/c/d", |
| 838 | "/a", |
| 839 | "/a/b/c", |
| 840 | ] |
| 841 | |
| 842 | m1 = IECore.PathMatcher( paths ) |
| 843 | self.assertEqual( set( m1.paths() ), set( paths ) ) |
| 844 | |
| 845 | expectedPaths = [ |
| 846 | "/d/e", |
| 847 | "/" |
| 848 | ] |
| 849 | |
| 850 | m2 = m1.subTree( "/a/b/c" ) |
| 851 | self.assertEqual( set( m1.paths() ), set( paths ) ) |
| 852 | self.assertEqual( set( m2.paths() ), set( expectedPaths ) ) |
| 853 | |
| 854 | m1.addPath( "/a/b/c/d/f" ) |
| 855 | self.assertEqual( set( m1.paths() ), set( paths + [ "/a/b/c/d/f" ] ) ) |
| 856 | self.assertEqual( set( m2.paths() ), set( expectedPaths ) ) |
| 857 | |
| 858 | m2.addPath( "/d/e/g" ) |
| 859 | self.assertEqual( set( m1.paths() ), set( paths + [ "/a/b/c/d/f" ] ) ) |
| 860 | self.assertEqual( set( m2.paths() ), set( expectedPaths + [ "/d/e/g" ] ) ) |
| 861 | |
| 862 | def testNonExistentSubtree( self ) : |
| 863 |
nothing calls this directly
no test coverage detected