Ichthyostega
806db414dd
* Lumiera source code always was copyrighted by individual contributors * there is no entity "Lumiera.org" which holds any copyrights * Lumiera source code is provided under the GPL Version 2+ == Explanations == Lumiera as a whole is distributed under Copyleft, GNU General Public License Version 2 or above. For this to become legally effective, the ''File COPYING in the root directory is sufficient.'' The licensing header in each file is not strictly necessary, yet considered good practice; attaching a licence notice increases the likeliness that this information is retained in case someone extracts individual code files. However, it is not by the presence of some text, that legally binding licensing terms become effective; rather the fact matters that a given piece of code was provably copyrighted and published under a license. Even reformatting the code, renaming some variables or deleting parts of the code will not alter this legal situation, but rather creates a derivative work, which is likewise covered by the GPL! The most relevant information in the file header is the notice regarding the time of the first individual copyright claim. By virtue of this initial copyright, the first author is entitled to choose the terms of licensing. All further modifications are permitted and covered by the License. The specific wording or format of the copyright header is not legally relevant, as long as the intention to publish under the GPL remains clear. The extended wording was based on a recommendation by the FSF. It can be shortened, because the full terms of the license are provided alongside the distribution, in the file COPYING.
118 lines
3.3 KiB
C++
118 lines
3.3 KiB
C++
/*
|
||
DiffListGeneration(Test) - demonstrate list diff generation
|
||
|
||
Copyright (C)
|
||
2014, Hermann Vosseler <Ichthyostega@web.de>
|
||
|
||
**Lumiera** is free software; you can redistribute it and/or modify it
|
||
under the terms of the GNU General Public License as published by the
|
||
Free Software Foundation; either version 2 of the License, or (at your
|
||
option) any later version. See the file COPYING for further details.
|
||
|
||
* *****************************************************************/
|
||
|
||
/** @file diff-list-generation-test.cpp
|
||
** unit test \ref DiffListGeneration_test
|
||
*/
|
||
|
||
|
||
#include "lib/test/run.hpp"
|
||
#include "lib/diff/list-diff-detector.hpp"
|
||
#include "lib/itertools.hpp"
|
||
#include "lib/util.hpp"
|
||
|
||
#include <string>
|
||
#include <vector>
|
||
|
||
using lib::append_all;
|
||
using util::isnil;
|
||
using std::string;
|
||
using std::vector;
|
||
|
||
|
||
namespace lib {
|
||
namespace diff{
|
||
namespace test{
|
||
|
||
namespace {//Test fixture....
|
||
|
||
using DataSeq = vector<string>;
|
||
|
||
#define TOK(id) id(STRINGIFY(id))
|
||
|
||
string TOK(a1), TOK(a2), TOK(a3), TOK(a4), TOK(a5);
|
||
string TOK(b1), TOK(b2), TOK(b3), TOK(b4);
|
||
|
||
using Interpreter = ListDiffInterpreter<string>;
|
||
using DiffStep = ListDiffLanguage<string>::DiffStep;
|
||
using DiffSeq = vector<DiffStep>;
|
||
|
||
DiffStep_CTOR(ins);
|
||
DiffStep_CTOR(del);
|
||
DiffStep_CTOR(pick);
|
||
DiffStep_CTOR(find);
|
||
DiffStep_CTOR(skip);
|
||
|
||
}//(End)Test fixture
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
/***********************************************************************//**
|
||
* @test Demonstration/Concept: how to derive a list diff representation
|
||
* from the comparison of two sequences. The changes necessary to
|
||
* transform one sequence into the other one are given as a linear
|
||
* sequence of elementary mutation operations.
|
||
*
|
||
* The change detector assumes elements with well defined identity
|
||
* and uses an index table for both sequences. The diff is generated
|
||
* progressively, demand-driven.
|
||
*
|
||
* @see DiffListApplication_test
|
||
*/
|
||
class DiffListGeneration_test : public Test
|
||
{
|
||
|
||
virtual void
|
||
run (Arg)
|
||
{
|
||
DataSeq toObserve({a1,a2,a3,a4,a5});
|
||
DiffDetector<DataSeq> detector(toObserve);
|
||
|
||
CHECK (!detector.isChanged());
|
||
toObserve = {b1,a3,a5,b2,b3,a4,b4};
|
||
CHECK (detector.isChanged());
|
||
|
||
auto changes = detector.pullUpdate();
|
||
CHECK (!isnil (changes));
|
||
CHECK (!detector.isChanged()); // pullUpdate() also took a new snapshot
|
||
|
||
DiffSeq generatedDiff;
|
||
append_all (changes, generatedDiff);
|
||
|
||
CHECK (generatedDiff == DiffSeq({del(a1)
|
||
, del(a2)
|
||
, ins(b1)
|
||
, pick(a3)
|
||
, find(a5)
|
||
, ins(b2)
|
||
, ins(b3)
|
||
, pick(a4)
|
||
, ins(b4)
|
||
, skip(a5)
|
||
}));
|
||
}
|
||
};
|
||
|
||
|
||
/** Register this test class... */
|
||
LAUNCHER (DiffListGeneration_test, "unit common");
|
||
|
||
|
||
|
||
}}} // namespace lib::diff::test
|