My Project
|
#include <container.h>
Public Member Functions | |
void | sortByBasic () |
駒の価値の小さい順に並び替える. | |
void | sortByPtype () |
駒の価値の大きい順に並び替える. | |
![]() | |
FixedCapacityVector () | |
FixedCapacityVector (size_t size) | |
FixedCapacityVector (FixedCapacityVector const &rhs) | |
FixedCapacityVector (const RangeIterator &first, const RangeIterator &last) | |
~FixedCapacityVector () | |
FixedCapacityVector & | operator= (FixedCapacityVector const &rhs) |
Piece & | operator[] (size_t i) |
Piece const & | operator[] (size_t i) const |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
Piece & | front () |
const Piece & | front () const |
Piece & | back () |
const Piece & | back () const |
void | push_back (const Piece &e) |
void | push_back (const RangeIterator &first, const RangeIterator &last) |
void | pop_back () |
void | clear () |
void | resize (size_t new_length) |
void | erase (const Piece &e) |
void | unique () |
重複する要素を取り除く | |
size_t | size () const |
bool | empty () const |
size_t | capacity () const |
bool | isMember (const Piece &e, const_iterator first, const_iterator last) const |
bool | isMember (const Piece &e) const |
detail::FixedCapacityVectorPushBack< Piece > | pushBackHelper () |
Additional Inherited Members | |
![]() | |
typedef array_t::value_type | value_type |
typedef array_t::iterator | iterator |
typedef array_t::const_iterator | const_iterator |
![]() | |
typedef Array | array_t |
![]() | |
Piece * | ptr |
CArray< int64_t,(sizeof(Piece[Capacity])+sizeof(int64_t) -1)/sizeof(int64_t)> | relements |
Definition at line 304 of file container.h.
void osl::PieceVector::sortByBasic | ( | ) |
駒の価値の小さい順に並び替える.
成っているかに関わらず 歩香桂銀金角飛王
Definition at line 41 of file container.cc.
References osl::FixedCapacityVector< Piece, Piece::SIZE >::begin(), and osl::FixedCapacityVector< Piece, Piece::SIZE >::end().
void osl::PieceVector::sortByPtype | ( | ) |