1*b0d29bc4SBrooks Davis // Copyright 2014 The Kyua Authors. 2*b0d29bc4SBrooks Davis // All rights reserved. 3*b0d29bc4SBrooks Davis // 4*b0d29bc4SBrooks Davis // Redistribution and use in source and binary forms, with or without 5*b0d29bc4SBrooks Davis // modification, are permitted provided that the following conditions are 6*b0d29bc4SBrooks Davis // met: 7*b0d29bc4SBrooks Davis // 8*b0d29bc4SBrooks Davis // * Redistributions of source code must retain the above copyright 9*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer. 10*b0d29bc4SBrooks Davis // * Redistributions in binary form must reproduce the above copyright 11*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer in the 12*b0d29bc4SBrooks Davis // documentation and/or other materials provided with the distribution. 13*b0d29bc4SBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors 14*b0d29bc4SBrooks Davis // may be used to endorse or promote products derived from this software 15*b0d29bc4SBrooks Davis // without specific prior written permission. 16*b0d29bc4SBrooks Davis // 17*b0d29bc4SBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*b0d29bc4SBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*b0d29bc4SBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*b0d29bc4SBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*b0d29bc4SBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*b0d29bc4SBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*b0d29bc4SBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*b0d29bc4SBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*b0d29bc4SBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*b0d29bc4SBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*b0d29bc4SBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*b0d29bc4SBrooks Davis 29*b0d29bc4SBrooks Davis /// \file engine/scanner.hpp 30*b0d29bc4SBrooks Davis /// Utilities to scan through list of tests in a test suite. 31*b0d29bc4SBrooks Davis 32*b0d29bc4SBrooks Davis #if !defined(ENGINE_SCANNER_HPP) 33*b0d29bc4SBrooks Davis #define ENGINE_SCANNER_HPP 34*b0d29bc4SBrooks Davis 35*b0d29bc4SBrooks Davis #include "engine/scanner_fwd.hpp" 36*b0d29bc4SBrooks Davis 37*b0d29bc4SBrooks Davis #include <memory> 38*b0d29bc4SBrooks Davis #include <set> 39*b0d29bc4SBrooks Davis 40*b0d29bc4SBrooks Davis #include "engine/filters_fwd.hpp" 41*b0d29bc4SBrooks Davis #include "model/test_program_fwd.hpp" 42*b0d29bc4SBrooks Davis #include "utils/optional_fwd.hpp" 43*b0d29bc4SBrooks Davis 44*b0d29bc4SBrooks Davis namespace engine { 45*b0d29bc4SBrooks Davis 46*b0d29bc4SBrooks Davis 47*b0d29bc4SBrooks Davis /// Scans a list of test programs, yielding one test case at a time. 48*b0d29bc4SBrooks Davis /// 49*b0d29bc4SBrooks Davis /// This class contains the state necessary to process a collection of test 50*b0d29bc4SBrooks Davis /// programs (possibly as provided by the Kyuafile) and to extract an arbitrary 51*b0d29bc4SBrooks Davis /// (test program, test_case) pair out of them one at a time. 52*b0d29bc4SBrooks Davis /// 53*b0d29bc4SBrooks Davis /// The scanning algorithm guarantees that test programs are initialized 54*b0d29bc4SBrooks Davis /// dynamically, should they need to load their list of test cases from disk. 55*b0d29bc4SBrooks Davis /// 56*b0d29bc4SBrooks Davis /// The order of the extraction is not guaranteed. 57*b0d29bc4SBrooks Davis class scanner { 58*b0d29bc4SBrooks Davis struct impl; 59*b0d29bc4SBrooks Davis /// Pointer to the internal implementation data. 60*b0d29bc4SBrooks Davis std::shared_ptr< impl > _pimpl; 61*b0d29bc4SBrooks Davis 62*b0d29bc4SBrooks Davis public: 63*b0d29bc4SBrooks Davis scanner(const model::test_programs_vector&, const std::set< test_filter >&); 64*b0d29bc4SBrooks Davis ~scanner(void); 65*b0d29bc4SBrooks Davis 66*b0d29bc4SBrooks Davis bool done(void); 67*b0d29bc4SBrooks Davis utils::optional< scan_result > yield(void); 68*b0d29bc4SBrooks Davis 69*b0d29bc4SBrooks Davis std::set< test_filter > unused_filters(void) const; 70*b0d29bc4SBrooks Davis }; 71*b0d29bc4SBrooks Davis 72*b0d29bc4SBrooks Davis 73*b0d29bc4SBrooks Davis } // namespace engine 74*b0d29bc4SBrooks Davis 75*b0d29bc4SBrooks Davis 76*b0d29bc4SBrooks Davis #endif // !defined(ENGINE_SCANNER_HPP) 77