Definition at line 199 of file CFElements.py.
◆ setUp()
def python.CFElements.TestCF.setUp |
( |
|
self | ) |
|
Definition at line 200 of file CFElements.py.
201 import AthenaPython.PyAthena
as PyAthena
204 top.Members += [
parOR(
"nest1")]
206 top.Members += [nest2]
208 nest2.Members += [
parOR(
"deep_nest1")]
209 nest2.Members += [
parOR(
"deep_nest2")]
◆ test_findAlgorithms()
def python.CFElements.TestCF.test_findAlgorithms |
( |
|
self | ) |
|
Definition at line 279 of file CFElements.py.
279 def test_findAlgorithms( self ):
281 self.assertIsNotNone( a1,
"Can't find algorithm present in sequence" )
284 self.assertIsNotNone( a1,
"Can't find nested algorithm " )
289 self.assertIsNone( a1,
"Finding algorithm that is in the upper sequence" )
292 self.assertIsNone( a1,
"Finding algorithm that is does not exist" )
295 self.assertIsNotNone( a1,
"Could not find algorithm within the required nesting depth == 1" )
298 self.assertIsNone( a1,
"Could find algorithm even if it is deep in sequences structure" )
301 self.assertIsNotNone( a1,
"Could not find algorithm within the required nesting depth == 2" )
304 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 225 of file CFElements.py.
225 def test_findDeep( self ):
228 self.assertIsNotNone( d,
"Deep searching for sub seqeunce fails" )
229 self.assertEqual( d.getName(),
"deep_nest2",
"Wrong sub sequence in deep search" )
◆ test_findMissing()
def python.CFElements.TestCF.test_findMissing |
( |
|
self | ) |
|
Definition at line 231 of file CFElements.py.
231 def test_findMissing( self ):
234 self.assertIsNone( d,
"Algorithm confused as a sequence" )
238 self.assertIsNone( inexistent,
"ERROR, found sub sequence that does not relay exist" )
242 self.assertIsNone( inexistent,
"ERROR, found owner of inexistent sequence " )
◆ test_findRespectingScope()
def python.CFElements.TestCF.test_findRespectingScope |
( |
|
self | ) |
|
Definition at line 244 of file CFElements.py.
244 def test_findRespectingScope( self ):
246 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
249 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
252 self.assertEqual( owner.getName(),
"nest2",
"Wrong owner %s" % owner.getName() )
255 self.assertEqual( owner.getName() ,
"top",
"Wrong owner %s" % owner.getName() )
◆ test_findTop()
def python.CFElements.TestCF.test_findTop |
( |
|
self | ) |
|
Definition at line 216 of file CFElements.py.
216 def test_findTop( self ):
218 self.assertIsNotNone( f,
"Can not find sequence at start" )
219 self.assertEqual( f.getName(),
"top",
"Wrong sequence" )
222 self.assertIsNotNone( nest2,
"Can not find sub sequence" )
223 self.assertEqual( nest2.getName(),
"nest2",
"Sub sequence incorrect" )
◆ test_iterSequences()
def python.CFElements.TestCF.test_iterSequences |
( |
|
self | ) |
|
Definition at line 257 of file CFElements.py.
257 def test_iterSequences( self ):
259 result = [seq.getName()
for seq
in iterSequences( self.top )]
260 self.assertEqual( result, [
'top',
'nest1',
'nest2',
'deep_nest1',
'deep_nest2',
261 'SomeAlg1',
'SomeAlg2',
'SomeAlg3',
'SomeAlg0'] )
266 self.assertEqual( result, [
'nest2',
'deep_nest1',
'deep_nest2',
267 'SomeAlg1',
'SomeAlg2',
'SomeAlg3'] )
271 result = [seq.getName()
for seq
in iterSequences( deep_nest2 )]
272 self.assertEqual( result, [
'deep_nest2'] )
277 self.assertEqual( result, [
'SomeAlg1'] )
◆ top
python.CFElements.TestCF.top |
The documentation for this class was generated from the following file: