这是一份oxford牛津大学作业代写的成功案例

constructor TtdRecordList.Create(aElementSize : integer);
begin
inherited Create;
{save the actual element size}
FActElemSize := aElementSize;
{round the actual size to the nearest 4 bytes}
FElementSize := ((aElementSize + 3) shr 2) shl 2;
{calculate the maximum number of elements}
{$IFDEF Delphi1}
FMaxElemCount := 65535 div FElementSize;
{$ELSE}
FMaxElemCount := MaxInt div FElementSize;
{$ENDIF}
end;

Oxford COURSE NOTES ：

function TtdRecordList.Remove(aItem : pointer;
aCompare : TtdCompareFunc) : integer;
begin
Result := IndexOf(aItem, aCompare);
if (Result<>tdc_ItemNotPresent) then
Delete(Result);
end;
function TtdRecordList.IndexOf(aItem : pointer;
aCompare : TtdCompareFunc) : integer;
var
ElementPtr : PAnsiChar;
i : integer;
begin
ElementPtr := FArray;
for i := 0 to pred(Count) do begin
if (aCompare(aItem, ElementPtr) = 0) then begin
Result := i;
Exit;
end;
inc(ElementPtr, FElementSize);
end;
Result