mirror of
https://github.com/wolfpld/tracy.git
synced 2024-11-14 04:01:48 +00:00
143 lines
4.8 KiB
C++
143 lines
4.8 KiB
C++
/**
|
|
dtl -- Diff Template Library
|
|
|
|
In short, Diff Template Library is distributed under so called "BSD license",
|
|
|
|
Copyright (c) 2015 Tatsuhiko Kubo <cubicdaiya@gmail.com>
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
* Redistributions of source code must retain the above copyright notice,
|
|
this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation
|
|
and/or other materials provided with the distribution.
|
|
|
|
* Neither the name of the authors nor the names of its contributors
|
|
may be used to endorse or promote products derived from this software
|
|
without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
|
|
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/* If you use this library, you must include dtl.hpp only. */
|
|
|
|
#ifndef DTL_VARIABLES_H
|
|
#define DTL_VARIABLES_H
|
|
|
|
#include <vector>
|
|
#include <list>
|
|
#include <string>
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
|
|
namespace dtl {
|
|
|
|
using std::vector;
|
|
using std::string;
|
|
using std::pair;
|
|
using std::ostream;
|
|
using std::list;
|
|
using std::for_each;
|
|
using std::distance;
|
|
using std::fill;
|
|
using std::cout;
|
|
using std::endl;
|
|
using std::rotate;
|
|
using std::swap;
|
|
using std::max;
|
|
|
|
/**
|
|
* version string
|
|
*/
|
|
const string version = "1.20";
|
|
|
|
/**
|
|
* type of edit for SES
|
|
*/
|
|
typedef int edit_t;
|
|
const edit_t SES_DELETE = -1;
|
|
const edit_t SES_COMMON = 0;
|
|
const edit_t SES_ADD = 1;
|
|
|
|
/**
|
|
* mark of SES
|
|
*/
|
|
#define SES_MARK_DELETE "-"
|
|
#define SES_MARK_COMMON " "
|
|
#define SES_MARK_ADD "+"
|
|
|
|
/**
|
|
* info for Unified Format
|
|
*/
|
|
typedef struct eleminfo {
|
|
long long beforeIdx; // index of prev sequence
|
|
long long afterIdx; // index of after sequence
|
|
edit_t type; // type of edit(Add, Delete, Common)
|
|
bool operator==(const eleminfo& other) const{
|
|
return (this->beforeIdx == other.beforeIdx && this->afterIdx == other.afterIdx && this->type == other.type);
|
|
}
|
|
} elemInfo;
|
|
|
|
const long long DTL_SEPARATE_SIZE = 3;
|
|
const long long DTL_CONTEXT_SIZE = 3;
|
|
|
|
/**
|
|
* cordinate for registering route
|
|
*/
|
|
typedef struct Point {
|
|
long long x; // x cordinate
|
|
long long y; // y cordinate
|
|
long long k; // vertex
|
|
} P;
|
|
|
|
/**
|
|
* limit of cordinate size
|
|
*/
|
|
const unsigned long long MAX_CORDINATES_SIZE = 2000000;
|
|
|
|
typedef vector< long long > editPath;
|
|
typedef vector< P > editPathCordinates;
|
|
|
|
/**
|
|
* Structure of Unified Format Hunk
|
|
*/
|
|
template <typename sesElem>
|
|
struct uniHunk {
|
|
long long a, b, c, d; // @@ -a,b +c,d @@
|
|
vector< sesElem > common[2]; // anteroposterior commons on changes
|
|
vector< sesElem > change; // changes
|
|
long long inc_dec_count; // count of increace and decrease
|
|
};
|
|
|
|
#define dtl_typedefs(elem, sequence) \
|
|
typedef pair< elem, elemInfo > sesElem; \
|
|
typedef vector< sesElem > sesElemVec; \
|
|
typedef vector< uniHunk< sesElem > > uniHunkVec; \
|
|
typedef list< elem > elemList; \
|
|
typedef vector< elem > elemVec; \
|
|
typedef typename uniHunkVec::iterator uniHunkVec_iter; \
|
|
typedef typename sesElemVec::iterator sesElemVec_iter; \
|
|
typedef typename elemList::iterator elemList_iter; \
|
|
typedef typename sequence::iterator sequence_iter; \
|
|
typedef typename sequence::const_iterator sequence_const_iter; \
|
|
typedef typename elemVec::iterator elemVec_iter;
|
|
|
|
|
|
}
|
|
|
|
#endif // DTL_VARIABLES_H
|