TProcuraAdversa
Algoritmos de procura adversa
|
#include <TVector.h>
Public Member Functions | |
TVector (int size=0) | |
TVector (int size, Item const *init) | |
virtual | ~TVector () |
void | Add (Item a) |
void | Insert (Item a, int index=0) |
TVector< Item > & | Insert (TVector< Item > &v, int index=0) |
void | Push (Item a) |
Item & | Pop () |
Item & | operator[] (int i) |
Item & | First () |
Item & | Last () |
int | Count () |
void | Count (int value) |
Item & | Random () |
TVector< Item > & | operator= (TVector< Item > &v) |
TVector< Item > & | operator+= (TVector< Item > &v) |
TVector< Item > & | BeASet () |
TVector< Item > & | Union (TVector< Item > &v) |
TVector< Item > & | Intersection (TVector< Item > &v) |
TVector< Item > & | Difference (TVector< Item > &v) |
bool | Equal (TVector< Item > &v) |
bool | Contained (TVector< Item > &v) |
void | Delete (int i) |
void | Remove (Item const &i) |
int | Find (Item &i, bool binary=false, int left=0, int right=-1) |
void | Replace (Item const &iold, Item const &inew) |
void | Sort (TVector< int > *idxvect=NULL) |
void | Sort (int start, int end=-1) |
void | RandomOrder () |
void | Invert () |
void | Reset (Item const &i) |
int | Distance (TVector< Item > &v, int type=0) |
Static Public Attributes | |
static Item | erro |
|
inline |
|
inline |
|
inline |
void TVector< Item >::Delete | ( | int | i | ) |
int TVector< Item >::Find | ( | Item & | i, |
bool | binary = false , |
||
int | left = 0 , |
||
int | right = -1 |
||
) |
|
inline |
void TVector< Item >::Insert | ( | Item | a, |
int | index = 0 |
||
) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
void TVector< Item >::RandomOrder | ( | ) |
void TVector< Item >::Remove | ( | Item const & | i | ) |
void TVector< Item >::Replace | ( | Item const & | iold, |
Item const & | inew | ||
) |
void TVector< Item >::Reset | ( | Item const & | i | ) |
void TVector< Item >::Sort | ( | int | start, |
int | end = -1 |
||
) |