diff options
| author | Alexey Kulakov <panda75@bk.ru> | 2012-07-04 13:17:29 +0000 |
|---|---|---|
| committer | Alexey Kulakov <panda75@bk.ru> | 2012-07-04 13:17:29 +0000 |
| commit | a5a3db4393d85407ff4c5668d88860e06158abd0 (patch) | |
| tree | bcc8f716833034e33984a539ab7d1debfdd6a7d3 /plugins/HistoryPlusPlus/hpp_arrays.pas | |
| parent | 88ec2ae53ddc811d08763b2fb3a0073b571a321c (diff) | |
History++ sources upload (all files, no project)
git-svn-id: http://svn.miranda-ng.org/main/trunk@756 1316c22d-e87f-b044-9b9b-93d7a3e3ba9c
Diffstat (limited to 'plugins/HistoryPlusPlus/hpp_arrays.pas')
| -rw-r--r-- | plugins/HistoryPlusPlus/hpp_arrays.pas | 158 |
1 files changed, 158 insertions, 0 deletions
diff --git a/plugins/HistoryPlusPlus/hpp_arrays.pas b/plugins/HistoryPlusPlus/hpp_arrays.pas new file mode 100644 index 0000000000..f564fa9805 --- /dev/null +++ b/plugins/HistoryPlusPlus/hpp_arrays.pas @@ -0,0 +1,158 @@ +(*
+ History++ plugin for Miranda IM: the free IM client for Microsoft* Windows*
+
+ Copyright (C) 2006-2009 theMIROn, 2003-2006 Art Fedorov.
+ History+ parts (C) 2001 Christian Kastner
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+*)
+
+unit hpp_arrays;
+
+interface
+
+uses hpp_jclSysUtils, hpp_global;
+
+function IntSortedArray_Add(var A: TIntArray; Value: Integer): Integer;
+procedure IntSortedArray_Remove(var A: TIntArray; Value: Integer);
+function IntSortedArray_Find(var A: TIntArray; Value: Integer): Integer;
+procedure IntSortedArray_Sort(var A: TIntArray);
+function IntSortedArray_NonIntersect(var A, B: TIntArray): TIntArray;
+
+procedure IntArrayRemove(var A: TIntArray; Index: Integer);
+procedure IntArrayInsert(var A: TIntArray; Index: Integer; Value: Integer);
+
+implementation
+
+procedure IntArrayRemove(var A: TIntArray; Index: Integer);
+var
+ i: Integer;
+begin
+ for i := Index to Length(A) - 2 do
+ A[i] := A[i + 1];
+ SetLength(A, Length(A) - 1);
+end;
+
+procedure IntArrayInsert(var A: TIntArray; Index: Integer; Value: Integer);
+var
+ i: Integer;
+begin
+ SetLength(A, Length(A) + 1);
+ for i := Length(A) - 1 downto Index do
+ A[i] := A[i - 1];
+ A[Index] := Value;
+end;
+
+function IntSortedArray_Add(var A: TIntArray; Value: Integer): Integer;
+begin
+ Result := SearchDynArray(A, SizeOf(Integer), DynArrayCompareInteger, @Value, True);
+ if Result <> -1 then // we have nearest or match
+ begin
+ if A[Result] = Value then
+ exit;
+ if A[Result] < Value then
+ Inc(Result);
+ end
+ else // we don't have any nearest values, array is empty
+ Result := 0;
+ IntArrayInsert(A, Result, Value);
+end;
+
+procedure IntSortedArray_Remove(var A: TIntArray; Value: Integer);
+var
+ idx: Integer;
+begin
+ idx := SearchDynArray(A, SizeOf(Integer), DynArrayCompareInteger, @Value);
+ if idx = -1 then
+ exit;
+ IntArrayRemove(A, idx);
+end;
+
+function IntSortedArray_Find(var A: TIntArray; Value: Integer): Integer;
+begin
+ Result := SearchDynArray(A, SizeOf(Integer), DynArrayCompareInteger, @Value);
+end;
+
+procedure IntSortedArray_Sort(var A: TIntArray);
+begin
+ SortDynArray(A, SizeOf(Integer), DynArrayCompareInteger);
+end;
+
+function IntSortedArray_NonIntersect(var A, B: TIntArray): TIntArray;
+var
+ ia, ib: Integer;
+ lenr, lena, lenb: Integer;
+
+ procedure AddToResult(Item: Integer);
+ begin
+ Inc(lenr);
+ SetLength(Result, lenr);
+ Result[lenr - 1] := Item;
+ end;
+
+begin
+ SetLength(Result, 0);
+ lenr := 0;
+ lena := Length(A);
+ lenb := Length(B);
+ ib := 0;
+ ia := 0;
+
+ while ia < lena do
+ begin
+
+ if ib >= lenb then
+ begin
+ AddToResult(A[ia]);
+ Inc(ia);
+ continue;
+ end;
+
+ if A[ia] = B[ib] then
+ begin
+ Inc(ib);
+ Inc(ia);
+ continue;
+ end;
+
+ if A[ia] > B[ib] then
+ begin
+ while A[ia] > B[ib] do
+ begin
+ AddToResult(B[ib]);
+ Inc(ib);
+ if ib >= lenb then
+ break;
+ end;
+ continue;
+ end;
+
+ if A[ia] < B[ib] then
+ begin
+ AddToResult(A[ia]);
+ Inc(ia);
+ continue;
+ end;
+
+ end;
+
+ while ib < lenb do
+ begin
+ AddToResult(B[ib]);
+ Inc(ib);
+ end;
+end;
+
+end.
|