/usr/include/seqan/chaining/chain_point.h is in seqan-dev 1.3-1ubuntu2.
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 | // ==========================================================================
// 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.
//
// ==========================================================================
#ifndef SEQAN_HEADER_CHAINPOINT_H
#define SEQAN_HEADER_CHAINPOINT_H
namespace seqan
{
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// Class ChainPoint_
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/*DISABLED
.Class.ChainPoint_:
..summary:Basic data structure to represent the end-point of a fragment for use in a RMT
..cat:Chaining
..signature:ChainPoint_< TFragType, TSpec >
..param.TFragType:Type of the class which represents the limits (multidimensional point) of an fragment.
..param.TSpec:Spec of the ChainPoint_.
..include:seqan/chaining.h
*/
template< typename TFragType, typename TSpec >
struct Spec< ChainPoint_< TFragType, TSpec > >
{
typedef TSpec Type;
};
template< typename TFragType, typename TSpec, typename TSize > inline
typename Key< TFragType >::Type
key( ChainPoint_< TFragType, TSpec > & me,
TSize dim )
{
SEQAN_CHECK2( me._coords != NULL, "point not initialized" )
SEQAN_CHECK2( dim <= me._dim, "dim corrupted" )
return me._coords[ dim ];
}
template< typename TFragType, typename TSpec, typename TSize > inline
typename Key< TFragType >::Type
key( const ChainPoint_< TFragType, TSpec > & me,
TSize dim )
{
SEQAN_CHECK2( me._coords != NULL, "point not initialized" )
SEQAN_ASSERT( dim <= me._dim )
return me._coords[ dim ];
}
template< typename TFragType, typename TSpec, typename TSize, typename TKey > inline
void
setKey( ChainPoint_< TFragType, TSpec > & me,
TSize dim,
TKey val )
{
SEQAN_ASSERT( dim <= me._dim )
me._coords[ dim ] = val;
}
template< typename TFragType, typename TSpec, typename TSize, typename TKey > inline
void
setKey( const ChainPoint_< TFragType, TSpec > & me,
TSize dim,
TKey val )
{
SEQAN_ASSERT( dim <= me._dim )
me._coords[ dim ] = val;
}
template< typename TFragType, typename TSpec, typename TSize > inline
void
_incKey( ChainPoint_< TFragType, TSpec > & me,
TSize dim )
{
SEQAN_ASSERT( dim <= me._dim )
++me._coords[ dim ];
}
// get the related fragment
template< typename TFragType, typename TSpec > inline
TFragType &
_getFrag( ChainPoint_< TFragType, TSpec > & me )
{
SEQAN_ASSERT( me._meta != NULL )
return _getFrag( *me._meta );
}
template< typename TFragType, typename TSpec > inline
TFragType &
_getFrag( const ChainPoint_< TFragType, TSpec > & me )
{
SEQAN_ASSERT( me._meta != NULL )
return _getFrag( *me._meta );
}
// get the related metainformation struct
template< typename TFragType, typename TSpec > inline
MetaFragment_< TFragType > &
_meta( ChainPoint_< TFragType, TSpec > & me )
{
return *me._meta;
}
template< typename TFragType, typename TSpec > inline
MetaFragment_< TFragType > &
_meta( const ChainPoint_< TFragType, TSpec > & me )
{
return *me._meta;
}
// set the related metainformation struct
template< typename TFragType, typename TSpec > inline
void
_setMeta( ChainPoint_< TFragType, TSpec > & me,
MetaFragment_< TFragType > & meta )
{
me._meta = meta;
}
template< typename TFragType, typename TSpec > inline
void
_setMeta( const ChainPoint_< TFragType, TSpec > & me,
MetaFragment_< TFragType > & meta )
{
me._meta = meta;
}
template< typename TFragType, typename TSpec > inline
typename Size< TFragType >::Type
dimension( ChainPoint_< TFragType, TSpec > & me )
{
return me._dim;
}
template< typename TFragType, unsigned int ISize > inline
typename Size< TFragType >::Type
dimension( ChainPoint_< TFragType, Array< ISize > > &)
{
return ISize;
}
template< typename TFragType, typename TSpec > inline
typename Weight< TFragType >::Type
priority( ChainPoint_< TFragType, TSpec > & me )
{
return me._prio;
}
template< typename TFragType, typename TSpec, typename TPrio > inline
void
setPriority( ChainPoint_< TFragType, TSpec > & me,
TPrio prio )
{
me._prio = prio;
}
template< typename TFragType, typename TSpec >
struct ChainPoint_
{
MetaFragment_< TFragType > * _meta;
typename Key< TFragType >::Type * _coords;
typename Size< TFragType >::Type _dim;
typename Weight< TFragType >::Type _prio;
public:
// standard constructor for use in skiplist
ChainPoint_( )
: _meta( NULL )
, _coords( NULL )
, _dim( 1 )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
allocate( *this, _coords, _dim );
}
ChainPoint_( typename Size< TFragType >::Type dim )
: _meta( NULL )
, _coords( NULL )
, _dim( dim )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
allocate( *this, _coords, _dim );
}
ChainPoint_( MetaFragment_< TFragType > & meta,
bool begin = false )
: _meta( &meta )
, _coords( NULL )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
TFragType * frag = &_getFrag( meta );
_dim = dimension( *frag );
allocate( *this, _coords, _dim );
if( begin ){
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = leftPosition( *frag, i );
}
}
else{
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = rightPosition( *frag, i );
}
}
}
template< typename TSize >
ChainPoint_( MetaFragment_< TFragType > & meta,
TSize dim,
bool begin = false )
: _meta( &meta )
, _coords( NULL )
, _dim( dim )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
TFragType * frag = &_getFrag( meta );
allocate( *this, _coords, _dim );
if( begin ){
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = leftPosition( *frag, i );
}
}
else{
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = rightPosition( *frag, i );
}
}
}
ChainPoint_( typename Key< TFragType >::Type * coords,
typename Size< TFragType >::Type dim,
MetaFragment_< TFragType > * meta,
bool /*begin = false*/ )
: _meta( meta )
, _coords( NULL )
, _dim( dim )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
allocate( *this, _coords, _dim );
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = coords[ i ];
}
}
ChainPoint_( typename Key< TFragType >::Type * coords,
typename Size< TFragType >::Type dim )
: _meta( NULL )
, _coords( NULL )
, _dim( dim )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
allocate( *this, _coords, _dim );
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = coords[ i ];
}
}
~ChainPoint_()
{
deallocate( *this, _coords, _dim );
_coords = NULL;
_meta = NULL;
_dim = 0;
}
ChainPoint_( const ChainPoint_ & old )
{
_meta = old._meta;
_dim = old._dim;
_prio = old._prio;
allocate( *this, _coords, _dim );
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = old._coords[ i ];
}
}
ChainPoint_ & operator=( const ChainPoint_ & old )
{
if ( this == &old )
return *this;
_meta = old._meta;
if( _coords )
deallocate( *this, _coords, _dim );
_dim = old._dim;
_prio = old._prio;
allocate( *this, _coords, _dim );
for( typename Size< TFragType >::Type i = 0; i < _dim; ++i )
{
_coords[ i ] = old._coords[ i ];
}
return *this;
}
friend inline
void
dump( ChainPoint_ & me )
{
std::cout << "[ ";
typename Size< Seed< TFragType > >::Type dim = 0;
std::cout << key( me, dim );
++dim;
while( dim != me._dim )
{
std::cout << " , " << key( me, dim );
++dim;
}
std::cout << " ] "<< me._prio << std::endl;
}
};
template< typename TFragType, unsigned int ISize>
struct ChainPoint_< TFragType, Array< ISize > >
{
typename Key< TFragType >::Type _coords[ISize];
MetaFragment_< TFragType > * _meta;
typename Weight< TFragType >::Type _prio;
public:
// standard constructor for use in skiplist
ChainPoint_( )
: _meta( NULL )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
}
ChainPoint_( typename Size< TFragType >::Type )
: _meta( NULL )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
}
ChainPoint_( MetaFragment_< TFragType > & meta,
bool begin = false )
: _meta( &meta )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
TFragType * frag = &_getFrag( meta );
if( begin ){
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = leftPosition( *frag, i );
}
}
else{
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = rightPosition( *frag, i );
}
}
}
template< typename TSize >
ChainPoint_( MetaFragment_< TFragType > & meta,
TSize,
bool begin = false )
: _meta( &meta )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
TFragType * frag = &_getFrag( meta );
if( begin ){
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = leftPosition( *frag, i );
}
}
else{
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = rightPosition( *frag, i );
}
}
}
ChainPoint_( typename Key< TFragType >::Type * coords,
typename Size< TFragType >::Type /*dim*/,
MetaFragment_< TFragType > * meta,
bool /*begin = false*/ )
: _meta( meta )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = coords[ i ];
}
}
ChainPoint_( typename Key< TFragType >::Type * coords,
typename Size< TFragType >::Type /*dim*/ )
: _meta( NULL )
, _prio( minValue< typename Weight< TFragType >::Type >() )
{
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = coords[ i ];
}
}
~ChainPoint_()
{
_meta = NULL;
}
ChainPoint_( const ChainPoint_ & old )
{
_meta = old._meta;
_prio = old._prio;
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = old._coords[ i ];
}
}
ChainPoint_ & operator=( const ChainPoint_ & old )
{
if ( this == &old )
return *this;
_meta = old._meta;
_prio = old._prio;
for( typename Size< TFragType >::Type i = 0; i < ISize; ++i )
{
_coords[ i ] = old._coords[ i ];
}
return *this;
}
friend inline
void
dump( ChainPoint_ & me )
{
std::cout << "[ ";
typename Size< Seed< TFragType > >::Type dim = 0;
std::cout << key( me, dim );
++dim;
while( dim != ISize )
{
std::cout << " , " << key( me, dim );
++dim;
}
std::cout << " ] "<< me._prio << std::endl;
}
};
} // namespace
#endif // SEQAN_HEADER_CHAINPOINT_H
|