Definition at line 197 of file CFElements.py.
◆ setUp()
def python.CFElements.TestCF.setUp |
( |
|
self | ) |
|
Definition at line 198 of file CFElements.py.
199 import AthenaPython.PyAthena
as PyAthena
202 top.Members += [
parOR(
"nest1")]
204 top.Members += [nest2]
206 nest2.Members += [
parOR(
"deep_nest1")]
207 nest2.Members += [
parOR(
"deep_nest2")]
◆ test_findAlgorithms()
def python.CFElements.TestCF.test_findAlgorithms |
( |
|
self | ) |
|
Definition at line 277 of file CFElements.py.
277 def test_findAlgorithms( self ):
279 self.assertIsNotNone( a1,
"Can't find algorithm present in sequence" )
282 self.assertIsNotNone( a1,
"Can't find nested algorithm " )
287 self.assertIsNone( a1,
"Finding algorithm that is in the upper sequence" )
290 self.assertIsNone( a1,
"Finding algorithm that is does not exist" )
293 self.assertIsNotNone( a1,
"Could not find algorithm within the required nesting depth == 1" )
296 self.assertIsNone( a1,
"Could find algorithm even if it is deep in sequences structure" )
299 self.assertIsNotNone( a1,
"Could not find algorithm within the required nesting depth == 2" )
302 self.assertIsNotNone( a1
is None,
"Could find algorithm even if it is deep in sequences structure" )
◆ test_findDeep()
def python.CFElements.TestCF.test_findDeep |
( |
|
self | ) |
|
Definition at line 223 of file CFElements.py.
223 def test_findDeep( self ):
226 self.assertIsNotNone( d,
"Deep searching for sub seqeunce fails" )
227 self.assertEqual( d.getName(),
"deep_nest2",
"Wrong sub sequence in deep search" )
◆ test_findMissing()
def python.CFElements.TestCF.test_findMissing |
( |
|
self | ) |
|
Definition at line 229 of file CFElements.py.
229 def test_findMissing( self ):
232 self.assertIsNone( d,
"Algorithm confused as a sequence" )
236 self.assertIsNone( inexistent,
"ERROR, found sub sequence that does not relay exist" )
240 self.assertIsNone( inexistent,
"ERROR, found owner of inexistent sequence " )
◆ test_findRespectingScope()
def python.CFElements.TestCF.test_findRespectingScope |
( |
|
self | ) |
|
Definition at line 242 of file CFElements.py.
242 def test_findRespectingScope( self ):
244 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
247 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
250 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
253 self.assertEqual( owner.getName() ,
"top",
"Wrong owner %s" % owner.getName() )
◆ test_findTop()
def python.CFElements.TestCF.test_findTop |
( |
|
self | ) |
|
Definition at line 214 of file CFElements.py.
214 def test_findTop( self ):
216 self.assertIsNotNone( f,
"Can not find sequence at start" )
217 self.assertEqual( f.getName(),
"top",
"Wrong sequence" )
220 self.assertIsNotNone( nest2,
"Can not find sub sequence" )
221 self.assertEqual( nest2.getName(),
"nest2",
"Sub sequence incorrect" )
◆ test_iterSequences()
def python.CFElements.TestCF.test_iterSequences |
( |
|
self | ) |
|
Definition at line 255 of file CFElements.py.
255 def test_iterSequences( self ):
257 result = [seq.getName()
for seq
in iterSequences( self.top )]
258 self.assertEqual( result, [
'top',
'nest1',
'nest2',
'deep_nest1',
'deep_nest2',
259 'SomeAlg1',
'SomeAlg2',
'SomeAlg3',
'SomeAlg0'] )
264 self.assertEqual( result, [
'nest2',
'deep_nest1',
'deep_nest2',
265 'SomeAlg1',
'SomeAlg2',
'SomeAlg3'] )
269 result = [seq.getName()
for seq
in iterSequences( deep_nest2 )]
270 self.assertEqual( result, [
'deep_nest2'] )
275 self.assertEqual( result, [
'SomeAlg1'] )
◆ top
python.CFElements.TestCF.top |
The documentation for this class was generated from the following file: