mirror of
				https://github.com/catchorg/Catch2.git
				synced 2025-10-31 12:17:11 +01:00 
			
		
		
		
	Remove unused benchmark project
This commit is contained in:
		| @@ -1,9 +0,0 @@ | ||||
| /* | ||||
|  *  Created by Martin on 16/01/2017. | ||||
|  * | ||||
|  *  Distributed under the Boost Software License, Version 1.0. (See accompanying | ||||
|  *  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) | ||||
|  */ | ||||
|  | ||||
| #define CATCH_CONFIG_MAIN | ||||
| #include "catch.hpp" | ||||
| @@ -1,46 +0,0 @@ | ||||
| /* | ||||
|  *  Created by Martin on 16/01/2017. | ||||
|  * | ||||
|  *  Distributed under the Boost Software License, Version 1.0. (See accompanying | ||||
|  *  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) | ||||
|  */ | ||||
|  | ||||
| #include "catch.hpp" | ||||
|  | ||||
| #include <vector> | ||||
|  | ||||
| /////////////////////////////////////////////////////////////////////////////// | ||||
| TEST_CASE("Successful tests -- REQUIRE", "[Success]") { | ||||
|     const std::size_t sz = 1 * 1024 * 1024; | ||||
|  | ||||
|  | ||||
|     std::vector<std::size_t> vec; vec.reserve(sz); | ||||
|     for (std::size_t i = 0; i < sz; ++i){ | ||||
|         vec.push_back(i); | ||||
|         REQUIRE(vec.back() == i); | ||||
|     } | ||||
| } | ||||
|  | ||||
| /////////////////////////////////////////////////////////////////////////////// | ||||
| TEST_CASE("Successful tests -- CHECK", "[Success]") { | ||||
|     const std::size_t sz = 1 * 1024 * 1024; | ||||
|  | ||||
|  | ||||
|     std::vector<std::size_t> vec; vec.reserve(sz); | ||||
|     for (std::size_t i = 0; i < sz; ++i){ | ||||
|         vec.push_back(i); | ||||
|         CHECK(vec.back() == i); | ||||
|     } | ||||
| } | ||||
|  | ||||
| /////////////////////////////////////////////////////////////////////////////// | ||||
| TEST_CASE("Unsuccessful tests -- CHECK", "[Failure]") { | ||||
|     const std::size_t sz = 1024 * 1024; | ||||
|  | ||||
|  | ||||
|     std::vector<std::size_t> vec; vec.reserve(sz); | ||||
|     for (std::size_t i = 0; i < sz; ++i){ | ||||
|         vec.push_back(i); | ||||
|         CHECK(vec.size() == i); | ||||
|     } | ||||
| } | ||||
| @@ -1,4 +0,0 @@ | ||||
| This is very much a work in progress. | ||||
| The past results are standardized to a developer's machine, | ||||
| the benchmarking script is basic and there are only 3 benchmarks, | ||||
| but this should get better in time. For now, at least there is something to go by. | ||||
| @@ -1,3 +0,0 @@ | ||||
| Successful tests -- CHECK: median: 3.38116 (s), stddev: 0.11567366292001534 (s) | ||||
| Successful tests -- REQUIRE: median: 3.479955 (s), stddev: 0.16295972890734556 (s) | ||||
| Unsuccessful tests -- CHECK: median: 1.966895 (s), stddev: 0.06323488524716572 (s) | ||||
| @@ -1,3 +0,0 @@ | ||||
| Successful tests -- CHECK: median: 1.30312 (s), stddev: 0.08759818557862176 (s) | ||||
| Successful tests -- REQUIRE: median: 1.341535 (s), stddev: 0.1479193390143576 (s) | ||||
| Unsuccessful tests -- CHECK: median: 1.967755 (s), stddev: 0.07921104121269959 (s) | ||||
| @@ -1,3 +0,0 @@ | ||||
| Successful tests -- CHECK: median: 1.2982 (s), stddev: 0.019540648829214084 (s) | ||||
| Successful tests -- REQUIRE: median: 1.30102 (s), stddev: 0.014758430547392974 (s) | ||||
| Unsuccessful tests -- CHECK: median: 15.520199999999999 (s), stddev: 0.09536359426485094 (s) | ||||
| @@ -1,3 +0,0 @@ | ||||
| Successful tests -- CHECK: median: 0.7689014999999999 (s), stddev: 0.02127512078801068 (s) | ||||
| Successful tests -- REQUIRE: median: 0.772845 (s), stddev: 0.03011638381365052 (s) | ||||
| Unsuccessful tests -- CHECK: median: 15.49 (s), stddev: 0.536088571143903 (s) | ||||
| @@ -1,3 +0,0 @@ | ||||
| Successful tests -- CHECK: median: 0.775769 (s), stddev: 0.014802129132136525 (s) | ||||
| Successful tests -- REQUIRE: median: 0.785235 (s), stddev: 0.03532672836834896 (s) | ||||
| Unsuccessful tests -- CHECK: median: 15.156600000000001 (s), stddev: 0.2832375673450742 (s) | ||||
		Reference in New Issue
	
	Block a user
	 Martin Hořeňovský
					Martin Hořeňovský