File size: 8,625 Bytes
378910a | 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 | // stack stl/clr header
// Copyright (c) Microsoft Corporation. All rights reserved.
#ifndef _CLI_STACK_
#define _CLI_STACK_
#include <cliext/deque> // for default stack container
#include <cliext/iterator>
namespace cliext {
namespace impl {
//
// TEMPLATE CLASS stack_base
//
template<typename _Value_t,
typename _Cont_t>
ref class stack_base
: public _STLCLR IStack<_Value_t,
typename _Container_traits<_Cont_t>::generic_container_handle>
{ // LIFO queue of elements
public:
// types
typedef stack_base<_Value_t, _Cont_t> _Mytype_t;
typedef _STLCLR IStack<_Value_t,
typename _Container_traits<_Cont_t>::generic_container_handle> _Mycont_it;
typedef cli::array<_Value_t> _Myarray_t;
typedef int size_type;
typedef int difference_type;
typedef _Value_t value_type;
typedef value_type% reference;
typedef value_type% const_reference;
typedef _Mycont_it generic_container;
typedef value_type generic_value;
typedef typename _Dehandle<_Cont_t>::type container_type;
// basics
stack_base()
: c(gcnew container_type)
{ // default constructor
}
stack_base% operator=(stack_base% _Right)
{ // assign
assign(_Right);
return (*this);
}
operator _Mycont_it^()
{ // convert to interface
return (this);
}
// constructors
stack_base(container_type% _Cont)
: c(gcnew container_type(_Cont))
{ // construct from container
}
// destructor
~stack_base()
{ // destroy the object
delete c;
}
// accessors
property value_type top_item
{ // get or set top element
virtual value_type get()
{ // get last element
return (top());
}
virtual void set(value_type _Val)
{ // set last element
top() = _Val;
}
};
reference top()
{ // get top element
return (((typename container_type::generic_container^)c)->back());
}
container_type^ get_container()
{ // return container
return (c);
}
// converters
virtual System::Object^ Clone()
{ // clone the stack
return (gcnew stack_base(*c));
}
_Myarray_t^ to_array()
{ // convert to array
return (c->to_array());
}
// size controllers
size_type size()
{ // return length of sequence
return (c->size());
}
bool empty()
{ // test if sequence is empty
return (size() == 0);
}
// mutators
void push(value_type _Val)
{ // insert element at end
c->push_back(_Val);
}
void pop()
{ // erase element at end
c->pop_back();
}
void assign(_Mytype_t% _Right)
{ // assign
*c = _Right.get_container();
}
_STLCLR_FIELD_ACCESS:
// data members
container_type^ c; // the underlying container
private:
virtual reference top_virtual() sealed
= _Mycont_it::top
{ // get top element
return (top());
}
virtual typename _Container_traits<_Cont_t>::generic_container_handle
get_container_virtual() sealed
= _Mycont_it::get_container
{ // return container
return (get_container());
}
// size controllers
virtual size_type size_virtual() sealed
= _Mycont_it::size
{ // return length of sequence
return (size());
}
virtual bool empty_virtual() sealed
= _Mycont_it::empty
{ // test if sequence is empty
return (empty());
}
// mutators
virtual void push_virtual(value_type _Val) sealed
= _Mycont_it::push
{ // insert element at end
push(_Val);
}
virtual void pop_virtual() sealed
= _Mycont_it::pop
{ // erase element at end
pop();
}
virtual void assign_virtual(_Mycont_it^ _Right) sealed
= _Mycont_it::assign
{ // assign
assign(*(_Mytype_t^)_Right);
}
};
//
// TEMPLATE CLASS stack_select
//
template<typename _Value_t,
typename _Cont_t,
bool _Is_ref>
ref class stack_select
: public stack_base<_Value_t, _Cont_t^>
{ // LIFO queue of elements
public:
// types
typedef stack_select<_Value_t, _Cont_t, _Is_ref> _Mytype_t;
typedef stack_base<_Value_t, _Cont_t^> _Mybase_t;
typedef typename _Mybase_t::container_type container_type;
typedef _Value_t value_type;
typedef value_type% reference;
typedef value_type% const_reference;
// basics
stack_select()
{ // construct with empty container
}
stack_select% operator=(stack_select% _Right)
{ // assign
_Mybase_t::operator=(_Right);
return (*this);
}
// constructors
explicit stack_select(container_type% _Cont)
: _Mybase_t(_Cont)
{ // construct with specified container
}
};
//
// TEMPLATE CLASS stack_select: _Value_t REF SPECIALIZATION
//
template<typename _Value_t,
typename _Cont_t>
ref class stack_select<_Value_t, _Cont_t, true>
: public stack_base<_Value_t^, _Cont_t^>
{ // LIFO queue of elements
public:
// types
typedef stack_select<_Value_t, _Cont_t, true> _Mytype_t;
typedef stack_base<_Value_t^, _Cont_t^> _Mybase_t;
typedef typename _Mybase_t::container_type container_type;
typedef _Value_t value_type;
typedef value_type% reference;
typedef value_type% const_reference;
// basics
stack_select()
{ // construct with empty container
}
stack_select% operator=(stack_select% _Right)
{ // assign
_Mybase_t::operator=(_Right);
return (*this);
}
// constructors
explicit stack_select(container_type% _Cont)
: _Mybase_t(_Cont)
{ // construct with specified container
}
// accessors
property value_type top_item
{ // get or set top element
value_type get()
{ // get last element
return (top());
}
void set(value_type _Val)
{ // set last element
top() = _Val;
}
};
reference top() new
{ // get top element
return (this->c->back());
}
// mutators
void push(value_type _Val)
{ // insert element at end
this->c->push_back(_Val);
}
};
} // namespace cliext::impl
//
// TEMPLATE CLASS stack
//
template<typename _Value_t,
typename _Cont_t = cliext::deque<_Value_t> >
ref class stack
: public impl::stack_select<
_Value_t,
typename _Dehandle<_Cont_t>::type,
__is_ref_class(typename _Dehandle<_Value_t>::type)
&& !is_handle<_Value_t>::value>
{ // LIFO queue of elements
public:
// types
typedef stack<_Value_t, _Cont_t> _Mytype_t;
typedef impl::stack_select<
_Value_t,
typename _Dehandle<_Cont_t>::type,
__is_ref_class(typename _Dehandle<_Value_t>::type)
&& !is_handle<_Value_t>::value> _Mybase_t;
typedef typename _Mybase_t::container_type container_type;
// basics
stack()
{ // construct with empty container
}
stack(stack% _Right)
: _Mybase_t(*_Right.get_container())
{ // construct by copying a stack
}
stack(stack^ _Right)
: _Mybase_t(*_Right->get_container())
{ // construct by copying a stack
}
stack% operator=(stack% _Right)
{ // assign
_Mybase_t::operator=(_Right);
return (*this);
}
stack% operator=(stack^ _Right)
{ // assign
_Mybase_t::operator=(*_Right);
return (*this);
}
// constructors
explicit stack(container_type% _Cont)
: _Mybase_t(_Cont)
{ // construct with specified container
}
// interfaces
virtual System::Object^ Clone() override
{ // clone the vector
return (gcnew _Mytype_t(*this));
}
};
//
// TEMPLATE COMPARISONS
//
template<typename _Value_t,
typename _Cont_t>
bool operator==(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left == _Right
return (*_Left.get_container() == *_Right.get_container());
}
template<typename _Value_t,
typename _Cont_t>
bool operator!=(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left != _Right
return (!(_Left == _Right));
}
template<typename _Value_t,
typename _Cont_t>
bool operator<(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left < _Right
return (*_Left.get_container() < *_Right.get_container());
}
template<typename _Value_t,
typename _Cont_t>
bool operator>=(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left >= _Right
return (!(_Left < _Right));
}
template<typename _Value_t,
typename _Cont_t>
bool operator>(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left > _Right
return (_Right < _Left);
}
template<typename _Value_t,
typename _Cont_t>
bool operator<=(stack<_Value_t, _Cont_t>% _Left,
stack<_Value_t, _Cont_t>% _Right)
{ // test if _Left <= _Right
return (!(_Right < _Left));
}
} // namespace cliext
#endif // _CLI_STACK_
|