Question

var
  FileBuff: TBytes;
  Pattern: TBytes;
begin
  FileBuff := filetobytes(filename);
  Result := CompareMem(@Pattern[0], @FileBuff[0], Length(Pattern));
end;

是否有任何功能，如

Result := Pos(@Pattern[0], @FileBuff[0]);

Answer 1

我认为这样做：

function BytePos(const Pattern: TBytes; const Buffer: PByte; const BufLen: cardinal): PByte;
var
  PatternLength: cardinal;
  i: cardinal;
  j: cardinal;
  OK: boolean;
begin
  result := nil;
  PatternLength := length(Pattern);
  if PatternLength > BufLen then Exit;
  if PatternLength = 0 then Exit(Buffer);
  for i := 0 to BufLen - PatternLength do
    if PByte(Buffer + i)^ = Pattern[0] then
    begin
      OK := true;
      for j := 1 to PatternLength - 1 do
        if PByte(Buffer + i + j)^ <> Pattern[j] then
        begin
          OK := false;
          break
        end;
      if OK then
        Exit(Buffer + i);
    end;
end;

Answer 2

自己写。查找一个字节时无法进行优化，因此您找到的任何实现基本上都会做同样的事情。

用浏览器编写：

function BytePos(Pattern:Byte; Buffer:PByte; BufferSize:Integer): Integer;
var i:Integer;
begin
  for i:=0 to BufferSize-1 do
    if Buffer[i] = Pattern then
    begin
      Result := i;
      Exit;
    end;
  Result := -1;
end;

是否有任何“Pos”函数来查找字节？

2 个答案: