/usr/include/seqan/index/shape_gapped.h is in seqan-dev 1.3.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 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 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 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 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 | // ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2010, Knut Reinert, FU Berlin
// 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 Knut Reinert or the FU Berlin 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 KNUT REINERT OR THE FU BERLIN 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.
//
// ==========================================================================
// Author: David Weese <david.weese@fu-berlin.de>
// ==========================================================================
#ifndef SEQAN_HEADER_SHAPE_GAPPED_H
#define SEQAN_HEADER_SHAPE_GAPPED_H
namespace SEQAN_NAMESPACE_MAIN
{
//////////////////////////////////////////////////////////////////////////////
// HardwiredShape allows compiler-time defined gapped shape
/**
.Class.HardwiredShape:
..cat:Index
..summary:A structure to define a fixed gapped shape.
..signature:HardwiredShape<P1, P2, ..., Pn>
..param.Pi:Pi is the distance of the i'th '1' to the next '1' in the shape.
...nowarn:unknown param
...remarks:At most 20 parameters are allowed, so the maximal shape weight is 21.
..remarks:You can use this structure to define your one gapped shapes in conjunction with @Spec.GappedShape@.
...note:The shape $1100101$ corresponds to $HardwiredShape<1,3,2>$.
...note:The following predefined shapes are already available in $seqan/index/shape_predefined.h$:
..file:../seqan/index/shape_predefined.h
..include:seqan/index.h
*/
// Pxx = spaces between '1's
template <
int P00 = 0, int P01 = 0, int P02 = 0, int P03 = 0, int P04 = 0,
int P05 = 0, int P06 = 0, int P07 = 0, int P08 = 0, int P09 = 0,
int P10 = 0, int P11 = 0, int P12 = 0, int P13 = 0, int P14 = 0,
int P15 = 0, int P16 = 0, int P17 = 0, int P18 = 0, int P19 = 0
>
struct HardwiredShape {
static const int DIFFS[];
};
template <
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19
>
const int HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
>::DIFFS[] = {
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19, 0
};
//////////////////////////////////////////////////////////////////////////////
// LENGTH meta-function for fixed gapped shapes
template <>
struct LENGTH< HardwiredShape<
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0> >
{
enum { VALUE = 1 };
};
template <
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19
>
struct LENGTH< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19> >
{
enum { VALUE = LENGTH< HardwiredShape<
P01,P02,P03,P04,P05,
P06,P07,P08,P09,P10,
P11,P12,P13,P14,P15,
P16,P17,P18,P19, 0 > >::VALUE + P00 };
};
template <
typename TValue,
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19
>
struct LENGTH< Shape<TValue, GappedShape< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > > >:
LENGTH< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > {};
//////////////////////////////////////////////////////////////////////////////
// WEIGHT meta-function for fixed gapped shapes
template <>
struct WEIGHT< HardwiredShape<
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0> >
{
enum { VALUE = 1 };
};
template <
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19
>
struct WEIGHT< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19> >
{
enum { VALUE = WEIGHT< HardwiredShape<
P01,P02,P03,P04,P05,
P06,P07,P08,P09,P10,
P11,P12,P13,P14,P15,
P16,P17,P18,P19, 0 > >::VALUE + 1 };
};
template <
typename TValue,
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19
>
struct WEIGHT< Shape<TValue, GappedShape< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > > >:
WEIGHT< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > {};
//////////////////////////////////////////////////////////////////////////////
/**
.Spec.GenericShape:
..cat:Index
..summary:A variable gapped shape.
..general:Class.Shape
..signature:Shape<TValue, GenericShape>
..param.TValue:The @Metafunction.Value@ type of the string the shape is applied to (e.g. $Dna$).
..remarks:A GenericShape must be initialized first with a valid shape. To do so, call @Function.stringToShape@.
..see:Spec.GappedShape
..include:seqan/index.h
*/
//////////////////////////////////////////////////////////////////////////////
// variable gapped shape
//////////////////////////////////////////////////////////////////////////////
template <typename TValue>
class Shape<TValue, GenericShape>
{
public:
//____________________________________________________________________________
unsigned span;
unsigned weight;
String<int> diffs;
typename Value<Shape>::Type hValue; // current hash value
//____________________________________________________________________________
/**
.Memfunc.GenericShape#Shape:
..class:Spec.GenericShape
..summary:Constructor
..signature:Shape<TValue, GenericShape> ()
..signature:Shape<TValue, GenericShape> (q)
..signature:Shape<TValue, GenericShape> (shape)
..signature:Shape<TValue, GenericShape> (bitmap)
..signature:Shape<TValue, GenericShape> (predefined)
..param.q:Creates an ungapped q-gram.
..param.shape:Any other gapped/ungapped shape.
..param.bitmap:Bitmap string. Sequence of '0's and '1's.
...see:Function.stringToShape
..param.predefined:Any instance of a predefined shape spec (e.g. $ShapePatternHunter$).
..see:Class.HardwiredShape
*/
Shape():
hValue(0) {}
// c'tor for ungapped shapes
Shape(unsigned _span):
span(_span),
weight(_span),
hValue(0)
{
SEQAN_CHECKPOINT
resize(diffs, _span);
for(unsigned i = 0; i < _span; ++i)
diffs[i] = 1;
}
Shape(Shape const &other):
span(other.span),
weight(other.weight),
diffs(other.diffs),
hValue(other.hValue) {}
template <typename TSpec>
Shape(Shape<TValue, TSpec> const &other)
{
*this = other;
}
template <typename TSpec>
Shape(GappedShape<TSpec> const &other)
{
*this = other;
}
template <typename TStringValue, typename TSpec>
Shape(String<TStringValue, TSpec> const &bitmap)
{
*this = bitmap;
}
//____________________________________________________________________________
template <unsigned q>
inline Shape &
operator=(Shape<TValue, UngappedShape<q> > const &other)
{
span = length(other);
weight = seqan::weight(other);
resize(diffs, weight);
for(unsigned i = 1; i < weight; ++i)
diffs[i] = 1;
hValue = other.hValue;
return *this;
}
template <typename TSpec>
inline Shape &
operator=(Shape<TValue, GappedShape<TSpec> > const &other)
{
span = other.span;
weight = other.weight;
diffs = other.diffs;
hValue = other.hValue;
return *this;
}
template <typename TSpec>
inline Shape &
operator=(GappedShape<TSpec> const)
{
typedef Shape<TValue, GappedShape<TSpec> > TShape;
return *this = TShape();
}
template <typename TStringValue, typename TSpec>
inline Shape &
operator=(String<TStringValue, TSpec> const &bitmap)
{
stringToShape(*this, bitmap);
return *this;
}
};
//////////////////////////////////////////////////////////////////////////////
/**
.Spec.GappedShape:
..cat:Index
..summary:A fixed gapped shape.
..general:Class.Shape
..signature:Shape<TValue, GappedShape<TSpec> >
..param.TValue:The @Metafunction.Value@ type of the string the shape is applied to (e.g. $Dna$).
..param.TSpec:A structure to store the shape at compile-time.
...type:Class.HardwiredShape
..remarks:There are predefined shapes in $index/shape_predefined.h$.
You can simply use them with $Shape<TValue, ShapePatternHunter>$ for example.
..see:Class.HardwiredShape
..include:seqan/index.h
*/
//////////////////////////////////////////////////////////////////////////////
// fixed gapped shape
//////////////////////////////////////////////////////////////////////////////
template <typename TValue, typename TSpec>
class Shape<TValue, GappedShape<TSpec> >
{
public:
//____________________________________________________________________________
typedef GappedShape<TSpec> TShapeSpec;
enum { span = LENGTH<Shape>::VALUE };
enum { weight = WEIGHT<Shape>::VALUE };
const int *diffs;
typename Value<Shape>::Type hValue; // current hash value
//____________________________________________________________________________
Shape():
diffs(TSpec::DIFFS),
hValue(0) {}
Shape(Shape const &other):
diffs(other.diffs),
hValue(other.hValue) {}
//____________________________________________________________________________
inline Shape &
operator=(Shape const &other)
{
hValue = other.hValue;
return *this;
}
};
//////////////////////////////////////////////////////////////////////////////
template <typename TValue, typename TSpec>
inline typename Size< Shape<TValue, GappedShape<TSpec> > >::Type
weight(Shape<TValue, GappedShape<TSpec> > const & me)
{
SEQAN_CHECKPOINT
return me.weight;
}
//____________________________________________________________________________
template <typename TValue, typename TIter>
inline typename Value< Shape<TValue, GenericShape> >::Type
hash(Shape<TValue, GenericShape> &me, TIter it)
{
SEQAN_CHECKPOINT
typedef typename Value< Shape<TValue, GenericShape> >::Type THValue;
typedef typename Size< Shape<TValue, GenericShape> >::Type TSize;
me.hValue = ordValue((TValue)*it);
TSize iEnd = me.weight - 1;
for(TSize i = 0; i < iEnd; ++i) {
goFurther(it, me.diffs[i]);
me.hValue = me.hValue * ValueSize<TValue>::VALUE + ordValue((TValue)*it);
}
return me.hValue;
}
template <typename TValue, typename TSpec, typename TIter, typename TSize>
inline typename Value< Shape<TValue, GappedShape<TSpec> > >::Type
hash(Shape<TValue, GappedShape<TSpec> > &me, TIter it, TSize charsLeft)
{
SEQAN_CHECKPOINT
typedef typename Value< Shape<TValue, GappedShape<TSpec> > >::Type THValue;
if (charsLeft >= (TSize)me.span)
return hash(me, it);
TSize i = 0;
if (charsLeft > 0) {
me.hValue = ordValue((TValue)*it);
TSize d;
while (charsLeft > (d = me.diffs[i])) {
charsLeft -= d;
goFurther(it, d);
me.hValue = me.hValue * ValueSize<TValue>::VALUE + ordValue((TValue)*it);
++i;
}
++i;
} else
return me.hValue = 0;
// fill shape with zeros
for(; i < (TSize)me.weight; ++i)
me.hValue *= ValueSize<TValue>::VALUE;
return me.hValue;
}
template <typename TValue, typename TSpec, typename TIter, typename TSize>
inline typename Value< Shape<TValue, GappedShape<TSpec> > >::Type
hashUpper(Shape<TValue, GappedShape<TSpec> > &me, TIter it, TSize charsLeft)
{
SEQAN_CHECKPOINT
typedef typename Value< Shape<TValue, GappedShape<TSpec> > >::Type THValue;
if (charsLeft >= (TSize)me.span) {
hash(me, it);
return ++me.hValue;
}
TSize i = 0;
if (charsLeft > 0) {
me.hValue = ordValue((TValue)*it);
TSize d;
while (charsLeft > (d = me.diffs[i])) {
charsLeft -= d;
goFurther(it, d);
me.hValue = me.hValue * ValueSize<TValue>::VALUE + ordValue((TValue)*it);
++i;
}
++i;
++me.hValue;
} else
me.hValue = 1;
// fill shape with zeros
for(; i < (TSize)me.weight; ++i)
me.hValue *= ValueSize<TValue>::VALUE;
return me.hValue;
}
//____________________________________________________________________________
template <typename THValue, typename TValue, typename TIter>
inline THValue
_hashHardwiredShape(THValue hash, TIter &, TValue const, HardwiredShape<
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0,
0,0,0,0,0 > const)
{
return hash;
}
template <
int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19,
typename THValue, typename TValue, typename TIter
>
inline THValue
_hashHardwiredShape(THValue hash, TIter &it, TValue const, HardwiredShape<
1 ,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19 > const)
{
++it;
return _hashHardwiredShape(hash * ValueSize<TValue>::VALUE + ordValue((TValue)*it),
it, TValue(), HardwiredShape<
P01,P02,P03,P04,P05,
P06,P07,P08,P09,P10,
P11,P12,P13,P14,P15,
P16,P17,P18,P19, 0 >());
}
template <
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19,
typename THValue, typename TValue, typename TIter
>
inline THValue
_hashHardwiredShape(THValue hash, TIter &it, TValue const, HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19 > const)
{
it += P00;
return _hashHardwiredShape(hash * ValueSize<TValue>::VALUE + ordValue((TValue)*it),
it, TValue(), HardwiredShape<
P01,P02,P03,P04,P05,
P06,P07,P08,P09,P10,
P11,P12,P13,P14,P15,
P16,P17,P18,P19, 0 >());
}
template <
int P00, int P01, int P02, int P03, int P04,
int P05, int P06, int P07, int P08, int P09,
int P10, int P11, int P12, int P13, int P14,
int P15, int P16, int P17, int P18, int P19,
typename TValue, typename TIter
>
inline typename Value< Shape<TValue, GappedShape< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > > >::Type
hash(Shape<TValue, GappedShape< HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19
> > > &me, TIter it)
{
SEQAN_CHECKPOINT
typedef HardwiredShape<
P00,P01,P02,P03,P04,
P05,P06,P07,P08,P09,
P10,P11,P12,P13,P14,
P15,P16,P17,P18,P19 > TSpec;
typedef GappedShape<TSpec> TShape;
typedef typename Value< Shape<TValue, TShape> >::Type THValue;
me.hValue = (THValue)ordValue((TValue)*it);
return me.hValue = _hashHardwiredShape(me.hValue, it, TValue(), TSpec());
}
//____________________________________________________________________________
template <typename TValue, typename TSpec, typename TIter>
inline typename Value< Shape<TValue, GappedShape<TSpec> > >::Type
hashNext(Shape<TValue, GappedShape<TSpec> > &me, TIter &it)
{
SEQAN_CHECKPOINT
return hash(me, it);
}
//____________________________________________________________________________
///.Function.stringToShape.param.shape.type:Spec.GenericShape
template <typename TValue, typename TSpec, typename TShapeString>
inline bool
stringToShape(
Shape<TValue, GappedShape<TSpec> > &me,
TShapeString const &bitmap)
{
SEQAN_CHECKPOINT
typedef typename Iterator<TShapeString const>::Type TIter;
typedef typename Iterator<String<int> >::Type TShapeIter;
unsigned oneCount = 0;
TIter it = begin(bitmap, Standard());
TIter itEnd = end(bitmap, Standard());
for(; it != itEnd; ++it)
if (*it == '1')
++oneCount;
if ((me.weight = oneCount) == 0) {
me.span = 0;
return false;
}
resize(me.diffs, oneCount - 1);
unsigned diff = 1;
me.span = 1;
TShapeIter itS = begin(me.diffs, Standard());
it = begin(bitmap, Standard());
// skip leading zeros
for(; it != itEnd && *it == '0' ; ++it) ;
if (*it != '1')
return false;
for(++it; it != itEnd; ++it)
{
if (*it == '1')
{
me.span += diff;
*itS = diff;
++itS;
diff = 0;
}
++diff;
}
return true;
}
//____________________________________________________________________________
template <typename TShapeString, typename TValue, typename TSpec>
inline void
shapeToString(
TShapeString &bitmap,
Shape<TValue, GappedShape<TSpec> > const &me)
{
SEQAN_CHECKPOINT
clear(bitmap);
reserve(bitmap, length(me));
appendValue(bitmap, '1');
for (unsigned i = 0; i < weight(me) - 1; ++i)
{
for (int j = 1; j < me.diffs[i]; ++j)
appendValue(bitmap, '0');
appendValue(bitmap, '1');
}
}
//____________________________________________________________________________
///.Function.reverse.param.object.type:Spec.GenericShape
template <typename TValue, typename TSpec>
inline void
reverse(Shape<TValue, GappedShape<TSpec> > &me)
{
SEQAN_CHECKPOINT
reverse(me.diffs);
}
} // namespace seqan
#endif
|