4. Prozedurales Programmieren

* lesend */
DataSet get( FVBinTree t, int ix ) {
return t.a[ix];
}
/* modifizier t */
void swap( FVBinTree t, int ix1, int ix2 ) {
DataSet dtmp = t.a[ix1];
t.a[ix1] = t.a[ix2];
t.a[ix2] = dtmp;
}
/* modifizier t */
void removeLast( FVBinTree t ){t.currsize--;}
/* lesend */
boolean hasLeft( FVBinTree t, int ix ){
return left(t,ix) < t.currsize;
}
/* lesend */
boolean hasRight( FVBinTree t, int ix ) {
return right(t,ix) < t.currsize;
}
/* lesend */
int left( FVBinTree t, int ix ) {
return 2*(ix+1)-1;
}
/* lesend */
int right( FVBinTree t, int ix ) {
return 2*(ix+1);
}
04.12.08 © A. Poetzsch-Heffter, TU Kaiserslautern
141