🚀 go-pugleaf

"Roger Hemme" <rog@net.nl> wrote in message news:45823D21.30200@net.nl...

> The BCB-code:

In that case, your translation is pretty much right on.  A directly
translation is as follows:

    function FindParentMessage(Messages: TStrings; References: String):
TTreeNode;
    var
        pFirst, pStop, pStart, pEnd: PChar;
        MsgIdToFind: String;
        Idx: Integer;
    begin
        Result := nil;
        if Length(References) = 0 then Exit;

        pFirst := PChar(References);
        pStop := (pFirst+2);
        pEnd := AnsiLastChar(References);

        // scan through the reference list from back to front as
        // newer messages in a discussion are at the end of the list
        while pEnd > pStop do
        begin
            // find the end of the MsgID
            while (pEnd > pStop) and (pEnd^ <> '>') do Dec(pEnd);
            if pEnd = pStop then Break;

            // find the start of the MsgID
            pStart := (pEnd-1);
            while (pStart >= pFirst) and (pStart^ <> '<') do Dec(pStart);
            if pStart < pFirst then Break;

            // find the MsgID in the stored list. chances are, the parent
            // message was downloaded just prior to the message currently
            // being processed, so scan the stored messages from last to
first

            SetString(MsgIdToFind, pStart, Longint(pEnd-pStart)+1);
            for Idx := Messages.Count-1 downto 0 do
            begin
                if Messages.Strings[idx] = MsgIdToFind then
                begin
                    // MsgID was found
                    Result := TTreeNode(Messages.Objects[idx]);
                    Exit;
                end;
            end;

            // keep going
            pEnd := (pStart-1);
        end;

        // MsgID not found
    end;

    // the rest I already gave you earlier...

With that said, you still haven't explained what exactly you are having a
problem with.  Just saying that something is not working says nothing about
the actual problem.


Gambit