📄 tntclasses2.pas
字号:
EndUpdate;
end;
end;
end;
procedure TTntStrings2.ReadDataUTF7(Reader: TReader);
begin
Reader.ReadListBegin;
if ReaderNeedsUtfHelp(Reader) then
begin
BeginUpdate;
try
Clear;
while not Reader.EndOfList do
Add(UTF7ToWideString(Reader.ReadString))
finally
EndUpdate;
end;
end else begin
while not Reader.EndOfList do
Reader.ReadString; { do nothing with Result }
end;
Reader.ReadListEnd;
end;
procedure TTntStrings2.ReadDataUTF8(Reader: TReader);
begin
Reader.ReadListBegin;
if ReaderNeedsUtfHelp(Reader)
or (Count = 0){ Legacy support where 'WideStrings' was never written in lieu of WideStringsW }
then begin
BeginUpdate;
try
Clear;
while not Reader.EndOfList do
Add(UTF8ToWideString(Reader.ReadString))
finally
EndUpdate;
end;
end else begin
while not Reader.EndOfList do
Reader.ReadString; { do nothing with Result }
end;
Reader.ReadListEnd;
end;
procedure TTntStrings2.SaveToFile(const FileName: WideString);
var
Stream: TStream;
begin
Stream := TTntFileStream.Create(FileName, fmCreate);
try
SaveToStream(Stream);
finally
Stream.Free;
end;
end;
procedure TTntStrings2.SaveToStream(Stream: TStream);
begin
SaveToStream_BOM(Stream, True);
end;
procedure TTntStrings2.SaveToStream_BOM(Stream: TStream; WithBOM: Boolean);
// Saves the currently loaded text into the given stream.
// WithBOM determines whether to write a byte order mark or not.
var
SW: WideString;
BOM: WideChar;
begin
if WithBOM then begin
BOM := UNICODE_BOM;
Stream.WriteBuffer(BOM, SizeOf(WideChar));
end;
SW := GetTextStr;
Stream.WriteBuffer(PWideChar(SW)^, Length(SW) * SizeOf(WideChar));
end;
procedure TTntStrings2.SaveToFileWB(const FileName: WideString; WithBOM: Boolean);
var
Stream: TStream;
begin
Stream := TTntFileStream.Create(FileName, fmCreate);
try
SaveToStream_BOM(Stream, WithBOM);
finally
Stream.Free;
end;
end;
procedure TTntStrings2.WriteDataUTF7(Writer: TWriter);
var
I: Integer;
begin
Writer.WriteListBegin;
for I := 0 to Count-1 do
Writer.WriteString(WideStringToUTF7(Get(I)));
Writer.WriteListEnd;
end;
{--------------------------------------}
{ TTntStringList2 }
destructor TTntStringList2.Destroy;
begin
FOnChange := nil;
FOnChanging := nil;
inherited Destroy;
if FCount <> 0 then Finalize(FList^[0], FCount);
FCount := 0;
SetCapacity(0);
end;
function TTntStringList2.Add(const S: WideString): Integer;
begin
Result := AddObject(S, nil);
end;
function TTntStringList2.AddObject(const S: WideString; AObject: TObject): Integer;
begin
if not Sorted then
Result := FCount
else
if Find(S, Result) then
case Duplicates of
dupIgnore: Exit;
dupError: Error(PResStringRec(@SDuplicateString), 0);
end;
InsertItem(Result, S, AObject);
end;
procedure TTntStringList2.Changed;
begin
if (not FUpdating) and Assigned(FOnChange) then
FOnChange(Self);
end;
procedure TTntStringList2.Changing;
begin
if (not FUpdating) and Assigned(FOnChanging) then
FOnChanging(Self);
end;
procedure TTntStringList2.Clear;
begin
if FCount <> 0 then
begin
Changing;
Finalize(FList^[0], FCount);
FCount := 0;
SetCapacity(0);
Changed;
end;
end;
procedure TTntStringList2.Delete(Index: Integer);
begin
if (Index < 0) or (Index >= FCount) then Error(PResStringRec(@SListIndexError), Index);
Changing;
Finalize(FList^[Index]);
Dec(FCount);
if Index < FCount then
System.Move(FList^[Index + 1], FList^[Index],
(FCount - Index) * SizeOf(TWideStringItem));
Changed;
end;
procedure TTntStringList2.Exchange(Index1, Index2: Integer);
begin
if (Index1 < 0) or (Index1 >= FCount) then Error(PResStringRec(@SListIndexError), Index1);
if (Index2 < 0) or (Index2 >= FCount) then Error(PResStringRec(@SListIndexError), Index2);
Changing;
ExchangeItems(Index1, Index2);
Changed;
end;
procedure TTntStringList2.ExchangeItems(Index1, Index2: Integer);
var
Temp: Integer;
Item1, Item2: PWideStringItem;
begin
Item1 := @FList^[Index1];
Item2 := @FList^[Index2];
Temp := Integer(Item1^.FString);
Integer(Item1^.FString) := Integer(Item2^.FString);
Integer(Item2^.FString) := Temp;
Temp := Integer(Item1^.FObject);
Integer(Item1^.FObject) := Integer(Item2^.FObject);
Integer(Item2^.FObject) := Temp;
end;
function TTntStringList2.Find(const S: WideString; var Index: Integer): Boolean;
var
L, H, I, C: Integer;
begin
Result := False;
L := 0;
H := FCount - 1;
while L <= H do
begin
I := (L + H) shr 1;
C := CompareStrings(FList^[I].FString, S);
if C < 0 then L := I + 1 else
begin
H := I - 1;
if C = 0 then
begin
Result := True;
if Duplicates <> dupAccept then L := I;
end;
end;
end;
Index := L;
end;
function TTntStringList2.Get(Index: Integer): WideString;
begin
if (Index < 0) or (Index >= FCount) then Error(PResStringRec(@SListIndexError), Index);
Result := FList^[Index].FString;
end;
function TTntStringList2.GetCapacity: Integer;
begin
Result := FCapacity;
end;
function TTntStringList2.GetCount: Integer;
begin
Result := FCount;
end;
function TTntStringList2.GetObject(Index: Integer): TObject;
begin
if (Index < 0) or (Index >= FCount) then Error(PResStringRec(@SListIndexError), Index);
Result := FList^[Index].FObject;
end;
procedure TTntStringList2.Grow;
var
Delta: Integer;
begin
if FCapacity > 64 then Delta := FCapacity div 4 else
if FCapacity > 8 then Delta := 16 else
Delta := 4;
SetCapacity(FCapacity + Delta);
end;
function TTntStringList2.IndexOf(const S: WideString): Integer;
begin
if not Sorted then Result := inherited IndexOf(S) else
if not Find(S, Result) then Result := -1;
end;
function TTntStringList2.IndexOfName(const Name: WideString): Integer;
var
NameKey: WideString;
begin
if not Sorted then
Result := inherited IndexOfName(Name)
else begin
// use sort to find index more quickly
NameKey := Name + NameValueSeparator;
Find(NameKey, Result);
if (Result < 0) or (Result > Count - 1) then
Result := -1
else if CompareStrings(NameKey, Copy(Strings[Result], 1, Length(NameKey))) <> 0 then
Result := -1
end;
end;
procedure TTntStringList2.Insert(Index: Integer; const S: WideString);
begin
InsertObject(Index, S, nil);
end;
procedure TTntStringList2.InsertObject(Index: Integer; const S: WideString;
AObject: TObject);
begin
if Sorted then Error(PResStringRec(@SSortedListError), 0);
if (Index < 0) or (Index > FCount) then Error(PResStringRec(@SListIndexError), Index);
InsertItem(Index, S, AObject);
end;
procedure TTntStringList2.InsertItem(Index: Integer; const S: WideString; AObject: TObject);
begin
Changing;
if FCount = FCapacity then Grow;
if Index < FCount then
System.Move(FList^[Index], FList^[Index + 1],
(FCount - Index) * SizeOf(TWideStringItem));
with FList^[Index] do
begin
Pointer(FString) := nil;
FObject := AObject;
FString := S;
end;
Inc(FCount);
Changed;
end;
procedure TTntStringList2.Put(Index: Integer; const S: WideString);
begin
if Sorted then Error(PResStringRec(@SSortedListError), 0);
if (Index < 0) or (Index >= FCount) then Error(PResStringRec(@SListIndexError), Index);
Changing;
FList^[Index].FString := S;
Changed;
end;
procedure TTntStringList2.PutObject(Index: Integer; AObject: TObject);
begin
if (Index < 0) or (Index >= FCount) then Error(PResStringRec(@SListIndexError), Index);
Changing;
FList^[Index].FObject := AObject;
Changed;
end;
procedure TTntStringList2.QuickSort(L, R: Integer; SCompare: TWideStringListSortCompare);
var
I, J, P: Integer;
begin
repeat
I := L;
J := R;
P := (L + R) shr 1;
repeat
while SCompare(Self, I, P) < 0 do Inc(I);
while SCompare(Self, J, P) > 0 do Dec(J);
if I <= J then
begin
ExchangeItems(I, J);
if P = I then
P := J
else if P = J then
P := I;
Inc(I);
Dec(J);
end;
until I > J;
if L < J then QuickSort(L, J, SCompare);
L := I;
until I >= R;
end;
procedure TTntStringList2.SetCapacity(NewCapacity: Integer);
begin
ReallocMem(FList, NewCapacity * SizeOf(TWideStringItem));
FCapacity := NewCapacity;
end;
procedure TTntStringList2.SetSorted(Value: Boolean);
begin
if FSorted <> Value then
begin
if Value then Sort;
FSorted := Value;
end;
end;
procedure TTntStringList2.SetUpdateState(Updating: Boolean);
begin
FUpdating := Updating;
if Updating then Changing else Changed;
end;
function WideStringListCompareStrings(List: TTntStringList2; Index1, Index2: Integer): Integer;
begin
Result := List.CompareStrings(List.FList^[Index1].FString,
List.FList^[Index2].FString);
end;
procedure TTntStringList2.Sort;
begin
CustomSort(WideStringListCompareStrings);
end;
procedure TTntStringList2.CustomSort(Compare: TWideStringListSortCompare);
begin
if not Sorted and (FCount > 1) then
begin
Changing;
QuickSort(0, FCount - 1, Compare);
Changed;
end;
end;
function TTntStringList2.CompareStrings(const S1, S2: WideString): Integer;
begin
if CaseSensitive then
Result := WideCompareStr(S1, S2)
else
Result := WideCompareText(S1, S2);
end;
procedure TTntStringList2.SetCaseSensitive(const Value: Boolean);
begin
if Value <> FCaseSensitive then
begin
FCaseSensitive := Value;
if Sorted then Sort;
end;
end;
{--------------------------------------}
function TUnicodeLinesEditor.GetText: WideString;
var
I: Integer;
begin
if Count = 0
then Result := ''
else begin
Result := '';
for I := 0 to Count-1 do begin
Result := Concat (Result, Self[I]);
if I <> Count-1
then Result := Concat (Result, sLineBreak);
end;
end;
end {GetText};
procedure TUnicodeLinesEditor.SetText (const Value: WideString);
var
S1, S2: WideString;
begin
Clear;
if Value <> '' then begin
S1 := Value;
while S1 <> '' do begin
S2 := WStrUntilDelimiter (S1, sLineBreak);
Add (S2);
end;
end;
end {SetText};
{--------------------------------------}
end.
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -