Newer
Older
/*
* BorderArrayNaive.h
*
* Created on: 5. 11. 2014
* Author: Jan Travnicek
*/
#ifndef _ARBOLOGY_BORDER_ARRAY_NAIVE_H_
#define _ARBOLOGY_BORDER_ARRAY_NAIVE_H_
#include <tree/ranked/PrefixRankedBarNonlinearPattern.h>
#include <tree/ranked/PrefixRankedBarPattern.h>
#include <tree/ranked/PrefixRankedNonlinearPattern.h>
#include <tree/ranked/PrefixRankedPattern.h>
/**
* Computation of BCS table for BMH from MI(E+\eps)-EVY course 2014
* To get rid of zeros in BCS table we ignore last haystack character
*/
template < class SymbolType, class RankType >
static bool matches ( const tree::PrefixRankedBarNonlinearPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset );
template < class SymbolType, class RankType >
static bool matches ( const tree::PrefixRankedBarPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset );
template < class SymbolType, class RankType >
static bool matches ( const tree::PrefixRankedNonlinearPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset );
template < class SymbolType, class RankType >
static bool matches ( const tree::PrefixRankedPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset );
/**
* Search for pattern in linear string.
* @return set set of occurences
*/
template < class SymbolType, class RankType >
static ext::vector < size_t > ba ( const tree::PrefixRankedBarNonlinearPattern < SymbolType, RankType > & pattern );
/**
* Search for pattern in linear string.
* @return set set of occurences
*/
template < class SymbolType, class RankType >
static ext::vector < size_t > ba ( const tree::PrefixRankedBarPattern < SymbolType, RankType > & pattern );
/**
* Search for pattern in linear string.
* @return set set of occurences
*/
template < class SymbolType, class RankType >
static ext::vector < size_t > ba ( const tree::PrefixRankedNonlinearPattern < SymbolType, RankType > & pattern );
/**
* Search for pattern in linear string.
* @return set set of occurences
*/
template < class SymbolType, class RankType >
static ext::vector < size_t > ba ( const tree::PrefixRankedPattern < SymbolType, RankType > & pattern );
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
template < class SymbolType, class RankType >
bool BorderArrayNaive::matches ( const tree::PrefixRankedBarNonlinearPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset ) {
unsigned i = 0;
while ( offset < stop && i < pattern.getContent ( ).size ( ) )
if ( pattern.getContent ( )[i] == pattern.getContent ( )[offset] ) {
i++;
offset++;
} else if ( ( pattern.getContent ( )[i] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getNonlinearVariables ( ).count ( pattern.getContent ( ) [ i ] ) )
|| ( pattern.getContent ( )[offset] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getNonlinearVariables ( ).count ( pattern.getContent ( ) [ offset ] ) ) ) {
i = subtreeJumpTable[i];
offset = subtreeJumpTable[offset];
} else {
return false;
}
return true;
}
template < class SymbolType, class RankType >
ext::vector < size_t > BorderArrayNaive::ba ( const tree::PrefixRankedBarNonlinearPattern < SymbolType, RankType > & pattern ) {
ext::vector < int > patternSubtreeJumpTable = SubtreeJumpTable::compute ( pattern );
ext::vector < size_t > res;
for ( unsigned i = 0; i <= pattern.getContent ( ).size ( ); i++ )
res.push_back ( 0 );
res[0] = -1;
for ( unsigned i = 1; i <= pattern.getContent ( ).size ( ); i++ ) {
int min = i;
for ( unsigned j = 1; j < i; j++ )
if ( matches ( pattern, patternSubtreeJumpTable, i, j ) ) {
min = j;
break;
}
res[i] = i - min;
}
/* if ( common::GlobalData::verbose )
common::Streams::log << res << std::endl;*/
return res;
}
template < class SymbolType, class RankType >
bool BorderArrayNaive::matches ( const tree::PrefixRankedBarPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset ) {
unsigned i = 0;
while ( offset < stop && i < pattern.getContent ( ).size ( ) )
if ( pattern.getContent ( )[i] == pattern.getContent ( )[offset] ) {
i++;
offset++;
} else if ( ( pattern.getContent ( )[i] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getContent ( )[offset] == pattern.getSubtreeWildcard ( ) ) ) {
i = subtreeJumpTable[i];
offset = subtreeJumpTable[offset];
} else {
return false;
}
return true;
}
template < class SymbolType, class RankType >
ext::vector < size_t > BorderArrayNaive::ba ( const tree::PrefixRankedBarPattern < SymbolType, RankType > & pattern ) {
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
ext::vector < int > patternSubtreeJumpTable = SubtreeJumpTable::compute ( pattern );
ext::vector < size_t > res;
for ( unsigned i = 0; i <= pattern.getContent ( ).size ( ); i++ )
res.push_back ( 0 );
res[0] = -1;
for ( unsigned i = 1; i <= pattern.getContent ( ).size ( ); i++ ) {
int min = i;
for ( unsigned j = 1; j < i; j++ )
if ( matches ( pattern, patternSubtreeJumpTable, i, j ) ) {
min = j;
break;
}
res[i] = i - min;
}
/* if ( common::GlobalData::verbose )
common::Streams::log << res << std::endl;*/
return res;
}
template < class SymbolType, class RankType >
bool BorderArrayNaive::matches ( const tree::PrefixRankedNonlinearPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset ) {
unsigned i = 0;
while ( offset < stop && i < pattern.getContent ( ).size ( ) )
if ( pattern.getContent ( )[i] == pattern.getContent ( )[offset] ) {
i++;
offset++;
} else if ( ( pattern.getContent ( )[i] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getNonlinearVariables ( ).count ( pattern.getContent ( ) [ i ] ) )
|| ( pattern.getContent ( )[offset] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getNonlinearVariables ( ).count ( pattern.getContent ( ) [ offset ] ) ) ) {
i = subtreeJumpTable[i];
offset = subtreeJumpTable[offset];
} else {
return false;
}
return true;
}
template < class SymbolType, class RankType >
ext::vector < size_t > BorderArrayNaive::ba ( const tree::PrefixRankedNonlinearPattern < SymbolType, RankType > & pattern ) {
ext::vector < int > patternSubtreeJumpTable = SubtreeJumpTable::compute ( pattern );
ext::vector < size_t > res;
for ( unsigned i = 0; i <= pattern.getContent ( ).size ( ); i++ )
res.push_back ( 0 );
res[0] = -1;
for ( unsigned i = 1; i <= pattern.getContent ( ).size ( ); i++ ) {
int min = i;
for ( unsigned j = 1; j < i; j++ )
if ( matches ( pattern, patternSubtreeJumpTable, i, j ) ) {
min = j;
break;
}
res[i] = i - min;
}
if ( common::GlobalData::verbose )
common::Streams::log << res << std::endl;
return res;
}
template < class SymbolType, class RankType >
bool BorderArrayNaive::matches ( const tree::PrefixRankedPattern < SymbolType, RankType > & pattern, const ext::vector < int > & subtreeJumpTable, int stop, int offset ) {
unsigned i = 0;
while ( offset < stop && i < pattern.getContent ( ).size ( ) )
if ( pattern.getContent ( )[i] == pattern.getContent ( )[offset] ) {
i++;
offset++;
} else if ( ( pattern.getContent ( )[i] == pattern.getSubtreeWildcard ( ) ) || ( pattern.getContent ( )[offset] == pattern.getSubtreeWildcard ( ) ) ) {
i = subtreeJumpTable[i];
offset = subtreeJumpTable[offset];
} else {
return false;
}
return true;
}
template < class SymbolType, class RankType >
ext::vector < size_t > BorderArrayNaive::ba ( const tree::PrefixRankedPattern < SymbolType, RankType > & pattern ) {
ext::vector < int > patternSubtreeJumpTable = SubtreeJumpTable::compute ( pattern );
ext::vector < size_t > res;
for ( unsigned i = 0; i <= pattern.getContent ( ).size ( ); i++ )
res.push_back ( 0 );
res[0] = -1;
for ( unsigned i = 1; i <= pattern.getContent ( ).size ( ); i++ ) {
int min = i;
for ( unsigned j = 1; j < i; j++ )
if ( matches ( pattern, patternSubtreeJumpTable, i, j ) ) {
min = j;
break;
}
res[i] = i - min;
}
if ( common::GlobalData::verbose )
common::Streams::log << res << std::endl;
} /* namespace properties */
} /* namespace tree */
#endif /* _ARBOLOGY_BORDER_ARRAY_NAIVE_H_ */