Tests started on Wed Apr 24 13:51:33 PDT 2019 and finished on Wed Apr 24 14:10:31 PDT 2019
Start running the tests on Wed Apr 24 13:52:40 PDT 2019
zipios_tests[23320]: version 2.2.0, seed is 1556139160
Then: we can read the file going backward completed in 0.001592s
When: setting up a backbuffer completed in 0.001692s
Given: a binary file of 256 bytes completed in 0.00182s
Scenario: BackBuffer read a file completed in 0.001861s
Then: try with an invalid chunk size completed in 0.000302s
When: setting up a backbuffer completed in 0.000337s
Given: a binary file of 256 bytes completed in 0.000404s
Scenario: BackBuffer read a file completed in 0.000425s
Then: we close the file and we get an exception completed in 4.4e-05s
When: setting up a backbuffer completed in 7.3e-05s
Given: a binary file of 256 bytes completed in 0.000135s
Scenario: BackBuffer read a file completed in 0.000155s
verify that the object looks as expected completed in 0.000301s
Given: an empty collection collection completed in 0.000389s
Scenario: CollectionCollection with various tests completed in 0.000425s
test the CollectionCollection::getInputStream() for each file in the tree (original) completed in 0.002552s
Then: it is valid and we can find all the files completed in 0.003303s
When: we add an existing directory collection completed in 0.027048s
Given: an empty collection collection completed in 0.027095s
Scenario: CollectionCollection with various tests completed in 0.027118s
test the CollectionCollection::getInputStream() for each file in the tree (copy constructor) completed in 0.001868s
Then: it is valid and we can find all the files completed in 0.002407s
When: we add an existing directory collection completed in 0.024735s
Given: an empty collection collection completed in 0.024777s
Scenario: CollectionCollection with various tests completed in 0.024895s
test the CollectionCollection::getInputStream() for each file in the tree (copy assignment) completed in 0.005827s
Then: it is valid and we can find all the files completed in 0.006834s
When: we add an existing directory collection completed in 0.068149s
Given: an empty collection collection completed in 0.068198s
Scenario: CollectionCollection with various tests completed in 0.068221s
test the CollectionCollection::getInputStream() for each file in the tree (clone) completed in 0.003192s
Then: it is valid and we can find all the files completed in 0.00381s
When: we add an existing directory collection completed in 0.048266s
Given: an empty collection collection completed in 0.048311s
Scenario: CollectionCollection with various tests completed in 0.048336s
test the CollectionCollection::getInputStream() for each file in the collection of trees (original) completed in 0.008627s
Then: it is valid and we can find all the files in all the collections completed in 0.009096s
When: we add existing directories and another sub-collection completed in 0.094557s
Given: an empty collection collection completed in 0.09461s
Scenario: CollectionCollection with various tests completed in 0.094635s
test the CollectionCollection::getInputStream() for each file in the tree (clone) completed in 0.007634s
Then: it is valid and we can find all the files in all the collections completed in 0.008039s
When: we add existing directories and another sub-collection completed in 0.084029s
Given: an empty collection collection completed in 0.084084s
Scenario: CollectionCollection with various tests completed in 0.084108s
Then: close that collectino of collection and it is now invalid completed in 0.002336s
When: we add existing directories and another sub-collection completed in 0.080886s
Given: an empty collection collection completed in 0.080926s
Scenario: CollectionCollection with various tests completed in 0.080951s
Then: it is now invalid completed in 0.002611s
When: closing the directory completed in 0.002712s
Given: an empty collection collection completed in 0.002738s
Scenario: CollectionCollection with various tests completed in 0.002756s
Then: the result is still an emtpy vector completed in 6e-06s
When: appending another empty vector completed in 2.6e-05s
Given: an empty vector completed in 5e-05s
Scenario: Vector append completed in 8.3e-05s
Then: the result is like that non-empty vector completed in 2.3e-05s
When: appending a non-empty vector completed in 4.4e-05s
Given: an empty vector completed in 5.5e-05s
Scenario: Vector append completed in 7.6e-05s
Then: the result is still the 3 element vector completed in 2e-05s
When: appending an empty vector completed in 3.1e-05s
Given: a non-empty vector completed in 4.9e-05s
Scenario: Vector append completed in 7.1e-05s
Then: the result is the original vector with the other vector appended completed in 3e-05s
When: appending a non-empty vector completed in 4.8e-05s
Given: a non-empty vector completed in 6e-05s
Scenario: Vector append completed in 7.9e-05s
Verify the g_separator completed in 1.7e-05s
Then: we get exactly the value we expected completed in 2.4e-05s
When: reading two 32 bit values completed in 4.8e-05s
Given: a simple file completed in 0.000199s
Scenario: Read from file completed in 0.000234s
Then: the result is exactly as expected completed in 2.8e-05s
When: reading one 32 bit between two 16 bit values completed in 5e-05s
Given: a simple file completed in 0.00015s
Scenario: Read from file completed in 0.000177s
Then: the result is as expected completed in 2e-05s
When: reading one 16 bit between two 32 bit values completed in 4.1e-05s
Given: a simple file completed in 0.000137s
Scenario: Read from file completed in 0.00016s
Then: the result is as expected completed in 1.8e-05s
When: reading three 16 bit values completed in 3.7e-05s
Given: a simple file completed in 0.000135s
Scenario: Read from file completed in 0.000158s
Then: the result is as expected completed in 2e-05s
When: reading one 32 bit, one 8 bit then one 16 bit value completed in 4.2e-05s
Given: a simple file completed in 0.000137s
Scenario: Read from file completed in 0.000161s
Then: the result is as expected completed in 6e-05s
When: reading one 32 bit, one 8 bit then one buffer value completed in 9e-05s
Given: a simple file completed in 0.000189s
Scenario: Read from file completed in 0.000212s
Then: the result is as expected completed in 5.2e-05s
When: reading one 32 bit, one string and then one 8 bit value completed in 8.2e-05s
Given: a simple file completed in 0.000175s
Scenario: Read from file completed in 0.000201s
Then: another 8 bit value completed in 6e-05s
When: reading four 32 bit values completed in 7.9e-05s
Given: a simple file completed in 0.000179s
Scenario: Read from file completed in 0.000203s
Then: another 16 bit value completed in 6e-05s
When: reading four 32 bit values completed in 8.2e-05s
Given: a simple file completed in 0.00018s
Scenario: Read from file completed in 0.000203s
Then: another 32 bit value completed in 6.2e-05s
When: reading four 32 bit values completed in 8.3e-05s
Given: a simple file completed in 0.000182s
Scenario: Read from file completed in 0.000207s
Then: then a string that's too long completed in 5.1e-05s
When: reading two 32 bit values completed in 9.2e-05s
Given: a simple file completed in 0.000191s
Scenario: Read from file completed in 0.000216s
Then: then a buffer that's too long completed in 5.3e-05s
When: reading two 32 bit values completed in 7.5e-05s
Given: a simple file completed in 0.00017s
Scenario: Read from file completed in 0.000194s
Then: we get exactly the value we expected completed in 1.3e-05s
When: reading two 32 bit values completed in 4.7e-05s
Given: a simple buffer completed in 0.000142s
Scenario: Read from buffer completed in 0.000175s
Then: the result is exactly as expected completed in 1.9e-05s
When: reading one 32 bit between two 16 bit values completed in 5.3e-05s
Given: a simple buffer completed in 9.5e-05s
Scenario: Read from buffer completed in 0.000113s
Then: the result is as expected completed in 1.9e-05s
When: reading one 16 bit between two 32 bit values completed in 5e-05s
Given: a simple buffer completed in 9e-05s
Scenario: Read from buffer completed in 0.000108s
Then: the result is as expected completed in 1.7e-05s
When: reading three 16 bit values completed in 4.9e-05s
Given: a simple buffer completed in 9e-05s
Scenario: Read from buffer completed in 0.000108s
Then: the result is as expected completed in 1.8e-05s
When: reading one 32 bit, one 8 bit then one 16 bit value completed in 5.1e-05s
Given: a simple buffer completed in 9.3e-05s
Scenario: Read from buffer completed in 0.000111s
Then: the result is as expected completed in 5.5e-05s
When: reading one 32 bit, one 8 bit then one buffer value completed in 0.00011s
Given: a simple buffer completed in 0.000152s
Scenario: Read from buffer completed in 0.00017s
Then: the result is as expected completed in 5.5e-05s
When: reading one 32 bit, one string and then one 8 bit value completed in 0.000117s
Given: a simple buffer completed in 0.00016s
Scenario: Read from buffer completed in 0.000178s
Then: another 8 bit value completed in 6.3e-05s
When: reading four 32 bit values completed in 0.0001s
Given: a simple buffer completed in 0.000143s
Scenario: Read from buffer completed in 0.000161s
Then: another 16 bit value completed in 5.7e-05s
When: reading four 32 bit values completed in 9.7e-05s
Given: a simple buffer completed in 0.000138s
Scenario: Read from buffer completed in 0.000155s
Then: another 32 bit value completed in 6e-05s
When: reading four 32 bit values completed in 9.8e-05s
Given: a simple buffer completed in 0.000138s
Scenario: Read from buffer completed in 0.000156s
Then: then a string that's too long completed in 5.1e-05s
When: reading two 32 bit values completed in 7.9e-05s
Given: a simple buffer completed in 0.00012s
Scenario: Read from buffer completed in 0.000138s
Then: then a buffer that's too long completed in 5.3e-05s
When: reading two 32 bit values completed in 8e-05s
Given: a simple buffer completed in 0.00012s
Scenario: Read from buffer completed in 0.000136s
Then: we get exactly the value we expected completed in 7.4e-05s
When: writing two 32 bit values completed in 0.000132s
Given: create an empty file completed in 0.000233s
Scenario: Write to file completed in 0.000259s
Then: the result is exactly as expected completed in 6.7e-05s
When: writing one 32 bit between two 16 bit values completed in 0.000118s
Given: create an empty file completed in 0.000173s
Scenario: Write to file completed in 0.000196s
Then: the result is as expected completed in 7.9e-05s
When: writing one 16 bit between two 32 bit values completed in 0.000128s
Given: create an empty file completed in 0.000183s
Scenario: Write to file completed in 0.000206s
Then: the result is as expected completed in 6.2e-05s
When: writing three 16 bit values completed in 0.000109s
Given: create an empty file completed in 0.000164s
Scenario: Write to file completed in 0.000187s
Then: the result is as expected completed in 6.4e-05s
When: writing one 32 bit, one 8 bit then one 16 bit value completed in 0.000114s
Given: create an empty file completed in 0.000168s
Scenario: Write to file completed in 0.000191s
Then: the result is as expected completed in 9.5e-05s
When: writing one 32 bit, one 8 bit then one buffer value completed in 0.000148s
Given: create an empty file completed in 0.000203s
Scenario: Write to file completed in 0.000226s
Then: the result is as expected completed in 6.8e-05s
When: writing one 32 bit, one string and then one 8 bit value completed in 0.000121s
Given: create an empty file completed in 0.000175s
Scenario: Write to file completed in 0.000199s
Then: writing a 8 bit value fails completed in 3.9e-05s
When: writing some data and mark the output as invalid completed in 9.1e-05s
Given: create an empty file completed in 0.00015s
Scenario: Write to file completed in 0.000173s
Then: writing a 16 bit value fails completed in 5.1e-05s
When: writing some data and mark the output as invalid completed in 0.000101s
Given: create an empty file completed in 0.000161s
Scenario: Write to file completed in 0.000185s
Then: writing a 32 bit value fails completed in 4e-05s
When: writing some data and mark the output as invalid completed in 9.1e-05s
Given: create an empty file completed in 0.00015s
Scenario: Write to file completed in 0.000174s
Then: writing a string fails completed in 3.9e-05s
When: writing some data and mark the output as invalid completed in 8.9e-05s
Given: create an empty file completed in 0.000147s
Scenario: Write to file completed in 0.00017s
Then: writing a buffer fails completed in 4.3e-05s
When: writing some data and mark the output as invalid completed in 9.2e-05s
Given: create an empty file completed in 0.000146s
Scenario: Write to file completed in 0.000168s
verify that the object looks as expected completed in 0.000224s
Given: an empty directory collection completed in 0.000264s
Scenario: DirectoryCollection with invalid paths completed in 0.000293s
Then: it is still the same completed in 0.000827s
When: closing the directory completed in 0.000845s
Given: an empty directory collection completed in 0.000859s
Scenario: DirectoryCollection with invalid paths completed in 0.000875s
verify that the object looks as expected in recursive mode completed in 0.000212s
DirectoryCollection with a valid file, but not a directory completed in 0.000305s
verify that the object looks as expected in non-recursive mode completed in 0.000224s
DirectoryCollection with a valid file, but not a directory completed in 0.0003s
DirectoryCollection with valid trees of files completed in 20.2048s
DirectoryCollection with an existing directory that gets deleted completed in 0.003125s
verify that the object looks as expected completed in 0.000896s
DirectoryCollection with an empty directory completed in 0.003667s
verify that the object looks as expected completed in 0.000609s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000921s
Scenario: DirectoryEntry with invalid paths completed in 0.000995s
Then: we can read it and nothing else changed completed in 0.000398s
When: setting the comment completed in 0.000426s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.0005s
Scenario: DirectoryEntry with invalid paths completed in 0.000533s
Then: we ignore it completed in 0.000345s
When: setting the compressed size completed in 0.000375s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000445s
Scenario: DirectoryEntry with invalid paths completed in 0.000471s
Then: we ignore it completed in 0.000317s
When: setting the CRC completed in 0.000346s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000416s
Scenario: DirectoryEntry with invalid paths completed in 0.000445s
Then: we ignore it completed in 0.000744s
When: setting an extra buffer completed in 0.000792s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000863s
Scenario: DirectoryEntry with invalid paths completed in 0.000889s
setting an invalid level completed in 0.138149s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.138237s
Scenario: DirectoryEntry with invalid paths completed in 0.138261s
setting an invalid method completed in 0.015391s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.01545s
Scenario: DirectoryEntry with invalid paths completed in 0.015471s
Then: we ignore it completed in 0.000201s
When: setting the method completed in 0.000219s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000265s
Scenario: DirectoryEntry with invalid paths completed in 0.00028s
Then: we take it as is completed in 0.000224s
When: setting the uncompressed size completed in 0.000242s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000287s
Scenario: DirectoryEntry with invalid paths completed in 0.000302s
Then: we take it as is completed in 0.000215s
When: setting the DOS time completed in 0.000257s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000303s
Scenario: DirectoryEntry with invalid paths completed in 0.000318s
Then: we take it as is completed in 0.000193s
When: setting the Unix time completed in 0.000212s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000256s
Scenario: DirectoryEntry with invalid paths completed in 0.000271s
Then: we retrieve the same value completed in 0.000189s
When: setting the entry offset completed in 0.000207s
Given: test a fantom file (path that "cannot" exists) and no comment completed in 0.000248s
Scenario: DirectoryEntry with invalid paths completed in 0.000263s
setting all levels, including many invalid ones completed in 0.103434s
DirectoryEntry with one valid file completed in 0.120993s
verify that the object looks as expected completed in 0.000196s
Given: test an existing directory and no comment completed in 0.00255s
Scenario: DirectoryEntry for a valid directory completed in 0.00258s
Then: we can read it and nothing else changed completed in 0.000418s
When: setting the comment completed in 0.000465s
Given: test an existing directory and no comment completed in 0.003198s
Scenario: DirectoryEntry for a valid directory completed in 0.003241s
Then: we ignore it completed in 0.00044s
When: setting the compressed size completed in 0.0005s
Given: test an existing directory and no comment completed in 0.003231s
Scenario: DirectoryEntry for a valid directory completed in 0.003276s
Then: we ignore it completed in 0.000301s
When: setting the CRC completed in 0.000341s
Given: test an existing directory and no comment completed in 0.002122s
Scenario: DirectoryEntry for a valid directory completed in 0.002162s
Then: we ignore it completed in 0.000582s
When: setting an extra buffer completed in 0.000645s
Given: test an existing directory and no comment completed in 0.003051s
Scenario: DirectoryEntry for a valid directory completed in 0.003089s
setting all levels, including many invalid ones completed in 0.110753s
Given: test an existing directory and no comment completed in 0.113121s
Scenario: DirectoryEntry for a valid directory completed in 0.113155s
Then: we ignore it completed in 0.000196s
When: setting the method completed in 0.000224s
Given: test an existing directory and no comment completed in 0.002138s
Scenario: DirectoryEntry for a valid directory completed in 0.002167s
Then: we take it as is completed in 0.000233s
When: setting the uncompressed size completed in 0.000261s
Given: test an existing directory and no comment completed in 0.002886s
Scenario: DirectoryEntry for a valid directory completed in 0.002912s
Then: we take it as is completed in 0.000252s
When: setting the DOS time completed in 0.000295s
Given: test an existing directory and no comment completed in 0.002884s
Scenario: DirectoryEntry for a valid directory completed in 0.00291s
Then: we take it as is completed in 0.000256s
When: setting the Unix time completed in 0.000298s
Given: test an existing directory and no comment completed in 0.002862s
Scenario: DirectoryEntry for a valid directory completed in 0.002889s
DOS time minimum completed in 3.5e-05s
DOS Date & Time Min/Max completed in 8.2e-05s
DOS time maximum completed in 1.4e-05s
DOS Date & Time Min/Max completed in 5.3e-05s
daysInMonth() when month is invalid completed in 2e-05s
Invalid DOS Date & Time completed in 0.00014s
get/set seconds completed in 0.002646s
Invalid DOS Date & Time completed in 0.002726s
get/set minutes completed in 0.002216s
Invalid DOS Date & Time completed in 0.002295s
get/set hours completed in 0.002418s
Invalid DOS Date & Time completed in 0.00248s
get/set day of the month completed in 0.001805s
Invalid DOS Date & Time completed in 0.001854s
get/set month completed in 0.001763s
Invalid DOS Date & Time completed in 0.00181s
get/set year completed in 0.033971s
Invalid DOS Date & Time completed in 0.034022s
just under the minimum completed in 0s
Small DOS Date & Time completed in 8.5e-05s
just around minimum, but valid completed in 0.000454s
Small DOS Date & Time completed in 0.000479s
just around maximum, but valid completed in 0.000567s
Large DOS Date & Time completed in 0.000603s
just a bit too large completed in 0.000688s
Large DOS Date & Time completed in 0.00071s
more random tests completed in 1.12089s
Random DOS Date & Time completed in 1.12094s
verify that the object looks as expected completed in 0.000155s
Given: test a fantom file (path that "cannot" exists) completed in 0.00022s
Scenario: FilePath that does not represent a file on disk completed in 0.0003s
Then: path was replaced completed in 0.000102s
When: and changing the path to something else as unexistant with assignment operator works too completed in 0.00012s
Given: test a fantom file (path that "cannot" exists) completed in 0.000143s
Scenario: FilePath that does not represent a file on disk completed in 0.00017s
Then: path changed completed in 0.000118s
When: still "broken" when appending another part (full path) completed in 0.000168s
Given: test a fantom file (path that "cannot" exists) completed in 0.000189s
Scenario: FilePath that does not represent a file on disk completed in 0.000212s
Then: path changed completed in 5.7e-05s
When: still "broken" when appending another part (relative) completed in 7.3e-05s
Given: test a fantom file (path that "cannot" exists) completed in 9.3e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000123s
Then: path changed completed in 5.7e-05s
When: still "broken" when appending another part (empty) completed in 7.1e-05s
Given: test a fantom file (path that "cannot" exists) completed in 9e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000119s
verify that the object looks as expected completed in 5.2e-05s
Given: an empty path completed in 9.2e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000118s
Then: file name is still empty completed in 4.8e-05s
When: we can concatenate another empty path to it completed in 6.7e-05s
Given: an empty path completed in 8.8e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000112s
Then: new path is equal to the concatenated path completed in 5.6e-05s
When: we can concatenate a full regular path to it completed in 7.6e-05s
Given: an empty path completed in 9.4e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000119s
Then: concatenated path is the added path completed in 5.5e-05s
When: we can concatenate a relative path to it completed in 7.1e-05s
Given: an empty path completed in 8.6e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000112s
verify that the object looks as expected completed in 6.2e-05s
Given: a fantom relative path completed in 9.5e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.00012s
Then: the result is the same as the left hand-side completed in 5.5e-05s
When: we can concatenate an empty path to it completed in 7e-05s
Given: a fantom relative path completed in 9e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000115s
Then: path is the resulting concatenation with a slash at the end completed in 5.7e-05s
When: we can concatenate a full regular path to it completed in 7.3e-05s
Given: a fantom relative path completed in 9.1e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000116s
Then: the path changed completed in 5.6e-05s
When: we can concatenate a relative path to it completed in 7.2e-05s
Given: a fantom relative path completed in 8.9e-05s
Scenario: FilePath that does not represent a file on disk completed in 0.000114s
verify that the object looks as expected completed in 7.3e-05s
Given: a fantom path that ends with / completed in 0.000106s
Scenario: FilePath that does not represent a file on disk completed in 0.00013s
Then: the result is as expected without the slash completed in 5.6e-05s
When: we can concatenate another path, it also prune the / completed in 9.3e-05s
Given: a fantom path that ends with / completed in 0.000105s
Scenario: FilePath that does not represent a file on disk completed in 0.000129s
Then: is found completed in 8.4e-05s
When: creating a FilePath object completed in 0.000101s
Given: an existing file completed in 0.000212s
Scenario: FilePath against existing files on disk completed in 0.000251s
Then: is found completed in 6.2e-05s
When: creating a FilePath object completed in 9.6e-05s
Given: an existing directory completed in 0.002126s
Scenario: FilePath against existing files on disk completed in 0.002212s
Test with regular files of various sizes completed in 0.002393s
Valid input stream buffer completed in 0.000127s
An input filter completed in 0.000198s
Invalid input stream buffer completed in 5.3e-05s
An input filter completed in 9.6e-05s
Valid output stream buffer completed in 6.3e-05s
An output filter completed in 0.000126s
Invalid output stream buffer completed in 3.2e-05s
An output filter completed in 7.4e-05s
VirtualSeeker tests completed in 0.982637s
An Empty ZipFile completed in 9.3e-05s
A ZipFile with an invalid name completed in 5.2e-05s
A ZipFile with an invalid file completed in 0.000251s
An empty ZipFile completed in 0.000146s
Then: it is valid and includes all the files in the tree completed in 0.139193s
When: we load the zip file completed in 0.147604s
Given: a tree directory completed in 1.56814s
Scenario: ZipFile with a valid zip archive completed in 1.5682s
Then: we can create a totally valid clone completed in 0.505144s
When: we load the zip file completed in 0.533153s
Given: a tree directory completed in 4.26128s
Scenario: ZipFile with a valid zip archive completed in 4.26134s
Then: we can compare incompatible entries against each others completed in 0.016741s
When: we load the zip file completed in 0.05016s
Given: a tree directory completed in 3.93744s
Scenario: ZipFile with a valid zip archive completed in 3.9375s
Then: it is valid and includes all the files in the tree as expected completed in 0.344319s
When: we save the directory tree in a .zip file completed in 1.82637s
Given: a tree directory completed in 3.3203s
Scenario: use Zipios to create a zip archive completed in 3.32036s
test creating zip with all available levels completed in 258.796s
Given: a tree directory completed in 260.958s
Scenario: use Zipios to create a zip archive completed in 260.958s
Then: it is valid and includes the file as expected completed in 0.000378s
When: we save the file in a .zip completed in 0.000639s
Given: a one file zip file completed in 0.004125s
Scenario: use Zipios to create zip archives with 1 or 3 files each completed in 0.004271s
Then: it is invalid and fails as expected completed in 0.000263s
When: we make sure that saving the file fails if the comment is too large completed in 0.0019s
Given: a one file zip file completed in 0.004576s
Scenario: use Zipios to create zip archives with 1 or 3 files each completed in 0.004612s
Then: it is invalid and fails as expected completed in 0.000281s
When: we make sure that saving the file fails if the extra buffer is too large completed in 0.004738s
Given: a one file zip file completed in 0.007015s
Scenario: use Zipios to create zip archives with 1 or 3 files each completed in 0.007061s
Then: it is invalid and fails as expected completed in 0.000357s
When: we make sure that saving the file fails if the Zip (gloabl) comment is too large completed in 0.002102s
Given: a one file zip file completed in 0.004567s
Scenario: use Zipios to create zip archives with 1 or 3 files each completed in 0.004611s
Then: the creating of the zip archive fails: too many file entries completed in 764.717s
When: we add it more than 64Kb times to the directory completed in 764.95s
Given: a very small file completed in 764.953s
Scenario: use Zipios to create zip archives with 1 or 3 files each completed in 764.953s
try one uncompressed file of many sizes completed in 0.177314s
Simple Valid and Invalid ZipFile Archives completed in 0.177404s
try three uncompressed files of many sizes completed in 0.513281s
Simple Valid and Invalid ZipFile Archives completed in 0.513342s
create files with End of Central Directory that are tool small completed in 0.002128s
Valid and Invalid ZipFile Archives completed in 0.002216s
create files with End of Central Directory file except for the comment completed in 0.001017s
Valid and Invalid ZipFile Archives completed in 0.001071s
create files with End of Central Directory using counts that differ completed in 0.000924s
Valid and Invalid ZipFile Archives completed in 0.000981s
create files with one Local Entry using an invalid signature completed in 0.001208s
Valid and Invalid ZipFile Archives completed in 0.001261s
create files with a valid central directory but no local entries completed in 0.00129s
Valid and Invalid ZipFile Archives completed in 0.001343s
create files with one an unsupported compression method completed in 0.001685s
Valid and Invalid ZipFile Archives completed in 0.001738s
create files with a trailing data descriptor completed in 0.001725s
Valid and Invalid ZipFile Archives completed in 0.001786s
create files with a mismatched compression method completed in 0.00136s
Valid and Invalid ZipFile Archives completed in 0.001416s
create files with a trailing data descriptor completed in 0.001228s
Valid and Invalid ZipFile Archives completed in 0.001282s
create files with a compressed file, only save only 50% of the data completed in 0.060448s
Valid and Invalid ZipFile Archives completed in 0.060512s
===============================================================================
All tests passed (3279174 assertions in 35 test cases)
Finished running the tests on Wed Apr 24 14:10:23 PDT 2019