1 /*******************************************************************************************[Vec.h]
2 Copyright (c) 2003-2007, Niklas Een, Niklas Sorensson
3 Copyright (c) 2007-2010, Niklas Sorensson
5 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
6 associated documentation files (the "Software"), to deal in the Software without restriction,
7 including without limitation the rights to use, copy, modify, merge, publish, distribute,
8 sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
9 furnished to do so, subject to the following conditions:
11 The above copyright notice and this permission notice shall be included in all copies or
12 substantial portions of the Software.
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
15 NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
16 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
17 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
18 OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
19 **************************************************************************************************/
28 #include "libs/minisat/IntTypes.h"
29 #include "libs/minisat/XAlloc.h"
33 //=================================================================================================
34 // Automatically resizable arrays
36 // NOTE! Don't use this vector on datatypes that cannot be re-located in memory (with realloc)
38 template<class T
, class _Size
= int>
47 // Don't allow copying (error prone):
48 vec
<T
>& operator=(vec
<T
>& other
);
51 static inline Size
max(Size x
, Size y
){ return (x
> y
) ? x
: y
; }
55 vec() : data(NULL
), sz(0), cap(0) { }
56 explicit vec(Size size
) : data(NULL
), sz(0), cap(0) { growTo(size
); }
57 vec(Size size
, const T
& pad
) : data(NULL
), sz(0), cap(0) { growTo(size
, pad
); }
58 ~vec() { clear(true); }
60 // Pointer to first element:
61 operator T
* (void) { return data
; }
64 Size
size (void) const { return sz
; }
65 void shrink (Size nelems
) { assert(nelems
<= sz
); for (Size i
= 0; i
< nelems
; i
++) sz
--, data
[sz
].~T(); }
66 void shrink_ (Size nelems
) { assert(nelems
<= sz
); sz
-= nelems
; }
67 int capacity (void) const { return cap
; }
68 void capacity (Size min_cap
);
69 void growTo (Size size
);
70 void growTo (Size size
, const T
& pad
);
71 void clear (bool dealloc
= false);
74 void push (void) { if (sz
== cap
) capacity(sz
+1); new (&data
[sz
]) T(); sz
++; }
75 //void push (const T& elem) { if (sz == cap) capacity(sz+1); data[sz++] = elem; }
76 void push (const T
& elem
) { if (sz
== cap
) capacity(sz
+1); new (&data
[sz
++]) T(elem
); }
77 void push_ (const T
& elem
) { assert(sz
< cap
); data
[sz
++] = elem
; }
78 void pop (void) { assert(sz
> 0); sz
--, data
[sz
].~T(); }
79 // NOTE: it seems possible that overflow can happen in the 'sz+1' expression of 'push()', but
80 // in fact it can not since it requires that 'cap' is equal to INT_MAX. This in turn can not
81 // happen given the way capacities are calculated (below). Essentially, all capacities are
82 // even, but INT_MAX is odd.
84 const T
& last (void) const { return data
[sz
-1]; }
85 T
& last (void) { return data
[sz
-1]; }
88 const T
& operator [] (Size index
) const { return data
[index
]; }
89 T
& operator [] (Size index
) { return data
[index
]; }
91 // Duplicatation (preferred instead):
92 void copyTo(vec
<T
>& copy
) const { copy
.clear(); copy
.growTo(sz
); for (Size i
= 0; i
< sz
; i
++) copy
[i
] = data
[i
]; }
93 void moveTo(vec
<T
>& dest
) { dest
.clear(true); dest
.data
= data
; dest
.sz
= sz
; dest
.cap
= cap
; data
= NULL
; sz
= 0; cap
= 0; }
97 template<class T
, class _Size
>
98 void vec
<T
,_Size
>::capacity(Size min_cap
) {
99 if (cap
>= min_cap
) return;
100 Size add
= max((min_cap
- cap
+ 1) & ~1, ((cap
>> 1) + 2) & ~1); // NOTE: grow by approximately 3/2
101 const Size size_max
= std::numeric_limits
<Size
>::max();
102 if ( ((size_max
<= std::numeric_limits
<int>::max()) && (add
> size_max
- cap
))
103 || (((data
= (T
*)::realloc(data
, (cap
+= add
) * sizeof(T
))) == NULL
) && errno
== ENOMEM
) )
104 throw OutOfMemoryException();
108 template<class T
, class _Size
>
109 void vec
<T
,_Size
>::growTo(Size size
, const T
& pad
) {
110 if (sz
>= size
) return;
112 for (Size i
= sz
; i
< size
; i
++) data
[i
] = pad
;
116 template<class T
, class _Size
>
117 void vec
<T
,_Size
>::growTo(Size size
) {
118 if (sz
>= size
) return;
120 for (Size i
= sz
; i
< size
; i
++) new (&data
[i
]) T();
124 template<class T
, class _Size
>
125 void vec
<T
,_Size
>::clear(bool dealloc
) {
127 for (Size i
= 0; i
< sz
; i
++) data
[i
].~T();
129 if (dealloc
) free(data
), data
= NULL
, cap
= 0; } }
131 //=================================================================================================