aboutsummaryrefslogtreecommitdiff
path: root/src/stable/array.h
blob: da5b88af798918993ab562fbdd1246102d2de32b (plain)
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
807
808
809
810
811
812
813
814
815
/*
 * Copyright (C) 2007-2023 Xagasoft, All rights reserved.
 *
 * This file is part of the libbu++ library and is released under the
 * terms of the license contained in the file LICENSE.
 */

#ifndef BU_ARRAY_H
#define BU_ARRAY_H

#include <memory>
#include "bu/exceptionbase.h"
#include "bu/archivebase.h"
#include "bu/sharedcore.h"

namespace Bu
{
    subExceptionDecl( ArrayException )

    template<typename value, int inc, typename valuealloc>
    class Array;

    /** @cond DEVEL */
    template<typename value, int inc, typename valuealloc>
    class ArrayCore
    {
    friend class Array<value, inc, valuealloc>;
    friend class SharedCore<
        Array<value, inc, valuealloc>,
        ArrayCore<value, inc, valuealloc>
        >;
    private:        
        ArrayCore() :
            pData( NULL ),
            iSize( 0 ),
            iCapacity( 0 )
        { }

        void setCapacity( int iNewLen )
        {
            //clear();
            //iCapacity = iCapacity;
            //pData = va.allocate( iCapacity );
            if( iNewLen <= iCapacity ) return;
            value *pNewData = va.allocate( iNewLen );
            if( pData )
            {
                for( int j = 0; j < iSize; j++ )
                {
                    va.construct( &pNewData[j], pData[j] );
                    va.destroy( &pData[j] );
                }
                va.deallocate( pData, iCapacity );
            }
            pData = pNewData;
            iCapacity = iNewLen;
        }

        virtual ~ArrayCore()
        {
            clear();
        }

        void clear()
        {
            if( pData )
            {
                for( int j = 0; j < iSize; j++ )
                {
                    va.destroy( &pData[j] );
                }
                va.deallocate( pData, iCapacity );
                pData = NULL;
            }
            iSize = 0;
            iCapacity = 0;
        }

        void erase( int iPos )
        {
            for( int j = iPos; j < iSize; j++ )
            {
                va.destroy( &pData[j] );
                if( j == iSize-1 )
                {
                    iSize--;
                    return;
                }
                va.construct( &pData[j], pData[j+1] );
            }
        }

        void swapErase( int iPos )
        {
            if( iPos == iSize-1 )
            {
                erase( iPos );
                return;
            }
            va.destroy( &pData[iPos] );
            va.construct( &pData[iPos], pData[iSize-1] );
            va.destroy( &pData[iSize-1] );
            iSize--;
        }

        void swap( int iPos1, int iPos2 )
        {
            value tmp = pData[iPos1];
            pData[iPos1] = pData[iPos2];
            pData[iPos2] = tmp;
        }

        valuealloc va;
        value *pData;
        long iSize;
        long iCapacity;
    };
    /** @endcond */

    /**
     * Array type container, just like a normal array only flexible and keeps
     * track of your memory for you.
     *
     *@param value (typename) The type of data to store in your list
     *@param valuealloc (typename) Memory Allocator for your value type
     *@param linkalloc (typename) Memory Allocator for the list links.
     *@ingroup Containers
     */
    template<typename value, int inc=10, typename valuealloc=std::allocator<value> >
    class Array : public SharedCore<
                  Array<value, inc, valuealloc>,
                  ArrayCore<value, inc, valuealloc>
                  >
    {
    private:
        typedef class Array<value, inc, valuealloc> MyType;
        typedef class ArrayCore<value, inc, valuealloc> Core;

    protected:
        using SharedCore<MyType, Core>::core;
        using SharedCore<MyType, Core>::_hardCopy;
        using SharedCore<MyType, Core>::_resetCore;
        using SharedCore<MyType, Core>::_allocateCore;

    public:
        struct const_iterator;
        struct iterator;

        Array()
        {
        }

        Array( const MyType &src ) :
            SharedCore<MyType, Core >( src )
        {
        }
        
        Array( long iSetCap )
        {
            setCapacity( iSetCap );
        }

        ~Array()
        {
        }

        bool operator==( const MyType &src ) const
        {
            if( core == src.core )
                return true;
            if( core->iSize != src.core->iSize )
                return false;

            for( int j = 0; j < core->iSize; j++ )
            {
                if( core->pData[j] != src.core->pData[j] )
                    return false;
            }
            return true;
        }

        bool operator!=( const MyType &src ) const
        {
            return !(*this == src);
        }

        MyType &operator=( const MyType &src )
        {
            SharedCore<MyType, Core>::_softCopy( src );

            return *this;
        }


        /**
         * Clear the array.
         */
        void clear()
        {
            _resetCore();
        }

        MyType &append( const value &rVal )
        {
            _hardCopy();
            if( core->iSize == core->iCapacity )
            {
                core->setCapacity( core->iCapacity + inc );
            }

            core->va.construct( &core->pData[core->iSize++], rVal );

            return *this;
        }
        
        MyType &append( const MyType &rVal )
        {
            _hardCopy();

            if( core->iSize + rVal.core->iSize > core->iCapacity )
            {
                core->setCapacity( core->iSize + rVal.core->iSize + inc );
            }
            
            for( int j = 0; j < rVal.core->iSize; j++ )
            {
                core->va.construct(
                    &core->pData[core->iSize++],
                    rVal.core->pData[j]
                    );
            }

            return *this;
        }

        //operator
        value &operator[]( long iIndex )
        {
            _hardCopy();
            if( iIndex < 0 || iIndex >= core->iSize )
                throw ArrayException(
                    "Index %d out of range 0:%d", iIndex, core->iSize );

            return core->pData[iIndex];
        }
        
        const value &operator[]( long iIndex ) const
        {
            if( iIndex < 0 || iIndex >= core->iSize )
                throw ArrayException(
                    "Index %d out of range 0:%d", iIndex, core->iSize );

            return core->pData[iIndex];
        }

        value &get( long iIndex )
        {
            _hardCopy();
            if( iIndex < 0 || iIndex >= core->iSize )
                throw ArrayException(
                    "Index %d out of range 0:%d", iIndex, core->iSize );

            return core->pData[iIndex];
        }

        const value &get( long iIndex ) const
        {
            if( iIndex < 0 || iIndex >= core->iSize )
                throw ArrayException(
                    "Index %d out of range 0:%d", iIndex, core->iSize );

            return core->pData[iIndex];
        }

        value &first()
        {
            _hardCopy();
            return core->pData[0];
        }

        const value &first() const
        {
            return core->pData[0];
        }

        value &last()
        {
            _hardCopy();
            return core->pData[core->iSize-1];
        }

        const value &last() const
        {
            return core->pData[core->iSize-1];
        }

        /**
         * Returns true if the array is empty.  The capacity has no bearing on
         * this, only the size.
         */
        bool isEmpty() const
        {
            return core->iSize==0;
        }

        /**
         * Get the current size of the array.
         *@returns The current size of the array.
         */
        long getSize() const
        {
            return core->iSize;
        }

        void setSize( long iNewLen )
        {
            if( core->iSize == iNewLen )
                return;

            _hardCopy();
            if( iNewLen > core->iCapacity )
            {
                core->setCapacity( iNewLen );
            }
            if( iNewLen > core->iSize )
            {
                for( int j = core->iSize; j < iNewLen; j++ )
                {
                    core->va.construct(
                        &core->pData[j]
                        );
                }
            }
            core->iSize = iNewLen;
        }

        void setSize( long iNewLen, const value &initTo )
        {
            if( core->iSize == iNewLen )
                return;

            _hardCopy();
            if( iNewLen > core->iCapacity )
            {
                core->setCapacity( iNewLen );
            }
            if( iNewLen > core->iSize )
            {
                for( int j = core->iSize; j < iNewLen; j++ )
                {
                    core->va.construct(
                        &core->pData[j],
                        initTo
                        );
                }
            }
            core->iSize = iNewLen;
        }

        /**
         * Get the capacity of the array.  This number will grow as data is
         * added, and is mainly for the curious, it doesn't really determine
         * much for the end user.
         *@returns The current capacity of the array.
         */
        long getCapacity() const
        {
            return core->iCapacity;
        }

        /**
         * Change the capacity of the array, very useful if you know you'll be
         * adding a large amount of already counted items to the array, makes
         * the appending much faster afterwords.
         *@param iNewLen The new capacity of the array.
         *@todo Set this up so it can reduce the size of the array as well as
         * make it bigger.
         */
        void setCapacity( long iNewLen )
        {
            _hardCopy();
            core->setCapacity( iNewLen );
        }

        typedef struct iterator
        {
            friend class Array<value, inc, valuealloc>;
        private:
            iterator( MyType &src, long iPos=0 ) :
                src( src ),
                iPos( iPos )
            {
                if( this->iPos >= src.getSize() )
                    this->iPos = -1;
            }

            MyType &src;
            long iPos;

        public:
            iterator() :
                src( NULL ),
                iPos( -1 )
            {
            }

            iterator( const iterator &rSrc ) :
                src( rSrc.src ),
                iPos( rSrc.iPos )
            {
            }

            iterator operator++( int )
            {
                if( iPos < 0 )
                {
                    throw ArrayException(
                        "Cannot increment iterator past end of array.");
                }
                iPos++;
                if( iPos >= src.getSize() )
                {
                    iPos = -1;
                }
                return *this;
            }
            
            iterator operator++()
            {
                if( iPos >= 0 )
                    iPos++;
                if( iPos >= src.getSize() )
                    iPos = -1;
                return *this;
            }
            
            iterator operator+( int iAmnt )
            {
                if( iPos < 0 )
                {
                    throw ArrayException(
                        "Cannot increment iterator past end of array.");
                }
                iPos += iAmnt;
                if( iPos >= src.getSize() )
                    iPos = -1;
                return *this;
            }
            
            iterator operator--( int )
            {
                if( iPos < 0 )
                {
                    throw ArrayException(
                        "Cannot increment iterator past end of array.");
                }
                iPos--;
                if( iPos < 0 )
                    iPos = -1;
                return *this;
            }
            
            iterator operator--()
            {
                if( iPos < src.getSize() )
                    iPos--;
                if( iPos <= 0 )
                    iPos = -1;
                return *this;
            }
            
            iterator operator-( int iAmnt )
            {
                if( iPos < src.getSize() )
                    iPos -= iAmnt;
                if( iPos <= 0 )
                    iPos = -1;
                return *this;
            }

            bool operator==( const iterator &oth ) const
            {
                return iPos == oth.iPos;
            }

            bool operator!=( const iterator &oth ) const
            {
                return iPos != oth.iPos;
            }

            iterator operator=( const iterator &oth )
            {
                if( &src != &oth.src )
                    throw ArrayException(
                        "Cannot mix iterators from different array objects.");
                iPos = oth.iPos;
            }

            value &operator*()
            {
                if( iPos < 0 )
                    throw ArrayException(
                        "Cannot dereference finished iterator.");
                return src[iPos];
            }

            long getIndex() const
            {
                return iPos;
            }

            operator bool() const
            {
                return iPos >= 0;
            }

            bool isValid() const
            {
                return iPos >= 0;
            }
        } iterator;
        
        typedef struct const_iterator
        {
            friend class Array<value, inc, valuealloc>;
        private:
            const_iterator( const MyType &src, long iPos=0 ) :
                src( src ),
                iPos( iPos )
            {
                if( this->iPos >= src.getSize() )
                    this->iPos = -1;
            }

            const MyType &src;
            long iPos;

        public:
            const_iterator( const iterator &rSrc ) :
                src( rSrc.src ),
                iPos( rSrc.iPos )
            {
            }
            
            const_iterator( const const_iterator &rSrc ) :
                src( rSrc.src ),
                iPos( rSrc.iPos )
            {
            }

            const_iterator operator++( int )
            {
                if( iPos < 0 )
                {
                    throw ArrayException(
                        "Cannot increment iterator past end of array.");
                }
                iPos++;
                if( iPos >= src.getSize() )
                    iPos = -1;
                return *this;
            }
            
            const_iterator operator++()
            {
                if( iPos >= 0 )
                    iPos++;
                if( iPos >= src.getSize() )
                    iPos = -1;
                return *this;
            }
            
            const_iterator operator--( int )
            {
                if( iPos < 0 )
                {
                    throw ArrayException(
                        "Cannot increment iterator past end of array.");
                }
                iPos--;
                if( iPos < 0 )
                    iPos = -1;
                return *this;
            }
            
            const_iterator operator--()
            {
                if( iPos < src.getSize() )
                    iPos--;
                if( iPos <= 0 )
                    iPos = -1;
                return *this;
            }

            bool operator==( const const_iterator &oth ) const
            {
                return iPos == oth.iPos;
            }

            bool operator!=( const const_iterator &oth ) const
            {
                return iPos != oth.iPos;
            }

            const_iterator operator=( const const_iterator &oth )
            {
                if( &src != &oth.src )
                    throw ArrayException(
                        "Cannot mix iterators from different array objects.");
                iPos = oth.iPos;
            }

            const value &operator*() const
            {
                if( iPos < 0 )
                    throw ArrayException(
                        "Cannot dereference finished iterator.");
                return src[iPos];
            }

            long getIndex() const
            {
                return iPos;
            }
            
            operator bool() const
            {
                return iPos >= 0;
            }

            bool isValid() const
            {
                return iPos >= 0;
            }
        } const_iterator;

        iterator begin()
        {
            return iterator( *this );
        }

        const_iterator begin() const
        {
            return const_iterator( *this );
        }

        iterator end()
        {
            return iterator( *this, -1 );
        }

        const_iterator end() const
        {
            return const_iterator( *this, -1 );
        }

        MyType &insert( iterator i, const value &rVal )
        {
            if( i.iPos == -1 )
            {
                append( rVal );
                return *this;
            }

            _hardCopy();
            if( core->iSize == core->iCapacity )
            {
                core->setCapacity( core->iCapacity + inc );
            }
            core->iSize++;

            core->va.construct(
                &core->pData[core->iSize-1],
                core->pData[core->iSize-2]
                );
            for( int iPos = core->iSize-2; iPos > i.iPos; iPos-- )
            {
                core->va.destroy( &core->pData[iPos] );
                core->va.construct( &core->pData[iPos], core->pData[iPos-1] );
            }
            core->va.destroy( &core->pData[i.iPos] );
            core->va.construct( &core->pData[i.iPos], rVal );

            return *this;
        }

        /**
         * If order is important, use this.  It will delete the suggested item
         * and move the rest of the data up a spot.  This is a time O(n)
         * operation.  If the order isn't important, check swapErase
         */
        void erase( iterator i )
        {
            _hardCopy();
            core->erase( i.iPos );
        }
        
        void erase( int i )
        {
            _hardCopy();
            core->erase( i );
        }

        void erase( const value &v )
        {
            _hardCopy();
            for( int j = 0; j < core->iSize; j++ )
            {
                if( core->pData[j] == v )
                {
                    core->erase( j );
                    return;
                }
            }
        }

        void eraseLast()
        {
            _hardCopy();
            core->erase( core->iSize-1 );
        }

        void eraseFirst()
        {
            _hardCopy();
            core->erase( 0 );
        }

        /**
         * In order to make swapErase faster, what it does is swap the given
         * item in the array with the last item, then make the array shorter
         * by one.  It changes the order of the elements in the array, so it
         * should be used carefully, but it is time O(1) instead of O(n) like
         * erase.
         */
        void swapErase( iterator i )
        {
            _hardCopy();
            core->swapErase( i.iPos );
        }

        void swap( int iPos1, int iPos2 )
        {
            _hardCopy();
            core->swap( iPos1, iPos2 );
        }

    protected:
        virtual Core *_copyCore( Core *src )
        {
            Core *pRet = _allocateCore();
            pRet->setCapacity( src->iCapacity );
            pRet->iSize = src->iSize;
            for( int j = 0; j < src->iSize; j++ )
            {   
                pRet->va.construct( &pRet->pData[j], src->pData[j] );
            }
            return pRet;
        }

    private:
    };

    class Formatter;
    Formatter &operator<<( Formatter &rOut, const char *sStr );
    Formatter &operator<<( Formatter &rOut, signed char c );
    template<typename value>
    Formatter &operator<<( Formatter &f, const Bu::Array<value> &a )
    {
        f << '[';
        for( typename Bu::Array<value>::const_iterator i = a.begin(); i; i++ )
        {
            if( i != a.begin() )
                f << ", ";
            f << *i;
        }
        f << ']';

        return f;
    }

    template<typename value, int inc, typename valuealloc>
    ArchiveBase &operator<<( ArchiveBase &ar,
            const Array<value, inc, valuealloc> &h )
    {
        ar << h.getSize();
        for( typename Array<value, inc, valuealloc>::const_iterator i =
             h.begin(); i != h.end(); i++ )
        {
            ar << (*i);
        }

        return ar;
    }

    template<typename value, int inc, typename valuealloc>
    ArchiveBase &operator>>(ArchiveBase &ar, Array<value, inc, valuealloc> &h )
    {
        h.clear();
        long nSize;
        ar >> nSize;

        h.setCapacity( nSize );
        for( long j = 0; j < nSize; j++ )
        {
            value v;
            ar >> v;
            h.append( v );
        }
        return ar;
    }

}

#endif