I need to know if all characters in a string are equal (formed by the same character). the function must return true or false depending if all the elements of the string ar
You implemented the suggestion of Barry Kelly wrong. When I test it on Delphi 7, it is even slower than your first implementation and it gives wrong results if your stringlength is not divisible by 4.
I tested it with this string: StringOfChar('c', 100000) + 'x';
and your new function returns True AllElementsAreEqual('c', StringOfChar('c', 100000) + 'x')
while it should return False.
Your implementation is slower because you are trying to make your string divisable by four (in which you fail, but you can figure out by yourself why it fails) and thus creating a new string which needs memory allocations which are costly.
Another dangerous thing you do is letting a dynamic array (array of integer) point to a string. Both are refcounted and this can lead to strange results. Please follow Barry Kelly's advise and use a PIntegerArray!
I think Barry Kelly meant this:
function AllElementsAreEqual(const aElement: Char; const aStr: string): Boolean;
var
lIntArray: PIntegerArray;
i: Integer;
lTest: Integer;
begin
Result := True;
lTest := Ord(aElement) + Ord(aElement) shl 8 + Ord(aElement) shl 16 + Ord(aElement) shl 24;
lIntArray := @aStr[1];
for i := 0 to Length(aStr) div 4 - 1 do
if lIntArray[i] <> lTest then
begin
Result := False;
Exit;
end;
for i := Length(aStr) - (Length(aStr) mod 4) + 1 to Length(aStr) do
if aStr[i] <> aElement then
begin
Result := False;
Exit;
end;
end;
NB: Your function returns True for empty strings, is that OK?
NB2: Please award points to Barry Kelly's answer and not mine, because this is really an oversized comment and not an answer.
Get the string length, use GetMem to allocate memory the size of the string. FillChar the memory with the desired char. Then use CompareMem to compare the string and the memory
Maybe use StringOfChar to generate a string with the target char repeated N times, then do a string comparison instead of comparing char-by-char.
(Don't know if this is actually faster; measure & see).
You could implement a Select algorithm to faster find char out of place, this will not increase the speed it the string is "True", but it should make it somewhat faster.
You could consider creating an Integer
value with the Element
repeated 4 times (since this is AnsiChar
in Delphi 7), shifted like Ord(Element) + Ord(Element) shl 8 + Ord(Element) shl 16 + Ord(Element) shl 24
, then typecast the string to a PIntegerArray
(^array[0..MaxInt div 4 - 1] of Integer
) and loop over it Length(Str) div 4
times, comparing as integers instead of characters. You'll need to compare the last few Length(str) mod 4
characters manually though.
From what i understood from your code
Result:= False;
":=" is used to assign value to a variable. how do you compare 2 values in delphi?