File: test_map_sumlist.h

package info (click to toggle)
seqan2 2.5.2-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 228,748 kB
  • sloc: cpp: 257,602; ansic: 91,967; python: 8,326; sh: 1,056; xml: 570; makefile: 229; awk: 51; javascript: 21
file content (803 lines) | stat: -rw-r--r-- 22,590 bytes parent folder | download
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
// ==========================================================================
//                 SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2026, 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.
//
// ==========================================================================

// SEQAN_NO_GENERATED_FORWARDS: no forwards are generated for this file

#include <iostream>
#include <cstdio>

#include <seqan/sequence.h>
#include <seqan/stream.h>
#include <seqan/map.h>


using namespace std;
using namespace seqan2;

//////////////////////////////////////////////////////////////////////////////
// Simple Sum List Reference Implementation
//////////////////////////////////////////////////////////////////////////////

namespace seqan2
{

struct Dummy_;
struct DummySumListIterator_;

template <unsigned int DIM, typename TValue>
class SumList<DIM, TValue, Dummy_>
{
public:
    typedef SumListValues<DIM, TValue> TValues;
    typedef String<TValues> TString;

    TString data;
};

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue, typename TIteratorSpec>
struct Iterator<SumList<DIM, TValue, Dummy_>, TIteratorSpec>
{
    typedef SumList<DIM, TValue, Dummy_> TSumList;
    typedef Iter<TSumList, DummySumListIterator_> Type;
};

//////////////////////////////////////////////////////////////////////////////

template <typename T>
struct Values;

template <unsigned int DIM, typename TValue>
struct Values<SumList<DIM, TValue, Dummy_> >
{
    typedef SumListValues<DIM, TValue> Type;
};

//////////////////////////////////////////////////////////////////////////////


template <unsigned int DIM, typename TValue>
inline typename Size< SumList<DIM, TValue, Dummy_> >::Type
length(SumList<DIM, TValue, Dummy_> & me)
{
    return length(me.data);
}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue>
inline typename Value< SumList<DIM, TValue, Dummy_> >::Type
getSum(SumList<DIM, TValue, Dummy_> & me,
       unsigned int dim)
{
    typedef SumListValues<DIM, TValue> TValues;
    typedef String<TValues> TString;

    typedef typename Iterator<TString>::Type TIterator;
    TValue sum = 0;

    for (TIterator it = begin(me.data); it != end(me.data); ++it)
    {
        sum += value(it)[dim];
    }

    return sum;
}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue>
inline void
clear(SumList<DIM, TValue, Dummy_> & me)
{
    clear(me.data);
}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue>
inline typename Iterator< SumList<DIM, TValue, Dummy_> >::Type
begin(SumList<DIM, TValue, Dummy_> & me)
{
    typedef SumList<DIM, TValue, Dummy_>  TMe;
    typedef typename Iterator<TMe>::Type TIterator;
    return TIterator(me);
}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue>
inline typename Iterator< SumList<DIM, TValue, Dummy_> >::Type
end(SumList<DIM, TValue, Dummy_> & me)
{
    typedef SumList<DIM, TValue, Dummy_>  TMe;
    typedef typename Iterator<TMe>::Type TIterator;
    return TIterator(me, GoEnd());
}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue, typename TValues>
inline void
appendValues(SumList<DIM, TValue, Dummy_> & me,
             TValues const & new_values)
{
    appendValue(me.data, new_values);
}
template <unsigned int DIM, typename TValue, typename TValue2>
inline void
appendValues(SumList<DIM, TValue, Dummy_> & me,
             TValue2 const * new_values)
{
    SumListValues<DIM, TValue> vals(new_values);
    appendValues(me, vals);
}

//////////////////////////////////////////////////////////////////////////////

//template <typename TSumList, typename TValue>
//inline void
//searchSumList(Iter<TSumList, DummySumListIterator_> & it,
//              TValue const & val,
//              int dim)
//{
//    goBegin(it);
//    while (!atEnd(it) && ((getSum(it, dim) + getValue(it, dim))< val))
//    {
//        goNext(it);
//    }
//}

//////////////////////////////////////////////////////////////////////////////

template <unsigned int DIM, typename TValue>
class Iter<SumList<DIM, TValue, Dummy_>, DummySumListIterator_>
{
public:
    typedef SumList<DIM, TValue, Dummy_> TSumList;
    typedef SumListValues<DIM, TValue> TValues;
    typedef String<TValues> TString;
    typedef typename Iterator<TString>::Type TStringIterator;

    TSumList * container;
    TStringIterator iter;

    Iter()
    {
    }
    Iter(TSumList & sl)
        : container(& sl)
        , iter(begin(sl.data))
    {
    }
    Iter(TSumList & sl, GoEnd)
        : container(& sl)
        , iter(end(sl.data))
    {
    }
    Iter(Iter const & other)
        : container(other.container)
        , iter(other.iter)
    {
    }
    ~Iter()
    {
    }
    Iter const & operator = (Iter const & other)
    {
        container = other.container;
        iter = other.iter;
        return *this;
    }
};


//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline void
goNext(Iter<TSumList, DummySumListIterator_> & it)
{
    goNext(it.iter);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline void
goBegin(Iter<TSumList, DummySumListIterator_> & it)
{
    it.iter = begin(it.container->data);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline bool
atEnd(Iter<TSumList, DummySumListIterator_> & it)
{
    return it.iter == end(it.container->data);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline typename Value<TSumList>::Type
getValue(Iter<TSumList, DummySumListIterator_ > & it,
         int dim)
{
    return value(it.iter)[dim];
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline typename Values<TSumList>::Type
getValues(Iter<TSumList, DummySumListIterator_ > & it)
{
    return value(it.iter);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline typename Value<TSumList>::Type
getSum(Iter<TSumList, DummySumListIterator_ > & it,
       int dim)
{
    typedef typename Value<TSumList>::Type TValue;
    typedef SumListValues<DIMENSION<TSumList>::VALUE, TValue> TValues;
    typedef String<TValues> TString;

    typedef typename Iterator<TString>::Type TIterator;
    TValue sum = 0;

    for (TIterator it2 = begin(it.container->data); it2 != it.iter; ++it2)
    {
        sum += value(it2)[dim];
    }

    return sum;
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList, typename TValue>
inline void
searchSumList(Iter<TSumList, DummySumListIterator_> & it,
              TValue const & val,
              int dim)
{
    goBegin(it);
    TValue sum = 0;
    SEQAN_ASSERT_GEQ(getValue(it, dim), 0u);  // The cast below only works in this case.
    while (!atEnd(it) && ((sum + static_cast<TValue>(getValue(it, dim))) <= val)) // SEARCH SEMANTICS
    {
        sum += getValue(it, dim);
        goNext(it);
    }
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList, typename TValue2>
inline void
assignValue(Iter<TSumList, DummySumListIterator_ > & it,
            int dim,
            TValue2 val)
{
    value(it.iter)[dim] = val;
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList, typename TValues>
inline void
insertValues(Iter<TSumList, DummySumListIterator_ > & it,
             TValues const & vals)
{
    size_t position = it.iter - begin(it.container->data);
    insertValue(it.container->data, it.iter - begin(it.container->data), vals);
    it.iter = begin(it.container->data) + position;
}
template <typename TSumList, typename TValue>
inline void
insertValues(Iter<TSumList, DummySumListIterator_ > & it,
             TValue const * p_vals)
{
    SumListValues<DIMENSION<TSumList>::VALUE, typename Value<TSumList>::Type > vals(p_vals);
    return insertValues(it, vals);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline void
removeValues(Iter<TSumList, DummySumListIterator_ > & it)
{
    arrayCopyForward(it.iter + 1, end(it.container->data, Standard()), it.iter);
    resize(it.container->data, length(it.container->data) - 1);
}

//////////////////////////////////////////////////////////////////////////////

template <typename TSumList>
inline bool
operator == (Iter<TSumList, DummySumListIterator_> const & left,
             Iter<TSumList, DummySumListIterator_> const & right)
{
    return left.iter == right.iter;
}

template <typename TSumList>
inline bool
operator != (Iter<TSumList, DummySumListIterator_> const & left,
             Iter<TSumList, DummySumListIterator_> const & right)
{
    return left.iter != right.iter;
}


//////////////////////////////////////////////////////////////////////////////

} //namespace seqan2

//////////////////////////////////////////////////////////////////////////////
// Tests for Mini Sum List
//////////////////////////////////////////////////////////////////////////////

void Test_MiniSumList_Entry()
{
    // typedef MiniListEntry_<size_t> TEntry;

    // unsigned char buf [1 + sizeof(size_t)];

    // unsigned char & buf2char = * buf;
    // unsigned short & buf2short = * reinterpret_cast<unsigned short *>(buf);
    // unsigned int & buf2int = * reinterpret_cast<unsigned int *>(buf);
    // size_t & buf2full = * reinterpret_cast<size_t *>(buf + 1);

    // TEntry & entr = * (reinterpret_cast<TEntry *>(buf));

    // entr.assignValue(0x12);
    // SEQAN_ASSERT(entr.getValue() == 0x12);
    // SEQAN_ASSERT(entr.size() == 1);
    // SEQAN_ASSERT(buf2char == 0x12 << 2);

    // entr.assignValue(0x1234);
    // SEQAN_ASSERT(entr.getValue() == 0x1234);
    // SEQAN_ASSERT(entr.size() == 2);
    // // // SEQAN_ASSERT((buf2short & 0xfffc) == (0x1234 << 2));

    // entr.assignValue(0x1234567);
    // SEQAN_ASSERT(entr.getValue() == 0x1234567);
    // SEQAN_ASSERT(entr.size() == 4);
    // SEQAN_ASSERT((buf2int & 0xfffffffc) == (0x1234567 << 2));

    // entr.assignValue(0xfedcba98);
    // SEQAN_ASSERT(entr.getValue() == 0xfedcba98);
    // SEQAN_ASSERT(entr.size() == 1 + sizeof(size_t));
    // SEQAN_ASSERT(buf2full == 0xfedcba98);

}

//////////////////////////////////////////////////////////////////////////////

template <int DIM>
void Test_MiniSumList()
{
    typedef SumList<DIM, size_t, MiniSumList< > > TSumList;
    typedef    SumListValues<DIM, size_t> TValues;
    typedef typename Iterator<TSumList>::Type TIterator;

    TSumList sumlist1;

    TValues vals_sum;

    while (true)
    {
        TValues vals;
        for (int i = 0; i < DIM; ++i)
        {
            vals[i] = rand() % 0x1000;
        }
        if (!appendValues(sumlist1, vals)) break;
        vals_sum += vals;
    }

    SEQAN_ASSERT(sumlist1.data_sum == vals_sum);

    TSumList sumlist2;
    splitSumList(sumlist1, sumlist2);
    TValues vals_sum2 = sumlist1.data_sum;
    vals_sum2 += sumlist2.data_sum;
    SEQAN_ASSERT(vals_sum2 == vals_sum);

}

//////////////////////////////////////////////////////////////////////////////

void Test_MiniSumList2()
{
    typedef SumList<3, int, MiniSumList< > > TSumList;
    typedef Iterator<TSumList>::Type TIterator;
    typedef    SumListValues<3, int> TValues;

    int const VALUES [][3] =
    {
        {1, 2, 3},
        {2, 3, 1},
        {0, 1, 2},
        {3, 1, 1},
        {1, 2, 1},
    };

    TSumList sl;

    for (unsigned int i = 0; i < sizeof(VALUES) / sizeof(VALUES[0]); ++i)
    {
        appendValues(sl, VALUES[i]);
    }
    SEQAN_ASSERT(length(sl) == 5);

    SEQAN_ASSERT(getSum(sl, 0) == 7);
    SEQAN_ASSERT(getSum(sl, 1) == 9);
    SEQAN_ASSERT(getSum(sl, 2) == 8);

    TValues vals;

    TIterator it(sl);

    searchSumList(it, 2, 0); // SEARCH SEMANTICS
    SEQAN_ASSERT_EQ(getValue(it, 0), 2);
    SEQAN_ASSERT_EQ(getValue(it, 1), 3);
    SEQAN_ASSERT_EQ(getValue(it, 2), 1);
    SEQAN_ASSERT_EQ(getSum(it, 0), 1);
    SEQAN_ASSERT_EQ(getSum(it, 1), 2);
    SEQAN_ASSERT_EQ(getSum(it, 2), 3);

    searchSumList(it, 10, 0);
    SEQAN_ASSERT_EQ(getSum(it, 0), 7);
    SEQAN_ASSERT_EQ(getSum(it, 1), 9);
    SEQAN_ASSERT_EQ(getSum(it, 2), 8);

    SEQAN_ASSERT(it == end(sl));
    SEQAN_ASSERT(it != begin(sl));


    searchSumList(it, 3, 0);// SEARCH SEMANTICS
    SEQAN_ASSERT(getValue(it, 0) == 3);
    SEQAN_ASSERT(getValue(it, 1) == 1);
    SEQAN_ASSERT(getValue(it, 2) == 1);
    SEQAN_ASSERT(getSum(it, 0) == 3);
    SEQAN_ASSERT(getSum(it, 1) == 6);
    SEQAN_ASSERT(getSum(it, 2) == 6);

    assignValue(it, 0, 80000);
    SEQAN_ASSERT(getValue(it, 0) == 80000);
    SEQAN_ASSERT(getSum(sl, 0) == 80004);

    //removeValues
    removeValues(it);
    SEQAN_ASSERT(length(sl) == 4);
    SEQAN_ASSERT(!atEnd(it));
    SEQAN_ASSERT(getValue(it, 0) == 1);
    SEQAN_ASSERT(getValue(it, 1) == 2);
    SEQAN_ASSERT(getValue(it, 2) == 1);
    SEQAN_ASSERT(getSum(sl, 0) == 4);
    SEQAN_ASSERT(getSum(sl, 1) == 8);
    SEQAN_ASSERT(getSum(sl, 2) == 7);

    removeValues(it);
    SEQAN_ASSERT(length(sl) == 3);
    SEQAN_ASSERT(atEnd(it));

    //insertValues
    searchSumList(it, 2, 0);
    SEQAN_ASSERT(getValue(it, 0) == 2);
    SEQAN_ASSERT(getValue(it, 1) == 3);
    SEQAN_ASSERT(getValue(it, 2) == 1);

    insertValues(it, VALUES[3]);
    SEQAN_ASSERT(length(sl) == 4);
    SEQAN_ASSERT(getValue(it, 0) == 3);
    SEQAN_ASSERT(getValue(it, 1) == 1);
    SEQAN_ASSERT(getValue(it, 2) == 1);
    SEQAN_ASSERT(getSum(sl, 0) == 6);
    SEQAN_ASSERT(getSum(sl, 1) == 7);
    SEQAN_ASSERT(getSum(sl, 2) == 7);

    goNext(it);
    SEQAN_ASSERT(getValue(it, 0) == 2);
    SEQAN_ASSERT(getValue(it, 1) == 3);
    SEQAN_ASSERT(getValue(it, 2) == 1);
}

//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//helper functions

template <unsigned int DIM, typename TValue>
inline void
createRandomSumListValues(SumListValues<DIM, TValue> & values)
{
    for (unsigned int i = 0; i < DIM; ++i)
    {
        values[i] = rand() % 1000;
    }
}


//____________________________________________________________________________

template <typename TSumList1, typename TSumList2>
void compareSumLists(TSumList1 & s1,
                     TSumList2 & s2)
{
    typedef typename Iterator<TSumList1>::Type TIterator1;
    typedef typename Iterator<TSumList2>::Type TIterator2;
    typedef typename Values<TSumList2>::Type TValues;

    TIterator1 it1(s1);
    TIterator2 it2(s2);

    int DIM = DIMENSION<TSumList1>::VALUE;

    SEQAN_ASSERT(length(s1) == length(s2));

    for (int i = 0; ; ++i)
    {
        if (atEnd(it1)) break;
        SEQAN_ASSERT(!atEnd(it2));
        SEQAN_ASSERT(getValues(it1) == getValues(it2));

        goNext(it1);
        goNext(it2);
    }
    SEQAN_ASSERT(atEnd(it2));

    for (int i = 0; i < DIM; ++i)
    {
        SEQAN_ASSERT(getSum(s1, i) == getSum(s2, i));
    }
}

//____________________________________________________________________________

template <int DIM, typename TIter1, typename TIter2>
void compareIterators(TIter1 & it1,
                      TIter2 & it2)
{
    for (int i = 0; i < DIM; ++i)
    {
        SEQAN_ASSERT(getSum(it1, i) == getSum(it2, i));
        SEQAN_ASSERT(getValue(it1, i) == getValue(it2, i));
    }
}


//____________________________________________________________________________


//testet, ob die Summen an den Kanten stimmen
template <unsigned int DIM, typename TValue>
void testSkipSumListIntegrity(SumList<DIM, TValue, SkipSumList< > > & ssl)
{
    typedef SumListValues<DIM, TValue> TValues;
    typedef SkiplistPath<TValue, Skipsumlist_<DIM> > TPath;
    typedef SkiplistElement<TValue, Skipsumlist_<DIM> > TElement;

    TPath path(ssl.map);
    for (int counter = 0; !atEnd(path); ++counter)
    {
        //is the bottom line edges correct?
        SEQAN_ASSERT(path.data_elements[0]->data_next[0].values == path.data_elements[0]->minilist.data_sum);

        //are the other edges correct?
        for (int i = 1; i <= ssl.map.data_height; ++i)
        {
            if (path.data_elements[i] != path.data_elements[0]) break;
            SEQAN_ASSERT(path.sums[i] == path.sums[0]);
        }

        goNext(path, ssl.map);
    }
}

//____________________________________________________________________________

template <unsigned int DIM, typename TValue>
void Test_SkipSumListStress()
{
    typedef SumList<DIM, TValue, SkipSumList< > > TSkipSumList;
    typedef SumList<DIM, TValue, Dummy_> TDummySumList;
    typedef SumListValues<DIM, TValue> TValues;

    TSkipSumList ssl;
    TSkipSumList ssl2;
    TDummySumList dsl;

    //appendValues
    for (unsigned int i = 0 ; i < 1000; ++i)
    {
        TValues vals;
        createRandomSumListValues(vals);
        appendValues(ssl, vals);
        appendValues(dsl, vals);
    }
    testSkipSumListIntegrity(ssl);

    compareSumLists(ssl, dsl);


    //iteration
    typedef typename Iterator<TSkipSumList>::Type TSkipSumListIterator;
    typedef typename Iterator<TDummySumList>::Type TDummySumListIterator;

    TSkipSumListIterator sit = begin(ssl);
    TDummySumListIterator dit = begin(dsl);

    for (int i = 0; !atEnd(sit); ++i)
    {
        SEQAN_ASSERT(!atEnd(dit));

        compareIterators<DIM>(sit, dit);

        goNext(sit);
        goNext(dit);
    }
    SEQAN_ASSERT(atEnd(dit));


/*
    //searchSumList => is implicitly done by the assignValue test
    for (int i = 0; i < 1000; ++i)
    {
        int dim = rand() % DIM;
        int val = (rand() + (rand() << 16)) % getSum(ssl, dim);

        searchSumList(sit, val, dim);
        searchSumList(dit, val, dim);

        compareIterators<DIM>(sit, dit);
    }

*/
/*
    //_splitMiniList => is implicitly done by the assignValue test

    typedef SkiplistPath<TValue, Skipsumlist_<DIM> > TPath;
    typedef SkiplistElement<TValue, Skipsumlist_<DIM> > TElement;
    typedef Pair<TValue, TElement *> TPair;

    for (int i = 0; i < 100; ++i)
    {
        cout << i << "\n";
        int dim = rand() % DIM;
        int find_sum = (rand() + (rand() << 16)) % getSum(ssl, dim);

        searchSumList(sit, find_sum, dim);
        TPath path;
        _skipsumlistFind(ssl.map, TPair(getSum(sit, 0), sit.element), 0, path);
        _splitMiniList(sit, path);
        testSkipSumListIntegrity(ssl);
    }
*/

    cout << "a thousand dots: ";
    //assignValue, insertValues, removeValues
    for (int i = 0; i < 1000; ++i)
    {
        cout << "."; //progression

        //assignValue
        int dim = rand() % DIM;
        int find_sum = (rand() + (rand() << 16)) % getSum(ssl, dim);
        int new_value = rand() | (rand() << 10);

        searchSumList(sit, find_sum, dim);
        searchSumList(dit, find_sum, dim);

        compareIterators<DIM>(sit, dit);

        assignValue(sit, dim, new_value);
        testSkipSumListIntegrity(ssl);

        assignValue(dit, dim, new_value);

        compareIterators<DIM>(sit, dit);
        compareSumLists(ssl, dsl);


        //insertValues
        find_sum = (rand() + (rand() << 16)) % getSum(ssl, dim);
        TValues new_values;
        createRandomSumListValues(new_values);

        searchSumList(sit, find_sum, dim);
        searchSumList(dit, find_sum, dim);

        insertValues(sit, new_values);
        testSkipSumListIntegrity(ssl);

        insertValues(dit, new_values);

        compareIterators<DIM>(sit, dit);
        compareSumLists(ssl, dsl);


        //removeValues
        if (i % 2)
        {
            dim = rand() % DIM;
            find_sum = (rand() + (rand() << 16)) % getSum(ssl, dim);

            searchSumList(sit, find_sum, dim);
            searchSumList(dit, find_sum, dim);

            removeValues(sit);
            testSkipSumListIntegrity(ssl);

            removeValues(dit);

            compareIterators<DIM>(sit, dit);
            compareSumLists(ssl, dsl);
        }

        ssl2 = ssl;
        testSkipSumListIntegrity(ssl);
        testSkipSumListIntegrity(ssl2);
        compareSumLists(ssl, ssl2);
    }
    cout << "\n";

}

//////////////////////////////////////////////////////////////////////////////

void Main_TestSumlist()
{
    Test_MiniSumList_Entry();
    Test_MiniSumList<5>();
    Test_MiniSumList<1>();
    Test_MiniSumList2();

    //SegFaulting
    //Test_SkipSumListStress<3, size_t>();
}


SEQAN_DEFINE_TEST(test_map_sumlist)
{
    Main_TestSumlist();
}