Execution summary

Test execution start time:2017-01-06 21:04:11 UTC
Test execution time:40ms
Number of features:1
Number of scenarios:2
Passed scenarios:2
Bypassed scenarios:0
Failed scenarios:0
Ignored scenarios:0
Number of steps:11
Passed steps:11
Bypassed steps:0
Failed steps:0
Ignored steps:0
Not Run steps:0

Feature summary

FeatureScenariosPassedBypassedFailedIgnoredStepsPassedBypassedFailedIgnoredNot RunDurationAverage
Stack feature [LIFO]220001111000040ms20ms

Feature details[∞link]

Toggle:
Filter:
[∞filtered link]

[LIFO][∞link]

In order to support last-in-first-out (LIFO) operations As an developer I want to use a stack

[Empty] (21ms)[∞link]

Passed 1. GIVEN an empty stack (<1ms)
Passed 2. THEN it has no elements (3ms)
Passed 3. AND it throws an exception when calling pop (3ms)
Passed 4. AND it throws an exception when calling peek (<1ms)

[Not empty] (19ms)[∞link]

Passed 1. GIVEN a non empty stack (<1ms)
Passed 2. WHEN calling peek (<1ms)
Passed 3. THEN it returns the top element (7ms)
Passed 4. BUT it does not remove the top element (1ms)
Passed 5. WHEN calling pop (<1ms)
Passed 6. THEN it returns the top element (<1ms)
Passed 7. AND it removes the top element (<1ms)