File: adapt_std_vector.h

package info (click to toggle)
openms 2.6.0%2Bcleaned1-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 783,124 kB
  • sloc: cpp: 526,887; xml: 142,287; ansic: 54,252; python: 11,640; php: 2,454; sh: 1,137; ruby: 529; yacc: 403; perl: 85; lex: 74; makefile: 60
file content (806 lines) | stat: -rw-r--r-- 25,390 bytes parent folder | download | duplicates (6)
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
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
// ==========================================================================
//                 SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2013, 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: Knut Reinert <knut.reinert@fu-berlin.de>
// ==========================================================================
// Adaptions for STL vectors to SeqAn strings.
// ==========================================================================

// SEQAN_NO_GENERATED_FORWARDS: No forwards are generated for this file.

#ifndef SEQAN_SEQUENCE_ADAPT_STD_VECTOR_H_
#define SEQAN_SEQUENCE_ADAPT_STD_VECTOR_H_

namespace seqan {

// ===========================================================================
// Enums, Tags, Classes, Specializations
// ===========================================================================

/**
.Adaption."std::vector"
..summary:Adaption for STL vector class.
 */

// ===========================================================================
// Metafunctions
// ===========================================================================

///.Metafunction.IsContiguous.param.T.type:Adaption.std::vector
///.Metafunction.IsContiguous.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct IsContiguous< std::vector<TChar, TAlloc> >
{
    enum { VALUE = true };
};

template <typename  TChar, typename TAlloc>
struct IsContiguous< std::vector<TChar, TAlloc> const>
        : IsContiguous< std::vector<TChar, TAlloc> > {};

///.Metafunction.Value.param.T.type:Adaption.std::vector
///.Metafunction.Value.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct Value< std::vector<TChar, TAlloc> >
{
    typedef typename std::vector<TChar, TAlloc>::value_type Type;
};

template <typename TChar, typename TAlloc>
struct Value< std::vector<TChar, TAlloc> const>
        : Value< std::vector<TChar, TAlloc> > {};

///.Metafunction.GetValue.param.T.type:Adaption.std::vector
// TODO(holtgrew): GetValue is a reference?! I thought the reverse was true in respect to Value<>.
///.Metafunction.GetValue.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct GetValue< std::vector<TChar, TAlloc> >
{
    typedef typename std::vector<TChar, TAlloc>::reference Type;
};

template <typename TChar, typename TAlloc>
struct GetValue< std::vector<TChar,  TAlloc> const>
{
    typedef typename std::vector<TChar, TAlloc>::const_reference Type;
};

///.Metafunction.Reference.param.T.type:Adaption.std::vector
///.Metafunction.Reference.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct Reference< std::vector<TChar, TAlloc> >
{
    typedef typename std::vector<TChar, TAlloc>::reference Type;
};

template <typename TChar,  typename TAlloc>
struct Reference< std::vector<TChar, TAlloc> const>
{
    typedef typename std::vector<TChar,  TAlloc>::const_reference Type;
};

///.Metafunction.Iterator.param.T.type:Adaption.std::vector
///.Metafunction.Iterator.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct Iterator< std::vector<TChar, TAlloc>, Rooted>
{
    typedef std::vector<TChar, TAlloc> TVector_;
    typedef Iter<TVector_, StdIteratorAdaptor> TIterator_;
    typedef Iter<TVector_, AdaptorIterator<TIterator_> > Type;
};

template <typename TChar, typename TAlloc>
struct Iterator< std::vector<TChar, TAlloc> const, Rooted>
{
    typedef std::vector<TChar, TAlloc> const TVector_;
    typedef Iter<TVector_, StdIteratorAdaptor> TIterator_;
    typedef Iter<TVector_, AdaptorIterator<TIterator_> > Type;
};

template <typename TChar,  typename TAlloc>
struct Iterator< std::vector<TChar, TAlloc>, Standard >
{
    typedef Iter< std::vector<TChar,  TAlloc>, StdIteratorAdaptor > Type;
};

template <typename TChar,  typename TAlloc>
struct Iterator< std::vector<TChar,  TAlloc> const, Standard>
{
    typedef Iter< std::vector<TChar, TAlloc> const, StdIteratorAdaptor > Type;
};

///.Metafunction.Position.param.T.type:Adaption.std::vector
///.Metafunction.Position.class:Adaption.std::vector

template <typename TChar,  typename TAlloc>
struct Position< std::vector<TChar, TAlloc> >
{
    typedef typename std::vector<TChar,  TAlloc>::size_type Type;
};

template <typename TChar,  typename TAlloc>
struct Position< std::vector<TChar,  TAlloc> const>
        : Position< std::vector<TChar,  TAlloc> > {};

///.Metafunction.Position.param.T.type:Adaption.std::vector
///.Metafunction.Position.class:Adaption.std::vector

template <typename TChar,  typename TAlloc>
struct Size< std::vector<TChar, TAlloc> >
{
    typedef typename std::vector<TChar, TAlloc>::size_type Type;
};

template <typename TChar, typename TAlloc>
struct Size< std::vector<TChar, TAlloc> const>
        : Size< std::vector<TChar, TAlloc> > {};

///.Metafunction.Size.param.T.type:Adaption.std::vector
///.Metafunction.Size.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct DefaultOverflowImplicit< std::vector<TChar, TAlloc> >
{
    typedef Generous Type;
};

///.Metafunction.StdContainerIterator.param.T.type:Adaption.std::vector
///.Metafunction.StdContainerIterator.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct StdContainerIterator< std::vector<TChar, TAlloc> >
{
    typedef std::vector<TChar, TAlloc> TContainer_;
    typedef typename TContainer_::iterator Type;
};

template <typename TChar, typename TAlloc>
struct StdContainerIterator< std::vector<TChar, TAlloc> const>
{
    typedef std::vector<TChar, TAlloc> TContainer_;
    typedef typename TContainer_::const_iterator Type;
};

///.Metafunction.IsSequence.param.T.type:Adaption.std::vector
///.Metafunction.IsSequence.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
struct IsSequence<std::vector<TChar, TAlloc> > : True {};

// ===========================================================================
// Functions
// ===========================================================================

///.Function.getObjectId.param.object.type:Adaption.std::vector
///.Function.getObjectId.class:Adaption.std::vector

template <typename TChar,  typename TAlloc>
inline void const *
getObjectId(std::vector<TChar, TAlloc> const & me)
{
    SEQAN_CHECKPOINT;
    if (me.empty())
        return NULL;
    else
        return (& *(me.end() - 1)) + 1;
}

///.Function.begin.param.object.type:Adaption.std::vector
///.Function.begin.class:Adaption.std::vector

template <typename TChar,  typename TAlloc>
inline typename Iterator< std::vector<TChar,  TAlloc>, Standard>::Type
begin(std::vector<TChar,  TAlloc> & me,
      Standard)
{
    SEQAN_CHECKPOINT;
    return typename Iterator< std::vector<TChar,  TAlloc>, Standard>::Type(me.begin());
}
template <typename TChar,  typename TAlloc>
inline typename Iterator< std::vector<TChar,  TAlloc> const, Standard>::Type
begin(std::vector<TChar, TAlloc> const & me,
      Standard)
{
    SEQAN_CHECKPOINT;
    return typename Iterator< std::vector<TChar,  TAlloc> const, Standard>::Type(me.begin());
}

///.Function.end.param.object.type:Adaption.std::vector
///.Function.end.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
inline typename Iterator< std::vector<TChar, TAlloc>, Standard>::Type
end(std::vector<TChar,  TAlloc> & me,
    Standard)
{
    SEQAN_CHECKPOINT;
    return typename Iterator< std::vector<TChar, TAlloc>, Standard>::Type(me.end());
}
template <typename TChar,  typename TAlloc>
inline typename Iterator< std::vector<TChar,  TAlloc> const, Standard>::Type
end(std::vector<TChar,  TAlloc> const & me,
    Standard)
{
    SEQAN_CHECKPOINT;
    return typename Iterator< std::vector<TChar,  TAlloc> const, Standard>::Type(me.end());
}

///.Function.value.param.container.type:Adaption.std::vector
///.Function.value.class:Adaption.std::vector

template <typename TChar,  typename TAlloc, typename TPos>
inline typename GetValue< std::vector<TChar, TAlloc> >::Type
value(std::vector<TChar,  TAlloc> & me,
      TPos pos)
{
    SEQAN_CHECKPOINT;
    return me[pos];
}
template <typename TChar,  typename TAlloc, typename TPos>
inline typename GetValue< std::vector<TChar,  TAlloc> const>::Type
value(std::vector<TChar, TAlloc> const & me,
      TPos pos)
{
    SEQAN_CHECKPOINT;
    return me[pos];
}

///.Function.value.param.container.type:Adaption.std::vector
///.Function.value.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
inline typename Size< std::vector<TChar, TAlloc> >::Type
length(std::vector<TChar, TAlloc> const & me)
{
    SEQAN_CHECKPOINT;
    return me.size();
}

///.Function.capacity.param.object.type:Adaption.std::vector
///.Function.capacity.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
inline typename Size< std::vector<TChar, TAlloc> >::Type
capacity(std::vector<TChar, TAlloc> const & me)
{
    SEQAN_CHECKPOINT;
    return me.capacity();
}

///.Function.empty.param.object.type:Adaption.std::vector
///.Function.empty.class:Adaption.std::vector

template <typename TChar, typename TAlloc>
inline bool
empty(std::vector<TChar, TAlloc> const & me)
{
    SEQAN_CHECKPOINT;
    return me.empty();
}

///.Function.clear.param.object.type:Adaption.std::vector
///.Function.clear.class:Adaption.std::vector

template <typename TChar,  typename TAlloc>
inline void
clear(std::vector<TChar, TAlloc> & me)
{
    SEQAN_CHECKPOINT;
    me.clear();
}

///.Function.front.param.container.type:Adaption.std::vector
///.Function.front.class:Adaption.std::vector

template <typename TChar>
inline typename Reference<std::vector<TChar> >::Type
front(std::vector<TChar> & list)
{
    SEQAN_CHECKPOINT;
    return list.front();
}

template <typename TChar>
inline typename Reference<std::vector<TChar> const>::Type
front(std::vector<TChar> const & list)
{
    SEQAN_CHECKPOINT;
    return list.front();
}

///.Function.back.param.container.type:Adaption.std::vector
///.Function.back.class:Adaption.std::vector

template <typename TChar>
inline typename Reference<std::vector<TChar> >::Type
back(std::vector<TChar> & list)
{
    SEQAN_CHECKPOINT;
    return list.back();
}

template <typename TChar>
inline typename Reference<std::vector<TChar> const>::Type
back(std::vector<TChar> const & list)
{
    SEQAN_CHECKPOINT;
    return list.back();
}

//////////////////////////////////////////////////////////////////////////////
//assign to std::vector

///.Function.assign.param.target.type:Adaption.std::vector
///.Function.assign.class:Adaption.std::vector

template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource & source)
{
    SEQAN_CHECKPOINT;
    assign(target, source, Generous());
}
template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource const & source)
{
    SEQAN_CHECKPOINT;
    assign(target, source, Generous());
}

template <typename TChar,  typename TAlloc, typename TSource, typename TSize>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource & source,
       TSize limit)
{
    SEQAN_CHECKPOINT;
    assign(target, source, limit, Generous());
}
template <typename TChar,  typename TAlloc, typename TSource, typename TSize>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource const & source,
       TSize limit)
{
    SEQAN_CHECKPOINT;
    assign(target, source, limit, Generous());
}

//____________________________________________________________________________

template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar, TAlloc> & target,
       TSource & source,
       Generous)
{
    SEQAN_CHECKPOINT;
    target.assign(begin(source, Standard()), end(source, Standard()));
}
template <typename TChar, typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar, TAlloc> & target,
       TSource const & source,
       Generous)
{
    SEQAN_CHECKPOINT;
    target.assign(begin(source, Standard()), end(source, Standard()));
}


template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign_std_vector_Generous_impl(std::vector<TChar,  TAlloc> & target,
                                TSource & source,
                                typename Size< std::vector<TChar,  TAlloc> >::Type limit)
{
    SEQAN_CHECKPOINT;
    typename Iterator<TSource const, Standard>::Type source_begin = begin(source, Standard());
    typename Size<TSource const>::Type source_length = length(source);
    if (source_length > limit)
    {
        source_length = limit;
    }
    target.assign(source_begin, source_begin + source_length);
}
template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource & source,
       typename Size< std::vector<TChar, TAlloc> >::Type limit,
       Generous)
{
    SEQAN_CHECKPOINT;
    assign_std_vector_Generous_impl(target, source, limit);
}
template <typename TChar,  typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar, TAlloc> & target,
       TSource const & source,
       typename Size< std::vector<TChar, TAlloc> >::Type limit,
       Generous)
{
    SEQAN_CHECKPOINT;
    assign_std_vector_Generous_impl(target, source, limit);
}

//____________________________________________________________________________

template <typename TChar, typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource & source,
       Limit)
{
    SEQAN_CHECKPOINT;
    assign(target, source, target.capacity(), Generous());
}
template <typename TChar, typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource const & source,
       Limit)
{
    SEQAN_CHECKPOINT;
    assign(target, source, target.capacity(), Generous());
}

template <typename TChar, typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar, TAlloc> & target,
       TSource & source,
       typename Size< std::vector<TChar, TAlloc> >::Type limit,
       Limit)
{
    SEQAN_CHECKPOINT;
    if (limit > target.capacity())
    {
        limit = target.capacity();
    }

    assign(target, source, limit, Generous());
}
template <typename TChar, typename TAlloc, typename TSource>
inline void
assign(std::vector<TChar,  TAlloc> & target,
       TSource const & source,
       typename Size< std::vector<TChar,  TAlloc> >::Type limit,
       Limit)
{
    SEQAN_CHECKPOINT;
    if (limit > target.capacity())
    {
        limit = target.capacity();
    }

    assign(target, source, limit, Generous());
}

//////////////////////////////////////////////////////////////////////////////
//append to std::vector

///.Function.append.param.target.type:Adaption.std::vector
///.Function.append.class:Adaption.std::vector

template <typename TChar, typename TAlloc, typename TSource>
inline void
append(std::vector<TChar,  TAlloc> & target,
       TSource const & source,
       Generous)
{
    SEQAN_CHECKPOINT;
    target.insert(target.end(), begin(source, Standard()), end(source, Standard()));
}

template <typename TChar,  typename TAlloc, typename TSource>
inline void
append(std::vector<TChar, TAlloc> & target,
       TSource const & source,
       typename Size< std::vector<TChar, TAlloc> >::Type limit,
       Generous)
{
    SEQAN_CHECKPOINT;
    typename Size< std::vector<TChar, TAlloc> >::Type target_length = target.length();
    if (target_length > limit)
    {
        target.resize(limit);
    }
    else
    {
        limit -= target_length;
        typename Iterator<TSource const, Standard>::Type source_begin = begin(source, Standard());
        typename Size<TSource const>::Type source_length = length(source);
        if (source_length > limit)
        {
            source_length = limit;
        }

        target.insert(target.end(), source_begin, source_begin + source_length);
    }
}

//____________________________________________________________________________

template <typename TChar, typename TAlloc, typename TSource>
inline void
append(std::vector<TChar,  TAlloc> & target,
       TSource const & source,
       Limit)
{
    SEQAN_CHECKPOINT;
    append(target, source, target.capacity(), Generous());
}

template <typename TChar, typename TAlloc, typename TSource>
inline void
append(std::vector<TChar, TAlloc> & target,
       TSource const & source,
       typename Size< std::vector<TChar, TAlloc> >::Type limit,
       Limit)
{
    SEQAN_CHECKPOINT;
    if (limit > target.capacity())
    {
        limit = target.capacity();
    }

    append(target, source, limit, Generous());
}

//////////////////////////////////////////////////////////////////////////////
///.Function.appendValue.param.target.type:Adaption.std::vector
///.Function.appendValue.class:Adaption.std::vector

template <typename TChar, typename TAlloc, typename TValue, typename TTag>
inline void
appendValue(std::vector<TChar, TAlloc> & me,
            TValue const & _value,
            TTag)
{
    SEQAN_CHECKPOINT;
    me.push_back(_value);
}

template <typename TChar, typename TAlloc, typename TValue>
inline void
appendValue(std::vector<TChar,  TAlloc> & me,
            TValue const & _value,
            Limit)
{
    SEQAN_CHECKPOINT;
    if (capacity(me) > length(me)) me.push_back(_value);
}

//////////////////////////////////////////////////////////////////////////////
//replace to std::vector

///.Function.replace.param.target.type:Adaption.std::vector
///.Function.replace.param.source.type:Adaption.std::vector
///.Function.replace.class:Adaption.std::vector

template <typename TChar,  typename TAlloc, typename TSource>
inline void
replace(std::vector<TChar, TAlloc> & target,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_begin,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_end,
        TSource const & source,
        Generous)
{
    SEQAN_CHECKPOINT;
    typename Size< std::vector<TChar, TAlloc> >::Type target_size = pos_end-pos_begin;
    typename Size< std::vector<TChar, TAlloc> >::Type source_size =length(source);

    if(target_size >= source_size)
        {
            copy(source.begin(),source.end(), target.begin()+pos_begin);
            if( target_size > source_size )
                target.erase(target.begin()+pos_begin+source_size,target.begin()+pos_end);
        }
    else
        {
            copy(source.begin(),source.begin()+target_size,target.begin()+pos_begin);
            target.insert(target.begin()+pos_end,source.begin()+target_size,source.end());
        }
}

template <typename TChar, typename TAlloc, typename TSource>
inline void
replace(std::vector<TChar, TAlloc> & target,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_begin,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_end,
        TSource const & source,
        typename Size< std::vector<TChar, TAlloc> >::Type limit,
        Generous)
{
    SEQAN_CHECKPOINT;
    if (pos_begin >= limit)
    {
        target.resize(limit);
    }
    else
    {
        typename Size<TSource const>::Type source_length = length(source);
        typename Size< std::vector<TChar, TAlloc> >::Type pos_mid = pos_begin + source_length;
        typename Size< std::vector<TChar, TAlloc> >::Type pos_limit(limit);
        if (pos_mid > limit)
        {
            target.resize(limit);
            replace(target,pos_begin,pos_limit,source);
            target.resize(limit);
        }
        else
        {
            replace(target,pos_begin,pos_end,source);
            if (target.size() > limit)
            {
                target.resize(limit);
            }
        }
    }

}

template <typename TChar,  typename TAlloc, typename TSource>
inline void
replace(std::vector<TChar,  TAlloc> & target,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_begin,
        typename Position< std::vector<TChar, TAlloc> >::Type pos_end,
        TSource const & source,
        Limit)
{
    SEQAN_CHECKPOINT;
    replace(target, pos_begin, pos_end, source, target.capacity(), Generous());
}

template <typename TChar, typename TAlloc, typename TSource>
inline void
replace(std::vector<TChar, TAlloc> & target,
        typename Position< std::vector<TChar,  TAlloc> >::Type pos_begin,
        typename Position< std::vector<TChar,  TAlloc> >::Type pos_end,
        TSource const & source,
        typename Size< std::vector<TChar, TAlloc> >::Type limit,
        Limit)
{
    SEQAN_CHECKPOINT;
    if (limit > target.capacity())
    {
        limit = target.capacity();
    }
    replace(target, pos_begin, pos_end, source, limit, Generous());
}


//////////////////////////////////////////////////////////////////////////////
// handling of iterators as begin and end

template<typename TChar, typename TCharTraits, typename TAlloc, typename TSource, typename TExpand>
inline void
replace(std::vector<TChar, TAlloc> & target,
        typename Iterator< std::vector<TChar, TAlloc>, Rooted>::Type pos_begin,
        typename Iterator< std::vector<TChar, TAlloc>, Rooted>::Type pos_end,
        TSource & source,
        Tag<TExpand> tag)
{
    replace(target, position(pos_begin), position(pos_end), source, tag);
}

/*
template<typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
replace(std::vector<TChar, TAlloc> & target,
        typename Iterator< std::vector<TChar, TAlloc>, Rooted>::Type pos_begin,
        typename Iterator< std::vector<TChar, TAlloc>, Rooted>::Type pos_end,
        TSource & source,
        typename Size< std::vector<TChar, TAlloc> >::Type limit,
        Tag<TExpand> tag)
{
    replace(target,  position(pos_begin),  position(pos_end), source, tag);
}
*/


///.Function.reserve.param.object.type:Adaption.std::vector
///.Function.reserve.remarks:For @Adaption.std::vector|STL Adaptions@, $reserve$ is only guaranteed to have the specified behaviour with $Insist$ and $Generous$.
///.Function.reserve.class:Adaption.std::vector

template <typename TChar,  typename TAlloc, typename TSize, typename TExpand>
inline typename Size< std::vector<TChar, TAlloc> >::Type
reserve(
    std::vector<TChar, TAlloc> & seq,
    TSize new_capacity,
    Tag<TExpand> tag)
{
    SEQAN_CHECKPOINT;
    seq.reserve(new_capacity);
    return _capacityReturned(seq, new_capacity, tag);
}

template <typename TChar, typename TAlloc, typename TSize>
inline typename Size< std::vector<TChar, TAlloc> >::Type
reserve(
    std::vector<TChar, TAlloc> & seq,
    TSize new_capacity,
    Insist const &)
{
    SEQAN_CHECKPOINT;
    // do nothing
    return _capacityReturned(seq, new_capacity, Insist());
}

template <typename TChar,  typename TAlloc, typename TSize>
inline typename Size< std::vector<TChar, TAlloc> >::Type
reserve(
    std::vector<TChar,  TAlloc> & seq,
    TSize new_capacity,
    Limit const &)
{
    SEQAN_CHECKPOINT;
    // do nothing
    return _capacityReturned(seq, new_capacity, Limit());
}

///.Function.resize.param.object.type:Adaption.std::vector
template <typename TChar,  typename TAlloc, typename TSize, typename TExpand>
inline typename Size< std::vector<TChar,  TAlloc> >::Type
resize(
    std::vector<TChar, TAlloc> & me,
    TSize new_length,
    Tag<TExpand>)
{
    SEQAN_CHECKPOINT;
    me.resize(new_length);
    return me.size();
}

template <typename TChar, typename TAlloc, typename TSize, typename TExpand>
inline typename Size< std::vector<TChar,  TAlloc> >::Type
fill(
    std::vector<TChar, TAlloc> & me,
    TSize new_length,
    TChar const & val,
    Tag<TExpand>)
{
    SEQAN_CHECKPOINT;
    me.resize(new_length, val);
    return me.length();
}

}  // namespace seqan

#endif  // #ifndef SEQAN_SEQUENCE_ADAPT_STD_VECTOR_H_