46# define RAND( x ) (unsigned long) ( x * ( rand() / (RAND_MAX+1.0) ) )
63 unsigned long seed,index;
64 unsigned long i,
value, val;
84 seed = std::time(
nullptr);
93 cout << t[10]->a1 << t[10000]->a1 <<
endl;
107 v2[index] = v1[index];
110 cout <<
"(" << val <<
") (" <<
value <<
") ";
111 assert(v2[index] == v1[index]);
133 catch(
const std::overflow_error&)
135 cout <<
"Overflow!" <<
endl;
137 catch(
const std::bad_alloc&)
139 cout <<
"Not enough memory!" <<
endl;
141 catch(
const std::invalid_argument&)
143 cout <<
"invalid_argument!" <<
endl;
145 catch (
const std::exception & e)
147 cout << e.what() <<
endl;
156 cout << s.
access(0) <<
" ****************" <<
endl;
158 cout << s.
access(0) <<
" ****************" <<
endl;
162 cout << s[1] <<
" ****************" <<
endl;
171 cout << s[0] <<
" ****************" <<
endl;
173 cout << s.
access(0) <<
" ****************" <<
endl;
177 cout << s[1] <<
" ****************" <<
endl;
182 for (
size_t i = 0; i <
NUM_ITE; ++i)
186 cout << it.get_curr() <<
" ";
size_t size_t int32_t value
Iterator on the items of array.
void reset_last() noexcept
Reset the iterator to the last item.
void prev()
Move the current a position backward.
bool has_curr() const noexcept
Check whether the iterator refers to an item.
T & get_curr() const
Return the current item.
Set-like container backed by a dynamic array.
T & touch(const size_t i)
Touch the entry i.
T & access(const size_t i) const noexcept
Fast access without checking allocation and bound_min_clock checking.
T & append()
Allocate a new entry to the end of array.
void reserve(const size_t l, const size_t r)
Allocate a range of entries.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Main namespace for Aleph-w library functions.