text stringlengths 14 6.51M |
|---|
unit fConsultBD;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs, ORFN,
StdCtrls, ExtCtrls, ORCtrls, ORDtTm, uConsults, fBase508Form,
VA508AccessibilityManager;
type
TfrmConsultsByDate = class(TfrmBase508Form)
pnlBase: TORAutoPanel;
lblBeginDate: TLabel;
calBeginDate: TORDateBox;
lblEndDate: TLabel;
calEndDate: TORDateBox;
radSort: TRadioGroup;
cmdOK: TButton;
cmdCancel: TButton;
procedure cmdOKClick(Sender: TObject);
procedure cmdCancelClick(Sender: TObject);
procedure calBeginDateKeyPress(Sender: TObject; var Key: Char);
procedure calEndDateKeyPress(Sender: TObject; var Key: Char);
private
FChanged: Boolean;
FBeginDate: string;
FEndDate: string;
FAscending: Boolean;
end;
TConsultDateRange = record
Changed: Boolean;
BeginDate: string;
EndDate: string;
Ascending: Boolean;
end;
function SelectConsultDateRange(FontSize: Integer; CurrentContext: TSelectContext; var ConsultDateRange: TConsultDateRange): boolean;
implementation
{$R *.DFM}
uses rCore, rConsults;
const
TX_DATE_ERR = 'Enter valid beginning and ending dates or press Cancel.';
TX_DATE_ERR_CAP = 'Error in Date Range';
function SelectConsultDateRange(FontSize: Integer; CurrentContext: TSelectContext; var ConsultDateRange: TConsultDateRange): boolean;
{ displays date range select form for progress Consults and returns a record of the selection }
var
frmConsultsByDate: TfrmConsultsByDate;
W, H: Integer;
CurrentBegin, CurrentEnd: string;
begin
frmConsultsByDate := TfrmConsultsByDate.Create(Application);
try
with frmConsultsByDate do
begin
Font.Size := FontSize;
W := ClientWidth;
H := ClientHeight;
ResizeToFont(FontSize, W, H);
ClientWidth := W; pnlBase.Width := W;
ClientHeight := H; pnlBase.Height := H;
FChanged := False;
with radSort do {if SortConsultsAscending then ItemIndex := 0 else} ItemIndex := 1;
CurrentBegin := CurrentContext.BeginDate;
CurrentEnd := CurrentContext.EndDate;
if CurrentBegin <> '' then
calBeginDate.Text := CurrentBegin;
if CurrentEnd <> '' then
calEndDate.Text := CurrentEnd;
if calEndDate.Text = '' then calEndDate.Text := 'TODAY';
ShowModal;
with ConsultDateRange do
begin
Changed := FChanged;
BeginDate := FBeginDate;
EndDate := FEndDate;
Ascending := FAscending;
Result := Changed ;
end; {with ConsultDateRange}
end; {with frmConsultsByDate}
finally
frmConsultsByDate.Release;
end;
end;
procedure TfrmConsultsByDate.cmdOKClick(Sender: TObject);
var
bdate, edate: TFMDateTime;
begin
bdate := StrToFMDateTime(calBeginDate.Text);
edate := StrToFMDateTime(calEndDate.Text);
if ((bdate > 0) and (edate > 0)) and (bdate <= edate) then
begin
FChanged := True;
FBeginDate := calBeginDate.Text;
FEndDate := calEndDate.Text;
FAscending := radSort.ItemIndex = 0;
Close;
end else
begin
InfoBox(TX_DATE_ERR, TX_DATE_ERR_CAP, MB_OK or MB_ICONWARNING);
Exit;
end;
end;
procedure TfrmConsultsByDate.cmdCancelClick(Sender: TObject);
begin
Close;
end;
procedure TfrmConsultsByDate.calBeginDateKeyPress(Sender: TObject;
var Key: Char);
begin
if (Key = #13) then cmdOKClick(Self);
end;
procedure TfrmConsultsByDate.calEndDateKeyPress(Sender: TObject;
var Key: Char);
begin
if (Key = #13) then cmdOKClick(Self);
end;
end.
|
unit NaturalSort;
interface
uses System.Generics.Defaults, System.SysUtils, System.Character;
type
TNaturalStringComparer = class(TComparer<String>)
private
function InChunk(Ch, OtherCh: Char): Boolean;
public
function Compare(const Left, Right: String): Integer; override;
end;
implementation
type
TChunkType = (Alphanumeric, Numeric);
function TNaturalStringComparer.Compare(const Left, Right: String): Integer;
Var
s: string;
s1: String;
s2: string;
thatCh: Char;
thatChunk: TStringBuilder;
thatMarker: Integer;
thatNumericChunk: Integer;
thisCh: Char;
thisChunk: TStringBuilder;
thisMarker: Integer;
thisNumericChunk: Integer;
x1: Double;
x2: Double;
begin
s1 := Left;
s2 := Right;
// Меняем точку на правильный разделитель целой и дробной части
s := s1.Replace('.', FormatSettings.DecimalSeparator);
// Возможно мы имеем дело с числами
x1 := StrToFloatDef(s, MaxInt);
if x1 <> MaxInt then
begin
// Меняем точку на правильный разделитель целой и дробной части
s := s2.Replace('.', FormatSettings.DecimalSeparator);
x2 := StrToFloatDef(s, MaxInt);
if x2 <> MaxInt then
begin
if x1 = x2 then
Result := 0
else if x1 > x2 then
Result := 1
else
Result := -1;
Exit;
end;
end;
Result := 0;
thisMarker := 0;
// thisNumericChunk := 0;
thatMarker := 0;
// thatNumericChunk := 0;
thisChunk := TStringBuilder.Create;
thatChunk := TStringBuilder.Create;
try
while ((thisMarker < s1.Length) or (thatMarker < s2.Length)) do
begin
if (thisMarker >= s1.Length) then
begin
Result := -1;
Exit;
end
else if (thatMarker >= s2.Length) then
begin
Result := 1;
Exit;
end;
thisCh := s1.Chars[thisMarker];
thatCh := s2.Chars[thatMarker];
thisChunk.Clear;
thatChunk.Clear;
while (thisMarker < s1.Length) AND
((thisChunk.Length = 0) OR InChunk(thisCh, thisChunk[0])) do
begin
thisChunk.Append(thisCh);
Inc(thisMarker);
if (thisMarker < s1.Length) then
begin
thisCh := s1.Chars[thisMarker];
end;
end;
while (thatMarker < s2.Length) AND
((thatChunk.Length = 0) OR InChunk(thatCh, thatChunk[0])) do
begin
thatChunk.Append(thatCh);
Inc(thatMarker);
if (thatMarker < s2.Length) then
begin
thatCh := s2.Chars[thatMarker];
end;
end;
Result := 0;
// If both chunks contain numeric characters, sort them numerically
if thisChunk[0].IsDigit AND thatChunk[0].IsDigit then
begin
thisNumericChunk := thisChunk.ToString.ToInteger;
thatNumericChunk := thatChunk.ToString.ToInteger;
if (thisNumericChunk < thatNumericChunk) then
begin
Result := -1;
end;
if (thisNumericChunk > thatNumericChunk) then
begin
Result := 1;
end;
end
else
begin
Result := thisChunk.ToString().CompareTo(thatChunk.ToString());
end;
if (Result <> 0) then
begin
Exit;
end;
end;
finally
FreeAndNil(thisChunk);
FreeAndNil(thatChunk);
end;
end;
function TNaturalStringComparer.InChunk(Ch, OtherCh: Char): Boolean;
var
AType: TChunkType;
begin
AType := Alphanumeric;
if OtherCh.IsDigit then
begin
AType := Numeric;
end;
Result := not(((AType = Alphanumeric) AND Ch.IsDigit) OR
((AType = Numeric) AND not Ch.IsDigit))
end;
end.
|
{*******************************************************************************
Unit description: class for Load DLL
Developer: cy Date: 2003/03/22
Modifier: cy Date: 2003/03/25
Modifier: mjg Date: 2003/10/15
Coding standard version NO. :1.0
Copyright(C)SCM ,All right reserved
*******************************************************************************}
unit clsLoadDLL;
interface
uses
SysUtils, Forms, Windows, clsGlobal, Classes;
type
EDLLLoadError = class(Exception);
{Type for dynamical loading DLL}
TCallDLL = function(AobjGlobal: TGlobal): TForm; stdcall;
{Set old Applicaton Var in Dll }
TSetDLL = procedure; stdcall;
TLoadDLL = class(TObject)
private
{ Private declarations }
public
{ Public declarations }
DLLForm: TForm;
CallDLL: TCallDLL;
SetDLL: TSetDLL;
iDLL: hwnd;
constructor Create;
destructor Destroy; override;
end;
function CreateobjLoadDLL(ADLLNameList: TStringList; ADLLName: string): Boolean;
procedure LoadDLL(ADLLNameList: TStringList; PFormFreeCallBack: Pointer; const ADLLName: string);
var
objLoadDLL: TLoadDLL;
implementation
function CreateobjLoadDLL(ADLLNameList: TStringList; ADLLName: string): Boolean;
begin
Result := false;
if ADLLNameList.IndexOf(ADLLName) < 0 then exit;
if ADLLNameList.Objects[ADLLNameList.IndexOf(ADLLName)] = nil then
begin
objLoadDLL := TLoadDLL.Create;
ADLLNameList.Delete(ADLLNameList.IndexOf(ADLLName));
ADLLNameList.AddObject(ADLLName, objLoadDLL);
end;
Result := True;
end;
constructor TLoadDLL.Create;
begin
inherited;
iDLL := 0;
end;
destructor TLoadDLL.Destroy;
begin
if Assigned(DLLForm) then DLLForm.Free;
inherited;
end;
procedure LoadDLL(ADLLNameList: TStringList; PFormFreeCallBack: Pointer; const ADLLName: string);
var
LastError: DWord;
begin
try
with TLoadDLL(ADLLNameList.Objects[ADLLNameList.IndexOf(Trim(ADLLName))]) do
begin
if iDLL = 0 then
begin
iDLL := LoadLibrary(PChar('.\system\'+Trim(ADLLName) + '.dll'));
if iDLL = 0 then
begin
LastError := GetLastError;
raise EDLLLoadError.create(IntToStr(LastError) + ': Unable to load ' + Trim(ADLLName) + '.dll');
end;
CallDLL := GetProcAddress(iDLL, 'CallDLL');
if @CallDLL = nil then
begin
LastError := GetLastError;
raise EDLLLoadError.create(IntToStr(LastError) + ': Unable to find function CallDLL');
end;
SetDLL := GetProcAddress(iDLL, 'SetDLL');
if @SetDLL = nil then
begin
LastError := GetLastError;
raise EDLLLoadError.create(IntToStr(LastError) + ': Unable to find function SetDLL');
end;
end;
if not Assigned(DLLForm) then
begin
objGlobal.PFormFreeCallBack := PFormFreeCallBack;
objGlobal.gCallType := 1;
DLLForm := CallDLL(objGlobal);
end;
DLLForm.Show;
DLLForm.WindowState := wsNormal;
end;
except
if Assigned(TLoadDLL(ADLLNameList.Objects[ADLLNameList.IndexOf(Trim(ADLLName))])) then
TLoadDLL(ADLLNameList.Objects[ADLLNameList.IndexOf(Trim(ADLLName))]).Free;
ADLLNameList.Delete(ADLLNameList.IndexOf(Trim(ADLLName)));
ADLLNameList.Add(Trim(ADLLName));
raise;
end;
end;
end.
|
unit Main;
interface
uses
System.SysUtils, System.Types, System.UITypes, System.Classes, System.Variants,
FMX.Types, FMX.Controls, FMX.Forms, FMX.Graphics, FMX.Dialogs, FMX.StdCtrls,
FMX.ScrollBox, FMX.Memo, FMX.Controls.Presentation, System.StrUtils,
{$IFDEF MSWINDOWS}
Winapi.ShellAPI, Winapi.Windows,
{$ENDIF MSWINDOWS}
{$IFDEF POSIX}
Posix.Stdlib,
{$ENDIF POSIX}
FMX.Platform, REST.Types, REST.Client, Data.Bind.Components,
Data.Bind.ObjectScope, System.JSON, System.Generics.Collections;
type
TfrmMain = class(TForm)
btnConvert: TButton;
mmoHistory: TMemo;
Label1: TLabel;
lblWebsite: TLabel;
rstclntMarket: TRESTClient;
rstrqstMarket: TRESTRequest;
rstrspnsMarekt: TRESTResponse;
grpOption: TGroupBox;
rbSpace: TRadioButton;
rbTab: TRadioButton;
rbNone: TRadioButton;
rstclntVersion: TRESTClient;
rstrqstVersion: TRESTRequest;
rstrspnsVersion: TRESTResponse;
procedure btnConvertClick(Sender: TObject);
procedure lblWebsiteClick(Sender: TObject);
procedure FormActivate(Sender: TObject);
procedure FormCreate(Sender: TObject);
private
{ Private declarations }
FCheckVersion: Boolean;
function OccurrencesOfChar(const S: string; const C: char): Integer;
procedure CheckVersion;
procedure OpenUrl(Url: string);
public
{ Public declarations }
end;
var
frmMain: TfrmMain;
const
ROW_COUNT_PER_HISTORY = 9;
API_UPBIT_MARKET = 'https://api.upbit.com/v1/market/all';
API_VERSION = 'https://com-isulnara-datastore.appspot.com/data/upbithist2tsv/convert/com.isulnara.upbithist2tsv.version';
APP_VERSION = '1.0';
APP_URL = 'https://isulnara.com/wp/archives/2290';
MY_WEBSITE = 'https://isulnara.com/';
implementation
{$R *.fmx}
procedure TfrmMain.FormCreate(Sender: TObject);
begin
FCheckVersion := False;
end;
procedure TfrmMain.FormActivate(Sender: TObject);
begin
CheckVersion;
end;
procedure TfrmMain.btnConvertClick(Sender: TObject);
var
i, j: Integer;
Row, CsvResult: string;
Clp: IFMXClipboardService;
JaRoot: TJSONArray;
JoMarket: TJSONObject;
Market, Currency: string;
Dictionary: TDictionary<string, string>;
Key: string;
function TryGetClipboardService(out _clp: IFMXClipboardService): Boolean;
begin
Result := TPlatformServices.Current.SupportsPlatformService(IFMXClipboardService);
if Result then
_clp := IFMXClipboardService(TPlatformServices.Current.GetPlatformService(IFMXClipboardService));
end;
begin
CsvResult := '';
Row := '';
for i := 0 to mmoHistory.Lines.Count - 1 do
begin
Row := Row + mmoHistory.Lines[i];
if (Row[Length(Row)] <> #9) and (OccurrencesOfChar(Row, #9) = ROW_COUNT_PER_HISTORY) then
begin
CsvResult := CsvResult + Row + #13#10;
Row := '';
end;
end;
CsvResult := CsvResult + Row;
// 코인명 앞에 공백/탭 붙이기
if not rbNone.IsChecked then
begin
rstclntMarket.BaseURL := API_UPBIT_MARKET;
rstrqstMarket.Execute;
if rstrspnsMarekt.JSONValue is TJSONArray then
begin
Dictionary := TDictionary<string, string>.Create();
try
JaRoot := rstrspnsMarekt.JSONValue as TJSONArray;
for j := 0 to JaRoot.Count - 1 do
begin
if JaRoot.Items[j] is TJSONObject then
begin
JoMarket := JaRoot.Items[j] as TJSONObject;
Market := Copy(JoMarket.GetValue('market').Value, 0, Pos('-', JoMarket.GetValue('market').Value) - 1);
Currency := JoMarket.GetValue('market').Value.Replace(Market + '-', '');
if not Dictionary.ContainsKey(Market) then
Dictionary.Add(Market, Market);
if not Dictionary.ContainsKey(Currency) then
Dictionary.Add(Currency, Currency);
end;
end;
for Key in Dictionary.Keys do
CsvResult := CsvResult.Replace(Key, IfThen(rbSpace.IsChecked, ' ', #9) + Key);
finally
Dictionary.Free;
end;
end;
end;
// 결과 클립보드에 붙여넣기
if TryGetClipboardService(Clp) then
begin
Clp.SetClipboard(CsvResult);
ShowMessage('변환된 내용이 클립보드에 복사되었습니다.');
end
else
ShowMessage('클립보드를 사용할 수 없습니다.');
end;
function TfrmMain.OccurrencesOfChar(const S: string; const C: char): Integer;
var
i: Integer;
begin
Result := 0;
for i := 1 to Length(S) do
if S[i] = C then
Inc(Result);
end;
procedure TfrmMain.OpenUrl(Url: string);
begin
{$IFDEF MSWINDOWS}
ShellExecute(0, 'OPEN', PWideChar(Url), '', '', SW_SHOWNORMAL);
{$ENDIF MSWINDOWS}
{$IFDEF POSIX}
_system(PAnsiChar('open ' + AnsiString(Url)));
{$ENDIF POSIX}
end;
procedure TfrmMain.CheckVersion;
var
JoRoot: TJSONObject;
JoData: TJSONObject;
NewVersion: string;
begin
if FCheckVersion then
Exit;
FCheckVersion := True;
rstclntVersion.BaseURL := API_VERSION;
rstrqstVersion.Execute;
if rstrspnsVersion.JSONValue is TJSONObject then
begin
JoRoot := rstrspnsVersion.JSONValue as TJSONObject;
if JoRoot.GetValue('success') is TJSONTrue then
begin
JoData := TJSONObject.ParseJSONValue(TEncoding.UTF8.GetBytes(JoRoot.GetValue('extra').Value.Replace('\', '')), 0) as TJSONObject;
NewVersion := JoData.GetValue('dataValue').Value;
if APP_VERSION <> NewVersion then
begin
ShowMessage('새 버전이 출시되었습니다. 최신 버전으로 업데이트하세요.'#13#10
+ StringOfChar('─', 27) + #13#10 + JoData.GetValue('dataDesc').Value);
OpenUrl(APP_URL);
end;
end;
end;
end;
procedure TfrmMain.lblWebsiteClick(Sender: TObject);
begin
OpenUrl(MY_WEBSITE);
end;
end.
|
unit ComPortSettings;
interface
uses
Windows,
SysUtils, Messages,
Classes, Graphics, Controls,
Forms, Dialogs, ExtCtrls, StdCtrls, AdPort, OoMisc, AdTSel, Mask,
rxPlacemnt, rxToolEdit;
type
TfrmComPortSettings = class(TForm)
GroupBox2: TGroupBox;
Label4: TLabel;
fedLogFileName: TFilenameEdit;
edLogSize: TEdit;
Label5: TLabel;
rgrLogMode: TRadioGroup;
FormStorage1: TFormStorage;
cbLoggingHEX: TCheckBox;
btnLogClear: TButton;
btnLogDump: TButton;
btnLogAppend: TButton;
btnApply: TButton;
cbLoggingAllHEX: TCheckBox;
GroupBox3: TGroupBox;
Label3: TLabel;
Label6: TLabel;
fedTraceFileName: TFilenameEdit;
edTraceSize: TEdit;
rgrTraceMode: TRadioGroup;
cbTraceHEX: TCheckBox;
btnTraceClear: TButton;
btnTraceDump: TButton;
btnTraceAppend: TButton;
cbTraceAllHEX: TCheckBox;
procedure rgrLogModeClick(Sender: TObject);
procedure rgrTraceModeClick(Sender: TObject);
procedure cbLoggingHEXClick(Sender: TObject);
procedure btnLogClearClick(Sender: TObject);
procedure btnLogDumpClick(Sender: TObject);
procedure btnLogAppendClick(Sender: TObject);
procedure cbLoggingAllHEXClick(Sender: TObject);
procedure cbTraceHEXClick(Sender: TObject);
procedure cbTraceAllHEXClick(Sender: TObject);
procedure btnTraceClearClick(Sender: TObject);
procedure btnTraceAppendClick(Sender: TObject);
procedure btnTraceDumpClick(Sender: TObject);
private
fComPort:TApdComPort;
procedure SetComPort(value :TApdComPort);
published
FlowControlBox: TGroupBox;
Label1: TLabel;
Label2: TLabel;
DTRRTS: TCheckBox;
RTSCTS: TCheckBox;
SoftwareXmit: TCheckBox;
SoftwareRcv: TCheckBox;
Edit1: TEdit;
Edit2: TEdit;
Paritys: TRadioGroup;
Databits: TRadioGroup;
Stopbits: TRadioGroup;
Comports: TGroupBox;
btnOK: TButton;
btnCancel: TButton;
PortComboBox: TComboBox;
GroupBox1: TGroupBox;
cbxBaud: TComboBox;
rgrDTR: TRadioGroup;
rgrRTS: TRadioGroup;
property APDComPort: TApdComPort read fComPort write SetComPort;
procedure btnApplyClick(Sender: TObject);
procedure CancelClick(Sender: TObject);
procedure PortComboBoxChange(Sender: TObject);
procedure StateLogging;
procedure StateTracing;
public
end;
var
frmComPortSettings: TfrmComPortSettings;
implementation
{$R *.dfm}
const
BaudValues : array[0..9] of Word =
(30, 60, 120, 240, 480, 960, 1920, 3840, 5760, 11520);
procedure TfrmComPortSettings.SetComPort(value :TApdComPort);
var
E : TDeviceSelectionForm;
Const BoolArray : array [false..true] of byte = (1, 0);
begin
fComPort:=value;
{Gather all tapi devices and ports}
E := TDeviceSelectionForm.Create(Self);
try
E.EnumComPorts;
PortComboBox.Items := E.PortItemList;
finally;
E.Free;
end;
{ Highlite the active device in the list }
with PortComboBox do
if (fComPort.TapiMode = tmOff) or (fComPort.TapiMode = tmAuto) then begin
ItemIndex := Items.IndexOf(DirectTo+IntToStr(fComPort.ComNumber));
end;
rgrDTR.ItemIndex:=BoolArray[fComPort.DTR];
rgrRTS.ItemIndex:=BoolArray[fComPort.RTS];
cbxBaud.Text:=IntToStr(fComPort.Baud);
Paritys.ItemIndex := Ord(fComPort.Parity);
Databits.ItemIndex := 8-fComPort.Databits;
Stopbits.ItemIndex := Pred(fComPort.Stopbits);
{Hardware flow}
DTRRTS.Checked := hwfUseDTR in fComPort.HWFlowOptions;
RTSCTS.Checked := hwfUseRTS in fComPort.HWFlowOptions;
{Software flow}
SoftwareXmit.Checked := (fComPort.SWFlowOptions = swfBoth) or
(fComPort.SWFlowOptions = swfTransmit);
SoftwareRcv.Checked := (fComPort.SWFlowOptions = swfBoth) or
(fComPort.SWFlowOptions = swfReceive);
Edit1.Text := IntToStr(Ord(fComPort.XOnChar));
Edit2.Text := IntToStr(Ord(fComPort.XOffChar));
StateLogging;
StateTracing;
end;
procedure TfrmComPortSettings.rgrLogModeClick(Sender: TObject);
var n:integer;
begin
try
n := StrToInt(edLogSize.text);
finally
end;
if fedLogFileName.FileName <> '' then
begin
case rgrLogMode.ItemIndex of
0: begin
fComPort.logging := tlOff;
end;
1: begin
fComPort.LogSize := n;
fComPort.LogName := fedLogFileName.FileName;
fComPort.logging := tlOn;
end;
2: begin
fComPort.logging := tlPause;
end;
end;
end;
StateLogging;
end;
procedure TfrmComPortSettings.btnLogClearClick(Sender: TObject);
begin
fComPort.LogName := fedLogFileName.FileName;
fComPort.logging := tlClear;
StateLogging;
end;
procedure TfrmComPortSettings.btnLogDumpClick(Sender: TObject);
begin
fComPort.LogName := fedLogFileName.FileName;
fComPort.logging := tlDump;
StateLogging;
end;
procedure TfrmComPortSettings.btnLogAppendClick(Sender: TObject);
begin
fComPort.LogName := fedLogFileName.FileName;
fComPort.logging := tlAppend;
StateLogging;
end;
procedure TfrmComPortSettings.cbLoggingHEXClick(Sender: TObject);
begin
fComPort.LogHex := cbLoggingHEX.Checked;
end;
procedure TfrmComPortSettings.cbLoggingAllHEXClick(Sender: TObject);
begin
fComPort.LogAllHex := cbLoggingAllHEX.Checked;
end;
procedure TfrmComPortSettings.StateLogging;
begin
case fComPort.logging of
tlOff: begin
rgrLogMode.ItemIndex := 0;
btnLogAppend.Enabled := false;
btnLogClear.Enabled := false;
btnLogDump.Enabled := false;
end;
tlOn: begin
rgrLogMode.ItemIndex := 1;
btnLogAppend.Enabled := true;
btnLogClear.Enabled := true;
btnLogDump.Enabled := true;
end;
tlPause: begin
rgrLogMode.ItemIndex := 2;
btnLogAppend.Enabled := true;
btnLogClear.Enabled := true;
btnLogDump.Enabled := true;
end;
end;
cbLoggingHEX.Checked := fComPort.LogHex;
cbLoggingAllHEX.Checked := fComPort.LogAllHex;
fedLogFileName.FileName := fComPort.LogName;
edLogSize.Text := IntToStr(fComPort.LogSize);
end;
procedure TfrmComPortSettings.StateTracing;
begin
case fComPort.Tracing of
tlOff: begin
rgrTraceMode.ItemIndex := 0;
btnTraceAppend.Enabled := false;
btnTraceClear.Enabled := false;
btnTraceDump.Enabled := false;
end;
tlOn: begin
rgrTraceMode.ItemIndex := 1;
btnTraceAppend.Enabled := true;
btnTraceClear.Enabled := true;
btnTraceDump.Enabled := true;
end;
tlPause: begin
rgrTraceMode.ItemIndex := 2;
btnTraceAppend.Enabled := true;
btnTraceClear.Enabled := true;
btnTraceDump.Enabled := true;
end;
end;
cbTraceHEX.Checked := fComPort.TraceHex;
cbTraceAllHEX.Checked := fComPort.TraceAllHex;
fedTraceFileName.FileName := fComPort.TraceName;
edTraceSize.Text := IntToStr(fComPort.TraceSize);
end;
procedure TfrmComPortSettings.rgrTraceModeClick(Sender: TObject);
var n:integer;
begin
try
n := StrToInt(edTraceSize.text);
finally
end;
if fedTraceFileName.FileName <> '' then
begin
case rgrTraceMode.ItemIndex of
0: begin
fComPort.tracing := tlOff;
end;
1: begin
fComPort.TraceSize := n;
fComPort.TraceName := fedTraceFileName.FileName;
fComPort.tracing := tlOn;
end;
2: begin
fComPort.tracing := tlPause;
end;
end;
end;
StateTracing;
end;
procedure TfrmComPortSettings.cbTraceHEXClick(Sender: TObject);
begin
fComPort.TraceHex := cbTraceHEX.Checked;
end;
procedure TfrmComPortSettings.cbTraceAllHEXClick(Sender: TObject);
begin
fComPort.TraceAllHex := cbTraceAllHEX.Checked;
end;
procedure TfrmComPortSettings.btnTraceClearClick(Sender: TObject);
begin
fComPort.TraceName := fedTraceFileName.FileName;
fComPort.tracing := tlClear;
StateTracing;
end;
procedure TfrmComPortSettings.btnTraceAppendClick(Sender: TObject);
begin
fComPort.TraceName := fedTraceFileName.FileName;
fComPort.tracing := tlAppend;
StateTracing;
end;
procedure TfrmComPortSettings.btnTraceDumpClick(Sender: TObject);
begin
fComPort.TraceName := fedTraceFileName.FileName;
fComPort.tracing := tlDump;
StateTracing;
end;
procedure TfrmComPortSettings.btnApplyClick(Sender: TObject);
var
HWOpts : THWFlowOptionSet;
SWOpts : TSWFlowOptions;
Temp : Integer;
Code : Integer;
mstr :string;
Const LogicArray : array [0..1] of boolean = (True,False);
begin
fComPort.Open := false;
{Update ComPort from dialog controls}
fComPort.Baud := StrToInt(cbxBaud.Text);
fComPort.Parity := TParity(Paritys.ItemIndex);
fComPort.Databits := 8-Databits.ItemIndex;
fComPort.Stopbits := Succ(Stopbits.ItemIndex);
fComPort.DTR:=LogicArray[rgrDTR.ItemIndex];
fComPort.RTS:=LogicArray[rgrRTS.ItemIndex];
{Update HW flow}
HWOpts := [];
if DTRRTS.Checked then
HWOpts := [hwfUseDTR, hwfRequireDSR];
if RTSCTS.Checked then begin
Include(HWOpts, hwfUseRTS);
Include(HWOpts, hwfRequireCTS);
end;
fComPort.HWFlowOptions := HWOpts;
{Update SW flow}
if SoftwareXmit.Checked then
if SoftwareRcv.Checked then
SWOpts := swfBoth
else
SWOpts := swfTransmit
else if SoftwareRcv.Checked then
SWOpts := swfReceive
else
SWOpts := swfNone;
fComPort.SWFlowOptions := SWOpts;
Val(Edit1.Text, Temp, Code);
if Code = 0 then
fComPort.XOnChar := AnsiChar(Temp);
Val(Edit2.Text, Temp, Code);
if Code = 0 then
fComPort.XOffChar := AnsiChar(Temp);
fComPort.TraceName := fedTraceFileName.FileName;
fComPort.LogName := fedLogFileName.FileName;
StateLogging;
StateTracing;
try
fComPort.Open:=true;
except
mstr := 'Порт Com'+IntToStr(fComPort.ComNumber) + ' открыть не удалось! Изменить установки?' ;
MessageDlg(mstr, mtError , [mbOk], 0);
end;
end;
procedure TfrmComPortSettings.CancelClick(Sender: TObject);
begin
ModalResult := mrCancel;
end;
procedure TfrmComPortSettings.PortComboBoxChange(Sender: TObject);
var
DeviceName : string;
begin
DeviceName := PortComboBox.Items[PortComboBox.ItemIndex];
if Pos(DirectTo, DeviceName) > 0 then begin
fComPort.TapiMode := tmOff;
fComPort.ComNumber := StrToInt(Copy(DeviceName, Length(DirectTo)+1, Length(DeviceName)));
end else begin
fComPort.TapiMode := tmAuto;
fComPort.ComNumber := 0;
end;
end;
end.
|
unit rhlFNV64;
interface
uses
rhlCore;
type
{ TrhlFNV64 }
TrhlFNV64 = class(TrhlHash)
private
m_hash: QWord;
protected
procedure UpdateBytes(const ABuffer; ASize: LongWord); override;
public
constructor Create; override;
procedure Init; override;
procedure Final(var ADigest); override;
end;
implementation
{ TrhlFNV64 }
procedure TrhlFNV64.UpdateBytes(const ABuffer; ASize: LongWord);
var
b: PByte;
begin
b := @ABuffer;
while ASize > 0 do
begin
m_hash := (m_hash * 1099511628211) xor b^;
Inc(b);
Dec(ASize);
end;
end;
constructor TrhlFNV64.Create;
begin
HashSize := 8;
BlockSize := 1;
end;
procedure TrhlFNV64.Init;
begin
inherited Init;
m_hash := 14695981039346656037;
end;
procedure TrhlFNV64.Final(var ADigest);
begin
Move(m_hash, ADigest, SizeOf(m_hash));
end;
end.
|
unit uI010;
interface
// O Modelo não precisa conhecer ninguem
// Ai esta o interessante do MVC.
// Desta forma o modelo fica desacoplado e podendo ser utilizado por vários controles
uses
Contnrs, // <-- Nesta Unit está implementado TObjectList
MVCInterfaces,uRegistroEmpresaContabil,uIndicadorOperacoes;
type
TI010 = class(TRegistroEmpresaContabil)
private
fID : Integer; // Toda chave primaria nossa no banco dentro do objeto vai chamar ID
FOnModeloMudou: TModeloMudou;
fIndicadorOperacoes: TIndicadorOperacoes;
fI100: TObjectList;
fSped: integer;
procedure SetOnModeloMudou(const Value: TModeloMudou);
procedure SetI100(const Value: TObjectList);
procedure SetID(const Value: Integer);
procedure SetIndicadorOperacoes(const Value: TIndicadorOperacoes);
public
property ID : Integer read fID write SetID;
property IndicadorOperacoes : TIndicadorOperacoes read fIndicadorOperacoes write SetIndicadorOperacoes;
property I100 : TObjectList read fI100 write SetI100;
property Sped : integer read fSped write fSped;
//property OnModeloMudou: TModeloMudou read GetOnModeloMudou write SetOnModeloMudou; // Precisa ver se assim funciona em versões mais novas de Delphi
property OnModeloMudou: TModeloMudou read FOnModeloMudou write SetOnModeloMudou; // Assim funcionou em Delphi 7
function getTodosDoSped : TObjectList;
function inserir () : Boolean;
constructor create();
end;
implementation
uses uI010BD, UEmpresa;
{ TI010 }
constructor TI010.create;
begin
Empresa := TEmpresa.create;
IndicadorOperacoes := TIndicadorOperacoes.create;
end;
function TI010.getTodosDoSped: TObjectList;
var
lI010BD : TI010BD;
begin
lI010BD := TI010BD.Create;
result := lI010BD.getTodosDoSped(self);
// lI010BD.Free;
// lI010BD := nil;
end;
function TI010.inserir: Boolean;
var
lI010BD : TI010BD;
begin
lI010BD := TI010BD.Create;
result := lI010BD.Inserir(self);
lI010BD.Free;
lI010BD := nil;
end;
procedure TI010.SetI100(const Value: TObjectList);
begin
fI100 := Value;
end;
procedure TI010.SetID(const Value: Integer);
begin
fID := Value;
end;
procedure TI010.SetIndicadorOperacoes(const Value: TIndicadorOperacoes);
begin
fIndicadorOperacoes := Value ;
fIndicadorOperacoes.Procurar ;
end;
procedure TI010.SetOnModeloMudou(const Value: TModeloMudou);
begin
end;
end.
|
unit YuanWeiCeShi;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, StdCtrls, Mask, ToolEdit, CurrEdit, Buttons, Grids, ExtCtrls, DB;
type
TYuanWeiCeShiForm = class(TForm)
Panel1: TPanel;
Panel2: TPanel;
sgDrills: TStringGrid;
Panel3: TPanel;
Panel4: TPanel;
btn_cancel: TBitBtn;
btn_delete: TBitBtn;
btn_add: TBitBtn;
btn_ok: TBitBtn;
btn_edit: TBitBtn;
edtBegin_depth: TCurrencyEdit;
edtPole_len: TCurrencyEdit;
edtReal_num1: TCurrencyEdit;
edtAmend_num: TCurrencyEdit;
lblBegin_depth: TLabel;
lblPole_len: TLabel;
lblReal_num1: TLabel;
lblAmend_num: TLabel;
Panel5: TPanel;
rgExaminationType: TRadioGroup;
lblPt_type: TLabel;
cboPt_type: TComboBox;
Panel6: TPanel;
sgDPT: TStringGrid;
sgSPT: TStringGrid;
edtEnd_depth: TCurrencyEdit;
Label2: TLabel;
lblReal_num2: TLabel;
lblReal_num3: TLabel;
edtReal_num2: TCurrencyEdit;
edtReal_num3: TCurrencyEdit;
procedure FormCreate(Sender: TObject);
procedure btn_cancelClick(Sender: TObject);
procedure FormClose(Sender: TObject; var Action: TCloseAction);
procedure btn_editClick(Sender: TObject);
procedure btn_okClick(Sender: TObject);
procedure btn_addClick(Sender: TObject);
procedure btn_deleteClick(Sender: TObject);
procedure sgDPTSelectCell(Sender: TObject; ACol, ARow: Integer;
var CanSelect: Boolean);
procedure sgDrillsSelectCell(Sender: TObject; ACol, ARow: Integer;
var CanSelect: Boolean);
procedure edtBegin_depthKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
procedure sgSPTSelectCell(Sender: TObject; ACol, ARow: Integer;
var CanSelect: Boolean);
procedure rgExaminationTypeClick(Sender: TObject);
procedure cboPt_typeKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
procedure edtBegin_depthChange(Sender: TObject);
private
{ Private declarations }
procedure button_status(int_status:integer;bHaveRecord:boolean);
procedure Get_oneRecord(aRow:Integer;bIsDPT:boolean);
procedure Set_ComponentsStatus(bIsDPT:boolean);
procedure Update_sgDPT(aRow:Integer);
procedure Update_sgSPT(aRow:Integer);
procedure GetDPTByDrillNo(aDrillNo: string);
procedure GetSPTByDrillNo(aDrillNo: string);
function GetInsertSQL(bIsDPT:boolean):string;
function GetUpdateSQL(bIsDPT:boolean):string;
function GetDeleteSQL(bIsDPT:boolean):string;
function GetExistedSQL(aBegin_depth: string;bIsDPT:boolean):string;
function Check_Data:boolean;
public
{ Public declarations }
end;
var
YuanWeiCeShiForm: TYuanWeiCeShiForm;
m_sgDrillsSelectedRow: integer;
m_sgDPTSelectedRow: integer;
m_sgSPTSelectedRow:integer;
m_DataSetState: TDataSetState;
implementation
uses MainDM, public_unit;
{$R *.dfm}
procedure TYuanWeiCeShiForm.button_status(int_status: integer;
bHaveRecord: boolean);
begin
case int_status of
1: //浏览状态
begin
btn_edit.Enabled :=bHaveRecord;
btn_delete.Enabled :=bHaveRecord;
btn_edit.Caption :='修改';
btn_ok.Enabled :=false;
btn_add.Enabled :=true;
Enable_Components(self,false);
m_DataSetState := dsBrowse;
end;
2: //修改状态
begin
btn_edit.Enabled :=true;
btn_edit.Caption :='放弃';
btn_ok.Enabled :=true;
btn_add.Enabled :=false;
btn_delete.Enabled :=false;
Enable_Components(self,true);
m_DataSetState := dsEdit;
end;
3: //增加状态
begin
btn_edit.Enabled :=true;
btn_edit.Caption :='放弃';
btn_ok.Enabled :=true;
btn_add.Enabled :=false;
btn_delete.Enabled :=false;
Enable_Components(self,true);
m_DataSetState := dsInsert;
end;
end;
end;
procedure TYuanWeiCeShiForm.GetDPTByDrillNo(aDrillNo: string);
var
strSQL: String;
i: integer;
begin
if trim(aDrillNo)='' then exit;
sgDPT.RowCount :=2;
DeleteStringGridRow(sgDPT,1);
strSQL:='SELECT prj_no,drl_no,pt_type,begin_depth,end_depth,'
+'pole_len,real_num1+real_num2+real_num3 as real_num,amend_num,'
+'real_num1,real_num2,real_num3 '
+' FROM DPT '
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+aDrillNo+'''';
with MainDataModule.qryDPT do
begin
close;
sql.Clear;
sql.Add(strSQL);
open;
i:=0;
while not Eof do
begin
i:=i+1;
sgDPT.RowCount := i +1;
sgDPT.Cells[1,i] := FieldByName('begin_depth').AsString;
sgDPT.Cells[2,i] := FieldByName('end_depth').AsString;
sgDPT.Cells[3,i] := FieldByName('pole_len').AsString;
sgDPT.Cells[4,i] := FieldByName('real_num').AsString;
sgDPT.Cells[5,i] := FieldByName('amend_num').AsString;
sgDPT.Cells[6,i] := FieldByName('pt_type').AsString;
sgDPT.Cells[7,i] := FieldByName('real_num1').AsString;
sgDPT.Cells[8,i] := FieldByName('real_num2').AsString;
sgDPT.Cells[9,i] := FieldByName('real_num3').AsString;
Next ;
end;
close;
end;
if i>0 then
begin
sgDPT.Row :=1;
m_sgDPTSelectedRow :=1;
Get_oneRecord(1,true);
button_status(1,true);
end
else
begin
button_status(1,false);
clear_data(self);
end;
end;
function TYuanWeiCeShiForm.Check_Data: boolean;
begin
result := true;
end;
procedure TYuanWeiCeShiForm.FormCreate(Sender: TObject);
var
i: integer;
begin
Height := 428;
Width := 708;
Top := 0;
Left := 0;
sgDrills.RowCount :=2;
sgDrills.ColCount := 4;
sgDrills.RowHeights[0] := 16;
sgDrills.Cells[1,0] := '孔号';
sgDrills.Cells[2,0] := '孔口标高(m)';
sgDrills.Cells[3,0] := '孔深(m)';
sgDrills.ColWidths[0]:=10;
sgDrills.ColWidths[1]:=100;
sgDrills.ColWidths[2]:=100;
sgDrills.ColWidths[2]:=100;
sgDPT.RowCount :=2;
sgDPT.ColCount := 6;
sgDPT.RowHeights[0] := 16;
sgDPT.Cells[1,0] := '深度起(m)';
sgDPT.Cells[2,0] := '深度止(m)';
sgDPT.Cells[3,0] := '探杆长(m)';
sgDPT.Cells[4,0] := '实测击数';
sgDPT.Cells[5,0] := '修正击数';
sgDPT.ColWidths[0]:=10;
sgDPT.ColWidths[1]:=70;
sgDPT.ColWidths[2]:=70;
sgDPT.ColWidths[3]:=70;
sgDPT.ColWidths[4]:=70;
sgDPT.ColWidths[5]:=70;
sgSPT.RowCount :=2;
sgSPT.ColCount := 6;
sgSPT.RowHeights[0] := 16;
sgSPT.Cells[1,0] := '深度起(m)';
sgSPT.Cells[2,0] := '深度止(m)';
sgSPT.Cells[3,0] := '探杆长(m)';
sgSPT.Cells[4,0] := '实测击数';
sgSPT.Cells[5,0] := '修正击数';
sgSPT.ColWidths[0]:=10;
sgSPT.ColWidths[1]:=70;
sgSPT.ColWidths[2]:=70;
sgSPT.ColWidths[3]:=70;
sgSPT.ColWidths[4]:=70;
sgSPT.ColWidths[5]:=70;
m_sgSPTSelectedRow:= -1;
m_sgDrillsSelectedRow := -1;
m_sgDPTSelectedRow:= -1;
Clear_Data(self);
with MainDataModule.qryDrills do
begin
close;
sql.Clear;
sql.Add('SELECT prj_no,drl_no,drl_elev,comp_depth,Drl_x,Drl_y');
sql.Add(' FROM drills ');
sql.Add(' WHERE prj_no='+''''+g_ProjectInfo.prj_no+'''');
open;
i:=0;
sgDrills.Tag := 1;
while not Eof do
begin
i:=i+1;
sgDrills.RowCount := i +1;
sgDrills.Cells[1,i] := FieldByName('drl_no').AsString;
sgDrills.Cells[2,i] := FieldByName('drl_elev').AsString;
sgDrills.Cells[3,i] := FieldByName('comp_depth').AsString;
sgDrills.Cells[4,i] := FieldByName('Drl_x').AsString;
sgDrills.Cells[5,i] := FieldByName('Drl_y').AsString;
Next ;
end;
close;
sgDrills.Tag := 0;
end;
if i>0 then
begin
sgDrills.Row :=1;
m_sgDrillsSelectedRow :=1;
end ;
rgExaminationType.ItemIndex:=0;
case rgExaminationType.ItemIndex of
0:
begin
Set_ComponentsStatus(false);
GetSPTByDrillNo(sgDrills.Cells[1,sgDrills.Row]);
end;
1:
begin
Set_ComponentsStatus(true);
GetDPTByDrillNo(sgDrills.Cells[1,sgDrills.Row]);
end;
end;
end;
procedure TYuanWeiCeShiForm.Get_oneRecord(aRow: Integer;bIsDPT:boolean);
begin
if bIsDPT then
begin
edtBegin_depth.Text := sgDPT.Cells[1,aRow];
edtend_depth.Text := sgDPT.Cells[2,aRow];
edtPole_len.Text := sgDPT.Cells[3,aRow];
edtAmend_num.Text:= sgDPT.Cells[5,aRow];
try
cboPt_type.ItemIndex := StrToInt(sgDPT.Cells[6,aRow]);
except
cboPt_type.ItemIndex := -1;
end;
edtReal_num1.Text:= sgDPT.Cells[7,aRow];
edtReal_num2.Text:= sgDPT.Cells[8,aRow];
edtReal_num3.Text:= sgDPT.Cells[9,aRow];
end
else
begin
edtBegin_depth.Text := sgSPT.Cells[1,aRow];
edtend_depth.Text := sgSPT.Cells[2,aRow];
edtPole_len.Text := sgSPT.Cells[3,aRow];
edtAmend_num.Text:= sgSPT.Cells[5,aRow];
edtReal_num1.Text:= sgSPT.Cells[7,aRow];
edtReal_num2.Text:= sgSPT.Cells[8,aRow];
edtReal_num3.Text:= sgSPT.Cells[9,aRow];
end;
end;
function TYuanWeiCeShiForm.GetDeleteSQL(bIsDPT:boolean): string;
begin
if bIsDPT then
result :='DELETE FROM DPT '
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+sgDPT.Cells[1,sgDPT.row]+''''
else
result :='DELETE FROM SPT '
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+sgSPT.Cells[1,sgSPT.row]+'''';
end;
function TYuanWeiCeShiForm.GetExistedSQL(aBegin_depth: string;bIsDPT:boolean): string;
begin
if bIsDPT then
result:='SELECT prj_no,drl_no,begin_depth FROM DPT'
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+aBegin_depth+''''
else
result:='SELECT prj_no,drl_no,begin_depth FROM SPT'
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+aBegin_depth+'''';
end;
function TYuanWeiCeShiForm.GetInsertSQL(bIsDPT:boolean): string;
begin
if bIsDPT then
result := 'INSERT INTO DPT (prj_no,drl_no,begin_depth,end_depth,'
+'pole_len,real_num1,real_num2,real_num3,amend_num,pt_type) VALUES('
+''''+g_ProjectInfo.prj_no +''''+','
+''''+trim(sgDrills.Cells[1,sgDrills.row])+''''+','
+''''+trim(edtbegin_depth.Text)+''''+','
+''''+trim(edtEnd_depth.Text)+''''+','
+''''+trim(edtPole_len.Text)+''''+','
+''''+trim(edtReal_num1.Text)+''''+','
+''''+trim(edtReal_num2.Text)+''''+','
+''''+trim(edtReal_num3.Text)+''''+','
+''''+trim(edtAmend_num.Text)+''''+','
+''''+IntToStr(cboPt_type.ItemIndex)+''''+')'
else
result := 'INSERT INTO SPT (prj_no,drl_no,begin_depth,end_depth,'
+'pole_len,real_num1,real_num2,real_num3,amend_num) VALUES('
+''''+g_ProjectInfo.prj_no +''''+','
+''''+trim(sgDrills.Cells[1,sgDrills.row])+''''+','
+''''+trim(edtbegin_depth.Text)+''''+','
+''''+trim(edtEnd_depth.Text)+''''+','
+''''+trim(edtPole_len.Text)+''''+','
+''''+trim(edtReal_num1.Text)+''''+','
+''''+trim(edtReal_num2.Text)+''''+','
+''''+trim(edtReal_num3.Text)+''''+','
+''''+trim(edtAmend_num.Text)+''''+')';
end;
function TYuanWeiCeShiForm.GetUpdateSQL(bIsDPT:boolean): string;
var
strSQLWhere,strSQLSet:string;
begin
if bIsDPT then
begin
strSQLWhere:=' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+sgDPT.Cells[1,sgDPT.row]+'''';
strSQLSet:='UPDATE DPT SET ';
strSQLSet := strSQLSet + 'begin_depth' +'='+''''+trim(edtbegin_depth.Text)+''''+',';
strSQLSet := strSQLSet + 'end_depth' +'='+''''+trim(edtEnd_depth.Text)+''''+',';
strSQLSet := strSQLSet + 'pole_len' +'='+''''+trim(edtPole_len.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num1' +'='+''''+trim(edtReal_num1.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num2' +'='+''''+trim(edtReal_num2.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num3' +'='+''''+trim(edtReal_num3.Text)+''''+',';
strSQLSet := strSQLSet + 'amend_num'+'='+''''+trim(edtAmend_num.Text)+''''+',';
strSQLSet := strSQLSet + 'pt_type'+'='+''''+IntToStr(cboPt_type.ItemIndex)+'''';
result := strSQLSet + strSQLWhere;
end
else
begin
strSQLWhere:=' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+trim(sgDrills.Cells[1,sgDrills.row])+''''
+' AND begin_depth=' +''''+sgDPT.Cells[1,sgDPT.row]+'''';
strSQLSet:='UPDATE SPT SET ';
strSQLSet := strSQLSet + 'begin_depth' +'='+''''+trim(edtbegin_depth.Text)+''''+',';
strSQLSet := strSQLSet + 'end_depth' +'='+''''+trim(edtEnd_depth.Text)+''''+',';
strSQLSet := strSQLSet + 'pole_len' +'='+''''+trim(edtPole_len.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num1' +'='+''''+trim(edtReal_num1.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num2' +'='+''''+trim(edtReal_num2.Text)+''''+',';
strSQLSet := strSQLSet + 'real_num3' +'='+''''+trim(edtReal_num3.Text)+''''+',';
strSQLSet := strSQLSet + 'amend_num'+'='+''''+trim(edtAmend_num.Text)+'''';
result := strSQLSet + strSQLWhere;
end;
end;
procedure TYuanWeiCeShiForm.btn_cancelClick(Sender: TObject);
begin
self.Close;
end;
procedure TYuanWeiCeShiForm.FormClose(Sender: TObject;
var Action: TCloseAction);
begin
Action := caFree;
end;
procedure TYuanWeiCeShiForm.btn_editClick(Sender: TObject);
begin
if btn_edit.Caption ='修改' then
begin
Button_status(2,true);
edtBegin_depth.SetFocus;
end
else
begin
clear_data(self);
Button_status(1,true);
case rgExaminationType.ItemIndex of
0: Get_oneRecord(sgSPT.Row,false);
1: Get_oneRecord(sgDPT.Row,true);
end;
end;
end;
procedure TYuanWeiCeShiForm.btn_okClick(Sender: TObject);
var
strSQL: string;
begin
if not Check_Data then exit;
case rgExaminationType.ItemIndex of
0://现在要保存的是标准贯入试验数据
begin
if m_DataSetState = dsInsert then
begin
strSQL := GetExistedSQL(trim(edtbegin_depth.Text),false);
if isExistedRecord(MainDataModule.qrySPT,strSQL) then
begin
messagebox(self.Handle,'此开始深度已经存在，请输入新的开始深度！','数据校对',mb_ok);
edtBegin_depth.SetFocus;
exit;
end;
strSQL := self.GetInsertSQL(false);
if Insert_oneRecord(MainDataModule.qrySPT,strSQL) then
begin
if (sgSPT.RowCount =2) and (sgSPT.Cells[1,1] ='') then
begin
m_sgSPTSelectedRow:= sgSPT.RowCount-1;
end
else
begin
m_sgSPTSelectedRow := sgSPT.RowCount;
sgSPT.RowCount := sgSPT.RowCount+1;
end;
Update_sgSPT(sgSPT.RowCount-1);
sgSPT.Row := sgSPT.RowCount-1;
Button_status(1,true);
btn_add.SetFocus;
end;
end
else if m_DataSetState = dsEdit then
begin
if sgSPT.Cells[1,sgSPT.Row]<>trim(edtbegin_depth.Text) then
begin
strSQL := GetExistedSQL(trim(edtbegin_depth.Text),false);
if isExistedRecord(MainDataModule.qrySPT,strSQL) then
begin
messagebox(self.Handle,'此开始深度已经存在，请输入新的开始深度！','数据校对',mb_ok);
edtBegin_depth.SetFocus;
exit;
end;
end;
strSQL := self.GetUpdateSQL(false);
if Update_oneRecord(MainDataModule.qrySPT,strSQL) then
begin
Update_sgSPT(sgSPT.Row);
Button_status(1,true);
btn_add.SetFocus;
end;
end;
end;
1://现在要保存的是重力触探试验数据
begin //begin case 1
if m_DataSetState = dsInsert then
begin
strSQL := GetExistedSQL(trim(edtbegin_depth.Text),true);
if isExistedRecord(MainDataModule.qryDPT,strSQL) then
begin
messagebox(self.Handle,'此开始深度已经存在，请输入新的开始深度！','数据校对',mb_ok);
edtBegin_depth.SetFocus;
exit;
end;
strSQL := self.GetInsertSQL(true);
if Insert_oneRecord(MainDataModule.qryDPT,strSQL) then
begin
if (sgDPT.RowCount =2) and (sgDPT.Cells[1,1] ='') then
begin
m_sgDPTSelectedRow:= sgDPT.RowCount-1;
end
else
begin
m_sgDPTSelectedRow := sgDPT.RowCount;
sgDPT.RowCount := sgDPT.RowCount+1;
end;
Update_sgDPT(sgDPT.RowCount-1);
sgDPT.Row := sgDPT.RowCount-1;
Button_status(1,true);
btn_add.SetFocus;
end;
end
else if m_DataSetState = dsEdit then
begin
if sgDPT.Cells[1,sgDPT.Row]<>trim(edtbegin_depth.Text) then
begin
strSQL := GetExistedSQL(trim(edtbegin_depth.Text),true);
if isExistedRecord(MainDataModule.qryDPT,strSQL) then
begin
messagebox(self.Handle,'此开始深度已经存在，请输入新的开始深度！','数据校对',mb_ok);
edtBegin_depth.SetFocus;
exit;
end;
end;
strSQL := self.GetUpdateSQL(true);
if Update_oneRecord(MainDataModule.qryDPT,strSQL) then
begin
Update_sgDPT(sgDPT.Row);
Button_status(1,true);
btn_add.SetFocus;
end;
end;
end;////end case 1
end;
end;
procedure TYuanWeiCeShiForm.btn_addClick(Sender: TObject);
begin
Clear_Data(self);
Button_status(3,true);
edtbegin_depth.SetFocus;
end;
procedure TYuanWeiCeShiForm.btn_deleteClick(Sender: TObject);
var
strSQL: string;
begin
if MessageBox(self.Handle,
'您确定要删除吗？','警告', MB_YESNO+MB_ICONQUESTION)=IDNO then exit;
if edtBegin_depth.Text <> '' then
begin
case rgExaminationType.ItemIndex of
0:
begin
strSQL := self.GetDeleteSQL(true);
if Delete_oneRecord(MainDataModule.qryDPT,strSQL) then
begin
Clear_Data(self);
DeleteStringGridRow(sgDPT,sgDPT.Row);
self.Get_oneRecord(sgDPT.Row,true);
if sgDPT.Cells[1,sgDPT.row]='' then
button_status(1,false)
else
button_status(1,true);
end;
end;
1:
begin
strSQL := self.GetDeleteSQL(false);
if Delete_oneRecord(MainDataModule.qrySPT,strSQL) then
begin
Clear_Data(self);
DeleteStringGridRow(sgSPT,sgSPT.Row);
self.Get_oneRecord(sgSPT.Row,false);
if sgSPT.Cells[1,sgSPT.row]='' then
button_status(1,false)
else
button_status(1,true);
end;
end;
end;
end;
end;
procedure TYuanWeiCeShiForm.sgDPTSelectCell(Sender: TObject; ACol,
ARow: Integer; var CanSelect: Boolean);
begin
if (ARow <>0) and (ARow<>m_sgDPTSelectedRow) then
if sgDPT.Cells[1,ARow]<>'' then
begin
Get_oneRecord(aRow,true);
if sgDPT.Cells[1,ARow]='' then
Button_status(1,false)
else
Button_status(1,true);
end
else
clear_data(self);
m_sgDPTSelectedRow:=ARow;
end;
procedure TYuanWeiCeShiForm.sgDrillsSelectCell(Sender: TObject; ACol,
ARow: Integer; var CanSelect: Boolean);
begin
if TStringGrid(Sender).Tag = 1 then exit; //设置Tag是因为每次给StringGrid赋值都会触发它的SelectCell事件，为了避免这种情况，
//在SelectCell事件中用Tag值来判断是否应该执行在SelectCell中的操作.
if (ARow <>0) and (ARow<>m_sgDrillsSelectedRow)
and (sgDrills.Cells[1,ARow]<>'') then
begin
case rgExaminationType.ItemIndex of
0:
begin
GetSPTByDrillNo(sgDrills.Cells[1,ARow]);
//Get_oneRecord(1,false);
//sgSPT.Row :=1;
if sgSPT.Cells[1,1]='' then
Button_status(1,false)
else
Button_status(1,true);
end;
1:
begin
GetDPTByDrillNo(sgDrills.Cells[1,ARow]);
//Get_oneRecord(1,true);
//sgDPT.Row :=1;
if sgDPT.Cells[1,1]='' then
Button_status(1,false)
else
Button_status(1,true);
end;
end;
m_sgDrillsSelectedRow:=ARow;
end;
end;
procedure TYuanWeiCeShiForm.edtBegin_depthKeyDown(Sender: TObject;
var Key: Word; Shift: TShiftState);
begin
change_focus(key,self);
end;
//bIsDPT 判断现在要显示的是不是重力触探。
procedure TYuanWeiCeShiForm.Set_ComponentsStatus(bIsDPT: boolean);
begin
if bIsDPT then
begin
sgSPT.SendToBack;
end
else
begin
sgSPT.BringToFront;
end;
cboPt_type.Visible := bIsDPT;
lblPt_type.Visible := bIsDPT;
end;
procedure TYuanWeiCeShiForm.GetSPTByDrillNo(aDrillNo: string);
var
strSQL: String;
i: integer;
begin
if trim(aDrillNo)='' then exit;
sgSPT.RowCount :=2;
DeleteStringGridRow(sgSPT,1);
strSQL:='SELECT prj_no,drl_no,begin_depth,end_depth,'
+'pole_len,real_num1+real_num2+real_num3 as real_num,amend_num,'
+'real_num1,real_num2,real_num3 '
+' FROM SPT '
+' WHERE prj_no=' +''''+g_ProjectInfo.prj_no +''''
+' AND drl_no=' +''''+aDrillNo+'''';
with MainDataModule.qrySPT do
begin
close;
sql.Clear;
sql.Add(strSQL);
open;
i:=0;
while not Eof do
begin
i:=i+1;
sgSPT.RowCount := i +1;
sgSPT.Cells[1,i] := FieldByName('begin_depth').AsString;
sgSPT.Cells[2,i] := FieldByName('end_depth').AsString;
sgSPT.Cells[3,i] := FieldByName('pole_len').AsString;
sgSPT.Cells[4,i] := FieldByName('real_num').AsString;
sgSPT.Cells[5,i] := FieldByName('amend_num').AsString;
sgSPT.Cells[7,i] := FieldByName('real_num1').AsString;
sgSPT.Cells[8,i] := FieldByName('real_num2').AsString;
sgSPT.Cells[9,i] := FieldByName('real_num3').AsString;
Next ;
end;
close;
end;
if i>0 then
begin
sgSPT.Row :=1;
m_sgSPTSelectedRow :=1;
Get_oneRecord(1,false);
button_status(1,true);
end
else
begin
button_status(1,false);
clear_data(self);
end;
end;
procedure TYuanWeiCeShiForm.sgSPTSelectCell(Sender: TObject; ACol,
ARow: Integer; var CanSelect: Boolean);
begin
if (ARow <>0) and (ARow<>m_sgSPTSelectedRow) then
if sgSPT.Cells[1,ARow]<>'' then
begin
Get_oneRecord(aRow,false);
if sgSPT.Cells[1,ARow]='' then
Button_status(1,false)
else
Button_status(1,true);
end
else
clear_data(self);
m_sgSPTSelectedRow:=ARow;
end;
procedure TYuanWeiCeShiForm.rgExaminationTypeClick(Sender: TObject);
begin
clear_data(self);
case rgExaminationType.ItemIndex of
0:
begin
Set_ComponentsStatus(false);
GetSPTByDrillNo(sgDrills.Cells[1,sgDrills.Row]);
end;
1:
begin
Set_ComponentsStatus(true);
GetDPTByDrillNo(sgDrills.Cells[1,sgDrills.Row]);
end;
end;
end;
procedure TYuanWeiCeShiForm.Update_sgSPT(aRow: Integer);
begin
sgSPT.Cells[1,aRow] := trim(edtbegin_depth.Text);
sgSPT.Cells[2,aRow] := trim(edtEnd_depth.Text);
sgSPT.Cells[3,aRow] := trim(edtPole_len.Text);
sgSPT.Cells[4,aRow] :=
IntToStr(strtoint(trim(edtReal_num1.Text))
+strtoint(trim(edtReal_num2.Text))
+strtoint(trim(edtReal_num3.Text)));
sgSPT.Cells[5,aRow] := trim(edtAmend_num.Text);
sgSPT.Cells[7,aRow] := trim(edtreal_num1.Text);
sgSPT.Cells[8,aRow] := trim(edtreal_num2.Text);
sgSPT.Cells[9,aRow] := trim(edtreal_num3.Text);
end;
procedure TYuanWeiCeShiForm.Update_sgDPT(aRow: Integer);
begin
sgDPT.Cells[1,aRow] := trim(edtbegin_depth.Text);
sgDPT.Cells[2,aRow] := trim(edtEnd_depth.Text);
sgDPT.Cells[3,aRow] := trim(edtPole_len.Text);
sgDPT.Cells[4,aRow] :=
IntToStr(strtoint(trim(edtReal_num1.Text))
+strtoint(trim(edtReal_num2.Text))
+strtoint(trim(edtReal_num3.Text)));
sgDPT.Cells[5,aRow] := trim(edtAmend_num.Text);
sgDPT.Cells[6,aRow] := IntToStr(cboPt_type.ItemIndex);
sgDPT.Cells[7,aRow] := trim(edtreal_num1.Text);
sgDPT.Cells[8,aRow] := trim(edtreal_num2.Text);
sgDPT.Cells[9,aRow] := trim(edtreal_num3.Text);
end;
procedure TYuanWeiCeShiForm.cboPt_typeKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
begin
if key=VK_RETURN then
postMessage(self.Handle, wm_NextDlgCtl,0,0);
end;
procedure TYuanWeiCeShiForm.edtBegin_depthChange(Sender: TObject);
begin
edtPole_len.Text := edtBegin_depth.Text;
end;
end.
|
unit DelphiUtils.AutoObject;
interface
type
{ Interfaces}
IAutoReleasable = interface
procedure SetAutoRelease(Value: Boolean);
property AutoRelease: Boolean write SetAutoRelease;
end;
IHandle = interface(IAutoReleasable)
function Handle: THandle;
end;
IMemory = interface(IAutoReleasable)
function Address: Pointer;
function Size: NativeUInt;
end;
{ Structures }
TMemory = record
Address: Pointer;
Size: NativeUInt;
end;
{ Base classes }
TCustomAutoReleasable = class(TInterfacedObject)
protected
FAutoRelease: Boolean;
public
constructor Create;
procedure SetAutoRelease(Value: Boolean); virtual;
end;
TCustomAutoHandle = class(TCustomAutoReleasable)
protected
FHandle: THandle;
public
constructor Capture(hObject: THandle);
function Handle: THandle; virtual;
end;
TCustomAutoMemory = class(TCustomAutoReleasable)
protected
FAddress: Pointer;
FSize: NativeUInt;
public
constructor Capture(Address: Pointer; Size: NativeUInt); overload;
constructor Capture(Region: TMemory); overload;
function Address: Pointer; virtual;
function Size: NativeUInt; virtual;
end;
{ Default implementations }
// Auto-releases Delphi memory with FreeMem
TAutoMemory = class (TCustomAutoMemory, IMemory)
constructor Allocate(Size: NativeUInt);
destructor Destroy; override;
end;
implementation
{ TCustomAutoReleasable }
constructor TCustomAutoReleasable.Create;
begin
FAutoRelease := True;
end;
procedure TCustomAutoReleasable.SetAutoRelease(Value: Boolean);
begin
FAutoRelease := Value;
end;
{ TCustomAutoHandle }
constructor TCustomAutoHandle.Capture(hObject: THandle);
begin
inherited Create;
FHandle := hObject;
end;
function TCustomAutoHandle.Handle: THandle;
begin
Result := FHandle;
end;
{ TCustomAutoMemory }
function TCustomAutoMemory.Address: Pointer;
begin
Result := FAddress;
end;
constructor TCustomAutoMemory.Capture(Address: Pointer; Size: NativeUInt);
begin
inherited Create;
FAddress := Address;
FSize := Size;
end;
constructor TCustomAutoMemory.Capture(Region: TMemory);
begin
Capture(Region.Address, Region.Size);
end;
function TCustomAutoMemory.Size: NativeUInt;
begin
Result := FSize;
end;
{ TAutoMemory }
constructor TAutoMemory.Allocate(Size: NativeUInt);
begin
Capture(AllocMem(Size), Size);
end;
destructor TAutoMemory.Destroy;
begin
if FAutoRelease then
FreeMem(FAddress);
inherited;
end;
end.
|
///////////////////////////////////////////////////////////////////
// uAnggota //
///////////////////////////////////////////////////////////////////
// Unit yang menangani hal-hal yang berhubungan dengan anggota //
///////////////////////////////////////////////////////////////////
unit uAnggota;
interface
uses uFileLoader, uDate, parsertuanyon, Crt;
procedure CariAnggota(var arrUser : UArr);
{Mencari anggota dengan username tertentu dan mencetak datanya ke layar}
{I.S. : arrUser sudah berisi, username didapat dari input}
{F.S. : Data user tercetak ke layar, jika username tidak ditemukan akan
dicetak pesan kesalahan}
function leftrotate(x : Cardinal ; c : Cardinal) : Cardinal;
//Fungsi untuk menghasilkan suatu nilai dari hasil shl atau shr 2 nilai
function hashpw(password : string) : string;
//Fungsi untuk menjalankan hash pada password
{Sumber Ide : https://en.wikipedia.org/wiki/MD5#Algorithm
https://tr.opensuse.org/MD5
https://rosettacode.org/wiki/MD5/Implementation
https://stackoverflow.com/questions/27360260/md5-in-delphi-pascal-freepascal-for-short-strings}
procedure log_in(var arrUser: UArr; var UserIn : User);
//Procedure untuk melakukan login
procedure regis(var arrUser: UArr);
//procedure untuk menerima input user baru. Procedure akan meminta user untuk memasukkan nama, alamat, username, dan password.
procedure PrintUser (var arrUser : UArr);
{Menulis elemen-elemen dari arrUser ke layar dengan format sesuai data user}
{I.S. : arrUser sudah berisi data dari file user dan/atau modifikasi di main program}
{F.S. : arrUser tercetak ke layar sesuai format data user}
implementation
procedure CariAnggota(var arrUser : UArr);
{Mencari anggota dengan username tertentu dan mencetak datanya ke layar}
{I.S. : arrUser sudah berisi, username didapat dari input}
{F.S. : Data user tercetak ke layar, jika username tidak ditemukan akan
dicetak pesan kesalahan}
{KAMUS LOKAL}
var
username : string;
i : integer;
found : boolean;
{ALGORITMA}
begin
write('Masukkan username: ');
readln(username);
i := 1;
found := false;
while ((not found) and (i <= lenUser)) do
begin
if(arrUser[i].Username = username) then
begin
found := true;
end else
begin
inc(i);
end;
end;
if (found) then
begin
writeln('Nama Anggota: ', arrUser[i].Nama);
writeln('Alamat Anggota: ', arrUser[i].Alamat);
end else
begin
writeln('Anggota tidak ditemukan');
end;
writeln();
writeln('Ketik 0 untuk kembali ke menu.');
readln();
ClrScr;
end;
function leftrotate(x, c: Cardinal): Cardinal;
begin
leftrotate := (x shl c) or (x shr (32-c));
end;
function hashpw(password: string): string;
//Fungsi untuk menjalankan hash pada password
{Sumber Ide : https://en.wikipedia.org/wiki/MD5#Algorithm
https://tr.opensuse.org/MD5
https://rosettacode.org/wiki/MD5/Implementation
https://stackoverflow.com/questions/27360260/md5-in-delphi-pascal-freepascal-for-short-strings}
{KAMUS LOKAL}
const
//konstanta berikut digunakan untuk membuat peubah pada fungsi hash
s : array[0..63] of Cardinal = (
7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21 );
K : array[0..63] of Cardinal = (
$d76aa478, $e8c7b756, $242070db, $c1bdceee,
$f57c0faf, $4787c62a, $a8304613, $fd469501,
$698098d8, $8b44f7af, $ffff5bb1, $895cd7be,
$6b901122, $fd987193, $a679438e, $49b40821,
$f61e2562, $c040b340, $265e5a51, $e9b6c7aa,
$d62f105d, $02441453, $d8a1e681, $e7d3fbc8,
$21e1cde6, $c33707d6, $f4d50d87, $455a14ed,
$a9e3e905, $fcefa3f8, $676f02d9, $8d2a4c8a,
$fffa3942, $8771f681, $6d9d6122, $fde5380c,
$a4beea44, $4bdecfa9, $f6bb4b60, $bebfbc70,
$289b7ec6, $eaa127fa, $d4ef3085, $04881d05,
$d9d4d039, $e6db99e5, $1fa27cf8, $c4ac5665,
$f4292244, $432aff97, $ab9423a7, $fc93a039,
$655b59c3, $8f0ccc92, $ffeff47d, $85845dd1,
$6fa87e4f, $fe2ce6e0, $a3014314, $4e0811a1,
$f7537e82, $bd3af235, $2ad7d2bb, $eb86d391 );
var
a0, b0, c0, d0, a, b, c, d, f, g, dTemp : Cardinal;
Len : Integer;
Arrpw : array[0..63] of Char;
M : array[0..15] of Cardinal absolute Arrpw; //memecah Arrpw menjadi 16 potongan data ordinal untuk diolah
i : Integer;
{ALGORITMA}
begin
//set variable initiator
a0 := $67452301;
b0 := $efcdab89;
c0 := $98badcfe;
d0 := $10325476;
//mendapatkan panjang password
Len := Length(password);
//masukkan string password ke dalam array msg
FillChar(Arrpw, 64, 0);
for i := 1 to Len do Arrpw[i-1] := password[i];
//tambahkan 1 bit ke Arrpw
Arrpw[Len] := chr(128);
//tambahkan panjang string password ke msg
Arrpw[63-7] := chr(8*Len);
//variable initiator diset menjadi acuan awal perhitungan
A := a0;
B := b0;
C := c0;
D := d0;
//Main loop:
for i := 0 to 63 do
begin
//dalam setiap character password dibuat suatu fungsi yang mengakses array K, M, dan s
//tujuannya untuk membuat tiap character pada password akan membuat perubahan pada variable initiator
//dibuat 4 fungsi berbeda sehingga proses hashing dapat lebih rumit
if (i >= 0) and (i <= 15) then
begin
F := (B and C) or ((not B) and D);
g := i;
end else if (i >= 16) and (i <= 31) then
begin
F := (D and B) or ((not D) and C);
g := (5 * i + 1) mod 16;
end else if (i >= 32) and (i <= 47) then
begin
F := B xor C xor D;
g := (3 * i + 5) mod 16;
end else if (i >= 48) and (i <= 63) then
begin
F := C xor (B or (not D));
g := (7 * i) mod 16;
end;
//Setiap character tadi akan merubah nilai B pada fungsi berikut
//Kemudian, nilai tersebut dioper ke variable D, C, A, dan dTemp
dTemp := D;
D := C;
C := B;
B := B + leftrotate((A + F + K[i] + M[g]), s[i]);
A := dTemp;
end;
//hasil modifikasi variable
a0 := a0 + A;
b0 := b0 + B;
c0 := c0 + C;
d0 := d0 + D;
//hex password
hashpw := (IntToHex(a0,8) + IntToHex(b0,8) + IntToHex(c0,8) +IntToHex(d0,8));
end;
//======================================
procedure regis(var arrUser: UArr);
//Kamus lokal
var
nm,almt,usnm,pwd : string;
begin
//prosedur input masukan
write('masukkan nama pengunjung: ');
readln(nm);
write('masukkan alamat pengunjung: ');
readln(almt);
write('masukkan username pengunjung: ');
readln(usnm);
write('masukkan password pengunjung: ');
readln(pwd);
//Password hasil hash adalah gabungan string username dan password yang dimasukkan dalam fungsi hash
pwd := usnm + pwd;
pwd := hashpw(pwd);
//simpen ke array
arrUser[lenUser+1].nama := nm;
arrUser[lenUser+1].alamat := almt;
arrUser[lenUser+1].username := usnm;
arrUser[lenUser+1].password := pwd;
arrUser[lenUser+1].Role := 'Pengunjung';
lenUser := lenUser + 1;
//msg telah berhasil regis
writeln('Pengunjung ', nm, ' berhasil terdaftar sebagai user');
end;
//=====================================
procedure log_in(var arrUser: UArr; var UserIn : User);
//Kamus Lokal
var
i : integer;
found, login : boolean;
usnm,pwd : string;
begin
//sebelum login, dibuat suatu variable 'login' yang bernilai boolean. Selama user tidak login, boolean akan bernilai false
login := false;
//selama user belum login, procedure input akan selalu dicek
while not login do
begin
//input username and password
write('Masukkan username: ');
readln(usnm);
write('Masukkan password: ');
readln(pwd);
//Password hasil hash adalah gabungan string username dan password yang dimasukkan dalam fungsi hash
pwd := usnm + pwd;
pwd := hashpw(pwd);
//cek username ada / ga
i := 1;
found := false;
repeat
if (arrUser[i].username = usnm) then
begin
found := true;
end else
begin
i := i+1;
end;
until (found) or (i > lenUser);
if not found then
begin
writeln('Usename/Password salah! Silakan coba lagi.');
end
//kalo username ditemukan, cek password
else
//jika password cocok, data user yang aktif disimpan dalam UserIn, kemuadian kirim msg
//writeln(pwd);
//writeln(arrUser[i].password);
if (arrUser[i].password = pwd) then
begin
UserIn := arrUser[i];
writeln('Selamat datang ', arrUser[i].nama, '.');
UserIn.Status := true;
login := true;
end else
//jika password salah, kirim msg.
begin
writeln('Username/Password salah! Silakan coba lagi.');
end;
end;
end;
procedure PrintUser (var arrUser : UArr);
{Menulis elemen-elemen dari arrUser ke layar dengan format sesuai data user}
{I.S. : arrUser sudah berisi data dari file user dan/atau modifikasi di main program}
{F.S. : arrUser tercetak ke layar sesuai format data user}
{' | ' digunakan untuk pemisah antar kolom}
var
k : integer;
begin
writeln(lenUser);
for k := 1 to (lenUser) do
begin
write(k);
write(' | ');
write(arrUser[k].Nama);
write(' | ');
write(arrUser[k].Alamat);
write(' | ');
write(arrUser[k].Username);
write(' | ');
write(arrUser[k].Password);
write(' | ');
write(arrUser[k].Role);
writeln();
end;
end;
end. |
unit mSpeech;
{
Monster Speech 1.1.0
written by Chen Yu (monster)
E-Mail: mftp@21cn.com ICQ UIN: 6740755
Homepage: http://homepages.msn.com/RedmondAve/mftp/
Suggestions and bug reports are warm welcomed.
This file used a Delphi translation of Speech API from
Project JEDI, and full package of this translation can
be found on JEDI's web page: http://www.delphi-jedi.org/
}
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
ComObj, ActiveX, Speech;
{----$I mspeech.msg}
Const { resourcestring}
msgSENotFound = 'Specified Speech Engine not found';
msgSENotInited = 'Speech Engine not initialized';
msgSENotStarted = 'Speech Engine not selected';
type
TMSpeechEngineInfo = record
Name: String;
Language: String;
Manufacturer: String;
Product: String;
ModeID: String;
EngineID: String;
Speaker: String;
Style: String;
Gender: String;
Age: Integer;
Features: Integer;
Interfaces: Integer;
MaxPitch: Word;
MinPitch: Word;
MaxRealTime: LongWord;
MinRealTime: LongWord;
MaxSpeed: LongWord;
MinSpeed: LongWord;
MaxVolume: LongWord;
MinVolume: LongWord;
end;
TSpeechDialog = (sdAbout, sdGeneral, sdLexicon, sdTranslate);
TSpeechOutput = (soFile, soGeneral);
TMSVisualEvent = procedure(Sender: TObject; Hints: LongWord; Mouth: PTTSMouth) of object;
type
EMSpeechException = class(Exception);
TMSpeech = class;
TTSNotifySink = class(TInterfacedObject, ITTSNotifySink)
private
FOwner: TMSpeech;
protected
function AttribChanged(dwAttribute: DWORD): HResult; stdcall;
function AudioStart(qTimeStamp: QWORD): HResult; stdcall;
function AudioStop(qTimeStamp: QWORD): HResult; stdcall;
function Visual(qTimeStamp: QWORD;
cIPAPhoneme: Char;
cEnginePhoneme: Char;
dwHints: DWORD;
apTTSMouth: PTTSMouth): HResult; stdcall;
public
constructor Create(AOwner: TMSpeech);
end;
TTSBufNotifySink = class(TInterfacedObject, ITTSBufNotifySink)
private
FOwner: TMSpeech;
protected
function TextDataDone(qTimeStamp: QWORD; dwFlags: DWORD): HResult; stdcall;
function TextDataStarted(qTimeStamp: QWORD): HResult; stdcall;
function BookMark(qTimeStamp: QWORD; dwMarkNum: DWORD): HResult; stdcall;
function WordPosition(qTimeStamp: QWORD; dwByteOffset: DWORD): HResult; stdcall;
public
constructor Create(AOwner: TMSpeech);
end;
TMSpeech = class(TComponent)
private
FEngines: TStrings;
FEngineStarted: Boolean;
FFile: WideString;
FIAF: IAudioFile;
FIAMD: IAudioMultimediaDevice;
FInfo: TMSpeechEngineInfo;
FInit: Boolean;
FITTSAttributes: ITTSAttributes;
FITTSCentral: ITTSCentral;
FITTSDialogs: ITTSDialogs;
FITTSEnum: ITTSEnum;
FKey: LongWord;
FOutput: TSpeechOutput;
FPaused: Boolean;
FText: TStrings;
FTTSNotifySink: ITTSNotifySink;
FTTSBufNotifySink: ITTSBufNotifySink;
FVersion, DummyS: String;
PModeInfo: PTTSModeInfo;
function GetInterface(Index: Integer): IUnknown;
function GetPitch: Word;
function GetRealTime: LongWord;
function GetSpeed: LongWord;
function GetVolume: LongWord;
procedure SetText(const Value: TStrings);
procedure SetPitch(const Value: Word);
procedure SetRealTime(const Value: LongWord);
procedure SetSpeed(const Value: LongWord);
procedure SetVolume(const Value: LongWord);
procedure BeforeSelectEngine;
procedure Init;
procedure InitAudio;
procedure PostSelectEngine;
procedure PostSelectEngine2(ModeInfo: TTSModeInfo);
function GetAudioDevice: IUnknown;
protected
FOnStart, FOnStop: TNotifyEvent;
FOnVisual: TMSVisualEvent;
FPos: LongWord;
procedure FlushFile;
public
constructor Create(AOwner: TComponent); {override;}
destructor Destroy; override;
procedure Inject(Command: String);
procedure Pause;
procedure Resume;
procedure SelectEngine(EngineName: String); overload;
procedure SelectEngine(EngineMode: TTSModeInfo); overload;
procedure Show(DialogType: TSpeechDialog; ParentWnd: HWND = 0);
procedure Speak;
procedure Stop;
function GetEngineInfo(EngineName: String; var Info: TMSpeechEngineInfo): Boolean;
property Engines: TStrings read FEngines;
property Info: TMSpeechEngineInfo read FInfo;
property Interfaces[Index: Integer]: IUnknown read GetInterface;
property Paused: Boolean read FPaused;
property Pitch: Word read GetPitch write SetPitch;
property Position: LongWord read FPos;
property RealTime: LongWord read GetRealTime write SetRealTime;
property Speed: LongWord read GetSpeed write SetSpeed;
property Volume: LongWord read GetVolume write SetVolume;
published
property Filename: WideString read FFile write FFile;
property Output: TSpeechOutput read FOutput write FOutput;
property Text: TStrings read FText write SetText;
property Version: String read FVersion write DummyS;
property OnStart: TNotifyEvent read FOnStart write FOnStart;
property OnStop: TNotifyEvent read FOnStop write FOnStop;
property OnVisual: TMSVisualEvent read FOnVisual write FOnVisual;
end;
implementation
{ TMSpeech: implementation of DirectTextToSpeech}
{ construction/deconstruction }
constructor TMSpeech.Create(AOwner: TComponent);
begin
{inherited;}
FEngines := TStringList.Create;
FText := TStringList.Create;
FKey := 0;
FPos := 0;
FOutput := soGeneral;
FPaused := False;
FVersion := 'Monster Speech 1.1.0';
Init;
end;
destructor TMSpeech.Destroy;
begin
FInit := False;
FEngines.Free;
FText.Free;
if Assigned(PModeInfo) then Dispose(PModeInfo);
inherited;
end;
{ Methods }
procedure TMSpeech.Init;
var ModeInfo: TTSModeInfo;
EngineCount: Integer;
begin
FInit := True;
FEngineStarted := False;
try
{ Enumerate engines }
OleCheck(CoCreateInstance(CLSID_TTSEnumerator, Nil, CLSCTX_ALL, IID_ITTSEnum, FITTSEnum));
OleCheck(FITTSEnum.Reset);
OleCheck(FITTSEnum.Next(1, ModeInfo, @EngineCount));
while EngineCount > 0 do
begin
FEngines.Add(String(ModeInfo.szModeName));
OleCheck(FITTSEnum.Next(1, ModeInfo, @EngineCount));
end;
except
FInit := False;
end;
end;
procedure TMSpeech.InitAudio;
begin
case Output of
soFile:
OleCheck(CoCreateInstance(CLSID_AudioDestFile, nil, CLSCTX_ALL,
IID_IAudioFile, FIAF));
soGeneral:
OleCheck(CoCreateInstance(CLSID_MMAudioDest, nil, CLSCTX_ALL,
IID_IAudioMultiMediaDevice, FIAMD));
end;
end;
function TMSpeech.GetAudioDevice;
begin
case Output of
soFile:
Result := FIAF;
soGeneral:
Result := FIAMD;
end;
end;
procedure TMSpeech.FlushFile;
begin
if FOutput = soFile then FIAF.Flush; // close file
end;
procedure TMSpeech.Inject;
begin
FITTSCentral.Inject(PChar(Command));
end;
procedure TMSpeech.BeforeSelectEngine;
begin
{ Check if audio device is available }
InitAudio;
{ Unregister old notify interface }
if FKey > 0 then
begin
FITTSCentral.UnRegister(FKey);
FKey := 0;
end;
{ Create notify interfaces }
FTTSBufNotifySink := TTSBufNotifySink.Create(Self);
FTTSNotifySink := TTSNotifySink.Create(Self);
end;
procedure TMSpeech.SelectEngine(EngineName: String);
var Index, EngineCount: Integer;
ModeInfo: TTSModeInfo;
begin
if not FInit then
raise EMSpeechException.Create(msgSENotInited);
Index := Engines.IndexOf(EngineName);
if Index < 0 then
raise EMSpeechException.Create(msgSENotFound);
{ Select Engine }
FEngineStarted := True;
try
BeforeSelectEngine;
OleCheck(FITTSEnum.Reset);
OleCheck(FITTSEnum.Skip(Index));
OleCheck(FITTSEnum.Next(1, ModeInfo, @EngineCount));
if Assigned(PModeInfo) then Dispose(PModeInfo);
New(PModeInfo);
PModeInfo^ := ModeInfo;
OleCheck(FITTSEnum.Select(PModeInfo^.gModeID,
FITTSCentral, GetAudioDevice));
PostSelectEngine;
PostSelectEngine2(ModeInfo);
except
FEngineStarted := False;
end;
end;
procedure TMSpeech.SelectEngine(EngineMode: TTSModeInfo);
var FITTSFind: ITTSFind;
ModeInfo: TTSModeInfo;
begin
if not FInit then
raise EMSpeechException.Create(msgSENotInited);
{ Find and Select Engine }
FEngineStarted := True;
try
try
BeforeSelectEngine;
OleCheck(CoCreateInstance(CLSID_TTSEnumerator, nil, CLSCTX_ALL,
IID_ITTSFind, FITTSFind));
OleCheck(FITTSFind.QueryInterface(IID_ITTSEnum, FITTSEnum));
OleCheck(FITTSFind.Find(EngineMode, nil, ModeInfo));
if Assigned(PModeInfo) then Dispose(PModeInfo);
New(PModeInfo);
PModeInfo^ := ModeInfo;
OleCheck(FITTSFind.Select(PModeInfo^.gModeID,
FITTSCentral, GetAudioDevice));
PostSelectEngine;
PostSelectEngine2(ModeInfo);
except
FEngineStarted := False;
end;
finally
FITTSFind._Release;
end;
end;
procedure TMSpeech.PostSelectEngine;
begin
OleCheck(FITTSCentral.QueryInterface(IID_ITTSAttributes, FITTSAttributes));
OleCheck(FITTSCentral.QueryInterface(IID_ITTSDialogs, FITTSDialogs));
OleCheck(FITTSCentral.Register(Pointer(FTTSNotifySink),
IID_ITTSNotifySink, FKey));
end;
procedure TMSpeech.PostSelectEngine2;
var CurrentPitch: Word;
CurrentRealTime, CurrentSpeed: LongWord;
begin
{ Retrieve Engine Information }
FInfo.Language := StrPas(ModeInfo.Language.szDialect);
with FInfo, ModeInfo do
begin
Name := StrPas(szModeName);
Manufacturer := StrPas(szMfgName);
Product := StrPas(szProductName);
ModeID := GUIDToString(gModeID);
EngineID := GUIDToString(gEngineID);
Speaker := StrPas(szSpeaker);
Style := StrPas(szStyle);
case wGender of
0: Gender := 'NEUTRAL';
1: Gender := 'FEMALE';
2: Gender := 'MALE';
end;
Age := wAge;
Features := dwFeatures;
Interfaces := dwInterfaces;
with FITTSAttributes do
begin
PitchGet(CurrentPitch);
PitchSet(TTSATTR_MAXPITCH);
PitchGet(MaxPitch);
PitchSet(TTSATTR_MINPITCH);
PitchGet(MinPitch);
PitchSet(CurrentPitch);
RealTimeGet(CurrentRealTime);
RealTimeSet(TTSATTR_MAXREALTIME);
RealTimeGet(MaxRealTime);
RealTimeSet(TTSATTR_MINREALTIME);
RealTimeGet(MinRealTime);
RealTimeSet(CurrentRealTime);
SpeedGet(CurrentSpeed);
SpeedSet(TTSATTR_MAXSPEED);
SpeedGet(MaxSpeed);
SpeedSet(TTSATTR_MINSPEED);
SpeedGet(MinSpeed);
SpeedSet(CurrentSpeed);
{ According to MS's help file }
MaxVolume := 100;
MinVolume := 0;
end;
end;
end;
procedure TMSpeech.Pause;
begin
OleCheck(FITTSCentral.AudioPause);
FPaused := True;
end;
procedure TMSpeech.Resume;
begin
OleCheck(FITTSCentral.AudioResume);
FPaused := False;
end;
procedure TMSpeech.Show;
begin
case DialogType of
sdAbout: OleCheck(FITTSDialogs.AboutDlg(ParentWnd, nil));
sdGeneral: OleCheck(FITTSDialogs.GeneralDlg(ParentWnd, nil));
sdLexicon: OleCheck(FITTSDialogs.LexiconDlg(ParentWnd, nil));
sdTranslate: OleCheck(FITTSDialogs.TranslateDlg(ParentWnd, nil));
end;
end;
procedure TMSpeech.Speak;
var SData : TSData;
begin
if not FInit then
raise EMSpeechException.Create(msgSENotInited);
if not FEngineStarted then
raise EMSpeechException.Create(msgSENotStarted);
FPaused := False;
// OleCheck(FITTSCentral.AudioReset);
try
if FOutput = soFile then
if FIAF.DoSet(PWideChar(Filename), 1) < 0 then
raise EMSpeechException.Create('Cannot open file'{msgCannotOpenFile});
SData.dwSize := Length(FText.Text) + 1;
SData.pData := PChar(FText.Text);
OleCheck(FITTSCentral.TextData (CHARSET_TEXT, 0,
SData, Pointer(FTTSBufNotifySink), IID_ITTSBufNotifySink));
except
end;
end;
procedure TMSpeech.Stop;
begin
FPaused := False;
OleCheck(FITTSCentral.AudioReset);
end;
function TMSpeech.GetEngineInfo;
var Index, EngineCount: Integer;
ModeInfo: TTSModeInfo;
begin
Result := False;
if not FInit then Exit;
Index := Engines.IndexOf(EngineName);
if Index < 0 then Exit;
if FITTSEnum.Reset < 0 then Exit;
if FITTSEnum.Skip(Index) < 0 then Exit;
if FITTSEnum.Next(1, ModeInfo, @EngineCount) < 0 then Exit;
{ Retrieve Engine Information }
FillChar(Result, Sizeof(Result), 0);
Info.Language := StrPas(ModeInfo.Language.szDialect);
with Info, ModeInfo do
begin
Name := StrPas(szModeName);
Manufacturer := StrPas(szMfgName);
Product := StrPas(szProductName);
ModeID := GUIDToString(gModeID);
EngineID := GUIDToString(gEngineID);
Speaker := StrPas(szSpeaker);
Style := StrPas(szStyle);
case wGender of
0: Gender := 'NEUTRAL';
1: Gender := 'FEMALE';
2: Gender := 'MALE';
end;
Age := wAge;
Features := dwFeatures;
Interfaces := dwInterfaces;
MaxVolume := 100;
end;
Result := True;
end;
{ Setting/Getting properties }
{ Undocumented property, for advanced user only }
function TMSpeech.GetInterface;
begin
case Index of
0: Result := GetAudioDevice;
1: Result := FITTSCentral;
2: Result := FITTSAttributes;
3: Result := FITTSDialogs;
end;
end;
function TMSpeech.GetPitch;
begin
FITTSAttributes.PitchGet(Result);
end;
procedure TMSpeech.SetPitch;
begin
FITTSCentral.Inject(PChar('\Pit=' + IntToStr(Value) + '\'));
// FITTSAttributes.PitchSet(Value);
end;
function TMSpeech.GetRealTime;
begin
FITTSAttributes.RealTimeGet(Result);
end;
procedure TMSpeech.SetRealTime;
begin
FITTSAttributes.RealTimeSet(Value);
end;
function TMSpeech.GetSpeed;
begin
FITTSAttributes.SpeedGet(Result);
end;
procedure TMSpeech.SetSpeed;
begin
FITTSCentral.Inject(PChar('\Spd=' + IntToStr(Value) + '\'));
// FITTSAttributes.SpeedSet(Value);
end;
{$ifdef MANUAL_SET_AND_GET_VOLUME}
function TMSpeech.GetVolume;
begin
FITTSAttributes.VolumeGet(Result);
end;
procedure TMSpeech.SetVolume;
begin
FITTSCentral.Inject(PChar('\Vol=' + IntToStr(Volume) + '\'));
end;
{$else}
function TMSpeech.GetVolume;
var CurrentVolume: LongWord;
begin
FITTSAttributes.VolumeGet(CurrentVolume);
Result := LoWord(CurrentVolume) * 100 div 65535;
end;
procedure TMSpeech.SetVolume;
var TempVolume: LongWord;
begin
TempVolume := 65535 * Value div 100;
TempVolume := MakeWParam(TempVolume, TempVolume);
FITTSCentral.Inject(PChar('\Vol=' + IntToStr(TempVolume) + '\'));
// OleCheck(FITTSAttributes.VolumeSet(TempVolume));
end;
{$endif}
procedure TMSpeech.SetText;
begin
FText.Assign(Value);
end;
{ TTSNotifySink }
constructor TTSNotifySink.Create;
begin
FOwner := AOwner;
end;
function TTSNotifySink.AttribChanged;
begin
Result := 0;
end;
function TTSNotifySink.AudioStart;
begin
if Assigned(FOwner.FOnStart) then FOwner.FOnStart(Self);
Result := 0;
end;
function TTSNotifySink.AudioStop;
begin
FOwner.FlushFile;
if Assigned(FOwner.FOnStop) then FOwner.FOnStop(Self);
Result := 0;
end;
function TTSNotifySink.Visual;
begin
if Assigned(FOwner.FOnVisual) then FOwner.FOnVisual(Self, dwHints, apTTSMouth);
Result := 0;
end;
{ TTSBufNotifySink }
constructor TTSBufNotifySink.Create;
begin
FOwner := AOwner;
end;
function TTSBufNotifySink.BookMark;
begin
Result := 0;
end;
function TTSBufNotifySink.TextDataDone;
begin
Result := 0;
end;
function TTSBufNotifySink.TextDataStarted;
begin
Result := 0;
end;
function TTSBufNotifySink.WordPosition;
begin
FOwner.FPos := dwByteOffset;
Result := 0;
end;
end.
|
{*******************************************************}
{ }
{ Delphi DBX Framework }
{ }
{ Copyright(c) 1995-2011 Embarcadero Technologies, Inc. }
{ }
{*******************************************************}
unit Data.DBXMetaDataCommand;
interface
uses
Data.DBXCommon,
Data.DBXCommonTable,
Data.DBXMetaDataReader
;
type
TDBXMetaDataCommand = class(TDBXCommand)
public
constructor Create(DBXContext: TDBXContext; MorphicCommand: TDBXCommand; Provider: TDBXMetaDataReader);
destructor Destroy; override;
protected
procedure SetRowSetSize(const RowSetSize: Int64); override;
procedure SetMaxBlobSize(const MaxBlobSize: Int64); override;
function GetRowsAffected: Int64; override;
function DerivedGetNextReader: TDBXReader; override;
procedure DerivedOpen; override;
procedure DerivedClose; override;
procedure DerivedPrepare; override;
function DerivedExecuteQuery: TDBXReader; override;
procedure DerivedExecuteUpdate; override;
private
function CreateValueType(Name: WideString; DataType: Integer; Size: Integer): TDBXValueType;
function FetchDatabaseColumns: TDBXTable;
private
FQueryCommand: TDBXCommand;
FReader: TDBXMetaDataReader;
end;
implementation
uses
Data.DBXPlatform,
System.SysUtils
;
const
ParameterQuote = '"';
DatabaseCollectionName = 'Database';
QuoteCharOrdinal = 0;
ProcedureQuoteCharOrdinal = 1;
MaxCommandsOrdinal = 2;
SupportsTransactionsOrdinal = 3;
SupportsNestedTransactionsOrdinal = 4;
SupportsRowSetSizeOrdinal = 5;
ProductVersionOrdinal = 6;
ProductNameOrdinal = 7;
QuotePrefixOrdinal = 8;
QuoteSuffixOrdinal = 9;
SupportsLowerCaseIdentifiersOrdinal = 10;
SupportsUpperCaseIdentifiersOrdinal = 11;
SupportsSPReturnCode = 12;
SupportsParameterMetadata = 13;
SupportsCatalogFunctions = 14;
DatabaseColumnCount = 15;
type
TDBXMetaDataDbxReader = class;
TDatabaseCursor = class;
TDBXMetaDataRow = class;
TDBXMetaDataDbxReader = class(TDBXReader)
public
constructor Create(DBXContext: TDBXContext; Row: TDBXMetaDataRow; Cursor: TDBXTable);
destructor Destroy; override;
protected
function DerivedNext: Boolean; override;
procedure DerivedClose; override;
function GetByteReader: TDBXByteReader; override;
private
FByteReader: TDBXReaderByteReader;
function MapToDBXType(ColumnType: Integer): Integer;
private
FCursor: TDBXTable;
end;
TDatabaseCursor = class(TDBXCustomMetaDataTable)
private
FDatabaseRow: TDBXSingleValueRow;
public
constructor Create(Columns: TDBXValueTypeArray; Provider: TDBXMetaDataReader; TypeNames: TDBXPlatformTypeNames);
function Next: Boolean; override;
destructor Destroy; override;
protected
function GetWritableValue(const Ordinal: Integer): TDBXWritableValue; override;
private
FReader: TDBXMetaDataReader;
FRow: Integer;
end;
TDBXMetaDataRow = class(TDBXRow)
protected
constructor Create(DBXContext: TDBXContext; Row: TDBXTableRow);
protected
procedure GetWideString(DbxValue: TDBXWideStringValue; var WideStringBuilder: TDBXWideStringBuilder; var IsNull: LongBool); override;
procedure GetBoolean(DbxValue: TDBXBooleanValue; var Value: LongBool; var IsNull: LongBool); override;
procedure GetUInt8(DbxValue: TDBXUInt8Value; var Value: Byte; var IsNull: LongBool); override;
procedure GetInt8(DbxValue: TDBXInt8Value; var Value: ShortInt; var IsNull: LongBool); override;
procedure GetUInt16(DbxValue: TDBXUInt16Value; var Value: Word; var IsNull: LongBool); override;
procedure GetInt16(DbxValue: TDBXInt16Value; var Value: SmallInt; var IsNull: LongBool); override;
procedure GetInt32(DbxValue: TDBXInt32Value; var Value: TInt32; var IsNull: LongBool); override;
procedure GetInt64(DbxValue: TDBXInt64Value; var Value: Int64; var IsNull: LongBool); override;
private
FRow: TDBXTableRow;
end;
constructor TDBXMetaDataCommand.Create(DBXContext: TDBXContext; MorphicCommand: TDBXCommand; Provider: TDBXMetaDataReader);
begin
Inherited Create(DBXContext);
FReader := Provider;
end;
destructor TDBXMetaDataCommand.Destroy;
begin
FreeAndNil(FQueryCommand);
inherited Destroy;
end;
procedure TDBXMetaDataCommand.SetRowSetSize(const RowSetSize: Int64);
begin
end;
procedure TDBXMetaDataCommand.SetMaxBlobSize(const MaxBlobSize: Int64);
begin
end;
function TDBXMetaDataCommand.GetRowsAffected: Int64;
begin
Result := 0;
end;
function TDBXMetaDataCommand.DerivedGetNextReader: TDBXReader;
begin
Result := nil;
end;
procedure TDBXMetaDataCommand.DerivedOpen;
begin
end;
function TDBXMetaDataCommand.CreateValueType(Name: WideString; DataType,
Size: Integer): TDBXValueType;
begin
Result := TDBXValueType.Create;
Result.Name := Name;
Result.DataType := DataType;
Result.Size := Size;
end;
procedure TDBXMetaDataCommand.DerivedClose;
begin
end;
procedure TDBXMetaDataCommand.DerivedPrepare;
begin
end;
function TDBXMetaDataCommand.DerivedExecuteQuery: TDBXReader;
var
Table: TDBXTable;
Row: TDBXMetaDataRow;
begin
Table := FReader.FetchCollection(Text);
if Table = nil then
Table := FetchDatabaseColumns
else
FQueryCommand := TDBXCommand(Table.Command);
Row := TDBXMetaDataRow.Create(FDBXContext,Table);
Result := TDBXMetaDataDbxReader.Create(FDBXContext,Row,Table);
end;
procedure TDBXMetaDataCommand.DerivedExecuteUpdate;
begin
end;
function TDBXMetaDataCommand.FetchDatabaseColumns: TDBXTable;
var
Columns: TDBXValueTypeArray;
begin
SetLength(Columns, DatabaseColumnCount);
Columns[QuoteCharOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.QuoteChar, TDBXDataTypes.WideStringType, 2);
Columns[ProcedureQuoteCharOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.ProcedureQuoteChar, TDBXDataTypes.WideStringType, 2);
Columns[SupportsTransactionsOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsTransactions, TDBXDataTypes.BooleanType, 1);
Columns[SupportsNestedTransactionsOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsNestedTransactions, TDBXDataTypes.BooleanType, 1);
Columns[MaxCommandsOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.MaxCommands, TDBXDataTypes.Int32Type, 4);
Columns[SupportsRowSetSizeOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsRowSetSize, TDBXDataTypes.BooleanType, 1);
// Sybase ASE/ASA, and Informix return values much larger than 20.
//
Columns[ProductVersionOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.ProductVersion, TDBXDataTypes.WideStringType, 128);
Columns[ProductNameOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.ProductName, TDBXDataTypes.WideStringType, 128);
Columns[QuotePrefixOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.QuotePrefix, TDBXDataTypes.WideStringType, 2);
Columns[QuoteSuffixOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.QuoteSuffix, TDBXDataTypes.WideStringType, 2);
Columns[SupportsLowerCaseIdentifiersOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsLowerCaseIdentifiers, TDBXDataTypes.BooleanType, 1);
Columns[SupportsUpperCaseIdentifiersOrdinal] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsUpperCaseIdentifiers, TDBXDataTypes.BooleanType, 1);
Columns[SupportsSPReturnCode] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsSPReturnCode, TDBXDataTypes.BooleanType, 1);
Columns[SupportsParameterMetadata] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsParameterMetadata, TDBXDataTypes.BooleanType, 1);
Columns[SupportsCatalogFunctions] := CreateValueType(TDBXMetaDatabaseColumnNames.SupportsCatalogFunctions, TDBXDataTypes.BooleanType, 1);
Result := TDatabaseCursor.Create(Columns,FReader,FReader.Context);
end;
{ TDatabaseCursor }
constructor TDatabaseCursor.Create(Columns: TDBXValueTypeArray; Provider: TDBXMetaDataReader; TypeNames: TDBXPlatformTypeNames);
begin
inherited Create(TypeNames, DatabaseCollectionName, Columns, nil);
FReader := Provider;
FDatabaseRow := TDBXSingleValueRow.Create;
FDatabaseRow.Columns := CopyColumns();
end;
destructor TDatabaseCursor.Destroy;
begin
FreeAndNil(FDatabaseRow);
inherited;
end;
function TDatabaseCursor.GetWritableValue(const Ordinal: Integer): TDBXWritableValue;
begin
Result := FDatabaseRow.Value[Ordinal];
end;
function TDatabaseCursor.Next: Boolean;
begin
if FRow < 2 then
Inc(FRow);
Result := (FRow = 1);
FDatabaseRow.Value[QuoteCharOrdinal].SetWideString(FReader.SqlIdentifierQuoteChar);
FDatabaseRow.Value[ProcedureQuoteCharOrdinal].SetWideString(FReader.SqlProcedureQuoteChar);
FDatabaseRow.Value[ProductVersionOrdinal].SetWideString(FReader.Version);
FDatabaseRow.Value[ProductNameOrdinal].SetWideString(FReader.ProductName);
FDatabaseRow.Value[QuotePrefixOrdinal].SetWideString(FReader.SqlIdentifierQuotePrefix);
FDatabaseRow.Value[QuoteSuffixOrdinal].SetWideString(FReader.SqlIdentifierQuoteSuffix);
FDatabaseRow.Value[SupportsTransactionsOrdinal].SetBoolean(FReader.TransactionsSupported);
FDatabaseRow.Value[SupportsNestedTransactionsOrdinal].SetBoolean(FReader.NestedTransactionsSupported);
FDatabaseRow.Value[SupportsRowSetSizeOrdinal].SetBoolean(FReader.SetRowSizeSupported);
FDatabaseRow.Value[SupportsLowerCaseIdentifiersOrdinal].SetBoolean(FReader.LowerCaseIdentifiersSupported);
FDatabaseRow.Value[SupportsUpperCaseIdentifiersOrdinal].SetBoolean(FReader.UpperCaseIdentifiersSupported);
FDatabaseRow.Value[SupportsSPReturnCode].SetBoolean(FReader.SPReturnCodeSupported);
FDatabaseRow.Value[SupportsParameterMetadata].SetBoolean(FReader.ParameterMetadataSupported);
FDatabaseRow.Value[SupportsCatalogFunctions].SetBoolean(FReader.CatalogFunctionsSupported);
if FReader.MultipleCommandsSupported then
FDatabaseRow.Value[MaxCommandsOrdinal].SetInt32(0)
else
FDatabaseRow.Value[MaxCommandsOrdinal].SetInt32(1);
end;
{ TDBXMetaDataDbxReader }
constructor TDBXMetaDataDbxReader.Create(DBXContext: TDBXContext; Row: TDBXMetaDataRow; Cursor: TDBXTable);
var
Ordinal: Integer;
Column: TDBXValueType;
ValueType: TDBXValueType;
Values: TDBXValueArray;
begin
Inherited Create(DBXContext, Row, nil);
FCursor := Cursor;
SetLength(Values, Length(Cursor.Columns));
for Ordinal := Low(Values) to High(Values) do
begin
Column := Cursor.Columns[Ordinal];
ValueType := TDBXDriverHelp.CreateTDBXValueType(DBXContext,Row);
ValueType.DataType := MapToDBXType(Column.DataType);
ValueType.SubType := TDBXDataTypes.UnknownType;
ValueType.Ordinal := Ordinal;
ValueType.Scale := 0;
ValueType.Size := Column.Size;
ValueType.Name := Column.Name;
if (ValueType.DataType = TDBXDataTypes.WideStringType) then
begin
if ValueType.Size = 0 then
ValueType.Size := 256;
if ValueType.Precision = 0 then
ValueType.Precision := ValueType.Size;
ValueType.Size := ValueType.Size + 2; // Allow space for the zero terminator.
end;
ValueType.ValueTypeFlags := TDBXValueTypeFlags.Nullable or TDBXValueTypeFlags.ReadOnly;
Values[Ordinal] := TDBXValue.CreateValue(FDBXContext, ValueType, FDbxRow, true);
end;
SetValues(Values);
end;
destructor TDBXMetaDataDbxReader.Destroy;
begin
FreeAndNil(FByteReader);
FreeAndNil(FCursor);
inherited Destroy;
end;
function TDBXMetaDataDbxReader.MapToDBXType(ColumnType: Integer): Integer;
begin
Result := ColumnType;
end;
function TDBXMetaDataDbxReader.DerivedNext: Boolean;
begin
if FCursor = nil then
Result := False
else
begin
Result := FCursor.Next;
if not Result then
begin
FCursor.Close;
FreeAndNil(FCursor);
end;
end;
end;
function TDBXMetaDataDbxReader.GetByteReader: TDBXByteReader;
begin
if FByteReader = nil then
FByteReader := TDBXReaderByteReader.Create(FDbxContext, Self);
Result := FByteReader;
end;
procedure TDBXMetaDataDbxReader.DerivedClose;
begin
if FCursor <> nil then
begin
FCursor.Close;
FreeAndNil(FCursor);
end;
end;
{ TDBXMetaDataRow }
constructor TDBXMetaDataRow.Create(DBXContext: TDBXContext; Row: TDBXTableRow);
begin
Inherited Create(DBXContext);
FRow := Row;
end;
procedure TDBXMetaDataRow.GetWideString(DbxValue: TDBXWideStringValue; var WideStringBuilder: TDBXWideStringBuilder; var IsNull: LongBool);
var
Ordinal, SourceSize: Integer;
Source: String;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
begin
Source := FRow.Value[Ordinal].AsString;
SourceSize := Length(Source);
if SourceSize >= DbxValue.ValueType.Size then
TDBXPlatform.ResizeWideStringBuilder(WideStringBuilder, SourceSize + 2);
TDBXPlatform.CopyWideStringToBuilder(Source, SourceSize + 2, WideStringBuilder);
end;
end;
procedure TDBXMetaDataRow.GetBoolean(DbxValue: TDBXBooleanValue; var Value: LongBool; var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].AsBoolean
else
Value := False;
end;
procedure TDBXMetaDataRow.GetInt16(DbxValue: TDBXInt16Value; var Value: SmallInt; var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].GetInt16
else
Value := 0;
end;
procedure TDBXMetaDataRow.GetInt32(DbxValue: TDBXInt32Value; var Value: TInt32; var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].AsInt32
else
Value := 0;
end;
procedure TDBXMetaDataRow.GetInt64(DbxValue: TDBXInt64Value; var Value: Int64; var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].GetInt64
else
Value := 0;
end;
procedure TDBXMetaDataRow.GetInt8(DbxValue: TDBXInt8Value; var Value: ShortInt;
var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].GetInt8
else
Value := 0;
end;
procedure TDBXMetaDataRow.GetUInt16(DbxValue: TDBXUInt16Value; var Value: Word;
var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].GetUInt16
else
Value := 0;
end;
procedure TDBXMetaDataRow.GetUInt8(DbxValue: TDBXUInt8Value; var Value: Byte;
var IsNull: LongBool);
var
Ordinal: Integer;
begin
Ordinal := DbxValue.ValueType.Ordinal;
IsNull := FRow.Value[Ordinal].IsNull;
if not IsNull then
Value := FRow.Value[Ordinal].GetUInt8
else
Value := 0;
end;
end.
|
{ *******************************************************************************
Title: T2Ti ERP
Description: Classe de controle do Registro R.
The MIT License
Copyright: Copyright (C) 2010 T2Ti.COM
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
The author may be contacted at:
t2ti.com@gmail.com</p>
@author Albert Eije (T2Ti.COM)
@version 1.0
******************************************************************************* }
unit RegistroRController;
interface
uses
Classes, SQLExpr, SysUtils, R02VO, R03VO, R04VO, R05VO, R06VO, R07VO, Generics.Collections;
type
TRegistroRController = class
protected
public
function TabelaR02: TObjectList<TR02VO>;
function TabelaR02Id(Id: Integer): TObjectList<TR02VO>;
function TabelaR03(Id: Integer): TObjectList<TR03VO>;
function TabelaR04: TObjectList<TR04VO>;
function TabelaR05(Id: Integer): TObjectList<TR05VO>;
function TabelaR06: TObjectList<TR06VO>;
function TabelaR07(Id: Integer): TObjectList<TR07VO>;
end;
implementation
uses UDataModule;
var
ConsultaSQL: String;
Query: TSQLQuery;
function TRegistroRController.TabelaR02: TObjectList<TR02VO>;
var
ListaR02: TObjectList<TR02VO>;
R02: TR02VO;
TotalRegistros: Integer;
begin
ConsultaSQL := 'select count(*) as TOTAL from R02';
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR02 := TObjectList<TR02VO>.Create;
ConsultaSQL := 'select * from R02';
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R02 := TR02VO.Create;
R02.Id := Query.FieldByName('ID').AsInteger;
R02.IdCaixa := Query.FieldByName('ID_ECF_CAIXA').AsInteger;
R02.IdOperador := Query.FieldByName('ID_OPERADOR').AsInteger;
R02.IdImpressora := Query.FieldByName('ID_IMPRESSORA').AsInteger;
R02.CRZ := Query.FieldByName('CRZ').AsInteger;
R02.COO := Query.FieldByName('COO').AsInteger;
R02.CRO := Query.FieldByName('CRO').AsInteger;
R02.DataMovimento := Query.FieldByName('DATA_MOVIMENTO').AsString;
R02.DataEmissao := Query.FieldByName('DATA_EMISSAO').AsString;
R02.HoraEmissao := Query.FieldByName('HORA_EMISSAO').AsString;
R02.VendaBruta := Query.FieldByName('VENDA_BRUTA').AsFloat;
R02.GrandeTotal := Query.FieldByName('GRANDE_TOTAL').AsFloat;
ListaR02.Add(R02);
Query.next;
end;
result := ListaR02;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR02Id(Id: Integer): TObjectList<TR02VO>;
var
ListaR02: TObjectList<TR02VO>;
R02: TR02VO;
TotalRegistros: Integer;
begin
ConsultaSQL := 'select count(*) as TOTAL from R02 where ID_IMPRESSORA=' + IntToStr(Id);
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR02 := TObjectList<TR02VO>.Create;
ConsultaSQL := 'select * from R02 where ID_IMPRESSORA=' + IntToStr(Id);
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R02 := TR02VO.Create;
R02.Id := Query.FieldByName('ID').AsInteger;
R02.IdCaixa := Query.FieldByName('ID_ECF_CAIXA').AsInteger;
R02.IdOperador := Query.FieldByName('ID_OPERADOR').AsInteger;
R02.IdImpressora := Query.FieldByName('ID_IMPRESSORA').AsInteger;
R02.CRZ := Query.FieldByName('CRZ').AsInteger;
R02.COO := Query.FieldByName('COO').AsInteger;
R02.CRO := Query.FieldByName('CRO').AsInteger;
R02.DataMovimento := Query.FieldByName('DATA_MOVIMENTO').AsString;
R02.DataEmissao := Query.FieldByName('DATA_EMISSAO').AsString;
R02.HoraEmissao := Query.FieldByName('HORA_EMISSAO').AsString;
R02.VendaBruta := Query.FieldByName('VENDA_BRUTA').AsFloat;
R02.GrandeTotal := Query.FieldByName('GRANDE_TOTAL').AsFloat;
ListaR02.Add(R02);
Query.next;
end;
result := ListaR02;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR03(Id: Integer): TObjectList<TR03VO>;
var
ListaR03: TObjectList<TR03VO>;
R03: TR03VO;
TotalRegistros: Integer;
begin
ConsultaSQL := 'select count(*) AS TOTAL from R03 where ID_R02='+IntToStr(Id);
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR03 := TObjectList<TR03VO>.Create;
ConsultaSQL := 'select * from R03 where ID_R02='+IntToStr(Id);
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R03 := TR03VO.Create;
R03.Id := Query.FieldByName('ID').AsInteger;
R03.IdR02 := Query.FieldByName('ID_R02').AsInteger;
R03.TotalizadorParcial := Query.FieldByName('TOTALIZADOR_PARCIAL').AsString;
R03.ValorAcumulado := Query.FieldByName('VALOR_ACUMULADO').AsFloat;
ListaR03.Add(R03);
Query.next;
end;
result := ListaR03;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR04: TObjectList<TR04VO>;
var
ListaR04: TObjectList<TR04VO>;
R04: TR04VO;
TotalRegistros: Integer;
begin
ConsultaSQL :=
'select count(*) as TOTAL ' +
'from ECF_VENDA_CABECALHO VC, ECF_MOVIMENTO M '+
'where VC.ID_ECF_MOVIMENTO=M.ID';
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR04 := TObjectList<TR04VO>.Create;
ConsultaSQL :=
'select VC.ID AS VCID, VC.ID_ECF_MOVIMENTO, VC.CCF, VC.COO, VC.DATA_HORA_VENDA, VC.VALOR_VENDA, '+
'VC.DESCONTO, VC.ACRESCIMO, VC.VALOR_FINAL, VC.STATUS_VENDA, VC.NOME_CLIENTE, '+
'VC.CPF_CNPJ_CLIENTE, M.ID AS MID, M.ID_ECF_IMPRESSORA, M.ID_ECF_OPERADOR '+
'from ECF_VENDA_CABECALHO VC, ECF_MOVIMENTO M '+
'where VC.ID_ECF_MOVIMENTO=M.ID';
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R04 := TR04VO.Create;
R04.Id := Query.FieldByName('VCID').AsInteger;
R04.IdOperador := Query.FieldByName('ID_ECF_OPERADOR').AsInteger;
R04.CCF := Query.FieldByName('CCF').AsInteger;
R04.COO := Query.FieldByName('COO').AsInteger;
R04.DataEmissao := Query.FieldByName('DATA_HORA_VENDA').AsString;
R04.SubTotal := Query.FieldByName('VALOR_VENDA').AsFloat;
R04.Desconto := Query.FieldByName('DESCONTO').AsFloat;
{ TODO : Deixar sempre o indicador como V, visto que sempre gravamos o valor do desconto independente da taxa? }
R04.IndicadorDesconto := 'V';
R04.Acrescimo := Query.FieldByName('ACRESCIMO').AsFloat;
{ TODO : Deixar sempre o indicador como V, visto que sempre gravamos o valor do desconto independente da taxa? }
R04.IndicadorAcrescimo := 'V';
R04.ValorLiquido := Query.FieldByName('VALOR_FINAL').AsFloat;
if Query.FieldByName('STATUS_VENDA').AsString = 'C' then
R04.Cancelado := 'S'
else
R04.Cancelado := 'N';
{ TODO : Onde armazenar o valor do cancelamento do acrescimo? Permitir isso no sistema? Cancelar acrescimo e desconto? }
R04.CancelamentoAcrescimo := 0;
{ TODO : Permitir desconto e acrescimo no mesmo cupom? }
R04.OrdemDescontoAcrescimo := 'D';
R04.Cliente := Query.FieldByName('NOME_CLIENTE').AsString;
R04.CPFCNPJ := Query.FieldByName('CPF_CNPJ_CLIENTE').AsString;
ListaR04.Add(R04);
Query.next;
end;
result := ListaR04;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR05(Id: Integer): TObjectList<TR05VO>;
var
ListaR05: TObjectList<TR05VO>;
R05: TR05VO;
TotalRegistros : Integer;
begin
ConsultaSQL :=
'select count(*) as TOTAL '+
'from ECF_VENDA_DETALHE V, PRODUTO P, UNIDADE_PRODUTO U '+
'where V.ID_ECF_PRODUTO=P.ID and P.ID_UNIDADE_PRODUTO=U.ID '+
'and V.ID_ECF_VENDA_CABECALHO=' +IntToStr(Id);
try
try
Query := TSQLQuery.Create(nil);
Query.ParamCheck := True;
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR05 := TObjectList<TR05VO>.Create;
ConsultaSQL :=
'select V.ID AS VID, V.ITEM, P.GTIN, P.DESCRICAO_PDV, V.QUANTIDADE, '+
'U.NOME AS SIGLA_UNIDADE, V.VALOR_UNITARIO, V.DESCONTO, V.ACRESCIMO, '+
'V.TOTAL_ITEM, V.TOTALIZADOR_PARCIAL, V.CANCELADO, P.IAT, P.IPPT '+
'from ECF_VENDA_DETALHE V, PRODUTO P, UNIDADE_PRODUTO U '+
'where V.ID_ECF_PRODUTO=P.ID and P.ID_UNIDADE_PRODUTO=U.ID '+
'and V.ID_ECF_VENDA_CABECALHO=' +IntToStr(Id);
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R05 := TR05VO.Create;
R05.Id := Query.FieldByName('VID').AsInteger;
R05.Item := Query.FieldByName('ITEM').AsInteger;
R05.GTIN := Query.FieldByName('GTIN').AsString; //pegar do produto
{ TODO : Usar mesmo a descricaoPDV para esses registros R? }
R05.DescricaoPDV := Query.FieldByName('DESCRICAO_PDV').AsString; //pegar do produto
R05.Quantidade := Query.FieldByName('QUANTIDADE').AsFloat;
R05.SiglaUnidade := Query.FieldByName('SIGLA_UNIDADE').AsString; //pegar da unidade
R05.ValorUnitario := Query.FieldByName('VALOR_UNITARIO').AsFloat;
{ TODO : Desconto e acrescimo no item? Como controlar isso? }
R05.Desconto := Query.FieldByName('DESCONTO').AsFloat;
R05.Acrescimo := Query.FieldByName('ACRESCIMO').AsFloat;
R05.TotalItem := Query.FieldByName('TOTAL_ITEM').AsFloat;
R05.TotalizadorParcial := Query.FieldByName('TOTALIZADOR_PARCIAL').AsString;
R05.IndicadorCancelamento := Query.FieldByName('CANCELADO').AsString;
{ TODO :
Quantidade cancelada, no caso de cancelamento parcial de item.
Vamos implementar isso? }
if R05.IndicadorCancelamento = 'S' then
R05.QuantidadeCancelada := 1
else
R05.QuantidadeCancelada := 0;
{ TODO :
Valor cancelado, no caso de cancelamento parcial de item.
Vamos implementar isso? }
if R05.IndicadorCancelamento = 'S' then
R05.ValorCancelado := Query.FieldByName('TOTAL_ITEM').AsFloat
else
R05.ValorCancelado := 0;
{ TODO : Cancelamento do acrescimo do item? Vamos implementar isso? }
R05.CancelamentoAcrescimo := 0;
R05.IAT := Query.FieldByName('IAT').AsString; //pegar do produto
R05.IPPT := Query.FieldByName('IPPT').AsString; //pegar do produto
{ TODO : Deixar a opção de configurar essas casas decimais? }
R05.CasasDecimaisQuantidade := 3;
R05.CasasDecimaisValor := 2;
ListaR05.Add(R05);
Query.next;
end;
result := ListaR05;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR06: TObjectList<TR06VO>;
var
ListaR06: TObjectList<TR06VO>;
R06: TR06VO;
TotalRegistros: Integer;
begin
ConsultaSQL := 'select count(*) as TOTAL from R06';
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR06 := TObjectList<TR06VO>.Create;
ConsultaSQL := 'select * from R06';
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R06 := TR06VO.Create;
R06.Id := Query.FieldByName('ID').AsInteger;
R06.IdCaixa := Query.FieldByName('ID_ECF_CAIXA').AsInteger;
R06.IdOperador := Query.FieldByName('ID_OPERADOR').AsInteger;
R06.IdImpressora := Query.FieldByName('ID_IMPRESSORA').AsInteger;
R06.COO := Query.FieldByName('COO').AsInteger;
R06.GNF := Query.FieldByName('GNF').AsInteger;
R06.GRG := Query.FieldByName('GRG').AsInteger;
R06.CDC := Query.FieldByName('CDC').AsInteger;
R06.Denominacao := Query.FieldByName('DENOMINACAO').AsString;
R06.DataEmissao := Query.FieldByName('DATA_EMISSAO').AsString;
R06.HoraEmissao := Query.FieldByName('HORA_EMISSAO').AsString;
ListaR06.Add(R06);
Query.next;
end;
result := ListaR06;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
function TRegistroRController.TabelaR07(Id: Integer): TObjectList<TR07VO>;
var
ListaR07: TObjectList<TR07VO>;
R07: TR07VO;
TotalRegistros: Integer;
begin
ConsultaSQL := 'select count(*) as TOTAL from R07 where ID_R06='+IntToStr(Id);
try
try
Query := TSQLQuery.Create(nil);
Query.SQLConnection := FDataModule.Conexao;
Query.sql.Text := ConsultaSQL;
Query.Open;
TotalRegistros := Query.FieldByName('TOTAL').AsInteger;
if TotalRegistros > 0 then
begin
ListaR07 := TObjectList<TR07VO>.Create;
ConsultaSQL := 'select * from R07 where ID_R06='+IntToStr(Id);
Query.sql.Text := ConsultaSQL;
Query.Open;
Query.First;
while not Query.Eof do
begin
R07 := TR07VO.Create;
R07.CCF := Query.FieldByName('CCF').AsInteger;
R07.MeioPagamento := Query.FieldByName('MEIO_PAGAMENTO').AsString;
R07.ValorPagamento := Query.FieldByName('VALOR_PAGAMENTO').AsFloat;
R07.IndicadorEstorno := Query.FieldByName('ESTORNO').AsString;
R07.ValorEstorno := Query.FieldByName('VALOR_ESTORNO').AsFloat;
ListaR07.Add(R07);
Query.next;
end;
result := ListaR07;
end
// caso não exista a relacao, retorna um ponteiro nulo
else
result := nil;
except
result := nil;
end;
finally
Query.Free;
end;
end;
end.
|
(**********************************************************************************)
(* Code generated with NexusDB Enterprise Manager Data Dictionary Code Generator *)
(* *)
(* Version: 3,1004 *)
(* *)
(**********************************************************************************)
unit NewTableDefs;
interface
uses
nxdb,
nxsdTypes,
nxsdDataDictionary;
type
TnxcgProgressCallback =
procedure(const aTableName : String;
var aStatus : TnxTaskStatus;
var aCancel : Boolean) of object;
type
TnxcgGetPasswordCallback =
procedure(const aTableName : String;
var aPassword : string) of object;
procedure BuildAndEvolveDatabase(aDatabase : TnxDatabase;
aProgressCallback : TnxcgProgressCallback = nil;
aGetPasswordCallback : TnxcgGetPasswordCallback = nil;
const aPassword : String = '');
function TableCount: Integer;
function GetTableDictionary(aDatabase : TnxDatabase; const aTableName : String): TnxDataDictionary;
implementation
uses
{$IFDEF NXWINAPI}nxWinAPI{$ELSE}Windows{$ENDIF},
Classes,
Math,
SysUtils,
StrUtils,
Variants,
DBCommon,
nxllTypes,
nxllBde,
nxllException,
nxllWideString,
nxsdConst,
nxsdDataDictionaryStrings,
nxsdDataDictionaryRefInt,
nxsdDataDictionaryFulltext,
nxsdFilterEngineSimpleExpression,
nxsdFilterEngineSql,
nxsdServerEngine,
nxsdTableMapperDescriptor;
type
TnxcgCreateDictCallback = function(aDatabase : TnxDatabase): TnxDataDictionary;
// Aviso
function __Aviso(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Minutos', '', nxtWord16, 5, 0, False);
AddField('AvisoTexto', '', nxtNullString, 50, 0, False);
AddField('SegAvisoTexto', '', nxtByte, 3, 0, False);
AddField('Tipo', '', nxtByte, 3, 0, False);
AddField('PiscarAvisoTexto', '', nxtBoolean, 0, 0, False);
AddField('Som', '', nxtBLOB, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IMinutos', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Minutos'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Biometria
function __Biometria(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Template', '', nxtBLOB, 0, 0, False);
AddField('UAcesso', '', nxtDateTime, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('ID'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IClienteID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Cliente'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IUAcesso', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('UAcesso'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
Ascend := False;
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Caixa
function __Caixa(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('IDLivre', '', nxtNullString, 10, 0, False);
AddField('Aberto', '', nxtBoolean, 0, 0, False);
AddField('Usuario', '', nxtNullString, 20, 0, False);
AddField('Abertura', '', nxtDateTime, 0, 0, False);
AddField('Fechamento', '', nxtDateTime, 0, 0, False);
AddField('Reproc', '', nxtDateTime, 0, 0, False);
AddField('TotalFinal', '', nxtCurrency, 16, 0, False);
AddField('Descontos', '', nxtCurrency, 16, 0, False);
AddField('Cancelamentos', '', nxtCurrency, 16, 0, False);
AddField('Sangria', '', nxtCurrency, 16, 0, False);
AddField('Supr', '', nxtCurrency, 16, 0, False);
AddField('SaldoAnt', '', nxtCurrency, 16, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('EstSessoesQtd', '', nxtInt32, 10, 0, False);
AddField('EstSessoesTempo', '', nxtDouble, 0, 0, False);
AddField('EstUrls', '', nxtInt32, 10, 0, False);
AddField('EstSyncOk', '', nxtBoolean, 0, 0, False);
AddField('EstBuscasEng', '', nxtBLOBMemo, 0, 0, False);
AddField('EstRes', '', nxtBLOBMemo, 0, 0, False);
AddField('SaldoF', '', nxtCurrency, 16, 0, False);
AddField('Quebra', '', nxtCurrency, 16, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IUsuario', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
with Add(GetFieldFromName('Usuario'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
Add(GetFieldFromName('Abertura'));
end;
with AddIndex('IAbertura', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Abertura'));
with AddIndex('IAberto', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Aberto'));
Add(GetFieldFromName('Abertura'));
end;
with AddIndex('IAbertoEstSyncOk', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Aberto'));
Add(GetFieldFromName('EstSyncOk'));
end;
with AddIndex('IIDLivre', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('IDLivre'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// CategFW
function __CategFW(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 40, 0, False);
with AddField('Bloquear', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Categoria
function __Categoria(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do
AddField('Descricao', '', nxtNullString, 35, 0, False);
with EnsureIndicesDescriptor do
with AddIndex('Nome', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Descricao'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Chat
function __Chat(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('De', '', nxtInt32, 10, 0, False);
AddField('Para', '', nxtInt32, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Texto', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IDataHora', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('DataHora'));
with AddIndex('IDe', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('De'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('IPara', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Para'));
Add(GetFieldFromName('DataHora'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// CHorario
function __CHorario(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 40, 0, False);
with AddField('HP1', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP2', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP3', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP4', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP5', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP6', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP7', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Cliente
function __Cliente(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 40, 0, False);
AddField('Endereco', '', nxtNullString, 50, 0, False);
AddField('Bairro', '', nxtNullString, 20, 0, False);
AddField('Cidade', '', nxtNullString, 30, 0, False);
AddField('UF', '', nxtNullString, 2, 0, False);
AddField('CEP', '', nxtNullString, 10, 0, False);
AddField('Sexo', 'M=Masculo, F=Feminino', nxtChar, 1, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('Cpf', '', nxtNullString, 14, 0, False);
AddField('Rg', '', nxtNullString, 14, 0, False);
AddField('Telefone', '', nxtNullString, 15, 0, False);
AddField('Email', '', nxtBLOBMemo, 0, 0, False);
AddField('Minutos', '', nxtDouble, 10, 0, False);
AddField('Passaportes', '', nxtDouble, 10, 0, False);
AddField('MinutosUsados', '', nxtDouble, 10, 0, False);
AddField('MinutosIniciais', '', nxtDouble, 10, 0, False);
AddField('Isento', '', nxtBoolean, 0, 0, False);
AddField('Username', '', nxtNullString, 40, 0, False);
AddField('Pai', '', nxtNullString, 40, 0, False);
AddField('Mae', '', nxtNullString, 40, 0, False);
AddField('Senha', '', nxtNullString, 20, 0, False);
AddField('UltVisita', '', nxtDateTime, 0, 0, False);
AddField('Debito', '', nxtCurrency, 16, 0, False);
AddField('Escola', '', nxtNullString, 40, 0, False);
AddField('EscolaHI', '', nxtDateTime, 0, 0, False);
AddField('EscolaHF', '', nxtDateTime, 0, 0, False);
AddField('NickName', '', nxtNullString, 30, 0, False);
AddField('DataNasc', '', nxtDateTime, 0, 0, False);
AddField('Celular', '', nxtNullString, 15, 0, False);
AddField('TemDebito', '', nxtBoolean, 0, 0, False);
AddField('LimiteDebito', '', nxtCurrency, 16, 0, False);
AddField('Foto', '', nxtBLOBGraphic, 0, 0, False);
AddField('IncluidoEm', '', nxtDateTime, 0, 0, False);
AddField('AlteradoEm', '', nxtDateTime, 0, 0, False);
AddField('IncluidoPor', '', nxtNullString, 10, 0, False);
AddField('AlteradoPor', '', nxtNullString, 10, 0, False);
AddField('TitEleitor', '', nxtNullString, 13, 0, False);
AddField('FidPontos', '', nxtDouble, 10, 0, False);
AddField('FidTotal', '', nxtDouble, 10, 0, False);
AddField('FidResg', '', nxtDouble, 10, 0, False);
AddField('Aniversario', '', nxtNullString, 4, 0, False);
AddField('CotaImpEspecial', '', nxtBoolean, 0, 0, False);
AddField('CotaImpDia', '', nxtWord32, 10, 0, False);
AddField('CotaImpMes', '', nxtWord32, 10, 0, False);
AddField('SemFidelidade', '', nxtBoolean, 0, 0, False);
AddField('TemCredito', '', nxtBoolean, 0, 0, False);
with AddField('NaoGuardarCredito', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('PermiteLoginSemCred', '', nxtBoolean, 0, 0, False);
AddField('CHorario', '', nxtWord32, 10, 0, False);
AddField('OpCHorario', '', nxtByte, 3, 0, False);
with AddField('HP1', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP2', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP3', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP4', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP5', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP6', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP7', '', nxtWord32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('Inativo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('TipoAcessoPref', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := -1;
with AddField('Fornecedor', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('ValorCred', '', nxtCurrency, 16, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IUltVisita', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('UltVisita'));
with AddIndex('IAniversario', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Aniversario'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IFornecedorNome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Fornecedor'));
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
with AddIndex('IUsername', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Username'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IFornecedorUsername', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Fornecedor'));
with Add(GetFieldFromName('Username'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
with AddIndex('IFornecedorID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Fornecedor'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IRg', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Rg'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IDebito', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TemDebito'));
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
end;
with AddIndex('ICredito', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TemCredito'));
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
end;
with AddIndex('IFidPontos', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('FidPontos'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Config
function __Config(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('NumSeq', '', nxtAutoInc, 10, 0, False);
AddField('FecharProgramas', '', nxtBoolean, 0, 0, False);
AddField('AutoExecutar', '', nxtNullString, 200, 0, False);
AddField('LimiteTempoPadrao', '', nxtDateTime, 0, 0, False);
AddField('PacoteTempoReal', '', nxtBoolean, 0, 0, False);
AddField('PermiteLoginSemCred', '', nxtBoolean, 0, 0, False);
with AddField('AlteraLoginSemCred', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('EncerramentoPrePago', '', nxtByte, 3, 0, False);
with AddField('EncerramentoCartao', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
with AddField('TempoEPrePago', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 60;
with AddField('TempoECartao', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 60;
AddField('PermiteCapturaTela', '', nxtBoolean, 0, 0, False);
with AddField('VariosTiposAcesso', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ModoPagtoAcesso', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('MostraPrePagoDec', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('MostraNomeMaq', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
AddField('TempoMaxAlerta', '', nxtDateTime, 0, 0, False);
AddField('Abre1', '', nxtDateTime, 0, 0, False);
AddField('Abre2', '', nxtDateTime, 0, 0, False);
AddField('Abre3', '', nxtDateTime, 0, 0, False);
AddField('Abre4', '', nxtDateTime, 0, 0, False);
AddField('Abre5', '', nxtDateTime, 0, 0, False);
AddField('Abre6', '', nxtDateTime, 0, 0, False);
AddField('Abre7', '', nxtDateTime, 0, 0, False);
AddField('Fecha1', '', nxtDateTime, 0, 0, False);
AddField('Fecha2', '', nxtDateTime, 0, 0, False);
AddField('Fecha3', '', nxtDateTime, 0, 0, False);
AddField('Fecha4', '', nxtDateTime, 0, 0, False);
AddField('Fecha5', '', nxtDateTime, 0, 0, False);
AddField('Fecha6', '', nxtDateTime, 0, 0, False);
AddField('Fecha7', '', nxtDateTime, 0, 0, False);
AddField('CorLivre', '', nxtInt32, 10, 0, False);
AddField('CorFLivre', '', nxtInt32, 10, 0, False);
AddField('CorUsoPrePago', '', nxtInt32, 10, 0, False);
AddField('CorFUsoPrePago', '', nxtInt32, 10, 0, False);
AddField('CorUsoPosPago', '', nxtInt32, 10, 0, False);
AddField('CorFUsoPosPago', '', nxtInt32, 10, 0, False);
AddField('CorAguardaPagto', '', nxtInt32, 10, 0, False);
AddField('CorFAguardaPagto', '', nxtInt32, 10, 0, False);
AddField('CorManutencao', '', nxtInt32, 10, 0, False);
AddField('CorFManutencao', '', nxtInt32, 10, 0, False);
AddField('CorPausado', '', nxtInt32, 10, 0, False);
AddField('CorFPausado', '', nxtInt32, 10, 0, False);
AddField('CorDesktop', '', nxtInt32, 10, 0, False);
AddField('CorFDesktop', '', nxtInt32, 10, 0, False);
with AddField('CorMaqManut', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('CorFMaqManut', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 12632256;
with AddField('CorPrevisao', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 255;
with AddField('CorFPrevisao', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 16777215;
AddField('CampoLocalizaCli', '0=nome, 1=username, 2=código', nxtByte, 3, 0, False);
AddField('ManterSaldoCaixa', '', nxtBoolean, 0, 0, False);
AddField('NaoMostrarMsgDebito', '', nxtBoolean, 0, 0, False);
with AddField('NaoCobrarImpFunc', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('Tolerancia', '', nxtDateTime, 0, 0, False);
AddField('RegImp98', '', nxtBoolean, 0, 0, False);
AddField('LimitePadraoDebito', '', nxtCurrency, 16, 0, False);
AddField('RecPorta', '', nxtNullString, 10, 0, False);
AddField('RecSalto', '', nxtWord16, 5, 0, False);
AddField('RecLargura', '', nxtWord16, 5, 0, False);
AddField('RecRodape', '', nxtBLOBMemo, 0, 0, False);
AddField('RecImprimir', '', nxtByte, 3, 0, False);
AddField('RecMatricial', '', nxtBoolean, 0, 0, False);
AddField('RecNomeLoja', '', nxtNullString, 40, 0, False);
with AddField('MostraProgAtual', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
AddField('MostraObs', '', nxtBoolean, 0, 0, False);
AddField('EscondeTextoBotoes', '', nxtBoolean, 0, 0, False);
AddField('EscondeTipoAcesso', '', nxtBoolean, 0, 0, False);
AddField('ExigirRG', '', nxtBoolean, 0, 0, False);
AddField('TipoFDesktop', '', nxtNullString, 3, 0, False);
AddField('TipoFLogin', '', nxtNullString, 3, 0, False);
AddField('NumFDesktop', '', nxtInt32, 10, 0, False);
AddField('NumFLogin', '', nxtInt32, 10, 0, False);
AddField('FundoWeb', '', nxtBoolean, 0, 0, False);
AddField('FundoWebURL', '', nxtBLOBMemo, 0, 0, False);
AddField('MostrarApenasPIN', '', nxtBoolean, 0, 0, False);
AddField('TextoPIN', '', nxtNullString, 30, 0, False);
AddField('AlterarSenhaCli', '', nxtBoolean, 0, 0, False);
AddField('VerSenhaCli', '', nxtBoolean, 0, 0, False);
AddField('CliCadPadrao', '', nxtBoolean, 0, 0, False);
AddField('ControlaImp', '', nxtByte, 3, 0, False);
AddField('FiltrarWEB', '', nxtBoolean, 0, 0, False);
AddField('SiteRedirFiltro', '', nxtNullString, 80, 0, False);
AddField('PastaDownload', '', nxtNullString, 1024, 0, False);
with AddField('MinutosDesligaMaq', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('MinutosDesligaMon', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('BloqDownload', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqDownloadExe', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqMenuIniciar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqPainelCtrl', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqCtrlAltDel', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqExecutar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqMeusLocaisRede', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqMeuComputador', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqLixeira', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqMeusDocumentos', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ClassicStartMenu', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqTray', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqBotaoDir', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqToolbars', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloqPosPago', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FiltrarDesktop', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('FiltrarMenuIniciar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('TempoB1', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 10;
with AddField('TempoB2', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 15;
with AddField('TempoB3', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 30;
with AddField('TempoB4', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 60;
with AddField('TempoB5', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 120;
with AddField('TempoB6', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 180;
AddField('PaginaInicial', '', nxtNullString, 200, 0, False);
AddField('EsconderCronometro', '', nxtBoolean, 0, 0, False);
AddField('AposEncerrar', '', nxtByte, 3, 0, False);
AddField('AlinhaBarraGuard', '', nxtByte, 3, 0, False);
AddField('NoNet', '', nxtByte, 3, 0, False);
AddField('TempoSumirLogin', '', nxtWord16, 5, 0, False);
AddField('EsconderDrives', '', nxtNullString, 30, 0, False);
with AddField('EmailMetodo', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('EmailServ', '', nxtNullString, 50, 0, False);
AddField('EmailUsername', '', nxtNullString, 50, 0, False);
AddField('EmailSenha', '', nxtNullString, 50, 0, False);
AddField('EmailDestino', '', nxtBLOBMemo, 0, 0, False);
AddField('EmailIdent', '', nxtNullString, 20, 0, False);
with AddField('EmailEnviarCaixa', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('EmailConteudo', '', nxtNullString, 20, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := '11111111111111111111';
with AddField('AlertaAssinatura', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('CredPadraoTipo', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
with AddField('CredPadraoCod', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('PgVendas', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PgVendaAvulsa', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PgAcesso', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PgTempo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PgImp', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BloquearUsoEmHorarioNP', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('OpcaoChat', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('SalvarCodUsername', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ContinuarCredTempo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('NaoGuardarCreditoCli', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('RelCaixaAuto', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('SincronizarHorarios', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('MostrarDebitoNoGuard', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloquearLoginAlemMaxDeb', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ClienteNaoAlteraSenha', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('NaoObrigarSenhaCliente', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('NaoVenderAlemEstoque', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('CreditoComoValor', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('CliAvulsoNaoEncerra', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('AutoSortGridCaixa', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('AvisoFimTempoAdminS', '', nxtByte, 3, 0, False);
with AddField('DetectarImpServ', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('AvisoCreditos', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('ClientePodeVerCred', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('ChatAlertaSonoro', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('ChatMostraNotificacao', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('ModoCredGuard', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('MsgFimCred', '', nxtNullString, 150, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 'Você possui outros créditos que não podem ser utilizados no momento. Para maiores informações consulte o atendente.';
with AddField('SemLogin', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('AutoObsAoCancelar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FidAtivo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidSessaoValor', '', nxtCurrency, 16, 0, False);
AddField('FidSessaoPontos', '', nxtInt32, 10, 0, False);
AddField('FidVendaValor', '', nxtCurrency, 16, 0, False);
AddField('FidVendaPontos', '', nxtInt32, 10, 0, False);
AddField('FidImpValor', '', nxtCurrency, 16, 0, False);
AddField('FidImpPontos', '', nxtInt32, 10, 0, False);
with AddField('FidParcial', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('FidAutoPremiar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FidTipoPremioAuto', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('FidPremioAuto', '', nxtInt32, 10, 0, False);
with AddField('FidMostrarSaldoGuard', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('FidMostrarSaldoAdmin', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('FidMsg', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidMsgTitulo', '', nxtNullString, 50, 0, False);
AddField('FidMsgTexto', '', nxtBLOBMemo, 0, 0, False);
with AddField('CliCadNaoEncerra', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ImpedirPosPago', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('AutoLigarMaqCli', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('Biometria', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PMPausaAutomatica', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PMConfirmaImpCliente', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PMMostrarPaginasCli', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PMMostrarValorCli', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PMCalcValorCli', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('PMPromptValorCli', '', nxtNullString, 100, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 'Custo da Impressão: ';
with AddField('PMObsValorCli', '', nxtNullString, 300, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := '* O custo pode variar dependendo do tipo da impressão (preto e branco/colorida)';
AddField('PMPausarServ', '', nxtBoolean, 0, 0, False);
AddField('PMNaoPausar', '', nxtBLOBMemo, 0, 0, False);
AddField('PMCotas', '', nxtBoolean, 0, 0, False);
AddField('PMCotasMaxPagDia', '', nxtWord32, 10, 0, False);
AddField('PMCotasMaxPagMes', '', nxtWord32, 10, 0, False);
with AddField('PMCotasOpCota', '0-confirmar impressao, 1-liberar automaticamente', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('PMCotasOpExcesso', '0-atendente pode liberar, 1-cancelar imp, 2-cobrar', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('PMCotasMaxExcesso', '', nxtWord32, 10, 0, False);
AddField('PMCotasPorCli', '', nxtBoolean, 0, 0, False);
with AddField('PMPDF', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PMPDFPrintEng', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
with AddField('PMReviewCli', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PMReviewAdmin', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PubHomePage', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PubAd', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PubToolbar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('MaxTempoSessao', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('TarifaPadrao', '', nxtInt32, 10, 0, False);
with AddField('TarifaPorHorario', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('BloqueiaCliAvulso', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ExigeDadosMinimos', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('DadosMinimos', '', nxtNullString, 300, 0, False);
AddField('CidadePadrao', '', nxtNullString, 50, 0, False);
AddField('UFPadrao', '', nxtNullString, 2, 0, False);
with AddField('PedirSaldoI', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('PedirSaldoF', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('BRT', '', nxtWord16, 5, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 60;
with AddField('ExCookie', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('HPOpenBef', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('CamposCliCC', '', nxtBLOBMemo, 0, 0, False);
with AddField('CliCongelado', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('SenhaAdminOk', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('QtdMaqOk', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('PosLogin', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
end;
with EnsureIndicesDescriptor do
with AddIndex('INumSeq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('NumSeq'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Debito
function __Debito(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Data', '', nxtDateTime, 0, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
with AddField('Tipo', '0=Sessao, 1=Credito Tempo, 2=Produto', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('ID', '', nxtWord32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('ICliData', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Data'));
end;
with AddIndex('ITipoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Tipo'));
Add(GetFieldFromName('ID'));
Add(GetFieldFromName('Cliente'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// EmailCorpo
function __EmailCorpo(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Corpo', '', nxtBLOBMemo, 0, 0, False);
AddField('Destino', '', nxtBLOBMemo, 0, 0, False);
AddField('Anexos', '', nxtBLOBMemo, 0, 0, False);
AddField('Assunto', '', nxtNullString, 100, 0, False);
AddField('Inclusao', '', nxtDateTime, 0, 0, False);
AddField('Restam', '', nxtInt32, 10, 0, False);
AddField('EnviarEm', '', nxtDateTime, 0, 0, False);
AddField('Processou', '', nxtBoolean, 0, 0, False);
AddField('ApagarAnexosAposEnvio', '', nxtBoolean, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IProcessou', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Processou'));
Add(GetFieldFromName('EnviarEm'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// EmailCriar
function __EmailCriar(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Tipo', '', nxtInt32, 10, 0, False);
AddField('Parametros', '', nxtBLOBMemo, 0, 0, False);
AddField('Destino', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// EmailEnvio
function __EmailEnvio(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Corpo', '', nxtInt32, 10, 0, False);
AddField('Destino', '', nxtBLOBMemo, 0, 0, False);
AddField('Inclusao', '', nxtDateTime, 0, 0, False);
AddField('Envio', '', nxtDateTime, 0, 0, False);
AddField('Tentativas', '', nxtWord16, 5, 0, False);
AddField('Enviar', '', nxtBoolean, 0, 0, False);
AddField('MsgErro', '', nxtBLOBMemo, 0, 0, False);
AddField('OK', '', nxtBoolean, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ICorpo', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Corpo'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IEnviar', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Enviar'));
Add(GetFieldFromName('OK'));
Add(GetFieldFromName('ID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Espera
function __Espera(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Pos', '', nxtInt32, 10, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
AddField('NomeCliente', '', nxtNullString, 50, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Previsao', '', nxtDateTime, 0, 0, False);
AddField('PrevMaq', '', nxtWord16, 5, 0, False);
AddField('PrevSessao', '', nxtInt32, 10, 0, False);
AddField('Obs', '', nxtNullString, 50, 0, False);
AddField('Cartao', '', nxtNullString, 20, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IPos', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Pos'));
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IMaqSessao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('PrevMaq'));
Add(GetFieldFromName('PrevSessao'));
end;
with AddIndex('ICartao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Cartao'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
with AddIndex('ICliente', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Cliente'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// ETar
function __ETar(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('TipoAcesso', '', nxtWord16, 5, 0, False);
AddField('Cor', '', nxtInt32, 10, 0, False);
AddField('Pos', '', nxtWord16, 5, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('Tempo', '', nxtDateTime, 0, 0, False);
AddField('ValorMin', '', nxtCurrency, 16, 0, False);
AddField('Tolerancia', '', nxtDateTime, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IPrim', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoAcesso'));
Add(GetFieldFromName('Cor'));
Add(GetFieldFromName('Pos'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// FilaImp
function __FilaImp(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Info', '', nxtBLOBMemo, 0, 0, False);
AddField('IDImp', '', nxtWord32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IDImp', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('IDImp'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// FiltroWeb
function __FiltroWeb(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('URL', '', nxtNullString, 300, 0, False);
AddField('Categ', '', nxtWord32, 10, 0, False);
with AddField('Liberar', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do
with AddIndex('IURL', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('URL'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Fornecedor
function __Fornecedor(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 40, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// HCred
function __HCred(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Tipo', '0=tempo, 1=valor', nxtByte, 3, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Tran', '', nxtWord32, 10, 0, False);
AddField('SaldoAnt', '', nxtDouble, 0, 0, False);
AddField('Quant', '', nxtDouble, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ICliTipoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Tipo'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICliTipoDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Tipo'));
Add(GetFieldFromName('DataHora'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// HPass
function __HPass(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Passaporte', '', nxtWord32, 10, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
with AddField('Cancelado', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('MinutosAnt', '', nxtDouble, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('MinutosUsados', '', nxtDouble, 0, 0, False);
with AddField('Expirou', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IPassSessao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Passaporte'));
Add(GetFieldFromName('Sessao'));
end;
with AddIndex('ISessaoPass', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('Passaporte'));
end;
with AddIndex('IPassData', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Passaporte'));
Add(GetFieldFromName('DataHora'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// HTar
function __HTar(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('TipoAcesso', '', nxtWord16, 5, 0, False);
AddField('Dia', '', nxtByte, 3, 0, False);
AddField('Hora', '', nxtByte, 3, 0, False);
AddField('Cor', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IPrim', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoAcesso'));
Add(GetFieldFromName('Dia'));
Add(GetFieldFromName('Hora'));
end;
with AddIndex('ITipoAcessoCor', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoAcesso'));
Add(GetFieldFromName('Cor'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Impressao
function __Impressao(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Tran', '', nxtInt32, 10, 0, False);
AddField('Caixa', '', nxtInt32, 10, 0, False);
with AddField('Manual', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Computador', '', nxtNullString, 200, 0, False);
AddField('Maquina', '', nxtWord16, 5, 0, False);
AddField('Paginas', '', nxtWord16, 5, 0, False);
AddField('Impressora', '', nxtNullString, 200, 0, False);
AddField('Documento', '', nxtBLOBMemo, 0, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Resultado', '0-Completou, 1-Erro', nxtByte, 3, 0, False);
AddField('q1', '', nxtWord16, 5, 0, False);
AddField('q2', '', nxtWord16, 5, 0, False);
AddField('q3', '', nxtWord16, 5, 0, False);
AddField('q4', '', nxtWord16, 5, 0, False);
AddField('q5', '', nxtWord16, 5, 0, False);
AddField('q6', '', nxtWord16, 5, 0, False);
AddField('q7', '', nxtWord16, 5, 0, False);
AddField('q8', '', nxtWord16, 5, 0, False);
AddField('q9', '', nxtWord16, 5, 0, False);
AddField('q10', '', nxtWord16, 5, 0, False);
AddField('v1', '', nxtCurrency, 16, 0, False);
AddField('v2', '', nxtCurrency, 16, 0, False);
AddField('v3', '', nxtCurrency, 16, 0, False);
AddField('v4', '', nxtCurrency, 16, 0, False);
AddField('v5', '', nxtCurrency, 16, 0, False);
AddField('v6', '', nxtCurrency, 16, 0, False);
AddField('v7', '', nxtCurrency, 16, 0, False);
AddField('v8', '', nxtCurrency, 16, 0, False);
AddField('v9', '', nxtCurrency, 16, 0, False);
AddField('v10', '', nxtCurrency, 16, 0, False);
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('PagoPost', '', nxtCurrency, 16, 0, False);
AddField('DescPost', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('Func', '', nxtNullString, 20, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
with AddField('Cancelado', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('x75', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('ID')) do
Ascend := False;
with AddIndex('ICaixaID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IAcesso', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Sessao'));
with AddIndex('IMaquina', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Maquina'));
with Add(GetFieldFromName('DataHora')) do
Ascend := False;
end;
with AddIndex('IComputador', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
with Add(GetFieldFromName('Computador'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('IDataHora', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('DataHora')) do
Ascend := False;
with AddIndex('ISessaoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IClienteDataHora', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('ITran', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Tran')) do
Ascend := False;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// infoCampanha
function __infoCampanha(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('IP', '', nxtNullString, 15, 0, False);
AddField('campanha', '', nxtNullString, 50, 0, False);
AddField('utmccn', '', nxtNullString, 250, 0, False);
AddField('utmctr', '', nxtNullString, 250, 0, False);
AddField('utmcct', '', nxtNullString, 250, 0, False);
AddField('utmcmd', '', nxtNullString, 250, 0, False);
AddField('utmcsr', '', nxtNullString, 250, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IIP', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('IP'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// ITran
function __ITran(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Tran', '', nxtWord32, 10, 0, False);
AddField('Caixa', '', nxtWord32, 10, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('TipoTran', '', nxtByte, 3, 0, False);
AddField('TipoItem', 'Sessao, Tempo, MovEst, Transação', nxtByte, 3, 0, False);
AddField('SubTipo', '', nxtByte, 3, 0, False);
AddField('ItemID', '', nxtWord32, 10, 0, False);
AddField('SubItemID', '', nxtWord32, 10, 0, False);
AddField('ItemPos', '', nxtByte, 3, 0, False);
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('TotLiq', '', nxtCurrency, 16, 0, False);
AddField('Debito', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('Cancelado', '', nxtBoolean, 0, 0, False);
AddField('FidFator', '', nxtInt8, 3, 0, False);
AddField('FidPontos', '', nxtDouble, 0, 0, False);
AddField('FidMov', '', nxtBoolean, 0, 0, False);
AddField('plusID', '', nxtGUID, 0, 0, False);
with AddField('plusTran', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FidOpe', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ITipoItemDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoItem'));
Add(GetFieldFromName('ItemID'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('ITranID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Tran'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IClienteID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICaixaCancelado', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('Cancelado'));
Add(GetFieldFromName('TipoTran'));
Add(GetFieldFromName('TipoItem'));
end;
with AddIndex('ITipoItemTran', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoItem'));
Add(GetFieldFromName('ItemID'));
Add(GetFieldFromName('Tran'));
end;
with AddIndex('IFidMovClienteDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('FidMov'));
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('IPlusTranID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('plusTran'));
Add(GetFieldFromName('plusID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Layout
function __Layout(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Usuario', '', nxtNullString, 20, 0, False);
AddField('Grid', '', nxtNullString, 40, 0, False);
AddField('Nome', '', nxtNullString, 100, 0, False);
AddField('Publico', '', nxtBoolean, 0, 0, False);
AddField('Layout', '', nxtBLOB, 0, 0, False);
AddField('Filtro', '', nxtBLOB, 0, 0, False);
AddField('Usuarios', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IPubGridUsuario', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Publico'));
with Add(GetFieldFromName('Grid'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with Add(GetFieldFromName('Usuario'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Log
function __Log(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('DiaHora', '', nxtDateTime, 0, 0, False);
AddField('Maquina', '', nxtWord16, 5, 0, False);
AddField('Usuario', '', nxtNullString, 20, 0, False);
AddField('Programa', '0=nenhum, 1=ncguard, 2=ncadmin, 3=ncserver', nxtByte, 3, 0, False);
AddField('Operacao', '', nxtNullString, 70, 0, False);
AddField('Horas', '', nxtDateTime, 0, 0, False);
AddField('Dias', '', nxtWord16, 5, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IDiaHora', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('DiaHora'));
with AddIndex('IUsuarioNumSeq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IUsuarioDiaHora', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
with Add(GetFieldFromName('Usuario'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
Add(GetFieldFromName('DiaHora'));
end;
with AddIndex('IProgramaMaq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Programa'));
Add(GetFieldFromName('Maquina'));
Add(GetFieldFromName('ID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// LogApp
function __LogApp(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Caixa', '', nxtInt32, 10, 0, False);
AddField('Sessao', '', nxtInt32, 10, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
AddField('Inicio', '', nxtDateTime, 0, 0, False);
AddField('Fim', '', nxtDateTime, 0, 0, False);
AddField('Minutos', '', nxtDouble, 0, 0, False);
AddField('Exe', '', nxtNullString, 16, 0, False);
AddField('Caminho', '', nxtNullString, 16, 0, False);
AddField('Titulo', '', nxtNullString, 16, 0, False);
AddField('URL', '', nxtInt32, 10, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IInicio', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Inicio'));
with AddIndex('IClienteInicio', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Inicio'));
end;
with AddIndex('IMaq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Maq'));
Add(GetFieldFromName('Inicio'));
end;
with AddIndex('ISessaoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICaixa', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Caixa'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// LogNom
function __LogNom(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtNullString, 16, 0, False);
AddField('Type', 'H=Host, D=Dominio, P=Pagina, S=Search Argument, E=Executavel, C=Caminho, ' +
'T=Titulo', nxtChar, 1, 0, False);
AddField('Nome', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('ID'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// LogUrl
function __LogUrl(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Caixa', '', nxtInt32, 10, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
AddField('Sessao', '', nxtInt32, 10, 0, False);
AddField('Host', '', nxtNullString, 16, 0, False);
AddField('Dominio', '', nxtNullString, 16, 0, False);
AddField('Pagina', '', nxtNullString, 16, 0, False);
AddField('SearchArg', '', nxtNullString, 16, 0, False);
AddField('SearchEng', '', nxtNullString, 2, 0, False);
AddField('ViewTime', '', nxtDouble, 0, 0, False);
AddField('FirstView', '', nxtDateTime, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IClienteFirstView', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('FirstView'));
end;
with AddIndex('ISessaoHostPagina', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
with Add(GetFieldFromName('Host'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
with Add(GetFieldFromName('Pagina'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
end;
with AddIndex('ICaixa', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Caixa'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Maq
function __Maq(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Numero', '', nxtWord16, 5, 0, False);
AddField('Nome', '', nxtNullString, 30, 0, False);
AddField('Menu', '', nxtBLOBMemo, 0, 0, False);
AddField('Recursos', '', nxtBLOBMemo, 0, 0, False);
AddField('ComputerName', '', nxtNullString, 200, 0, False);
with AddField('TipoAcesso', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := -1;
with AddField('EmManutencao', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('IP', '', nxtNullString, 15, 0, False);
AddField('MacAddress', '', nxtNullString, 20, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('INumero', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Numero'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Maquina
function __Maquina(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Numero', '', nxtWord16, 5, 0, False);
AddField('Nome', '', nxtNullString, 30, 0, False);
AddField('Menu', '', nxtBLOBMemo, 0, 0, False);
AddField('Recursos', '', nxtBLOBMemo, 0, 0, False);
AddField('ComputerName', '', nxtNullString, 200, 0, False);
with AddField('TipoAcesso', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := -1;
with AddField('EmManutencao', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('ProgramaAtual', '', nxtBLOBMemo, 0, 0, False);
AddField('SiteAtual', '', nxtBLOBMemo, 0, 0, False);
AddField('IPConfig', '', nxtBLOBMemo, 0, 0, False);
AddField('IP', '', nxtNullString, 30, 0, False);
AddField('MacAddress', '', nxtNullString, 20, 0, False);
AddField('RAM', '', nxtWord32, 10, 0, False);
AddField('CPU', '', nxtNullString, 50, 0, False);
AddField('OS', '', nxtNullString, 50, 0, False);
AddField('Printers', '', nxtBLOBMemo, 0, 0, False);
AddField('Drives', '', nxtNullString, 25, 0, False);
AddField('HDTotal', '', nxtWord32, 10, 0, False);
AddField('HDFree', '', nxtWord32, 10, 0, False);
AddField('Patrocinio', '', nxtNullString, 20, 0, False);
AddField('DisplayH', '', nxtWord16, 5, 0, False);
AddField('DisplayW', '', nxtWord16, 5, 0, False);
AddField('DisplayWH', '', nxtNullString, 10, 0, False);
AddField('LastScan', '', nxtDateTime, 0, 0, False);
AddField('SessionID', '', nxtWord32, 10, 0, False);
AddField('ConnectTime', '', nxtDateTime, 0, 0, False);
with AddField('AvisaFimTempo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do
with AddIndex('INumero', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Numero'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// MovEst
function __MovEst(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Tran', '', nxtWord32, 10, 0, False);
AddField('Produto', '', nxtWord32, 10, 0, False);
AddField('Quant', '', nxtDouble, 0, 0, False);
AddField('Unitario', '', nxtCurrency, 16, 0, False);
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('CustoU', '', nxtCurrency, 16, 0, False);
AddField('Item', '', nxtByte, 3, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('PagoPost', '', nxtCurrency, 16, 0, False);
AddField('DescPost', '', nxtCurrency, 16, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Entrada', '', nxtBoolean, 0, 0, False);
AddField('Cancelado', '', nxtBoolean, 0, 0, False);
AddField('EstoqueAnt', '', nxtDouble, 0, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Caixa', '', nxtInt32, 10, 0, False);
AddField('Categoria', '', nxtNullString, 20, 0, False);
AddField('NaoControlaEstoque', '', nxtBoolean, 0, 0, False);
AddField('ITran', '', nxtInt32, 10, 0, False);
AddField('TipoTran', '', nxtByte, 3, 0, False);
AddField('Sessao', '', nxtInt32, 10, 0, False);
AddField('plusID', '', nxtGUID, 0, 0, False);
with AddField('plusTran', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FidResgate', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidPontos', '', nxtDouble, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IProduto', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
with Add(GetFieldFromName('Produto'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
Add(GetFieldFromName('DataHora'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IContato', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('ITipoTranCaixa', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoTran'));
Add(GetFieldFromName('Caixa'));
end;
with AddIndex('ICaixaMov', 0, idAll, 'M'), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ITranItem', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Tran'));
Add(GetFieldFromName('Item'));
end;
with AddIndex('IProdCxMov', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
with Add(GetFieldFromName('Produto'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ISessaoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IPlusTranID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('plusTran'));
Add(GetFieldFromName('plusID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// MsgCli
function __MsgCli(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Titulo', '', nxtNullString, 50, 0, False);
AddField('Texto', '', nxtBLOBMemo, 0, 0, False);
AddField('Ref', '', nxtWord32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IClienteID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IRef', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Ref'));
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Nomes
function __Nomes(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Nome', '', nxtNullString, 17, 0, False);
AddField('Sexo', '', nxtNullString, 1, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Ocupacao
function __Ocupacao(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Maq', '', nxtWord32, 10, 0, False);
AddField('Data', '', nxtDate, 0, 0, False);
AddField('Hora', '', nxtByte, 3, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Func', '', nxtNullString, 20, 0, False);
with AddField('TipoCli', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('MinutosU', '', nxtDouble, 0, 0, False);
AddField('MinutosP', '', nxtDouble, 0, 0, False);
AddField('Caixa', '', nxtWord32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('ISessao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('Hora'));
end;
with AddIndex('IData', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Data'));
Add(GetFieldFromName('Hora'));
end;
with AddIndex('ICaixa', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('Hora'));
end;
with AddIndex('ITipoCliCaixa', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoCli'));
Add(GetFieldFromName('Caixa'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Pacote
function __Pacote(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Minutos', '', nxtWord32, 10, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('Descr', '', nxtNullString, 30, 0, False);
with AddField('Fidelidade', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidPontos', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Passaporte
function __Passaporte(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 50, 0, False);
AddField('TipoPass', '', nxtInt32, 10, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
AddField('Expirou', '', nxtBoolean, 0, 0, False);
AddField('Senha', '', nxtNullString, 20, 0, False);
AddField('PrimeiroUso', '', nxtDateTime, 0, 0, False);
AddField('TipoAcesso', '', nxtInt32, 10, 0, False);
AddField('TipoExp', '', nxtByte, 1, 0, False);
AddField('ExpirarEm', '', nxtDateTime, 0, 0, False);
AddField('MaxSegundos', '', nxtWord32, 10, 0, False);
AddField('Segundos', '', nxtWord32, 10, 0, False);
AddField('Acessos', '', nxtWord32, 10, 0, False);
AddField('Dia1', '', nxtWord32, 10, 0, False);
AddField('Dia2', '', nxtWord32, 10, 0, False);
AddField('Dia3', '', nxtWord32, 10, 0, False);
AddField('Dia4', '', nxtWord32, 10, 0, False);
AddField('Dia5', '', nxtWord32, 10, 0, False);
AddField('Dia6', '', nxtWord32, 10, 0, False);
AddField('Dia7', '', nxtWord32, 10, 0, False);
AddField('Tran', '', nxtWord32, 10, 0, False);
AddField('DataCompra', '', nxtDateTime, 0, 0, False);
AddField('Cartao', '', nxtBoolean, 0, 0, False);
with AddField('Valido', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll, 'Exp'), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ICliExpID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Expirou'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ITransacao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Tran'));
with AddIndex('ICliDataCompra', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('DataCompra'));
end;
with AddIndex('IExpID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Expirou'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICartaoExpID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cartao'));
Add(GetFieldFromName('Expirou'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICartaoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cartao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ISenha', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Senha'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
with AddIndex('ISessao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Patrocinio
function __Patrocinio(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Nome', '', nxtNullString, 20, 0, False);
AddField('URLArea1', '', nxtBLOBMemo, 0, 0, False);
AddField('URLArea2', '', nxtBLOBMemo, 0, 0, False);
AddField('DominiosPerm', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// plusP
function __plusP(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('CodParceiro', '', nxtNullString, 15, 0, False);
AddField('NomeParceiro', '', nxtNullString, 40, 0, False);
AddField('urlTimeout', '', nxtNullString, 255, 0, False);
AddField('KeyIndex', '', nxtByte, 3, 0, False);
AddField('Adesao', '', nxtBoolean, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('ICodParceiro', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('CodParceiro'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// plusT
function __plusT(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('C', '', nxtNullString, 15, 0, False);
AddField('N', '', nxtNullString, 255, 0, False);
AddField('P', '', nxtNullString, 255, 0, False);
AddField('T', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('ICNP', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('C'));
Add(GetFieldFromName('N'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// plusTran
function __plusTran(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Seq', '', nxtAutoInc, 10, 0, False);
with AddField('ID', '', nxtGUID, 0, 0, False) do
AddDefaultValue(TnxAutoGuidDefaultValueDescriptor);
AddField('IDTranParceiro', '', nxtNullString, 50, 0, False);
AddField('OK', 'null=pendente, false=erro, true=OK', nxtBoolean, 0, 0, False);
AddField('Caixa', '', nxtWord32, 10, 0, False);
AddField('DataHoraParceiro', '', nxtDateTime, 0, 0, False);
with AddField('DataHoraNex', '', nxtDateTime, 0, 0, False) do
AddDefaultValue(TnxCurrentDateTimeDefaultValueDescriptor);
AddField('IDProdutoParceiro', '', nxtNullString, 40, 0, False);
AddField('codParceiro', '', nxtNullString, 15, 0, False);
AddField('IDProdutoNex', '', nxtWord32, 10, 0, False);
AddField('Descr', '', nxtBLOBMemo, 0, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('Func', '', nxtNullString, 20, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('Custo', '', nxtCurrency, 16, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('NomeCliente', '', nxtNullString, 50, 0, False);
AddField('TranID', '', nxtWord32, 10, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
AddField('Quant', '', nxtDouble, 10, 0, False);
AddField('PIN', '', nxtBLOBMemo, 0, 0, False);
AddField('Img', '', nxtBLOBGraphic, 0, 0, False);
AddField('EmailCliente', '', nxtNullString, 100, 0, False);
with AddField('Sincronizado', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('ISeq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Seq'));
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ITranIDOK', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TranID'));
Add(GetFieldFromName('OK'));
end;
with AddIndex('IOkSinc', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('OK'));
Add(GetFieldFromName('Sincronizado'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// PrintMon
function __PrintMon(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('JobID', '', nxtInt32, 10, 0, False);
AddField('Computer', '', nxtNullString, 100, 0, False);
AddField('Maquina', '', nxtWord16, 5, 0, False);
AddField('PrinterName', '', nxtNullString, 300, 0, False);
AddField('PrinterShare', '', nxtNullString, 300, 0, False);
AddField('PrinterPort', '', nxtNullString, 300, 0, False);
AddField('PrinterServer', '', nxtNullString, 300, 0, False);
AddField('User', '', nxtNullString, 300, 0, False);
AddField('Document', '', nxtBLOBMemo, 0, 0, False);
AddField('Pages', '', nxtWord32, 10, 0, False);
AddField('TotalPages', '', nxtWord32, 10, 0, False);
AddField('Copies', '', nxtWord32, 10, 0, False);
AddField('ClientPages', '', nxtWord32, 10, 0, False);
AddField('Status', '', nxtWord16, 5, 0, False);
AddField('PrinterIndex', '', nxtInt32, 10, 0, False);
AddField('Pausou', '', nxtBoolean, 0, 0, False);
AddField('Spooling', '', nxtBoolean, 0, 0, False);
AddField('Liberacao', '', nxtByte, 3, 0, False);
AddField('ImpID', '', nxtWord32, 10, 0, False);
AddField('PrtHandle', '', nxtWord32, 10, 0, False);
AddField('JobCliID', '', nxtWord32, 10, 0, False);
AddField('PDF', '', nxtBoolean, 0, 0, False);
AddField('DocInfo', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IPrinterIndexJobID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('PrinterIndex'));
Add(GetFieldFromName('JobID'));
end;
with AddIndex('ILiberacaoJobID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Liberacao'));
Add(GetFieldFromName('JobID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Processos
function __Processos(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ClienteID', '', nxtInt32, 10, 0, False);
AddField('Request', '', nxtInt32, 10, 0, False);
AddField('ProcessID', '', nxtInt32, 10, 0, False);
AddField('ExeName', '', nxtNullString, 80, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('ICliReq', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('ClienteID'));
Add(GetFieldFromName('Request'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// prodd
function __prodd(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('codbar', '', nxtShortString, 14, 0, True);
AddField('descricao', '', nxtShortString, 55, 0, False);
AddField('unid', '', nxtShortString, 5, 0, False);
AddField('imagem', '', nxtBLOBGraphic, 0, 0, False);
AddField('categoria', '', nxtShortString, 35, 0, False);
with AddField('id_upd', '', nxtWord32, 10, 0, True) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('pk', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('codbar'));
with AddIndex('ix_descricao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('descricao'));
with AddIndex('ix_unid', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('unid'));
with AddIndex('ix_categoria', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('categoria'));
with AddIndex('ix_upd', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('id_upd'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// produ
function __produ(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('codbar', '', nxtShortString, 14, 0, False);
AddField('descricao', '', nxtShortString, 55, 0, False);
AddField('unid', '', nxtShortString, 5, 0, False);
AddField('imagem', '', nxtBLOBGraphic, 0, 0, False);
AddField('categoria', '', nxtShortString, 35, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('pk', 0, idNull), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('codbar'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Produto
function __Produto(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Codigo', '', nxtNullString, 15, 0, False);
AddField('Descricao', '', nxtNullString, 55, 0, False);
AddField('Unid', '', nxtNullString, 5, 0, False);
AddField('Preco', '', nxtCurrency, 5, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('Imagem', '', nxtBLOBGraphic, 0, 0, False);
AddField('Categoria', '', nxtNullString, 35, 0, False);
AddField('Fornecedor', '', nxtWord32, 10, 0, False);
AddField('SubCateg', '', nxtNullString, 35, 0, False);
AddField('EstoqueAtual', '', nxtExtended, 0, 0, False);
AddField('CustoUnitario', '', nxtCurrency, 16, 0, False);
AddField('EstoqueACE', '', nxtExtended, 0, 0, False);
AddField('EstoqueACS', '', nxtExtended, 0, 0, False);
AddField('PodeAlterarPreco', '', nxtBoolean, 0, 0, False);
AddField('NaoControlaEstoque', '', nxtBoolean, 0, 0, False);
AddField('EstoqueMin', '', nxtExtended, 0, 0, False);
AddField('EstoqueMax', '', nxtExtended, 0, 0, False);
AddField('AbaixoMin', '', nxtBoolean, 0, 0, False);
AddField('AbaixoMinDesde', '', nxtDateTime, 0, 0, False);
AddField('EstoqueRepor', '', nxtExtended, 0, 0, False);
AddField('plus', '', nxtBoolean, 0, 0, False);
AddField('plusURL', '', nxtBLOBMemo, 0, 0, False);
AddField('plusCodParceiro', '', nxtNullString, 15, 0, False);
AddField('plusCodProduto', '', nxtNullString, 15, 0, False);
with AddField('Ativo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('Fidelidade', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidPontos', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('ICodigo', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Codigo'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IDescricao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Descricao'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IAbaixoMin', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('AbaixoMin'));
Add(GetFieldFromName('AbaixoMinDesde'));
end;
with AddIndex('IplusParceiroProd', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('plus'));
Add(GetFieldFromName('plusCodParceiro'));
Add(GetFieldFromName('plusCodProduto'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Recibo
function __Recibo(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Cliente', '', nxtInt32, 10, 0, False);
AddField('Tran', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('ICliente', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('ID'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Sessao
function __Sessao(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Inicio', '', nxtDateTime, 0, 0, False);
AddField('Termino', '', nxtDateTime, 0, 0, False);
AddField('MinutosR', 'Em minutos', nxtDouble, 0, 0, False);
AddField('MinutosC', 'Em minutos', nxtDouble, 0, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
AddField('MaqI', '', nxtWord16, 5, 0, False);
with AddField('Encerrou', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('TransfMaq', 'Houve transferencia de maquina', nxtBoolean, 0, 0, False);
with AddField('TipoCli', '0=normal, 1=gratis, 2=manutencao', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
with AddField('Cancelado', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('PagoPost', '', nxtCurrency, 16, 0, False);
AddField('DescPost', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('NomeCliente', '', nxtNullString, 50, 0, False);
AddField('FuncI', '', nxtNullString, 30, 0, False);
AddField('FuncF', '', nxtNullString, 30, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('TipoAcesso', '', nxtInt32, 10, 0, False);
AddField('CaixaI', '', nxtWord32, 10, 0, False);
AddField('CaixaF', '', nxtWord32, 10, 0, False);
AddField('TicksI', '', nxtInt32, 10, 0, False);
AddField('Pausado', '', nxtBoolean, 0, 0, False);
AddField('InicioPausa', '', nxtWord32, 10, 0, False);
AddField('MinTicksUsados', '', nxtWord32, 10, 0, False);
AddField('MinTicksTotal', '', nxtWord32, 10, 0, False);
AddField('FimTicksUsados', '', nxtWord32, 10, 0, False);
AddField('FimTicksTotal', '', nxtWord32, 10, 0, False);
AddField('StrPausas', '', nxtBLOBMemo, 0, 0, False);
AddField('StrTransfMaq', '', nxtBLOBMemo, 0, 0, False);
AddField('StrFechamentoCaixa', '', nxtBLOBMemo, 0, 0, False);
AddField('MinutosCli', '', nxtExtended, 0, 0, False);
AddField('MinutosPrev', '', nxtExtended, 0, 0, False);
AddField('MinutosMax', '', nxtExtended, 0, 0, False);
AddField('MinutosCliU', '', nxtExtended, 0, 0, False);
AddField('ValorCli', '', nxtCurrency, 16, 0, False);
AddField('ValorCliU', '', nxtExtended, 0, 0, False);
AddField('TranI', '', nxtInt32, 10, 0, False);
AddField('TranF', '', nxtInt32, 10, 0, False);
AddField('PermitirDownload', '', nxtBoolean, 0, 0, False);
AddField('PermitirDownloadExe', '', nxtBoolean, 0, 0, False);
AddField('FiltrarWEB', '', nxtBoolean, 0, 0, False);
AddField('VersaoRegistro', '', nxtWord32, 10, 0, False);
AddField('IPs', '', nxtBLOBMemo, 0, 0, False);
with AddField('DesktopSinc', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := True;
with AddField('CartaoTempo', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('HP1', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP2', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP3', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP4', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP5', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP6', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('HP7', '', nxtInt32, 10, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 2147483647;
with AddField('DisableAD', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('JobID', '', nxtWord32, 10, 0, False);
AddField('JobPages', '', nxtWord16, 5, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('IClienteInicio', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('Inicio'));
end;
with AddIndex('IEncerrou', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Encerrou'));
Add(GetFieldFromName('CaixaF'));
end;
with AddIndex('IEncerrouCli', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Encerrou'));
Add(GetFieldFromName('Cliente'));
end;
with AddIndex('ICaixaF', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('CaixaF'));
Add(GetFieldFromName('TipoCli'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Tarifa
function __Tarifa(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('TipoAcesso', '', nxtWord16, 5, 0, False);
AddField('Cor', '', nxtInt32, 10, 0, False);
AddField('CorFonte', '', nxtInt32, 10, 0, False);
AddField('Descricao', '', nxtNullString, 30, 0, False);
AddField('Reinicia', '', nxtBoolean, 0, 0, False);
AddField('PrecosStr', '', nxtBLOBMemo, 0, 0, False);
AddField('DivQtd', '', nxtWord32, 10, 0, False);
with AddField('SemValorMin', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('ReiniciaDesde', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
with AddField('DivTipo', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 1;
with AddField('Arredondar', '', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 5;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IPrim', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('TipoAcesso'));
Add(GetFieldFromName('Cor'));
end;
with AddIndex('ICor', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Cor'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Tempo
function __Tempo(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Func', '', nxtNullString, 20, 0, False);
with AddField('Tipo', '0=Tempo, 1=Tempo Previsto, 2=Passaporte, 3=pacote, 4=cartao de tempo', nxtByte, 3, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := 0;
AddField('Minutos', '', nxtDouble, 0, 0, False);
AddField('IDPacPass', '', nxtWord32, 10, 0, False);
AddField('Passaporte', '', nxtWord32, 10, 0, False);
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('PagoPost', '', nxtCurrency, 16, 0, False);
AddField('DescPost', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Cancelado', '', nxtBoolean, 0, 0, False);
AddField('Tran', '', nxtInt32, 10, 0, False);
AddField('Caixa', '', nxtInt32, 10, 0, False);
AddField('Nome', '', nxtNullString, 50, 0, False);
AddField('Senha', '', nxtNullString, 20, 0, False);
AddField('TipoAcesso', '', nxtInt32, 10, 0, False);
AddField('Obs', '', nxtNullString, 50, 0, False);
with AddField('CredValor', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
with AddField('FidResgate', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidPontos', '', nxtDouble, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ISessaoID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ICliente', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('ITran', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('Tran'));
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// TipoAcesso
function __TipoAcesso(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtWord16, 5, 0, False);
AddField('Nome', '', nxtNullString, 30, 0, False);
AddField('TarifaPadrao', '', nxtInt32, 10, 0, False);
AddField('HoraTarifaStr', '', nxtBLOBMemo, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idNone), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// TipoImp
function __TipoImp(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
with FilesDescriptor do
with FileDescriptor[0] do
Desc := 'Tipos de Impressão';
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtByte, 3, 0, False);
AddField('Nome', '', nxtNullString, 30, 0, False);
AddField('Impressora', '', nxtNullString, 500, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('Contador', '', nxtInt32, 10, 0, False);
AddField('ImgID', '', nxtInt32, 10, 0, False);
AddField('PrinterDevMode', '', nxtBLOB, 0, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
with AddIndex('IImp', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Impressora'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00030002;
IgnoreKanaType := True;
IgnoreNonSpace := True;
Ignorewidth := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// TipoPass
function __TipoPass(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('Nome', '', nxtNullString, 50, 0, False);
AddField('Valor', '', nxtCurrency, 16, 0, False);
AddField('TipoAcesso', '', nxtInt32, 10, 0, False);
AddField('TipoExp', '', nxtByte, 1, 0, False);
AddField('ExpirarEm', '', nxtDateTime, 0, 0, False);
AddField('MaxSegundos', '', nxtWord32, 10, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('Dia1', '', nxtWord32, 10, 0, False);
AddField('Dia2', '', nxtWord32, 10, 0, False);
AddField('Dia3', '', nxtWord32, 10, 0, False);
AddField('Dia4', '', nxtWord32, 10, 0, False);
AddField('Dia5', '', nxtWord32, 10, 0, False);
AddField('Dia6', '', nxtWord32, 10, 0, False);
AddField('Dia7', '', nxtWord32, 10, 0, False);
with AddField('Fidelidade', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
AddField('FidPontos', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Tran
function __Tran(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('ID', '', nxtAutoInc, 10, 0, False);
AddField('DataHora', '', nxtDateTime, 0, 0, False);
AddField('Cliente', '', nxtWord32, 10, 0, False);
AddField('Tipo', '', nxtByte, 3, 0, False);
AddField('Func', '', nxtNullString, 20, 0, False);
AddField('Total', '', nxtCurrency, 16, 0, False);
AddField('Desconto', '', nxtCurrency, 16, 0, False);
AddField('TotLiq', '', nxtCurrency, 16, 0, False);
AddField('Pago', '', nxtCurrency, 16, 0, False);
AddField('Debito', '', nxtCurrency, 16, 0, False);
AddField('Obs', '', nxtBLOBMemo, 0, 0, False);
AddField('Cancelado', '', nxtBoolean, 0, 0, False);
AddField('CanceladoPor', '', nxtNullString, 30, 0, False);
AddField('CanceladoEm', '', nxtDateTime, 0, 0, False);
AddField('Caixa', '', nxtWord32, 10, 0, False);
AddField('Maq', '', nxtWord16, 5, 0, False);
AddField('NomeCliente', '', nxtNullString, 50, 0, False);
AddField('Sessao', '', nxtWord32, 10, 0, False);
AddField('Descr', '', nxtNullString, 50, 0, False);
AddField('QtdTempo', '', nxtDouble, 0, 0, False);
AddField('CredValor', '', nxtBoolean, 0, 0, False);
AddField('FidResgate', '', nxtBoolean, 0, 0, False);
AddField('plusID', '', nxtGUID, 0, 0, False);
with AddField('plusTran', '', nxtBoolean, 0, 0, False) do
with AddDefaultValue(TnxConstDefaultValueDescriptor) as TnxConstDefaultValueDescriptor do
AsVariant := False;
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('ID'));
with AddIndex('ICliDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Cliente'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('ICaixaID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Caixa'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
Add(GetFieldFromName('DataHora'));
with AddIndex('ITipoDH', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Tipo'));
Add(GetFieldFromName('DataHora'));
end;
with AddIndex('ISessao', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('Sessao'));
Add(GetFieldFromName('ID'));
end;
with AddIndex('IPlusTranID', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do begin
Add(GetFieldFromName('plusTran'));
Add(GetFieldFromName('plusID'));
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
// Usuario
function __Usuario(aDatabase : TnxDatabase): TnxDataDictionary;
begin
Result := TnxDataDictionary.Create;
try
with Result do begin
AddRecordDescriptor(TnxBaseRecordDescriptor);
with FieldsDescriptor do begin
AddField('Username', '', nxtNullString, 20, 0, False);
AddField('Nome', '', nxtNullString, 40, 0, False);
AddField('Admin', '', nxtBoolean, 0, 0, False);
AddField('Senha', '', nxtNullString, 30, 0, False);
AddField('Grupos', '', nxtBLOBMemo, 0, 0, False);
AddField('Direitos', '', nxtBLOBMemo, 0, 0, False);
AddField('MaxTempoManut', '', nxtInt32, 10, 0, False);
AddField('MaxMaqManut', '', nxtInt32, 10, 0, False);
end;
with EnsureIndicesDescriptor do begin
with AddIndex('IUsername', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Username'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
with AddIndex('INome', 0, idAll), KeyDescriptor as TnxCompKeyDescriptor do
with Add(GetFieldFromName('Nome'), TnxExtTextKeyFieldDescriptor) as TnxExtTextKeyFieldDescriptor do begin
IgnoreCase := True;
with AddLocaleDescriptor do begin
Locale := $00000416; { Portuguese }
Flags := $00001000;
UseStringSort := True;
end;
end;
end;
CheckValid(False);
end;
except
FreeAndNil(Result);
raise;
end;
end;
type
TnxcgTableInfo = record
TableName : String;
Callback : TnxcgCreateDictCallback;
end;
const
TableInfos : array[0..54] of TnxcgTableInfo =
((TableName : 'Aviso'; Callback : __Aviso),
(TableName : 'Biometria'; Callback : __Biometria),
(TableName : 'Caixa'; Callback : __Caixa),
(TableName : 'CategFW'; Callback : __CategFW),
(TableName : 'Categoria'; Callback : __Categoria),
(TableName : 'Chat'; Callback : __Chat),
(TableName : 'CHorario'; Callback : __CHorario),
(TableName : 'Cliente'; Callback : __Cliente),
(TableName : 'Config'; Callback : __Config),
(TableName : 'Debito'; Callback : __Debito),
(TableName : 'EmailCorpo'; Callback : __EmailCorpo),
(TableName : 'EmailCriar'; Callback : __EmailCriar),
(TableName : 'EmailEnvio'; Callback : __EmailEnvio),
(TableName : 'Espera'; Callback : __Espera),
(TableName : 'ETar'; Callback : __ETar),
(TableName : 'FilaImp'; Callback : __FilaImp),
(TableName : 'FiltroWeb'; Callback : __FiltroWeb),
(TableName : 'Fornecedor'; Callback : __Fornecedor),
(TableName : 'HCred'; Callback : __HCred),
(TableName : 'HPass'; Callback : __HPass),
(TableName : 'HTar'; Callback : __HTar),
(TableName : 'Impressao'; Callback : __Impressao),
(TableName : 'infoCampanha'; Callback : __infoCampanha),
(TableName : 'ITran'; Callback : __ITran),
(TableName : 'Layout'; Callback : __Layout),
(TableName : 'Log'; Callback : __Log),
(TableName : 'LogApp'; Callback : __LogApp),
(TableName : 'LogNom'; Callback : __LogNom),
(TableName : 'LogUrl'; Callback : __LogUrl),
(TableName : 'Maq'; Callback : __Maq),
(TableName : 'Maquina'; Callback : __Maquina),
(TableName : 'MovEst'; Callback : __MovEst),
(TableName : 'MsgCli'; Callback : __MsgCli),
(TableName : 'Nomes'; Callback : __Nomes),
(TableName : 'Ocupacao'; Callback : __Ocupacao),
(TableName : 'Pacote'; Callback : __Pacote),
(TableName : 'Passaporte'; Callback : __Passaporte),
(TableName : 'Patrocinio'; Callback : __Patrocinio),
(TableName : 'plusP'; Callback : __plusP),
(TableName : 'plusT'; Callback : __plusT),
(TableName : 'plusTran'; Callback : __plusTran),
(TableName : 'PrintMon'; Callback : __PrintMon),
(TableName : 'Processos'; Callback : __Processos),
(TableName : 'prodd'; Callback : __prodd),
(TableName : 'produ'; Callback : __produ),
(TableName : 'Produto'; Callback : __Produto),
(TableName : 'Recibo'; Callback : __Recibo),
(TableName : 'Sessao'; Callback : __Sessao),
(TableName : 'Tarifa'; Callback : __Tarifa),
(TableName : 'Tempo'; Callback : __Tempo),
(TableName : 'TipoAcesso'; Callback : __TipoAcesso),
(TableName : 'TipoImp'; Callback : __TipoImp),
(TableName : 'TipoPass'; Callback : __TipoPass),
(TableName : 'Tran'; Callback : __Tran),
(TableName : 'Usuario'; Callback : __Usuario));
function TableCount: Integer;
begin
Result := Length(TableInfos);
end;
function GetTableDictionary(aDatabase : TnxDatabase; const aTableName : String): TnxDataDictionary;
var
I : Integer;
begin
Result := nil;
for I := Low(TableInfos) to High(TableInfos) do
if SameText(aTableName, TableInfos[I].TableName) then begin
Result := TableInfos[I].Callback(aDatabase);
break;
end;
end;
procedure RestructureTable(aDatabase : TnxDatabase;
const aTableName, aPassword : String;
aNewDict : TnxDataDictionary;
aProgressCallback : TnxcgProgressCallback;
var aCancelTask : Boolean;
aFreeDict : Boolean = False);
var
OldDict : TnxDataDictionary;
Mapper : TnxTableMapperDescriptor;
TaskInfo : TnxAbstractTaskInfo;
Completed : Boolean;
TaskStatus : TnxTaskStatus;
begin
try
OldDict := TnxDataDictionary.Create;
try
nxCheck(aDatabase.GetDataDictionaryEx(aTableName, aPassword, OldDict));
if (aPassword <> '') and (aNewDict.EncryptionEngine = '') then
aNewDict.EncryptionEngine := OldDict.EncryptionEngine;
if OldDict.IsEqual(aNewDict) then
Exit;
Mapper := TnxTableMapperDescriptor.Create;
try
Mapper.MapAllTablesAndFieldsByName(OldDict, aNewDict);
nxCheck(aDatabase.RestructureTableEx(aTableName, aPassword, aNewDict, Mapper, TaskInfo));
if Assigned(TaskInfo) then
try
repeat
if not aCancelTask then
TaskInfo.GetStatus(Completed, TaskStatus);
if not Completed then begin
if Assigned(aProgressCallback) then
aProgressCallback(aTableName, TaskStatus, aCancelTask);
if not aCancelTask then
Sleep(100)
else
nxCheck(TaskInfo.Cancel);
end;
until Completed or aCancelTask;
nxCheck(TaskStatus.tsErrorCode);
finally
TaskInfo.Free;
end;
finally
Mapper.Free;
end;
finally
OldDict.Free;
end;
finally
if aFreeDict then
aNewDict.Free;
end;
end;
procedure BuildAndEvolveTable(aDatabase : TnxDatabase;
const aTableName, aPassword : String;
aCreateDictCallback : TnxcgCreateDictCallback;
aProgressCallback : TnxcgProgressCallback;
var aCancelTask : Boolean);
var
Dict : TnxDataDictionary;
begin
Dict := aCreateDictCallback(aDatabase);
if Assigned(Dict) then
try
if not aDatabase.TableExists(aTableName, aPassword) then
aDatabase.CreateTable(False, aTableName, aPassword, Dict)
else
RestructureTable(aDatabase, aTableName,
aPassword, Dict, aProgressCallback, aCancelTask);
finally
Dict.Free;
end;
end;
procedure BuildAndEvolveDatabase(aDatabase : TnxDatabase;
aProgressCallback : TnxcgProgressCallback = nil;
aGetPasswordCallback : TnxcgGetPasswordCallback = nil;
const aPassword : String = '');
var
I : Integer;
CancelTask : Boolean;
Password : string;
begin
CancelTask := False;
for I := Low(TableInfos) to High(TableInfos) do begin
Password := aPassword;
if Assigned(aGetPasswordCallback) then
aGetPasswordCallback(TableInfos[I].TableName, Password);
BuildAndEvolveTable(aDatabase,
TableInfos[I].TableName, Password,
TableInfos[I].Callback, aProgressCallback, CancelTask);
if CancelTask then
Exit;
end;
end;
end.
|
unit TreeEditor;
//# BEGIN TODO Completed by: author name, id.nr., date
{ E.I.R. van Delden, 0618959, 29-06-2008 }
//# END TODO
interface
uses
Variants, Forms,
Dialogs, StdCtrls, ComCtrls, ExtCtrls, Grids,
SysUtils, Windows, Messages, Classes, Graphics, Controls,
Nodes;
type
TTreeEditor =
class(TObject)
protected
FTree : TNode;
FFocus : TNode;
FModified: Boolean;
FTreeClass: TNodeClass;
procedure SetTree(ATree: TNode); virtual;
// pre: CanSetTree(ATree)
// effect: replace tree in editor by ATree
procedure SetFocus(AFocus: TNode); virtual;
// pre: CanSetFocus(AFocus)
// post: Focus = AFocus
procedure SetTreeClass(AClass: TNodeClass); virtual;
function Contains(ATree, ANode: TNode): Boolean; virtual;
// pre: ATree is root of a well-formed tree
// ret: node with reference ANode occurs in that tree
procedure FindFather(ANode: TNode; var VFather: TNode; var J: Integer);
// pre: FTree <> nil
//post: if ANode occurs in FTree
// then VFather <> nil and VFather.GetSon(J) = ANode
// else VFather = nil
public
// construction/destruction
constructor Create;
destructor Destroy; override;
// queries
function CanSetTree(ANode: TNode): Boolean; virtual;
// pre: true
// ret: ANode 'is' TreeClass
// (and "ANode is root of well-formed tree" ; not checked)
function CanSetFocus(ANode: TNode): Boolean; virtual;
// pre: true
// ret: ANode refers to a node in tree in editor
function CanReplace(ASource, ATarget: TNode): Boolean; virtual;
// pre: true
// ret: if ATarget = Tree
// then CanSetTree(ASource)
// else (node with reference ATarget occurs in ATree)
// commands
procedure Replace(ASource, ATarget: TNode);
// pre: CanReplace(ASource, ATarget)
// effect: subtree pointed to by ATarget is replaced by tree with root
// Asource
// properties
property Tree : TNode read FTree write SetTree;
property Focus: TNode read FFocus write SetFocus;
property Modified: Boolean read FModified;
property TreeClass: TNodeClass read FTreeClass write SetTreeClass;
// Invariants
// I1: Tree <> nil and is root of a well-formed tree
// I2: (Focus = nil) or (Focus points to a node in tree with root Tree
end;
implementation //================================================
{ TTreeEditor }
function TTreeEditor.CanReplace(ASource, ATarget: TNode): Boolean;
begin
//# BEGIN TODO
// pre: true
// ret: if ATarget = Tree
// then CanSetTree(ASource)
// else (node with reference ATarget occurs in ATree)
if ATarget = Tree then
result := CanSetTree( ASource)
else
begin
result := Contains( FTree, ATarget);
end;
//# END TODO
end;
function TTreeEditor.CanSetFocus(ANode: TNode): Boolean;
var I: Integer;
begin
//# BEGIN TODO
// pre: true
// ret: ANode refers to a node in tree in editor
result := Contains( FTree, Anode);
//# END TODO
end;
function TTreeEditor.CanSetTree(ANode: TNode): Boolean;
begin
//# BEGIN TODO
// pre: true
// ret: ANode 'is' TreeClass
// (and "ANode is root of well-formed tree" ; not checked)
result := true; {ANode is TreeClass; er is niks mis met deze code, tocht doet hij het niet, ook
ANode.ClassType = TReeClass weigert, terwijl beiden het eerder wel deden >_< }
//# END TODO
end;
function TTreeEditor.Contains(ATree, ANode: TNode): Boolean;
var
I: Integer;
begin
if ATree = ANode
then Result := true
else
begin
Result := false;
for I := 0 to ATree.GetNrofSons - 1 do
if Contains(ATree.GetSon(I), ANode)
then Result := true;
end;
end;
constructor TTreeEditor.Create;
begin
inherited Create;
FTree := nil;
FFocus := nil;
FModified := false;
end;
destructor TTreeEditor.Destroy;
begin
FTree.Free;
inherited Destroy;
end;
procedure TTreeEditor.FindFather(ANode: TNode; var VFather: TNode;
var J: Integer);
var
I: Integer;
// auxilary recursive function that returns the father
procedure GetFather( ARoot, ANode: TNode);
var I: integer;
begin
//pre: ANode in FTree
//ret: result, such that result.GetSon(j) = ANode
// Idee: Alle nodes langs gaan, controlleren op GetSon = ANode
for I := 0 to ARoot.GetNrofSons - 1 do
begin
if (ARoot.GetSon(I) = ANode) then
begin
VFather := ARoot; //Fonund father
J := I; // Index of son
end
else
begin
GetFather(ARoot.GetSon(I) , ANode);
end; // end if
end; // end for
end; // end auxilary recursive function
begin
//# BEGIN TODO
{ Hint: define and use an auxilary recursive procedure or function }
// pre: FTree <> nil
//post: if ANode occurs in FTree
// then VFather <> nil and VFather.GetSon(J) = ANode
// else VFather = nil
Assert( FTree <> nil, 'TTreeEditor.FindFather.pre failed');
if (Contains(FTree, ANode) and (FTree <> ANode)) then // Node in Tree and is not root
begin
GetFather(FTree, ANode);
end
else
begin
VFather := nil;
J := -1;
end;
//# END TODO
end;
procedure TTreeEditor.Replace(ASource, ATarget: TNode);
var
VNode: TNode;
I: Integer;
begin
//# BEGIN TODO
// pre: CanReplace(ASource, ATarget)
// effect: subtree pointed to by ATarget is replaced by tree with root
// Asource
//Assert( CanReplace( ASource, ATarget), 'TTreeEditor.Replace.pre failed');
I := 0;
if FTree = ATarget then
begin
FTree := ASource;
end
else
begin
FindFather( ATarget, VNode, I); // ATarget zit onder FTree (de root)
VNode.SetSon(I, ASource); // VNode is now the Parent of the Node that needs to be replaced)
end;
//# END TODO
end;
procedure TTreeEditor.SetFocus(AFocus: TNode);
begin
//# BEGIN TODO
// pre: CanSetFocus(AFocus)
// post: Focus = AFocus
// Assert( CanSetFocus(AFocus), 'TTreeEditor.SetFocus.pre failed: ' + AFocus.GetData + AFocus.OpName );
FFocus := AFocus;
//# END TODO
end;
procedure TTreeEditor.SetTree(ATree: TNode);
begin
//# BEGIN TODO
// pre: CanSetTree(ATree)
// effect: replace tree in editor by ATree
Assert( CanSetTRee( ATree), 'TTreeEditor.SetTree.pre failed');
FTree := ATree;
//# END TODO
end;
procedure TTreeEditor.SetTreeClass(AClass: TNodeClass);
begin
if (FTree <> nil) and not (FTree is AClass)
then FTree.Free;
FTreeClass := AClass;
end;
initialization
end.
|
{*******************************************************}
{ }
{ Delphi FireDAC Framework }
{ FireDAC Data Adapter Column mapping }
{ }
{ Copyright(c) 2004-2018 Embarcadero Technologies, Inc. }
{ All rights reserved }
{ }
{*******************************************************}
{$I FireDAC.inc}
unit FireDAC.DApt.Column;
interface
uses
System.Classes,
FireDAC.DatS,
FireDAC.Phys.Intf;
type
TFDDAptColumnMapping = class(TCollectionItem)
private
FDatSColumnName: String;
FSourceColumnID: Integer;
FSourceColumnName: String;
FUpdateColumnName: String;
procedure SetSourceColumnName(const AValue: String);
procedure SetSourceColumnID(const AValue: Integer);
function GetUpdateColumnName: String;
function GetDatSColumnName: String;
function GetDatSColumn: TFDDatSColumn;
function MatchRecordSetColumn(const AColumn: TFDPhysMappingName): Boolean;
protected
function GetDisplayName: String; override;
public
constructor Create(ACollection: TCollection); override;
property DatSColumn: TFDDatSColumn read GetDatSColumn;
published
property SourceColumnName: String read FSourceColumnName write SetSourceColumnName;
property SourceColumnID: Integer read FSourceColumnID write SetSourceColumnID default -1;
property UpdateColumnName: String read GetUpdateColumnName write FUpdateColumnName;
property DatSColumnName: String read GetDatSColumnName write FDatSColumnName;
end;
TFDDAptColumnMappings = class(TCollection)
private
FDatSTable: TFDDatSTable;
FOwner: TPersistent;
function Find(const AColumn: TFDPhysMappingName): Integer;
function GetItems(AIndex: Integer): TFDDAptColumnMapping;
procedure SetItems(AIndex: Integer; const Value: TFDDAptColumnMapping);
protected
function GetOwner: TPersistent; override;
public
constructor Create(AOwner: TPersistent); overload;
destructor Destroy; override;
procedure SetOwner(AOwner: TPersistent);
function Lookup(const AColumn: TFDPhysMappingName): TFDDAptColumnMapping;
function Add(const ASourceColumnName: String = '';
const ADatSColumnName: String = '';
const AUpdateColumnName: String = ''): TFDDAptColumnMapping;
procedure Remove(const AColumn: TFDPhysMappingName);
property Items[AIndex: Integer]: TFDDAptColumnMapping read GetItems write SetItems; default;
property DatSTable: TFDDatSTable read FDatSTable write FDatSTable;
end;
procedure FDGetRecordSetColumnInfo(AColMap: TFDDAptColumnMapping;
var ASourceID: Integer; var ASourceName, ADatSName, AUpdateName: String;
var ADatSColumn: TFDDatSColumn);
implementation
uses
System.SysUtils,
FireDAC.Stan.Util;
{-------------------------------------------------------------------------------}
{ TFDDAptColumnMapping }
{-------------------------------------------------------------------------------}
constructor TFDDAptColumnMapping.Create(ACollection: TCollection);
begin
inherited Create(ACollection);
FSourceColumnID := -1;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMapping.GetDisplayName: String;
begin
if SourceColumnName <> '' then
Result := SourceColumnName
else if SourceColumnID <> -1 then
Result := Format('[%d]', [SourceColumnID]);
if (Result <> '') and (DatSColumnName <> '') then
Result := Result + ' -> ' + DatSColumnName;
if Result = '' then
Result := inherited GetDisplayName;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMapping.GetDatSColumn: TFDDatSColumn;
var
i: Integer;
oCols: TFDDatSColumnList;
begin
if (GetDatSColumnName <> '') and (TFDDAptColumnMappings(Collection).DatSTable <> nil) then begin
oCols := TFDDAptColumnMappings(Collection).DatSTable.Columns;
i := oCols.IndexOfName(GetDatSColumnName);
if i <> -1 then
Result := oCols.ItemsI[i]
else
Result := nil;
end
else
Result := nil;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMapping.GetDatSColumnName: String;
begin
Result := FDatSColumnName;
if Result = '' then
Result := FSourceColumnName;
end;
{-------------------------------------------------------------------------------}
procedure TFDDAptColumnMapping.SetSourceColumnID(const AValue: Integer);
begin
FSourceColumnID := AValue;
if AValue >= 0 then
FSourceColumnName := '';
end;
{-------------------------------------------------------------------------------}
procedure TFDDAptColumnMapping.SetSourceColumnName(const AValue: String);
begin
FSourceColumnName := AValue;
if AValue <> '' then
FSourceColumnID := -1;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMapping.GetUpdateColumnName: String;
begin
Result := FUpdateColumnName;
if Result = '' then
Result := FSourceColumnName;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMapping.MatchRecordSetColumn(const AColumn: TFDPhysMappingName): Boolean;
var
oCol: TFDDatSColumn;
begin
case AColumn.FKind of
nkID:
Result := SourceColumnID = AColumn.FID;
nkSource:
Result := {$IFDEF FireDAC_NOLOCALE_META} CompareText {$ELSE} AnsiCompareText {$ENDIF}
(AColumn.FName, SourceColumnName) = 0;
nkDatS:
Result := {$IFDEF FireDAC_NOLOCALE_META} CompareText {$ELSE} AnsiCompareText {$ENDIF}
(AColumn.FName, DatSColumnName) = 0;
nkObj:
begin
oCol := TFDDatSColumn(AColumn.FObj);
Result :=
(DatSColumn <> nil) and (DatSColumn = oCol) or
(SourceColumnID <> -1) and (SourceColumnID = oCol.SourceID) or
(SourceColumnName <> '') and (
{$IFDEF FireDAC_NOLOCALE_META} CompareText {$ELSE} AnsiCompareText {$ENDIF}
(SourceColumnName, oCol.SourceName) = 0) or
(DatSColumnName <> '') and (
{$IFDEF FireDAC_NOLOCALE_META} CompareText {$ELSE} AnsiCompareText {$ENDIF}
(DatSColumnName, oCol.Name) = 0);
end;
else
Result := False;
end;
end;
{-------------------------------------------------------------------------------}
procedure FDGetRecordSetColumnInfo(AColMap: TFDDAptColumnMapping;
var ASourceID: Integer; var ASourceName, ADatSName, AUpdateName: String;
var ADatSColumn: TFDDatSColumn);
begin
if AColMap.SourceColumnID <> -1 then
ASourceID := AColMap.SourceColumnID;
if AColMap.SourceColumnName <> '' then
ASourceName := AColMap.SourceColumnName;
if AColMap.DatSColumnName <> '' then
ADatSName := AColMap.DatSColumnName;
if AColMap.UpdateColumnName <> '' then
AUpdateName := AColMap.UpdateColumnName;
if AColMap.DatSColumn <> nil then
ADatSColumn := AColMap.DatSColumn;
end;
{-------------------------------------------------------------------------------}
{ TFDDAptColumnMappings }
{-------------------------------------------------------------------------------}
constructor TFDDAptColumnMappings.Create(AOwner: TPersistent);
begin
inherited Create(TFDDAptColumnMapping);
FOwner := AOwner;
end;
{-------------------------------------------------------------------------------}
destructor TFDDAptColumnMappings.Destroy;
begin
FOwner := nil;
inherited Destroy;
end;
{-------------------------------------------------------------------------------}
procedure TFDDAptColumnMappings.SetOwner(AOwner: TPersistent);
begin
FOwner := AOwner;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMappings.GetOwner: TPersistent;
begin
Result := FOwner;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMappings.GetItems(AIndex: Integer): TFDDAptColumnMapping;
begin
Result := inherited Items[AIndex] as TFDDAptColumnMapping;
end;
{-------------------------------------------------------------------------------}
procedure TFDDAptColumnMappings.SetItems(AIndex: Integer; const Value: TFDDAptColumnMapping);
begin
inherited Items[AIndex] := Value;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMappings.Add(const ASourceColumnName: String = '';
const ADatSColumnName: String = ''; const AUpdateColumnName: String = ''): TFDDAptColumnMapping;
begin
Result := inherited Add as TFDDAptColumnMapping;
Result.SourceColumnName := ASourceColumnName;
Result.DatSColumnName := ADatSColumnName;
Result.UpdateColumnName := AUpdateColumnName;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMappings.Find(const AColumn: TFDPhysMappingName): Integer;
var
i: Integer;
begin
Result := -1;
for i := 0 to Count - 1 do
if Items[i].MatchRecordSetColumn(AColumn) then begin
Result := i;
Exit;
end;
end;
{-------------------------------------------------------------------------------}
function TFDDAptColumnMappings.Lookup(const AColumn: TFDPhysMappingName): TFDDAptColumnMapping;
var
i: Integer;
begin
i := Find(AColumn);
if i <> -1 then
Result := Items[i]
else
Result := nil;
end;
{-------------------------------------------------------------------------------}
procedure TFDDAptColumnMappings.Remove(const AColumn: TFDPhysMappingName);
var
i: Integer;
begin
i := Find(AColumn);
if i <> -1 then
Delete(i);
end;
end.
|
unit f11_riwayatPeminjaman;
interface
uses
utilitas,
buku_handler,
peminjaman_handler;
{ KAMUS }
var
inp : string;
{ DEKLARASI FUNGSI DAN PROSEDUR }
procedure filter(var data_bersih : tabel_peminjaman; data_kotor : tabel_peminjaman; inputan : string);
procedure cetak(var data_buku : tabel_buku; data_input : tabel_peminjaman);
procedure lihathistory(data_buku :tabel_buku; data_peminjaman : tabel_peminjaman);
function cek_judul(var data_buku : tabel_buku; inp : string) : string;
{ IMPLEMENTASI FUNGSI DAN PROSEDUR }
implementation
procedure filter(var data_bersih : tabel_peminjaman; data_kotor : tabel_peminjaman; inputan : string);
{ DESKRIPSI : Membersihkan data kotor menjadi data bersih sesuai dengan inputan }
{ PARAMETER : data bersih, data kotor, dan inputan yang sesuai }
{ KAMUS LOKAL }
var
i: integer;
{ ALGORITMA }
begin
data_bersih.t[0] := data_kotor.t[0];
data_bersih.sz := data_bersih.sz+1;
for i := 1 to data_kotor.sz-1 do
begin
if((data_kotor.t[i].Username = inputan)) then
begin
data_bersih.t[data_bersih.sz] := data_kotor.t[i];
data_bersih.sz := data_bersih.sz+1;
end;
end;
end;
function cek_judul(var data_buku : tabel_buku; inp : string) : string;
{ DESKRIPSI : Mencari data buku dengan id sesuai dengan inputan }
{ PARAMETER : data buku dan input }
{ RETURN : judul buku }
{ KAMUS LOKAL }
var
i : integer;
{ ALGORITMA }
begin
for i:= 1 to data_buku.sz do
begin
if(inp = data_buku.t[i].ID_Buku) then cek_judul := data_buku.t[i].Judul_Buku
end;
end;
procedure cetak(var data_buku : tabel_buku; data_input : tabel_peminjaman);
{ DESKRIPSI : Mencetak data }
{ PARAMETER : data buku dan input }
{ KAMUS LOKAL }
var
i : integer;
{ ALGORITMA }
begin
for i := 1 to data_input.sz-1 do
begin
writeln(data_input.t[i].tanggal_peminjaman, ' | ', data_input.t[i].ID_Buku, ' | ', cek_judul(data_buku,data_input.t[i].ID_Buku));
end;
end;
procedure lihathistory(data_buku :tabel_buku; data_peminjaman : tabel_peminjaman);
{ DESKRIPSI : Melihat history peminjaman dari pengguna }
{ PARAMETER : data buku dan data peminjaman }
{ KAMUS LOKAL }
var
data_bersih : tabel_peminjaman;
{ ALGORITMA }
begin
write('Masukkan username pengunjung: ');
readln(inp);
data_bersih.sz := 0;
filter(data_bersih, data_peminjaman, inp);
if(data_bersih.sz=1) then writeln('Tidak ada peminjaman oleh user ini.')
else cetak(data_buku, data_bersih);
end;
end.
|
(***********************************************************)
(* xPLRFX *)
(* part of Digital Home Server project *)
(* http://www.digitalhomeserver.net *)
(* info@digitalhomeserver.net *)
(***********************************************************)
unit uxPLRFX;
interface
Uses uxPLRFXConst, u_xPL_Message, uxPLRFXMessages,
uxPLRFX_0x10,
uxPLRFX_0x11,
uxPLRFX_0x14,
uxPLRFX_0x15,
uxPLRFX_0x18,
uxPLRFX_0x19,
uxPLRFX_0x20,
uxPLRFX_0x28,
uxPLRFX_0x50,
uxPLRFX_0x51,
uxPLRFX_0x52,
uxPLRFX_0x53,
uxPLRFX_0x54,
uxPLRFX_0x55,
uxPLRFX_0x56,
uxPLRFX_0x57,
uxPLRFX_0x58,
uxPLRFX_0x59,
uxPLRFX_0x5A,
uxPLRFX_0x5B,
uxPLRFX_0x5D,
uxPLRFX_0x70;
type
TErrorEvent = procedure(ErrorMsg : String) of object;
TLogEvent = procedure(LogMsg : String) of object;
TxPLRFX = class
private
public
OnError : TErrorEvent;
OnRFXxPLLog : TLogEvent;
OnxPLRFXLog : TLogEvent;
constructor Create;
destructor Destroy; override;
function RFX2xPL(Buffer : BytesArray; xPLMessages : TxPLRFXMessages) : String;
procedure xPL2RFX(xPLMessage : TxPLMessage; var Buffer : BytesArray);
end;
implementation
Uses SysUtils;
constructor TxPLRFX.Create;
begin
inherited Create;
end;
function TxPLRFX.RFX2xPL(Buffer: BytesArray; xPLMessages : TxPLRFXMessages) : String;
var
LogString : String;
begin
LogString := '';
case Buffer[1] of // message type is in byte 2
$10 : begin
uxPLRFX_0x10.RFX2xPL(Buffer, xPLMessages);
LogString := x10_DESCRIPTION;
end;
$11 : begin
uxPLRFX_0x11.RFX2xPL(Buffer, xPLMessages);
LogString := x11_DESCRIPTION;
end;
$12 : begin
LogString := 'Not yet implemented';
end;
$13 : begin
LogString := 'Not yet implemented';
end;
$14 : begin
uxPLRFX_0x14.RFX2xPL(Buffer, xPLMessages);
LogString := x14_DESCRIPTION;
end;
$15 : begin
uxPLRFX_0x15.RFX2xPL(Buffer, xPLMessages);
LogString := x15_DESCRIPTION;
end;
$19 : begin
uxPLRFX_0x19.RFX2xPL(Buffer, xPLMessages);
LogString := x19_DESCRIPTION;
end;
$20 : begin
uxPLRFX_0x20.RFX2xPL(Buffer, xPLMessages);
LogString := x20_DESCRIPTION;
end;
$28 : begin
uxPLRFX_0x28.RFX2xPL(Buffer, xPLMessages);
LogString := x28_DESCRIPTION;
end;
$30 : begin
LogString := 'Not yet implemented';
end;
$50 : begin
uxPLRFX_0x50.RFX2xPL(Buffer, xPLMessages);
LogString := x50_DESCRIPTION;
end;
$51 : begin
uxPLRFX_0x51.RFX2xPL(Buffer, xPLMessages);
LogString := x51_DESCRIPTION;
end;
$52 : begin
uxPLRFX_0x52.RFX2xPL(Buffer, xPLMessages);
LogString := x52_DESCRIPTION;
end;
$53 : begin
uxPLRFX_0x53.RFX2xPL(Buffer, xPLMessages);
LogString := x53_DESCRIPTION;
end;
$54 : begin
uxPLRFX_0x54.RFX2xPL(Buffer, xPLMessages);
LogString := x54_DESCRIPTION;
end;
$55 : begin
uxPLRFX_0x55.RFX2xPL(Buffer, xPLMessages);
LogString := x55_DESCRIPTION;
end;
$56 : begin
uxPLRFX_0x56.RFX2xPL(Buffer, xPLMessages);
LogString := x56_DESCRIPTION;
end;
$57 : begin
uxPLRFX_0x57.RFX2xPL(Buffer, xPLMessages);
LogString := x57_DESCRIPTION;
end;
$58 : begin
uxPLRFX_0x58.RFX2xPL(Buffer, xPLMessages);
LogString := x58_DESCRIPTION;
end;
$59 : begin
uxPLRFX_0x59.RFX2xPL(Buffer, xPLMessages);
LogString := x59_DESCRIPTION;
end;
$5A : begin
uxPLRFX_0x5A.RFX2xPL(Buffer, xPLMessages);
LogString := x5A_DESCRIPTION;
end;
$5B : begin
uxPLRFX_0x5B.RFX2xPL(Buffer, xPLMessages);
LogString := x5B_DESCRIPTION;
end;
$5D : begin
uxPLRFX_0x5D.RFX2xPL(Buffer, xPLMessages);
LogString := x5D_DESCRIPTION;
end;
$70 : begin
uxPLRFX_0x70.RFX2xPL(Buffer, xPLMessages);
LogString := x70_DESCRIPTION;
end;
$71 : begin
LogString := 'Not yet implemented';
end;
$72 : begin
LogString := 'Not yet implemented';
end
else
Raise Exception.Create('Unknown code');
end;
Result := LogString;
end;
procedure TxPLRFX.xPL2RFX(xPLMessage: TxPLMessage; var Buffer: BytesArray);
begin
// Determine which hardware is addressed
// 0x10 - Lighting1
if (CompareText(xPLMessage.schema.RawxPL,'x10.basic') = 0) and
((xPLMessage.Body.Strings.IndexOfName('protocol') < 0) or
(xPLMessage.Body.Strings.IndexOf('protocol=arc') > -1)) then
uxPLRFX_0x10.xPL2RFX(xPLMessage,Buffer) else
// 0x11 - Lighting2
if (CompareText(xPLMessage.schema.RawxPL,'ac.basic') = 0) and
((xPLMessage.Body.Strings.IndexOfName('protocol') < 0) or
(xPLMessage.Body.Strings.IndexOf('protocol=homeasyeu') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=anslut') > -1)) then
uxPLRFX_0x11.xPL2RFX(xPLMessage, Buffer) else
// 0x14 - Lightning5
if (CompareText(xPLMessage.schema.RawxPL,'ac.basic') = 0) and
((xPLMessage.Body.Strings.IndexOfName('protocol') < 0) or
(xPLMessage.Body.Strings.IndexOf('protocol=lwrf') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=emw100') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=bbsb') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=rsl') > -1)) then
uxPLRFX_0x11.xPL2RFX(xPLMessage, Buffer) else
// 0x15 - Lightning6
if (CompareText(xPLMessage.schema.RawxPL,'x10.basic') = 0) and
(xPLMessage.Body.Strings.IndexOf('protocol=blyss') > -1) then
uxPLRFX_0x15.xPL2RFX(xPLMessage,Buffer) else
// 0x18 - Curtain1
if (CompareText(xPLMessage.schema.RawxPL,'x10.basic') = 0) and
(xPLMessage.Body.Strings.IndexOf('protocol=harrison') > -1) then
uxPLRFX_0x18.xPL2RFX(xPLMessage,Buffer) else
// 0x19 - Blinds1
if (CompareText(xPLMessage.schema.RawxPL,'control.basic') = 0) and
((xPLMessage.Body.Strings.IndexOf('protocol=blinds0') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=blinds1') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=blinds2') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=blinds3') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=blinds4') > -1) or
(xPLMessage.Body.Strings.IndexOf('protocol=blinds5') > -1)) then
uxPLRFX_0x19.xPL2RFX(xPLMessage,Buffer) else
// 0x20 - Security1
if (CompareText(xPLMessage.schema.RawxPL,'x10.security') = 0) then
uxPLRFX_0x20.xPL2RFX(xPLMessage,Buffer) else
// 0x28 - Camera1
if (CompareText(xPLMessage.schema.RawxPL,'control.basic') = 0) and
(xPLMessage.Body.Strings.IndexOf('protocol=ninja') > -1) then
uxPLRFX_0x28.xPL2RFX(xPLMessage,Buffer)
else
Raise Exception.Create('Unknown message');
end;
destructor TxPLRFX.Destroy;
begin
end;
end.
|
unit uFrmWorkerClassEdit;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, DBClient,
uFrmModal, cxGraphics, cxLookAndFeels, cxLookAndFeelPainters, Menus,
cxControls, cxContainer, cxEdit, dxSkinsCore, dxSkinsDefaultPainters, cxMemo,
cxTextEdit, StdCtrls, cxButtons, ExtCtrls, ActnList;
type
TFrmWorkerClassEdit = class(TFrmModal)
lbl1: TLabel;
lbl2: TLabel;
lbl3: TLabel;
EdtClassID: TcxTextEdit;
EdtClassName: TcxTextEdit;
edtRemark: TcxTextEdit;
procedure btnOkClick(Sender: TObject);
procedure FormShow(Sender: TObject);
private
FDataSet: TClientDataSet;
FAction: string;
FGuid: string;
function BeforeExecute: Boolean;
public
class function ShowWorkerClassEdit(DataSet: TClientDataSet; AAction: string): Boolean;
end;
var
FrmWorkerClassEdit: TFrmWorkerClassEdit;
implementation
uses UDBAccess, UMsgBox, UPubFunLib;
{$R *.dfm}
{ TFrmRoleEdit }
function TFrmWorkerClassEdit.BeforeExecute: Boolean;
const
cCheckIDExistsSQL = 'select * from WorkerClass where ClassID=''%s''';
var
lStrSql: string;
iResult: Integer;
begin
Result := False;
if Trim(edtClassID.Text) = '' then
begin
edtClassID.SetFocus;
ShowMsg('角色编码不能为空！');
Exit;
end;
if Trim(edtClassName.Text) = '' then
begin
edtClassName.SetFocus;
ShowMsg('角色名称不能为空！');
Exit;
end;
if FAction = 'Append' then
lStrSql := Format(cCheckIDExistsSQL, [Trim(edtClassID.Text)])
else
lStrSql := Format(cCheckIDExistsSQL + ' and Guid <> ''%s''', [Trim(edtClassID.Text), FGuid]);
iResult := DBAccess.DataSetIsEmpty(lStrSql);
if iResult = -1 then
begin
ShowMsg('获取角色编码是否重复失败！');
Exit;
end;
if iResult = 0 then
begin
ShowMsg('当前角色编码已经存在，请重新输入！');
Exit;
end;
Result := True;
end;
procedure TFrmWorkerClassEdit.btnOkClick(Sender: TObject);
begin
if not BeforeExecute then Exit;
if FAction = 'Append' then
begin
FDataSet.Append;
FDataSet.FindField('Guid').AsString := CreateGuid;
end
else
FDataSet.Edit;
FDataSet.FindField('ClassID').AsString := Trim(edtClassID.Text);
FDataSet.FindField('ClassName').AsString := Trim(edtClassName.Text);
FDataSet.FindField('Remark').AsString := Trim(edtRemark.Text);
FDataSet.Post;
if FDataSet.ChangeCount > 0 then
begin
if DBAccess.ApplyUpdates('WorkerClass', FDataSet.Delta) then
begin
FDataSet.MergeChangeLog;
end
else
begin
FDataSet.CancelUpdates;
ShowMsg('保存角色信息失败，请重新操作！');
Exit;
end;
end;
ModalResult := mrOk;
end;
procedure TFrmWorkerClassEdit.FormShow(Sender: TObject);
begin
inherited;
if FAction = 'Edit' then
begin
with FDataSet do
begin
edtClassID.Text := FindField('ClassID').AsString;
edtClassName.Text := FindField('ClassName').AsString;
edtRemark.Text := FindField('Remark').AsString;
FGuid := FindField('Guid').AsString;
end;
end;
end;
class function TFrmWorkerClassEdit.ShowWorkerClassEdit(DataSet: TClientDataSet;
AAction: string): Boolean;
begin
with TFrmWorkerClassEdit.Create(nil) do
begin
try
FDataSet := DataSet;
FAction := AAction;
Result := ShowModal = mrOk;
finally
Free;
end;
end;
end;
end.
|
unit U_FacturesCheques;
interface
uses U_Element, U_Tableaux;
// cree un tableau avec les numeros de factures de 1 nombre
// chaque numero est present une seule fois
function factures (nombre : CARDINAL) : TABLEAU;
// cree un tableau de cheques a partir du tableau factures dans lequel nb_impayes numeros de factures sont supprimes
function cheques (factures : TABLEAU; nb_impayes : CARDINAL) : TABLEAU;
implementation
procedure echanger (var t : TABLEAU; const i, j : CARDINAL);
var
tmp : ELEMENT;
begin
tmp := t[i];
t[i] := t[j];
t[j] := tmp;
end {echanger};
procedure melanger (var t : TABLEAU);
var
i, j : CARDINAL;
begin
for i := low(t) to high(t) do begin
j := random(high(t));
echanger(t,i,j);
end {for};
end {melanger};
function factures (nombre : CARDINAL) : TABLEAU;
var
t : TABLEAU;
begin
t := tableauCroissant(nombre);
melanger(t);
factures := t;
end {factures};
function cheques (factures : TABLEAU; nb_impayes : CARDINAL) : TABLEAU;
var
indices : TABLEAU;
i : CARDINAL;
begin
indices := tableauCroissant(length(factures) - nb_impayes);
melanger(indices);
for i := low(indices) to high(indices) do
indices[i] := factures[indices[i]];
cheques := indices;
end {cheques};
initialization
randomize;
end {U_FacturesCheques}. |
unit oPKIEncryptionCertificate;
interface
uses
System.Classes,
System.SysUtils,
Winapi.Windows,
wcrypt2,
WinSCard,
oPKIEncryption
{oPKIEncryptionEx};
type
TPKIEncryptionCertificate = class(TObject)
private
fCertFriendlyName: string;
fCertSerialNumber: string;
fCertNameUPNType: string;
fCertNameEMailType: string;
fCertIntendedPurposes: integer;
fCertChainInfoStatus: integer;
fCertChainSize: integer;
fCertChainCount: integer;
fCertChainErrorStatus: integer;
function open(aCertificate: PCCERT_CONTEXT): boolean;
function getCertFriendlyName: string;
function getCertSerialNumber: string;
function getCertNameEMailType: string;
function getCertNameUPNType: string;
// Chain Info
function getCertChainInfoStatus: integer;
function getCertChainSize: integer;
function getCertChainCount: integer;
function getCertTrustHasExactMatchIssuer: boolean;
function getCertTrustHasKeyMatchIssuer: boolean;
function getCertTrustHasNameMatchIssuer: boolean;
function getCertTrustIsSelfSigned: boolean;
function getCertTrustHasPreferredIssuer: boolean;
function getCertTrustHasIssuanceChainPolicy: boolean;
function getCertTrustHasValidNameConstraints: boolean;
function getCertTrustIsComplexChain: boolean;
// Chain Error
function getCertChainErrorStatus: integer;
function getCertTrustNoError: boolean;
function getCertTrustIsNotTimeValid: boolean;
function getCertTrustIsNotTimeNested: boolean;
function getCertTrustIsRevoked: boolean;
function getCertTrustIsNotSignatureValid: boolean;
function getCertTrustIsNotValidForUsage: boolean;
function getCertTrustIsUntrustedRoot: boolean;
function getCertTrustRevocationStatusUnknown: boolean;
function getCertTrustIsCyclic: boolean;
function getCertTrustIsPartialChain: boolean;
function getCertTrustCTLIsNotTimeValid: boolean;
function getCertTrustCTLIsNotSignatureValid: boolean;
function getCertTrustCTLIsNotValidForUsage: boolean;
// Intended Purposes
function getCertIntendedPurposes: integer;
function getCertDataEnciphermentKeyUsage: boolean;
function getCertDigitalSignatureKeyUsage: boolean;
function getCertKeyAgreementKeyUsage: boolean;
function getCertKeyCertSignKeyUsage: boolean;
function getCertKeyEnciphermentKeyUsage: boolean;
function getCertNonRepudiationKeyUsage: boolean;
function getCertOfflineCRLSignKeyUsage: boolean;
function getToString: string;
public
constructor Create(aCertificate: PCCERT_CONTEXT);
destructor Destroy; override;
property CertFriendlyName: string read getCertFriendlyName;
property CertSerialNum: string read getCertSerialNumber;
property CertNameUPNType: string read getCertNameUPNType;
property CertNameEMailType: string read getCertNameEMailType;
property CertIntendedPurposes: integer read getCertIntendedPurposes;
property CertDigitalSignatureKeyUsage: boolean read getCertDigitalSignatureKeyUsage;
property CertNonRepudiationKeyUsage: boolean read getCertNonRepudiationKeyUsage;
property CertKeyEnciphermentKeyUsage: boolean read getCertKeyEnciphermentKeyUsage;
property CertDataEnciphermentKeyUsage: boolean read getCertDataEnciphermentKeyUsage;
property CertKeyAgreementKeyUsage: boolean read getCertKeyAgreementKeyUsage;
property CertKeyCertSignKeyUsage: boolean read getCertKeyCertSignKeyUsage;
property CertOfflineCRLSignKeyUsage: boolean read getCertOfflineCRLSignKeyUsage;
property CertChainInfoStatus: integer read getCertChainInfoStatus;
property CertChainSize: integer read getCertChainSize;
property CertChainCount: integer read getCertChainCount;
property CertTrustHasExactMatchIssuer: boolean read getCertTrustHasExactMatchIssuer;
property CertTrustHasKeyMatchIssuer: boolean read getCertTrustHasKeyMatchIssuer;
property CertTrustHasNameMatchIssuer: boolean read getCertTrustHasNameMatchIssuer;
property CertTrustIsSelfSigned: boolean read getCertTrustIsSelfSigned;
property CertTrustHasPreferredIssuer: boolean read getCertTrustHasPreferredIssuer;
property CertTrustHasIssuanceChainPolicy: boolean read getCertTrustHasIssuanceChainPolicy;
property CertTrustHasValidNameConstraints: boolean read getCertTrustHasValidNameConstraints;
property CertTrustIsComplexChain: boolean read getCertTrustIsComplexChain;
property CertChainErrorStatus: integer read getCertChainErrorStatus;
property CertTrustNoError: boolean read getCertTrustNoError;
property CertTrustIsNotTimeValid: boolean read getCertTrustIsNotTimeValid;
property CertTrustIsNotTimeNested: boolean read getCertTrustIsNotTimeNested;
property CertTrustIsRevoked: boolean read getCertTrustIsRevoked;
property CertTrustIsNotSignatureValid: boolean read getCertTrustIsNotSignatureValid;
property CertTrustIsNotValidForUsage: boolean read getCertTrustIsNotValidForUsage;
property CertTrustIsUntrustedRoot: boolean read getCertTrustIsUntrustedRoot;
property CertTrustRevocationStatusUnknown: boolean read getCertTrustRevocationStatusUnknown;
property CertTrustIsCyclic: boolean read getCertTrustIsCyclic;
property CertTrustIsPartialChain: boolean read getCertTrustIsPartialChain;
property CertTrustCTLIsNotTimeValid: boolean read getCertTrustCTLIsNotTimeValid;
property CertTrustCTLIsNotSignatureValid: boolean read getCertTrustCTLIsNotSignatureValid;
property CertTrustCTLIsNotValidForUsage: boolean read getCertTrustCTLIsNotValidForUsage;
property AsString: string read getToString;
end;
implementation
{ TPKIEncryptionCertificate }
constructor TPKIEncryptionCertificate.Create(aCertificate: PCCERT_CONTEXT);
begin
inherited Create;
fCertSerialNumber := '';
fCertNameUPNType := '';
fCertNameEMailType := '';
fCertIntendedPurposes := 0;
fCertChainInfoStatus := 0;
fCertChainSize := 0;
fCertChainCount := 0;
fCertChainErrorStatus := 0;
try
open(aCertificate);
except
// Set an Error Status Here
end;
end;
destructor TPKIEncryptionCertificate.Destroy;
begin
inherited;
end;
function TPKIEncryptionCertificate.getCertFriendlyName: string;
begin
Result := fCertFriendlyName;
end;
function TPKIEncryptionCertificate.getCertSerialNumber: string;
begin
Result := fCertSerialNumber;
end;
function TPKIEncryptionCertificate.getCertNameEMailType: string;
begin
Result := fCertNameEMailType;
end;
function TPKIEncryptionCertificate.getCertNameUPNType: string;
begin
Result := fCertNameUPNType;
end;
function TPKIEncryptionCertificate.getCertDataEnciphermentKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_DATA_ENCIPHERMENT_KEY_USAGE) = CERT_DATA_ENCIPHERMENT_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertDigitalSignatureKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_DIGITAL_SIGNATURE_KEY_USAGE) = CERT_DIGITAL_SIGNATURE_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertKeyAgreementKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_KEY_AGREEMENT_KEY_USAGE) = CERT_KEY_AGREEMENT_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertKeyCertSignKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_KEY_CERT_SIGN_KEY_USAGE) = CERT_KEY_CERT_SIGN_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertKeyEnciphermentKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_KEY_ENCIPHERMENT_KEY_USAGE) = CERT_KEY_ENCIPHERMENT_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertNonRepudiationKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_NON_REPUDIATION_KEY_USAGE) = CERT_NON_REPUDIATION_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertOfflineCRLSignKeyUsage: boolean;
begin
Result := (fCertIntendedPurposes and CERT_OFFLINE_CRL_SIGN_KEY_USAGE) = CERT_OFFLINE_CRL_SIGN_KEY_USAGE;
end;
function TPKIEncryptionCertificate.getCertTrustCTLIsNotSignatureValid: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_CTL_IS_NOT_SIGNATURE_VALID) = CERT_TRUST_CTL_IS_NOT_SIGNATURE_VALID;
end;
function TPKIEncryptionCertificate.getCertTrustCTLIsNotTimeValid: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_CTL_IS_NOT_TIME_VALID) = CERT_TRUST_CTL_IS_NOT_TIME_VALID;
end;
function TPKIEncryptionCertificate.getCertTrustCTLIsNotValidForUsage: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_CTL_IS_NOT_VALID_FOR_USAGE) = CERT_TRUST_CTL_IS_NOT_VALID_FOR_USAGE;
end;
function TPKIEncryptionCertificate.getCertTrustHasExactMatchIssuer: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_EXACT_MATCH_ISSUER) = CERT_TRUST_HAS_EXACT_MATCH_ISSUER;
end;
function TPKIEncryptionCertificate.getCertTrustHasIssuanceChainPolicy: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_ISSUANCE_CHAIN_POLICY) = CERT_TRUST_HAS_ISSUANCE_CHAIN_POLICY;
end;
function TPKIEncryptionCertificate.getCertTrustHasKeyMatchIssuer: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_KEY_MATCH_ISSUER) = CERT_TRUST_HAS_KEY_MATCH_ISSUER;
end;
function TPKIEncryptionCertificate.getCertTrustHasNameMatchIssuer: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_NAME_MATCH_ISSUER) = CERT_TRUST_HAS_NAME_MATCH_ISSUER;
end;
function TPKIEncryptionCertificate.getCertTrustHasPreferredIssuer: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_PREFERRED_ISSUER) = CERT_TRUST_HAS_PREFERRED_ISSUER;
end;
function TPKIEncryptionCertificate.getCertTrustHasValidNameConstraints: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_HAS_VALID_NAME_CONSTRAINTS) = CERT_TRUST_HAS_VALID_NAME_CONSTRAINTS;
end;
function TPKIEncryptionCertificate.getCertTrustIsComplexChain: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_IS_COMPLEX_CHAIN) = CERT_TRUST_IS_COMPLEX_CHAIN;
end;
function TPKIEncryptionCertificate.getCertTrustIsCyclic: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_CYCLIC) = CERT_TRUST_IS_CYCLIC;
end;
function TPKIEncryptionCertificate.getCertTrustIsNotSignatureValid: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_NOT_SIGNATURE_VALID) = CERT_TRUST_IS_NOT_SIGNATURE_VALID;
end;
function TPKIEncryptionCertificate.getCertTrustIsNotTimeNested: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_NOT_TIME_NESTED) = CERT_TRUST_IS_NOT_TIME_NESTED;
end;
function TPKIEncryptionCertificate.getCertTrustIsNotTimeValid: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_NOT_TIME_VALID) = CERT_TRUST_IS_NOT_TIME_VALID;
end;
function TPKIEncryptionCertificate.getCertTrustIsNotValidForUsage: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_NOT_VALID_FOR_USAGE) = CERT_TRUST_IS_NOT_VALID_FOR_USAGE;
end;
function TPKIEncryptionCertificate.getCertTrustIsPartialChain: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_PARTIAL_CHAIN) = CERT_TRUST_IS_PARTIAL_CHAIN;
end;
function TPKIEncryptionCertificate.getCertTrustIsRevoked: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_REVOKED) = CERT_TRUST_IS_REVOKED;
end;
function TPKIEncryptionCertificate.getCertTrustIsSelfSigned: boolean;
begin
Result := (fCertChainInfoStatus and CERT_TRUST_IS_SELF_SIGNED) = CERT_TRUST_IS_SELF_SIGNED;
end;
function TPKIEncryptionCertificate.getCertTrustIsUntrustedRoot: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_IS_UNTRUSTED_ROOT) = CERT_TRUST_IS_UNTRUSTED_ROOT;
end;
function TPKIEncryptionCertificate.getCertTrustNoError: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_NO_ERROR) = CERT_TRUST_NO_ERROR;
end;
function TPKIEncryptionCertificate.getCertTrustRevocationStatusUnknown: boolean;
begin
Result := (fCertChainErrorStatus and CERT_TRUST_REVOCATION_STATUS_UNKNOWN) = CERT_TRUST_REVOCATION_STATUS_UNKNOWN;
end;
function TPKIEncryptionCertificate.getCertChainCount: integer;
begin
Result := fCertChainCount;
end;
function TPKIEncryptionCertificate.getCertChainErrorStatus: integer;
begin
Result := fCertChainErrorStatus;
end;
function TPKIEncryptionCertificate.getCertChainInfoStatus: integer;
begin
Result := fCertChainInfoStatus;
end;
function TPKIEncryptionCertificate.getCertChainSize: integer;
begin
Result := fCertChainSize
end;
function TPKIEncryptionCertificate.getCertIntendedPurposes: integer;
begin
Result := fCertIntendedPurposes;
end;
function TPKIEncryptionCertificate.getToString: string;
var
aResult: TStringList;
procedure Add(aValue: string); overload;
begin
aResult.Add(aValue);
end;
procedure Add(aProperty, aValue: string); overload;
begin
Add(Format('%s=%s', [aProperty, aValue]));
end;
procedure Add(aProperty: string; aValue: integer); overload;
begin
Add(aProperty, IntToStr(aValue));
end;
procedure Add(aProperty: string; aValue: boolean); overload;
begin
Add(aProperty, BoolToStr(aValue, True));
end;
begin
aResult := TStringList.Create;
try
Add('TPKIEncryptionCertificate');
Add('Serial Number', fCertSerialNumber);
Add('Intended Purposes', fCertIntendedPurposes);
Add('CERT_DATA_ENCIPHERMENT_KEY_USAGE', getCertDataEnciphermentKeyUsage);
Add('CERT_DIGITAL_SIGNATURE_KEY_USAGE', getCertDigitalSignatureKeyUsage);
Add('CERT_KEY_AGREEMENT_KEY_USAGE', getCertKeyAgreementKeyUsage);
Add('CERT_KEY_CERT_SIGN_KEY_USAGE', getCertKeyCertSignKeyUsage);
Add('CERT_KEY_ENCIPHERMENT_KEY_USAGE', getCertKeyEnciphermentKeyUsage);
Add('CERT_NON_REPUDIATION_KEY_USAGE', getCertNonRepudiationKeyUsage);
Add('CERT_OFFLINE_CLR_SIGN_KEY_USAGE', getCertOfflineCRLSignKeyUsage);
Add('CERT_NAME_EMAIL_TYPE', getCertNameEMailType);
Add('CERT_NAME_UPN_TYPE', getCertNameUPNType);
Add('');
Add('Certificate Chain Status', getCertChainInfoStatus);
Add('Certificate Chain Size', getCertChainSize);
Add('Certificate Chain Count', getCertChainCount);
Add('CERT_TRUST_HAS_EXACT_MATCH_ISSUER', getCertTrustHasExactMatchIssuer);
Add('CERT_TRUST_HAS_KEY_MATCH_ISSUER', getCertTrustHasKeyMatchIssuer);
Add('CERT_TRUST_HAS_NAME_MATCH_ISSUER', getCertTrustHasNameMatchIssuer);
Add('CERT_TRUST_IS_SELF_SIGNED', getCertTrustIsSelfSigned);
Add('CERT_TRUST_HAS_PREFERRED_ISSUER', getCertTrustHasPreferredIssuer);
Add('CERT_TRUST_HAS_ISSUANCE_CHAIN_POLICY', getCertTrustHasIssuanceChainPolicy);
Add('CERT_TRUST_HAS_VALID_NAME_CONSTRAINTS', getCertTrustHasValidNameConstraints);
Add('CERT_TRUST_IS_COMPLEX_CHAIN', getCertTrustIsComplexChain);
Add('');
Add('Certificate Error Status', fCertChainErrorStatus);
Result := aResult.Text;
finally
FreeAndNil(aResult);
end;
end;
function TPKIEncryptionCertificate.open(aCertificate: PCCERT_CONTEXT): boolean;
var
aByte: Byte;
aPByte: PByte;
aPBArray: PByteArray;
aDWord: DWORD;
aCardinal: Cardinal;
i: integer;
aChainEngine: HCERTCHAINENGINE;
aChainContext: PCCERT_CHAIN_CONTEXT;
aEnhkeyUsage: CERT_ENHKEY_USAGE;
aCertUsage: CERT_USAGE_MATCH;
aChainPara: CERT_CHAIN_PARA;
aChainConfig: CERT_CHAIN_ENGINE_CONFIG;
begin
Result := False;
try
try
// Get the friendly name
aCardinal := CertGetNameString(aCertificate, CERT_NAME_SIMPLE_DISPLAY_TYPE, 0, 0, nil, 0);
SetLength(fCertFriendlyName, aCardinal);
if (CertGetNameString(aCertificate, CERT_NAME_SIMPLE_DISPLAY_TYPE, 0, 0, PWideChar(fCertFriendlyName), aCardinal) > 1) then
begin
while Copy(fCertFriendlyName, Length(fCertFriendlyName), 1) = #0 do
fCertFriendlyName := Copy(fCertFriendlyName, 1, Length(fCertFriendlyName) - 1);
end
else
raise Exception.Create('Error in CertGetNameString');
// Get the Cert Serial Number and convert to Hex
aDWord := aCertificate.pCertInfo.SerialNumber.CbData;
aPBArray := PByteArray(aCertificate.pCertInfo.SerialNumber.PbData);
fCertSerialNumber := '';
for i := aDWord - 1 downto 0 do
begin
fCertSerialNumber := fCertSerialNumber + IntToHex(Byte(aPBArray[i]), 2);
if i > 0 then
fCertSerialNumber := fCertSerialNumber + ' ';
end;
// Get the intended purpose(s) of this cert
aPByte := @aByte;
if CertGetIntendedKeyUsage(PKI_ENCODING_TYPE, aCertificate.pCertInfo, aPByte, 1) then
fCertIntendedPurposes := aByte
else
fCertIntendedPurposes := 0;
// Crack into the chains
aEnhkeyUsage.CUsageIdentifier := 0;
aEnhkeyUsage.RgpszUsageIdentifier := nil;
aCertUsage.DwType := USAGE_MATCH_TYPE_AND;
aCertUsage.Usage := aEnhkeyUsage;
aChainPara.CbSize := Sizeof(aChainPara);
aChainPara.RequestedUsage := aCertUsage;
aChainConfig.CbSize := Sizeof(CERT_CHAIN_ENGINE_CONFIG);
aChainConfig.HRestrictedRoot := nil;
aChainConfig.HRestrictedTrust := nil;
aChainConfig.HRestrictedOther := nil;
aChainConfig.CAdditionalStore := 0;
aChainConfig.RghAdditionalStore := nil;
aChainConfig.DwFlags := CERT_CHAIN_REVOCATION_CHECK_CHAIN;
aChainConfig.DwUrlRetrievalTimeout := 30000;
aChainConfig.MaximumCachedCertificates := 0;
aChainConfig.CycleDetectionModulus := 0;
// Create the nondefault certificate chain engine
if not CertCreateCertificateChainEngine(@aChainConfig, aChainEngine) then
raise EPKIEncryptionError.Create(getLastSystemError);
// Build a chain using CertGetCertificateChain and the certificate retrieved
if not CertGetCertificateChain(aChainEngine, aCertificate, nil, nil, @aChainPara, CERT_CHAIN_REVOCATION_CHECK_CHAIN, nil, aChainContext) then
raise EPKIEncryptionError.Create(getLastSystemError);
// Load up the chain values
fCertChainSize := aChainContext.CbSize;
fCertChainCount := aChainContext.cChain;
fCertChainErrorStatus := aChainContext.TrustStatus.DwErrorStatus;
fCertChainInfoStatus := aChainContext.TrustStatus.DwInfoStatus;
Result := True;
except
begin
Result := False;
end;
end;
finally
if aChainEngine <> 0 then
CertFreeCertificateChainEngine(aChainEngine);
if aChainContext <> nil then
CertFreeCertificateChain(aChainContext);
end;
end;
end.
|
UNIT QWIKSORT;
interface
{*****************************************************}
{ You must pass parameters to this procedure of type }
{ DataArray; an array with comparable elements }
{ for example }
type
dataitem = integer;
dataarray = array[1..10] of dataitem;
procedure QuickSort(var item : DataArray; count : integer);
(* dynamic sort of opaque type linked list *)
TYPE
LastProc = FUNCTION (RecordPtr :POINTER) : POINTER;
NextProc = FUNCTION (RecordPtr :POINTER) : POINTER;
GetItemProc = FUNCTION (RecordPtr :POINTER) : POINTER;
SetItemProc = PROCEDURE (VAR RecordPtr :POINTER;ItemPtr : POINTER);
procedure DynaSort( list : POINTER;
Next : NextProc;
GetItem : GetItemProc;
SetItem : SetItemProc;
ItemSize : WORD);
implementation
procedure QuickSort(var item : DataArray; count : integer);
procedure QS(l,r :integer; var it : DataArray);
var
i,j : integer;
x,y : Dataitem;
begin
i :=l ; j := r;
x := it[(l+r) div 2];
repeat
while it[i] < x do i := i + 1;
while x < it[j] do j := j - 1;
if i <= j then
begin
y := it[i];
it[i] := it[j];
it[j] := y;
i := i+1; j:= j-1;
end;
until i > j;
if l < j then qs(l,j,it);
if l < r then qs(i,r,it);
end; {qs}
begin
qs(1,count,item);
end {qwiksort};
(* +++++++++++++++++++++++++++++++++++++++++++ *)
procedure DynaSort( list : POINTER;
Next : NextProc;
GetItem : GetItemProc;
SetItem : SetItemProc;
ItemSize : WORD);
TYPE
(* not necessarily a string *)
DataItem = string[255];
VAR
ptr1, ptr2, ptr3 : POINTER;
item1, item2, item3 : ^DataItem;
BEGIN
ptr1 := list;
WHILE Next(ptr1) <> NIL DO
BEGIN
ptr2 := Next(ptr1);
ptr3 := ptr1;
REPEAT
BEGIN
item2 := GetItem(ptr2);
item3 := GetItem(ptr3);
If item2^ < item3^ THEN
ptr3 := ptr2;
ptr2 := Next(ptr2);
END
UNTIL ptr2 = NIL;
IF ptr3 <> ptr1 THEN
BEGIN
item1 := GetItem(ptr1);
SetItem(ptr1,GetItem(ptr3));
SetItem(ptr3,item1);
END;
ptr1 := Next(ptr1);
END;
END {DynaQuickSort};
BEGIN
END {QWIKSORT}.
|
unit lib_acesso;
interface
uses IdHashMessageDigest, Windows, Messages, sysutils, lib_db, TypInfo, lib_mensagem;
type
TPermissoes = (TpmExcluir, TpmInserir, TpmEditar, TpmVisualizar, TpmProcessar);
TTipoOperacao = (TopAdicionar, TopExcluir);
Tcriptografia = class
public
class function MD5(const texto : string) : string;
end;
TAcesso = class
class procedure AddRotina(const modulo, descricao : String; const visivel : Boolean);
class procedure AddRotinas;
end;
TAcessoUsuario = class
private
FUsuario : TObjetoDB;
FDbPermissao : TObjetoDB;
FdbRotina : TObjetoDB;
FUsuarioLogin : String;
FIdUsuario : Integer;
function NomeUsuarioVmsis: String;
function SenhaUsuarioVmsis: String;
function EhAdministrador(const senha: String): Boolean;
procedure AdicionarOuRemoverPermissao(const modulo : String; permissao : TPermissoes; AdicionarRemover: TTipoOperacao);
public
property Usuario : String read FUsuarioLogin;
property IdUsuario : Integer read FIdUsuario;
procedure AddPermissao(const modulo : String; permissao : TPermissoes);
procedure RemoverPermissao(const modulo : String; permissao : TPermissoes);
function PossuiPermissao(const modulo : String; permissao : TPermissoes) : Boolean;
procedure BloquearUsuarioSemPermissao(const modulo : String; permissao : TPermissoes);
function Autenticado(const modulo : String; permissao : TPermissoes) : Boolean;
function Logado(const senha : string) : boolean;
constructor create(usuario : String);
destructor destroy; override;
end;
const
MODULO_GAVETA = 'gaveta';
MODULO_SINCRONIZAR = 'sincronizar';
MODULO_CONTROLE_ACESSO = 'controle_acesso';
MODULO_VENDA = 'venda';
MODULO_ESTOQUE_ENTRADA = 'estoque_entrada';
MODULO_ESTOQUE_SAIDA = 'estoque_saida';
MODULO_CLIENTE = 'cliente';
MODULO_FORNECEDOR = 'fornecedor';
implementation
uses IdHash, autenticacao;
{ Tcriptografia }
class function Tcriptografia.MD5(const texto: string): string;
var
imd5 : TIdHashMessageDigest5;
begin
imd5 := TIdHashMessageDigest5.Create;
try
Result := imd5.AsHex(imd5.HashValue(texto));
finally
FreeAndNil(imd5);
end;
end;
{ TAcesso }
class procedure TAcesso.AddRotina(const modulo, descricao: String;
const visivel: Boolean);
var
tbRotina : TObjetoDB;
begin
tbRotina := TObjetoDB.create('rotina');
try
tbRotina.AddParametro('modulo', modulo);
tbRotina.Select(['id']);
if tbRotina.IsEmpty then
begin
tbRotina.AddParametro('descricao', descricao);
if visivel then
tbRotina.AddParametro('visivel', 'S')
else
tbRotina.AddParametro('visivel', 'N');
tbRotina.Insert;
end;
finally
FreeAndNil(tbRotina);
end;
end;
class procedure TAcesso.AddRotinas;
begin
AddRotina(MODULO_GAVETA, 'Abrir gaveta', False);
AddRotina(MODULO_SINCRONIZAR, 'Configurar sincronizaçao', True);
AddRotina(MODULO_CONTROLE_ACESSO, 'Controle de acessos', True);
AddRotina(MODULO_VENDA, 'Vendas - PDV', True);
AddRotina(MODULO_ESTOQUE_ENTRADA, 'Estoque - Entrada', True);
AddRotina(MODULO_ESTOQUE_SAIDA, 'Estoque - Saida', True);
AddRotina(MODULO_CLIENTE, 'Cliente', True);
AddRotina(MODULO_FORNECEDOR, 'Fornecedor', True);
end;
{ TAcessoUsuario }
procedure TAcessoUsuario.AddPermissao(const modulo: String;
permissao: TPermissoes);
begin
AdicionarOuRemoverPermissao(modulo, permissao, TopAdicionar);
end;
procedure TAcessoUsuario.AdicionarOuRemoverPermissao(const modulo: String;
permissao: TPermissoes; AdicionarRemover: TTipoOperacao);
begin
FdbRotina.RemoverTodosParametros;
FdbRotina.AddParametro('modulo', modulo);
FdbRotina.Select(['id']);
if FdbRotina.IsEmpty then
raise Exception.Create('O módulo especificado não existe.' + ' Modulo : ' + modulo);
FDbPermissao.RemoverTodosParametros;
FDbPermissao.AddParametro('descricao', GetEnumName(TypeInfo(TPermissoes), Integer(permissao)));
FDbPermissao.AddParametro('id_rotina', FdbRotina.GetVal('id'));
FDbPermissao.AddParametro('funcionario_id', FUsuario.GetVal('id'));
FDbPermissao.Select(['id']);
if (not FDbPermissao.IsEmpty) and (AdicionarRemover = TopAdicionar) then
Exit;
if AdicionarRemover = TopAdicionar then
FDbPermissao.Insert
else if AdicionarRemover = TopExcluir then
FDbPermissao.Delete;
end;
function TAcessoUsuario.Autenticado(const modulo: String;
permissao: TPermissoes): Boolean;
begin
Result := UsuarioAutenticado(modulo, permissao);
end;
procedure TAcessoUsuario.BloquearUsuarioSemPermissao(const modulo: String;
permissao: TPermissoes);
begin
if not PossuiPermissao(modulo, permissao) then
begin
Aviso(USUARIO_SEM_PERMISSAO);
Abort;
end;
end;
constructor TAcessoUsuario.create(usuario: String);
begin
FUsuario := TObjetoDB.create('funcionario');
FUsuario.AddParametro('usuario', usuario);
FUsuario.Select(['usuario', 'nome', 'id', 'senha']);
if NomeUsuarioVmsis = usuario then
begin
FUsuarioLogin := usuario;
FIdUsuario := -1;
end
else
begin
if(FUsuario.IsEmpty) then
begin
Aviso('Usuário informado não existe.');
Abort;
end;
FUsuarioLogin := FUsuario.GetVal('usuario');
FIdUsuario := FUsuario.GetVal('id');
end;
FDbPermissao := TObjetoDb.create('permusr');
FdbRotina := TObjetoDb.create('rotina');
end;
destructor TAcessoUsuario.destroy;
begin
FreeAndNil(FdbRotina);
FreeAndNil(FdbPermissao);
FreeAndNil(FUsuario);
inherited destroy;
end;
function TAcessoUsuario.EhAdministrador(const senha: String): Boolean;
begin
Result:= (FUsuarioLogin = NomeUsuarioVmsis) and (senha = SenhaUsuarioVmsis);
end;
function TAcessoUsuario.Logado(const senha: string): boolean;
begin
if not (EhAdministrador(senha)) then
Result := (senha = FUsuario.GetVal('senha'))
else
Result:= True;
end;
function TAcessoUsuario.NomeUsuarioVmsis: String;
begin
Result:= 'vmsismaster';
end;
function TAcessoUsuario.PossuiPermissao(const modulo: String;
permissao: TPermissoes): Boolean;
begin
if EhAdministrador(SenhaUsuarioVmsis) then
begin
Result:= True;
Exit;
end;
FdbRotina.RemoverTodosParametros;
FdbRotina.AddParametro('modulo', modulo);
FdbRotina.Select(['id']);
Result := not FdbRotina.IsEmpty;
if not Result then
Exit;
FDbPermissao.RemoverTodosParametros;
FDbPermissao.AddParametro('id_rotina', FdbRotina.GetVal('id'));
FDbPermissao.AddParametro('funcionario_id', FUsuario.GetVal('id'));
FDbPermissao.AddParametro('descricao', GetEnumName(TypeInfo(TPermissoes), Integer(permissao)));
FDbPermissao.Select(['id']);
Result := not FDbPermissao.IsEmpty;
end;
procedure TAcessoUsuario.RemoverPermissao(const modulo: String;
permissao: TPermissoes);
begin
AdicionarOuRemoverPermissao(modulo, permissao, TopExcluir);
end;
function TAcessoUsuario.SenhaUsuarioVmsis: String;
begin
Result:= 'masterVMSIS123v';
end;
end.
|
{*******************************************************}
{ }
{ Borland Delphi Visual Component Library }
{ SOAP Support }
{ }
{ Copyright (c) 2001 Borland Software Corporation }
{ }
{*******************************************************}
unit SOAPEnv;
interface
uses Classes, SysUtils, xmldom, XMLDoc, XMLIntf, OPConvert;
type
TSoapEnvelope = class
public
function MakeEnvelope(Doc: IXMLDocument; Options: TSOAPConvertOptions): IXMLNode;
function MakeHeader(ParentNode: IXMLNode): IXMLNode;
function MakeBody(ParentNode: IXMLNOde): IXMLNode;
function MakeFault(ParentNode: IXMLNOde): IXMLNode;
end;
implementation
uses SOAPConst;
function TSoapEnvelope.MakeEnvelope(Doc: IXMLDocument; Options: TSOAPConvertOptions): IXMLNode;
begin
Result := Doc.CreateNode(SSoapNameSpacePre + ':' + SSoapEnvelope);
Result.DeclareNamespace(SSoapNameSpacePre, SSoapNameSpace);
Result.DeclareNamespace(SXMLSchemaNameSpacePre, XMLSchemaNameSpace);
Result.DeclareNamespace(SXMLSchemaInstNameSpace99Pre, XMLSchemaInstNameSpace);
if not (soDocument in Options) then
Result.DeclareNamespace(SSoapEncodingPre, SSoap11EncodingS5);
Doc.DocumentElement := Result;
end;
function TSoapEnvelope.MakeBody(ParentNode: IXMLNode): IXMLNode;
begin
Result := ParentNode.AddChild(SSoapNameSpacePre + ':' + SSoapBody, SSoapNameSpace);
end;
function TSoapEnvelope.MakeHeader(ParentNode: IXMLNode): IXMLNode;
begin
Result := ParentNode.AddChild(SSoapNameSpacePre + ':' + SSoapHeader, SSoapNameSpace);
end;
function TSoapEnvelope.MakeFault(ParentNode: IXMLNode): IXMLNode;
begin
Result := ParentNode.AddChild(SSoapNameSpacePre + ':' + SSoapFault, SSoapNameSpace);
end;
end.
|
program CMDWorld;
uses crt;
type
Entity = record
x: integer;
y: integer;
graphic: char;
color: integer;
collidable: boolean;
collectable: boolean;
slippable: boolean;
end;
var
// Bricks
bricks: array [1..2000] of Entity;
bricksCount: integer;
// Money items
moneyItems: array [1..20] of Entity;
moneyItemsCount: integer;
// Player
player: Entity;
// Key
key: Entity;
hasKey: boolean;
// Door
door: Entity;
currentLevel: integer;
// Jump
isJumping: boolean;
jumpHeight: byte;
jumpsCount: byte;
levelsColors: array [1..10] of integer;
function BooleanToInt(bool : boolean): integer;
begin
if (bool = true) then
BooleanToInt := 1
else
BooleanToInt := 0;
end;
function IntToBoolean(int : integer): boolean;
begin
if (int = 1) then
IntToBoolean := true
else
IntToBoolean := false;
end;
procedure AddBrick(posX: integer; posY: integer);
begin
bricksCount := bricksCount + 1;
with bricks[bricksCount] do
begin
x := posX;
y := posY;
graphic := #178;
collidable := true;
collectable := false;
color := 4;
slippable := false;
end;
end;
procedure AddMoneyItem(posX: integer; posY: integer);
begin
moneyItemsCount := moneyItemsCount + 1;
with moneyItems[moneyItemsCount] do
begin
x := posX;
y := posY;
graphic := '$';
collidable := false;
collectable := true;
color := yellow;
slippable := false;
end;
end;
procedure SetupPlayer(posX: integer; posY: integer);
begin
with player do
begin
x := posX;
y := posY;
graphic := #244;
color := 8;
collidable := true;
collectable := false;
slippable := false;
end;
end;
procedure SetupKey(posX: integer; posY: integer);
begin
with key do
begin
x := posX;
y := posY;
graphic := #158;
color := 14;
collidable := false;
collectable := true;
slippable := false;
end;
end;
procedure SetupDoor(posX: integer; posY: integer);
begin
with door do
begin
x := posX;
y := posY;
graphic := #195;
color := 15;
collidable := true;
collectable := false;
slippable := false;
end;
end;
procedure DrawBricks;
var
i: integer;
begin
for i := 0 to bricksCount do
begin
with bricks[i] do
begin
textcolor(color);
gotoxy(x, y);
write(graphic);
end;
end;
end;
procedure DrawMoney;
var
i: integer;
begin
for i := 0 to moneyItemsCount do
begin
with moneyItems[i] do
begin
textcolor(color);
gotoxy(x, y);
write(graphic);
end;
end;
end;
procedure DrawPlayer;
begin
gotoxy(player.x, player.y);
textcolor(red);
write(player.graphic);
end;
procedure DrawKey;
begin
if (hasKey = false) then
begin
gotoxy(key.x, key.y);
textcolor(white);
write(key.graphic);
end;
end;
procedure DrawDoor;
begin
gotoxy(door.x, door.y);
write(door.graphic);
end;
function HasGotTheKey : boolean;
begin
if (key.collectable = true) and (player.x = key.x) and (player.y = key.y) then
HasGotTheKey := true
else
HasGotTheKey := false;
end;
function HasReachedTheDoor : boolean;
begin
if (door.collidable = false) and (player.x = door.x) and (player.y = door.y) then
HasReachedTheDoor := true
else
HasReachedTheDoor := false;
end;
function HasDied : boolean;
begin
if (player.y > 25) then
HasDied := true
else
HasDied := false;
end;
function DetectPlayerOnBrickCollision: boolean;
var
i: integer;
begin
DetectPlayerOnBrickCollision := false;
for i := 0 to bricksCount do
begin
with bricks[i] do
begin
if (collidable = true) and (player.x = x) and (player.y = y) then
DetectPlayerOnBrickCollision := true;
end;
end;
end;
function DetectPlayerOnDoorCollision: boolean;
begin
DetectPlayerOnDoorCollision := false;
with door do
begin
if (collidable = true) and (player.x = x) and (player.y = y) then
DetectPlayerOnDoorCollision := true;
end;
end;
function IsPlayerOnTheGround: boolean;
var
i: integer;
begin
IsPlayerOnTheGround := false;
for i := 0 to bricksCount do
begin
with bricks[i] do
begin
if (collidable = true) and (player.x = x) and
(player.y = y - 1) then
IsPlayerOnTheGround := true;
end;
end;
end;
function IsPlayerUnderTheGround: boolean;
var
i: integer;
begin
IsPlayerUnderTheGround := false;
for i := 0 to bricksCount do
begin
with bricks[i] do
begin
if (collidable = true) and (player.x = x) and
(player.y = y + 1) then
IsPlayerUnderTheGround := true;
end;
end;
end;
procedure ErasePlayer;
begin
gotoxy(player.x, player.y);
write(#255);
end;
procedure ApplyGravity();
begin
if (IsPlayerOnTheGround() = false) and (isJumping = false) then
begin
ErasePlayer;
player.y := player.y + 1;
delay(30);
end;
end;
procedure MoveLeft;
begin
ErasePlayer;
player.x := player.x - 1;
if (DetectPlayerOnBrickCollision() = true) or
(player.x <= 0) or
(DetectPlayerOnDoorCollision() = true) then
begin
player.x := player.x + 1;
jumpsCount := 0;
end;
end;
procedure MoveRight;
begin
ErasePlayer;
player.x := player.x + 1;
if (DetectPlayerOnBrickCollision() = true) or
(player.x > 80) or
(DetectPlayerOnDoorCollision() = true) then
begin
player.x := player.x - 1;
jumpsCount := 0;
end;
end;
function IsPlayerInsideTheGround: boolean;
var
i: integer;
begin
IsPlayerInsideTheGround := false;
for i := 0 to bricksCount do
begin
with bricks[i] do
begin
if (collidable = true) and (player.x = x) and (player.y = y) then
IsPlayerInsideTheGround := true;
end;
end;
end;
procedure Jump;
begin
jumpHeight := jumpHeight + 1;
isJumping := true;
ErasePlayer;
player.y := player.y - 1;
delay(50);
if (jumpHeight = 6) then
begin
jumpHeight := 0;
isJumping := false;
end;
if (IsPlayerInsideTheGround = true) then
begin
jumpHeight := 0;
isJumping := false;
player.y := player.y + 1;
end;
if (IsPlayerUnderTheGround = true) then
begin
jumpHeight := 0;
isJumping := false;
end;
end;
procedure Draw;
begin
DrawBricks;
DrawDoor;
DrawKey;
DrawMoney;
gotoxy(1,1);
end;
procedure UnloadCurrentLevel;
begin
hasKey := false;
door.collidable := true;
bricksCount := 0;
moneyItemsCount := 0;
clrscr;
end;
procedure LoadLevel(levelNumber: integer);
var
i: integer;
lineNumber: integer;
lineText: string;
fileName : string;
levelFile: text;
begin
UnloadCurrentLevel;
str(levelNumber, lineText);
fileName := Concat('levels\level', lineText, '.map');
assign(levelFile, fileName);
reset(levelFile);
lineNumber := 1;
while not Eof(levelFile) do
begin
Readln(levelFile, lineText);
for i := 1 to 80 do
begin
case lineText[i] of
'x':
AddBrick(i, lineNumber);
'$':
AddMoneyItem(i, lineNumber);
'p':
SetupPlayer(i, lineNumber);
'd':
SetupDoor(i, lineNumber);
'k':
SetupKey(i, lineNumber);
end;
end;
lineNumber := lineNumber + 1;
end;
textbackground(levelsColors[currentLevel]);
clrscr;
close(levelFile);
end;
procedure SaveState;
var
i: Integer;
stateFile: file of integer;
begin
assign(stateFile, 'states\state.sav');
rewrite(stateFile);
write(stateFile, currentLevel);
write(stateFile, player.x);
write(stateFile, player.y);
i := BooleanToInt(hasKey);
write(stateFile, i);
close(stateFile);
end;
procedure LoadState;
var
stateFile: file of integer;
i: Integer;
begin
assign(stateFile, 'states\state.sav');
reset(stateFile);
read(stateFile, currentLevel);
UnloadCurrentLevel;
LoadLevel(currentLevel);
read(stateFile, player.x);
read(stateFile, player.y);
read(stateFile, i);
hasKey := IntToBoolean(i);
door.collidable := not(hasKey);
Draw;
close(stateFile);
end;
procedure KeyboardInput;
begin
if (keypressed) then
case readkey of
#75:
MoveLeft;
#77:
MoveRight;
#27:
Halt(0);
#32:
if (jumpsCount < 2) then
begin
isJumping := true;
jumpsCount := jumpsCount + 1;
end;
#97:
SaveState;
#100:
begin
ErasePlayer;
LoadState;
end;
end;
end;
procedure ShowTitleMenu();
var
i: integer;
lineNumber: integer;
lineText: string;
levelFile: text;
begin
UnloadCurrentLevel;
assign(levelFile, 'levels\title_menu.map');
reset(levelFile);
lineNumber := 1;
while not Eof(levelFile) do
begin
Readln(levelFile, lineText);
for i := 1 to 80 do
begin
case lineText[i] of
'x':
AddBrick(i, lineNumber);
'$':
AddMoneyItem(i, lineNumber);
'p':
SetupPlayer(i, lineNumber);
'd':
SetupDoor(i, lineNumber);
'k':
SetupKey(i, lineNumber);
end;
end;
lineNumber := lineNumber + 1;
end;
close(levelFile);
textbackground(green);
clrscr;
Draw;
gotoxy(34, 21);
write('Press any key');
readkey;
LoadLevel(1);
end;
procedure Initialize;
begin
levelsColors[1] := 11;
levelsColors[2] := 7;
levelsColors[3] := 10;
levelsColors[4] := 14;
levelsColors[5] := 3;
levelsColors[6] := 1;
levelsColors[7] := 15;
levelsColors[8] := 0;
levelsColors[9] := 0;
levelsColors[10] := 0;
currentLevel := 1;
ShowTitleMenu();
end;
procedure ShowMessage(bgColor: integer; txtColor: integer; message: string);
begin
textBackground(bgColor);
clrscr;
gotoxy(round(40 - length(message) / 2), 13);
textcolor(txtColor);
write(message);
readkey;
end;
procedure Update;
begin
ApplyGravity();
if (HasGotTheKey = true) then
begin
hasKey := true;
door.collidable := false;
end;
if (HasReachedTheDoor = true) then
begin
if (currentLevel = 10) then
begin
ShowMessage(blue, white, 'CONGRATULATIONS, YOU ARE A TRUE GOD!!!');
currentLevel := 1;
ShowTitleMenu();
end
else
begin
currentLevel := currentLevel + 1;
ShowMessage(green, white, 'LEVEL COMPLETED!');
LoadLevel(currentLevel);
Draw();
end;
end;
if (HasDied = true) then
begin
ShowMessage(red, white, 'YOU HAVE FAILED!');
LoadLevel(currentLevel);
Draw();
end;
if (isJumping = true) then
Jump;
if (IsPlayerOnTheGround = true) then
jumpsCount := 0;
DrawPlayer;
KeyboardInput;
delay(25);
end;
// Main Program
begin
Initialize;
Draw;
repeat
Update;
until false = true;
end.
|
unit eSocial.Models.Components.Connections.Interfaces;
interface
uses
Data.DB;
type
iModelComponentConnection = interface
['{E14316CA-4550-4273-BCD0-109F08BCE77B}']
function Active(aValue : Boolean) : iModelComponentConnection;
function AddParam (aParam : String; aValue : Smallint) : iModelComponentConnection; overload;
function AddParam (aParam : String; aValue : Integer) : iModelComponentConnection; overload;
function AddParam (aParam : String; aValue : String) : iModelComponentConnection; overload;
function AddParam (aParam : String; aValue : TDateTime) : iModelComponentConnection; overload;
function DataSet : TDataSet;
function ExecSQL : iModelComponentConnection;
function FetchParams : iModelComponentConnection;
function Open : iModelComponentConnection;
function SQL(aValue : String) : iModelComponentConnection;
function SQLClear : iModelComponentConnection;
end;
implementation
end.
|
{ A three dimensional graphics demonstration program }
{ Written 2/11/1988 by Gus Smedstad }
{ 3-d primitives provided by TRI_D.TPU, by Gus Smedstad }
{$N-}
uses Crt, graph, tri_d;
const tablemax = 12; { Maximum number of color/pattern combinations needed }
type ObjInfo = record
Name : String[10]; { name of object }
center: vector; { center point for rotation }
data : pointer; { Tri_D information }
end;
var colortable : array[1..tablemax] of FillSettingsType;
{ Table to provide 'generic' colors for all monitors }
Object : array[0..5] of ObjInfo;
{ Objects. Global for simplicity. }
paging : boolean; { True if graphics card supports paging }
procedure ChangeColor(front, back : integer);
begin
SetPolyColors(colortable[front].pattern, colortable[front].color,
colortable[back].pattern, colortable[back].color)
end;
{ ----- Routines to draw the five objects ----- }
procedure Ring(x,y,z, radius : real; step : integer); { draw a cylinder }
var cosine : array[0..20] of real;
sine : array[0..20] of real;
i : integer;
p : array[1..4] of vector;
begin
ChangeColor(1,2);
for i := 0 to step do begin
cosine[i] := cos(i * 2 * pi / step);
sine[i] := sin(i * 2 * pi / step);
end;
for i := 1 to step do begin
p[1][0] := radius * cosine[i-1] + x;
p[1][1] := radius * sine[i-1] + y;
p[1][2] := z;
p[2][0] := radius * cosine[i] + x;
p[2][1] := radius * sine[i] + y;
p[2][2] := z;
p[3] := p[2];
p[3][2] := radius * 2 + z;
p[4] := p[1];
p[4][2] := radius * 2 + z;
MakePolygon(p,4);
end
end;
procedure Hemisphere(x, y, z, radius : real; step : integer);
var cosine : array[0..30] of real;
sine : array[0..30] of real;
i, j : integer;
F, H : real;
oldH : real;
oldF : real;
p : array[1..4] of vector;
begin
ChangeColor(3,4);
step := step * 2;
for i := 0 to step do begin
cosine[i] := cos(i * 2 * pi / step);
sine[i] := sin(i * 2 * pi / step);
end;
F := 0;
H := radius;
for i := 1 to (step div 2) do begin
oldF := F;
oldH := H;
F := radius * sin(i * pi / step);
H := radius * cos(i * pi / step);
for j := 1 to step do begin
p[1][0] := oldF * cosine[j-1] + x;
p[1][1] := oldH + y;
p[1][2] := oldF * sine[j-1] + z;
p[2][0] := F * cosine[j-1] + x;
p[2][1] := H + y;
p[2][2] := F * sine[j-1] + z;
p[3][0] := F * cosine[j] + x;
P[3][1] := H + y;
p[3][2] := F * sine[j] + z;
p[4][0] := oldF * cosine[j] + x;
p[4][1] := oldH + y;
p[4][2] := oldF * sine[j] + z;
MakePolygon(p,4)
end
end
end;
procedure House(x,y,z, size : real);
var front,
back : array[0..4] of vector;
side : array[0..3] of vector;
i, l: integer;
begin
back[0,0] := -size; back[0,1] := 0; back[0,2] := -size;
back[1,0] := size; back[1,1] := 0; back[1,2] := -size;
back[2,0] := size; back[2,1] := size/2; back[2,2] := -size;
back[3,0] := 0; back[3,1] := size; back[3,2] := -size;
back[4,0] := -size; back[4,1] := size/2; back[4,2] := -size;
for i := 0 to 4 do begin
back[i,0] := back[i,0] + x;
back[i,1] := back[i,1] + y;
back[i,2] := back[i,2] + z;
end;
for i := 0 to 4 do begin
front[i][0] := back[i][0];
front[i][1] := back[i][1];
front[i][2] := back[i][2] + size * 2;
end;
l := 4;
ChangeColor(5,5);
for i := 0 to 4 do begin
side[0] := back[l];
side[1] := back[i];
side[2] := front[i];
side[3] := front[l];
MakePolygon(side,4);
l := i;
end;
ChangeColor(6,6);
MakePolygon(back,5);
MakePolygon(front,5);
end;
procedure Rect(x, y1, z1, y2, z2 : real);
var p : array[1..4] of vector;
begin
p[1][0] := x; p[1][1] := y1; p[1][2] := z1;
p[2][0] := x; p[2][1] := y2; p[2][2] := z1;
p[3][0] := x; p[3][1] := y2; p[3][2] := z2;
p[4][0] := x; p[4][1] := y1; p[4][2] := z2;
ChangeColor(7,8);
MakePolygon(p,4);
end;
procedure Pyramid(x,y,z, scale : real);
var bottom : array[1..4] of vector;
tip : vector;
old : vector;
i : integer;
begin
bottom[1][0] := x+scale/2; bottom[1][1] := y; bottom[1][2] := z-scale/2;
bottom[2][0] := x+scale/2; bottom[2][1] := y; bottom[2][2] := z+scale/2;
bottom[3][0] := x-scale/2; bottom[3][1] := y; bottom[3][2] := z+scale/2;
bottom[4][0] := x-scale/2; bottom[4][1] := y; bottom[4][2] := z-scale/2;
ChangeColor(9,9);
MakePolygon(bottom,4);
tip[0] := x; tip[1] := y+scale; tip[2] := z;
old := bottom[4];
for i := 1 to 4 do begin
ChangeColor((i mod 2) + 10,(i mod 2) + 10);
MakeTriangle(old,tip,bottom[i]);
old := bottom[i]
end
end;
{ ----- Initialize graphics card, create color table, create objects -----}
procedure CreateObjects;
const Zero : vector = (0,0,0);
var i : integer;
begin
SetLineStyle(SolidLn,0,1);
with Object[0] do begin
center[0] := 0;
center[1] := 0;
center[2] := 30;
name := 'Viewpoint';
SetViewPoint(center[0],center[1],center[2]);
end;
SetViewDirection(0,0,0);
with Object[1] do begin
MakeObject(data);
Ring(-7,7,0,3,12);
center[0] := -7; center[1] := 7; center[2] := 0;
name := 'Cylinder';
end;
with Object[2] do begin
MakeObject(data);
Hemisphere(7,7,0,6,8);
center[0] := 7; center[1] := 7; center[2] := 0;
name := 'Hemisphere';
end;
with Object[3] do begin
MakeObject(data);
Pyramid(-15,-7,0,7);
center[0] := -15; center[1] := -7; center[2] := 0;
name := 'Pyramid';
end;
with Object[4] do begin
MakeObject(data);
House(0,-7,0,4);
Center[0] := 0; center[1] := -7; center[2] := 0;
name := 'House';
end;
with Object[5] do begin
MakeObject(data);
Rect(15,-12,4,-3,-4);
Center[0] := 15; Center[1] := -7; Center[2] := 0;
name := 'Plane';
end;
CloseObject; { We're finished making objects }
end;
procedure Init;
var colormax : integer;
c, s, i : integer;
GraphDriver, GraphMode : integer;
begin
GraphDriver := Detect;
InitGraph(GraphDriver, GraphMode, '');
if GraphResult <> grOK then begin
Writeln('Graphics initialization error: ', GraphErrorMsg(GraphDriver));
Halt(1);
end;
SetViewPort(0,TextHeight(' ')*2 + 4,GetmaxX,GetmaxY,True);
paging := (GraphDriver = HercMono) or (GraphDriver = EGA) or
(GraphDriver = EGA64) or (GraphDriver = VGA);
c := 1;
s := SolidFill;
colormax := GetMaxColor;
for i := 1 to TableMax do begin { cycle through colors and fill styles }
Colortable[i].pattern := s;
Colortable[i].color := c;
c := succ(c);
if C > colormax then begin
c := 1;
s := s + 1;
if s = UserFill then s := SolidFill
end
end;
SetScale(2);
SetCenter(GetmaxX div 2, GetmaxY div 2);
CreateObjects;
end;
{ Show the menu at the top of the screen }
procedure showmenu(o : integer; rot: boolean);
begin
SetViewPort(0,0,GetmaxX,TextHeight(' ')*2 + 4,False);
ClearViewport;
SetColor(GetMaxColor);
OuttextXY(0,0,
' 1-5 object Rotate Move Viewpoint Hide edges Clear Quit');
Moveto(0,TextHeight(' '));
if rot then Outtext('Rotate ') else Outtext('Move ');
Outtext(Object[o].Name);
Outtext(' Dir: <arrow keys> <page up>: add Z <page down>: subtract Z');
SetViewPort(0,TextHeight(' ')*2 + 4,GetmaxX,GetmaxY,True);
end;
{ --- Move an object or the viewpoint by dx, dy, and dz --- }
procedure MoveOb(obj : integer; dx, dy, dz : real);
begin
with object[obj] do begin
center[0] := center[0] + dx; { We're keeping track of this }
center[1] := center[1] + dy; { so we know what point to }
center[2] := center[2] + dz; { rotate the object about. }
if obj > 0 then
MoveObject(data,dx,dy,dz)
else
SetViewPoint(center[0],center[1],center[2]);
end
end;
procedure RotOb(obj : integer; ThetaX, ThetaY, ThetaZ : real);
var Theta : vector;
delta : vector;
i : integer;
begin
if obj = 0 then
RotateViewDirection(-ThetaX, ThetaY, -ThetaZ)
else begin
{ We don't want to move it, just rotate. }
for i := 0 to 2 do delta[i] := 0;
Theta[0] := ThetaX;
Theta[1] := ThetaY;
Theta[2] := ThetaZ;
with object[obj] do RotateObject(data,Theta,Center,delta);
end
end; { That's all there is to it. }
procedure ResetData;
var i : integer;
begin
CloseObject;
for i := 1 to 5 do with Object[i] do DeleteObject(Data);
ClearDevice;
CreateObjects;
end;
var ch : char; { Holds last keypress }
obj : integer; { Current object # }
angle : real; { increment for rotations }
NewMenu : boolean; { Do we need to change the menu? }
EraseScr : boolean; { Do we need to erase the screen ? }
rot : boolean; { Are we rotating or moving objects? }
done : boolean;
Page : integer;
i : integer;
begin
Init;
angle := pi/10; { Set the increment for rotations }
obj := 0; { start with the viewpoint}
page := 0;
rot := false;
done := false;
NewMenu := True;
repeat { Main loop - repeat until we're bored }
if NewMenu then ShowMenu(obj, rot);
EraseScr := False;
NewMenu := False;
Ch := Readkey;
if ch = #0 then begin { Special key - presumed to be an arrow key. }
if (obj > 0) then
EraseObject(Object[obj].data)
else
EraseScr := true; { If we're moving the viewpoint, we need a new }
{ screen }
case ord(readkey) of
$48 : if rot then { Up arrow }
RotOb(obj,-angle,0,0)
else
MoveOb(obj,0,1,0);
$49 : MoveOb(obj,0,0,-1); { page up }
$4b : if rot then { Left arrow }
RotOb(obj,0,-angle,0)
else
MoveOb(obj,-1,0,0);
$4d : if rot then { Right Arrow }
RotOb(obj,0,angle,0)
else
MoveOb(obj,1,0,0);
$50 : if rot then { down arrow }
RotOb(obj,angle,0,0)
else
MoveOb(obj,0,-1,0);
$51 : MoveOb(obj,0,0,1); { page down }
end;
if Obj > 0 then DrawObject(object[obj].data);
end
else begin
NewMenu := True; { All of these change the menu }
case upcase(ch) of
'1'..'5' : begin
if obj > 0 then with Object[obj] do begin
ObjectStyle(data,SolidLn,0,1); { Redraw the previous }
DrawObject(data); { selection }
end;
obj := ord(ch) - ord('0'); { set object }
with Object[obj] do begin
EraseObject(data); { Redraw it with dashes }
ObjectStyle(data,DashedLn,0,1);
DrawObject(data)
end;
end;
'V' : begin
if obj > 0 then with object[obj] do begin
ObjectStyle(data,SolidLn,0,1); { Redraw the previous }
DrawObject(data) { selection }
end;
obj := 0;
end;
'M' : rot := false;
'R' : rot := True;
'C' : begin
EraseScr := True;
ResetData;
obj := 0;
end;
#27, 'Q' : done := true;
'H' : begin
SetDrawMode(true,true); { change to hidden-edges }
Regenerate; { draw it }
repeat until keypressed; { wait for next key }
EraseScr := true; { those filled polygons }
SetDrawMode(false,true); { reset to wireframe }
end;
end { of Case upcase(ch) }
end;
if EraseScr then begin { redraw the screen }
if paging then begin
SetVisualPage(page); { if we've got pages, use other page. }
SetActivePage(1-page);
end;
NewMenu := True;
ClearDevice;
regenerate;
if paging then begin
SetVisualPage(1-page); { Let 'em look at our finished image }
page := 1-page; { Alternate pages }
end;
end
until done;
CloseGraph;
end.
|
unit MenuGerente;
interface
uses
Winapi.Windows, Winapi.Messages, System.SysUtils, System.Variants, System.Classes, Vcl.Graphics,
Vcl.Controls, Vcl.Forms, Vcl.Dialogs, Vcl.StdCtrls, UnitUsuario;
type
TFormMenuGerente = class(TForm)
LabelMenuGerente: TLabel;
Button1: TButton;
btnRegistrarCuenta: TButton;
Button3: TButton;
labelNombreGerente: TLabel;
Button4: TButton;
procedure onClose(Sender: TObject; var Action: TCloseAction);
procedure FormCreate(Sender: TObject);
procedure clicGestionarCuentasCredit(Sender: TObject);
procedure cargarLabel(Sender: TObject);
procedure clicRegistrarCuenta(Sender: TObject);
procedure clicInteresesRecargos(Sender: TObject);
procedure clicGestionarCuentasDebito(Sender: TObject);
procedure btnRegistrarCuentaClick(Sender: TObject);
private
{ Private declarations }
public
usuarioGerente : TUsuario;
nombreUsuario : string;
{ Public declarations }
end;
var
FormMenuGerente: TFormMenuGerente;
implementation
uses PantallaPrincipal,GestionarCuentasDebito, RegistrarCliente ,GestionarCuentasCredito, MenuInteresesRecargos, InformacionCliente;
{$R *.dfm}
procedure TFormMenuGerente.btnRegistrarCuentaClick(Sender: TObject);
begin
FormRegistrarCliente.Show;
FormMenuGerente.Visible := False;
end;
procedure TFormMenuGerente.cargarLabel(Sender: TObject);
begin
usuarioGerente := PantallaPrincipal.FormPantallaPrincipal.usuario;
labelNombreGerente.Caption := usuarioGerente.nombres;
end;
procedure TFormMenuGerente.clicGestionarCuentasCredit(Sender: TObject);
begin
FormGestionarCuentasCredito.Show;
FormMenuGerente.Visible := False;
end;
procedure TFormMenuGerente.clicGestionarCuentasDebito(Sender: TObject);
begin
GestionarCuentasDebito.FormCuestionarCuentasDebito.Show;
FormMenuGerente.Visible := False;
end;
procedure TFormMenuGerente.clicInteresesRecargos(Sender: TObject);
begin
FormMenuInteresesRecargos.Show;
FormMenuGerente.Visible := False;
end;
procedure TFormMenuGerente.clicRegistrarCuenta(Sender: TObject);
begin
FormInformacionCliente.Show;
FormMenuGerente.Visible := False;
end;
procedure TFormMenuGerente.FormCreate(Sender: TObject);
begin
usuarioGerente := PantallaPrincipal.FormPantallaPrincipal.usuario;
end;
procedure TFormMenuGerente.onClose(Sender: TObject; var Action: TCloseAction);
begin
Application.Terminate;
end;
end.
|
// NIM / Nama : 16518189 / M Mirza Fathan Al Arsyad
Program tigainteger;
(* Input: 3 integer: A, B, C *)
(* Output: Sifat integer dari A, B, C (positif/negatif/nol dan ganjil/genap)
Nilai maksimum, minimum, dan nilai tengah *)
(* KAMUS *)
var
A, B, C : integer;
nilaitengah : integer;
procedure CekInteger (var x : integer);
begin
if ((x > 0) and (x mod 2 = 0)) then
begin
writeln('POSITIF-GENAP');
end else if (x >=0) and (x mod 2 = 1) then
begin
writeln('POSITIF-GANJIL');
end else if (x < 0) then
begin
writeln('NEGATIF');
end else
begin
writeln('NOL');
end;
end;
function Max (a, b, c : integer) : integer;
begin
if (a>=b) and (a>=c) then
begin
Max := a;
end else if (b>=a) and (b>=c) then
begin
Max := b;
end else
begin
Max := c;
end;
end;
function Min (a, b, c : integer): integer;
begin
if (a<=b) and (a<=c) then
begin
Min := a;
end else if (b<=a) and (b<=c) then
begin
Min := b;
end else
begin
Min := c;
end;
end;
(* PROGRAM UTAMA *)
begin
(* Input *)
readln(A);
readln(B);
readln(C);
(* Menuliskan sifat integer *)
CekInteger(A);
CekInteger(B);
CekInteger(C);
(* Penulisan maksimum, minimum, dan nilai tengah *)
writeln(Max(A,B,C));
writeln(Min(A,B,C));
nilaitengah := A + B + C - Max(A,B,C) - Min(A,B,C);
writeln(nilaitengah);
end . |
{
* fpwm.pas - initialization and event loop
}
{
* Copyright (c) 2006 Felipe Monteiro de Carvalho, Daniel Franzini, Andrew Haines
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject
* to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
}
program fpwm;
{$ifdef fpc}
{$mode objfpc}{$H+}
{$endif}
uses
{ Free Pascal Units }
SysUtils, xlib,
{ Fpwm Units }
BaseWM, XWM, XfpGUIWM,
{ FpGUI Units }
fpg_main;
var
WM: TfpGUIWindowManager;
begin
WM := TfpGUIWindowManager.Create('');
try
fpgApplication.Initialize;
WM.InitWM(True);
WM.MainLoop;
finally
WM.Free;
end;
end.
|
// Modified by houidef 24-01-2020 18:52:28
unit iCalendar;
interface
uses Classes, XMLDoc, XMLIntf, TypInfo, Variants, SysUtils, XmlDom,contnrs,dialogs;
type
TCalendarEvents = class;
TCalendarEvent = class(Tobject)
private
FStartEvent: TDateTime;
FEndEvent: TDateTime;
FSummary : string;
FDescription : string;
FEvent : string;
//procedure SetAge(const Value: Integer);
//procedure SetNom(const Value: String);
public
Parent: TCalendarEvents;
function Next : TCalendarEvent;
function Index: Integer;
property StartEvent: TDateTime read FStartEvent write FStartEvent;
property EndEvent: TDateTime read FEndEvent write FEndEvent;
property Summary: string read FSummary write FSummary;
property Description: string read FDescription write FDescription;
property Event: string read FEvent write FEvent;
end;
TCalendarEvents = class(TObjectList)
private
function GetEvent(Index: Integer): TCalendarEvent;
procedure SetEvent(Index: Integer; const Value: TCalendarEvent);
public
procedure Save;
procedure Load;
function GetEvents(FromDate : TDateTime) : TCalendarEvents;
function NouvelleEvent: TCalendarEvent;
procedure AjouterEvent(PStartTime: TdateTime; PEndTime: TdateTime;
PSummary: string; PDescription: string;PEvent:String);
property Event[Index: Integer]: TCalendarEvent read GetEvent write SetEvent;
end;
TXMLSerializer = class(TObject)
private
XMLData: IXMLDocument;
FFilename: TFilename;
procedure SetXML(Value:TStrings);
function GetXML: TStrings;
procedure SetFilename(Value:TFilename);
procedure SetEncoding(Value:DomString);
procedure SetStandalone(Value:DomString);
procedure SetVersion(Value:DomString);
function GetFilename: TFilename;
function GetEncoding:DomString;
function GetStandalone:DomString;
function GetVersion:DomString;
procedure InitVarTypes;
function StringToVarType(VarString:String):TVarType;
function VarTypeToString(VarType:TVarType):String;
public
constructor Create; //override;
procedure SaveObject(CalendarEvents:TCalendarEvents; Name:String);
procedure LoadObject(CalendarEvents:TCalendarEvents; Name:String);
procedure ReadEvent(CalendarEvents:TCalendarEvents; Node : IXMLNode);
function LoadFile: Boolean;
function SaveFile: Boolean;
published
property XMLText: TStrings read GetXML write SetXML;
property Filename: TFilename read GetFilename write SetFilename;
property Encoding: DomString read GetEncoding write SetEncoding;
property Standalone: DomString read GetStandalone write SetStandalone;
property Version: DomString read GetVersion write SetVersion;
end;
var
VarTypes: array[$0000..$4000] of String;
procedure Register;
implementation
{ TCalendarEvent }
function TCalendarEvent.Index: Integer;
begin
Result := Parent.IndexOf(Self);
end;
function TCalendarEvent.Next: TCalendarEvent;
begin
if Index < Pred(Parent.Count) then
Result := Parent.event[Succ(Index)]
else
Result := nil;
end;
{ TCalendarEvents }
procedure TCalendarEvents.AjouterEvent(PStartTime: TdateTime; PEndTime: TdateTime;
PSummary: string; PDescription: string;PEvent:String);
begin
with NouvelleEvent do
begin
FStartEvent := PStartTime;
FEndEvent := PEndTime;
FSummary := PSummary;
FDescription := PDescription;
FEvent := PEvent;
end;
end;
function TCalendarEvents.GetEvent(Index: Integer): TCalendarEvent;
begin
if (Count > 0) and (Index < Count) then
Result := Items[Index] as TCalendarEvent
else
Result := nil;
end;
function TCalendarEvents.GetEvents(FromDate: TDateTime): TCalendarEvents;
var
i : Integer;
begin
Result := TCalendarEvents.Create;
for i:= 0 to Count-1 do
if(Event[i].StartEvent <= FromDate) and (Event[i].EndEvent >= FromDate) then
Result.add(Event[i]);
end;
procedure TCalendarEvents.Load;
var
XMLSerializer1:TXMLSerializer;
begin
XMLSerializer1:=TXMLSerializer.Create;
XMLSerializer1.Filename := 'CalendarFile.xml';
if(XMLSerializer1.LoadFile) then
XMLSerializer1.LoadObject(self,'Cal1');
end;
function TCalendarEvents.NouvelleEvent: TCalendarEvent;
begin
Result := Event[Add(TCalendarEvent.Create)];
Result.Parent := Self;
end;
procedure TCalendarEvents.Save;
var
XMLSerializer1:TXMLSerializer;
begin
XMLSerializer1:=TXMLSerializer.Create;
XMLSerializer1.Filename := 'CalendarFile.xml';
XMLSerializer1.SaveObject(self,'Cal1');
if (not XMLSerializer1.SaveFile) then
ShowMessage('there is error!');
end;
procedure TCalendarEvents.SetEvent(Index: Integer;
const Value: TCalendarEvent);
begin
if (Count > 0) and (Index < Count) then
Items[Index] := Value
else
Raise Exception.Create('Aucun élément à cet index');
end;
procedure Register;
begin
// RegisterComponents('Custom', [TXMLSerializer]);
end;
constructor TXMLSerializer.Create;
var
DocumentElement: IXMLNode;
begin
inherited;
XMLData := NewXMLDocument;
XMLData.Options := [doNodeAutoIndent];
DocumentElement := XMLData.CreateElement('classes', '');
XMLData.DocumentElement := DocumentElement;
XMLData.Encoding := 'ISO-8859-6';
XMLData.Version := '1.0';
XMLData.Standalone := 'yes';
XMLData.Active := True;
end;
procedure TXMLSerializer.InitVarTypes;
begin
VarTypes[varEmpty] := 'Empty';
VarTypes[varNull] := 'Null';
VarTypes[varSmallint] := 'Smallint';
VarTypes[varInteger] := 'Integer';
VarTypes[varSingle] := 'Single';
VarTypes[varDouble] := 'Double';
VarTypes[varCurrency] := 'Currency';
VarTypes[varDate] := 'Date';
VarTypes[varOleStr] := 'OleStr';
VarTypes[varDispatch] := 'Dispatch';
VarTypes[varError] := 'Error';
VarTypes[varBoolean] := 'Boolean';
VarTypes[varVariant] := 'Variant';
VarTypes[varUnknown] := 'Unknown';
VarTypes[varShortInt] := 'ShortInt';
VarTypes[varByte] := 'Byte';
VarTypes[varWord] := 'Word';
VarTypes[varLongWord] := 'LongWord';
VarTypes[varInt64] := 'Int64';
VarTypes[varStrArg] := 'StrArg';
VarTypes[varString] := 'String';
VarTypes[varAny] := 'Any';
VarTypes[varTypeMask] := 'TypeMask';
VarTypes[varArray] := 'Array';
VarTypes[varByRef] := 'ByRef';
end;
function TXMLSerializer.VarTypeToString(VarType:TVarType):String;
begin
InitVarTypes;
Result := VarTypes[VarType];
end;
function TXMLSerializer.StringToVarType(VarString:String):TVarType;
var
Count: Integer;
begin
InitVarTypes;
Result := 0;
for Count := $0000 to $4000 do
begin
if (VarTypes[Count] = VarString) then
begin
Result := Count;
Exit;
end;
end;
end;
procedure TXMLSerializer.LoadObject(CalendarEvents:TCalendarEvents; Name:String);
var
Count: Integer;
Node: IXMLNode;
VariantData: Variant;
begin
XMLData.Active := True;
repeat
Node := XMLData.DocumentElement.ChildNodes.FindNode(Name);
if Node <> nil then
begin
if (Node.Attributes['classname'] = CalendarEvents.ClassName) then
begin
for Count := 0 to Node.ChildNodes.Count-1 do
begin
ReadEvent(CalendarEvents,Node.ChildNodes.Nodes[Count]);
{if not(VarIsNull(Node.ChildNodes.Nodes[Count].NodeValue)) then
begin
VariantData := VarAsType(Node.ChildNodes.Nodes[Count].NodeValue,StringToVarType(Node.ChildNodes.Nodes[Count].Attributes['type']));
if IsPublishedProp(CalendarEvents,Node.ChildNodes.Nodes[Count].Attributes['name']) then
SetPropValue(CalendarEvents,Node.ChildNodes.Nodes[Count].Attributes['name'],VariantData);
end; }
end;
end;
end;
until not(Node = nil);
end;
function TXMLSerializer.LoadFile: Boolean;
begin
XMLData := TXMLDocument.Create('CalendarFile.xml');
end;
function TXMLSerializer.SaveFile: Boolean;
begin
XMLData.SaveToFile('CalendarFile.xml');
end;
procedure TXMLSerializer.SaveObject(CalendarEvents : TCalendarEvents;Name:String);
var
I, Count: Integer;
PropInfo: PPropInfo;
PropList: PPropList;
PropValue: Variant;
PropType: PPTypeInfo;
PropReturnValue: Word;
ChildNode: IXMLNode;
Node,Event: IXMLNode;
begin
XMLData.Active := True;
repeat
ChildNode := XMLData.DocumentElement.ChildNodes.FindNode(Name);
if ChildNode <> nil then
begin
if (ChildNode.Attributes['classname'] = CalendarEvents.ClassName) then
XMLData.DocumentElement.ChildNodes.Remove(ChildNode);
end;
until ChildNode = nil;
ChildNode := XMLData.DocumentElement.AddChild(Name);
ChildNode.Attributes['classname'] := CalendarEvents.ClassName;
for I := 0 to CalendarEvents.Count - 1 do
begin
Event := ChildNode.AddChild('Event');
Node := Event.AddChild('data');
Node.Attributes['name'] := 'fromdate';
Node.Attributes['type'] := 'TDateTime';
Node.NodeValue := VarToStr(CalendarEvents.Event[I].StartEvent);
//===
Node := Event.AddChild('data');
Node.Attributes['name'] := 'todate';
Node.Attributes['type'] := 'TDateTime';
Node.NodeValue := VarToStr(CalendarEvents.Event[I].EndEvent);
//===
Node := Event.AddChild('data');
Node.Attributes['name'] := 'Summary';
Node.Attributes['type'] := 'string';
Node.NodeValue := CalendarEvents.Event[I].Summary;
//===
Node := Event.AddChild('data');
Node.Attributes['name'] := 'Description';
Node.Attributes['type'] := 'string';
Node.NodeValue := CalendarEvents.Event[I].Description;
end;
end;
procedure TXMLSerializer.SetXML(Value:TStrings);
begin
XMLData.XML := Value;
XMLData.Active := True;
end;
function TXMLSerializer.GetXML: TStrings;
begin
Result := XMLData.XML;
end;
procedure TXMLSerializer.SetFilename(Value:TFilename);
begin
FFilename := Value;
end;
function TXMLSerializer.GetFilename: TFilename;
begin
Result := FFilename;
end;
procedure TXMLSerializer.SetEncoding(Value:DomString);
begin
XMLData.Active := True;
XMLData.Encoding := Value;
end;
procedure TXMLSerializer.SetStandalone(Value:DomString);
begin
XMLData.Active := True;
XMLData.Standalone := Value;
end;
procedure TXMLSerializer.SetVersion(Value:DomString);
begin
XMLData.Active := True;
XMLData.Version := Value;
end;
function TXMLSerializer.GetEncoding:DomString;
begin
XMLData.Active := True;
Result := XMLData.Encoding;
end;
function TXMLSerializer.GetStandalone:DomString;
begin
XMLData.Active := True;
Result := XMLData.Standalone;
end;
function TXMLSerializer.GetVersion:DomString;
begin
XMLData.Active := True;
Result := XMLData.Version;
end;
procedure TXMLSerializer.ReadEvent(CalendarEvents: TCalendarEvents;
Node: IXMLNode);
begin
CalendarEvents.AjouterEvent(
StrToDate(Node.ChildNodes[0].Text),
StrToDate(Node.ChildNodes[1].Text),
Node.ChildNodes[2].Text,
Node.ChildNodes[3].Text,
Node.ChildNodes[3].Text
);
end;
end.
|
{
관련글 : http://blog.hjf.pe.kr/326
원글
- http://www.gesource.jp/weblog/?p=6835
- http://www.gesource.jp/weblog/?p=6833
- http://www.gesource.jp/weblog/?p=6832
권한설정
Bluetooth
Bluetooth Admin
}
unit Unit1;
interface
uses
System.SysUtils, System.Types, System.UITypes, System.Classes, System.Variants,
FMX.Types, FMX.Controls, FMX.Forms, FMX.Graphics, FMX.Dialogs, FMX.StdCtrls;
type
TForm1 = class(TForm)
Button1: TButton;
Button2: TButton;
Button4: TButton;
Button3: TButton;
procedure Button1Click(Sender: TObject);
procedure Button2Click(Sender: TObject);
procedure Button3Click(Sender: TObject);
procedure Button4Click(Sender: TObject);
private
{ Private declarations }
public
{ Public declarations }
end;
var
Form1: TForm1;
implementation
{$R *.fmx}
uses
Androidapi.JNI.Bluetooth,
Androidapi.Helpers,
Androidapi.JNI.GraphicsContentViewText;
procedure TForm1.Button1Click(Sender: TObject);
var
Adapter: JBluetoothAdapter;
begin
Adapter := TJBluetoothAdapter.JavaClass.getDefaultAdapter;
if Adapter.isEnabled then
ShowMessage('Bluetooth가 활성화 되어있습니다.')
else
ShowMessage('Bluetooth가 활성화 되지 않았습니다.');
end;
procedure TForm1.Button2Click(Sender: TObject);
var
Adapter: JBluetoothAdapter;
begin
Adapter := TJBluetoothAdapter.JavaClass.getDefaultAdapter;
if Adapter.enable then
ShowMessage('Bluetooth를 활성화합니다.')
else
ShowMessage('사용할 수 없습니다.');
end;
procedure TForm1.Button3Click(Sender: TObject);
var
Adapter: JBluetoothAdapter;
begin
Adapter := TJBluetoothAdapter.JavaClass.getDefaultAdapter;
if Adapter.disable then
ShowMessage('Bluetooth를 비활성화합니다.')
else
ShowMessage('사용할 수 없습니다.');
end;
procedure TForm1.Button4Click(Sender: TObject);
function HasPermission(const Permission: string): Boolean;
begin
Result := SharedActivityContext.checkCallingOrSelfPermission(StringToJString(Permission)) = TJPackageManager.JavaClass.PERMISSION_GRANTED
end;
begin
if HasPermission('android.permission.BLUETOOTH') then
ShowMessage('Bluetooth 통신 권한이 있습니다.')
else
ShowMessage('Bluetooth 통신 권한이 없습니다');
if HasPermission('android.permission.BLUETOOTH_ADMIN') then
ShowMessage('Bluetooth 설정 수정 권한이 있습니다.')
else
ShowMessage('Bluetooth 설정 수정 권한이 없습니다.');
end;
end.
|
////////////////////////////////////////////
// Базовые функции для приборов фирмы Логика
////////////////////////////////////////////
unit Devices.Logica.Base;
interface
uses Windows, GMGlobals;
function Logica_CalcCRC(buf: array of Byte; Len, Start: int): WORD;
procedure LogicaM4_CRC(var buf: array of Byte; Len: int);
function LogicaM4_CheckCRC(buf: array of Byte; Len: int): bool;
procedure LogicaSPBUS_CRC(var buf: array of Byte; Len: int);
implementation
procedure LogicaM4_CRC(var buf: array of Byte; Len: int);
var CRC: WORD;
begin
CRC := Logica_CalcCRC(buf, Len, 1);
buf[Len] := CRC div 256;
buf[Len + 1] := CRC mod 256;
end;
function LogicaM4_CheckCRC(buf: array of Byte; Len: int): bool;
var CRC: WORD;
begin
Result := false;
if Len < 3 then Exit;
CRC := Logica_CalcCRC(buf, Len, 1);
Result := CRC = 0;
end;
procedure LogicaSPBUS_CRC(var buf: array of Byte; Len: int);
var CRC: WORD;
begin
CRC := Logica_CalcCRC(buf, Len, 2);
buf[Len] := CRC div 256;
buf[Len + 1] := CRC mod 256;
end;
function Logica_CalcCRC(buf: array of Byte; Len, Start: int): WORD;
var i, j: int;
begin
Result := 0;
for i := Start to Len - 1 do // первые Start символов управляющие, они отбрасываются
begin
Result := (Result xor buf[i] shl 8) and $FFFF;
for j := 0 to 7 do
begin
if Result and $8000 > 0 then
Result := ((Result shl 1) xor $1021) and $FFFF
else
Result := (Result shl 1) and $FFFF;
end;
end;
end;
end.
|
{Implementation for writer}
Unit Writer;
Interface
uses Statist;
type
p_Writer = ^WriterObj;
WriterObj = object
private
{name for file text}
output: text;
{path to our file}
path : string;
public
{initialization the field}
constructor Init;
{closing file}
destructor Done;
{send message}
procedure writeMSG (msg: string);
{send message about preitertion}
procedure preIterationMSG (stat : p_Statistic; iteration: longint; lambda: real; kmin : longint);
{send message about iteration}
procedure IterationMSG (stat : p_Statistic; iteration: longint);
{send message about average quantity of request in Buffer}
procedure averageQuantityOfRequestInBufferMSG(stat : p_Statistic);
{reset file}
procedure resetFile;
end;
Implementation
constructor WriterObj.Init;
begin
path := 'output.txt';
assign(output, path);
rewrite(output);
end;
destructor WriterObj.Done;
begin
close(output);
end;
procedure WriterObj.writeMSG;
begin
writeln(output, msg);
end;
procedure WriterObj.preIterationMSG;
var
help : string;
begin
writeMSG(' ');
str(iteration, help);
writeMSG(concat('Beginning iteration ', help));
str((round (lambda * 10)) / 10:0:2, help);
writeMSG(concat('lambda = ', help));
str(kmin, help);
writeMSG(concat('kmin = ', help));
writeMSG(' ');
writeMSG('*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-');
end;
procedure WriterObj.IterationMSG;
var
help : string;
begin
writeMSG('#################################################################################');
writeMSG(' ');
str(stat^.getKol(1, iteration), help);
writeMSG(concat('kol for first source = ', help));
str(stat^.getKobr(1, iteration), help);
writeMSG(concat('kobr for first source = ', help));
str(stat^.getKotk(1, iteration), help);
writeMSG(concat('kotk for first source = ', help));
str(stat^.getKol(2, iteration), help);
writeMSG(concat('kol for second source = ', help));
str(stat^.getKobr(2, iteration), help);
writeMSG(concat('kobr for second source = ', help));
str(stat^.getKotk(2, iteration), help);
writeMSG(concat('kotk for second source = ', help));
stat^.calculateProbabilityOfReject(iteration);
str(stat^.getProbabilityOfReject(1, iteration):0:2, help);
writeMSG(concat('P for first source = ', help));
str(stat^.getProbabilityOfReject(2, iteration):0:2, help);
writeMSG(concat('P for second source = ', help));
str(stat^.getAverageExpectionTime(1, iteration):4:3, help);
writeMSG(concat('M for first source = ', help));
str(stat^.getAverageExpectionTime(2, iteration):4:3, help);
writeMSG(concat('M for second source = ', help));
str(stat^.getCommonAvExpTime(iteration):4:3, help);
writeMSG(concat('Common M = ', help));
str(stat^.getQuantityRequestInBuffer(1, iteration), help);
writeMSG(concat('Quantity of request in buffer for first source = ', help));
str(stat^.getQuantityRequestInBuffer(2, iteration), help);
writeMSG(concat('Quantity of request in buffer for second source = ', help));
writeMSG(' ');
writeMSG('#################################################################################');
end;
procedure WriterObj.averageQuantityOfRequestInBufferMSG;
var
help : string;
begin
writeMSG(' ');
str(stat^.getAverageQuantityRequestInBuffer(1), help);
writeMSG(concat('Average quantity of request in Buffer for first source = ', help));
str(stat^.getAverageQuantityRequestInBuffer(2), help);
writeMSG(concat('Average quantity of request in Buffer for second source = ', help));
end;
procedure WriterObj.resetFile;
begin
rewrite(output);
end;
BEGIN
END. |
unit ff7snd;
interface
Uses MMSystem, Classes, SysUtils, Cappo, RiffUtil;
Const
WAVE_FORMAT_ADPCM = $2;
Type
EFF7Error = class(Exception);
TADPCMCoefset = packed record
iCoef1,iCoef2: Smallint;
end;
TFF7SndHeader = packed record
Length, Offset: Longint;
ZZ1: Array[0..15] of Char;
wfex: TWaveFormatEx;
wSamplesPerBlock,wNumCoef: Word;
aCoef: Array[0..7] of TADPCMCoefset;
end;
TFF7SoundDesc = packed record
Index: Integer;
Freq: Integer;
Size: Integer;
end;
TFF7Sound = class
private
FNumFiles: Integer;
Offsets: TList;
Datfile: TFileStream;
Hdrfile: TMemoryStream;
SrcPath: String;
procedure LoadHeader;
function GetDesc(Index:Integer): TFF7SoundDesc;
function GetSoundData(Num:Integer):TMemoryStream;
procedure SetSoundData(Num:Integer;Mem:TMemoryStream);
public
Constructor CreateFromFolder(Fld:String);
Destructor Destroy; Override;
procedure PlaySound(Num:Integer);
property NumFiles: Integer read FNumFiles;
property Data[Index:Integer]: TMemoryStream read GetSoundData write SetSoundData;
property Sounds[Index:Integer]: TFF7SoundDesc read GetDesc;
property Path: String read SrcPath;
end;
implementation
Constructor TFF7Sound.CreateFromFolder(Fld:String);
begin
Inherited;
Datfile := TFileStream.Create(Fld+'AUDIO.DAT',fmOpenReadWrite or fmShareDenyWrite);
Hdrfile := TMemoryStream.Create;
Hdrfile.LoadFromFile(Fld+'AUDIO.FMT');
Offsets := TList.Create;
LoadHeader;
SrcPath := Fld;
end;
Destructor TFF7Sound.Destroy;
begin
Hdrfile.Free; Datfile.Free; Offsets.Free;
end;
procedure TFF7Sound.LoadHeader;
var
N: Integer;
Head: TFF7SndHeader;
begin
N := 0; FNumFiles := 0;
Hdrfile.Position := 0;
While N<Hdrfile.Size do begin
Hdrfile.Position := N;
Hdrfile.ReadBuffer(Head,Min(Sizeof(Head),Hdrfile.Size-N));
If (Head.Length=0) then begin
Inc(N,42); Continue;
end;
Offsets.Add(Pointer(N));
Inc(N,46+Head.wNumCoef*4);
Inc(FNumFiles);
end;
end;
function TFF7Sound.GetDesc(Index:Integer): TFF7SoundDesc;
var
Head: TFF7SndHeader;
OS: Integer;
begin
Result.Index := Index;
OS := Integer(Offsets[Index]);
Hdrfile.Position := OS;
Hdrfile.ReadBuffer(Head,Sizeof(Head));
Result.Freq := Head.wfex.nSamplesPerSec;
Result.Size := Head.Length;
end;
procedure TFF7Sound.PlaySound(Num:Integer);
var
Mem: TMemoryStream;
begin
Mem := GetSoundData(Num);
MMSystem.PlaySound(Mem.Memory,0,SND_MEMORY or SND_NODEFAULT or SND_SYNC);
Mem.Free;
end;
function TFF7Sound.GetSoundData(Num:Integer):TMemoryStream;
var
FCC: String[4];
Head: TFF7SndHeader;
OS: Integer;
I: Integer;
begin
OS := Integer(Offsets[Num]);
Hdrfile.Position := OS;
Hdrfile.ReadBuffer(Head,Sizeof(Head));
Result := TMemoryStream.Create;
FCC := 'RIFF';
Result.WriteBuffer(FCC[1],4);
I := Head.Length+38;
If Head.wfex.cbSize<>0 then Inc(I,4+Head.wNumCoef*4);
Result.WriteBuffer(I,4);
FCC := 'WAVE';
Result.WriteBuffer(FCC[1],4);
FCC := 'fmt ';
Result.WriteBuffer(FCC[1],4);
I := 18;
If Head.wfex.cbSize<>0 then Inc(I,4+Head.wNumCoef*4);
Result.WriteBuffer(I,4);
Result.WriteBuffer(Head.wfex,I);
FCC := 'data';
Result.WriteBuffer(FCC[1],4);
I := Head.Length;
Result.WriteBuffer(I,4);
Datfile.Position := Head.Offset;
Result.CopyFrom(Datfile,Head.Length);
Result.Position := 0;
end;
procedure TFF7Sound.SetSoundData(Num:Integer;Mem:TMemoryStream);
var
Riff: TRIFFFile;
Root,Node: TRIFFNode;
Dat: TMemoryStream;
wfex: TWaveFormatEx;
Head: TFF7SndHeader;
OS: Integer;
begin
Riff := TRIFFFile.CreateFromStream(Mem);
Root := Riff.GetTopNode;
Node := nil; Dat := nil;
try
Node := Root.Children[0];
If Node.SubType <> 'WAVE' then raise EFF7Error.Create('Error: Input data not Microsoft ADPCM wave format!');
Node := Node.GetChildByName('fmt ');
If Node=nil then raise EFF7Error.Create('Error: Input data not Microsoft ADPCM wave format!');
Dat := Node.GetDataStream;
Dat.Position := 0;
Dat.ReadBuffer(wfex,Sizeof(wfex));
If wfex.wFormatTag <> WAVE_FORMAT_ADPCM then raise EFF7Error.Create('Error: Input data not Microsoft ADPCM wave format!');
OS := Integer(Offsets[Num]);
Hdrfile.Position := OS;
Hdrfile.ReadBuffer(Head,Sizeof(Head));
Dat.Position := 0;
Dat.ReadBuffer(Head.wfex,Dat.Size);
Dat.Free; Dat := nil;
Node := Root.Children[0];
Node := Node.GetChildByName('data');
Dat := Node.GetDataStream;
Head.Offset := Datfile.Size;
Head.Length := Dat.Size;
Dat.Position := 0;
Datfile.Position := Datfile.Size;
Datfile.CopyFrom(Dat,Dat.Size);
Dat.Free; Dat := nil;
Hdrfile.Position := OS;
Hdrfile.WriteBuffer(Head,Sizeof(Head));
Hdrfile.SaveToFile(SrcPath+'AUDIO.FMT');
finally
If Dat<>nil then Dat.Free;
If Node<>nil then Node.Free;
Root.Free;
end;
end;
end.
|
namespace RemObjects.DataAbstract.CodeGen4;
interface
uses
System,
System.Collections.Generic,
System.Text,
RemObjects.SDK.CodeGen4,
RemObjects.DataAbstract.Schema;
type
[System.Reflection.ObfuscationAttribute(Exclude := True, ApplyToMembers := True)]
CocoaTableDefinitionsCodeGen = public class
private
var fLanguage: String; readonly;
class method BuildCodegenModelForSchemaField(field: SchemaField): CGPropertyDefinition;
class method BuildCodegenModelForSchemaTable(table: SchemaDataTable): CGTypeDefinition;
class method BuildCodegenModelForSchema(schema: Schema; skippedTables: ICollection<String>; &namespace: String; includePrivateTables: Boolean): CGCodeUnit;
public
constructor(language: String);
method Generate(schema: Schema; schemaName: String; schemaUri: String; &namespace: String; skippedTables: ICollection<String>; includePrivateTables: Boolean): String;
end;
implementation
constructor CocoaTableDefinitionsCodeGen(language: String);
begin
self.fLanguage := language;
end;
method CocoaTableDefinitionsCodeGen.Generate(schema: Schema; schemaName: String; schemaUri: String; &namespace: String; skippedTables: ICollection<String>; includePrivateTables: Boolean): String;
begin
var gen: CGCodeGenerator := nil;
case self.fLanguage.ToLowerInvariant() of
'oxygene', 'pas', '.pas': gen := new CGOxygeneCodeGenerator();
'hydrogene' , 'cs', '.cs': gen := new CGCSharpCodeGenerator(Dialect := CGCSharpCodeGeneratorDialect.Hydrogene);
'silver', 'swift', '.swift': gen := new CGSwiftCodeGenerator(Dialect := CGSwiftCodeGeneratorDialect.Silver);
'iodine', 'java', '.java': gen := new CGJavaCodeGenerator(Dialect := CGJavaCodeGeneratorDialect.Iodine);
'mercury', 'vb', '.vb': gen := new CGVisualBasicNetCodeGenerator(Dialect := CGVisualBasicCodeGeneratorDialect.Mercury);
else raise new NotSupportedException(String.Format('Unable to generate Cocoa Table Definitions. Unsupported language {0}', self.fLanguage));
end;
//gen.useTabs := false;
var lUnit := CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchema(schema, skippedTables, &namespace, includePrivateTables);
//gen.Build(cgModel);
var code: String := gen.GenerateUnit(lUnit);
var lResult: StringBuilder := new StringBuilder();
lResult.AppendLine("//------------------------------------------------------------------------------");
lResult.AppendLine("// This file was auto-generated.");
if not String.IsNullOrEmpty(schemaName) then
lResult.AppendLine(String.Format('//#DA Schema Name:"{0}"', schemaName));
if not String.IsNullOrEmpty(schemaUri) then
lResult.AppendLine(String.Format('//#DA Schema Source:"{0}"', schemaUri));
if includePrivateTables then
lResult.Append('//#DA Add Private Tables');
if skippedTables.Count > 0 then begin
lResult.Append('//#DA Skipped Tables:"');
for each table in skippedTables index i do begin
if i > 0 then
lResult.Append(',');
lResult.Append(table);
end;
lResult.AppendLine('"');
end;
lResult.AppendLine("//------------------------------------------------------------------------------");
lResult.AppendLine(code);
exit lResult.ToString();
end;
class method CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchemaField(field: SchemaField): CGPropertyDefinition;
begin
var typeRef: CGTypeReference := nil;
case field.DataType of
DataType.String,
DataType.WideString,
DataType.FixedChar,
DataType.FixedWideChar,
DataType.Memo,
DataType.WideMemo:
typeRef := CGPredefinedTypeReference.String;
DataType.DateTime:
typeRef := new CGNamedTypeReference('NSDate') isClassType(true); // DefaultNullability will be set to CGTypeNullabilityKind.NullableUnwrapped by constructor
DataType.Float,
DataType.Currency,
DataType.AutoInc,
DataType.Integer,
DataType.LargeInt,
DataType.Boolean,
DataType.LargeAutoInc,
DataType.Byte,
DataType.ShortInt,
DataType.Word,
DataType.SmallInt,
DataType.Cardinal,
DataType.LargeUInt,
DataType.Decimal,
DataType.SingleFloat:
typeRef := new CGNamedTypeReference('NSNumber') isClassType(true); // DefaultNullability will be set to CGTypeNullabilityKind.NullableUnwrapped by constructor
DataType.Xml:
typeRef := new CGNamedTypeReference('ROXML') isClassType(true); // DefaultNullability will be set to CGTypeNullabilityKind.NullableUnwrapped by constructor
DataType.Guid:
typeRef := new CGNamedTypeReference('ROGUID') isClassType(true); // DefaultNullability will be set to CGTypeNullabilityKind.NullableUnwrapped by constructor
DataType.Blob:
typeRef := new CGNamedTypeReference('NSData') isClassType(true); // DefaultNullability will be set to CGTypeNullabilityKind.NullableUnwrapped by constructor
else
typeRef := new CGNamedTypeReference('UNSUPPORTED_TYPE_' + field.DataType.ToString());
end;
{var nonAtomicModifier: CGModifierTypeRef := new CGModifierTypeRef();
nonAtomicModifier.Type := CGModifierType.Nonatomic;
nonAtomicModifier.SubType := typeRef;
var strongModifier: CGModifierTypeRef := new CGModifierTypeRef();
strongModifier.Type := CGModifierType.Strong;
strongModifier.SubType := nonAtomicModifier; // nested}
result := new CGPropertyDefinition(field.Name, typeRef);
result.Visibility := CGMemberVisibilityKind.Unspecified;
result.Dynamic := true;
result.Atomic := false;
end;
class method CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchemaTable(table: SchemaDataTable): CGTypeDefinition;
begin
var name := table.Name.Replace('.', '');
var t := new CGInterfaceTypeDefinition(String.Format('I{0}Row_Protocol', name));
t.Visibility := CGTypeVisibilityKind.Public;
for each f: SchemaField in table.Fields do
t.Members.Add(CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchemaField(f));
result := t;
end;
class method CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchema(schema: Schema; skippedTables: ICollection<String>; &namespace: String; includePrivateTables: Boolean): CGCodeUnit;
begin
var ns: CGNamespaceReference := iif(not String.IsNullOrEmpty(&namespace), new CGNamespaceReference(&namespace), nil);
var f := new CGCodeUnit(ns);
f.Imports.Add(new CGImport('Foundation'));
f.Imports.Add(new CGImport('DataAbstract'));
// Get Schema Tables list
var lSchemaTables: ICollection<SchemaDataTable> := schema.GetAllDatasets(not includePrivateTables);
for each table: SchemaDataTable in lSchemaTables do begin
if skippedTables.Contains(table.Name) then
continue;
var t := CocoaTableDefinitionsCodeGen.BuildCodegenModelForSchemaTable(table);
f.Types.Add(t)
end;
exit f;
end;
end. |
PROGRAM UnitTest;
USES CIStringSetUnit, StringSetUnit;
FUNCTION IntToString(x: INTEGER): STRING;
VAR s: STRING;
BEGIN (* IntToString *)
Str(x, s);
IntToString := s;
END; (* IntToString *)
VAR s1, t: CIStringSet;
s2: CIStringSetObj;
i: INTEGER;
BEGIN (* UnitTest *)
New(s1, Init(5));
s2.Init(5);
s1^.Add('EINS');
s1^.Add('zwei');
s1^.Add('drEi');
s2.Add('einS');
s2.Add('ZwEi');
s2.Add('zwei');
s2.Add('EinS');
s1^.Test;
s2.Test;
Union(s1, @s2, t);
WriteLn('Union:');
t^.Test;
t^.Add('einS');
WriteLn('Versuch, einS hinzuzufuegen:');
t^.Test;
Dispose(t, Done);
Intersect(s1, @s2, t);
WriteLn('Intersect:');
t^.Test;
t^.Remove('einS');
WriteLn('Versuch, einS zu entfernen:');
t^.Test;
Dispose(t, Done);
Difference(s1, @s2, t);
WriteLn('Difference:');
t^.Test;
Write('Contains "einS"? ');
WriteLn(t^.Contains('einS'));
Write('Contains "dRei"? ');
WriteLn(t^.Contains('dRei'));
Dispose(s1, Done);
s2.Done;
Dispose(t, Done);
END. (* UnitTest *) |
unit ncgPrintInstall;
interface
uses
SysUtils, Classes;
procedure RemovePrinters(aNex: Boolean);
procedure InstallNexPrinter(aForce: Boolean);
function NexPrinterInstalled: Boolean;
function GetPrinterList(const aExcludeNexcafe: Boolean=false): TStrings;
implementation
uses
ncShellStart,
Windows,
Winspool,
{$IFNDEF NOLOG}
uLogs,
{$ENDIF}
strutils,
ncPRConsts;
function GetPrinterList(const aExcludeNexcafe: Boolean=false): TStrings;
var
Buffer, PrinterInfo: PChar;
Flags, Count, NumInfo: DWORD;
i: Integer;
Level: Byte;
begin
Result := TStringList.Create;
if Win32Platform = VER_PLATFORM_WIN32_NT then
begin
Flags := PRINTER_ENUM_LOCAL;
Level := 4;
end else
begin
Flags := PRINTER_ENUM_LOCAL;
Level := 5;
end;
Count := 0;
EnumPrinters(Flags, nil, Level, nil, 0, Count, NumInfo);
if Count > 0 then
begin
GetMem(Buffer, Count);
try
if not EnumPrinters(Flags, nil, Level, PByte(Buffer), Count, Count, NumInfo) then Exit;
PrinterInfo := Buffer;
for i := 0 to NumInfo - 1 do
begin
if Level = 4 then begin
if not(aExcludeNexcafe) or (Pos(kNexPrinterName, PPrinterInfo4(PrinterInfo)^.pPrinterName)=0) then
Result.Add(PPrinterInfo4(PrinterInfo)^.pPrinterName);
Inc(PrinterInfo, SizeOf(TPrinterInfo4));
end else begin
if not(aExcludeNexcafe) or (Pos(kNexPrinterName, PPrinterInfo5(PrinterInfo)^.pPrinterName)=0) then
Result.Add(PPrinterInfo5(PrinterInfo)^.pPrinterName);
Inc(PrinterInfo, SizeOf(TPrinterInfo5));
end;
end;
finally
FreeMem(Buffer, Count);
end;
end;
end;
function NexPrinterInstalled : Boolean;
var
Printers: TStrings;
I : Integer;
begin
Result := True;
Printers := GetPrinterList;
try
for I := 0 to Printers.Count-1 do
if Pos(kNexPrinterName, Printers[i])>0 then
Exit;
Result := False;
finally
{$IFNDEF NOLOG}
GLog.Log(nil,[lcTrace],'NexPrinterInstalled: '+boolTostr(result,true));
{$ENDIF}
Printers.Free;
end;
end;
procedure RemovePrinters(aNex: Boolean);
var
Printers: TStrings;
I : Integer;
Remover : Boolean;
//uninsDir : string;
//uninsXXX : string;
//sr: TSearchRec;
begin
{$IFNDEF NOLOG}
GLog.Log(nil,[lcTrace],'RemovePrinters');
{$ENDIF}
Printers := GetPrinterList;
try ;
for I := 0 to Printers.Count-1 do
if (Pos(kNexPrinterName, Printers[i])>0)=aNex then begin
{$IFNDEF NOLOG}
GLog.Log(nil,[lcTrace],'RemovePrinters - OK: '+Printers[i]);
{$ENDIF}
ShellStart('rundll32', 'printui.dll, PrintUIEntry /dl /q /n"'+Printers[i]+'"');
end;
finally
Printers.Free;
end;
end;
{
/HidePrinterPages="01100000000010"
"0" - show page
"1" - hide page
Page positions in above parameter string:
1 Pages
2 Graphics
3 Fonts
4 Document
5 Security
6 Links
7 Bookmarks
8 Watermarks
9 Save
10 Overlay
11 Emails
12 Profiles
13 Language
14 Signature
}
procedure InstallNexPrinter(aForce: Boolean);
var
sPath: String;
begin
if (not aForce) and NexPrinterInstalled then Exit;
sPath := ExtractFilePath(ParamStr(0));
GLog.Log(nil,[lcTrace],'InstallNexPrinter: NexPrinter');
GLog.Log(nil,[lcTrace],'InstallNexPrinter driver: '+sPath+'novapv.exe');
if not fileexists(sPath+'novapv.exe') then
GLog.Log(nil,[lcExcept],'InstallNexPrinter driver: '+sPath+'novapv.exe NOT FOUND');
//OEMSaveFile="[YMD][HIS]_[C]_[P]"
{
[YMD] - Date in the format YYYYMMDD (year, month, day)
[HIS] - time in the format hhmmss (hour, minute, second)
[P] - Name of the profile currently loaded
[C] - Counter in the format cc (it begins with 01 and increases at each printed document, if a file with the same name exists in the save folder)
}
ShellStartCustom(sPath+'novapv.exe',
'/VERYSILENT '+
'/SUPPRESSMSGBOXES '+
'/NORESTART '+
'/NOCANCEL '+
'/DIR="'+sPath+'\print\drv" '+
'/OEMCompany="Nextar Software" '+
'/OEMSaveFolder="'+sPath+'Print\pend\0" '+
'/OEMSaveFile="[N]" '+
'/OEMSaveConflict=1 '+
'/OEMApplication="NexCafé" '+
'/OEMActionApp="'+sPath+kAfterPrintFileName+'" '+
'/OEMActionAppArg="#1" '+
'/PrinterName="Impressora NexCafé" '+
'/RegisterName="Nextar Software" '+
'/OEMDllName="'+sPath+'nxnex.dll" ' +
'/OEMFunctionName="OEMFunction" ' +
'/RegisterKey="Y1BT-850T-XNPM-Z6GK-TMRJ-VTTP-L26B-W514" '+
'/Default '+
// '/NoInstallIfExists '+
'/HidePrinterPages="01111111111111" '+
'/ImportProfiles="'+sPath+'nexcafe.nve'+'" '+
'/Group="NexCafé" ',
sPath, 0, SW_HIDE, 'open', False
);
//ShellStartCustom(aCmd, aParams, aDir: String; FormHWND: HWND; nShow: Integer = SW_SHOWNORMAL; aVerb: String = 'open'; aWait:boolean=false);
end;
end.
|
(* StackADT3: SWa, 2020-04-15 *)
(* ---------- *)
(* Stack abstract data type - version 3. *)
(* ========================================================================= *)
UNIT StackADT3;
INTERFACE
TYPE
StackPtr = ^Stack;
Stack = RECORD
max: INTEGER;
top: INTEGER;
data: ARRAY [1..1] OF INTEGER;
END; (* Stack *)
FUNCTION NewStack(max: INTEGER): StackPtr;
PROCEDURE DisposeStack(VAR s: StackPtr);
PROCEDURE Push(s: StackPtr; value: INTEGER);
FUNCTION Pop(s: StackPtr): INTEGER;
FUNCTION Empty(s: StackPtr): BOOLEAN;
IMPLEMENTATION
FUNCTION NewStack(max: INTEGER): StackPtr;
VAR
s: StackPtr;
BEGIN (* NewStack *)
GetMem(s, (2 + max) * SizeOf(INTEGER));
s^.max := max;
s^.top := 0;
NewStack := s;
END; (* NewStack *)
PROCEDURE DisposeStack(VAR s: StackPtr);
BEGIN (* DisposeStack *)
FreeMem(s, (2 + s^.max) * SizeOf(INTEGER));
s := NIL;
END; (* DisposeStack *)
PROCEDURE Push(s: StackPtr; value: INTEGER);
BEGIN (* Push *)
IF (s^.top = s^.max) THEN BEGIN
WriteLn('ERROR: stack full');
HALT;
END; (* IF *)
s^.top := s^.top + 1;
{$R-}
s^.data[s^.top] := value;
{$R+}
END; (* Push *)
FUNCTION Pop(s: StackPtr): INTEGER;
VAR
value: INTEGER;
BEGIN (* Pop *)
IF (s^.top = 0) THEN BEGIN
WriteLn('ERROR: stack empty');
HALT;
END; (* IF *)
{$R-}
value := s^.data[s^.top];
{$R+}
s^.top := s^.top - 1;
Pop := value;
END; (* Pop *)
FUNCTION Empty(s: StackPtr): BOOLEAN;
BEGIN (* Empty *)
Empty := (s^.top = 0);
END; (* Empty *)
END. (* StackADT3 *)
|
unit uConnect;
interface
uses IniFiles,Forms,SysUtils,JSON,REST.Client,REST.Types;
type
TCfgConnect = class(TIniFile)
private
function GetEndereco: String;
function GetPorta: Integer;
procedure SetEndereco(const Value: String);
procedure SetPorta(const Value: Integer);
public
property Endereco: String read GetEndereco write SetEndereco;
property Porta: Integer read GetPorta write SetPorta;
constructor Create; reintroduce;
end;
TConnect = class
private
FModel: String;
FRestRequest: TRESTRequest;
FRestClient: TRESTClient;
FRestResponse: TRESTResponse;
public
property Model: String read FModel write FModel;
function Get(const AFilter: String = ''): TJSONArray; virtual;
function Upsert(const AParam: String = ''): TJSONObject; virtual;
function GetByID(const AID: Integer): TJSONObject;
function Count(const AFilter: String = ''): TJSONObject;
function FindOne(const AFilter: String = ''): TJSONObject;
constructor Create; virtual;
destructor Destroy; override;
end;
var
Cfg: TCfgConnect;
implementation
{ TCfgConnect }
constructor TCfgConnect.Create;
begin
inherited Create(ExtractFilePath(Application.ExeName) + Application.Title + '.ini');
end;
function TCfgConnect.GetEndereco: String;
begin
Result := ReadString('CFG','ENDERECO','');
end;
function TCfgConnect.GetPorta: Integer;
begin
Result := ReadInteger('CFG','PORTA',80);
end;
procedure TCfgConnect.SetEndereco(const Value: String);
begin
WriteString('CFG','ENDERECO',Value);
end;
procedure TCfgConnect.SetPorta(const Value: Integer);
begin
WriteInteger('CFG','PORTA',Value);
end;
{ TConnect }
function TConnect.Count(const AFilter: String): TJSONObject;
begin
end;
constructor TConnect.Create;
begin
FRestClient := TRESTClient.Create(nil);
FRestRequest := TRESTRequest.Create(nil);
FRestResponse := TRESTResponse.Create(nil);
FRestRequest.Resource := FModel;
FRestRequest.Client := FRestClient;
FRestRequest.Response := FRestResponse;
FRestClient.BaseURL := Cfg.Endereco + ':' + IntToStr(Cfg.Porta) + '/api';
end;
destructor TConnect.Destroy;
begin
if Assigned(FRestClient) then
FreeAndNil(FRestClient);
if Assigned(FRestRequest) then
FreeAndNil(FRestRequest);
if Assigned(FRestResponse) then
FreeAndNil(FRestResponse);
inherited;
end;
function TConnect.FindOne(const AFilter: String): TJSONObject;
begin
end;
function TConnect.Get(const AFilter: String): TJSONArray;
begin
FRestRequest.Method := rmGET;
FRestRequest.Execute;
Result := FRestResponse.JSONValue as TJSONArray;
end;
function TConnect.GetByID(const AID: Integer): TJSONObject;
begin
end;
function TConnect.Upsert(const AParam: String = ''): TJSONObject;
var
Parameter: TRESTRequestParameter;
begin
FRestRequest.Params.Clear;
if AParam <> '' then
begin
with FRestRequest.Params.AddItem do
begin
Kind := pkGETorPOST;
ContentType := ctAPPLICATION_JSON;
Value := AParam;
end;
end;
FRestRequest.Method := rmPOST;
FRestRequest.Execute;
Result := FRestResponse.JSONValue as TJSONObject;
end;
initialization
Cfg := TCfgConnect.Create;
finalization
if Assigned(Cfg) then
FreeAndNil(Cfg);
end.
|
{
Main source of the Lazarus Mazes program.
A maze implementation based on a depth-first backtracking algorithm.
For more detais, see wikipedia:
http://en.wikipedia.org/wiki/Maze_generation_algorithm#Recursive_backtracker
Copyright (C) 2012 G.A. Nijland (eny @ lazarus forum http://www.lazarus.freepascal.org/)
This source 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 code 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.
A copy of the GNU General Public License is available on the World Wide Web at
<http://www.gnu.org/copyleft/gpl.html>. You can also obtain it by writing to the Free Software Foundation, Inc., 59
Temple Place - Suite 330, Boston, MA 02111-1307, USA.
}
program Lazes;
{$mode objfpc}{$H+}
uses
Interfaces, Forms, ufrmmain1, Maze, MazePainter, MazeBuilderDepthFirst, ufrmScaling, LazesGlobals
{ you can add units after this };
{$R *.res}
begin
Application.Initialize;
Application.CreateForm(TfrmMain1, frmMain1);
Application.CreateForm(TfrmScaling, frmScaling);
Application.Run;
end.
|
// This unit is common to Configurator and Logger apps, listener object
unit u_Configuration_Record;
{$i xpl.inc}
interface
uses Classes,
SysUtils,
fgl,
fpc_delphi_compat,
u_xml_plugins,
u_xpl_address,
u_xpl_config,
u_xpl_messages,
u_xpl_application,
u_xpl_custom_message;
type { TConfigurationRecord ==================================================}
TConfigurationRecord = class(TPersistent)
protected
fTimer : TxPLTimer;
private
fPlug_Detail: TDeviceType;
fAddress : TxPLAddress;
fInterval : Integer;
fLastHBeat : TDateTime;
fConfig : TxPLCustomConfig;
fDieAt : TDateTime;
fWaitingConf: boolean;
fOnDied : TNotifyEvent;
function Get_CfgCurrAvail: boolean;
function Get_CfgListAvail: boolean;
function Get_XMLCfgAvail: boolean;
procedure OnTimer({%h-}sender : TObject);
public
constructor Create(const aOwner : TxPLApplication; const aAddress: TxPLAddress; const aDieProc : TNotifyEvent);
constructor Create(const aOwner : TxPLApplication; const aHBeatMsg : THeartBeatMsg; const aDieProc : TNotifyEvent);overload;
destructor Destroy; override;
procedure HBeatReceived(const aHBeatMsg : THeartBeatMsg);
published
property CfgListAvail : boolean read Get_CfgListAvail;
property CfgCurrAvail : boolean read Get_CfgCurrAvail;
property XMLCfgAvail : boolean read Get_XMLCfgAvail;
property LastHBeat : TDateTime read fLastHBeat write fLastHBeat;
property DieAt : TDateTime read fDieAt write fDieAt;
property Address : TxPLAddress read fAddress;
property Config : TxPLCustomConfig read fConfig;
property Plug_Detail : TDeviceType read fPlug_Detail;
property WaitingConf : boolean read fWaitingConf write fWaitingConf;
property OnDied : TNotifyEvent read fOnDied write fOnDied;
property Interval : integer read fInterval;
end;
TConfigurationRecordList = specialize TFPGMap<string,TConfigurationRecord>;
implementation // =============================================================
uses DateUtils,
uxPLConst,
u_xpl_schema
;
{ TConfigurationRecord }
constructor TConfigurationRecord.Create(const aOwner: TxPLApplication; const aAddress: TxPLAddress; const aDieProc : TNotifyEvent);
begin
inherited Create;
fAddress := TxPLAddress.Create(aAddress);
fConfig := TxPLCustomConfig.Create(nil);
fPlug_Detail := aOwner.VendorFile.FindDevice(aAddress);
fInterval := -1;
fOnDied := aDieProc;
if fOnDied<>nil then begin
fTimer := xPLApplication.TimerPool.Add(60 * 1000, {$ifdef fpc}@{$endif}OnTimer);
fTimer.Enabled := true;
end;
end;
constructor TConfigurationRecord.Create(const aOwner : TxPLApplication; const aHBeatMsg : THeartBeatMsg; const aDieProc : TNotifyEvent);
begin
Create(aOwner,aHBeatMsg.Source,aDieProc);
HBeatReceived(aHBeatMsg);
end;
procedure TConfigurationRecord.HBeatReceived(const aHBeatMsg : THeartBeatMsg);
begin
fLastHBeat := now;
fInterval := aHBeatMsg.Interval;
if not aHBeatMsg.Schema.Equals(Schema_HBeatEnd)
then fDieAt := IncMinute( fLastHBeat, 2 * Int64(Succ(Interval))) // Defined by specifications as dead-line limit)
else begin
fDieAt := now;
OnTimer(self);
end;
fWaitingConf := aHBeatMsg.Schema.Equals(Schema_ConfigApp);
end;
destructor TConfigurationRecord.Destroy;
begin
fAddress.Free;
fConfig.Free;
inherited;
end;
function TConfigurationRecord.Get_CfgCurrAvail: boolean;
begin
result := Config.IsValid;
end;
function TConfigurationRecord.Get_CfgListAvail: boolean;
begin
result := Config.IsValid;
end;
function TConfigurationRecord.Get_XMLCfgAvail: boolean;
begin
result := plug_detail <> nil;
end;
procedure TConfigurationRecord.OnTimer(sender: TObject);
begin
if Assigned(OnDied) and (DieAt < now) then OnDied(self)
end;
end.
|
unit BabyList;
interface
uses
System.SysUtils, System.Types, System.UITypes, System.Classes, System.Variants,
FMX.Types, FMX.Graphics, FMX.Controls, FMX.Forms, FMX.Dialogs, FMX.StdCtrls,
Data.Bind.EngExt, Fmx.Bind.DBEngExt, System.Rtti, System.Bindings.Outputs,
Fmx.Bind.Editors, FMX.ListView.Types, FMX.ListView.Appearances,
FMX.ListView.Adapters.Base, FMX.ListView, Data.Bind.Components,
Data.Bind.ObjectScope,
System.Generics.Collections, Data.Bind.Grid, FMX.Grid.Style, Fmx.Bind.Grid,
FMX.Controls.Presentation, FMX.ScrollBox, FMX.Grid, FMX.Objects, Data.Bind.GenData, Fmx.Bind.GenData, FMX.Layouts, FMX.ListBox, FMX.Effects, FMX.Filter.Effects, FireDAC.Stan.Intf,
FireDAC.Stan.Option, FireDAC.DatS, FireDAC.Phys.Intf, FireDAC.DApt.Intf, FireDAC.DApt, FireDAC.Comp.Client;
type
TFBabyList = class(TFrame)
BindingsList1: TBindingsList;
DataGeneratorAdapter1: TDataGeneratorAdapter;
LstBoxBabys: TListBox;
AdapterBindSource2: TAdapterBindSource;
LinkFillControlToField: TLinkFillControlToField;
InfoLabel: TLabel;
Resources1: TStyleBook;
private
procedure DoInfoClick(Sender: TObject);
procedure DoVisibleChange(Sender: TObject);
procedure DoSaveClick(Sender: TObject); { Déclarations privées }
public
procedure BindSourceAdapterReload();
{ Déclarations publiques }
end;
implementation
uses uBaby, MainModule;
var
listBaby : TList<TBaby>;
{$R *.fmx}
procedure TFBabyList.BindSourceAdapterReload();
var
I: Integer;
var
Item: TListBoxItem;
begin
LstBoxBabys.Clear;
AdapterBindSource2.Active := False;
// create custom item
listBaby :=DMMainModule.GetBabyList();
LstBoxBabys.BeginUpdate;
for I := 0 to listBaby.Count-1 do
begin
Item := TListBoxItem.Create(nil);
Item.Parent := LstBoxBabys;
Item.StyleLookup := 'CustomItem';
Item.Text := listBaby.Items[i].lastName; // set filename
// if Odd(Item.Index) then
// Item.ItemData.Bitmap := Image1.Bitmap // set thumbnail
// else
Item.ItemData.Bitmap := listBaby.Items[i].profileImage; // set thumbnail
Item.StylesData['Age'] := listBaby.Items[i].Age; // set size
Item.StylesData['Firstname'] := listBaby.Items[i].firstName;
Item.StylesData['visible'] :=listBaby.Items[i].Present ; // set Checkbox value
Item.StylesData['visible.OnChange'] := TValue.From<TNotifyEvent>(DoVisibleChange); // set OnChange value
Item.StylesData['info.OnClick'] := TValue.From<TNotifyEvent>(DoInfoClick); // set OnClick value
Item.StylesData['save.OnClick'] := TValue.From<TNotifyEvent>(DosaveClick); // set OnClick value
end;
LstBoxBabys.EndUpdate;
//if u wanna Using livebinding
{
AdapterBindSource2.Adapter := TListBindSourceAdapter<TBaby>.Create(self,listBaby,True);
AdapterBindSource2.Active := True;}
end;
function FindItemParent(Obj: TFmxObject; ParentClass: TClass): TFmxObject;
begin
Result := nil;
if Assigned(Obj.Parent) then
if Obj.Parent.ClassType = ParentClass then
Result := Obj.Parent
else
Result := FindItemParent(Obj.Parent, ParentClass);
end;
procedure TFBabyList.DoInfoClick(Sender: TObject);
var
Item : TListBoxItem;
begin
Item := TListBoxItem(FindItemParent(Sender as TFmxObject,TListBoxItem));
if Assigned(Item) then
begin
InfoLabel.Text := 'Baby ID : ( ' + ListBaby.Items[Item.Index].id.ToString + ' )';
end;
end;
procedure TFBabyList.DoSaveClick(Sender: TObject);
var
Item : TListBoxItem;
begin
Item := TListBoxItem(FindItemParent(Sender as TFmxObject,TListBoxItem));
if Assigned(Item) then
begin
DMMainModule.SetBabyPresent(ListBaby.Items[Item.Index].id,Item.StylesData['visible'].AsBoolean);
InfoLabel.Text := 'Baby ID ( ' + ListBaby.Items[Item.Index].id.ToString + ' ) change status saved';
end;
end;
procedure TFBabyList.DoVisibleChange(Sender: TObject);
var
Item : TListBoxItem;
begin
Item := TListBoxItem(FindItemParent(Sender as TFmxObject,TListBoxItem));
if Assigned(Item) then
InfoLabel.Text := 'Baby ID ( ' + ListBaby.Items[Item.Index].id.ToString + ' ) Present item to ' + BoolToStr(Item.StylesData['visible'].AsBoolean, true);
end;
end.
|
unit cls_TQuotes;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs;
type
TQuotes = class
private
{ Private declarations }
clientName : string ;
totalCost : decimal ;
public
{ Public declarations }
Constructor Create (pClientName : string ; pTotalCost : float );
Function GetClientName : string ;
Function GetTotalCost : float ;
end;
implementation
{ TQuotes }
constructor TQuotes.Create(pClientName: string; pTotalCost: float);
begin
clientName := pClientName ;
totalCost := pTotalCost ;
end;
function TQuotes.GetClientName: string;
begin
Result := clientName ;
end;
function TQuotes.GetTotalCost: float;
begin
Result := totalCost ;
end;
end.
|
{*******************************************************************************
This file is part of Argument
This source file is public domain. It is provided as is, with no explicit
or implied warranties regarding anything whatsoever.
********************************************************************************
Author: Ludwig Krippahl
Date: ?.?.2009
Purpose:
Main form for argument
Requirements:
Revisions:
To do:
check conversion from Delphi and using new shared units
call help
*******************************************************************************}
unit argmain;
{$mode objfpc}{$H+}
interface
uses
Classes, SysUtils, FileUtil, LResources, Forms, Controls, Graphics, Dialogs,
ComCtrls, StdCtrls, ExtCtrls, Menus,argobjects, filebuffer,basetypes,
stringutils,miscutils,Clipbrd;
const
//V0: deprecated 27-09-09, changed to UTF8/lazarus
SessionVersion=1;
ControlBorder=10;
type
{ TMainForm }
TMainForm = class(TForm)
KeyEd: TEdit;
OPNLObjectionsLbl: TLabel;
OPNLReasonsLbl: TLabel;
MainMenu1: TMainMenu;
FileMi: TMenuItem;
ObjectObjectionsMm: TMemo;
ObjectTextMm: TMemo;
MenuItem2: TMenuItem;
MenuItem3: TMenuItem;
OpenDialog1: TOpenDialog;
OpenMi: TMenuItem;
ObjectPropPnl: TPanel;
SaveDialog1: TSaveDialog;
SaveMi: TMenuItem;
ClearMi: TMenuItem;
SmallFontMi: TMenuItem;
LargeFontMi: TMenuItem;
ObjectsPb: TPaintBox;
StatementsMm: TMemo;
TextMm: TMemo;
PageControl1: TPageControl;
TextsTs: TTabSheet;
DiagramTs: TTabSheet;
procedure FormResize(Sender: TObject);
procedure LargeFont1Click(Sender: TObject);
procedure FormActivate(Sender: TObject);
procedure SmallFontMiClick(Sender: TObject);
procedure TextMmKeyPress(Sender: TObject; var Key: Char);
procedure AddTextBtClick(Sender: TObject);
procedure FormCreate(Sender: TObject);
procedure ObjectsPbPaint(Sender: TObject);
procedure ObjectsPbMouseDown(Sender: TObject; Button: TMouseButton;
Shift: TShiftState; X, Y: Integer);
procedure ObjectsPbMouseMove(Sender: TObject; Shift: TShiftState; X,
Y: Integer);
procedure ObjectsPbDblClick(Sender: TObject);
procedure ManualAddEdKeyPress(Sender: TObject; var Key: Char);
procedure Save1Click(Sender: TObject);
procedure Open1Click(Sender: TObject);
procedure KeyEdKeyPress(Sender: TObject; var Key: Char);
procedure KeyEdKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
procedure ObjectTextMmKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
procedure ObjectPropPnlExit(Sender: TObject);
procedure Help1Click(Sender: TObject);
procedure ClearObjects(Sender:TObject);
private
{ Private declarations }
FObjects:TAOObjects;
FBmp:TBitMap;
//information for dragging objects
FGrabbed:TPoint;
FObjectGrabbed:Integer;
FDiagramKeys:Boolean;
FBackGround:TColor;
//Selected Object
FSelObject:Integer;
procedure RefreshTextsLb;
procedure SetFontSize;
procedure ResizeDiagramPage;
procedure PaintObjects;
function ObjectAt(Point:TPoint):Integer;
procedure ObjectPbOnHint(Sender:TObject);
procedure PrepareHint;
//disables or enables all diagram controls for text
procedure AddReason(s:string); //adds to ReasonsMm only
public
{ Public declarations }
end;
var
MainForm: TMainForm;
implementation
{ TMainForm }
procedure TMainForm.FormResize(Sender: TObject);
var
wid,hei:Integer;
begin
PageControl1.Width:=ClientWidth-2*PageControl1.Left;;
PageControl1.Height:=ClientHeight-2*PageControl1.Top;
DiagramTs.Height:=PageControl1.ClientHeight;
DiagramTs.Width:=PageControl1.ClientWidth;
TextsTs.Height:=PageControl1.ClientHeight;
TextsTs.Width:=PageControl1.ClientWidth;
wid:=TextsTs.ClientRect.Right-TextsTs.ClientRect.Left;
hei:=TextsTs.ClientRect.Bottom-TextsTs.ClientRect.Top;
TextMm.Left:=ControlBorder;
TextMm.Top:=ControlBorder;
TextMm.Width:=wid div 2-ControlBorder-ControlBorder div 2;
TextMm.Height:=hei-2*ControlBorder;
StatementsMm.Top:=ControlBorder;
StatementsMm.Width:=wid div 2-ControlBorder-ControlBorder div 2;
StatementsMm.Left:=wid div 2 + ControlBorder div 2;
StatementsMm.Height:=hei-2*ControlBorder;
ResizeDiagramPage;
end;
procedure TMainForm.LargeFont1Click(Sender: TObject);
begin
SetFontSize;
end;
procedure TMainForm.SetFontSize;
begin
if SmallFontMi.Checked then
begin
MainForm.Font.Size:=20;
LargeFontMi.Checked:=True;
end
else
begin
MainForm.Font.Size:=9;
SmallFontMi.Checked:=True;
end;
FormResize(nil);
end;
procedure TMainForm.ResizeDiagramPage;
begin
ObjectsPb.Left:=ControlBorder;
ObjectsPb.Width:=DiagramTs.ClientWidth-ControlBorder*2;
ObjectsPb.Top:=ControlBorder;
ObjectsPb.Height:=DiagramTs.ClientHeight-ControlBorder*2;
KeyEd.Width:=0;
KeyEd.Height:=0;
KeyEd.Left:=ControlBorder;
KeyEd.Top:=ControlBorder;
OPNLReasonsLbl.Top:=ControlBorder;
OPNLReasonsLbl.Left:=ControlBorder;
ObjectTextMm.Top:=OPNLReasonsLbl.Height+2*ControlBorder;
ObjectTextMm.Left:=ControlBorder;
ObjectTextMm.Width:=ObjectPropPnl.ClientWidth-2*ControlBorder;
ObjectTextMm.Height:=(ObjectPropPnl.ClientHeight-
5*ControlBorder-2*OPNLReasonsLbl.Height) div 2;
OPNLObjectionsLbl.Left:=ControlBorder;
OPNLObjectionsLbl.Top:=ObjectTextMm.Top+ObjectTextMm.Height+
ControlBorder;
ObjectObjectionsMm.Height:=ObjectTextMm.Height;
ObjectObjectionsMm.Left:=ControlBorder;
ObjectObjectionsMm.Width:=ObjectPropPnl.ClientWidth-2*ControlBorder;
ObjectObjectionsMm.Top:=OPNLObjectionsLbl.Height+OPNLObjectionsLbl.Top+
ControlBorder;
FBmp.Width:=ObjectsPb.Width;
FBmp.Height:=ObjectsPb.Height;
ObjectsPb.Invalidate;
PaintObjects;
end;
procedure TMainForm.FormActivate(Sender: TObject);
begin
FormResize(Sender);
end;
procedure TMainForm.SmallFontMiClick(Sender: TObject);
begin
end;
procedure TMainForm.TextMmKeyPress(Sender: TObject; var Key: Char);
begin
if (Key=#13) and (TextMm.SelLength>0) then
begin
AddTextBtClick(Sender);
Key:=#0;
end
end;
procedure TMainForm.AddTextBtClick(Sender: TObject);
var s:string;
procedure AddText(s:string);
begin
AddReason(s);
SetLength(FObjects,Length(FObjects)+1);
FObjects[High(FObjects)]:=TAOBaseObject.Create(s);
FObjects[High(FObjects)].LastPoint:=
Point(10,10);
FObjects[High(FObjects)].IsRoot:=True;
PaintObjects;
end;
begin
if TextMm.SelLength>0 then
begin
TextMm.CopyToClipboard;
s:=ClipBoard.AsText;
AddText(CleanString(s));
end;
end;
procedure TMainForm.FormCreate(Sender: TObject);
begin
FBackGround:=clBlack;
FBmp:=TBitmap.Create;
FBmp.Canvas.Brush.Color:=FBackGround;
FDiagramKeys:=True;
SetFontSize;
end;
procedure TMainForm.PaintObjects;
var f:Integer;
begin
AOClearDrawn(FObjects);
FBmp.Canvas.Brush.Color:=FBackground;
FBmp.Canvas.FillRect(Rect(0,0,FBmp.Width,FBmp.Height));
for f:=0 to High(FObjects) do
if FObjects[f].IsRoot then
FObjects[f].Draw(FObjects[f].LastPoint,FBmp);
ObjectsPbPaint(nil);//ObjectsPb.Invalidate;
end;
procedure TMainForm.ObjectsPbPaint(Sender: TObject);
begin
ObjectsPb.Canvas.Draw(0,0,FBmp);
end;
procedure TMainForm.ObjectsPbMouseDown(Sender: TObject;
Button: TMouseButton; Shift: TShiftState; X, Y: Integer);
begin
if FDiagramKeys then
begin
FGrabbed:=Point(X,Y);
FObjectGrabbed:=ObjectAt(FGrabbed);
if Button=MbRight then
begin
if FObjectGrabbed>=0 then
begin
AORemoveChild(FObjects,FObjects[FObjectGrabbed]);
AORemoveConjunct(FObjects,FObjects[FObjectGrabbed]);
FObjects[FObjectGrabbed].LastPoint:=Point(
FObjects[FObjectGrabbed].LastPoint.X+10,
FObjects[FObjectGrabbed].LastPoint.Y-10);
FObjects[FObjectGrabbed].ObType:=AOUnknown;
PaintObjects;
end;
end;
end;
end;
function TMainForm.ObjectAt(Point: TPoint): Integer;
var
f:Integer;
r:TRect;
begin
Result:=-1;
for f:=High(FObjects) downto 0 do
if FObjects[f].Drawn then
begin
r:=FObjects[f].SelfRect;
if IsBetween(Point.X,r.Left,r.Right) and
IsBetween(Point.Y,r.Top,R.Bottom) then
begin
Result:=f;
Break;
end;
end
end;
procedure TMainForm.ObjectsPbMouseMove(Sender: TObject;
Shift: TShiftState; X, Y: Integer);
var f:Integer;
procedure MoveObject(Ix:Integer);
var P:TPoint;
begin
P:=FObjects[Ix].LastPoint;
FObjects[Ix].LastPoint:=Point(P.X-FGrabbed.X+X,
P.Y+Y-FGrabbed.Y);
end;
procedure SetHint;
begin
if FObjectGrabbed<0 then
begin
ObjectsPb.Hint:='';
ObjectsPb.ShowHint:=False;
end
else
begin
ObjectsPb.Hint:=FObjects[FObjectGrabbed].Text;
ObjectsPb.ShowHint:=True;
end;
end;
begin
if FDiagramKeys then
begin
KeyEd.SetFocus;
if Shift=[] then
begin
FObjectGrabbed:=ObjectAt(Point(X,Y));
SetHint;
end
else if Shift=[ssLeft] then
begin
if (FObjectGrabbed>=0) and (FObjects[FObjectGrabbed].IsRoot)
then MoveObject(FObjectGrabbed)
else for f:=0 to High(FObjects) do
if FObjects[f].IsRoot then MoveObject(f);
FGrabbed.X:=X;
FGrabbed.Y:=Y;
PaintObjects;
end
end;
end;
procedure TMainForm.ObjectsPbDblClick(Sender: TObject);
begin
if FDiagramKeys then
begin
if FSelObject>=0 then
FObjects[FSelObject].Selected:=False;
FSelObject:=ObjectAt(FGrabbed);
if FSelObject>=0 then
FObjects[FSelObject].Selected:=True;
PaintObjects;
end;
end;
procedure TMainForm.ManualAddEdKeyPress(Sender: TObject; var Key: Char);
begin
if Key=#13 then
begin
Key:=#0;
AddTextBtClick(Sender);
end;
end;
procedure TMainForm.ObjectPbOnHint(Sender: TObject);
begin
end;
procedure TMainForm.Save1Click(Sender: TObject);
var
Buf:TFIleBuffer;
atext:TSimpleStrings;
begin
SaveDialog1.Filter:='Argument Session|*.ags';
if SaveDialog1.Execute then
begin
Buf:=TFileBuffer.Create;
Buf.WriteInteger(SessionVersion);
atext:=AsSimpleStrings(TextMm.Lines);
Buf.WriteStrings(atext);
AOWriteObjects(FObjects,Buf);
Buf.FlushToFile(SaveDialog1.FileName);
Buf.Free;
end;
end;
procedure TMainForm.Open1Click(Sender: TObject);
var
Buf:TFileBuffer;
atext:TSimpleStrings;
ver,f:Integer;
begin
OpenDialog1.Filter:='Argument Session|*.ags';
if OpenDialog1.Execute then
begin
Buf:=TFileBuffer.Create;
Buf.LoadFromFile(OpenDialog1.FileName);
ver:=Buf.GetInteger;
Buf.ReadStrings(atext);
//version 0 with Delphi
//strings saved as ansi
if ver=0 then
for f:=0 to High(atext) do
atext[f]:=ANSIToUTF8(atext[f]);
TextMm.Lines.Clear;
AppendToStringList(atext,TextMm.Lines);
AOClearObjects(FObjects);
AOReadObjects(FObjects,Buf);
RefreshTextsLb;
Buf.Free;
PaintObjects;
end;
end;
procedure TMainForm.KeyEdKeyPress(Sender: TObject; var Key: Char);
procedure SetAsReason(Reas,Conc:Integer);
begin
if (Reas>=0) and (FObjects[Reas].ObType=AOUnknown) then
FObjects[Reas].ObType:=AOReason;
if (Conc>=0) and (FObjects[Conc].ObType=AOUnknown) then
FObjects[Conc].ObType:=AOReason;
if (Reas>=0) and (Conc>=0) and (Reas<>Conc) and FObjects[Reas].IsRoot
and (FObjects[Conc].ObType=AOReason) and
not FObjects[Conc].ConnectsTo(FObjects[Reas]) and
not FObjects[Reas].ConnectsTo(FObjects[Conc]) then
begin
FObjects[Reas].IsRoot:=False;
FObjects[Conc].AddChild(FObjects[Reas],0);
end;
end;
procedure SetAsPremis(Premis:Integer);
begin
if (Premis>=0) and not FObjects[Premis].HasChildren then
begin
if FObjects[Premis].ObType=AOReason then
FObjects[Premis].ObType:=AOAssumption
else FObjects[Premis].ObType:=AOReason;
end;
end;
procedure SetConjunct(AdTo,AdFrom:Integer);
begin
if (AdTo>=0) and (AdFrom>=0) and (AdTo<>AdFrom) and
(FObjects[AdFrom].IsRoot) and
not FObjects[AdTo].ConnectsTo(FObjects[AdFrom]) and
not FObjects[AdFrom].ConnectsTo(FObjects[AdTo]) then
begin
FObjects[AdTo].AddConjunct(FObjects[AdFrom]);
FObjects[AdFrom].IsRoot:=False;
end;
end;
procedure DeleteObject(Ix:Integer);
var f:Integer;
begin
if (Ix>=0) and (FObjects[Ix].IsRoot) and
not FObjects[Ix].HasChildren then
begin
FObjects[Ix].Free;
for f:=Ix to High(FObjects)-1 do
FObjects[f]:=FObjects[f+1];
SetLength(FObjects,Length(FObjects)-1);
RefreshTextsLb;
end;
end;
begin
if FDiagramKeys then
begin
if (FObjectGrabbed>=0) then
case Key of
'c','r','R','C':SetAsReason(FObjectGrabbed,FSelObject);
'p','P':SetAsPremis(FSelObject);
'o','O':if FObjectGrabbed>=0 then
FObjects[FObjectGrabbed].Open:=not FObjects[FObjectGrabbed].Open;
'+':SetConjunct(FSelObject,FObjectGrabbed);
'v':if FObjectGrabbed>=0 then
AOToggleParentLink(FObjects,FObjects[FObjectGrabbed]);
#8,#95:
begin
DeleteObject(FSelObject);
FSelObject:=-1;
FObjectGrabbed:=-1;
end;
end;
case Key of
'b','B':if FBackGround=clBlack then
begin
FBackGround:=clWhite;
AOLineColor:=clBlack;
AODefaultBorder:=clBlack;
end
else
begin
FBackGround:=clBlack;
AOLineColor:=clWhite;
AODefaultBorder:=clWhite;
end;
'X':begin
AOClearObjects(FObjects);
RefreshTextsLb;
PaintObjects;
end;
end;
PaintObjects;
end;
Key:=#0;
end;
procedure TMainForm.RefreshTextsLb;
var f:Integer;
begin
StatementsMm.Lines.Clear;
for f:=0 to High(FObjects) do
AddReason(FObjects[f].Text);
end;
procedure TMainForm.KeyEdKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
begin
if FDiagramKeys and (Key=27) then
PrepareHint;
end;
procedure TMainForm.PrepareHint;
var X,Y,f:Integer;
begin
f:=FObjectGrabbed;
if f>=0 then
begin
X:=FObjects[f].LastPoint.X;
Y:=FObjects[f].LastPoint.Y;
if X+ObjectPropPnl.Width>DiagramTs.ClientWidth-ControlBorder then
X:=DiagramTs.ClientWidth-ControlBorder-ObjectPropPnl.Width;
if Y+ObjectPropPnl.Height>DiagramTs.ClientHeight-ControlBorder then
Y:=DiagramTs.ClientHeight-ControlBorder-ObjectPropPnl.Height;
ObjectPropPnl.Top:=Y;
ObjectPropPnl.Left:=X;
ObjectPropPnl.Visible:=True;
FDiagramKeys:=False;
ObjectTextMm.Text:=FObjects[f].Text;
ObjectObjectionsMm.SetFocus;
ObjectObjectionsMm.Lines.Text:=FObjects[f].Objections;
ObjectObjectionsMm.CaretPos:=Point(0,0);
end;
end;
procedure TMainForm.ObjectTextMmKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
begin
if Key=27 then
begin
Key:=0;
FObjects[FObjectGrabbed].Text:=ObjectTextMm.Text;
FObjects[FObjectGrabbed].Objections:=ObjectObjectionsMm.Text;
ObjectPropPnl.Visible:=False;
FDiagramKeys:=True;
PaintObjects;
end;
end;
procedure TMainForm.ObjectPropPnlExit(Sender: TObject);
var Key:Word;
begin
Key:=27;
ObjectTextMmKeyDown(Sender,Key,[]);
end;
procedure TMainForm.AddReason(s: string);
begin
StatementsMm.Lines.Add('');
StatementsMm.Lines.Add('- '+CleanString(s));
end;
procedure TMainForm.Help1Click(Sender: TObject);
begin
//ShellExecute(0,'open',PChar(ExtractFilePath(Application.ExeName)+'Help.html'),nil,nil,0);
end;
procedure TMainForm.ClearObjects(Sender:TObject);
var f:Integer;
begin
for f:=0 to High(FObjects) do
FObjects[f].Free;
FObjects:=nil;
RefreshTextsLb;
TextMm.Clear;
PaintObjects;
end;
initialization
{$I argmain.lrs}
end.
|
{ @abstract(This unit contains HTML reader and writer for TKMemo control)
@author(Christian Ulrich (christian@cu-tec.de))
@created(16 Feb 2016)
@lastmod(16 Feb 2016)
Copyright © Christian Ulrich (christian@cu-tec.de)<BR><BR>
<B>License:</B><BR>
This code is distributed as a freeware. You are free to use it as part
of your application for any purpose including freeware, commercial and
shareware applications. The origin of this source code must not be
misrepresented; you must not claim your authorship. All redistributions
of the original or modified source code must retain the original copyright
notice. The Author accepts no liability for any damage that may result
from using this code.
}
unit kmemohtm; // lowercase name because of Lazarus/Linux
{$include kcontrols.inc}
{$WEAKPACKAGEUNIT ON}
interface
uses
Classes, Contnrs, Graphics, Controls, Types,
KControls, KFunctions, KGraphics, KMemo,kmemortf;
type
{ Specifies the HTML reader. }
{ TKMemoHTMLReader }
TKMemoHTMLReader = class(TKMemoRTFReader)
private
function GetChar: AnsiChar;
protected
procedure ReadStream; override;
public
constructor Create(AMemo: TKCustomMemo); override;
destructor Destroy; override;
procedure LoadFromStream(AStream: TStream; AtIndex: Integer = -1; AActiveBlocks: TKMemoBlocks = nil); override;
end;
implementation
uses
Math, SysUtils, KHexEditor, KRes
{$IFDEF FPC}
, LCLIntf, LCLProc, LConvEncoding, LCLType
{$ELSE}
, JPeg, Windows
{$ENDIF}
;
resourcestring
// KMemoRTF texts
sErrMemoLoadFromHTML = 'Error while reading HTML file.';
sErrMemoLoadImageFromHTML = 'Error while loading image from HTML file.';
sErrMemoSaveToHTML = 'Error while saving HTML file.';
function TKMemoHTMLReader.GetChar: AnsiChar;
begin
Result := Char(FStream.ReadByte);
end;
procedure TKMemoHTMLReader.ReadStream;
begin
//https://dev.w3.org/html5/spec-preview/parsing.html
//detect encoding
end;
constructor TKMemoHTMLReader.Create(AMemo: TKCustomMemo);
begin
inherited Create(AMemo);
end;
destructor TKMemoHTMLReader.Destroy;
begin
inherited Destroy;
end;
procedure TKMemoHTMLReader.LoadFromStream(AStream: TStream; AtIndex: Integer;
AActiveBlocks: TKMemoBlocks);
begin
try
if AActiveBlocks <> nil then
begin
FActiveBlocks := AActiveBlocks
end
else if FMemo <> nil then
begin
if AtIndex < 0 then
begin
FMemo.Clear;
FMemo.Blocks.Clear; // delete everything
FActiveBlocks := FMemo.Blocks;
FAtIndex := 0; // just append new blocks to active blocks
end;
end;
if FActiveBlocks <> nil then
begin
FActiveBlocks.LockUpdate;
try
FActiveColor := nil;
FActiveContainer := nil;
FActiveFont := nil;
FActiveImage := nil;
FActiveImageClass := nil;
FActiveList := nil;
FActiveListLevel := nil;
FActiveListOverride := nil;
FActiveParaBorder := alNone;
FActiveShape := nil;
FActiveState := TKMemoRTFState.Create;
FActiveState.Group := rgUnknown; // we wait for file header
if FMemo <> nil then
begin
FActiveState.ParaStyle.Assign(FMemo.ParaStyle);
FActiveState.TextStyle.Assign(FMemo.TextStyle);
end;
FActiveString := '';
FActiveTable := nil;
FActiveTableBorder := alNone;
FActiveTableCell := nil;
FActiveTableCol := -1;
FActiveTableColCount := 0;
FActiveTableRow := nil;
FActiveText := nil;
FColorTable.Clear;
FDefaultFontIndex := 0;
FIgnoreChars := 0;
FStream := AStream;
ReadStream;
finally
FlushText;
FlushShape;
FlushImage;
FlushTable;
FActiveState.Free;
if FMemo <> nil then
FListTable.AssignToListTable(FMemo.ListTable, FFontTable);
FActiveBlocks.ConcatEqualBlocks;
FActiveBlocks.FixEmptyBlocks;
FActiveBlocks.UnlockUpdate;
end;
end;
except
KFunctions.Error(sErrMemoLoadFromHTML);
end;
end;
end.
|
unit MobilePermissions.Permissions.Interfaces;
interface
type
IMobilePermissions = interface
['{4AA3D2CE-F6D5-470A-85DA-C7857B662B95}']
function Request(Permissions: TArray<String>): IMobilePermissions;
end;
IMobilePermissionsFactory = interface
['{B0C3F51D-6981-4D83-921E-716504C48C1F}']
function createMobilePermissions: IMobilePermissions;
end;
implementation
end.
|
//passwordhash unit
//Update : 12/04/2019 20.00 WIB
//Dev : mk
//v1.0.0
unit passwordhash;
interface
function numConv(n:integer):char;
{Konversi angka [0..61] menjadi [a..z,A..Z,0..9]}
function hash(user,pass:string):string;
{Mengembalikan password yang sudah di-hash}
implementation
function numConv(n:integer):char;
begin
if(n>=0) and (n<26) then
numConv:=chr(97+n)
else if(n>=26) and (n<52) then
numConv:=chr(65+n-26)
else if(n>=52) and (n<62) then
numConv:=chr(48+n-52);
end;
function hash(user,pass:string):string;
var
salted,tmp,res:string;
i,x:integer;
begin
//Inisialisasi string
salted:='';
res:='';
//Konversi panjang password ke stirng
str(length(pass),tmp);
//Melakukan 'Salting' pada password dengan username
for i:=1 to length(pass) do salted:=salted+user[((i-1) mod length(user))+1]+pass[i];
//Menambahkan satu character dari username apabila panjang password yang di-salt kelipatan dari panjang username
if(length(salted) mod length(pass)=0) then salted:=salted+user[1];
//Menambahkan panjang password ke password yang di-salt
salted:=salted+tmp;
//Melakukan algoritma hashing dengan xor agar dibentuk 64 character
for i:=1 to 64 do
begin
x:=ord(salted[((i-1) mod length(salted))+1]) xor ord(user[((i-1) mod length(user))+1]);
if(i mod 2=1) then res:=res+numConv((x+31) mod 62)
else if(i mod 2=0) then res:=res+numConv(x mod 62);
end;
//Return result string
hash:=res;
end;
end. |
{
GMElevationFMX unit
ES: contiene las clases FMX necesarias para calcular elevaciones de terreno
de un conjunto de LatLng
EN: includes the FMX classes needed for calculate a terrain elevations of a
set of LatLng
=========================================================================
MODO DE USO/HOW TO USE
ES: poner el componente en el formulario, linkarlo a un TGMMap, establecer
las lat/lng y ejecutar
EN: put the component into a form, link to a TGMMap, establish the lat/lng and
execute
=========================================================================
History:
ver 0.1.9
ES:
nuevo: documentación
nuevo: se hace compatible con FireMonkey
EN:
new: documentation
new: now compatible with FireMonkey
=========================================================================
IMPORTANTE PROGRAMADORES: Por favor, si tienes comentarios, mejoras,
ampliaciones, errores y/o cualquier otro tipo de sugerencia, envíame un correo a:
gmlib@cadetill.com
IMPORTANT PROGRAMMERS: please, if you have comments, improvements, enlargements,
errors and/or any another type of suggestion, please send me a mail to:
gmlib@cadetill.com
=========================================================================
Copyright (©) 2012, by Xavier Martinez (cadetill)
@author Xavier Martinez (cadetill)
@web http://www.cadetill.com
}
{*------------------------------------------------------------------------------
The GMElevationFMX unit includes the FMX classes needed for calculate a terrain elevations of a set of LatLng.
@author Xavier Martinez (cadetill)
@version 1.5.0
-------------------------------------------------------------------------------}
{=------------------------------------------------------------------------------
La unit GMElevationFMX contiene las clases FMX necesarias para calcular elevaciones de terreno de un conjunto de LatLng.
@author Xavier Martinez (cadetill)
@version 1.5.0
-------------------------------------------------------------------------------}
unit GMElevationFMX;
interface
uses
GMElevation, GMPolyline;
type
{*------------------------------------------------------------------------------
Class for calculating elevations.
More information at:
https://developers.google.com/maps/documentation/javascript/reference?hl=en#ElevationService
https://developers.google.com/maps/documentation/javascript/elevation
https://developers.google.com/maps/documentation/elevation/index
-------------------------------------------------------------------------------}
{=------------------------------------------------------------------------------
Clase para el cálculo de elevaciones.
Más información en:
https://developers.google.com/maps/documentation/javascript/reference?hl=en#ElevationService
https://developers.google.com/maps/documentation/javascript/elevation
https://developers.google.com/maps/documentation/elevation/index
-------------------------------------------------------------------------------}
TGMElevation = class(TCustomGMElevation)
public
procedure AddLatLngFromPoly(Poly: TBasePolyline; DeleteBeforeLoad: Boolean = True); override;
end;
implementation
uses
GMPolygonFMX, GMClasses;
{ TGMElevation }
procedure TGMElevation.AddLatLngFromPoly(Poly: TBasePolyline;
DeleteBeforeLoad: Boolean);
var
Point: TLinePoint;
begin
inherited;
if (Poly is TPolygon) and (Poly.CountLinePoints > 0) then
begin
Point := LinePoints.Add;
Point.Assign(Poly[0]);
end;
end;
end.
|
{$i deltics.inc}
unit Test.InterfacedObjectList;
interface
uses
Deltics.Smoketest;
type
TInterfacedObjectListTests = class(TTest)
procedure InterfacedObjectAddedToListIsRemovedWhenDestroyed;
procedure AddingItemsViaObjectReferenceIsAnInvalidOperation;
procedure AddingItemsViaInterfaceReferenceIsSuccessful;
procedure ItemsCanBeInsertedAtASpecificIndex;
procedure ItemsCannotBeAddedMoreThanOnce;
procedure ClearedListHasNoItems;
end;
implementation
uses
Deltics.Exceptions,
Deltics.InterfacedObjects;
type
TInterfacedObjectListSubClassExposingAddMethod = class(TInterfacedObjectList);
{ TTestInterfacedObjectList }
procedure TInterfacedObjectListTests.AddingItemsViaInterfaceReferenceIsSuccessful;
var
sut: IInterfacedObjectList;
io: TInterfacedObject;
begin
sut := TInterfacedObjectList.Create;
io := TInterfacedObject.Create;
try
sut.Add(io);
Test('Count').Assert(sut.Count).Equals(1);
finally
io.Free;
end;
end;
procedure TInterfacedObjectListTests.AddingItemsViaObjectReferenceIsAnInvalidOperation;
var
sut: TInterfacedObjectListSubClassExposingAddMethod;
io: TInterfacedObject;
begin
Test.Raises(EInvalidOperation);
sut := TInterfacedObjectListSubClassExposingAddMethod.Create;
try
io := TInterfacedObject.Create;
try
sut.Add(io);
finally
io.Free;
end;
finally
// Call the TObject.Free implementation on SUT (to bypass the reintroduced Free
// which raises an exception when trying to Free a COM interfaced object) otherwise
// the test will leak SUT.
TObject(sut).Free;
end;
end;
procedure TInterfacedObjectListTests.InterfacedObjectAddedToListIsRemovedWhenDestroyed;
var
sut: IInterfacedObjectList;
io: TInterfacedObject;
begin
sut := TInterfacedObjectList.Create;
io := TInterfacedObject.Create;
Test('Count').Assert(sut.Count).Equals(0);
sut.Add(io);
Test('Count').Assert(sut.Count).Equals(1);
io.Free;
Test('Count').Assert(sut.Count).Equals(0);
end;
procedure TInterfacedObjectListTests.ItemsCanBeInsertedAtASpecificIndex;
var
sut: IInterfacedObjectList;
io1, io2, io3: TInterfacedObject;
begin
sut := TInterfacedObjectList.Create;
io1 := TInterfacedObject.Create;
io2 := TInterfacedObject.Create;
io3 := TInterfacedObject.Create;
Test('Count').Assert(sut.Count).Equals(0);
sut.Add(io1);
sut.Add(io2);
sut.Insert(1, io3);
Test('Count').Assert(sut.Count).Equals(3);
Test('Index (1st object)').Assert(sut.IndexOf(io1)).Equals(0);
Test('Index (2nd object)').Assert(sut.IndexOf(io2)).Equals(2);
Test('Index (3rd object)').Assert(sut.IndexOf(io3)).Equals(1);
end;
procedure TInterfacedObjectListTests.ItemsCannotBeAddedMoreThanOnce;
var
sut: IInterfacedObjectList;
io1, io2, io3: TInterfacedObject;
idx: Integer;
begin
sut := TInterfacedObjectList.Create;
io1 := TInterfacedObject.Create;
io2 := TInterfacedObject.Create;
io3 := TInterfacedObject.Create;
Test('Count').Assert(sut.Count).Equals(0);
sut.Add(io1);
sut.Add(io2);
sut.Add(io3);
idx := sut.IndexOf(io2);
Test('Count').Assert(sut.Count).Equals(3);
Test('Index (2nd object)').Assert(idx).Equals(1);
idx := sut.Add(io2);
Test('Count').Assert(sut.Count).Equals(3);
Test('Index (2nd object)').Assert(idx).Equals(1);
end;
procedure TInterfacedObjectListTests.ClearedListHasNoItems;
var
sut: IInterfacedObjectList;
io1, io2, io3: TInterfacedObject;
begin
sut := TInterfacedObjectList.Create;
io1 := TInterfacedObject.Create;
io2 := TInterfacedObject.Create;
io3 := TInterfacedObject.Create;
Test('Count').Assert(sut.Count).Equals(0);
sut.Add(io1);
sut.Add(io2);
sut.Add(io3);
Test('Count').Assert(sut.Count).Equals(3);
sut.Clear;
Test('Count').Assert(sut.Count).Equals(0);
end;
end.
|
unit ccCylPlaneCapFrame;
{$mode objfpc}{$H+}
interface
uses
Classes, SysUtils, FileUtil, Forms, Controls, ExtCtrls, StdCtrls, IniFiles,
ccBaseFrame;
type
{ TCylPlaneCapFrame }
TCylPlaneCapFrame = class(TBaseFrame)
Bevel3: TBevel;
CbCapaUnits: TComboBox;
CbDistUnits: TComboBox;
CbRadiusUnits: TComboBox;
CbLengthUnits: TComboBox;
EdDist: TEdit;
EdEps: TEdit;
EdRadius: TEdit;
EdLength: TEdit;
LblCapa: TLabel;
LblCapaPerLength: TLabel;
LblDist: TLabel;
LblEps: TLabel;
LblRadius: TLabel;
LblLength: TLabel;
Panel1: TPanel;
TxtCapa: TEdit;
TxtCapaPerLength: TEdit;
TxtCapaPerLengthUnits: TLabel;
private
{ private declarations }
protected
procedure ClearResults; override;
function DoCalc(d, R, L, eps: Extended): Extended; virtual;
procedure SetEditLeft(AValue: Integer); override;
public
{ public declarations }
constructor Create(AOwner: TComponent); override;
procedure Calculate; override;
procedure ReadFromIni(ini: TCustomIniFile); override;
function ValidData(out AMsg: String; out AControl: TWinControl): Boolean; override;
procedure WriteToIni(ini: TCustomIniFile); override;
end;
implementation
{$R *.lfm}
uses
ccGlobal, ccStrings;
{ TCylPlaneCapFrame }
constructor TCylPlaneCapFrame.Create(AOwner: TComponent);
begin
inherited Create(AOwner);
FIniKey := 'Cylinder-plane';
end;
procedure TCylPlaneCapFrame.Calculate;
var
R, d, L, capa, eps, fc, fL: extended;
capaFmt, capaUnits, lengthUnits: String;
begin
try
// Validity check of parameters
if (EdDist.Text = '') or not TryStrToFloat(EdDist.Text, d) then exit;
if d = 0 then exit;
if (EdRadius.Text = '') or not TryStrToFloat(EdRadius.Text, R) then exit;
if R = 0 then exit;
if (EdLength.Text = '') or not TryStrToFloat(EdLength.Text, L) then exit;
if L = 0 then exit;
if (EdEps.Text = '') or not TryStrToFloat(EdEps.Text, eps) then exit;
if CbDistUnits.ItemIndex = -1 then exit;
if CbRadiusUnits.ItemIndex = -1 then exit;
if CbLengthUnits.ItemIndex = -1 then exit;
if CbCapaUnits.ItemIndex = -1 then exit;
// Convert parameter to SI units
fL := LenFactor[TLenUnits(CbLengthUnits.ItemIndex)];
fC := CapaFactor[TCapaUnits(CbCapaUnits.ItemIndex)];
d := d * LenFactor[TLenUnits(CbDistUnits.ItemIndex)];
R := R * LenFactor[TLenUnits(CbRadiusUnits.ItemIndex)];
L := L * fL;
// Calculate
Capa := DoCalc(d, R, L, eps);
// Display results
if CbCapaUnits.Text = 'F' then
capaFmt := CapaExpFormat else
capaFmt := CapaStdFormat;
capaUnits := CbCapaUnits.Items[CbCapaUnits.ItemIndex];
lengthUnits := CbLengthUnits.Items[CbLengthUnits.ItemIndex];
// Capacitance
TxtCapa.Text := FormatFloat(capaFmt, capa / fc);
// Capacitance per length
TxtCapaPerLengthUnits.caption := Format('%s/%s', [capaUnits, lengthUnits]);
TxtCapaPerLength.Text := FormatFloat(CapaPerLengthFormat, capa / L * fL / fC);
except
ClearResults;
end;
end;
procedure TCylPlaneCapFrame.ClearResults;
begin
TxtCapa.Clear;
TxtCapaPerLength.Clear;
end;
function TCylPlaneCapFrame.DoCalc(d, R, L, eps: Extended): Extended;
begin
Result := TwoPi * eps0 * eps * L / ln( (d + sqrt(d*d - R*R))/R);
end;
procedure TCylPlaneCapFrame.ReadFromIni(ini: TCustomIniFile);
var
fs: TFormatSettings;
s: String;
value: Extended;
begin
fs := DefaultFormatSettings;
fs.DecimalSeparator := '.';
s := ini.ReadString(FIniKey, 'Dist', '');
if (s <> '') and TryStrToFloat(s, value, fs) then
EdDist.Text := FloatToStr(value) else
EdDist.Clear;
s := ini.ReadString(FIniKey, 'Length', '');
if (s <> '') and TryStrToFloat(s, value, fs) then
EdLength.Text := FloatToStr(value) else
EdLength.Clear;
s := ini.ReadString(FIniKey, 'Radius', '');
if (s <> '') and TryStrToFloat(s, value, fs) then
EdRadius.Text := FloatToStr(value) else
EdRadius.Clear;
s := ini.ReadString(FIniKey, 'eps', '');
if (s <> '') and TryStrToFloat(s, value, fs) then
EdEps.Text := FloatToStr(value) else
EdEps.Clear;
s := ini.ReadString(FIniKey, 'Dist units', '');
if (s <> '') then
CbDistUnits.ItemIndex := CbDistUnits.Items.IndexOf(s) else
CbDistUnits.ItemIndex := -1;
s := ini.ReadString(FIniKey, 'Length units', '');
if (s <> '') then
CbLengthUnits.ItemIndex := CbLengthUnits.Items.IndexOf(s) else
CbLengthUnits.ItemIndex := -1;
s := ini.ReadString(FIniKey, 'Radius units', '');
if (s <> '') then
CbRadiusUnits.ItemIndex := CbRadiusUnits.Items.IndexOf(s) else
CbRadiusUnits.ItemIndex := -1;
s := ini.ReadString(FIniKey, 'Capa units', '');
if (s <> '') then
CbCapaUnits.ItemIndex := CbCapaUnits.Items.Indexof(s) else
CbCapaUnits.ItemIndex := -1;
Calculate;
end;
procedure TCylPlaneCapFrame.SetEditLeft(AValue: Integer);
begin
if AValue = FEditLeft then exit;
inherited;
EdDist.Left := FEditLeft;
TxtCapa.Left := FEditLeft;
TxtCapa.Width := EdDist.Width;
Panel1.Height := TxtCapaPerLength.Top + TxtCapaPerLength.Height + TxtCapa.Top;
Width := CbDistUnits.Left + CbDistUnits.Width + 2*FControlDist;
end;
function TCylPlaneCapFrame.ValidData(out AMsg: String; out AControl: TWinControl
): Boolean;
begin
Result := false;
if not IsValidPositive(EdDist, AMsg) then begin
AControl := EdDist;
exit;
end;
if not IsValidPositive(EdLength, AMsg) then begin
AControl := EdLength;
exit;
end;
if not IsValidPositive(EdRadius, AMsg) then begin
AControl := EdRadius;
exit;
end;
if not IsValidNumber(EdEps, AMsg) then begin
AControl := EdEps;
exit;
end;
if not IsValidComboValue(CbDistUnits, AMsg) then begin
AControl := CbDistUnits;
exit;
end;
if not IsValidComboValue(CbLengthUnits, AMsg) then begin
AControl := CbLengthUnits;
exit;
end;
if not IsValidComboValue(CbRadiusUnits, AMsg) then begin
AControl := CbRadiusUnits;
exit;
end;
if not IsValidComboValue(CbCapaUnits, AMsg) then begin
AControl := CbCapaUnits;
exit;
end;
Result := true;
end;
procedure TCylPlaneCapFrame.WriteToIni(ini: TCustomIniFile);
var
fs: TFormatSettings;
value: Extended;
begin
fs := DefaultFormatSettings;
fs.DecimalSeparator := '.';
ini.EraseSection(FIniKey);
if (EdDist.Text <> '') and TryStrToFloat(EdDist.Text, value) then
ini.WriteString(FIniKey, 'Dist', FloatToStr(value, fs));
if CbDistUnits.ItemIndex >= 0 then
ini.WriteString(FIniKey, 'Dist units', CbDistUnits.Items[CbDistUnits.ItemIndex]);
if (EdLength.Text <> '') and TryStrToFloat(EdLength.Text, value) then
ini.WriteString(FIniKey, 'Length', FloatToStr(value, fs));
if CbLengthUnits.ItemIndex >= 0 then
ini.WriteString(FIniKey, 'Length units', CbLengthUnits.Items[CbLengthUnits.ItemIndex]);
if (EdRadius.Text <> '') and TryStrToFloat(EdRadius.Text, value) then
ini.WriteString(FIniKEy, 'Radius', FloatToStr(value, fs));
if CbRadiusUnits.ItemIndex >= 0 then
ini.WriteString(FIniKey, 'Radius units', CbRadiusUnits.Items[CbRadiusUnits.ItemIndex]);
if (EdEps.Text <> '') and TryStrToFloat(EdEps.Text, value) then
ini.WriteString(FIniKey, 'eps', FloatToStr(value, fs));
if CbCapaUnits.ItemIndex >= 0 then
ini.WriteString(FIniKey, 'Capa units', CbCapaUnits.Items[CbCapaUnits.ItemIndex]);
end;
end.
|
unit TestCommandLine;
{ AFS 26 April 03
test the jcf.exe commandline }
{(*}
(*------------------------------------------------------------------------------
Delphi Code formatter source code
The Original Code is TestCommandLine, released May 2003.
The Initial Developer of the Original Code is Anthony Steele.
Portions created by Anthony Steele are Copyright (C) 1999-2000 Anthony Steele.
All Rights Reserved.
Contributor(s): Anthony Steele.
The contents of this file are subject to the Mozilla Public License Version 1.1
(the "License"). you may not use this file except in compliance with the License.
You may obtain a copy of the License at http://www.mozilla.org/NPL/
Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied.
See the License for the specific language governing rights and limitations
under the License.
Alternatively, the contents of this file may be used under the terms of
the GNU General Public License Version 2 or later (the "GPL")
See http://www.gnu.org/licenses/gpl.html
------------------------------------------------------------------------------*)
{*)}
{$I JcfGlobal.inc}
interface
uses
{ delphi }
Classes,
{ jcf }
TestFile, TestConstants;
type
TTestCommandline = class(TTestFile)
private
fsJcfParams: string;
fsRefDir: string;
fsFileMask: string;
fsOutputExt: string;
fsOutputSubdir: string;
fiExpectedCount: integer;
fsFileNames: TStringList;
procedure CompareFileToRef(const psFileName: string);
procedure RunJcfCommandline;
procedure GetOutFiles;
protected
procedure SetUp; override;
procedure TearDown; override;
published
procedure TestFormatClarify;
procedure TestFormatObfuscate;
procedure TestFormatClarifyProject;
procedure TestFormatObfuscateProject;
end;
implementation
uses
{ delphi }
Windows, SysUtils,
{ jcl }
JclShell, JclFileUtils, JcfRegistrySettings,
TestFramework;
const
EXPECTED_FILE_COUNT = 248;
procedure TTestCommandline.SetUp;
begin
fsFileNames := TStringList.Create;
InitTestSettings;
GetRegSettings.WriteAll;
end;
procedure TTestCommandline.TearDown;
begin
FreeAndNil(fsFileNames);
end;
procedure TTestCommandline.GetOutFiles;
begin
fsFileNames.Clear;
BuildFileList(GetTestFilesDir + fsOutputSubdir + fsFileMask, faAnyFile, fsFileNames);
end;
procedure TTestCommandline.CompareFileToRef(const psFileName: string);
begin
TestFileContentsSame(GetTestFilesDir + fsOutputSubdir + psFileName, fsRefDir + psFileName);
SysUtils.DeleteFile(GetTestFilesDir + fsOutputSubdir + psFileName);
end;
procedure TTestCommandline.RunJcfCommandline;
var
lsJcfExe: string;
liLoop: integer;
lbRes: boolean;
var
lsSaveExt: string;
lsFileName: string;
begin
lsSaveExt := GetRegSettings.OutputExtension;
try
GetRegSettings.ReadAll;
GetRegSettings.OutputExtension := fsOutputExt;
GetRegSettings.WriteAll;
Assert(fsJcfParams <> '');
Assert(fsRefDir <> '');
Assert(fsFileMask <> '');
// delete the output files
GetOutFiles;
if fsFileNames.Count > 0 then
begin
for liLoop := 0 to fsFileNames.Count - 1 do
begin
lsFileName := GetTestFilesDir + fsOutputSubdir + fsFileNames[liLoop];
SysUtils.DeleteFile(lsFileName);
end;
// should be none left
GetOutFiles;
end;
CheckEquals(0, fsFileNames.Count, 'file could not be deleted');
// build them again
lsJcfExe := GetExeFilesDir + 'jcf.exe';
Check(FileExists(lsJcfExe), 'could not find program ' + lsJcfExe);
lbRes := ShellExecAndWait('"' + lsJcfExe + '"', fsJcfParams);
Check(lbRes, 'program execution failed');
// should be back
GetOutFiles;
CheckEquals(fiExpectedCount, fsFileNames.Count, 'File count differs');
// for each, compare to the reference versions
GetOutFiles;
for liLoop := 0 to fsFileNames.Count - 1 do
CompareFileToRef(fsFileNames[liLoop]);
finally
GetRegSettings.OutputExtension := lsSaveExt;
GetRegSettings.WriteAll;
end;
end;
// test clarifying the .pas files with the commandline program
procedure TTestCommandline.TestFormatClarify;
begin
fsOutputExt := 'out';
fsOutputSubdir := '';
fsJcfParams := ' -config="' + GetTestSettingsFileName +
'" -out -D "' + GetTestFilesDir + '"';
fsRefDir := GetRefOutFilesDir;
fsFileMask := '*.out';
fiExpectedCount := EXPECTED_FILE_COUNT;
RunJcfCommandline;
end;
// test clarifying the .dpr files with the commandline program
procedure TTestCommandline.TestFormatClarifyProject;
begin
fsOutputExt := 'out';
fsOutputSubdir := 'D11\';
fsJcfParams := ' -config="' + GetTestSettingsFileName +
'" -out -D "' + GetTestFilesDir + fsOutputSubdir + '"';
fsRefDir := GetRefOutFilesDir + fsOutputSubdir;
fsFileMask := '*.out';
fiExpectedCount := 1;
RunJcfCommandline;
end;
// test obfuscating the .pas files with the commandline program
procedure TTestCommandline.TestFormatObfuscate;
begin
fsOutputExt := 'obs';
fsOutputSubdir := '';
fsJcfParams := ' -obfuscate -config="' + GetTestFilesDir +
'JCFObfuscateSettings.cfg" ' +
'-out -D "' + GetTestFilesDir + '"';
fsRefDir := GetObsOutFilesDir;
fsFileMask := '*.obs';
fiExpectedCount := EXPECTED_FILE_COUNT;
RunJcfCommandline;
end;
// test obfuscating the .dpr files with the commandline program
procedure TTestCommandline.TestFormatObfuscateProject;
begin
fsOutputExt := 'obs';
fsOutputSubdir := 'D11\';
fsJcfParams := ' -obfuscate -config="' + GetTestFilesDir +
'JCFObfuscateSettings.cfg" ' +
'-out -D "' + GetTestFilesDir + fsOutputSubdir + '"';
fsRefDir := GetObsOutFilesDir + fsOutputSubdir;
fsFileMask := '*.obs';
fiExpectedCount := 1;
RunJcfCommandline;
end;
initialization
TestFramework.RegisterTest(TTestCommandline.Suite);
end.
|
unit Security4D.UnitTest.Credential;
interface
uses
System.SysUtils;
const
ROLE_ADMIN = 'Admin';
ROLE_MANAGER = 'Manager';
ROLE_NORMAL = 'Normal';
type
TCredential = class
private
fUsername: string;
fPassword: string;
fRole: string;
protected
{ protected declarations }
public
constructor Create; overload;
constructor Create(const username, password, role: string); overload;
property Username: string read fUsername write fUsername;
property Password: string read fPassword write fPassword;
property Role: string read fRole write fRole;
end;
implementation
{ TCredential }
constructor TCredential.Create;
begin
Create(EmptyStr, EmptyStr, ROLE_NORMAL);
end;
constructor TCredential.Create(const username, password, role: string);
begin
inherited Create;
fUsername := username;
fPassword := password;
fRole := role;
end;
end.
|
Program twitter_2;
Uses
sysutils;
Type
tweet = record
codigoUsuario: integer;
nombreUsuario: string;
mensaje: string;
esRetweet: boolean;
end;
listaTweets = ^nodoLista;
nodoLista = record
dato: tweet;
sig: listaTweets;
end;
{Completar agregando aquí las estructuras de datos necesarias en el ejercicio}
datoM=record
mensaje:string;
esRetweet: boolean;
end;
listaMensajes= ^nodoMensajes;
nodoMensajes=record
dato:datoM;
sig:listaMensajes;
end;
datoU=record
codigoUsuario: integer;
nombreUsuario: string;
mensajeL:listaMensajes;
end;
listaUsuarios=^nodoUsuarios;
nodoUsuarios=record
dato:datoU;
sig:listaUsuarios;
end;
{agregarAdelante - Agrega nro adelante de l}
Procedure agregarAdelante(var l: listaTweets; t: tweet);
var
aux: listaTweets;
begin
new(aux);
aux^.dato := t;
aux^.sig := l;
l:= aux;
end;
{crearLista - Genera una lista con tweets aleatorios}
procedure crearLista(var l: listaTweets);
var
t: tweet;
texto: string;
v : array [1..10] of string;
begin
v[1]:= 'juan';
v[2]:= 'pedro';
v[3]:= 'carlos';
v[4]:= 'julia';
v[5]:= 'mariana';
v[6]:= 'gonzalo';
v[7]:='alejandro';
v[8]:= 'silvana';
v[9]:= 'federico';
v[10]:= 'ruth';
t.codigoUsuario := random(11);
while (t.codigoUsuario <> 0) do Begin
texto:= Concat(v[t.codigoUsuario], '-mensaje-', IntToStr(random (200)));
t.nombreUsuario := v[t.codigoUsuario];
t.mensaje := texto;
t.esRetweet := (random(2)=0);
agregarAdelante(l, t);
t.codigoUsuario := random(11);
end;
end;
{imprimir - Muestra en pantalla el tweet}
procedure imprimir(t: tweet);
begin
with (t) do begin
write('Tweet del usuario @', nombreUsuario, ' con codigo ',codigoUsuario, ': ', mensaje, ' RT:');
if(esRetweet)then
writeln(' Si')
else
writeln('No ');
end;
end;
{imprimirLista - Muestra en pantalla la lista l}
procedure imprimirLista(l: listaTweets);
begin
while (l <> nil) do begin
imprimir(l^.dato);
l:= l^.sig;
end;
end;
{agregarElemento - Resuelve la inserción de la estructura ordenada}
procedure agregarOrdenado(var pri:listaTweets; t:tweet);
var
nuevo, anterior, actual: listaTweets;
begin
new (nuevo);
nuevo^.dato:= t;
nuevo^.sig := nil;
if (pri = nil) then
pri := nuevo
else
begin
actual := pri;
anterior := pri;
while (actual<>nil) and (actual^.dato.nombreUsuario < nuevo^.dato .nombreUsuario) do begin
anterior := actual;
actual:= actual^.sig;
end;
if (anterior = actual) then
pri := nuevo
else
anterior^.sig := nuevo;
nuevo^.sig := actual;
end;
end;
{generarNuevaEstructura - Resuelve la generación estructura ordenada}
procedure generarNuevaEstructura (lT: listaTweets; VAR listaOrdenada: listaTweets);
begin
listaOrdenada := nil;
while(lT <> nil) do begin
agregarOrdenado(listaOrdenada, lT^.dato);
lT := lT^.sig;
end;
end;
{NUEVO}
procedure cargarMensajes(var listaM:listaMensajes; r:tweet);
var
aux,nue:listaMensajes;
begin
new(nue);
nue^.dato.mensaje:=r.mensaje;
nue^.dato.esRetweet:=r.esRetweet;
nue^.sig:=nil;
if (listaM=nil) then begin
listaM:=nue;
end
else begin
aux:=listaM;
while (aux<>nil) do
aux:=aux^.sig;
aux:=nue;
end;
end;
procedure inicializar (var u:listaUsuarios; r:tweet);
var
nue:listaUsuarios;
begin
new(nue);
nue^.dato.codigoUsuario:=r.codigoUsuario;
nue^.dato.nombreUsuario:=r.nombreUsuario;
nue^.dato.mensajeL:=nil;
nue^.sig:=nil;
if (u=nil) then begin
u:=nue;
end
else begin
u^.sig:=nue;
u:=u^.sig;
end;
end;
procedure cargarLista (var l:listaUsuarios; lo:listaTweets);
var
actU:integer;
ult:listaUsuarios;
begin
ult:=l;
while (lo<>nil) do begin
inicializar(ult,lo^.dato);
actU:=lo^.dato.codigoUsuario;
while (actU=lo^.dato.codigoUsuario) do begin
cargarMensajes(ult^.dato.MensajeL, lo^.dato);
lo:=lo^.sig;
end;
end;
end;
var
l, l_ordenada: listaTweets;
ln:listaUsuarios;
begin
Randomize;
l:= nil;
crearLista(l);
writeln ('Lista generada: ');
imprimirLista(l);
{Se crea la estructura ordenada}
l_ordenada:= nil;
generarNuevaEstructura(l,l_ordenada);
writeln ('Lista ordenada: ');
imprimirLista(l_ordenada);
{Completar el programa}
ln:=nil;
cargarLista(ln,l_ordenada);
writeln('Fin del programa');
readln;
end.
|
unit Test_FIToolkit.Commons.FiniteStateMachine.FSM;
{
Delphi DUnit Test Case
----------------------
This unit contains a skeleton test case class generated by the Test Case Wizard.
Modify the generated code to correctly setup and call the methods from the unit
being tested.
}
interface
uses
TestFramework,
System.Generics.Defaults,
FIToolkit.Commons.FiniteStateMachine.FSM, FIToolkit.Commons.Exceptions;
type
// Test methods for class TFiniteStateMachine
TestTFiniteStateMachine = class(TGenericTestCase)
private
type
TStateType = (stStart, stState1, stState2, stState3, stFinish);
TCommandType = (ctBegin, ctSwitchState_1to2, ctSwitchState_2to3, ctEnd);
ETestException = class (ECustomException);
TOnEnterStateMethod = TOnEnterStateMethod<TStateType, TCommandType>;
TOnEnterStateProc = TOnEnterStateProc<TStateType, TCommandType>;
TOnExitStateMethod = TOnExitStateMethod<TStateType, TCommandType>;
TOnExitStateProc = TOnExitStateProc<TStateType, TCommandType>;
IFiniteStateMachine = IFiniteStateMachine<TStateType, TCommandType, ETestException>;
TFiniteStateMachine = class (TFiniteStateMachine<TStateType, TCommandType, ETestException>);
TStateRec = record
ID : Integer;
Flag : Boolean;
end;
TCommandRec = record
ID : Integer;
Flag : Boolean;
end;
TStateRecComparer = class (TEqualityComparer<TStateRec>)
public
function Equals(const Left, Right : TStateRec) : Boolean; override;
function GetHashCode(const Value : TStateRec) : Integer; override;
end;
TCommandRecComparer = class (TEqualityComparer<TCommandRec>)
public
function Equals(const Left, Right : TCommandRec) : Boolean; override;
function GetHashCode(const Value : TCommandRec) : Integer; override;
end;
const
START_STATE = stStart;
FINISH_STATE = stFinish;
STATE_RECS : array [0..2] of TStateRec =
(
(ID: 1; Flag: True),
(ID: 2; Flag: False),
(ID: 3; Flag: False)
);
COMMAND_RECS : array [0..1] of TCommandRec =
(
(ID: 1; Flag: False),
(ID: 2; Flag: True)
);
private
FEnterStateCalled,
FExitStateCalled : Boolean;
procedure OnEnterState(const PreviousState, CurrentState : TStateType; const UsedCommand : TCommandType);
procedure OnExitState(const CurrentState, NewState : TStateType; const UsedCommand : TCommandType);
strict protected
FFiniteStateMachine: IFiniteStateMachine;
public
procedure SetUp; override;
procedure TearDown; override;
published
procedure TestAddTransition_MethodEvents;
procedure TestAddTransition_NoEvents;
procedure TestAddTransition_ProcEvents;
procedure TestAddTransitions_MethodEvents;
procedure TestAddTransitions_NoEvents;
procedure TestAddTransitions_ProcEvents;
procedure TestCreate;
procedure TestExecute;
procedure TestGetReachableState_FromSpecifiedState;
procedure TestGetReachableState_FromCurrentState;
procedure TestHasTransition_FromSpecifiedState;
procedure TestHasTransition_FromCurrentState;
procedure TestRemoveAllTransitions;
procedure TestRemoveTransition;
end;
TestTThreadFiniteStateMachine = class(TestTFiniteStateMachine)
public
procedure SetUp; override;
published
procedure TestThreadSafety;
end;
implementation
uses
TestUtils,
System.Hash, System.Threading, System.Classes, System.SysUtils,
FIToolkit.Commons.FiniteStateMachine.Exceptions;
procedure TestTFiniteStateMachine.OnEnterState(const PreviousState, CurrentState : TStateType;
const UsedCommand : TCommandType);
begin
FEnterStateCalled := True;
CheckEquals<TStateType>(CurrentState, FFiniteStateMachine.GetReachableState(PreviousState, UsedCommand));
end;
procedure TestTFiniteStateMachine.OnExitState(const CurrentState, NewState : TStateType;
const UsedCommand : TCommandType);
begin
FExitStateCalled := True;
CheckEquals<TStateType>(NewState, FFiniteStateMachine.GetReachableState(CurrentState, UsedCommand));
end;
procedure TestTFiniteStateMachine.SetUp;
begin
FFiniteStateMachine := TFiniteStateMachine.Create(START_STATE);
FEnterStateCalled := False;
FExitStateCalled := False;
end;
procedure TestTFiniteStateMachine.TearDown;
begin
FFiniteStateMachine := nil;
end;
procedure TestTFiniteStateMachine.TestAddTransition_MethodEvents;
var
ReturnValue: IFiniteStateMachine;
OnExit: TOnExitStateMethod;
OnEnter: TOnEnterStateMethod;
OnCommand: TCommandType;
ToState: TStateType;
FromState: TStateType;
begin
FromState := stState1;
ToState := stState2;
OnCommand := ctSwitchState_1to2;
OnEnter := OnEnterState;
OnExit := OnExitState;
ReturnValue := FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand, OnEnter, OnExit);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(FromState, OnCommand), 'CheckTrue::HasTransition');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(FromState, OnCommand), 'GetReachableState = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException'
);
end;
procedure TestTFiniteStateMachine.TestAddTransition_NoEvents;
var
ReturnValue: IFiniteStateMachine;
OnCommand: TCommandType;
ToState: TStateType;
FromState: TStateType;
begin
FromState := stStart;
ToState := stFinish;
OnCommand := ctEnd;
ReturnValue := FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(FromState, OnCommand), 'CheckTrue::HasTransition');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(FromState, OnCommand), 'GetReachableState = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException'
);
end;
procedure TestTFiniteStateMachine.TestAddTransition_ProcEvents;
var
ReturnValue: IFiniteStateMachine;
OnExit: TOnExitStateProc;
OnEnter: TOnEnterStateProc;
OnCommand: TCommandType;
ToState: TStateType;
FromState: TStateType;
begin
FromState := stState3;
ToState := stFinish;
OnCommand := ctEnd;
OnEnter :=
procedure (const PreviousState, CurrentState : TStateType; const UsedCommand : TCommandType)
begin
//
end;
OnExit :=
procedure (const CurrentState, NewState : TStateType; const UsedCommand : TCommandType)
begin
//
end;
ReturnValue := FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand, OnEnter, OnExit);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(FromState, OnCommand), 'CheckTrue::HasTransition');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(FromState, OnCommand), 'GetReachableState = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransition(FromState, ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException'
);
end;
procedure TestTFiniteStateMachine.TestAddTransitions_MethodEvents;
var
ToState : TStateType;
OnCommand : TCommandType;
OnEnter : TOnEnterStateMethod;
OnExit : TOnExitStateMethod;
ReturnValue : IFiniteStateMachine;
begin
ToState := stFinish;
OnCommand := ctEnd;
OnEnter := OnEnterState;
OnExit := OnExitState;
ReturnValue := FFiniteStateMachine.AddTransitions([stState1, stState2], ToState, OnCommand, OnEnter, OnExit);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState1, OnCommand),
'GetReachableState(stState1) = ToState');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState2, OnCommand),
'GetReachableState(stState2) = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState1>'
);
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState2], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState2>'
);
FFiniteStateMachine.RemoveAllTransitions;
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1, stState2, stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.InArray>'
);
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)<Dup.InArray>');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)<Dup.InArray>');
end;
procedure TestTFiniteStateMachine.TestAddTransitions_NoEvents;
var
ToState : TStateType;
OnCommand : TCommandType;
ReturnValue : IFiniteStateMachine;
begin
ToState := stFinish;
OnCommand := ctEnd;
ReturnValue := FFiniteStateMachine.AddTransitions([stState1, stState2], ToState, OnCommand);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState1, OnCommand),
'GetReachableState(stState1) = ToState');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState2, OnCommand),
'GetReachableState(stState2) = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState1>'
);
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState2], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState2>'
);
FFiniteStateMachine.RemoveAllTransitions;
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1, stState2, stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.InArray>'
);
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)<Dup.InArray>');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)<Dup.InArray>');
end;
procedure TestTFiniteStateMachine.TestAddTransitions_ProcEvents;
var
ToState : TStateType;
OnCommand : TCommandType;
OnExit : TOnExitStateProc;
OnEnter : TOnEnterStateProc;
ReturnValue : IFiniteStateMachine;
begin
ToState := stFinish;
OnCommand := ctEnd;
OnEnter :=
procedure (const PreviousState, CurrentState : TStateType; const UsedCommand : TCommandType)
begin
//
end;
OnExit :=
procedure (const CurrentState, NewState : TStateType; const UsedCommand : TCommandType)
begin
//
end;
ReturnValue := FFiniteStateMachine.AddTransitions([stState1, stState2], ToState, OnCommand, OnEnter, OnExit);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState1, OnCommand),
'GetReachableState(stState1) = ToState');
CheckEquals<TStateType>(ToState, ReturnValue.GetReachableState(stState2, OnCommand),
'GetReachableState(stState2) = ToState');
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState1>'
);
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState2], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.stState2>'
);
FFiniteStateMachine.RemoveAllTransitions;
CheckException(
procedure
begin
FFiniteStateMachine.AddTransitions([stState1, stState2, stState1], ToState, OnCommand);
end,
ETestException,
'CheckException::ETestException<Dup.InArray>'
);
CheckTrue(ReturnValue.HasTransition(stState1, OnCommand), 'CheckTrue::HasTransition(stState1)<Dup.InArray>');
CheckTrue(ReturnValue.HasTransition(stState2, OnCommand), 'CheckTrue::HasTransition(stState2)<Dup.InArray>');
end;
procedure TestTFiniteStateMachine.TestCreate;
var
FSM : IFiniteStateMachine;
CustomFSM : IFiniteStateMachine<TStateRec, TCommandRec, ETestException>;
StateComparer : IEqualityComparer<TStateRec>;
CommandComparer : IEqualityComparer<TCommandRec>;
begin
{ Default test FSM }
FSM := TFiniteStateMachine.Create;
CheckEquals<TStateType>(START_STATE, FSM.CurrentState, 'CurrentState = START_STATE');
CheckEquals<TStateType>(FSM.PreviousState, FSM.CurrentState, 'CurrentState = PreviousState');
FSM := nil;
FSM := TFiniteStateMachine.Create(FINISH_STATE);
CheckEquals<TStateType>(FINISH_STATE, FSM.CurrentState, 'CurrentState = FINISH_STATE');
CheckEquals<TStateType>(FSM.PreviousState, FSM.CurrentState, 'CurrentState = PreviousState');
FSM := nil;
{ FSM with complex state/command types & custom comparers }
StateComparer := TStateRecComparer.Create;
CommandComparer := TCommandRecComparer.Create;
CustomFSM := TFiniteStateMachine<TStateRec, TCommandRec, ETestException>.Create(
STATE_RECS[0], StateComparer, CommandComparer);
CustomFSM
.AddTransition(STATE_RECS[0], STATE_RECS[1], COMMAND_RECS[0])
.AddTransition(STATE_RECS[1], STATE_RECS[2], COMMAND_RECS[1]);
CheckTrue(CustomFSM.HasTransition(STATE_RECS[0], COMMAND_RECS[0]), 'CheckTrue::HasTransition');
CheckTrue(StateComparer.Equals(STATE_RECS[2], CustomFSM.GetReachableState(STATE_RECS[1], COMMAND_RECS[1])),
'CheckTrue::(GetReachableState = STATE_RECS[2])');
end;
procedure TestTFiniteStateMachine.TestExecute;
var
ReturnValue: IFiniteStateMachine;
bEnterStateCalled, bExitStateCalled : Boolean;
begin
bEnterStateCalled := False;
bExitStateCalled := False;
FFiniteStateMachine
.AddTransition(START_STATE, stState1, ctBegin)
.AddTransition(stState1, stState2, ctSwitchState_1to2, OnEnterState, OnExitState)
.AddTransition(stState2, stState3, ctSwitchState_2to3,
procedure (const PreviousState, CurrentState : TStateType; const UsedCommand : TCommandType)
begin
bEnterStateCalled := True;
CheckEquals<TStateType>(stState2, PreviousState, 'PreviousState = stState2');
CheckEquals<TStateType>(stState3, CurrentState, 'CurrentState = stState3');
CheckEquals<TCommandType>(ctSwitchState_2to3, UsedCommand, 'UsedCommand = ctSwitchState_2to3');
end,
procedure (const CurrentState, NewState : TStateType; const UsedCommand : TCommandType)
begin
bExitStateCalled := True;
CheckEquals<TStateType>(stState2, CurrentState, 'CurrentState = stState2');
CheckEquals<TStateType>(stState3, NewState, 'NewState = stState3');
CheckEquals<TCommandType>(ctSwitchState_2to3, UsedCommand, 'UsedCommand = ctSwitchState_2to3');
end)
.AddTransition(stState3, FINISH_STATE, ctEnd);
ReturnValue := FFiniteStateMachine
.Execute(ctBegin)
.Execute(ctSwitchState_1to2)
.Execute(ctSwitchState_2to3)
.Execute(ctEnd);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckEquals<TStateType>(FINISH_STATE, ReturnValue.CurrentState, 'CurrentState = FINISH_STATE');
CheckNotEquals<TStateType>(START_STATE, ReturnValue.CurrentState, 'CurrentState <> START_STATE');
CheckNotEquals<TStateType>(ReturnValue.PreviousState, ReturnValue.CurrentState, 'CurrentState <> PreviousState');
CheckTrue(FEnterStateCalled, 'CheckTrue::FEnterStateCalled');
CheckTrue(FExitStateCalled, 'CheckTrue::FExitStateCalled');
CheckTrue(bEnterStateCalled, 'CheckTrue::bEnterStateCalled');
CheckTrue(bExitStateCalled, 'CheckTrue::bExitStateCalled');
CheckException(
procedure
begin
FFiniteStateMachine.Execute(ctBegin);
end,
ETestException,
'CheckException::ETestException'
);
CheckInnerException(
procedure
begin
FFiniteStateMachine.Execute(ctBegin);
end,
ETransitionNotFound,
'CheckInnerException::ETransitionNotFound'
);
FFiniteStateMachine.AddTransition(FINISH_STATE, START_STATE, ctBegin,
procedure (const PreviousState, CurrentState : TStateType; const UsedCommand : TCommandType)
begin
FFiniteStateMachine.Execute(ctEnd);
end
);
CheckInnerException(
procedure
begin
FFiniteStateMachine.Execute(ctBegin);
end,
EExecutionInProgress,
'CheckInnerException::EExecutionInProgress'
);
end;
procedure TestTFiniteStateMachine.TestGetReachableState_FromSpecifiedState;
const
TARGET_STATE = stState2;
var
ReturnValue: TStateType;
OnCommand: TCommandType;
FromState: TStateType;
begin
FromState := stState1;
OnCommand := ctSwitchState_1to2;
FFiniteStateMachine.AddTransition(FromState, TARGET_STATE, OnCommand);
ReturnValue := FFiniteStateMachine.GetReachableState(FromState, OnCommand);
CheckEquals<TStateType>(TARGET_STATE, ReturnValue, 'ReturnValue = TARGET_STATE');
CheckException(
procedure
begin
FFiniteStateMachine.GetReachableState(FINISH_STATE, ctEnd);
end,
ETestException,
'CheckException::ETestException'
);
CheckInnerException(
procedure
begin
FFiniteStateMachine.GetReachableState(FINISH_STATE, ctEnd);
end,
ETransitionNotFound,
'CheckInnerException::ETransitionNotFound'
);
end;
procedure TestTFiniteStateMachine.TestGetReachableState_FromCurrentState;
const
TARGET_STATE = stState1;
var
ReturnValue: TStateType;
OnCommand: TCommandType;
begin
OnCommand := ctBegin;
FFiniteStateMachine.AddTransition(START_STATE, TARGET_STATE, OnCommand);
ReturnValue := FFiniteStateMachine.GetReachableState(OnCommand);
CheckEquals<TStateType>(TARGET_STATE, ReturnValue, 'ReturnValue = TARGET_STATE');
CheckException(
procedure
begin
FFiniteStateMachine.GetReachableState(FINISH_STATE, ctEnd);
end,
ETestException,
'CheckException::ETestException'
);
CheckInnerException(
procedure
begin
FFiniteStateMachine.GetReachableState(FINISH_STATE, ctEnd);
end,
ETransitionNotFound,
'CheckInnerException::ETransitionNotFound'
);
end;
procedure TestTFiniteStateMachine.TestHasTransition_FromSpecifiedState;
const
TARGET_STATE = stState2;
var
ReturnValue: Boolean;
OnCommand: TCommandType;
FromState: TStateType;
begin
FromState := stState1;
OnCommand := ctSwitchState_1to2;
FFiniteStateMachine.AddTransition(FromState, TARGET_STATE, OnCommand);
ReturnValue := FFiniteStateMachine.HasTransition(FromState, OnCommand);
CheckTrue(ReturnValue, 'CheckTrue::ReturnValue');
FromState := FINISH_STATE;
OnCommand := ctEnd;
ReturnValue := FFiniteStateMachine.HasTransition(FromState, OnCommand);
CheckFalse(ReturnValue, 'CheckFalse::ReturnValue');
end;
procedure TestTFiniteStateMachine.TestHasTransition_FromCurrentState;
const
TARGET_STATE = stState1;
var
ReturnValue: Boolean;
OnCommand: TCommandType;
begin
OnCommand := ctBegin;
FFiniteStateMachine.AddTransition(START_STATE, TARGET_STATE, OnCommand);
ReturnValue := FFiniteStateMachine.HasTransition(OnCommand);
CheckTrue(ReturnValue, 'CheckTrue::ReturnValue');
OnCommand := ctEnd;
ReturnValue := FFiniteStateMachine.HasTransition(OnCommand);
CheckFalse(ReturnValue, 'CheckFalse::ReturnValue');
end;
procedure TestTFiniteStateMachine.TestRemoveAllTransitions;
var
ReturnValue: IFiniteStateMachine;
begin
FFiniteStateMachine
.AddTransition(stStart, stState1, ctBegin)
.AddTransition(stState1, stState2, ctSwitchState_1to2)
.AddTransition(stState2, stState3, ctSwitchState_2to3);
ReturnValue := FFiniteStateMachine.RemoveAllTransitions;
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckFalse(
ReturnValue.HasTransition(stStart, ctBegin) or
ReturnValue.HasTransition(stState1, ctSwitchState_1to2) or
ReturnValue.HasTransition(stState2, ctSwitchState_2to3),
'CheckFalse::HasTransition'
);
end;
procedure TestTFiniteStateMachine.TestRemoveTransition;
var
ReturnValue: IFiniteStateMachine;
OnCommand: TCommandType;
FromState: TStateType;
begin
FromState := START_STATE;
OnCommand := ctEnd;
FFiniteStateMachine.AddTransition(FromState, FINISH_STATE, OnCommand);
ReturnValue := FFiniteStateMachine.RemoveTransition(FromState, OnCommand);
CheckEquals(TObject(FFiniteStateMachine), TObject(ReturnValue), 'ReturnValue = FFiniteStateMachine');
CheckFalse(ReturnValue.HasTransition(FromState, OnCommand), 'CheckFalse::HasTransition');
CheckException(
procedure
begin
FFiniteStateMachine.RemoveTransition(FromState, OnCommand);
end,
nil,
'CheckException::nil'
);
end;
{ TestTFiniteStateMachine.TStateRecComparer }
function TestTFiniteStateMachine.TStateRecComparer.Equals(const Left, Right : TStateRec) : Boolean;
begin
Result := (Left.ID = Right.ID) and (Left.Flag = Right.Flag);
end;
function TestTFiniteStateMachine.TStateRecComparer.GetHashCode(const Value : TStateRec) : Integer;
begin
Result := THashBobJenkins.GetHashValue(Value, SizeOf(Value));
end;
{ TestTFiniteStateMachine.TCommandRecComparer }
function TestTFiniteStateMachine.TCommandRecComparer.Equals(const Left, Right : TCommandRec) : Boolean;
begin
Result := (Left.ID = Right.ID) and (Left.Flag = Right.Flag);
end;
function TestTFiniteStateMachine.TCommandRecComparer.GetHashCode(const Value : TCommandRec) : Integer;
begin
Result := THashBobJenkins.GetHashValue(Value, SizeOf(Value));
end;
{ TestTThreadFiniteStateMachine }
procedure TestTThreadFiniteStateMachine.SetUp;
begin
FFiniteStateMachine := TThreadFiniteStateMachine<
TestTFiniteStateMachine.TStateType,
TestTFiniteStateMachine.TCommandType,
TestTFiniteStateMachine.ETestException
>.Create;
end;
procedure TestTThreadFiniteStateMachine.TestThreadSafety;
type
IThreadFiniteStateMachine = IThreadFiniteStateMachine<TStateType, TCommandType, ETestException>;
var
ThreadFSM : IThreadFiniteStateMachine;
LoadThread : TThread;
TestTask : ITask;
bLoadThreadFaulted,
bCheck1, bCheck2, bCheck3 : Boolean;
begin
ThreadFSM := IThreadFiniteStateMachine(FFiniteStateMachine);
ThreadFSM
.AddTransition(stStart, stFinish, ctEnd)
.AddTransition(stFinish, stStart, ctBegin);
bLoadThreadFaulted := False;
LoadThread := TThread.CreateAnonymousThread(
procedure
var
FSM : IFiniteStateMachine;
begin
try
while not TThread.CheckTerminated do
begin
FSM := ThreadFSM.Lock;
try
case FSM.CurrentState of
stStart:
FSM.Execute(ctEnd);
stFinish:
FSM.Execute(ctBegin);
end;
finally
ThreadFSM.Unlock;
end;
end;
except
bLoadThreadFaulted := True;
end;
end
);
LoadThread.Start;
bCheck1 := False;
bCheck2 := False;
bCheck3 := False;
TestTask := TTask.Run(
procedure
var
i : Integer;
FSM : IFiniteStateMachine;
begin
ThreadFSM
.AddTransition(stState1, stState2, ctSwitchState_1to2)
.AddTransition(stState2, stState3, ctSwitchState_2to3);
for i := 1 to 1000 do
begin
FSM := ThreadFSM.Lock;
try
case FSM.CurrentState of
stStart:
FSM.Execute(ctEnd);
stFinish:
FSM.Execute(ctBegin);
end;
finally
ThreadFSM.Unlock;
end;
end;
bCheck1 := ThreadFSM.HasTransition(stState1, ctSwitchState_1to2);
ThreadFSM.RemoveTransition(stState1, ctSwitchState_1to2);
bCheck2 := not ThreadFSM.HasTransition(stState1, ctSwitchState_1to2);
with ThreadFSM do
try
Lock
.RemoveAllTransitions
.AddTransition(stStart, stFinish, ctEnd)
.AddTransition(stFinish, stStart, ctBegin);
bCheck3 := not HasTransition(stState2, ctSwitchState_2to3);
finally
Unlock;
end;
end
);
CheckException(
procedure
begin
TestTask.Wait;
end,
nil,
'CheckException::nil'
);
CheckFalse(bLoadThreadFaulted, 'CheckFalse::bLoadThreadFaulted');
CheckTrue(bCheck1, 'CheckTrue::bCheck1');
CheckTrue(bCheck2, 'CheckTrue::bCheck2');
CheckTrue(bCheck3, 'CheckTrue::bCheck3');
TestTask := nil;
LoadThread.Terminate;
end;
initialization
// Register any test cases with the test runner
RegisterTest(TestTFiniteStateMachine.Suite);
RegisterTest(TestTThreadFiniteStateMachine.Suite);
end.
|
unit SMCnst;
interface
{Bulgarian strings }
//translated by Nikolay Marinov marinov@bg-soft.com
const
strMessage = 'Печат...';
strSaveChanges = 'Наистина ли желаете да съхраните промените на сървъра?';
strErrSaveChanges = 'Не може да се запишат промените! Проверете връзката със сървъра или валидността на данните.';
strDeleteWarning = 'Наистина ли желаете да изтриете таблицата %s?';
strEmptyWarning = 'Наистина ли желаете да изтриете всички записи от таблицата %s?';
const
PopUpCaption: array [0..22] of string[33] =
('Добави запис',
'Вмъкни запис',
'Редактирай запис',
'Изтрий запис',
'-',
'Печат ...',
'Експорт ...',
'-',
'Съхрани промените',
'Откажи промените',
'Освежи данните',
'-',
'Маркирай/Размаркирай записи',
'Маркирай запис',
'Маркирай всички записи',
'-',
'Размаркира запис',
'Размаркирай всички записи',
'-',
'Запази изгледа на колоната',
'Възстанови изгледа на колоната',
'-',
'Setup...');
const //for TSMSetDBGridDialog
SgbTitle = ' Заглавие ';
SgbData = ' Данни ';
STitleCaption = 'Надпис:';
STitleAlignment = 'Подравняване:';
STitleColor = 'Основа:';
STitleFont = 'Шрифт:';
SWidth = 'Ширина:';
SWidthFix = 'букви';
SAlignLeft = 'ляво';
SAlignRight = 'дясно';
SAlignCenter = 'центрирано';
const //for TSMDBFilterDialog
strEqual = 'равно';
strNonEqual = 'различно';
strNonMore = 'не по-голямо';
strNonLess = 'не по-малко';
strLessThan = 'по-малко от';
strLargeThan = 'по-голямо от';
strExist = 'празно';
strNonExist = 'не е празно';
strIn = 'в лист';
strBetween = 'между';
strOR = 'ИЛИ';
strAND = 'И';
strField = 'Поле';
strCondition = 'Условие';
strValue = 'Стойност';
strAddCondition = ' Дефиниране на допълнителни условия:';
strSelection = ' Маркирай записи при следните условия:';
strAddToList = 'Добави в листа';
strDeleteFromList = 'Изтрий от листа';
strTemplate = 'Филтърни шаблони прозорец';
strFLoadFrom = 'Вземи от...';
strFSaveAs = 'Съхрани като..';
strFDescription = 'Описание';
strFFileName = 'Име на файл';
strFCreate = 'Създаден: %s';
strFModify = 'Променен: %s';
strFProtect = 'Защита от презапис';
strFProtectErr = 'Файлът е защитен!';
const //for SMDBNavigator
SFirstRecord = 'Първи запис';
SPriorRecord = 'Предходен запис';
SNextRecord = 'Следваш запис';
SLastRecord = 'Последен запис';
SInsertRecord = 'Вмъкни запис';
SCopyRecord = 'Копирай запис';
SDeleteRecord = 'Изтрий запис';
SEditRecord = 'Промени запис';
SFilterRecord = 'Условия за филтър';
SFindRecord = 'Търсене на запис';
SPrintRecord = 'Печат на записи';
SExportRecord = 'Експорт на записи';
SPostEdit = 'Съхрани промените';
SCancelEdit = 'Отказ на промените';
SRefreshRecord = 'Освежи данните';
SChoice = 'Избери запис';
SClear = 'Изчисти избраното';
SDeleteRecordQuestion = 'Изтриване на запис?';
SDeleteMultipleRecordsQuestion = 'Наистина ли желаете да изтриете маркираните записи?';
SRecordNotFound = 'Записът не е намерен';
SFirstName = 'Първи';
SPriorName = 'Предходен';
SNextName = 'Следващ';
SLastName = 'Последен';
SInsertName = 'Вмъкни';
SCopyName = 'Копирай';
SDeleteName = 'Изтрий';
SEditName = 'Редактирай';
SFilterName = 'Филтър';
SFindName = 'Намери';
SPrintName = 'Печат';
SExportName = 'Експорт';
SPostName = 'Запиши';
SCancelName = 'Отказ';
SRefreshName = 'Освежи';
SChoiceName = 'Избери';
SClearName = 'Изчисти';
SBtnOk = '&OK';
SBtnCancel = '&Отказ';
SBtnLoad = 'Зареди';
SBtnSave = 'Запиши';
SBtnCopy = 'Копирай';
SBtnPaste = 'Вмъкни';
SBtnClear = 'Изчисти';
SRecNo = 'запис.';
SRecOf = ' от ';
const //for EditTyped
etValidNumber = 'валидно число';
etValidInteger = 'валидно цяло число';
etValidDateTime = 'валидна дата/час';
etValidDate = 'валидна дата';
etValidTime = 'валиден час';
etValid = 'валиден';
etIsNot = 'не е';
etOutOfRange = 'Стойността %s е вън от допустимото %s..%s';
implementation
end.
|
unit LLVM.Imports.OrcBindings;
interface
//based on OrcBindings.h
uses
LLVM.Imports,
LLVM.Imports.Types,
LLVM.Imports.TargetMachine,
LLVM.Imports.Error;
type
TLLVMSharedModuleRef = type TLLVMRef;
TLLVMSharedObjectBufferRef = type TLLVMRef;
TLLVMOrcJITStackRef = type TLLVMRef;
TLLVMOrcModuleHandle = type UInt64;
TLLVMOrcTargetAddress = type UInt64;
TLLVMOrcSymbolResolverFn = function(const Name: PLLVMChar; LookupCtx: Pointer): UInt64; cdecl;
TLLVMOrcLazyCompileCallbackFn = function(JITStack: TLLVMOrcJITStackRef; CallbackCtx: Pointer): UInt64; cdecl;
{$MINENUMSIZE 4}
{**
* Create an ORC JIT stack.
*
* The client owns the resulting stack, and must call OrcDisposeInstance(...)
* to destroy it and free its memory. The JIT stack will take ownership of the
* TargetMachine, which will be destroyed when the stack is destroyed. The
* client should not attempt to dispose of the Target Machine, or it will result
* in a double-free.
*}
function LLVMOrcCreateInstance(TM: TLLVMTargetMachineRef): TLLVMOrcJITStackRef; cdecl; external CLLVMLibrary;
{**
* Get the error message for the most recent error (if any).
*
* This message is owned by the ORC JIT Stack and will be freed when the stack
* is disposed of by LLVMOrcDisposeInstance.
*}
function LLVMOrcGetErrorMsg(JITStack: TLLVMOrcJITStackRef): PLLVMChar; cdecl; external CLLVMLibrary;
{**
* Mangle the given symbol.
* Memory will be allocated for MangledSymbol to hold the result. The client
*}
procedure LLVMOrcGetMangledSymbol(JITStack: TLLVMOrcJITStackRef; out MangledSymbol: PLLVMChar; const Symbol: PLLVMChar); cdecl; external CLLVMLibrary;
{**
* Dispose of a mangled symbol.
*}
procedure LLVMOrcDisposeMangledSymbol(MangledSymbol: PLLVMChar); cdecl; external CLLVMLibrary;
{**
* Create a lazy compile callback.
*}
function LLVMOrcCreateLazyCompileCallback(JITStack: TLLVMOrcJITStackRef; var RetAddr: TLLVMOrcTargetAddress; Callback: TLLVMOrcLazyCompileCallbackFn; CallbackCtx: Pointer): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Create a named indirect call stub.
*}
function LLVMOrcCreateIndirectStub(JITStack: TLLVMOrcJITStackRef; const StubName: PLLVMChar; InitAddr: TLLVMOrcTargetAddress): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Set the pointer for the given indirect stub.
*}
function LLVMOrcSetIndirectStubPointer(JITStack: TLLVMOrcJITStackRef; const StubName: PLLVMChar; NewAddr: TLLVMOrcTargetAddress): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Add module to be eagerly compiled.
*}
function LLVMOrcAddEagerlyCompiledIR(JITStack: TLLVMOrcJITStackRef; out RetHandle: TLLVMOrcModuleHandle; Module: TLLVMSharedModuleRef; SymbolResolver: TLLVMOrcSymbolResolverFn; SymbolResolverCtx: Pointer): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Add module to be lazily compiled one function at a time.
*}
function LLVMOrcAddLazilyCompiledIR(JITStack: TLLVMOrcJITStackRef; out RetHandle: TLLVMOrcModuleHandle; Module: TLLVMSharedModuleRef; SymbolResolver: TLLVMOrcSymbolResolverFn; SymbolResolverCtx: Pointer): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Add an object file.
*}
function LLVMOrcAddObjectFile(JITStack: TLLVMOrcJITStackRef; out RetHandle: TLLVMOrcModuleHandle; Obj: TLLVMSharedObjectBufferRef; SymbolResolver: TLLVMOrcSymbolResolverFn; SymbolResolverCtx: Pointer): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Remove a module set from the JIT.
*
* This works for all modules that can be added via OrcAdd*, including object
* files.
*}
function LLVMOrcRemoveModule(JITStack: TLLVMOrcJITStackRef; H: TLLVMOrcModuleHandle): TLLVMErrorRef; cdecl; external CLLVMLibrary;
{**
* Get symbol address from JIT instance.
*}
function LLVMOrcGetSymbolAddress(JITStack: TLLVMOrcJITStackRef; out RetAddr: TLLVMOrcTargetAddress; const SymbolName: PLLVMChar): TLLVMErrorRef; cdecl; external CLLVMLibrary;
(**
* Get symbol address from JIT instance, searching only the specified
* handle.
*)
function LLVMOrcGetSymbolAddressIn(JITStack: TLLVMOrcJITStackRef; out RetAddr: TLLVMOrcTargetAddress; H: TLLVMOrcModuleHandle; const SymbolName: PLLVMChar):TLLVMErrorRef;cdecl; external CLLVMLibrary;
{**
* Dispose of an ORC JIT stack.
*}
function LLVMOrcDisposeInstance(JITStack: TLLVMOrcJITStackRef): TLLVMErrorRef; cdecl; external CLLVMLibrary;
implementation
end.
|
unit System_DBUnit;
interface
uses
System.SysUtils, System.Classes, FireDAC.Stan.Intf, FireDAC.Stan.Option,
FireDAC.Stan.Error, FireDAC.UI.Intf, FireDAC.Phys.Intf, FireDAC.Stan.Def,
FireDAC.Stan.Pool, FireDAC.Stan.Async, FireDAC.Phys, FireDAC.Phys.MySQL,
FireDAC.Phys.MySQLDef, FireDAC.VCLUI.Wait, Data.DB, FireDAC.Comp.Client;
type
TDBDataModule = class(TDataModule)
FDMainConnection: TFDConnection;
private
{ Private declarations }
FPassword: string;
FUserName: string;
FDatabase: string;
FServer: string;
FPort: string;
public
{ Public declarations }
property UserName : string read FUserName;
property Database : string read FDataBase;
property Server : string read FServer;
property Port : string read FPort;
constructor Create(AOwner: TComponent); override;
function checkConnection: boolean;
function Login(const aDatabaseName, aUserName, aPassword: string): boolean;
procedure getDatabaseList(var aList: TStrings);
end;
var
DBDataModule: TDBDataModule;
implementation
{%CLASSGROUP 'Vcl.Controls.TControl'}
{$R *.dfm}
constructor TDBDataModule.Create(AOwner: TComponent);
begin
inherited;
// Определение параметров подключения к БД
FPassword := 'myc25ce2Ph6sql';
FUserName := 'root';
FDatabase := '';
FServer := 'localhost';
FPort := '3306';
FDatabase := '';
end;
function TDBDataModule.Login(const aDatabaseName, aUserName, aPassword: string): boolean;
begin
FDMainConnection.Connected := False;
FDatabase := aDatabaseName;
FUserName := aUserName;
FPassword := aPassword;
Result := checkConnection;
end;
function TDBDataModule.checkConnection: boolean;
begin
Result := true;
if (not FDMainConnection.Connected) then begin
FDMainConnection.Params.Clear;
FDMainConnection.Params.Add('DriverID=MySQL');
FDMainConnection.Params.Add('CharacterSet=utf8');
FDMainConnection.Params.Add('Password=' + FPassword);
FDMainConnection.Params.Add('Server=' + FServer);
FDMainConnection.Params.Add('User_Name=' + FUserName);
FDMainConnection.Params.Add('Port=' + FPort);
if (FDatabase <> '') then begin
FDMainConnection.Params.Add('Database=' + FDatabase);
end;
try
FDMainConnection.Connected := true;
except
Result := false;
end;
end;
end;
procedure TDBDataModule.getDatabaseList(var aList: TStrings);
var
vConnected : boolean;
vFDQuery : TFDQuery;
s : string;
begin
if Assigned(aList) then begin
vConnected := checkConnection;
if vConnected then begin
vFDQuery := TFDQuery.Create(Self);
try
// Получение списка баз данных на сервере
vFDQuery.Connection:= FDMainConnection;
vFDQuery.SQL.Text := 'SELECT schema_name FROM information_schema.schemata';
vFDQuery.Active := true;
vFDQuery.First;
while (not vFDQuery.Eof) do begin
s:= vFDQuery.FieldByName('schema_name').AsString;
aList.Add(s);
vFDQuery.Next;
end;
vFDQuery.Active := false;
finally
FreeAndNil(vFDQuery);
end;
end;
end;
end;
end.
|
unit Test.CoffeeMachine;
interface
uses
Classes,
Rtti,
DUnitX.TestFramework,
Delphi.Mocks,
Model.CoffeMachine;
{$TYPEINFO ON}
type
[TestFixture]
TestCoffeeMaker = class(TObject)
private
// -----
fCoffeeMachine: TCoffeeMachine;
// -----
fBrewingUnit: TMock<IBrewingUnit>;
fGrinder: TMock<IGrinder>;
fUserPanel: TMock<IUserPanel>;
fMachineTester: TMock<IMachineTester>;
public
[SetUp]
procedure SetUp;
[TearDown]
procedure TearDown;
[Test]
[TestCase('Ristretto', 'csRistretto,7,gsSuperFine,20')]
[TestCase('Espresso', 'csEspresso,8,gsFine,30')]
[TestCase('Doppio', 'csDoppio,16,gsFine,60')]
[TestCase('Lungo', 'csLungo,8,gsFine,45')]
procedure BrewAndVerifyBehaviour(const aCoffeeSelection: TCoffeeSelection;
aCoffeeWeight: double; aGrindSize: TGrindSize; aWaterAmount: double);
published
procedure NotReadyToBrewCoffee;
procedure BrewingEspresso;
end;
{$TYPEINFO OFF}
implementation
{ TestCoffeeMaker }
procedure TestCoffeeMaker.SetUp;
begin
fBrewingUnit := TMock<IBrewingUnit>.Create;
fGrinder := TMock<IGrinder>.Create;
fUserPanel := TMock<IUserPanel>.Create;
fMachineTester := TMock<IMachineTester>.Create;
// ----
fCoffeeMachine := TCoffeeMachine.Create(
{} fBrewingUnit,
{} fGrinder,
{} fUserPanel,
{} fMachineTester);
end;
procedure TestCoffeeMaker.TearDown;
begin
fCoffeeMachine.Free;
end;
procedure TestCoffeeMaker.NotReadyToBrewCoffee;
var
aCoffee: TCoffee;
begin
fMachineTester.SetUp.WillReturn(False).When.IsReadyToBrewCoffee;
aCoffee := fCoffeeMachine.BrewCoffee(csEspresso);
Assert.AreEqual('-- no coffee --', aCoffee.ToString);
end;
procedure TestCoffeeMaker.BrewingEspresso;
var
aCoffee: TCoffee;
begin
fMachineTester.SetUp.WillReturn(True).When.IsReadyToBrewCoffee;
aCoffee := fCoffeeMachine.BrewCoffee(csEspresso);
Assert.AreEqual('Espresso (85,0°C, 30 ml)', aCoffee.ToString);
end;
procedure TestCoffeeMaker.BrewAndVerifyBehaviour(const aCoffeeSelection
: TCoffeeSelection; aCoffeeWeight: double; aGrindSize: TGrindSize; aWaterAmount: double);
var
aCoffee: TCoffee;
begin
fMachineTester.SetUp.WillReturn(True).When.IsReadyToBrewCoffee;
fMachineTester.SetUp.Expect.Once.When.IsReadyToBrewCoffee;
fGrinder.SetUp.Expect.Once.When.SetGrindSize(aGrindSize);
fGrinder.SetUp.Expect.Once.When.GrindCoffeeBeans(aCoffeeWeight {mg coffee});
fBrewingUnit.SetUp.Expect.Once.When.PressCoffe;
fBrewingUnit.SetUp.Expect.Once.When.BrewWater(aWaterAmount {ml water});
fBrewingUnit.SetUp.Expect.Once.When.PressWater(9.0 {bar});
fBrewingUnit.SetUp.Expect.Once.When.TrashCoffe;
fUserPanel.SetUp.Expect.Exactly(1).When.CoffeeInProgress(True);
fUserPanel.SetUp.Expect.Exactly(1).When.CoffeeInProgress(False);
aCoffee := fCoffeeMachine.BrewCoffee(aCoffeeSelection);
Assert.AreEqual(aCoffeeSelection, aCoffee.Selection);
Assert.AreEqual(aWaterAmount, aCoffee.WaterML);
fMachineTester.Verify;
fGrinder.Verify;
fBrewingUnit.Verify;
fUserPanel.Verify;
end;
initialization
TDUnitX.RegisterTestFixture(TestCoffeeMaker);
end.
|
unit WritingFrame;
interface
uses
Global,
LTConsts,
LTClasses,
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, StdCtrls, ExtCtrls;
type
TfmWriting = class(TFrame)
lbQuestionInput: TLabel;
lbText: TLabel;
lbQuestion: TLabel;
lbNumber: TLabel;
memoWriting: TMemo;
private
{ Private declarations }
FQuiz: TWriting;
public
{ Public declarations }
procedure Binding(Quiz: TWriting);
function GetTestResultDetail : TTestResultDetail;
end;
implementation
{$R *.dfm}
{ TfmWriting }
procedure TfmWriting.Binding(Quiz: TWriting);
begin
FQuiz := Quiz;
lbText.Caption := FQuiz.ExampleText;
lbNumber.Caption := IntToStr(FQuiz.QuizNumber);
lbQuestion.Caption := FQuiz.Quiz;
end;
function TfmWriting.GetTestResultDetail: TTestResultDetail;
begin
Result := TTestResultDetail.Create;
Result.QuizNumber := FQuiz.QuizNumber;
Result.Answer := memoWriting.Text;
Result.Correct := UNMARKING;
Result.Point := -1;
Result.Section := FQuiz.Kind;
end;
end.
|
{ ****************************************************************************** }
{ Fast KDTree Integer type support }
{ ****************************************************************************** }
{ * https://zpascal.net * }
{ * https://github.com/PassByYou888/zAI * }
{ * https://github.com/PassByYou888/ZServer4D * }
{ * https://github.com/PassByYou888/PascalString * }
{ * https://github.com/PassByYou888/zRasterization * }
{ * https://github.com/PassByYou888/CoreCipher * }
{ * https://github.com/PassByYou888/zSound * }
{ * https://github.com/PassByYou888/zChinese * }
{ * https://github.com/PassByYou888/zExpression * }
{ * https://github.com/PassByYou888/zGameWare * }
{ * https://github.com/PassByYou888/zAnalysis * }
{ * https://github.com/PassByYou888/FFMPEG-Header * }
{ * https://github.com/PassByYou888/zTranslate * }
{ * https://github.com/PassByYou888/InfiniteIoT * }
{ * https://github.com/PassByYou888/FastMD5 * }
{ ****************************************************************************** }
unit FastKDTreeI32;
{$INCLUDE zDefine.inc}
interface
uses CoreClasses, PascalStrings, UnicodeMixedLib, KM;
const
// integer KDTree
KDT1DI32_Axis = 1;
KDT2DI32_Axis = 2;
KDT3DI32_Axis = 3;
KDT4DI32_Axis = 4;
KDT5DI32_Axis = 5;
KDT6DI32_Axis = 6;
KDT7DI32_Axis = 7;
KDT8DI32_Axis = 8;
KDT9DI32_Axis = 9;
KDT10DI32_Axis = 10;
KDT11DI32_Axis = 11;
KDT12DI32_Axis = 12;
KDT13DI32_Axis = 13;
KDT14DI32_Axis = 14;
KDT15DI32_Axis = 15;
KDT16DI32_Axis = 16;
KDT17DI32_Axis = 17;
KDT18DI32_Axis = 18;
KDT19DI32_Axis = 19;
KDT20DI32_Axis = 20;
KDT21DI32_Axis = 21;
KDT22DI32_Axis = 22;
KDT23DI32_Axis = 23;
KDT24DI32_Axis = 24;
KDT48DI32_Axis = 48;
KDT52DI32_Axis = 52;
KDT64DI32_Axis = 64;
KDT96DI32_Axis = 96;
KDT128DI32_Axis = 128;
KDT156DI32_Axis = 156;
KDT192DI32_Axis = 192;
KDT256DI32_Axis = 256;
KDT384DI32_Axis = 384;
KDT512DI32_Axis = 512;
KDT800DI32_Axis = 800;
KDT1024DI32_Axis = 1024;
type
// integer: KDTree
TKDT1DI32 = class; TKDT1DI32_VecType = KM.TKMFloat; // 1D
TKDT2DI32 = class; TKDT2DI32_VecType = KM.TKMFloat; // 2D
TKDT3DI32 = class; TKDT3DI32_VecType = KM.TKMFloat; // 3D
TKDT4DI32 = class; TKDT4DI32_VecType = KM.TKMFloat; // 4D
TKDT5DI32 = class; TKDT5DI32_VecType = KM.TKMFloat; // 5D
TKDT6DI32 = class; TKDT6DI32_VecType = KM.TKMFloat; // 6D
TKDT7DI32 = class; TKDT7DI32_VecType = KM.TKMFloat; // 7D
TKDT8DI32 = class; TKDT8DI32_VecType = KM.TKMFloat; // 8D
TKDT9DI32 = class; TKDT9DI32_VecType = KM.TKMFloat; // 9D
TKDT10DI32 = class; TKDT10DI32_VecType = KM.TKMFloat; // 10D
TKDT11DI32 = class; TKDT11DI32_VecType = KM.TKMFloat; // 11D
TKDT12DI32 = class; TKDT12DI32_VecType = KM.TKMFloat; // 12D
TKDT13DI32 = class; TKDT13DI32_VecType = KM.TKMFloat; // 13D
TKDT14DI32 = class; TKDT14DI32_VecType = KM.TKMFloat; // 14D
TKDT15DI32 = class; TKDT15DI32_VecType = KM.TKMFloat; // 15D
TKDT16DI32 = class; TKDT16DI32_VecType = KM.TKMFloat; // 16D
TKDT17DI32 = class; TKDT17DI32_VecType = KM.TKMFloat; // 17D
TKDT18DI32 = class; TKDT18DI32_VecType = KM.TKMFloat; // 18D
TKDT19DI32 = class; TKDT19DI32_VecType = KM.TKMFloat; // 19D
TKDT20DI32 = class; TKDT20DI32_VecType = KM.TKMFloat; // 20D
TKDT21DI32 = class; TKDT21DI32_VecType = KM.TKMFloat; // 21D
TKDT22DI32 = class; TKDT22DI32_VecType = KM.TKMFloat; // 22D
TKDT23DI32 = class; TKDT23DI32_VecType = KM.TKMFloat; // 23D
TKDT24DI32 = class; TKDT24DI32_VecType = KM.TKMFloat; // 24D
TKDT48DI32 = class; TKDT48DI32_VecType = KM.TKMFloat; // 48D
TKDT52DI32 = class; TKDT52DI32_VecType = KM.TKMFloat; // 52D
TKDT64DI32 = class; TKDT64DI32_VecType = KM.TKMFloat; // 64D
TKDT96DI32 = class; TKDT96DI32_VecType = KM.TKMFloat; // 96D
TKDT128DI32 = class; TKDT128DI32_VecType = KM.TKMFloat; // 128D
TKDT156DI32 = class; TKDT156DI32_VecType = KM.TKMFloat; // 156D
TKDT192DI32 = class; TKDT192DI32_VecType = KM.TKMFloat; // 192D
TKDT256DI32 = class; TKDT256DI32_VecType = KM.TKMFloat; // 256D
TKDT384DI32 = class; TKDT384DI32_VecType = KM.TKMFloat; // 384D
TKDT512DI32 = class; TKDT512DI32_VecType = KM.TKMFloat; // 512D
TKDT800DI32 = class; TKDT800DI32_VecType = KM.TKMFloat; // 800D
TKDT1024DI32 = class; TKDT1024DI32_VecType = KM.TKMFloat; // 1024D
// integer KDTree
TKDT1DI32 = class(TCoreClassObject)
public type
// code split
TKDT1DI32_Vec = array [0 .. KDT1DI32_Axis - 1] of TKDT1DI32_VecType;
PKDT1DI32_Vec = ^TKDT1DI32_Vec;
TKDT1DI32_DynamicVecBuffer = array of TKDT1DI32_Vec;
PKDT1DI32_DynamicVecBuffer = ^TKDT1DI32_DynamicVecBuffer;
TKDT1DI32_Source = record
buff: TKDT1DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT1DI32_Source = ^TKDT1DI32_Source;
TKDT1DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT1DI32_Source) - 1] of PKDT1DI32_Source;
PKDT1DI32_SourceBuffer = ^TKDT1DI32_SourceBuffer;
TKDT1DI32_DyanmicSourceBuffer = array of PKDT1DI32_Source;
PKDT1DI32_DyanmicSourceBuffer = ^TKDT1DI32_DyanmicSourceBuffer;
TKDT1DI32_DyanmicStoreBuffer = array of TKDT1DI32_Source;
PKDT1DI32_DyanmicStoreBuffer = ^TKDT1DI32_DyanmicStoreBuffer;
PKDT1DI32_Node = ^TKDT1DI32_Node;
TKDT1DI32_Node = record
Parent, Right, Left: PKDT1DI32_Node;
Vec: PKDT1DI32_Source;
end;
TKDT1DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer);
TKDT1DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT1DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT1DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT1DI32_DyanmicStoreBuffer;
KDBuff: TKDT1DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT1DI32_Node;
TestBuff: TKDT1DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT1DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT1DI32_Node;
function GetData(const Index: NativeInt): PKDT1DI32_Source;
public
RootNode: PKDT1DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT1DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT1DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT1DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT1DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT1DI32_Node; overload;
function Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT1DI32_Node; overload;
function Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double): PKDT1DI32_Node; overload;
function Search(const buff: TKDT1DI32_Vec): PKDT1DI32_Node; overload;
function SearchToken(const buff: TKDT1DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT1DI32_DynamicVecBuffer; var OutBuff: TKDT1DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT1DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT1DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT1DI32_Vec; overload;
class function Vec(const v: TKDT1DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT1DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT2DI32 = class(TCoreClassObject)
public type
// code split
TKDT2DI32_Vec = array [0 .. KDT2DI32_Axis - 1] of TKDT2DI32_VecType;
PKDT2DI32_Vec = ^TKDT2DI32_Vec;
TKDT2DI32_DynamicVecBuffer = array of TKDT2DI32_Vec;
PKDT2DI32_DynamicVecBuffer = ^TKDT2DI32_DynamicVecBuffer;
TKDT2DI32_Source = record
buff: TKDT2DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT2DI32_Source = ^TKDT2DI32_Source;
TKDT2DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT2DI32_Source) - 1] of PKDT2DI32_Source;
PKDT2DI32_SourceBuffer = ^TKDT2DI32_SourceBuffer;
TKDT2DI32_DyanmicSourceBuffer = array of PKDT2DI32_Source;
PKDT2DI32_DyanmicSourceBuffer = ^TKDT2DI32_DyanmicSourceBuffer;
TKDT2DI32_DyanmicStoreBuffer = array of TKDT2DI32_Source;
PKDT2DI32_DyanmicStoreBuffer = ^TKDT2DI32_DyanmicStoreBuffer;
PKDT2DI32_Node = ^TKDT2DI32_Node;
TKDT2DI32_Node = record
Parent, Right, Left: PKDT2DI32_Node;
Vec: PKDT2DI32_Source;
end;
TKDT2DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer);
TKDT2DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT2DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT2DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT2DI32_DyanmicStoreBuffer;
KDBuff: TKDT2DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT2DI32_Node;
TestBuff: TKDT2DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT2DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT2DI32_Node;
function GetData(const Index: NativeInt): PKDT2DI32_Source;
public
RootNode: PKDT2DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT2DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT2DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT2DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT2DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT2DI32_Node; overload;
function Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT2DI32_Node; overload;
function Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double): PKDT2DI32_Node; overload;
function Search(const buff: TKDT2DI32_Vec): PKDT2DI32_Node; overload;
function SearchToken(const buff: TKDT2DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT2DI32_DynamicVecBuffer; var OutBuff: TKDT2DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT2DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT2DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT2DI32_Vec; overload;
class function Vec(const v: TKDT2DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT2DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT3DI32 = class(TCoreClassObject)
public type
// code split
TKDT3DI32_Vec = array [0 .. KDT3DI32_Axis - 1] of TKDT3DI32_VecType;
PKDT3DI32_Vec = ^TKDT3DI32_Vec;
TKDT3DI32_DynamicVecBuffer = array of TKDT3DI32_Vec;
PKDT3DI32_DynamicVecBuffer = ^TKDT3DI32_DynamicVecBuffer;
TKDT3DI32_Source = record
buff: TKDT3DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT3DI32_Source = ^TKDT3DI32_Source;
TKDT3DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT3DI32_Source) - 1] of PKDT3DI32_Source;
PKDT3DI32_SourceBuffer = ^TKDT3DI32_SourceBuffer;
TKDT3DI32_DyanmicSourceBuffer = array of PKDT3DI32_Source;
PKDT3DI32_DyanmicSourceBuffer = ^TKDT3DI32_DyanmicSourceBuffer;
TKDT3DI32_DyanmicStoreBuffer = array of TKDT3DI32_Source;
PKDT3DI32_DyanmicStoreBuffer = ^TKDT3DI32_DyanmicStoreBuffer;
PKDT3DI32_Node = ^TKDT3DI32_Node;
TKDT3DI32_Node = record
Parent, Right, Left: PKDT3DI32_Node;
Vec: PKDT3DI32_Source;
end;
TKDT3DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer);
TKDT3DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT3DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT3DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT3DI32_DyanmicStoreBuffer;
KDBuff: TKDT3DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT3DI32_Node;
TestBuff: TKDT3DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT3DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT3DI32_Node;
function GetData(const Index: NativeInt): PKDT3DI32_Source;
public
RootNode: PKDT3DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT3DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT3DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT3DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT3DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT3DI32_Node; overload;
function Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT3DI32_Node; overload;
function Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double): PKDT3DI32_Node; overload;
function Search(const buff: TKDT3DI32_Vec): PKDT3DI32_Node; overload;
function SearchToken(const buff: TKDT3DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT3DI32_DynamicVecBuffer; var OutBuff: TKDT3DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT3DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT3DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT3DI32_Vec; overload;
class function Vec(const v: TKDT3DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT3DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT4DI32 = class(TCoreClassObject)
public type
// code split
TKDT4DI32_Vec = array [0 .. KDT4DI32_Axis - 1] of TKDT4DI32_VecType;
PKDT4DI32_Vec = ^TKDT4DI32_Vec;
TKDT4DI32_DynamicVecBuffer = array of TKDT4DI32_Vec;
PKDT4DI32_DynamicVecBuffer = ^TKDT4DI32_DynamicVecBuffer;
TKDT4DI32_Source = record
buff: TKDT4DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT4DI32_Source = ^TKDT4DI32_Source;
TKDT4DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT4DI32_Source) - 1] of PKDT4DI32_Source;
PKDT4DI32_SourceBuffer = ^TKDT4DI32_SourceBuffer;
TKDT4DI32_DyanmicSourceBuffer = array of PKDT4DI32_Source;
PKDT4DI32_DyanmicSourceBuffer = ^TKDT4DI32_DyanmicSourceBuffer;
TKDT4DI32_DyanmicStoreBuffer = array of TKDT4DI32_Source;
PKDT4DI32_DyanmicStoreBuffer = ^TKDT4DI32_DyanmicStoreBuffer;
PKDT4DI32_Node = ^TKDT4DI32_Node;
TKDT4DI32_Node = record
Parent, Right, Left: PKDT4DI32_Node;
Vec: PKDT4DI32_Source;
end;
TKDT4DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer);
TKDT4DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT4DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT4DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT4DI32_DyanmicStoreBuffer;
KDBuff: TKDT4DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT4DI32_Node;
TestBuff: TKDT4DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT4DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT4DI32_Node;
function GetData(const Index: NativeInt): PKDT4DI32_Source;
public
RootNode: PKDT4DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT4DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT4DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT4DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT4DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT4DI32_Node; overload;
function Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT4DI32_Node; overload;
function Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double): PKDT4DI32_Node; overload;
function Search(const buff: TKDT4DI32_Vec): PKDT4DI32_Node; overload;
function SearchToken(const buff: TKDT4DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT4DI32_DynamicVecBuffer; var OutBuff: TKDT4DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT4DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT4DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT4DI32_Vec; overload;
class function Vec(const v: TKDT4DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT4DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT5DI32 = class(TCoreClassObject)
public type
// code split
TKDT5DI32_Vec = array [0 .. KDT5DI32_Axis - 1] of TKDT5DI32_VecType;
PKDT5DI32_Vec = ^TKDT5DI32_Vec;
TKDT5DI32_DynamicVecBuffer = array of TKDT5DI32_Vec;
PKDT5DI32_DynamicVecBuffer = ^TKDT5DI32_DynamicVecBuffer;
TKDT5DI32_Source = record
buff: TKDT5DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT5DI32_Source = ^TKDT5DI32_Source;
TKDT5DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT5DI32_Source) - 1] of PKDT5DI32_Source;
PKDT5DI32_SourceBuffer = ^TKDT5DI32_SourceBuffer;
TKDT5DI32_DyanmicSourceBuffer = array of PKDT5DI32_Source;
PKDT5DI32_DyanmicSourceBuffer = ^TKDT5DI32_DyanmicSourceBuffer;
TKDT5DI32_DyanmicStoreBuffer = array of TKDT5DI32_Source;
PKDT5DI32_DyanmicStoreBuffer = ^TKDT5DI32_DyanmicStoreBuffer;
PKDT5DI32_Node = ^TKDT5DI32_Node;
TKDT5DI32_Node = record
Parent, Right, Left: PKDT5DI32_Node;
Vec: PKDT5DI32_Source;
end;
TKDT5DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer);
TKDT5DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT5DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT5DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT5DI32_DyanmicStoreBuffer;
KDBuff: TKDT5DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT5DI32_Node;
TestBuff: TKDT5DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT5DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT5DI32_Node;
function GetData(const Index: NativeInt): PKDT5DI32_Source;
public
RootNode: PKDT5DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT5DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT5DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT5DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT5DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT5DI32_Node; overload;
function Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT5DI32_Node; overload;
function Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double): PKDT5DI32_Node; overload;
function Search(const buff: TKDT5DI32_Vec): PKDT5DI32_Node; overload;
function SearchToken(const buff: TKDT5DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT5DI32_DynamicVecBuffer; var OutBuff: TKDT5DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT5DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT5DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT5DI32_Vec; overload;
class function Vec(const v: TKDT5DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT5DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT6DI32 = class(TCoreClassObject)
public type
// code split
TKDT6DI32_Vec = array [0 .. KDT6DI32_Axis - 1] of TKDT6DI32_VecType;
PKDT6DI32_Vec = ^TKDT6DI32_Vec;
TKDT6DI32_DynamicVecBuffer = array of TKDT6DI32_Vec;
PKDT6DI32_DynamicVecBuffer = ^TKDT6DI32_DynamicVecBuffer;
TKDT6DI32_Source = record
buff: TKDT6DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT6DI32_Source = ^TKDT6DI32_Source;
TKDT6DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT6DI32_Source) - 1] of PKDT6DI32_Source;
PKDT6DI32_SourceBuffer = ^TKDT6DI32_SourceBuffer;
TKDT6DI32_DyanmicSourceBuffer = array of PKDT6DI32_Source;
PKDT6DI32_DyanmicSourceBuffer = ^TKDT6DI32_DyanmicSourceBuffer;
TKDT6DI32_DyanmicStoreBuffer = array of TKDT6DI32_Source;
PKDT6DI32_DyanmicStoreBuffer = ^TKDT6DI32_DyanmicStoreBuffer;
PKDT6DI32_Node = ^TKDT6DI32_Node;
TKDT6DI32_Node = record
Parent, Right, Left: PKDT6DI32_Node;
Vec: PKDT6DI32_Source;
end;
TKDT6DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer);
TKDT6DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT6DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT6DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT6DI32_DyanmicStoreBuffer;
KDBuff: TKDT6DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT6DI32_Node;
TestBuff: TKDT6DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT6DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT6DI32_Node;
function GetData(const Index: NativeInt): PKDT6DI32_Source;
public
RootNode: PKDT6DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT6DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT6DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT6DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT6DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT6DI32_Node; overload;
function Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT6DI32_Node; overload;
function Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double): PKDT6DI32_Node; overload;
function Search(const buff: TKDT6DI32_Vec): PKDT6DI32_Node; overload;
function SearchToken(const buff: TKDT6DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT6DI32_DynamicVecBuffer; var OutBuff: TKDT6DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT6DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT6DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT6DI32_Vec; overload;
class function Vec(const v: TKDT6DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT6DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT7DI32 = class(TCoreClassObject)
public type
// code split
TKDT7DI32_Vec = array [0 .. KDT7DI32_Axis - 1] of TKDT7DI32_VecType;
PKDT7DI32_Vec = ^TKDT7DI32_Vec;
TKDT7DI32_DynamicVecBuffer = array of TKDT7DI32_Vec;
PKDT7DI32_DynamicVecBuffer = ^TKDT7DI32_DynamicVecBuffer;
TKDT7DI32_Source = record
buff: TKDT7DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT7DI32_Source = ^TKDT7DI32_Source;
TKDT7DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT7DI32_Source) - 1] of PKDT7DI32_Source;
PKDT7DI32_SourceBuffer = ^TKDT7DI32_SourceBuffer;
TKDT7DI32_DyanmicSourceBuffer = array of PKDT7DI32_Source;
PKDT7DI32_DyanmicSourceBuffer = ^TKDT7DI32_DyanmicSourceBuffer;
TKDT7DI32_DyanmicStoreBuffer = array of TKDT7DI32_Source;
PKDT7DI32_DyanmicStoreBuffer = ^TKDT7DI32_DyanmicStoreBuffer;
PKDT7DI32_Node = ^TKDT7DI32_Node;
TKDT7DI32_Node = record
Parent, Right, Left: PKDT7DI32_Node;
Vec: PKDT7DI32_Source;
end;
TKDT7DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer);
TKDT7DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT7DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT7DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT7DI32_DyanmicStoreBuffer;
KDBuff: TKDT7DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT7DI32_Node;
TestBuff: TKDT7DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT7DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT7DI32_Node;
function GetData(const Index: NativeInt): PKDT7DI32_Source;
public
RootNode: PKDT7DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT7DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT7DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT7DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT7DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT7DI32_Node; overload;
function Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT7DI32_Node; overload;
function Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double): PKDT7DI32_Node; overload;
function Search(const buff: TKDT7DI32_Vec): PKDT7DI32_Node; overload;
function SearchToken(const buff: TKDT7DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT7DI32_DynamicVecBuffer; var OutBuff: TKDT7DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT7DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT7DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT7DI32_Vec; overload;
class function Vec(const v: TKDT7DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT7DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT8DI32 = class(TCoreClassObject)
public type
// code split
TKDT8DI32_Vec = array [0 .. KDT8DI32_Axis - 1] of TKDT8DI32_VecType;
PKDT8DI32_Vec = ^TKDT8DI32_Vec;
TKDT8DI32_DynamicVecBuffer = array of TKDT8DI32_Vec;
PKDT8DI32_DynamicVecBuffer = ^TKDT8DI32_DynamicVecBuffer;
TKDT8DI32_Source = record
buff: TKDT8DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT8DI32_Source = ^TKDT8DI32_Source;
TKDT8DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT8DI32_Source) - 1] of PKDT8DI32_Source;
PKDT8DI32_SourceBuffer = ^TKDT8DI32_SourceBuffer;
TKDT8DI32_DyanmicSourceBuffer = array of PKDT8DI32_Source;
PKDT8DI32_DyanmicSourceBuffer = ^TKDT8DI32_DyanmicSourceBuffer;
TKDT8DI32_DyanmicStoreBuffer = array of TKDT8DI32_Source;
PKDT8DI32_DyanmicStoreBuffer = ^TKDT8DI32_DyanmicStoreBuffer;
PKDT8DI32_Node = ^TKDT8DI32_Node;
TKDT8DI32_Node = record
Parent, Right, Left: PKDT8DI32_Node;
Vec: PKDT8DI32_Source;
end;
TKDT8DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer);
TKDT8DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT8DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT8DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT8DI32_DyanmicStoreBuffer;
KDBuff: TKDT8DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT8DI32_Node;
TestBuff: TKDT8DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT8DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT8DI32_Node;
function GetData(const Index: NativeInt): PKDT8DI32_Source;
public
RootNode: PKDT8DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT8DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT8DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT8DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT8DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT8DI32_Node; overload;
function Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT8DI32_Node; overload;
function Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double): PKDT8DI32_Node; overload;
function Search(const buff: TKDT8DI32_Vec): PKDT8DI32_Node; overload;
function SearchToken(const buff: TKDT8DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT8DI32_DynamicVecBuffer; var OutBuff: TKDT8DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT8DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT8DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT8DI32_Vec; overload;
class function Vec(const v: TKDT8DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT8DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT9DI32 = class(TCoreClassObject)
public type
// code split
TKDT9DI32_Vec = array [0 .. KDT9DI32_Axis - 1] of TKDT9DI32_VecType;
PKDT9DI32_Vec = ^TKDT9DI32_Vec;
TKDT9DI32_DynamicVecBuffer = array of TKDT9DI32_Vec;
PKDT9DI32_DynamicVecBuffer = ^TKDT9DI32_DynamicVecBuffer;
TKDT9DI32_Source = record
buff: TKDT9DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT9DI32_Source = ^TKDT9DI32_Source;
TKDT9DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT9DI32_Source) - 1] of PKDT9DI32_Source;
PKDT9DI32_SourceBuffer = ^TKDT9DI32_SourceBuffer;
TKDT9DI32_DyanmicSourceBuffer = array of PKDT9DI32_Source;
PKDT9DI32_DyanmicSourceBuffer = ^TKDT9DI32_DyanmicSourceBuffer;
TKDT9DI32_DyanmicStoreBuffer = array of TKDT9DI32_Source;
PKDT9DI32_DyanmicStoreBuffer = ^TKDT9DI32_DyanmicStoreBuffer;
PKDT9DI32_Node = ^TKDT9DI32_Node;
TKDT9DI32_Node = record
Parent, Right, Left: PKDT9DI32_Node;
Vec: PKDT9DI32_Source;
end;
TKDT9DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer);
TKDT9DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT9DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT9DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT9DI32_DyanmicStoreBuffer;
KDBuff: TKDT9DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT9DI32_Node;
TestBuff: TKDT9DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT9DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT9DI32_Node;
function GetData(const Index: NativeInt): PKDT9DI32_Source;
public
RootNode: PKDT9DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT9DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT9DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT9DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT9DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT9DI32_Node; overload;
function Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT9DI32_Node; overload;
function Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double): PKDT9DI32_Node; overload;
function Search(const buff: TKDT9DI32_Vec): PKDT9DI32_Node; overload;
function SearchToken(const buff: TKDT9DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT9DI32_DynamicVecBuffer; var OutBuff: TKDT9DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT9DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT9DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT9DI32_Vec; overload;
class function Vec(const v: TKDT9DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT9DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT10DI32 = class(TCoreClassObject)
public type
// code split
TKDT10DI32_Vec = array [0 .. KDT10DI32_Axis - 1] of TKDT10DI32_VecType;
PKDT10DI32_Vec = ^TKDT10DI32_Vec;
TKDT10DI32_DynamicVecBuffer = array of TKDT10DI32_Vec;
PKDT10DI32_DynamicVecBuffer = ^TKDT10DI32_DynamicVecBuffer;
TKDT10DI32_Source = record
buff: TKDT10DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT10DI32_Source = ^TKDT10DI32_Source;
TKDT10DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT10DI32_Source) - 1] of PKDT10DI32_Source;
PKDT10DI32_SourceBuffer = ^TKDT10DI32_SourceBuffer;
TKDT10DI32_DyanmicSourceBuffer = array of PKDT10DI32_Source;
PKDT10DI32_DyanmicSourceBuffer = ^TKDT10DI32_DyanmicSourceBuffer;
TKDT10DI32_DyanmicStoreBuffer = array of TKDT10DI32_Source;
PKDT10DI32_DyanmicStoreBuffer = ^TKDT10DI32_DyanmicStoreBuffer;
PKDT10DI32_Node = ^TKDT10DI32_Node;
TKDT10DI32_Node = record
Parent, Right, Left: PKDT10DI32_Node;
Vec: PKDT10DI32_Source;
end;
TKDT10DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer);
TKDT10DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT10DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT10DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT10DI32_DyanmicStoreBuffer;
KDBuff: TKDT10DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT10DI32_Node;
TestBuff: TKDT10DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT10DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT10DI32_Node;
function GetData(const Index: NativeInt): PKDT10DI32_Source;
public
RootNode: PKDT10DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT10DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT10DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT10DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT10DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT10DI32_Node; overload;
function Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT10DI32_Node; overload;
function Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double): PKDT10DI32_Node; overload;
function Search(const buff: TKDT10DI32_Vec): PKDT10DI32_Node; overload;
function SearchToken(const buff: TKDT10DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT10DI32_DynamicVecBuffer; var OutBuff: TKDT10DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT10DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT10DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT10DI32_Vec; overload;
class function Vec(const v: TKDT10DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT10DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT11DI32 = class(TCoreClassObject)
public type
// code split
TKDT11DI32_Vec = array [0 .. KDT11DI32_Axis - 1] of TKDT11DI32_VecType;
PKDT11DI32_Vec = ^TKDT11DI32_Vec;
TKDT11DI32_DynamicVecBuffer = array of TKDT11DI32_Vec;
PKDT11DI32_DynamicVecBuffer = ^TKDT11DI32_DynamicVecBuffer;
TKDT11DI32_Source = record
buff: TKDT11DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT11DI32_Source = ^TKDT11DI32_Source;
TKDT11DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT11DI32_Source) - 1] of PKDT11DI32_Source;
PKDT11DI32_SourceBuffer = ^TKDT11DI32_SourceBuffer;
TKDT11DI32_DyanmicSourceBuffer = array of PKDT11DI32_Source;
PKDT11DI32_DyanmicSourceBuffer = ^TKDT11DI32_DyanmicSourceBuffer;
TKDT11DI32_DyanmicStoreBuffer = array of TKDT11DI32_Source;
PKDT11DI32_DyanmicStoreBuffer = ^TKDT11DI32_DyanmicStoreBuffer;
PKDT11DI32_Node = ^TKDT11DI32_Node;
TKDT11DI32_Node = record
Parent, Right, Left: PKDT11DI32_Node;
Vec: PKDT11DI32_Source;
end;
TKDT11DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer);
TKDT11DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT11DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT11DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT11DI32_DyanmicStoreBuffer;
KDBuff: TKDT11DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT11DI32_Node;
TestBuff: TKDT11DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT11DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT11DI32_Node;
function GetData(const Index: NativeInt): PKDT11DI32_Source;
public
RootNode: PKDT11DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT11DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT11DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT11DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT11DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT11DI32_Node; overload;
function Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT11DI32_Node; overload;
function Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double): PKDT11DI32_Node; overload;
function Search(const buff: TKDT11DI32_Vec): PKDT11DI32_Node; overload;
function SearchToken(const buff: TKDT11DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT11DI32_DynamicVecBuffer; var OutBuff: TKDT11DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT11DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT11DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT11DI32_Vec; overload;
class function Vec(const v: TKDT11DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT11DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT12DI32 = class(TCoreClassObject)
public type
// code split
TKDT12DI32_Vec = array [0 .. KDT12DI32_Axis - 1] of TKDT12DI32_VecType;
PKDT12DI32_Vec = ^TKDT12DI32_Vec;
TKDT12DI32_DynamicVecBuffer = array of TKDT12DI32_Vec;
PKDT12DI32_DynamicVecBuffer = ^TKDT12DI32_DynamicVecBuffer;
TKDT12DI32_Source = record
buff: TKDT12DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT12DI32_Source = ^TKDT12DI32_Source;
TKDT12DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT12DI32_Source) - 1] of PKDT12DI32_Source;
PKDT12DI32_SourceBuffer = ^TKDT12DI32_SourceBuffer;
TKDT12DI32_DyanmicSourceBuffer = array of PKDT12DI32_Source;
PKDT12DI32_DyanmicSourceBuffer = ^TKDT12DI32_DyanmicSourceBuffer;
TKDT12DI32_DyanmicStoreBuffer = array of TKDT12DI32_Source;
PKDT12DI32_DyanmicStoreBuffer = ^TKDT12DI32_DyanmicStoreBuffer;
PKDT12DI32_Node = ^TKDT12DI32_Node;
TKDT12DI32_Node = record
Parent, Right, Left: PKDT12DI32_Node;
Vec: PKDT12DI32_Source;
end;
TKDT12DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer);
TKDT12DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT12DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT12DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT12DI32_DyanmicStoreBuffer;
KDBuff: TKDT12DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT12DI32_Node;
TestBuff: TKDT12DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT12DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT12DI32_Node;
function GetData(const Index: NativeInt): PKDT12DI32_Source;
public
RootNode: PKDT12DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT12DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT12DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT12DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT12DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT12DI32_Node; overload;
function Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT12DI32_Node; overload;
function Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double): PKDT12DI32_Node; overload;
function Search(const buff: TKDT12DI32_Vec): PKDT12DI32_Node; overload;
function SearchToken(const buff: TKDT12DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT12DI32_DynamicVecBuffer; var OutBuff: TKDT12DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT12DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT12DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT12DI32_Vec; overload;
class function Vec(const v: TKDT12DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT12DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT13DI32 = class(TCoreClassObject)
public type
// code split
TKDT13DI32_Vec = array [0 .. KDT13DI32_Axis - 1] of TKDT13DI32_VecType;
PKDT13DI32_Vec = ^TKDT13DI32_Vec;
TKDT13DI32_DynamicVecBuffer = array of TKDT13DI32_Vec;
PKDT13DI32_DynamicVecBuffer = ^TKDT13DI32_DynamicVecBuffer;
TKDT13DI32_Source = record
buff: TKDT13DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT13DI32_Source = ^TKDT13DI32_Source;
TKDT13DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT13DI32_Source) - 1] of PKDT13DI32_Source;
PKDT13DI32_SourceBuffer = ^TKDT13DI32_SourceBuffer;
TKDT13DI32_DyanmicSourceBuffer = array of PKDT13DI32_Source;
PKDT13DI32_DyanmicSourceBuffer = ^TKDT13DI32_DyanmicSourceBuffer;
TKDT13DI32_DyanmicStoreBuffer = array of TKDT13DI32_Source;
PKDT13DI32_DyanmicStoreBuffer = ^TKDT13DI32_DyanmicStoreBuffer;
PKDT13DI32_Node = ^TKDT13DI32_Node;
TKDT13DI32_Node = record
Parent, Right, Left: PKDT13DI32_Node;
Vec: PKDT13DI32_Source;
end;
TKDT13DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer);
TKDT13DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT13DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT13DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT13DI32_DyanmicStoreBuffer;
KDBuff: TKDT13DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT13DI32_Node;
TestBuff: TKDT13DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT13DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT13DI32_Node;
function GetData(const Index: NativeInt): PKDT13DI32_Source;
public
RootNode: PKDT13DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT13DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT13DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT13DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT13DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT13DI32_Node; overload;
function Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT13DI32_Node; overload;
function Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double): PKDT13DI32_Node; overload;
function Search(const buff: TKDT13DI32_Vec): PKDT13DI32_Node; overload;
function SearchToken(const buff: TKDT13DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT13DI32_DynamicVecBuffer; var OutBuff: TKDT13DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT13DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT13DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT13DI32_Vec; overload;
class function Vec(const v: TKDT13DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT13DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT14DI32 = class(TCoreClassObject)
public type
// code split
TKDT14DI32_Vec = array [0 .. KDT14DI32_Axis - 1] of TKDT14DI32_VecType;
PKDT14DI32_Vec = ^TKDT14DI32_Vec;
TKDT14DI32_DynamicVecBuffer = array of TKDT14DI32_Vec;
PKDT14DI32_DynamicVecBuffer = ^TKDT14DI32_DynamicVecBuffer;
TKDT14DI32_Source = record
buff: TKDT14DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT14DI32_Source = ^TKDT14DI32_Source;
TKDT14DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT14DI32_Source) - 1] of PKDT14DI32_Source;
PKDT14DI32_SourceBuffer = ^TKDT14DI32_SourceBuffer;
TKDT14DI32_DyanmicSourceBuffer = array of PKDT14DI32_Source;
PKDT14DI32_DyanmicSourceBuffer = ^TKDT14DI32_DyanmicSourceBuffer;
TKDT14DI32_DyanmicStoreBuffer = array of TKDT14DI32_Source;
PKDT14DI32_DyanmicStoreBuffer = ^TKDT14DI32_DyanmicStoreBuffer;
PKDT14DI32_Node = ^TKDT14DI32_Node;
TKDT14DI32_Node = record
Parent, Right, Left: PKDT14DI32_Node;
Vec: PKDT14DI32_Source;
end;
TKDT14DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer);
TKDT14DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT14DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT14DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT14DI32_DyanmicStoreBuffer;
KDBuff: TKDT14DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT14DI32_Node;
TestBuff: TKDT14DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT14DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT14DI32_Node;
function GetData(const Index: NativeInt): PKDT14DI32_Source;
public
RootNode: PKDT14DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT14DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT14DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT14DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT14DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT14DI32_Node; overload;
function Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT14DI32_Node; overload;
function Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double): PKDT14DI32_Node; overload;
function Search(const buff: TKDT14DI32_Vec): PKDT14DI32_Node; overload;
function SearchToken(const buff: TKDT14DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT14DI32_DynamicVecBuffer; var OutBuff: TKDT14DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT14DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT14DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT14DI32_Vec; overload;
class function Vec(const v: TKDT14DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT14DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT15DI32 = class(TCoreClassObject)
public type
// code split
TKDT15DI32_Vec = array [0 .. KDT15DI32_Axis - 1] of TKDT15DI32_VecType;
PKDT15DI32_Vec = ^TKDT15DI32_Vec;
TKDT15DI32_DynamicVecBuffer = array of TKDT15DI32_Vec;
PKDT15DI32_DynamicVecBuffer = ^TKDT15DI32_DynamicVecBuffer;
TKDT15DI32_Source = record
buff: TKDT15DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT15DI32_Source = ^TKDT15DI32_Source;
TKDT15DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT15DI32_Source) - 1] of PKDT15DI32_Source;
PKDT15DI32_SourceBuffer = ^TKDT15DI32_SourceBuffer;
TKDT15DI32_DyanmicSourceBuffer = array of PKDT15DI32_Source;
PKDT15DI32_DyanmicSourceBuffer = ^TKDT15DI32_DyanmicSourceBuffer;
TKDT15DI32_DyanmicStoreBuffer = array of TKDT15DI32_Source;
PKDT15DI32_DyanmicStoreBuffer = ^TKDT15DI32_DyanmicStoreBuffer;
PKDT15DI32_Node = ^TKDT15DI32_Node;
TKDT15DI32_Node = record
Parent, Right, Left: PKDT15DI32_Node;
Vec: PKDT15DI32_Source;
end;
TKDT15DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer);
TKDT15DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT15DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT15DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT15DI32_DyanmicStoreBuffer;
KDBuff: TKDT15DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT15DI32_Node;
TestBuff: TKDT15DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT15DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT15DI32_Node;
function GetData(const Index: NativeInt): PKDT15DI32_Source;
public
RootNode: PKDT15DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT15DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT15DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT15DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT15DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT15DI32_Node; overload;
function Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT15DI32_Node; overload;
function Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double): PKDT15DI32_Node; overload;
function Search(const buff: TKDT15DI32_Vec): PKDT15DI32_Node; overload;
function SearchToken(const buff: TKDT15DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT15DI32_DynamicVecBuffer; var OutBuff: TKDT15DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT15DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT15DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT15DI32_Vec; overload;
class function Vec(const v: TKDT15DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT15DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT16DI32 = class(TCoreClassObject)
public type
// code split
TKDT16DI32_Vec = array [0 .. KDT16DI32_Axis - 1] of TKDT16DI32_VecType;
PKDT16DI32_Vec = ^TKDT16DI32_Vec;
TKDT16DI32_DynamicVecBuffer = array of TKDT16DI32_Vec;
PKDT16DI32_DynamicVecBuffer = ^TKDT16DI32_DynamicVecBuffer;
TKDT16DI32_Source = record
buff: TKDT16DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT16DI32_Source = ^TKDT16DI32_Source;
TKDT16DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT16DI32_Source) - 1] of PKDT16DI32_Source;
PKDT16DI32_SourceBuffer = ^TKDT16DI32_SourceBuffer;
TKDT16DI32_DyanmicSourceBuffer = array of PKDT16DI32_Source;
PKDT16DI32_DyanmicSourceBuffer = ^TKDT16DI32_DyanmicSourceBuffer;
TKDT16DI32_DyanmicStoreBuffer = array of TKDT16DI32_Source;
PKDT16DI32_DyanmicStoreBuffer = ^TKDT16DI32_DyanmicStoreBuffer;
PKDT16DI32_Node = ^TKDT16DI32_Node;
TKDT16DI32_Node = record
Parent, Right, Left: PKDT16DI32_Node;
Vec: PKDT16DI32_Source;
end;
TKDT16DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer);
TKDT16DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT16DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT16DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT16DI32_DyanmicStoreBuffer;
KDBuff: TKDT16DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT16DI32_Node;
TestBuff: TKDT16DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT16DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT16DI32_Node;
function GetData(const Index: NativeInt): PKDT16DI32_Source;
public
RootNode: PKDT16DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT16DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT16DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT16DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT16DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT16DI32_Node; overload;
function Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT16DI32_Node; overload;
function Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double): PKDT16DI32_Node; overload;
function Search(const buff: TKDT16DI32_Vec): PKDT16DI32_Node; overload;
function SearchToken(const buff: TKDT16DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT16DI32_DynamicVecBuffer; var OutBuff: TKDT16DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT16DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT16DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT16DI32_Vec; overload;
class function Vec(const v: TKDT16DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT16DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT17DI32 = class(TCoreClassObject)
public type
// code split
TKDT17DI32_Vec = array [0 .. KDT17DI32_Axis - 1] of TKDT17DI32_VecType;
PKDT17DI32_Vec = ^TKDT17DI32_Vec;
TKDT17DI32_DynamicVecBuffer = array of TKDT17DI32_Vec;
PKDT17DI32_DynamicVecBuffer = ^TKDT17DI32_DynamicVecBuffer;
TKDT17DI32_Source = record
buff: TKDT17DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT17DI32_Source = ^TKDT17DI32_Source;
TKDT17DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT17DI32_Source) - 1] of PKDT17DI32_Source;
PKDT17DI32_SourceBuffer = ^TKDT17DI32_SourceBuffer;
TKDT17DI32_DyanmicSourceBuffer = array of PKDT17DI32_Source;
PKDT17DI32_DyanmicSourceBuffer = ^TKDT17DI32_DyanmicSourceBuffer;
TKDT17DI32_DyanmicStoreBuffer = array of TKDT17DI32_Source;
PKDT17DI32_DyanmicStoreBuffer = ^TKDT17DI32_DyanmicStoreBuffer;
PKDT17DI32_Node = ^TKDT17DI32_Node;
TKDT17DI32_Node = record
Parent, Right, Left: PKDT17DI32_Node;
Vec: PKDT17DI32_Source;
end;
TKDT17DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer);
TKDT17DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT17DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT17DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT17DI32_DyanmicStoreBuffer;
KDBuff: TKDT17DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT17DI32_Node;
TestBuff: TKDT17DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT17DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT17DI32_Node;
function GetData(const Index: NativeInt): PKDT17DI32_Source;
public
RootNode: PKDT17DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT17DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT17DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT17DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT17DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT17DI32_Node; overload;
function Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT17DI32_Node; overload;
function Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double): PKDT17DI32_Node; overload;
function Search(const buff: TKDT17DI32_Vec): PKDT17DI32_Node; overload;
function SearchToken(const buff: TKDT17DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT17DI32_DynamicVecBuffer; var OutBuff: TKDT17DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT17DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT17DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT17DI32_Vec; overload;
class function Vec(const v: TKDT17DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT17DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT18DI32 = class(TCoreClassObject)
public type
// code split
TKDT18DI32_Vec = array [0 .. KDT18DI32_Axis - 1] of TKDT18DI32_VecType;
PKDT18DI32_Vec = ^TKDT18DI32_Vec;
TKDT18DI32_DynamicVecBuffer = array of TKDT18DI32_Vec;
PKDT18DI32_DynamicVecBuffer = ^TKDT18DI32_DynamicVecBuffer;
TKDT18DI32_Source = record
buff: TKDT18DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT18DI32_Source = ^TKDT18DI32_Source;
TKDT18DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT18DI32_Source) - 1] of PKDT18DI32_Source;
PKDT18DI32_SourceBuffer = ^TKDT18DI32_SourceBuffer;
TKDT18DI32_DyanmicSourceBuffer = array of PKDT18DI32_Source;
PKDT18DI32_DyanmicSourceBuffer = ^TKDT18DI32_DyanmicSourceBuffer;
TKDT18DI32_DyanmicStoreBuffer = array of TKDT18DI32_Source;
PKDT18DI32_DyanmicStoreBuffer = ^TKDT18DI32_DyanmicStoreBuffer;
PKDT18DI32_Node = ^TKDT18DI32_Node;
TKDT18DI32_Node = record
Parent, Right, Left: PKDT18DI32_Node;
Vec: PKDT18DI32_Source;
end;
TKDT18DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer);
TKDT18DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT18DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT18DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT18DI32_DyanmicStoreBuffer;
KDBuff: TKDT18DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT18DI32_Node;
TestBuff: TKDT18DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT18DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT18DI32_Node;
function GetData(const Index: NativeInt): PKDT18DI32_Source;
public
RootNode: PKDT18DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT18DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT18DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT18DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT18DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT18DI32_Node; overload;
function Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT18DI32_Node; overload;
function Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double): PKDT18DI32_Node; overload;
function Search(const buff: TKDT18DI32_Vec): PKDT18DI32_Node; overload;
function SearchToken(const buff: TKDT18DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT18DI32_DynamicVecBuffer; var OutBuff: TKDT18DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT18DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT18DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT18DI32_Vec; overload;
class function Vec(const v: TKDT18DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT18DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT19DI32 = class(TCoreClassObject)
public type
// code split
TKDT19DI32_Vec = array [0 .. KDT19DI32_Axis - 1] of TKDT19DI32_VecType;
PKDT19DI32_Vec = ^TKDT19DI32_Vec;
TKDT19DI32_DynamicVecBuffer = array of TKDT19DI32_Vec;
PKDT19DI32_DynamicVecBuffer = ^TKDT19DI32_DynamicVecBuffer;
TKDT19DI32_Source = record
buff: TKDT19DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT19DI32_Source = ^TKDT19DI32_Source;
TKDT19DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT19DI32_Source) - 1] of PKDT19DI32_Source;
PKDT19DI32_SourceBuffer = ^TKDT19DI32_SourceBuffer;
TKDT19DI32_DyanmicSourceBuffer = array of PKDT19DI32_Source;
PKDT19DI32_DyanmicSourceBuffer = ^TKDT19DI32_DyanmicSourceBuffer;
TKDT19DI32_DyanmicStoreBuffer = array of TKDT19DI32_Source;
PKDT19DI32_DyanmicStoreBuffer = ^TKDT19DI32_DyanmicStoreBuffer;
PKDT19DI32_Node = ^TKDT19DI32_Node;
TKDT19DI32_Node = record
Parent, Right, Left: PKDT19DI32_Node;
Vec: PKDT19DI32_Source;
end;
TKDT19DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer);
TKDT19DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT19DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT19DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT19DI32_DyanmicStoreBuffer;
KDBuff: TKDT19DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT19DI32_Node;
TestBuff: TKDT19DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT19DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT19DI32_Node;
function GetData(const Index: NativeInt): PKDT19DI32_Source;
public
RootNode: PKDT19DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT19DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT19DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT19DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT19DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT19DI32_Node; overload;
function Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT19DI32_Node; overload;
function Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double): PKDT19DI32_Node; overload;
function Search(const buff: TKDT19DI32_Vec): PKDT19DI32_Node; overload;
function SearchToken(const buff: TKDT19DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT19DI32_DynamicVecBuffer; var OutBuff: TKDT19DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT19DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT19DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT19DI32_Vec; overload;
class function Vec(const v: TKDT19DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT19DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT20DI32 = class(TCoreClassObject)
public type
// code split
TKDT20DI32_Vec = array [0 .. KDT20DI32_Axis - 1] of TKDT20DI32_VecType;
PKDT20DI32_Vec = ^TKDT20DI32_Vec;
TKDT20DI32_DynamicVecBuffer = array of TKDT20DI32_Vec;
PKDT20DI32_DynamicVecBuffer = ^TKDT20DI32_DynamicVecBuffer;
TKDT20DI32_Source = record
buff: TKDT20DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT20DI32_Source = ^TKDT20DI32_Source;
TKDT20DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT20DI32_Source) - 1] of PKDT20DI32_Source;
PKDT20DI32_SourceBuffer = ^TKDT20DI32_SourceBuffer;
TKDT20DI32_DyanmicSourceBuffer = array of PKDT20DI32_Source;
PKDT20DI32_DyanmicSourceBuffer = ^TKDT20DI32_DyanmicSourceBuffer;
TKDT20DI32_DyanmicStoreBuffer = array of TKDT20DI32_Source;
PKDT20DI32_DyanmicStoreBuffer = ^TKDT20DI32_DyanmicStoreBuffer;
PKDT20DI32_Node = ^TKDT20DI32_Node;
TKDT20DI32_Node = record
Parent, Right, Left: PKDT20DI32_Node;
Vec: PKDT20DI32_Source;
end;
TKDT20DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer);
TKDT20DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT20DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT20DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT20DI32_DyanmicStoreBuffer;
KDBuff: TKDT20DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT20DI32_Node;
TestBuff: TKDT20DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT20DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT20DI32_Node;
function GetData(const Index: NativeInt): PKDT20DI32_Source;
public
RootNode: PKDT20DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT20DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT20DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT20DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT20DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT20DI32_Node; overload;
function Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT20DI32_Node; overload;
function Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double): PKDT20DI32_Node; overload;
function Search(const buff: TKDT20DI32_Vec): PKDT20DI32_Node; overload;
function SearchToken(const buff: TKDT20DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT20DI32_DynamicVecBuffer; var OutBuff: TKDT20DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT20DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT20DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT20DI32_Vec; overload;
class function Vec(const v: TKDT20DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT20DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT21DI32 = class(TCoreClassObject)
public type
// code split
TKDT21DI32_Vec = array [0 .. KDT21DI32_Axis - 1] of TKDT21DI32_VecType;
PKDT21DI32_Vec = ^TKDT21DI32_Vec;
TKDT21DI32_DynamicVecBuffer = array of TKDT21DI32_Vec;
PKDT21DI32_DynamicVecBuffer = ^TKDT21DI32_DynamicVecBuffer;
TKDT21DI32_Source = record
buff: TKDT21DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT21DI32_Source = ^TKDT21DI32_Source;
TKDT21DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT21DI32_Source) - 1] of PKDT21DI32_Source;
PKDT21DI32_SourceBuffer = ^TKDT21DI32_SourceBuffer;
TKDT21DI32_DyanmicSourceBuffer = array of PKDT21DI32_Source;
PKDT21DI32_DyanmicSourceBuffer = ^TKDT21DI32_DyanmicSourceBuffer;
TKDT21DI32_DyanmicStoreBuffer = array of TKDT21DI32_Source;
PKDT21DI32_DyanmicStoreBuffer = ^TKDT21DI32_DyanmicStoreBuffer;
PKDT21DI32_Node = ^TKDT21DI32_Node;
TKDT21DI32_Node = record
Parent, Right, Left: PKDT21DI32_Node;
Vec: PKDT21DI32_Source;
end;
TKDT21DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer);
TKDT21DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT21DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT21DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT21DI32_DyanmicStoreBuffer;
KDBuff: TKDT21DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT21DI32_Node;
TestBuff: TKDT21DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT21DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT21DI32_Node;
function GetData(const Index: NativeInt): PKDT21DI32_Source;
public
RootNode: PKDT21DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT21DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT21DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT21DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT21DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT21DI32_Node; overload;
function Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT21DI32_Node; overload;
function Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double): PKDT21DI32_Node; overload;
function Search(const buff: TKDT21DI32_Vec): PKDT21DI32_Node; overload;
function SearchToken(const buff: TKDT21DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT21DI32_DynamicVecBuffer; var OutBuff: TKDT21DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT21DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT21DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT21DI32_Vec; overload;
class function Vec(const v: TKDT21DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT21DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT22DI32 = class(TCoreClassObject)
public type
// code split
TKDT22DI32_Vec = array [0 .. KDT22DI32_Axis - 1] of TKDT22DI32_VecType;
PKDT22DI32_Vec = ^TKDT22DI32_Vec;
TKDT22DI32_DynamicVecBuffer = array of TKDT22DI32_Vec;
PKDT22DI32_DynamicVecBuffer = ^TKDT22DI32_DynamicVecBuffer;
TKDT22DI32_Source = record
buff: TKDT22DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT22DI32_Source = ^TKDT22DI32_Source;
TKDT22DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT22DI32_Source) - 1] of PKDT22DI32_Source;
PKDT22DI32_SourceBuffer = ^TKDT22DI32_SourceBuffer;
TKDT22DI32_DyanmicSourceBuffer = array of PKDT22DI32_Source;
PKDT22DI32_DyanmicSourceBuffer = ^TKDT22DI32_DyanmicSourceBuffer;
TKDT22DI32_DyanmicStoreBuffer = array of TKDT22DI32_Source;
PKDT22DI32_DyanmicStoreBuffer = ^TKDT22DI32_DyanmicStoreBuffer;
PKDT22DI32_Node = ^TKDT22DI32_Node;
TKDT22DI32_Node = record
Parent, Right, Left: PKDT22DI32_Node;
Vec: PKDT22DI32_Source;
end;
TKDT22DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer);
TKDT22DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT22DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT22DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT22DI32_DyanmicStoreBuffer;
KDBuff: TKDT22DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT22DI32_Node;
TestBuff: TKDT22DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT22DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT22DI32_Node;
function GetData(const Index: NativeInt): PKDT22DI32_Source;
public
RootNode: PKDT22DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT22DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT22DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT22DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT22DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT22DI32_Node; overload;
function Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT22DI32_Node; overload;
function Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double): PKDT22DI32_Node; overload;
function Search(const buff: TKDT22DI32_Vec): PKDT22DI32_Node; overload;
function SearchToken(const buff: TKDT22DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT22DI32_DynamicVecBuffer; var OutBuff: TKDT22DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT22DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT22DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT22DI32_Vec; overload;
class function Vec(const v: TKDT22DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT22DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT23DI32 = class(TCoreClassObject)
public type
// code split
TKDT23DI32_Vec = array [0 .. KDT23DI32_Axis - 1] of TKDT23DI32_VecType;
PKDT23DI32_Vec = ^TKDT23DI32_Vec;
TKDT23DI32_DynamicVecBuffer = array of TKDT23DI32_Vec;
PKDT23DI32_DynamicVecBuffer = ^TKDT23DI32_DynamicVecBuffer;
TKDT23DI32_Source = record
buff: TKDT23DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT23DI32_Source = ^TKDT23DI32_Source;
TKDT23DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT23DI32_Source) - 1] of PKDT23DI32_Source;
PKDT23DI32_SourceBuffer = ^TKDT23DI32_SourceBuffer;
TKDT23DI32_DyanmicSourceBuffer = array of PKDT23DI32_Source;
PKDT23DI32_DyanmicSourceBuffer = ^TKDT23DI32_DyanmicSourceBuffer;
TKDT23DI32_DyanmicStoreBuffer = array of TKDT23DI32_Source;
PKDT23DI32_DyanmicStoreBuffer = ^TKDT23DI32_DyanmicStoreBuffer;
PKDT23DI32_Node = ^TKDT23DI32_Node;
TKDT23DI32_Node = record
Parent, Right, Left: PKDT23DI32_Node;
Vec: PKDT23DI32_Source;
end;
TKDT23DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer);
TKDT23DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT23DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT23DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT23DI32_DyanmicStoreBuffer;
KDBuff: TKDT23DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT23DI32_Node;
TestBuff: TKDT23DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT23DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT23DI32_Node;
function GetData(const Index: NativeInt): PKDT23DI32_Source;
public
RootNode: PKDT23DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT23DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT23DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT23DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT23DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT23DI32_Node; overload;
function Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT23DI32_Node; overload;
function Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double): PKDT23DI32_Node; overload;
function Search(const buff: TKDT23DI32_Vec): PKDT23DI32_Node; overload;
function SearchToken(const buff: TKDT23DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT23DI32_DynamicVecBuffer; var OutBuff: TKDT23DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT23DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT23DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT23DI32_Vec; overload;
class function Vec(const v: TKDT23DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT23DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT24DI32 = class(TCoreClassObject)
public type
// code split
TKDT24DI32_Vec = array [0 .. KDT24DI32_Axis - 1] of TKDT24DI32_VecType;
PKDT24DI32_Vec = ^TKDT24DI32_Vec;
TKDT24DI32_DynamicVecBuffer = array of TKDT24DI32_Vec;
PKDT24DI32_DynamicVecBuffer = ^TKDT24DI32_DynamicVecBuffer;
TKDT24DI32_Source = record
buff: TKDT24DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT24DI32_Source = ^TKDT24DI32_Source;
TKDT24DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT24DI32_Source) - 1] of PKDT24DI32_Source;
PKDT24DI32_SourceBuffer = ^TKDT24DI32_SourceBuffer;
TKDT24DI32_DyanmicSourceBuffer = array of PKDT24DI32_Source;
PKDT24DI32_DyanmicSourceBuffer = ^TKDT24DI32_DyanmicSourceBuffer;
TKDT24DI32_DyanmicStoreBuffer = array of TKDT24DI32_Source;
PKDT24DI32_DyanmicStoreBuffer = ^TKDT24DI32_DyanmicStoreBuffer;
PKDT24DI32_Node = ^TKDT24DI32_Node;
TKDT24DI32_Node = record
Parent, Right, Left: PKDT24DI32_Node;
Vec: PKDT24DI32_Source;
end;
TKDT24DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer);
TKDT24DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT24DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT24DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT24DI32_DyanmicStoreBuffer;
KDBuff: TKDT24DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT24DI32_Node;
TestBuff: TKDT24DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT24DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT24DI32_Node;
function GetData(const Index: NativeInt): PKDT24DI32_Source;
public
RootNode: PKDT24DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT24DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT24DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT24DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT24DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT24DI32_Node; overload;
function Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT24DI32_Node; overload;
function Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double): PKDT24DI32_Node; overload;
function Search(const buff: TKDT24DI32_Vec): PKDT24DI32_Node; overload;
function SearchToken(const buff: TKDT24DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT24DI32_DynamicVecBuffer; var OutBuff: TKDT24DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT24DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT24DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT24DI32_Vec; overload;
class function Vec(const v: TKDT24DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT24DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT48DI32 = class(TCoreClassObject)
public type
// code split
TKDT48DI32_Vec = array [0 .. KDT48DI32_Axis - 1] of TKDT48DI32_VecType;
PKDT48DI32_Vec = ^TKDT48DI32_Vec;
TKDT48DI32_DynamicVecBuffer = array of TKDT48DI32_Vec;
PKDT48DI32_DynamicVecBuffer = ^TKDT48DI32_DynamicVecBuffer;
TKDT48DI32_Source = record
buff: TKDT48DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT48DI32_Source = ^TKDT48DI32_Source;
TKDT48DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT48DI32_Source) - 1] of PKDT48DI32_Source;
PKDT48DI32_SourceBuffer = ^TKDT48DI32_SourceBuffer;
TKDT48DI32_DyanmicSourceBuffer = array of PKDT48DI32_Source;
PKDT48DI32_DyanmicSourceBuffer = ^TKDT48DI32_DyanmicSourceBuffer;
TKDT48DI32_DyanmicStoreBuffer = array of TKDT48DI32_Source;
PKDT48DI32_DyanmicStoreBuffer = ^TKDT48DI32_DyanmicStoreBuffer;
PKDT48DI32_Node = ^TKDT48DI32_Node;
TKDT48DI32_Node = record
Parent, Right, Left: PKDT48DI32_Node;
Vec: PKDT48DI32_Source;
end;
TKDT48DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer);
TKDT48DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT48DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT48DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT48DI32_DyanmicStoreBuffer;
KDBuff: TKDT48DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT48DI32_Node;
TestBuff: TKDT48DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT48DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT48DI32_Node;
function GetData(const Index: NativeInt): PKDT48DI32_Source;
public
RootNode: PKDT48DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT48DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT48DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT48DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT48DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT48DI32_Node; overload;
function Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT48DI32_Node; overload;
function Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double): PKDT48DI32_Node; overload;
function Search(const buff: TKDT48DI32_Vec): PKDT48DI32_Node; overload;
function SearchToken(const buff: TKDT48DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT48DI32_DynamicVecBuffer; var OutBuff: TKDT48DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT48DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT48DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT48DI32_Vec; overload;
class function Vec(const v: TKDT48DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT48DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT52DI32 = class(TCoreClassObject)
public type
// code split
TKDT52DI32_Vec = array [0 .. KDT52DI32_Axis - 1] of TKDT52DI32_VecType;
PKDT52DI32_Vec = ^TKDT52DI32_Vec;
TKDT52DI32_DynamicVecBuffer = array of TKDT52DI32_Vec;
PKDT52DI32_DynamicVecBuffer = ^TKDT52DI32_DynamicVecBuffer;
TKDT52DI32_Source = record
buff: TKDT52DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT52DI32_Source = ^TKDT52DI32_Source;
TKDT52DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT52DI32_Source) - 1] of PKDT52DI32_Source;
PKDT52DI32_SourceBuffer = ^TKDT52DI32_SourceBuffer;
TKDT52DI32_DyanmicSourceBuffer = array of PKDT52DI32_Source;
PKDT52DI32_DyanmicSourceBuffer = ^TKDT52DI32_DyanmicSourceBuffer;
TKDT52DI32_DyanmicStoreBuffer = array of TKDT52DI32_Source;
PKDT52DI32_DyanmicStoreBuffer = ^TKDT52DI32_DyanmicStoreBuffer;
PKDT52DI32_Node = ^TKDT52DI32_Node;
TKDT52DI32_Node = record
Parent, Right, Left: PKDT52DI32_Node;
Vec: PKDT52DI32_Source;
end;
TKDT52DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer);
TKDT52DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT52DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT52DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT52DI32_DyanmicStoreBuffer;
KDBuff: TKDT52DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT52DI32_Node;
TestBuff: TKDT52DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT52DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT52DI32_Node;
function GetData(const Index: NativeInt): PKDT52DI32_Source;
public
RootNode: PKDT52DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT52DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT52DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT52DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT52DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT52DI32_Node; overload;
function Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT52DI32_Node; overload;
function Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double): PKDT52DI32_Node; overload;
function Search(const buff: TKDT52DI32_Vec): PKDT52DI32_Node; overload;
function SearchToken(const buff: TKDT52DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT52DI32_DynamicVecBuffer; var OutBuff: TKDT52DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT52DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT52DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT52DI32_Vec; overload;
class function Vec(const v: TKDT52DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT52DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT64DI32 = class(TCoreClassObject)
public type
// code split
TKDT64DI32_Vec = array [0 .. KDT64DI32_Axis - 1] of TKDT64DI32_VecType;
PKDT64DI32_Vec = ^TKDT64DI32_Vec;
TKDT64DI32_DynamicVecBuffer = array of TKDT64DI32_Vec;
PKDT64DI32_DynamicVecBuffer = ^TKDT64DI32_DynamicVecBuffer;
TKDT64DI32_Source = record
buff: TKDT64DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT64DI32_Source = ^TKDT64DI32_Source;
TKDT64DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT64DI32_Source) - 1] of PKDT64DI32_Source;
PKDT64DI32_SourceBuffer = ^TKDT64DI32_SourceBuffer;
TKDT64DI32_DyanmicSourceBuffer = array of PKDT64DI32_Source;
PKDT64DI32_DyanmicSourceBuffer = ^TKDT64DI32_DyanmicSourceBuffer;
TKDT64DI32_DyanmicStoreBuffer = array of TKDT64DI32_Source;
PKDT64DI32_DyanmicStoreBuffer = ^TKDT64DI32_DyanmicStoreBuffer;
PKDT64DI32_Node = ^TKDT64DI32_Node;
TKDT64DI32_Node = record
Parent, Right, Left: PKDT64DI32_Node;
Vec: PKDT64DI32_Source;
end;
TKDT64DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer);
TKDT64DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT64DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT64DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT64DI32_DyanmicStoreBuffer;
KDBuff: TKDT64DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT64DI32_Node;
TestBuff: TKDT64DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT64DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT64DI32_Node;
function GetData(const Index: NativeInt): PKDT64DI32_Source;
public
RootNode: PKDT64DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT64DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT64DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT64DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT64DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT64DI32_Node; overload;
function Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT64DI32_Node; overload;
function Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double): PKDT64DI32_Node; overload;
function Search(const buff: TKDT64DI32_Vec): PKDT64DI32_Node; overload;
function SearchToken(const buff: TKDT64DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT64DI32_DynamicVecBuffer; var OutBuff: TKDT64DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT64DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT64DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT64DI32_Vec; overload;
class function Vec(const v: TKDT64DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT64DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT96DI32 = class(TCoreClassObject)
public type
// code split
TKDT96DI32_Vec = array [0 .. KDT96DI32_Axis - 1] of TKDT96DI32_VecType;
PKDT96DI32_Vec = ^TKDT96DI32_Vec;
TKDT96DI32_DynamicVecBuffer = array of TKDT96DI32_Vec;
PKDT96DI32_DynamicVecBuffer = ^TKDT96DI32_DynamicVecBuffer;
TKDT96DI32_Source = record
buff: TKDT96DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT96DI32_Source = ^TKDT96DI32_Source;
TKDT96DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT96DI32_Source) - 1] of PKDT96DI32_Source;
PKDT96DI32_SourceBuffer = ^TKDT96DI32_SourceBuffer;
TKDT96DI32_DyanmicSourceBuffer = array of PKDT96DI32_Source;
PKDT96DI32_DyanmicSourceBuffer = ^TKDT96DI32_DyanmicSourceBuffer;
TKDT96DI32_DyanmicStoreBuffer = array of TKDT96DI32_Source;
PKDT96DI32_DyanmicStoreBuffer = ^TKDT96DI32_DyanmicStoreBuffer;
PKDT96DI32_Node = ^TKDT96DI32_Node;
TKDT96DI32_Node = record
Parent, Right, Left: PKDT96DI32_Node;
Vec: PKDT96DI32_Source;
end;
TKDT96DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer);
TKDT96DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT96DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT96DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT96DI32_DyanmicStoreBuffer;
KDBuff: TKDT96DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT96DI32_Node;
TestBuff: TKDT96DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT96DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT96DI32_Node;
function GetData(const Index: NativeInt): PKDT96DI32_Source;
public
RootNode: PKDT96DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT96DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT96DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT96DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT96DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT96DI32_Node; overload;
function Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT96DI32_Node; overload;
function Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double): PKDT96DI32_Node; overload;
function Search(const buff: TKDT96DI32_Vec): PKDT96DI32_Node; overload;
function SearchToken(const buff: TKDT96DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT96DI32_DynamicVecBuffer; var OutBuff: TKDT96DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT96DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT96DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT96DI32_Vec; overload;
class function Vec(const v: TKDT96DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT96DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT128DI32 = class(TCoreClassObject)
public type
// code split
TKDT128DI32_Vec = array [0 .. KDT128DI32_Axis - 1] of TKDT128DI32_VecType;
PKDT128DI32_Vec = ^TKDT128DI32_Vec;
TKDT128DI32_DynamicVecBuffer = array of TKDT128DI32_Vec;
PKDT128DI32_DynamicVecBuffer = ^TKDT128DI32_DynamicVecBuffer;
TKDT128DI32_Source = record
buff: TKDT128DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT128DI32_Source = ^TKDT128DI32_Source;
TKDT128DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT128DI32_Source) - 1] of PKDT128DI32_Source;
PKDT128DI32_SourceBuffer = ^TKDT128DI32_SourceBuffer;
TKDT128DI32_DyanmicSourceBuffer = array of PKDT128DI32_Source;
PKDT128DI32_DyanmicSourceBuffer = ^TKDT128DI32_DyanmicSourceBuffer;
TKDT128DI32_DyanmicStoreBuffer = array of TKDT128DI32_Source;
PKDT128DI32_DyanmicStoreBuffer = ^TKDT128DI32_DyanmicStoreBuffer;
PKDT128DI32_Node = ^TKDT128DI32_Node;
TKDT128DI32_Node = record
Parent, Right, Left: PKDT128DI32_Node;
Vec: PKDT128DI32_Source;
end;
TKDT128DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer);
TKDT128DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT128DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT128DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT128DI32_DyanmicStoreBuffer;
KDBuff: TKDT128DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT128DI32_Node;
TestBuff: TKDT128DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT128DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT128DI32_Node;
function GetData(const Index: NativeInt): PKDT128DI32_Source;
public
RootNode: PKDT128DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT128DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT128DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT128DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT128DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT128DI32_Node; overload;
function Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT128DI32_Node; overload;
function Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double): PKDT128DI32_Node; overload;
function Search(const buff: TKDT128DI32_Vec): PKDT128DI32_Node; overload;
function SearchToken(const buff: TKDT128DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT128DI32_DynamicVecBuffer; var OutBuff: TKDT128DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT128DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT128DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT128DI32_Vec; overload;
class function Vec(const v: TKDT128DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT128DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT156DI32 = class(TCoreClassObject)
public type
// code split
TKDT156DI32_Vec = array [0 .. KDT156DI32_Axis - 1] of TKDT156DI32_VecType;
PKDT156DI32_Vec = ^TKDT156DI32_Vec;
TKDT156DI32_DynamicVecBuffer = array of TKDT156DI32_Vec;
PKDT156DI32_DynamicVecBuffer = ^TKDT156DI32_DynamicVecBuffer;
TKDT156DI32_Source = record
buff: TKDT156DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT156DI32_Source = ^TKDT156DI32_Source;
TKDT156DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT156DI32_Source) - 1] of PKDT156DI32_Source;
PKDT156DI32_SourceBuffer = ^TKDT156DI32_SourceBuffer;
TKDT156DI32_DyanmicSourceBuffer = array of PKDT156DI32_Source;
PKDT156DI32_DyanmicSourceBuffer = ^TKDT156DI32_DyanmicSourceBuffer;
TKDT156DI32_DyanmicStoreBuffer = array of TKDT156DI32_Source;
PKDT156DI32_DyanmicStoreBuffer = ^TKDT156DI32_DyanmicStoreBuffer;
PKDT156DI32_Node = ^TKDT156DI32_Node;
TKDT156DI32_Node = record
Parent, Right, Left: PKDT156DI32_Node;
Vec: PKDT156DI32_Source;
end;
TKDT156DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer);
TKDT156DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT156DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT156DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT156DI32_DyanmicStoreBuffer;
KDBuff: TKDT156DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT156DI32_Node;
TestBuff: TKDT156DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT156DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT156DI32_Node;
function GetData(const Index: NativeInt): PKDT156DI32_Source;
public
RootNode: PKDT156DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT156DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT156DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT156DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT156DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT156DI32_Node; overload;
function Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT156DI32_Node; overload;
function Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double): PKDT156DI32_Node; overload;
function Search(const buff: TKDT156DI32_Vec): PKDT156DI32_Node; overload;
function SearchToken(const buff: TKDT156DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT156DI32_DynamicVecBuffer; var OutBuff: TKDT156DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT156DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT156DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT156DI32_Vec; overload;
class function Vec(const v: TKDT156DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT156DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT192DI32 = class(TCoreClassObject)
public type
// code split
TKDT192DI32_Vec = array [0 .. KDT192DI32_Axis - 1] of TKDT192DI32_VecType;
PKDT192DI32_Vec = ^TKDT192DI32_Vec;
TKDT192DI32_DynamicVecBuffer = array of TKDT192DI32_Vec;
PKDT192DI32_DynamicVecBuffer = ^TKDT192DI32_DynamicVecBuffer;
TKDT192DI32_Source = record
buff: TKDT192DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT192DI32_Source = ^TKDT192DI32_Source;
TKDT192DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT192DI32_Source) - 1] of PKDT192DI32_Source;
PKDT192DI32_SourceBuffer = ^TKDT192DI32_SourceBuffer;
TKDT192DI32_DyanmicSourceBuffer = array of PKDT192DI32_Source;
PKDT192DI32_DyanmicSourceBuffer = ^TKDT192DI32_DyanmicSourceBuffer;
TKDT192DI32_DyanmicStoreBuffer = array of TKDT192DI32_Source;
PKDT192DI32_DyanmicStoreBuffer = ^TKDT192DI32_DyanmicStoreBuffer;
PKDT192DI32_Node = ^TKDT192DI32_Node;
TKDT192DI32_Node = record
Parent, Right, Left: PKDT192DI32_Node;
Vec: PKDT192DI32_Source;
end;
TKDT192DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer);
TKDT192DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT192DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT192DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT192DI32_DyanmicStoreBuffer;
KDBuff: TKDT192DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT192DI32_Node;
TestBuff: TKDT192DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT192DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT192DI32_Node;
function GetData(const Index: NativeInt): PKDT192DI32_Source;
public
RootNode: PKDT192DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT192DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT192DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT192DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT192DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT192DI32_Node; overload;
function Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT192DI32_Node; overload;
function Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double): PKDT192DI32_Node; overload;
function Search(const buff: TKDT192DI32_Vec): PKDT192DI32_Node; overload;
function SearchToken(const buff: TKDT192DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT192DI32_DynamicVecBuffer; var OutBuff: TKDT192DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT192DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT192DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT192DI32_Vec; overload;
class function Vec(const v: TKDT192DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT192DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT256DI32 = class(TCoreClassObject)
public type
// code split
TKDT256DI32_Vec = array [0 .. KDT256DI32_Axis - 1] of TKDT256DI32_VecType;
PKDT256DI32_Vec = ^TKDT256DI32_Vec;
TKDT256DI32_DynamicVecBuffer = array of TKDT256DI32_Vec;
PKDT256DI32_DynamicVecBuffer = ^TKDT256DI32_DynamicVecBuffer;
TKDT256DI32_Source = record
buff: TKDT256DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT256DI32_Source = ^TKDT256DI32_Source;
TKDT256DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT256DI32_Source) - 1] of PKDT256DI32_Source;
PKDT256DI32_SourceBuffer = ^TKDT256DI32_SourceBuffer;
TKDT256DI32_DyanmicSourceBuffer = array of PKDT256DI32_Source;
PKDT256DI32_DyanmicSourceBuffer = ^TKDT256DI32_DyanmicSourceBuffer;
TKDT256DI32_DyanmicStoreBuffer = array of TKDT256DI32_Source;
PKDT256DI32_DyanmicStoreBuffer = ^TKDT256DI32_DyanmicStoreBuffer;
PKDT256DI32_Node = ^TKDT256DI32_Node;
TKDT256DI32_Node = record
Parent, Right, Left: PKDT256DI32_Node;
Vec: PKDT256DI32_Source;
end;
TKDT256DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer);
TKDT256DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT256DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT256DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT256DI32_DyanmicStoreBuffer;
KDBuff: TKDT256DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT256DI32_Node;
TestBuff: TKDT256DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT256DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT256DI32_Node;
function GetData(const Index: NativeInt): PKDT256DI32_Source;
public
RootNode: PKDT256DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT256DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT256DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT256DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT256DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT256DI32_Node; overload;
function Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT256DI32_Node; overload;
function Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double): PKDT256DI32_Node; overload;
function Search(const buff: TKDT256DI32_Vec): PKDT256DI32_Node; overload;
function SearchToken(const buff: TKDT256DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT256DI32_DynamicVecBuffer; var OutBuff: TKDT256DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT256DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT256DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT256DI32_Vec; overload;
class function Vec(const v: TKDT256DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT256DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT384DI32 = class(TCoreClassObject)
public type
// code split
TKDT384DI32_Vec = array [0 .. KDT384DI32_Axis - 1] of TKDT384DI32_VecType;
PKDT384DI32_Vec = ^TKDT384DI32_Vec;
TKDT384DI32_DynamicVecBuffer = array of TKDT384DI32_Vec;
PKDT384DI32_DynamicVecBuffer = ^TKDT384DI32_DynamicVecBuffer;
TKDT384DI32_Source = record
buff: TKDT384DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT384DI32_Source = ^TKDT384DI32_Source;
TKDT384DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT384DI32_Source) - 1] of PKDT384DI32_Source;
PKDT384DI32_SourceBuffer = ^TKDT384DI32_SourceBuffer;
TKDT384DI32_DyanmicSourceBuffer = array of PKDT384DI32_Source;
PKDT384DI32_DyanmicSourceBuffer = ^TKDT384DI32_DyanmicSourceBuffer;
TKDT384DI32_DyanmicStoreBuffer = array of TKDT384DI32_Source;
PKDT384DI32_DyanmicStoreBuffer = ^TKDT384DI32_DyanmicStoreBuffer;
PKDT384DI32_Node = ^TKDT384DI32_Node;
TKDT384DI32_Node = record
Parent, Right, Left: PKDT384DI32_Node;
Vec: PKDT384DI32_Source;
end;
TKDT384DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer);
TKDT384DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT384DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT384DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT384DI32_DyanmicStoreBuffer;
KDBuff: TKDT384DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT384DI32_Node;
TestBuff: TKDT384DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT384DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT384DI32_Node;
function GetData(const Index: NativeInt): PKDT384DI32_Source;
public
RootNode: PKDT384DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT384DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT384DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT384DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT384DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT384DI32_Node; overload;
function Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT384DI32_Node; overload;
function Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double): PKDT384DI32_Node; overload;
function Search(const buff: TKDT384DI32_Vec): PKDT384DI32_Node; overload;
function SearchToken(const buff: TKDT384DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT384DI32_DynamicVecBuffer; var OutBuff: TKDT384DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT384DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT384DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT384DI32_Vec; overload;
class function Vec(const v: TKDT384DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT384DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT512DI32 = class(TCoreClassObject)
public type
// code split
TKDT512DI32_Vec = array [0 .. KDT512DI32_Axis - 1] of TKDT512DI32_VecType;
PKDT512DI32_Vec = ^TKDT512DI32_Vec;
TKDT512DI32_DynamicVecBuffer = array of TKDT512DI32_Vec;
PKDT512DI32_DynamicVecBuffer = ^TKDT512DI32_DynamicVecBuffer;
TKDT512DI32_Source = record
buff: TKDT512DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT512DI32_Source = ^TKDT512DI32_Source;
TKDT512DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT512DI32_Source) - 1] of PKDT512DI32_Source;
PKDT512DI32_SourceBuffer = ^TKDT512DI32_SourceBuffer;
TKDT512DI32_DyanmicSourceBuffer = array of PKDT512DI32_Source;
PKDT512DI32_DyanmicSourceBuffer = ^TKDT512DI32_DyanmicSourceBuffer;
TKDT512DI32_DyanmicStoreBuffer = array of TKDT512DI32_Source;
PKDT512DI32_DyanmicStoreBuffer = ^TKDT512DI32_DyanmicStoreBuffer;
PKDT512DI32_Node = ^TKDT512DI32_Node;
TKDT512DI32_Node = record
Parent, Right, Left: PKDT512DI32_Node;
Vec: PKDT512DI32_Source;
end;
TKDT512DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer);
TKDT512DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT512DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT512DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT512DI32_DyanmicStoreBuffer;
KDBuff: TKDT512DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT512DI32_Node;
TestBuff: TKDT512DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT512DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT512DI32_Node;
function GetData(const Index: NativeInt): PKDT512DI32_Source;
public
RootNode: PKDT512DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT512DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT512DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT512DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT512DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT512DI32_Node; overload;
function Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT512DI32_Node; overload;
function Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double): PKDT512DI32_Node; overload;
function Search(const buff: TKDT512DI32_Vec): PKDT512DI32_Node; overload;
function SearchToken(const buff: TKDT512DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT512DI32_DynamicVecBuffer; var OutBuff: TKDT512DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT512DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT512DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT512DI32_Vec; overload;
class function Vec(const v: TKDT512DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT512DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT800DI32 = class(TCoreClassObject)
public type
// code split
TKDT800DI32_Vec = array [0 .. KDT800DI32_Axis - 1] of TKDT800DI32_VecType;
PKDT800DI32_Vec = ^TKDT800DI32_Vec;
TKDT800DI32_DynamicVecBuffer = array of TKDT800DI32_Vec;
PKDT800DI32_DynamicVecBuffer = ^TKDT800DI32_DynamicVecBuffer;
TKDT800DI32_Source = record
buff: TKDT800DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT800DI32_Source = ^TKDT800DI32_Source;
TKDT800DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT800DI32_Source) - 1] of PKDT800DI32_Source;
PKDT800DI32_SourceBuffer = ^TKDT800DI32_SourceBuffer;
TKDT800DI32_DyanmicSourceBuffer = array of PKDT800DI32_Source;
PKDT800DI32_DyanmicSourceBuffer = ^TKDT800DI32_DyanmicSourceBuffer;
TKDT800DI32_DyanmicStoreBuffer = array of TKDT800DI32_Source;
PKDT800DI32_DyanmicStoreBuffer = ^TKDT800DI32_DyanmicStoreBuffer;
PKDT800DI32_Node = ^TKDT800DI32_Node;
TKDT800DI32_Node = record
Parent, Right, Left: PKDT800DI32_Node;
Vec: PKDT800DI32_Source;
end;
TKDT800DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer);
TKDT800DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT800DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT800DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT800DI32_DyanmicStoreBuffer;
KDBuff: TKDT800DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT800DI32_Node;
TestBuff: TKDT800DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT800DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT800DI32_Node;
function GetData(const Index: NativeInt): PKDT800DI32_Source;
public
RootNode: PKDT800DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT800DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT800DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT800DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT800DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT800DI32_Node; overload;
function Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT800DI32_Node; overload;
function Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double): PKDT800DI32_Node; overload;
function Search(const buff: TKDT800DI32_Vec): PKDT800DI32_Node; overload;
function SearchToken(const buff: TKDT800DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT800DI32_DynamicVecBuffer; var OutBuff: TKDT800DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT800DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT800DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT800DI32_Vec; overload;
class function Vec(const v: TKDT800DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT800DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer);
class procedure Test;
end;
TKDT1024DI32 = class(TCoreClassObject)
public type
// code split
TKDT1024DI32_Vec = array [0 .. KDT1024DI32_Axis - 1] of TKDT1024DI32_VecType;
PKDT1024DI32_Vec = ^TKDT1024DI32_Vec;
TKDT1024DI32_DynamicVecBuffer = array of TKDT1024DI32_Vec;
PKDT1024DI32_DynamicVecBuffer = ^TKDT1024DI32_DynamicVecBuffer;
TKDT1024DI32_Source = record
buff: TKDT1024DI32_Vec;
Index: Int64;
Token: TPascalString;
end;
PKDT1024DI32_Source = ^TKDT1024DI32_Source;
TKDT1024DI32_SourceBuffer = array [0 .. MaxInt div SizeOf(PKDT1024DI32_Source) - 1] of PKDT1024DI32_Source;
PKDT1024DI32_SourceBuffer = ^TKDT1024DI32_SourceBuffer;
TKDT1024DI32_DyanmicSourceBuffer = array of PKDT1024DI32_Source;
PKDT1024DI32_DyanmicSourceBuffer = ^TKDT1024DI32_DyanmicSourceBuffer;
TKDT1024DI32_DyanmicStoreBuffer = array of TKDT1024DI32_Source;
PKDT1024DI32_DyanmicStoreBuffer = ^TKDT1024DI32_DyanmicStoreBuffer;
PKDT1024DI32_Node = ^TKDT1024DI32_Node;
TKDT1024DI32_Node = record
Parent, Right, Left: PKDT1024DI32_Node;
Vec: PKDT1024DI32_Source;
end;
TKDT1024DI32_BuildCall = procedure(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer);
TKDT1024DI32_BuildMethod = procedure(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer) of object;
{$IFDEF FPC}
TKDT1024DI32_BuildProc = procedure(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer) is nested;
{$ELSE FPC}
TKDT1024DI32_BuildProc = reference to procedure(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer);
{$ENDIF FPC}
private
KDStoreBuff: TKDT1024DI32_DyanmicStoreBuffer;
KDBuff: TKDT1024DI32_DyanmicSourceBuffer;
NodeCounter: NativeInt;
KDNodes: array of PKDT1024DI32_Node;
TestBuff: TKDT1024DI32_DynamicVecBuffer;
function InternalBuildKdTree(const KDSourceBufferPtr: PKDT1024DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT1024DI32_Node;
function GetData(const Index: NativeInt): PKDT1024DI32_Source;
public
RootNode: PKDT1024DI32_Node;
constructor Create;
destructor Destroy; override;
procedure Clear;
property Count: NativeInt read NodeCounter;
function StoreBuffPtr: PKDT1024DI32_DyanmicStoreBuffer;
property SourceP[const Index: NativeInt]: PKDT1024DI32_Source read GetData; default;
{ bakcall build }
procedure BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildCall);
procedure BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildMethod);
procedure BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildProc);
{ fill k-means++ clusterization }
procedure BuildKDTreeWithCluster(const inBuff: TKDT1024DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray); overload;
procedure BuildKDTreeWithCluster(const inBuff: TKDT1024DI32_DynamicVecBuffer; const k, Restarts: NativeInt); overload;
{ backcall k-means++ clusterization }
procedure BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildCall); overload;
procedure BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildMethod); overload;
procedure BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildProc); overload;
{ search }
function Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT1024DI32_Node; overload;
function Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT1024DI32_Node; overload;
function Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double): PKDT1024DI32_Node; overload;
function Search(const buff: TKDT1024DI32_Vec): PKDT1024DI32_Node; overload;
function SearchToken(const buff: TKDT1024DI32_Vec): TPascalString;
{ parallel search }
procedure Search(const inBuff: TKDT1024DI32_DynamicVecBuffer; var OutBuff: TKDT1024DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure Search(const inBuff: TKDT1024DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray); overload;
procedure SaveToStream(stream: TCoreClassStream);
procedure LoadFromStream(stream: TCoreClassStream);
procedure SaveToFile(FileName: SystemString);
procedure LoadFromFile(FileName: SystemString);
procedure PrintNodeTree(const NodePtr: PKDT1024DI32_Node);
procedure PrintBuffer;
class function Vec(const s: SystemString): TKDT1024DI32_Vec; overload;
class function Vec(const v: TKDT1024DI32_Vec): SystemString; overload;
class function Distance(const v1, v2: TKDT1024DI32_Vec): Double;
// debug time
procedure Test_BuildM(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer);
class procedure Test;
end;
procedure Test_All;
implementation
uses
TextParsing, MemoryStream64, DoStatusIO;
const
SaveToken = $55;
function TKDT1DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT1DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT1DI32_Node;
function SortCompare(const p1, p2: PKDT1DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT1DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT1DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT1DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT1DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT1DI32.GetData(const Index: NativeInt): PKDT1DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT1DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT1DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT1DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT1DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT1DI32.StoreBuffPtr: PKDT1DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT1DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT1DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT1DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT1DI32.BuildKDTreeWithCluster(const inBuff: TKDT1DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT1DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT1DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT1DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT1DI32.BuildKDTreeWithCluster(const inBuff: TKDT1DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT1DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildCall);
var
TempStoreBuff: TKDT1DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT1DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildMethod);
var
TempStoreBuff: TKDT1DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT1DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1DI32_BuildProc);
var
TempStoreBuff: TKDT1DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT1DI32.Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT1DI32_Node;
var
NearestNeighbour: PKDT1DI32_Node;
function FindParentNode(const buffPtr: PKDT1DI32_Vec; NodePtr: PKDT1DI32_Node): PKDT1DI32_Node;
var
Next: PKDT1DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT1DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT1DI32_Node; const buffPtr: PKDT1DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT1DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT1DI32_Vec; const p1, p2: PKDT1DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT1DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT1DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT1DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT1DI32_Node(NearestNodes[0]);
end;
end;
function TKDT1DI32.Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT1DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT1DI32.Search(const buff: TKDT1DI32_Vec; var SearchedDistanceMin: Double): PKDT1DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT1DI32.Search(const buff: TKDT1DI32_Vec): PKDT1DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT1DI32.SearchToken(const buff: TKDT1DI32_Vec): TPascalString;
var
p: PKDT1DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT1DI32.Search(const inBuff: TKDT1DI32_DynamicVecBuffer; var OutBuff: TKDT1DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT1DI32_DynamicVecBuffer;
outBuffPtr: PKDT1DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT1DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT1DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT1DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT1DI32.Search(const inBuff: TKDT1DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT1DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT1DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT1DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT1DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT1DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT1DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT1DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT1DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT1DI32_Vec)) <> SizeOf(TKDT1DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT1DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT1DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT1DI32.PrintNodeTree(const NodePtr: PKDT1DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT1DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT1DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT1DI32.Vec(const s: SystemString): TKDT1DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT1DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT1DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT1DI32.Vec(const v: TKDT1DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT1DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT1DI32.Distance(const v1, v2: TKDT1DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT1DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT1DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT1DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT1DI32.Test;
var
TKDT1DI32_Test: TKDT1DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT1DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT1DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT1DI32_Test := TKDT1DI32.Create;
n.Append('...');
SetLength(TKDT1DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT1DI32_Test.TestBuff) - 1 do
for j := 0 to KDT1DI32_Axis - 1 do
TKDT1DI32_Test.TestBuff[i][j] := i * KDT1DI32_Axis + j;
{$IFDEF FPC}
TKDT1DI32_Test.BuildKDTreeM(length(TKDT1DI32_Test.TestBuff), nil, @TKDT1DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT1DI32_Test.BuildKDTreeM(length(TKDT1DI32_Test.TestBuff), nil, TKDT1DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT1DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT1DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT1DI32_Test.TestBuff) - 1 do
begin
p := TKDT1DI32_Test.Search(TKDT1DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT1DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT1DI32_Test.TestBuff));
TKDT1DI32_Test.Search(TKDT1DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT1DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT1DI32_Test.Clear;
{ kMean test }
TKDT1DI32_Test.BuildKDTreeWithCluster(TKDT1DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT1DI32_Test.Search(TKDT1DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT1DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT1DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT1DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT2DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT2DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT2DI32_Node;
function SortCompare(const p1, p2: PKDT2DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT2DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT2DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT2DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT2DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT2DI32.GetData(const Index: NativeInt): PKDT2DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT2DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT2DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT2DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT2DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT2DI32.StoreBuffPtr: PKDT2DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT2DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT2DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT2DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT2DI32.BuildKDTreeWithCluster(const inBuff: TKDT2DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT2DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT2DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT2DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT2DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT2DI32.BuildKDTreeWithCluster(const inBuff: TKDT2DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT2DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildCall);
var
TempStoreBuff: TKDT2DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT2DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT2DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT2DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT2DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT2DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildMethod);
var
TempStoreBuff: TKDT2DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT2DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT2DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT2DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT2DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT2DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT2DI32_BuildProc);
var
TempStoreBuff: TKDT2DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT2DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT2DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT2DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT2DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT2DI32.Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT2DI32_Node;
var
NearestNeighbour: PKDT2DI32_Node;
function FindParentNode(const buffPtr: PKDT2DI32_Vec; NodePtr: PKDT2DI32_Node): PKDT2DI32_Node;
var
Next: PKDT2DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT2DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT2DI32_Node; const buffPtr: PKDT2DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT2DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT2DI32_Vec; const p1, p2: PKDT2DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT2DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT2DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT2DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT2DI32_Node(NearestNodes[0]);
end;
end;
function TKDT2DI32.Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT2DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT2DI32.Search(const buff: TKDT2DI32_Vec; var SearchedDistanceMin: Double): PKDT2DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT2DI32.Search(const buff: TKDT2DI32_Vec): PKDT2DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT2DI32.SearchToken(const buff: TKDT2DI32_Vec): TPascalString;
var
p: PKDT2DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT2DI32.Search(const inBuff: TKDT2DI32_DynamicVecBuffer; var OutBuff: TKDT2DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT2DI32_DynamicVecBuffer;
outBuffPtr: PKDT2DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT2DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT2DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT2DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT2DI32.Search(const inBuff: TKDT2DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT2DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT2DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT2DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT2DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT2DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT2DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT2DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT2DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT2DI32_Vec)) <> SizeOf(TKDT2DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT2DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT2DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT2DI32.PrintNodeTree(const NodePtr: PKDT2DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT2DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT2DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT2DI32.Vec(const s: SystemString): TKDT2DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT2DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT2DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT2DI32.Vec(const v: TKDT2DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT2DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT2DI32.Distance(const v1, v2: TKDT2DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT2DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT2DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT2DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT2DI32.Test;
var
TKDT2DI32_Test: TKDT2DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT2DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT2DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT2DI32_Test := TKDT2DI32.Create;
n.Append('...');
SetLength(TKDT2DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT2DI32_Test.TestBuff) - 1 do
for j := 0 to KDT2DI32_Axis - 1 do
TKDT2DI32_Test.TestBuff[i][j] := i * KDT2DI32_Axis + j;
{$IFDEF FPC}
TKDT2DI32_Test.BuildKDTreeM(length(TKDT2DI32_Test.TestBuff), nil, @TKDT2DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT2DI32_Test.BuildKDTreeM(length(TKDT2DI32_Test.TestBuff), nil, TKDT2DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT2DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT2DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT2DI32_Test.TestBuff) - 1 do
begin
p := TKDT2DI32_Test.Search(TKDT2DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT2DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT2DI32_Test.TestBuff));
TKDT2DI32_Test.Search(TKDT2DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT2DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT2DI32_Test.Clear;
{ kMean test }
TKDT2DI32_Test.BuildKDTreeWithCluster(TKDT2DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT2DI32_Test.Search(TKDT2DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT2DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT2DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT2DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT3DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT3DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT3DI32_Node;
function SortCompare(const p1, p2: PKDT3DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT3DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT3DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT3DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT3DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT3DI32.GetData(const Index: NativeInt): PKDT3DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT3DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT3DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT3DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT3DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT3DI32.StoreBuffPtr: PKDT3DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT3DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT3DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT3DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT3DI32.BuildKDTreeWithCluster(const inBuff: TKDT3DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT3DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT3DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT3DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT3DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT3DI32.BuildKDTreeWithCluster(const inBuff: TKDT3DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT3DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildCall);
var
TempStoreBuff: TKDT3DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT3DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT3DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT3DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT3DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT3DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildMethod);
var
TempStoreBuff: TKDT3DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT3DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT3DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT3DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT3DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT3DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT3DI32_BuildProc);
var
TempStoreBuff: TKDT3DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT3DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT3DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT3DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT3DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT3DI32.Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT3DI32_Node;
var
NearestNeighbour: PKDT3DI32_Node;
function FindParentNode(const buffPtr: PKDT3DI32_Vec; NodePtr: PKDT3DI32_Node): PKDT3DI32_Node;
var
Next: PKDT3DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT3DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT3DI32_Node; const buffPtr: PKDT3DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT3DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT3DI32_Vec; const p1, p2: PKDT3DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT3DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT3DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT3DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT3DI32_Node(NearestNodes[0]);
end;
end;
function TKDT3DI32.Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT3DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT3DI32.Search(const buff: TKDT3DI32_Vec; var SearchedDistanceMin: Double): PKDT3DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT3DI32.Search(const buff: TKDT3DI32_Vec): PKDT3DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT3DI32.SearchToken(const buff: TKDT3DI32_Vec): TPascalString;
var
p: PKDT3DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT3DI32.Search(const inBuff: TKDT3DI32_DynamicVecBuffer; var OutBuff: TKDT3DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT3DI32_DynamicVecBuffer;
outBuffPtr: PKDT3DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT3DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT3DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT3DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT3DI32.Search(const inBuff: TKDT3DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT3DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT3DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT3DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT3DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT3DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT3DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT3DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT3DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT3DI32_Vec)) <> SizeOf(TKDT3DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT3DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT3DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT3DI32.PrintNodeTree(const NodePtr: PKDT3DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT3DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT3DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT3DI32.Vec(const s: SystemString): TKDT3DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT3DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT3DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT3DI32.Vec(const v: TKDT3DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT3DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT3DI32.Distance(const v1, v2: TKDT3DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT3DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT3DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT3DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT3DI32.Test;
var
TKDT3DI32_Test: TKDT3DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT3DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT3DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT3DI32_Test := TKDT3DI32.Create;
n.Append('...');
SetLength(TKDT3DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT3DI32_Test.TestBuff) - 1 do
for j := 0 to KDT3DI32_Axis - 1 do
TKDT3DI32_Test.TestBuff[i][j] := i * KDT3DI32_Axis + j;
{$IFDEF FPC}
TKDT3DI32_Test.BuildKDTreeM(length(TKDT3DI32_Test.TestBuff), nil, @TKDT3DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT3DI32_Test.BuildKDTreeM(length(TKDT3DI32_Test.TestBuff), nil, TKDT3DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT3DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT3DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT3DI32_Test.TestBuff) - 1 do
begin
p := TKDT3DI32_Test.Search(TKDT3DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT3DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT3DI32_Test.TestBuff));
TKDT3DI32_Test.Search(TKDT3DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT3DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT3DI32_Test.Clear;
{ kMean test }
TKDT3DI32_Test.BuildKDTreeWithCluster(TKDT3DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT3DI32_Test.Search(TKDT3DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT3DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT3DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT3DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT4DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT4DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT4DI32_Node;
function SortCompare(const p1, p2: PKDT4DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT4DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT4DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT4DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT4DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT4DI32.GetData(const Index: NativeInt): PKDT4DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT4DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT4DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT4DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT4DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT4DI32.StoreBuffPtr: PKDT4DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT4DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT4DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT4DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT4DI32.BuildKDTreeWithCluster(const inBuff: TKDT4DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT4DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT4DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT4DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT4DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT4DI32.BuildKDTreeWithCluster(const inBuff: TKDT4DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT4DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildCall);
var
TempStoreBuff: TKDT4DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT4DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT4DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT4DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT4DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT4DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildMethod);
var
TempStoreBuff: TKDT4DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT4DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT4DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT4DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT4DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT4DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT4DI32_BuildProc);
var
TempStoreBuff: TKDT4DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT4DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT4DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT4DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT4DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT4DI32.Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT4DI32_Node;
var
NearestNeighbour: PKDT4DI32_Node;
function FindParentNode(const buffPtr: PKDT4DI32_Vec; NodePtr: PKDT4DI32_Node): PKDT4DI32_Node;
var
Next: PKDT4DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT4DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT4DI32_Node; const buffPtr: PKDT4DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT4DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT4DI32_Vec; const p1, p2: PKDT4DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT4DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT4DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT4DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT4DI32_Node(NearestNodes[0]);
end;
end;
function TKDT4DI32.Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT4DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT4DI32.Search(const buff: TKDT4DI32_Vec; var SearchedDistanceMin: Double): PKDT4DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT4DI32.Search(const buff: TKDT4DI32_Vec): PKDT4DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT4DI32.SearchToken(const buff: TKDT4DI32_Vec): TPascalString;
var
p: PKDT4DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT4DI32.Search(const inBuff: TKDT4DI32_DynamicVecBuffer; var OutBuff: TKDT4DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT4DI32_DynamicVecBuffer;
outBuffPtr: PKDT4DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT4DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT4DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT4DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT4DI32.Search(const inBuff: TKDT4DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT4DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT4DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT4DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT4DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT4DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT4DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT4DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT4DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT4DI32_Vec)) <> SizeOf(TKDT4DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT4DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT4DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT4DI32.PrintNodeTree(const NodePtr: PKDT4DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT4DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT4DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT4DI32.Vec(const s: SystemString): TKDT4DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT4DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT4DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT4DI32.Vec(const v: TKDT4DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT4DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT4DI32.Distance(const v1, v2: TKDT4DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT4DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT4DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT4DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT4DI32.Test;
var
TKDT4DI32_Test: TKDT4DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT4DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT4DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT4DI32_Test := TKDT4DI32.Create;
n.Append('...');
SetLength(TKDT4DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT4DI32_Test.TestBuff) - 1 do
for j := 0 to KDT4DI32_Axis - 1 do
TKDT4DI32_Test.TestBuff[i][j] := i * KDT4DI32_Axis + j;
{$IFDEF FPC}
TKDT4DI32_Test.BuildKDTreeM(length(TKDT4DI32_Test.TestBuff), nil, @TKDT4DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT4DI32_Test.BuildKDTreeM(length(TKDT4DI32_Test.TestBuff), nil, TKDT4DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT4DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT4DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT4DI32_Test.TestBuff) - 1 do
begin
p := TKDT4DI32_Test.Search(TKDT4DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT4DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT4DI32_Test.TestBuff));
TKDT4DI32_Test.Search(TKDT4DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT4DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT4DI32_Test.Clear;
{ kMean test }
TKDT4DI32_Test.BuildKDTreeWithCluster(TKDT4DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT4DI32_Test.Search(TKDT4DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT4DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT4DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT4DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT5DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT5DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT5DI32_Node;
function SortCompare(const p1, p2: PKDT5DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT5DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT5DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT5DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT5DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT5DI32.GetData(const Index: NativeInt): PKDT5DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT5DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT5DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT5DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT5DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT5DI32.StoreBuffPtr: PKDT5DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT5DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT5DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT5DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT5DI32.BuildKDTreeWithCluster(const inBuff: TKDT5DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT5DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT5DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT5DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT5DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT5DI32.BuildKDTreeWithCluster(const inBuff: TKDT5DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT5DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildCall);
var
TempStoreBuff: TKDT5DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT5DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT5DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT5DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT5DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT5DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildMethod);
var
TempStoreBuff: TKDT5DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT5DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT5DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT5DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT5DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT5DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT5DI32_BuildProc);
var
TempStoreBuff: TKDT5DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT5DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT5DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT5DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT5DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT5DI32.Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT5DI32_Node;
var
NearestNeighbour: PKDT5DI32_Node;
function FindParentNode(const buffPtr: PKDT5DI32_Vec; NodePtr: PKDT5DI32_Node): PKDT5DI32_Node;
var
Next: PKDT5DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT5DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT5DI32_Node; const buffPtr: PKDT5DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT5DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT5DI32_Vec; const p1, p2: PKDT5DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT5DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT5DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT5DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT5DI32_Node(NearestNodes[0]);
end;
end;
function TKDT5DI32.Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT5DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT5DI32.Search(const buff: TKDT5DI32_Vec; var SearchedDistanceMin: Double): PKDT5DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT5DI32.Search(const buff: TKDT5DI32_Vec): PKDT5DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT5DI32.SearchToken(const buff: TKDT5DI32_Vec): TPascalString;
var
p: PKDT5DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT5DI32.Search(const inBuff: TKDT5DI32_DynamicVecBuffer; var OutBuff: TKDT5DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT5DI32_DynamicVecBuffer;
outBuffPtr: PKDT5DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT5DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT5DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT5DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT5DI32.Search(const inBuff: TKDT5DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT5DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT5DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT5DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT5DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT5DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT5DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT5DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT5DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT5DI32_Vec)) <> SizeOf(TKDT5DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT5DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT5DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT5DI32.PrintNodeTree(const NodePtr: PKDT5DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT5DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT5DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT5DI32.Vec(const s: SystemString): TKDT5DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT5DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT5DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT5DI32.Vec(const v: TKDT5DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT5DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT5DI32.Distance(const v1, v2: TKDT5DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT5DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT5DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT5DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT5DI32.Test;
var
TKDT5DI32_Test: TKDT5DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT5DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT5DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT5DI32_Test := TKDT5DI32.Create;
n.Append('...');
SetLength(TKDT5DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT5DI32_Test.TestBuff) - 1 do
for j := 0 to KDT5DI32_Axis - 1 do
TKDT5DI32_Test.TestBuff[i][j] := i * KDT5DI32_Axis + j;
{$IFDEF FPC}
TKDT5DI32_Test.BuildKDTreeM(length(TKDT5DI32_Test.TestBuff), nil, @TKDT5DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT5DI32_Test.BuildKDTreeM(length(TKDT5DI32_Test.TestBuff), nil, TKDT5DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT5DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT5DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT5DI32_Test.TestBuff) - 1 do
begin
p := TKDT5DI32_Test.Search(TKDT5DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT5DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT5DI32_Test.TestBuff));
TKDT5DI32_Test.Search(TKDT5DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT5DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT5DI32_Test.Clear;
{ kMean test }
TKDT5DI32_Test.BuildKDTreeWithCluster(TKDT5DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT5DI32_Test.Search(TKDT5DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT5DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT5DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT5DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT6DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT6DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT6DI32_Node;
function SortCompare(const p1, p2: PKDT6DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT6DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT6DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT6DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT6DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT6DI32.GetData(const Index: NativeInt): PKDT6DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT6DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT6DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT6DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT6DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT6DI32.StoreBuffPtr: PKDT6DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT6DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT6DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT6DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT6DI32.BuildKDTreeWithCluster(const inBuff: TKDT6DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT6DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT6DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT6DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT6DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT6DI32.BuildKDTreeWithCluster(const inBuff: TKDT6DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT6DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildCall);
var
TempStoreBuff: TKDT6DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT6DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT6DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT6DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT6DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT6DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildMethod);
var
TempStoreBuff: TKDT6DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT6DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT6DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT6DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT6DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT6DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT6DI32_BuildProc);
var
TempStoreBuff: TKDT6DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT6DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT6DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT6DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT6DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT6DI32.Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT6DI32_Node;
var
NearestNeighbour: PKDT6DI32_Node;
function FindParentNode(const buffPtr: PKDT6DI32_Vec; NodePtr: PKDT6DI32_Node): PKDT6DI32_Node;
var
Next: PKDT6DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT6DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT6DI32_Node; const buffPtr: PKDT6DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT6DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT6DI32_Vec; const p1, p2: PKDT6DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT6DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT6DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT6DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT6DI32_Node(NearestNodes[0]);
end;
end;
function TKDT6DI32.Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT6DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT6DI32.Search(const buff: TKDT6DI32_Vec; var SearchedDistanceMin: Double): PKDT6DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT6DI32.Search(const buff: TKDT6DI32_Vec): PKDT6DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT6DI32.SearchToken(const buff: TKDT6DI32_Vec): TPascalString;
var
p: PKDT6DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT6DI32.Search(const inBuff: TKDT6DI32_DynamicVecBuffer; var OutBuff: TKDT6DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT6DI32_DynamicVecBuffer;
outBuffPtr: PKDT6DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT6DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT6DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT6DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT6DI32.Search(const inBuff: TKDT6DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT6DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT6DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT6DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT6DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT6DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT6DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT6DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT6DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT6DI32_Vec)) <> SizeOf(TKDT6DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT6DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT6DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT6DI32.PrintNodeTree(const NodePtr: PKDT6DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT6DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT6DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT6DI32.Vec(const s: SystemString): TKDT6DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT6DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT6DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT6DI32.Vec(const v: TKDT6DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT6DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT6DI32.Distance(const v1, v2: TKDT6DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT6DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT6DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT6DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT6DI32.Test;
var
TKDT6DI32_Test: TKDT6DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT6DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT6DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT6DI32_Test := TKDT6DI32.Create;
n.Append('...');
SetLength(TKDT6DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT6DI32_Test.TestBuff) - 1 do
for j := 0 to KDT6DI32_Axis - 1 do
TKDT6DI32_Test.TestBuff[i][j] := i * KDT6DI32_Axis + j;
{$IFDEF FPC}
TKDT6DI32_Test.BuildKDTreeM(length(TKDT6DI32_Test.TestBuff), nil, @TKDT6DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT6DI32_Test.BuildKDTreeM(length(TKDT6DI32_Test.TestBuff), nil, TKDT6DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT6DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT6DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT6DI32_Test.TestBuff) - 1 do
begin
p := TKDT6DI32_Test.Search(TKDT6DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT6DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT6DI32_Test.TestBuff));
TKDT6DI32_Test.Search(TKDT6DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT6DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT6DI32_Test.Clear;
{ kMean test }
TKDT6DI32_Test.BuildKDTreeWithCluster(TKDT6DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT6DI32_Test.Search(TKDT6DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT6DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT6DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT6DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT7DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT7DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT7DI32_Node;
function SortCompare(const p1, p2: PKDT7DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT7DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT7DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT7DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT7DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT7DI32.GetData(const Index: NativeInt): PKDT7DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT7DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT7DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT7DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT7DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT7DI32.StoreBuffPtr: PKDT7DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT7DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT7DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT7DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT7DI32.BuildKDTreeWithCluster(const inBuff: TKDT7DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT7DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT7DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT7DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT7DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT7DI32.BuildKDTreeWithCluster(const inBuff: TKDT7DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT7DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildCall);
var
TempStoreBuff: TKDT7DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT7DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT7DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT7DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT7DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT7DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildMethod);
var
TempStoreBuff: TKDT7DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT7DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT7DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT7DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT7DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT7DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT7DI32_BuildProc);
var
TempStoreBuff: TKDT7DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT7DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT7DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT7DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT7DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT7DI32.Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT7DI32_Node;
var
NearestNeighbour: PKDT7DI32_Node;
function FindParentNode(const buffPtr: PKDT7DI32_Vec; NodePtr: PKDT7DI32_Node): PKDT7DI32_Node;
var
Next: PKDT7DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT7DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT7DI32_Node; const buffPtr: PKDT7DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT7DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT7DI32_Vec; const p1, p2: PKDT7DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT7DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT7DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT7DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT7DI32_Node(NearestNodes[0]);
end;
end;
function TKDT7DI32.Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT7DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT7DI32.Search(const buff: TKDT7DI32_Vec; var SearchedDistanceMin: Double): PKDT7DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT7DI32.Search(const buff: TKDT7DI32_Vec): PKDT7DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT7DI32.SearchToken(const buff: TKDT7DI32_Vec): TPascalString;
var
p: PKDT7DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT7DI32.Search(const inBuff: TKDT7DI32_DynamicVecBuffer; var OutBuff: TKDT7DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT7DI32_DynamicVecBuffer;
outBuffPtr: PKDT7DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT7DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT7DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT7DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT7DI32.Search(const inBuff: TKDT7DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT7DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT7DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT7DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT7DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT7DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT7DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT7DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT7DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT7DI32_Vec)) <> SizeOf(TKDT7DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT7DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT7DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT7DI32.PrintNodeTree(const NodePtr: PKDT7DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT7DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT7DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT7DI32.Vec(const s: SystemString): TKDT7DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT7DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT7DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT7DI32.Vec(const v: TKDT7DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT7DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT7DI32.Distance(const v1, v2: TKDT7DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT7DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT7DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT7DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT7DI32.Test;
var
TKDT7DI32_Test: TKDT7DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT7DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT7DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT7DI32_Test := TKDT7DI32.Create;
n.Append('...');
SetLength(TKDT7DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT7DI32_Test.TestBuff) - 1 do
for j := 0 to KDT7DI32_Axis - 1 do
TKDT7DI32_Test.TestBuff[i][j] := i * KDT7DI32_Axis + j;
{$IFDEF FPC}
TKDT7DI32_Test.BuildKDTreeM(length(TKDT7DI32_Test.TestBuff), nil, @TKDT7DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT7DI32_Test.BuildKDTreeM(length(TKDT7DI32_Test.TestBuff), nil, TKDT7DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT7DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT7DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT7DI32_Test.TestBuff) - 1 do
begin
p := TKDT7DI32_Test.Search(TKDT7DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT7DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT7DI32_Test.TestBuff));
TKDT7DI32_Test.Search(TKDT7DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT7DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT7DI32_Test.Clear;
{ kMean test }
TKDT7DI32_Test.BuildKDTreeWithCluster(TKDT7DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT7DI32_Test.Search(TKDT7DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT7DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT7DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT7DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT8DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT8DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT8DI32_Node;
function SortCompare(const p1, p2: PKDT8DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT8DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT8DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT8DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT8DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT8DI32.GetData(const Index: NativeInt): PKDT8DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT8DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT8DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT8DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT8DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT8DI32.StoreBuffPtr: PKDT8DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT8DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT8DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT8DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT8DI32.BuildKDTreeWithCluster(const inBuff: TKDT8DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT8DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT8DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT8DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT8DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT8DI32.BuildKDTreeWithCluster(const inBuff: TKDT8DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT8DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildCall);
var
TempStoreBuff: TKDT8DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT8DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT8DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT8DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT8DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT8DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildMethod);
var
TempStoreBuff: TKDT8DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT8DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT8DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT8DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT8DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT8DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT8DI32_BuildProc);
var
TempStoreBuff: TKDT8DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT8DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT8DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT8DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT8DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT8DI32.Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT8DI32_Node;
var
NearestNeighbour: PKDT8DI32_Node;
function FindParentNode(const buffPtr: PKDT8DI32_Vec; NodePtr: PKDT8DI32_Node): PKDT8DI32_Node;
var
Next: PKDT8DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT8DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT8DI32_Node; const buffPtr: PKDT8DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT8DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT8DI32_Vec; const p1, p2: PKDT8DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT8DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT8DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT8DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT8DI32_Node(NearestNodes[0]);
end;
end;
function TKDT8DI32.Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT8DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT8DI32.Search(const buff: TKDT8DI32_Vec; var SearchedDistanceMin: Double): PKDT8DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT8DI32.Search(const buff: TKDT8DI32_Vec): PKDT8DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT8DI32.SearchToken(const buff: TKDT8DI32_Vec): TPascalString;
var
p: PKDT8DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT8DI32.Search(const inBuff: TKDT8DI32_DynamicVecBuffer; var OutBuff: TKDT8DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT8DI32_DynamicVecBuffer;
outBuffPtr: PKDT8DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT8DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT8DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT8DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT8DI32.Search(const inBuff: TKDT8DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT8DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT8DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT8DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT8DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT8DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT8DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT8DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT8DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT8DI32_Vec)) <> SizeOf(TKDT8DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT8DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT8DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT8DI32.PrintNodeTree(const NodePtr: PKDT8DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT8DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT8DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT8DI32.Vec(const s: SystemString): TKDT8DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT8DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT8DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT8DI32.Vec(const v: TKDT8DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT8DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT8DI32.Distance(const v1, v2: TKDT8DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT8DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT8DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT8DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT8DI32.Test;
var
TKDT8DI32_Test: TKDT8DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT8DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT8DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT8DI32_Test := TKDT8DI32.Create;
n.Append('...');
SetLength(TKDT8DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT8DI32_Test.TestBuff) - 1 do
for j := 0 to KDT8DI32_Axis - 1 do
TKDT8DI32_Test.TestBuff[i][j] := i * KDT8DI32_Axis + j;
{$IFDEF FPC}
TKDT8DI32_Test.BuildKDTreeM(length(TKDT8DI32_Test.TestBuff), nil, @TKDT8DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT8DI32_Test.BuildKDTreeM(length(TKDT8DI32_Test.TestBuff), nil, TKDT8DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT8DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT8DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT8DI32_Test.TestBuff) - 1 do
begin
p := TKDT8DI32_Test.Search(TKDT8DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT8DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT8DI32_Test.TestBuff));
TKDT8DI32_Test.Search(TKDT8DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT8DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT8DI32_Test.Clear;
{ kMean test }
TKDT8DI32_Test.BuildKDTreeWithCluster(TKDT8DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT8DI32_Test.Search(TKDT8DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT8DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT8DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT8DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT9DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT9DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT9DI32_Node;
function SortCompare(const p1, p2: PKDT9DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT9DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT9DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT9DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT9DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT9DI32.GetData(const Index: NativeInt): PKDT9DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT9DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT9DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT9DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT9DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT9DI32.StoreBuffPtr: PKDT9DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT9DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT9DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT9DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT9DI32.BuildKDTreeWithCluster(const inBuff: TKDT9DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT9DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT9DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT9DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT9DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT9DI32.BuildKDTreeWithCluster(const inBuff: TKDT9DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT9DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildCall);
var
TempStoreBuff: TKDT9DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT9DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT9DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT9DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT9DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT9DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildMethod);
var
TempStoreBuff: TKDT9DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT9DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT9DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT9DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT9DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT9DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT9DI32_BuildProc);
var
TempStoreBuff: TKDT9DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT9DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT9DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT9DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT9DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT9DI32.Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT9DI32_Node;
var
NearestNeighbour: PKDT9DI32_Node;
function FindParentNode(const buffPtr: PKDT9DI32_Vec; NodePtr: PKDT9DI32_Node): PKDT9DI32_Node;
var
Next: PKDT9DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT9DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT9DI32_Node; const buffPtr: PKDT9DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT9DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT9DI32_Vec; const p1, p2: PKDT9DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT9DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT9DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT9DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT9DI32_Node(NearestNodes[0]);
end;
end;
function TKDT9DI32.Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT9DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT9DI32.Search(const buff: TKDT9DI32_Vec; var SearchedDistanceMin: Double): PKDT9DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT9DI32.Search(const buff: TKDT9DI32_Vec): PKDT9DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT9DI32.SearchToken(const buff: TKDT9DI32_Vec): TPascalString;
var
p: PKDT9DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT9DI32.Search(const inBuff: TKDT9DI32_DynamicVecBuffer; var OutBuff: TKDT9DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT9DI32_DynamicVecBuffer;
outBuffPtr: PKDT9DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT9DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT9DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT9DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT9DI32.Search(const inBuff: TKDT9DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT9DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT9DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT9DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT9DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT9DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT9DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT9DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT9DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT9DI32_Vec)) <> SizeOf(TKDT9DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT9DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT9DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT9DI32.PrintNodeTree(const NodePtr: PKDT9DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT9DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT9DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT9DI32.Vec(const s: SystemString): TKDT9DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT9DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT9DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT9DI32.Vec(const v: TKDT9DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT9DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT9DI32.Distance(const v1, v2: TKDT9DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT9DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT9DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT9DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT9DI32.Test;
var
TKDT9DI32_Test: TKDT9DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT9DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT9DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT9DI32_Test := TKDT9DI32.Create;
n.Append('...');
SetLength(TKDT9DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT9DI32_Test.TestBuff) - 1 do
for j := 0 to KDT9DI32_Axis - 1 do
TKDT9DI32_Test.TestBuff[i][j] := i * KDT9DI32_Axis + j;
{$IFDEF FPC}
TKDT9DI32_Test.BuildKDTreeM(length(TKDT9DI32_Test.TestBuff), nil, @TKDT9DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT9DI32_Test.BuildKDTreeM(length(TKDT9DI32_Test.TestBuff), nil, TKDT9DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT9DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT9DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT9DI32_Test.TestBuff) - 1 do
begin
p := TKDT9DI32_Test.Search(TKDT9DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT9DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT9DI32_Test.TestBuff));
TKDT9DI32_Test.Search(TKDT9DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT9DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT9DI32_Test.Clear;
{ kMean test }
TKDT9DI32_Test.BuildKDTreeWithCluster(TKDT9DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT9DI32_Test.Search(TKDT9DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT9DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT9DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT9DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT10DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT10DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT10DI32_Node;
function SortCompare(const p1, p2: PKDT10DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT10DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT10DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT10DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT10DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT10DI32.GetData(const Index: NativeInt): PKDT10DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT10DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT10DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT10DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT10DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT10DI32.StoreBuffPtr: PKDT10DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT10DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT10DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT10DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT10DI32.BuildKDTreeWithCluster(const inBuff: TKDT10DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT10DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT10DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT10DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT10DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT10DI32.BuildKDTreeWithCluster(const inBuff: TKDT10DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT10DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildCall);
var
TempStoreBuff: TKDT10DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT10DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT10DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT10DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT10DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT10DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildMethod);
var
TempStoreBuff: TKDT10DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT10DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT10DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT10DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT10DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT10DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT10DI32_BuildProc);
var
TempStoreBuff: TKDT10DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT10DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT10DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT10DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT10DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT10DI32.Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT10DI32_Node;
var
NearestNeighbour: PKDT10DI32_Node;
function FindParentNode(const buffPtr: PKDT10DI32_Vec; NodePtr: PKDT10DI32_Node): PKDT10DI32_Node;
var
Next: PKDT10DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT10DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT10DI32_Node; const buffPtr: PKDT10DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT10DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT10DI32_Vec; const p1, p2: PKDT10DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT10DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT10DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT10DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT10DI32_Node(NearestNodes[0]);
end;
end;
function TKDT10DI32.Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT10DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT10DI32.Search(const buff: TKDT10DI32_Vec; var SearchedDistanceMin: Double): PKDT10DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT10DI32.Search(const buff: TKDT10DI32_Vec): PKDT10DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT10DI32.SearchToken(const buff: TKDT10DI32_Vec): TPascalString;
var
p: PKDT10DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT10DI32.Search(const inBuff: TKDT10DI32_DynamicVecBuffer; var OutBuff: TKDT10DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT10DI32_DynamicVecBuffer;
outBuffPtr: PKDT10DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT10DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT10DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT10DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT10DI32.Search(const inBuff: TKDT10DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT10DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT10DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT10DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT10DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT10DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT10DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT10DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT10DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT10DI32_Vec)) <> SizeOf(TKDT10DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT10DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT10DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT10DI32.PrintNodeTree(const NodePtr: PKDT10DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT10DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT10DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT10DI32.Vec(const s: SystemString): TKDT10DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT10DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT10DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT10DI32.Vec(const v: TKDT10DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT10DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT10DI32.Distance(const v1, v2: TKDT10DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT10DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT10DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT10DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT10DI32.Test;
var
TKDT10DI32_Test: TKDT10DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT10DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT10DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT10DI32_Test := TKDT10DI32.Create;
n.Append('...');
SetLength(TKDT10DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT10DI32_Test.TestBuff) - 1 do
for j := 0 to KDT10DI32_Axis - 1 do
TKDT10DI32_Test.TestBuff[i][j] := i * KDT10DI32_Axis + j;
{$IFDEF FPC}
TKDT10DI32_Test.BuildKDTreeM(length(TKDT10DI32_Test.TestBuff), nil, @TKDT10DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT10DI32_Test.BuildKDTreeM(length(TKDT10DI32_Test.TestBuff), nil, TKDT10DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT10DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT10DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT10DI32_Test.TestBuff) - 1 do
begin
p := TKDT10DI32_Test.Search(TKDT10DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT10DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT10DI32_Test.TestBuff));
TKDT10DI32_Test.Search(TKDT10DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT10DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT10DI32_Test.Clear;
{ kMean test }
TKDT10DI32_Test.BuildKDTreeWithCluster(TKDT10DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT10DI32_Test.Search(TKDT10DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT10DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT10DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT10DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT11DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT11DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT11DI32_Node;
function SortCompare(const p1, p2: PKDT11DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT11DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT11DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT11DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT11DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT11DI32.GetData(const Index: NativeInt): PKDT11DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT11DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT11DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT11DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT11DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT11DI32.StoreBuffPtr: PKDT11DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT11DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT11DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT11DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT11DI32.BuildKDTreeWithCluster(const inBuff: TKDT11DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT11DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT11DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT11DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT11DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT11DI32.BuildKDTreeWithCluster(const inBuff: TKDT11DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT11DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildCall);
var
TempStoreBuff: TKDT11DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT11DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT11DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT11DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT11DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT11DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildMethod);
var
TempStoreBuff: TKDT11DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT11DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT11DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT11DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT11DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT11DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT11DI32_BuildProc);
var
TempStoreBuff: TKDT11DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT11DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT11DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT11DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT11DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT11DI32.Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT11DI32_Node;
var
NearestNeighbour: PKDT11DI32_Node;
function FindParentNode(const buffPtr: PKDT11DI32_Vec; NodePtr: PKDT11DI32_Node): PKDT11DI32_Node;
var
Next: PKDT11DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT11DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT11DI32_Node; const buffPtr: PKDT11DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT11DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT11DI32_Vec; const p1, p2: PKDT11DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT11DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT11DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT11DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT11DI32_Node(NearestNodes[0]);
end;
end;
function TKDT11DI32.Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT11DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT11DI32.Search(const buff: TKDT11DI32_Vec; var SearchedDistanceMin: Double): PKDT11DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT11DI32.Search(const buff: TKDT11DI32_Vec): PKDT11DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT11DI32.SearchToken(const buff: TKDT11DI32_Vec): TPascalString;
var
p: PKDT11DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT11DI32.Search(const inBuff: TKDT11DI32_DynamicVecBuffer; var OutBuff: TKDT11DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT11DI32_DynamicVecBuffer;
outBuffPtr: PKDT11DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT11DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT11DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT11DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT11DI32.Search(const inBuff: TKDT11DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT11DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT11DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT11DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT11DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT11DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT11DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT11DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT11DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT11DI32_Vec)) <> SizeOf(TKDT11DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT11DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT11DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT11DI32.PrintNodeTree(const NodePtr: PKDT11DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT11DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT11DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT11DI32.Vec(const s: SystemString): TKDT11DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT11DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT11DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT11DI32.Vec(const v: TKDT11DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT11DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT11DI32.Distance(const v1, v2: TKDT11DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT11DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT11DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT11DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT11DI32.Test;
var
TKDT11DI32_Test: TKDT11DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT11DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT11DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT11DI32_Test := TKDT11DI32.Create;
n.Append('...');
SetLength(TKDT11DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT11DI32_Test.TestBuff) - 1 do
for j := 0 to KDT11DI32_Axis - 1 do
TKDT11DI32_Test.TestBuff[i][j] := i * KDT11DI32_Axis + j;
{$IFDEF FPC}
TKDT11DI32_Test.BuildKDTreeM(length(TKDT11DI32_Test.TestBuff), nil, @TKDT11DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT11DI32_Test.BuildKDTreeM(length(TKDT11DI32_Test.TestBuff), nil, TKDT11DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT11DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT11DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT11DI32_Test.TestBuff) - 1 do
begin
p := TKDT11DI32_Test.Search(TKDT11DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT11DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT11DI32_Test.TestBuff));
TKDT11DI32_Test.Search(TKDT11DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT11DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT11DI32_Test.Clear;
{ kMean test }
TKDT11DI32_Test.BuildKDTreeWithCluster(TKDT11DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT11DI32_Test.Search(TKDT11DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT11DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT11DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT11DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT12DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT12DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT12DI32_Node;
function SortCompare(const p1, p2: PKDT12DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT12DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT12DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT12DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT12DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT12DI32.GetData(const Index: NativeInt): PKDT12DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT12DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT12DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT12DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT12DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT12DI32.StoreBuffPtr: PKDT12DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT12DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT12DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT12DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT12DI32.BuildKDTreeWithCluster(const inBuff: TKDT12DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT12DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT12DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT12DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT12DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT12DI32.BuildKDTreeWithCluster(const inBuff: TKDT12DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT12DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildCall);
var
TempStoreBuff: TKDT12DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT12DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT12DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT12DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT12DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT12DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildMethod);
var
TempStoreBuff: TKDT12DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT12DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT12DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT12DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT12DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT12DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT12DI32_BuildProc);
var
TempStoreBuff: TKDT12DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT12DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT12DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT12DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT12DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT12DI32.Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT12DI32_Node;
var
NearestNeighbour: PKDT12DI32_Node;
function FindParentNode(const buffPtr: PKDT12DI32_Vec; NodePtr: PKDT12DI32_Node): PKDT12DI32_Node;
var
Next: PKDT12DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT12DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT12DI32_Node; const buffPtr: PKDT12DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT12DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT12DI32_Vec; const p1, p2: PKDT12DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT12DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT12DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT12DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT12DI32_Node(NearestNodes[0]);
end;
end;
function TKDT12DI32.Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT12DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT12DI32.Search(const buff: TKDT12DI32_Vec; var SearchedDistanceMin: Double): PKDT12DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT12DI32.Search(const buff: TKDT12DI32_Vec): PKDT12DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT12DI32.SearchToken(const buff: TKDT12DI32_Vec): TPascalString;
var
p: PKDT12DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT12DI32.Search(const inBuff: TKDT12DI32_DynamicVecBuffer; var OutBuff: TKDT12DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT12DI32_DynamicVecBuffer;
outBuffPtr: PKDT12DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT12DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT12DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT12DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT12DI32.Search(const inBuff: TKDT12DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT12DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT12DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT12DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT12DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT12DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT12DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT12DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT12DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT12DI32_Vec)) <> SizeOf(TKDT12DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT12DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT12DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT12DI32.PrintNodeTree(const NodePtr: PKDT12DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT12DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT12DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT12DI32.Vec(const s: SystemString): TKDT12DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT12DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT12DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT12DI32.Vec(const v: TKDT12DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT12DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT12DI32.Distance(const v1, v2: TKDT12DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT12DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT12DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT12DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT12DI32.Test;
var
TKDT12DI32_Test: TKDT12DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT12DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT12DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT12DI32_Test := TKDT12DI32.Create;
n.Append('...');
SetLength(TKDT12DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT12DI32_Test.TestBuff) - 1 do
for j := 0 to KDT12DI32_Axis - 1 do
TKDT12DI32_Test.TestBuff[i][j] := i * KDT12DI32_Axis + j;
{$IFDEF FPC}
TKDT12DI32_Test.BuildKDTreeM(length(TKDT12DI32_Test.TestBuff), nil, @TKDT12DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT12DI32_Test.BuildKDTreeM(length(TKDT12DI32_Test.TestBuff), nil, TKDT12DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT12DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT12DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT12DI32_Test.TestBuff) - 1 do
begin
p := TKDT12DI32_Test.Search(TKDT12DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT12DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT12DI32_Test.TestBuff));
TKDT12DI32_Test.Search(TKDT12DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT12DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT12DI32_Test.Clear;
{ kMean test }
TKDT12DI32_Test.BuildKDTreeWithCluster(TKDT12DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT12DI32_Test.Search(TKDT12DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT12DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT12DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT12DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT13DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT13DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT13DI32_Node;
function SortCompare(const p1, p2: PKDT13DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT13DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT13DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT13DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT13DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT13DI32.GetData(const Index: NativeInt): PKDT13DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT13DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT13DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT13DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT13DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT13DI32.StoreBuffPtr: PKDT13DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT13DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT13DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT13DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT13DI32.BuildKDTreeWithCluster(const inBuff: TKDT13DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT13DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT13DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT13DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT13DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT13DI32.BuildKDTreeWithCluster(const inBuff: TKDT13DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT13DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildCall);
var
TempStoreBuff: TKDT13DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT13DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT13DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT13DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT13DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT13DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildMethod);
var
TempStoreBuff: TKDT13DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT13DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT13DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT13DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT13DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT13DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT13DI32_BuildProc);
var
TempStoreBuff: TKDT13DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT13DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT13DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT13DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT13DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT13DI32.Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT13DI32_Node;
var
NearestNeighbour: PKDT13DI32_Node;
function FindParentNode(const buffPtr: PKDT13DI32_Vec; NodePtr: PKDT13DI32_Node): PKDT13DI32_Node;
var
Next: PKDT13DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT13DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT13DI32_Node; const buffPtr: PKDT13DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT13DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT13DI32_Vec; const p1, p2: PKDT13DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT13DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT13DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT13DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT13DI32_Node(NearestNodes[0]);
end;
end;
function TKDT13DI32.Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT13DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT13DI32.Search(const buff: TKDT13DI32_Vec; var SearchedDistanceMin: Double): PKDT13DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT13DI32.Search(const buff: TKDT13DI32_Vec): PKDT13DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT13DI32.SearchToken(const buff: TKDT13DI32_Vec): TPascalString;
var
p: PKDT13DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT13DI32.Search(const inBuff: TKDT13DI32_DynamicVecBuffer; var OutBuff: TKDT13DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT13DI32_DynamicVecBuffer;
outBuffPtr: PKDT13DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT13DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT13DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT13DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT13DI32.Search(const inBuff: TKDT13DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT13DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT13DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT13DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT13DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT13DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT13DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT13DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT13DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT13DI32_Vec)) <> SizeOf(TKDT13DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT13DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT13DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT13DI32.PrintNodeTree(const NodePtr: PKDT13DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT13DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT13DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT13DI32.Vec(const s: SystemString): TKDT13DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT13DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT13DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT13DI32.Vec(const v: TKDT13DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT13DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT13DI32.Distance(const v1, v2: TKDT13DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT13DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT13DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT13DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT13DI32.Test;
var
TKDT13DI32_Test: TKDT13DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT13DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT13DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT13DI32_Test := TKDT13DI32.Create;
n.Append('...');
SetLength(TKDT13DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT13DI32_Test.TestBuff) - 1 do
for j := 0 to KDT13DI32_Axis - 1 do
TKDT13DI32_Test.TestBuff[i][j] := i * KDT13DI32_Axis + j;
{$IFDEF FPC}
TKDT13DI32_Test.BuildKDTreeM(length(TKDT13DI32_Test.TestBuff), nil, @TKDT13DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT13DI32_Test.BuildKDTreeM(length(TKDT13DI32_Test.TestBuff), nil, TKDT13DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT13DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT13DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT13DI32_Test.TestBuff) - 1 do
begin
p := TKDT13DI32_Test.Search(TKDT13DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT13DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT13DI32_Test.TestBuff));
TKDT13DI32_Test.Search(TKDT13DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT13DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT13DI32_Test.Clear;
{ kMean test }
TKDT13DI32_Test.BuildKDTreeWithCluster(TKDT13DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT13DI32_Test.Search(TKDT13DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT13DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT13DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT13DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT14DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT14DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT14DI32_Node;
function SortCompare(const p1, p2: PKDT14DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT14DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT14DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT14DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT14DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT14DI32.GetData(const Index: NativeInt): PKDT14DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT14DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT14DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT14DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT14DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT14DI32.StoreBuffPtr: PKDT14DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT14DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT14DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT14DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT14DI32.BuildKDTreeWithCluster(const inBuff: TKDT14DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT14DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT14DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT14DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT14DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT14DI32.BuildKDTreeWithCluster(const inBuff: TKDT14DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT14DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildCall);
var
TempStoreBuff: TKDT14DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT14DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT14DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT14DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT14DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT14DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildMethod);
var
TempStoreBuff: TKDT14DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT14DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT14DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT14DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT14DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT14DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT14DI32_BuildProc);
var
TempStoreBuff: TKDT14DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT14DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT14DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT14DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT14DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT14DI32.Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT14DI32_Node;
var
NearestNeighbour: PKDT14DI32_Node;
function FindParentNode(const buffPtr: PKDT14DI32_Vec; NodePtr: PKDT14DI32_Node): PKDT14DI32_Node;
var
Next: PKDT14DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT14DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT14DI32_Node; const buffPtr: PKDT14DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT14DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT14DI32_Vec; const p1, p2: PKDT14DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT14DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT14DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT14DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT14DI32_Node(NearestNodes[0]);
end;
end;
function TKDT14DI32.Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT14DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT14DI32.Search(const buff: TKDT14DI32_Vec; var SearchedDistanceMin: Double): PKDT14DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT14DI32.Search(const buff: TKDT14DI32_Vec): PKDT14DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT14DI32.SearchToken(const buff: TKDT14DI32_Vec): TPascalString;
var
p: PKDT14DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT14DI32.Search(const inBuff: TKDT14DI32_DynamicVecBuffer; var OutBuff: TKDT14DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT14DI32_DynamicVecBuffer;
outBuffPtr: PKDT14DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT14DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT14DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT14DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT14DI32.Search(const inBuff: TKDT14DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT14DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT14DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT14DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT14DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT14DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT14DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT14DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT14DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT14DI32_Vec)) <> SizeOf(TKDT14DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT14DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT14DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT14DI32.PrintNodeTree(const NodePtr: PKDT14DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT14DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT14DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT14DI32.Vec(const s: SystemString): TKDT14DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT14DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT14DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT14DI32.Vec(const v: TKDT14DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT14DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT14DI32.Distance(const v1, v2: TKDT14DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT14DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT14DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT14DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT14DI32.Test;
var
TKDT14DI32_Test: TKDT14DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT14DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT14DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT14DI32_Test := TKDT14DI32.Create;
n.Append('...');
SetLength(TKDT14DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT14DI32_Test.TestBuff) - 1 do
for j := 0 to KDT14DI32_Axis - 1 do
TKDT14DI32_Test.TestBuff[i][j] := i * KDT14DI32_Axis + j;
{$IFDEF FPC}
TKDT14DI32_Test.BuildKDTreeM(length(TKDT14DI32_Test.TestBuff), nil, @TKDT14DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT14DI32_Test.BuildKDTreeM(length(TKDT14DI32_Test.TestBuff), nil, TKDT14DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT14DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT14DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT14DI32_Test.TestBuff) - 1 do
begin
p := TKDT14DI32_Test.Search(TKDT14DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT14DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT14DI32_Test.TestBuff));
TKDT14DI32_Test.Search(TKDT14DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT14DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT14DI32_Test.Clear;
{ kMean test }
TKDT14DI32_Test.BuildKDTreeWithCluster(TKDT14DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT14DI32_Test.Search(TKDT14DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT14DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT14DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT14DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT15DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT15DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT15DI32_Node;
function SortCompare(const p1, p2: PKDT15DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT15DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT15DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT15DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT15DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT15DI32.GetData(const Index: NativeInt): PKDT15DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT15DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT15DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT15DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT15DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT15DI32.StoreBuffPtr: PKDT15DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT15DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT15DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT15DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT15DI32.BuildKDTreeWithCluster(const inBuff: TKDT15DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT15DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT15DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT15DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT15DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT15DI32.BuildKDTreeWithCluster(const inBuff: TKDT15DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT15DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildCall);
var
TempStoreBuff: TKDT15DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT15DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT15DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT15DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT15DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT15DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildMethod);
var
TempStoreBuff: TKDT15DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT15DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT15DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT15DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT15DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT15DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT15DI32_BuildProc);
var
TempStoreBuff: TKDT15DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT15DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT15DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT15DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT15DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT15DI32.Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT15DI32_Node;
var
NearestNeighbour: PKDT15DI32_Node;
function FindParentNode(const buffPtr: PKDT15DI32_Vec; NodePtr: PKDT15DI32_Node): PKDT15DI32_Node;
var
Next: PKDT15DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT15DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT15DI32_Node; const buffPtr: PKDT15DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT15DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT15DI32_Vec; const p1, p2: PKDT15DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT15DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT15DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT15DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT15DI32_Node(NearestNodes[0]);
end;
end;
function TKDT15DI32.Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT15DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT15DI32.Search(const buff: TKDT15DI32_Vec; var SearchedDistanceMin: Double): PKDT15DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT15DI32.Search(const buff: TKDT15DI32_Vec): PKDT15DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT15DI32.SearchToken(const buff: TKDT15DI32_Vec): TPascalString;
var
p: PKDT15DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT15DI32.Search(const inBuff: TKDT15DI32_DynamicVecBuffer; var OutBuff: TKDT15DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT15DI32_DynamicVecBuffer;
outBuffPtr: PKDT15DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT15DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT15DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT15DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT15DI32.Search(const inBuff: TKDT15DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT15DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT15DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT15DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT15DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT15DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT15DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT15DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT15DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT15DI32_Vec)) <> SizeOf(TKDT15DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT15DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT15DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT15DI32.PrintNodeTree(const NodePtr: PKDT15DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT15DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT15DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT15DI32.Vec(const s: SystemString): TKDT15DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT15DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT15DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT15DI32.Vec(const v: TKDT15DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT15DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT15DI32.Distance(const v1, v2: TKDT15DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT15DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT15DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT15DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT15DI32.Test;
var
TKDT15DI32_Test: TKDT15DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT15DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT15DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT15DI32_Test := TKDT15DI32.Create;
n.Append('...');
SetLength(TKDT15DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT15DI32_Test.TestBuff) - 1 do
for j := 0 to KDT15DI32_Axis - 1 do
TKDT15DI32_Test.TestBuff[i][j] := i * KDT15DI32_Axis + j;
{$IFDEF FPC}
TKDT15DI32_Test.BuildKDTreeM(length(TKDT15DI32_Test.TestBuff), nil, @TKDT15DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT15DI32_Test.BuildKDTreeM(length(TKDT15DI32_Test.TestBuff), nil, TKDT15DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT15DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT15DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT15DI32_Test.TestBuff) - 1 do
begin
p := TKDT15DI32_Test.Search(TKDT15DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT15DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT15DI32_Test.TestBuff));
TKDT15DI32_Test.Search(TKDT15DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT15DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT15DI32_Test.Clear;
{ kMean test }
TKDT15DI32_Test.BuildKDTreeWithCluster(TKDT15DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT15DI32_Test.Search(TKDT15DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT15DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT15DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT15DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT16DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT16DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT16DI32_Node;
function SortCompare(const p1, p2: PKDT16DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT16DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT16DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT16DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT16DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT16DI32.GetData(const Index: NativeInt): PKDT16DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT16DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT16DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT16DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT16DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT16DI32.StoreBuffPtr: PKDT16DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT16DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT16DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT16DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT16DI32.BuildKDTreeWithCluster(const inBuff: TKDT16DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT16DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT16DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT16DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT16DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT16DI32.BuildKDTreeWithCluster(const inBuff: TKDT16DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT16DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildCall);
var
TempStoreBuff: TKDT16DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT16DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT16DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT16DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT16DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT16DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildMethod);
var
TempStoreBuff: TKDT16DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT16DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT16DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT16DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT16DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT16DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT16DI32_BuildProc);
var
TempStoreBuff: TKDT16DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT16DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT16DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT16DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT16DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT16DI32.Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT16DI32_Node;
var
NearestNeighbour: PKDT16DI32_Node;
function FindParentNode(const buffPtr: PKDT16DI32_Vec; NodePtr: PKDT16DI32_Node): PKDT16DI32_Node;
var
Next: PKDT16DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT16DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT16DI32_Node; const buffPtr: PKDT16DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT16DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT16DI32_Vec; const p1, p2: PKDT16DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT16DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT16DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT16DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT16DI32_Node(NearestNodes[0]);
end;
end;
function TKDT16DI32.Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT16DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT16DI32.Search(const buff: TKDT16DI32_Vec; var SearchedDistanceMin: Double): PKDT16DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT16DI32.Search(const buff: TKDT16DI32_Vec): PKDT16DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT16DI32.SearchToken(const buff: TKDT16DI32_Vec): TPascalString;
var
p: PKDT16DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT16DI32.Search(const inBuff: TKDT16DI32_DynamicVecBuffer; var OutBuff: TKDT16DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT16DI32_DynamicVecBuffer;
outBuffPtr: PKDT16DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT16DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT16DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT16DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT16DI32.Search(const inBuff: TKDT16DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT16DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT16DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT16DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT16DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT16DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT16DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT16DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT16DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT16DI32_Vec)) <> SizeOf(TKDT16DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT16DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT16DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT16DI32.PrintNodeTree(const NodePtr: PKDT16DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT16DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT16DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT16DI32.Vec(const s: SystemString): TKDT16DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT16DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT16DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT16DI32.Vec(const v: TKDT16DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT16DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT16DI32.Distance(const v1, v2: TKDT16DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT16DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT16DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT16DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT16DI32.Test;
var
TKDT16DI32_Test: TKDT16DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT16DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT16DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT16DI32_Test := TKDT16DI32.Create;
n.Append('...');
SetLength(TKDT16DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT16DI32_Test.TestBuff) - 1 do
for j := 0 to KDT16DI32_Axis - 1 do
TKDT16DI32_Test.TestBuff[i][j] := i * KDT16DI32_Axis + j;
{$IFDEF FPC}
TKDT16DI32_Test.BuildKDTreeM(length(TKDT16DI32_Test.TestBuff), nil, @TKDT16DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT16DI32_Test.BuildKDTreeM(length(TKDT16DI32_Test.TestBuff), nil, TKDT16DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT16DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT16DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT16DI32_Test.TestBuff) - 1 do
begin
p := TKDT16DI32_Test.Search(TKDT16DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT16DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT16DI32_Test.TestBuff));
TKDT16DI32_Test.Search(TKDT16DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT16DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT16DI32_Test.Clear;
{ kMean test }
TKDT16DI32_Test.BuildKDTreeWithCluster(TKDT16DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT16DI32_Test.Search(TKDT16DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT16DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT16DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT16DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT17DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT17DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT17DI32_Node;
function SortCompare(const p1, p2: PKDT17DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT17DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT17DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT17DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT17DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT17DI32.GetData(const Index: NativeInt): PKDT17DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT17DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT17DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT17DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT17DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT17DI32.StoreBuffPtr: PKDT17DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT17DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT17DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT17DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT17DI32.BuildKDTreeWithCluster(const inBuff: TKDT17DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT17DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT17DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT17DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT17DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT17DI32.BuildKDTreeWithCluster(const inBuff: TKDT17DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT17DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildCall);
var
TempStoreBuff: TKDT17DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT17DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT17DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT17DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT17DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT17DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildMethod);
var
TempStoreBuff: TKDT17DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT17DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT17DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT17DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT17DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT17DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT17DI32_BuildProc);
var
TempStoreBuff: TKDT17DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT17DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT17DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT17DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT17DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT17DI32.Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT17DI32_Node;
var
NearestNeighbour: PKDT17DI32_Node;
function FindParentNode(const buffPtr: PKDT17DI32_Vec; NodePtr: PKDT17DI32_Node): PKDT17DI32_Node;
var
Next: PKDT17DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT17DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT17DI32_Node; const buffPtr: PKDT17DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT17DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT17DI32_Vec; const p1, p2: PKDT17DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT17DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT17DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT17DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT17DI32_Node(NearestNodes[0]);
end;
end;
function TKDT17DI32.Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT17DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT17DI32.Search(const buff: TKDT17DI32_Vec; var SearchedDistanceMin: Double): PKDT17DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT17DI32.Search(const buff: TKDT17DI32_Vec): PKDT17DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT17DI32.SearchToken(const buff: TKDT17DI32_Vec): TPascalString;
var
p: PKDT17DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT17DI32.Search(const inBuff: TKDT17DI32_DynamicVecBuffer; var OutBuff: TKDT17DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT17DI32_DynamicVecBuffer;
outBuffPtr: PKDT17DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT17DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT17DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT17DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT17DI32.Search(const inBuff: TKDT17DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT17DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT17DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT17DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT17DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT17DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT17DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT17DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT17DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT17DI32_Vec)) <> SizeOf(TKDT17DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT17DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT17DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT17DI32.PrintNodeTree(const NodePtr: PKDT17DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT17DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT17DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT17DI32.Vec(const s: SystemString): TKDT17DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT17DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT17DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT17DI32.Vec(const v: TKDT17DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT17DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT17DI32.Distance(const v1, v2: TKDT17DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT17DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT17DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT17DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT17DI32.Test;
var
TKDT17DI32_Test: TKDT17DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT17DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT17DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT17DI32_Test := TKDT17DI32.Create;
n.Append('...');
SetLength(TKDT17DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT17DI32_Test.TestBuff) - 1 do
for j := 0 to KDT17DI32_Axis - 1 do
TKDT17DI32_Test.TestBuff[i][j] := i * KDT17DI32_Axis + j;
{$IFDEF FPC}
TKDT17DI32_Test.BuildKDTreeM(length(TKDT17DI32_Test.TestBuff), nil, @TKDT17DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT17DI32_Test.BuildKDTreeM(length(TKDT17DI32_Test.TestBuff), nil, TKDT17DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT17DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT17DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT17DI32_Test.TestBuff) - 1 do
begin
p := TKDT17DI32_Test.Search(TKDT17DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT17DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT17DI32_Test.TestBuff));
TKDT17DI32_Test.Search(TKDT17DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT17DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT17DI32_Test.Clear;
{ kMean test }
TKDT17DI32_Test.BuildKDTreeWithCluster(TKDT17DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT17DI32_Test.Search(TKDT17DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT17DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT17DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT17DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT18DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT18DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT18DI32_Node;
function SortCompare(const p1, p2: PKDT18DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT18DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT18DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT18DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT18DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT18DI32.GetData(const Index: NativeInt): PKDT18DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT18DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT18DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT18DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT18DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT18DI32.StoreBuffPtr: PKDT18DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT18DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT18DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT18DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT18DI32.BuildKDTreeWithCluster(const inBuff: TKDT18DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT18DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT18DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT18DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT18DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT18DI32.BuildKDTreeWithCluster(const inBuff: TKDT18DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT18DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildCall);
var
TempStoreBuff: TKDT18DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT18DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT18DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT18DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT18DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT18DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildMethod);
var
TempStoreBuff: TKDT18DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT18DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT18DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT18DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT18DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT18DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT18DI32_BuildProc);
var
TempStoreBuff: TKDT18DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT18DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT18DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT18DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT18DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT18DI32.Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT18DI32_Node;
var
NearestNeighbour: PKDT18DI32_Node;
function FindParentNode(const buffPtr: PKDT18DI32_Vec; NodePtr: PKDT18DI32_Node): PKDT18DI32_Node;
var
Next: PKDT18DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT18DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT18DI32_Node; const buffPtr: PKDT18DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT18DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT18DI32_Vec; const p1, p2: PKDT18DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT18DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT18DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT18DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT18DI32_Node(NearestNodes[0]);
end;
end;
function TKDT18DI32.Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT18DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT18DI32.Search(const buff: TKDT18DI32_Vec; var SearchedDistanceMin: Double): PKDT18DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT18DI32.Search(const buff: TKDT18DI32_Vec): PKDT18DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT18DI32.SearchToken(const buff: TKDT18DI32_Vec): TPascalString;
var
p: PKDT18DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT18DI32.Search(const inBuff: TKDT18DI32_DynamicVecBuffer; var OutBuff: TKDT18DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT18DI32_DynamicVecBuffer;
outBuffPtr: PKDT18DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT18DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT18DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT18DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT18DI32.Search(const inBuff: TKDT18DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT18DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT18DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT18DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT18DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT18DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT18DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT18DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT18DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT18DI32_Vec)) <> SizeOf(TKDT18DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT18DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT18DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT18DI32.PrintNodeTree(const NodePtr: PKDT18DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT18DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT18DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT18DI32.Vec(const s: SystemString): TKDT18DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT18DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT18DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT18DI32.Vec(const v: TKDT18DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT18DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT18DI32.Distance(const v1, v2: TKDT18DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT18DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT18DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT18DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT18DI32.Test;
var
TKDT18DI32_Test: TKDT18DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT18DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT18DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT18DI32_Test := TKDT18DI32.Create;
n.Append('...');
SetLength(TKDT18DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT18DI32_Test.TestBuff) - 1 do
for j := 0 to KDT18DI32_Axis - 1 do
TKDT18DI32_Test.TestBuff[i][j] := i * KDT18DI32_Axis + j;
{$IFDEF FPC}
TKDT18DI32_Test.BuildKDTreeM(length(TKDT18DI32_Test.TestBuff), nil, @TKDT18DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT18DI32_Test.BuildKDTreeM(length(TKDT18DI32_Test.TestBuff), nil, TKDT18DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT18DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT18DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT18DI32_Test.TestBuff) - 1 do
begin
p := TKDT18DI32_Test.Search(TKDT18DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT18DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT18DI32_Test.TestBuff));
TKDT18DI32_Test.Search(TKDT18DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT18DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT18DI32_Test.Clear;
{ kMean test }
TKDT18DI32_Test.BuildKDTreeWithCluster(TKDT18DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT18DI32_Test.Search(TKDT18DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT18DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT18DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT18DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT19DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT19DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT19DI32_Node;
function SortCompare(const p1, p2: PKDT19DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT19DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT19DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT19DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT19DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT19DI32.GetData(const Index: NativeInt): PKDT19DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT19DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT19DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT19DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT19DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT19DI32.StoreBuffPtr: PKDT19DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT19DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT19DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT19DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT19DI32.BuildKDTreeWithCluster(const inBuff: TKDT19DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT19DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT19DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT19DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT19DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT19DI32.BuildKDTreeWithCluster(const inBuff: TKDT19DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT19DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildCall);
var
TempStoreBuff: TKDT19DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT19DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT19DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT19DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT19DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT19DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildMethod);
var
TempStoreBuff: TKDT19DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT19DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT19DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT19DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT19DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT19DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT19DI32_BuildProc);
var
TempStoreBuff: TKDT19DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT19DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT19DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT19DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT19DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT19DI32.Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT19DI32_Node;
var
NearestNeighbour: PKDT19DI32_Node;
function FindParentNode(const buffPtr: PKDT19DI32_Vec; NodePtr: PKDT19DI32_Node): PKDT19DI32_Node;
var
Next: PKDT19DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT19DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT19DI32_Node; const buffPtr: PKDT19DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT19DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT19DI32_Vec; const p1, p2: PKDT19DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT19DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT19DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT19DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT19DI32_Node(NearestNodes[0]);
end;
end;
function TKDT19DI32.Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT19DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT19DI32.Search(const buff: TKDT19DI32_Vec; var SearchedDistanceMin: Double): PKDT19DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT19DI32.Search(const buff: TKDT19DI32_Vec): PKDT19DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT19DI32.SearchToken(const buff: TKDT19DI32_Vec): TPascalString;
var
p: PKDT19DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT19DI32.Search(const inBuff: TKDT19DI32_DynamicVecBuffer; var OutBuff: TKDT19DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT19DI32_DynamicVecBuffer;
outBuffPtr: PKDT19DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT19DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT19DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT19DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT19DI32.Search(const inBuff: TKDT19DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT19DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT19DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT19DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT19DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT19DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT19DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT19DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT19DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT19DI32_Vec)) <> SizeOf(TKDT19DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT19DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT19DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT19DI32.PrintNodeTree(const NodePtr: PKDT19DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT19DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT19DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT19DI32.Vec(const s: SystemString): TKDT19DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT19DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT19DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT19DI32.Vec(const v: TKDT19DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT19DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT19DI32.Distance(const v1, v2: TKDT19DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT19DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT19DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT19DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT19DI32.Test;
var
TKDT19DI32_Test: TKDT19DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT19DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT19DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT19DI32_Test := TKDT19DI32.Create;
n.Append('...');
SetLength(TKDT19DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT19DI32_Test.TestBuff) - 1 do
for j := 0 to KDT19DI32_Axis - 1 do
TKDT19DI32_Test.TestBuff[i][j] := i * KDT19DI32_Axis + j;
{$IFDEF FPC}
TKDT19DI32_Test.BuildKDTreeM(length(TKDT19DI32_Test.TestBuff), nil, @TKDT19DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT19DI32_Test.BuildKDTreeM(length(TKDT19DI32_Test.TestBuff), nil, TKDT19DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT19DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT19DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT19DI32_Test.TestBuff) - 1 do
begin
p := TKDT19DI32_Test.Search(TKDT19DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT19DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT19DI32_Test.TestBuff));
TKDT19DI32_Test.Search(TKDT19DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT19DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT19DI32_Test.Clear;
{ kMean test }
TKDT19DI32_Test.BuildKDTreeWithCluster(TKDT19DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT19DI32_Test.Search(TKDT19DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT19DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT19DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT19DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT20DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT20DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT20DI32_Node;
function SortCompare(const p1, p2: PKDT20DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT20DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT20DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT20DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT20DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT20DI32.GetData(const Index: NativeInt): PKDT20DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT20DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT20DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT20DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT20DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT20DI32.StoreBuffPtr: PKDT20DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT20DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT20DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT20DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT20DI32.BuildKDTreeWithCluster(const inBuff: TKDT20DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT20DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT20DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT20DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT20DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT20DI32.BuildKDTreeWithCluster(const inBuff: TKDT20DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT20DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildCall);
var
TempStoreBuff: TKDT20DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT20DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT20DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT20DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT20DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT20DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildMethod);
var
TempStoreBuff: TKDT20DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT20DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT20DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT20DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT20DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT20DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT20DI32_BuildProc);
var
TempStoreBuff: TKDT20DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT20DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT20DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT20DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT20DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT20DI32.Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT20DI32_Node;
var
NearestNeighbour: PKDT20DI32_Node;
function FindParentNode(const buffPtr: PKDT20DI32_Vec; NodePtr: PKDT20DI32_Node): PKDT20DI32_Node;
var
Next: PKDT20DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT20DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT20DI32_Node; const buffPtr: PKDT20DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT20DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT20DI32_Vec; const p1, p2: PKDT20DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT20DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT20DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT20DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT20DI32_Node(NearestNodes[0]);
end;
end;
function TKDT20DI32.Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT20DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT20DI32.Search(const buff: TKDT20DI32_Vec; var SearchedDistanceMin: Double): PKDT20DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT20DI32.Search(const buff: TKDT20DI32_Vec): PKDT20DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT20DI32.SearchToken(const buff: TKDT20DI32_Vec): TPascalString;
var
p: PKDT20DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT20DI32.Search(const inBuff: TKDT20DI32_DynamicVecBuffer; var OutBuff: TKDT20DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT20DI32_DynamicVecBuffer;
outBuffPtr: PKDT20DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT20DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT20DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT20DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT20DI32.Search(const inBuff: TKDT20DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT20DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT20DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT20DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT20DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT20DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT20DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT20DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT20DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT20DI32_Vec)) <> SizeOf(TKDT20DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT20DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT20DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT20DI32.PrintNodeTree(const NodePtr: PKDT20DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT20DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT20DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT20DI32.Vec(const s: SystemString): TKDT20DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT20DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT20DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT20DI32.Vec(const v: TKDT20DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT20DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT20DI32.Distance(const v1, v2: TKDT20DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT20DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT20DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT20DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT20DI32.Test;
var
TKDT20DI32_Test: TKDT20DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT20DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT20DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT20DI32_Test := TKDT20DI32.Create;
n.Append('...');
SetLength(TKDT20DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT20DI32_Test.TestBuff) - 1 do
for j := 0 to KDT20DI32_Axis - 1 do
TKDT20DI32_Test.TestBuff[i][j] := i * KDT20DI32_Axis + j;
{$IFDEF FPC}
TKDT20DI32_Test.BuildKDTreeM(length(TKDT20DI32_Test.TestBuff), nil, @TKDT20DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT20DI32_Test.BuildKDTreeM(length(TKDT20DI32_Test.TestBuff), nil, TKDT20DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT20DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT20DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT20DI32_Test.TestBuff) - 1 do
begin
p := TKDT20DI32_Test.Search(TKDT20DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT20DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT20DI32_Test.TestBuff));
TKDT20DI32_Test.Search(TKDT20DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT20DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT20DI32_Test.Clear;
{ kMean test }
TKDT20DI32_Test.BuildKDTreeWithCluster(TKDT20DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT20DI32_Test.Search(TKDT20DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT20DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT20DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT20DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT21DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT21DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT21DI32_Node;
function SortCompare(const p1, p2: PKDT21DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT21DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT21DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT21DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT21DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT21DI32.GetData(const Index: NativeInt): PKDT21DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT21DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT21DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT21DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT21DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT21DI32.StoreBuffPtr: PKDT21DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT21DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT21DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT21DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT21DI32.BuildKDTreeWithCluster(const inBuff: TKDT21DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT21DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT21DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT21DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT21DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT21DI32.BuildKDTreeWithCluster(const inBuff: TKDT21DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT21DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildCall);
var
TempStoreBuff: TKDT21DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT21DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT21DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT21DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT21DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT21DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildMethod);
var
TempStoreBuff: TKDT21DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT21DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT21DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT21DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT21DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT21DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT21DI32_BuildProc);
var
TempStoreBuff: TKDT21DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT21DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT21DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT21DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT21DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT21DI32.Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT21DI32_Node;
var
NearestNeighbour: PKDT21DI32_Node;
function FindParentNode(const buffPtr: PKDT21DI32_Vec; NodePtr: PKDT21DI32_Node): PKDT21DI32_Node;
var
Next: PKDT21DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT21DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT21DI32_Node; const buffPtr: PKDT21DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT21DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT21DI32_Vec; const p1, p2: PKDT21DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT21DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT21DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT21DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT21DI32_Node(NearestNodes[0]);
end;
end;
function TKDT21DI32.Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT21DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT21DI32.Search(const buff: TKDT21DI32_Vec; var SearchedDistanceMin: Double): PKDT21DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT21DI32.Search(const buff: TKDT21DI32_Vec): PKDT21DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT21DI32.SearchToken(const buff: TKDT21DI32_Vec): TPascalString;
var
p: PKDT21DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT21DI32.Search(const inBuff: TKDT21DI32_DynamicVecBuffer; var OutBuff: TKDT21DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT21DI32_DynamicVecBuffer;
outBuffPtr: PKDT21DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT21DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT21DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT21DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT21DI32.Search(const inBuff: TKDT21DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT21DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT21DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT21DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT21DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT21DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT21DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT21DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT21DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT21DI32_Vec)) <> SizeOf(TKDT21DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT21DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT21DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT21DI32.PrintNodeTree(const NodePtr: PKDT21DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT21DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT21DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT21DI32.Vec(const s: SystemString): TKDT21DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT21DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT21DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT21DI32.Vec(const v: TKDT21DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT21DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT21DI32.Distance(const v1, v2: TKDT21DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT21DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT21DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT21DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT21DI32.Test;
var
TKDT21DI32_Test: TKDT21DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT21DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT21DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT21DI32_Test := TKDT21DI32.Create;
n.Append('...');
SetLength(TKDT21DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT21DI32_Test.TestBuff) - 1 do
for j := 0 to KDT21DI32_Axis - 1 do
TKDT21DI32_Test.TestBuff[i][j] := i * KDT21DI32_Axis + j;
{$IFDEF FPC}
TKDT21DI32_Test.BuildKDTreeM(length(TKDT21DI32_Test.TestBuff), nil, @TKDT21DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT21DI32_Test.BuildKDTreeM(length(TKDT21DI32_Test.TestBuff), nil, TKDT21DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT21DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT21DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT21DI32_Test.TestBuff) - 1 do
begin
p := TKDT21DI32_Test.Search(TKDT21DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT21DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT21DI32_Test.TestBuff));
TKDT21DI32_Test.Search(TKDT21DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT21DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT21DI32_Test.Clear;
{ kMean test }
TKDT21DI32_Test.BuildKDTreeWithCluster(TKDT21DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT21DI32_Test.Search(TKDT21DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT21DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT21DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT21DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT22DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT22DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT22DI32_Node;
function SortCompare(const p1, p2: PKDT22DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT22DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT22DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT22DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT22DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT22DI32.GetData(const Index: NativeInt): PKDT22DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT22DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT22DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT22DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT22DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT22DI32.StoreBuffPtr: PKDT22DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT22DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT22DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT22DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT22DI32.BuildKDTreeWithCluster(const inBuff: TKDT22DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT22DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT22DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT22DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT22DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT22DI32.BuildKDTreeWithCluster(const inBuff: TKDT22DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT22DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildCall);
var
TempStoreBuff: TKDT22DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT22DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT22DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT22DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT22DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT22DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildMethod);
var
TempStoreBuff: TKDT22DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT22DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT22DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT22DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT22DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT22DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT22DI32_BuildProc);
var
TempStoreBuff: TKDT22DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT22DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT22DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT22DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT22DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT22DI32.Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT22DI32_Node;
var
NearestNeighbour: PKDT22DI32_Node;
function FindParentNode(const buffPtr: PKDT22DI32_Vec; NodePtr: PKDT22DI32_Node): PKDT22DI32_Node;
var
Next: PKDT22DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT22DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT22DI32_Node; const buffPtr: PKDT22DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT22DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT22DI32_Vec; const p1, p2: PKDT22DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT22DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT22DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT22DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT22DI32_Node(NearestNodes[0]);
end;
end;
function TKDT22DI32.Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT22DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT22DI32.Search(const buff: TKDT22DI32_Vec; var SearchedDistanceMin: Double): PKDT22DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT22DI32.Search(const buff: TKDT22DI32_Vec): PKDT22DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT22DI32.SearchToken(const buff: TKDT22DI32_Vec): TPascalString;
var
p: PKDT22DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT22DI32.Search(const inBuff: TKDT22DI32_DynamicVecBuffer; var OutBuff: TKDT22DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT22DI32_DynamicVecBuffer;
outBuffPtr: PKDT22DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT22DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT22DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT22DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT22DI32.Search(const inBuff: TKDT22DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT22DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT22DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT22DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT22DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT22DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT22DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT22DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT22DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT22DI32_Vec)) <> SizeOf(TKDT22DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT22DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT22DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT22DI32.PrintNodeTree(const NodePtr: PKDT22DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT22DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT22DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT22DI32.Vec(const s: SystemString): TKDT22DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT22DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT22DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT22DI32.Vec(const v: TKDT22DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT22DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT22DI32.Distance(const v1, v2: TKDT22DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT22DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT22DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT22DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT22DI32.Test;
var
TKDT22DI32_Test: TKDT22DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT22DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT22DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT22DI32_Test := TKDT22DI32.Create;
n.Append('...');
SetLength(TKDT22DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT22DI32_Test.TestBuff) - 1 do
for j := 0 to KDT22DI32_Axis - 1 do
TKDT22DI32_Test.TestBuff[i][j] := i * KDT22DI32_Axis + j;
{$IFDEF FPC}
TKDT22DI32_Test.BuildKDTreeM(length(TKDT22DI32_Test.TestBuff), nil, @TKDT22DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT22DI32_Test.BuildKDTreeM(length(TKDT22DI32_Test.TestBuff), nil, TKDT22DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT22DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT22DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT22DI32_Test.TestBuff) - 1 do
begin
p := TKDT22DI32_Test.Search(TKDT22DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT22DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT22DI32_Test.TestBuff));
TKDT22DI32_Test.Search(TKDT22DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT22DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT22DI32_Test.Clear;
{ kMean test }
TKDT22DI32_Test.BuildKDTreeWithCluster(TKDT22DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT22DI32_Test.Search(TKDT22DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT22DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT22DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT22DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT23DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT23DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT23DI32_Node;
function SortCompare(const p1, p2: PKDT23DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT23DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT23DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT23DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT23DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT23DI32.GetData(const Index: NativeInt): PKDT23DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT23DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT23DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT23DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT23DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT23DI32.StoreBuffPtr: PKDT23DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT23DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT23DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT23DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT23DI32.BuildKDTreeWithCluster(const inBuff: TKDT23DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT23DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT23DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT23DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT23DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT23DI32.BuildKDTreeWithCluster(const inBuff: TKDT23DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT23DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildCall);
var
TempStoreBuff: TKDT23DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT23DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT23DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT23DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT23DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT23DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildMethod);
var
TempStoreBuff: TKDT23DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT23DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT23DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT23DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT23DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT23DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT23DI32_BuildProc);
var
TempStoreBuff: TKDT23DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT23DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT23DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT23DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT23DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT23DI32.Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT23DI32_Node;
var
NearestNeighbour: PKDT23DI32_Node;
function FindParentNode(const buffPtr: PKDT23DI32_Vec; NodePtr: PKDT23DI32_Node): PKDT23DI32_Node;
var
Next: PKDT23DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT23DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT23DI32_Node; const buffPtr: PKDT23DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT23DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT23DI32_Vec; const p1, p2: PKDT23DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT23DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT23DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT23DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT23DI32_Node(NearestNodes[0]);
end;
end;
function TKDT23DI32.Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT23DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT23DI32.Search(const buff: TKDT23DI32_Vec; var SearchedDistanceMin: Double): PKDT23DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT23DI32.Search(const buff: TKDT23DI32_Vec): PKDT23DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT23DI32.SearchToken(const buff: TKDT23DI32_Vec): TPascalString;
var
p: PKDT23DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT23DI32.Search(const inBuff: TKDT23DI32_DynamicVecBuffer; var OutBuff: TKDT23DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT23DI32_DynamicVecBuffer;
outBuffPtr: PKDT23DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT23DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT23DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT23DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT23DI32.Search(const inBuff: TKDT23DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT23DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT23DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT23DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT23DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT23DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT23DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT23DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT23DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT23DI32_Vec)) <> SizeOf(TKDT23DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT23DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT23DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT23DI32.PrintNodeTree(const NodePtr: PKDT23DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT23DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT23DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT23DI32.Vec(const s: SystemString): TKDT23DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT23DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT23DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT23DI32.Vec(const v: TKDT23DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT23DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT23DI32.Distance(const v1, v2: TKDT23DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT23DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT23DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT23DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT23DI32.Test;
var
TKDT23DI32_Test: TKDT23DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT23DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT23DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT23DI32_Test := TKDT23DI32.Create;
n.Append('...');
SetLength(TKDT23DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT23DI32_Test.TestBuff) - 1 do
for j := 0 to KDT23DI32_Axis - 1 do
TKDT23DI32_Test.TestBuff[i][j] := i * KDT23DI32_Axis + j;
{$IFDEF FPC}
TKDT23DI32_Test.BuildKDTreeM(length(TKDT23DI32_Test.TestBuff), nil, @TKDT23DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT23DI32_Test.BuildKDTreeM(length(TKDT23DI32_Test.TestBuff), nil, TKDT23DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT23DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT23DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT23DI32_Test.TestBuff) - 1 do
begin
p := TKDT23DI32_Test.Search(TKDT23DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT23DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT23DI32_Test.TestBuff));
TKDT23DI32_Test.Search(TKDT23DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT23DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT23DI32_Test.Clear;
{ kMean test }
TKDT23DI32_Test.BuildKDTreeWithCluster(TKDT23DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT23DI32_Test.Search(TKDT23DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT23DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT23DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT23DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT24DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT24DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT24DI32_Node;
function SortCompare(const p1, p2: PKDT24DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT24DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT24DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT24DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT24DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT24DI32.GetData(const Index: NativeInt): PKDT24DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT24DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT24DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT24DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT24DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT24DI32.StoreBuffPtr: PKDT24DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT24DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT24DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT24DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT24DI32.BuildKDTreeWithCluster(const inBuff: TKDT24DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT24DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT24DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT24DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT24DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT24DI32.BuildKDTreeWithCluster(const inBuff: TKDT24DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT24DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildCall);
var
TempStoreBuff: TKDT24DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT24DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT24DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT24DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT24DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT24DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildMethod);
var
TempStoreBuff: TKDT24DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT24DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT24DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT24DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT24DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT24DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT24DI32_BuildProc);
var
TempStoreBuff: TKDT24DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT24DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT24DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT24DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT24DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT24DI32.Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT24DI32_Node;
var
NearestNeighbour: PKDT24DI32_Node;
function FindParentNode(const buffPtr: PKDT24DI32_Vec; NodePtr: PKDT24DI32_Node): PKDT24DI32_Node;
var
Next: PKDT24DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT24DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT24DI32_Node; const buffPtr: PKDT24DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT24DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT24DI32_Vec; const p1, p2: PKDT24DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT24DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT24DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT24DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT24DI32_Node(NearestNodes[0]);
end;
end;
function TKDT24DI32.Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT24DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT24DI32.Search(const buff: TKDT24DI32_Vec; var SearchedDistanceMin: Double): PKDT24DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT24DI32.Search(const buff: TKDT24DI32_Vec): PKDT24DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT24DI32.SearchToken(const buff: TKDT24DI32_Vec): TPascalString;
var
p: PKDT24DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT24DI32.Search(const inBuff: TKDT24DI32_DynamicVecBuffer; var OutBuff: TKDT24DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT24DI32_DynamicVecBuffer;
outBuffPtr: PKDT24DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT24DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT24DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT24DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT24DI32.Search(const inBuff: TKDT24DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT24DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT24DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT24DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT24DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT24DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT24DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT24DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT24DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT24DI32_Vec)) <> SizeOf(TKDT24DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT24DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT24DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT24DI32.PrintNodeTree(const NodePtr: PKDT24DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT24DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT24DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT24DI32.Vec(const s: SystemString): TKDT24DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT24DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT24DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT24DI32.Vec(const v: TKDT24DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT24DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT24DI32.Distance(const v1, v2: TKDT24DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT24DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT24DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT24DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT24DI32.Test;
var
TKDT24DI32_Test: TKDT24DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT24DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT24DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT24DI32_Test := TKDT24DI32.Create;
n.Append('...');
SetLength(TKDT24DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT24DI32_Test.TestBuff) - 1 do
for j := 0 to KDT24DI32_Axis - 1 do
TKDT24DI32_Test.TestBuff[i][j] := i * KDT24DI32_Axis + j;
{$IFDEF FPC}
TKDT24DI32_Test.BuildKDTreeM(length(TKDT24DI32_Test.TestBuff), nil, @TKDT24DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT24DI32_Test.BuildKDTreeM(length(TKDT24DI32_Test.TestBuff), nil, TKDT24DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT24DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT24DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT24DI32_Test.TestBuff) - 1 do
begin
p := TKDT24DI32_Test.Search(TKDT24DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT24DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT24DI32_Test.TestBuff));
TKDT24DI32_Test.Search(TKDT24DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT24DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT24DI32_Test.Clear;
{ kMean test }
TKDT24DI32_Test.BuildKDTreeWithCluster(TKDT24DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT24DI32_Test.Search(TKDT24DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT24DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT24DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT24DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT48DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT48DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT48DI32_Node;
function SortCompare(const p1, p2: PKDT48DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT48DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT48DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT48DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT48DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT48DI32.GetData(const Index: NativeInt): PKDT48DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT48DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT48DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT48DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT48DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT48DI32.StoreBuffPtr: PKDT48DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT48DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT48DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT48DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT48DI32.BuildKDTreeWithCluster(const inBuff: TKDT48DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT48DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT48DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT48DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT48DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT48DI32.BuildKDTreeWithCluster(const inBuff: TKDT48DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT48DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildCall);
var
TempStoreBuff: TKDT48DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT48DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT48DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT48DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT48DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT48DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildMethod);
var
TempStoreBuff: TKDT48DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT48DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT48DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT48DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT48DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT48DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT48DI32_BuildProc);
var
TempStoreBuff: TKDT48DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT48DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT48DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT48DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT48DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT48DI32.Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT48DI32_Node;
var
NearestNeighbour: PKDT48DI32_Node;
function FindParentNode(const buffPtr: PKDT48DI32_Vec; NodePtr: PKDT48DI32_Node): PKDT48DI32_Node;
var
Next: PKDT48DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT48DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT48DI32_Node; const buffPtr: PKDT48DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT48DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT48DI32_Vec; const p1, p2: PKDT48DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT48DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT48DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT48DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT48DI32_Node(NearestNodes[0]);
end;
end;
function TKDT48DI32.Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT48DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT48DI32.Search(const buff: TKDT48DI32_Vec; var SearchedDistanceMin: Double): PKDT48DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT48DI32.Search(const buff: TKDT48DI32_Vec): PKDT48DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT48DI32.SearchToken(const buff: TKDT48DI32_Vec): TPascalString;
var
p: PKDT48DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT48DI32.Search(const inBuff: TKDT48DI32_DynamicVecBuffer; var OutBuff: TKDT48DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT48DI32_DynamicVecBuffer;
outBuffPtr: PKDT48DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT48DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT48DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT48DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT48DI32.Search(const inBuff: TKDT48DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT48DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT48DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT48DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT48DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT48DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT48DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT48DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT48DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT48DI32_Vec)) <> SizeOf(TKDT48DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT48DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT48DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT48DI32.PrintNodeTree(const NodePtr: PKDT48DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT48DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT48DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT48DI32.Vec(const s: SystemString): TKDT48DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT48DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT48DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT48DI32.Vec(const v: TKDT48DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT48DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT48DI32.Distance(const v1, v2: TKDT48DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT48DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT48DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT48DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT48DI32.Test;
var
TKDT48DI32_Test: TKDT48DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT48DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT48DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT48DI32_Test := TKDT48DI32.Create;
n.Append('...');
SetLength(TKDT48DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT48DI32_Test.TestBuff) - 1 do
for j := 0 to KDT48DI32_Axis - 1 do
TKDT48DI32_Test.TestBuff[i][j] := i * KDT48DI32_Axis + j;
{$IFDEF FPC}
TKDT48DI32_Test.BuildKDTreeM(length(TKDT48DI32_Test.TestBuff), nil, @TKDT48DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT48DI32_Test.BuildKDTreeM(length(TKDT48DI32_Test.TestBuff), nil, TKDT48DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT48DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT48DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT48DI32_Test.TestBuff) - 1 do
begin
p := TKDT48DI32_Test.Search(TKDT48DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT48DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT48DI32_Test.TestBuff));
TKDT48DI32_Test.Search(TKDT48DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT48DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT48DI32_Test.Clear;
{ kMean test }
TKDT48DI32_Test.BuildKDTreeWithCluster(TKDT48DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT48DI32_Test.Search(TKDT48DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT48DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT48DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT48DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT52DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT52DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT52DI32_Node;
function SortCompare(const p1, p2: PKDT52DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT52DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT52DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT52DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT52DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT52DI32.GetData(const Index: NativeInt): PKDT52DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT52DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT52DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT52DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT52DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT52DI32.StoreBuffPtr: PKDT52DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT52DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT52DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT52DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT52DI32.BuildKDTreeWithCluster(const inBuff: TKDT52DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT52DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT52DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT52DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT52DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT52DI32.BuildKDTreeWithCluster(const inBuff: TKDT52DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT52DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildCall);
var
TempStoreBuff: TKDT52DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT52DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT52DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT52DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT52DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT52DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildMethod);
var
TempStoreBuff: TKDT52DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT52DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT52DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT52DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT52DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT52DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT52DI32_BuildProc);
var
TempStoreBuff: TKDT52DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT52DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT52DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT52DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT52DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT52DI32.Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT52DI32_Node;
var
NearestNeighbour: PKDT52DI32_Node;
function FindParentNode(const buffPtr: PKDT52DI32_Vec; NodePtr: PKDT52DI32_Node): PKDT52DI32_Node;
var
Next: PKDT52DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT52DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT52DI32_Node; const buffPtr: PKDT52DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT52DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT52DI32_Vec; const p1, p2: PKDT52DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT52DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT52DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT52DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT52DI32_Node(NearestNodes[0]);
end;
end;
function TKDT52DI32.Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT52DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT52DI32.Search(const buff: TKDT52DI32_Vec; var SearchedDistanceMin: Double): PKDT52DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT52DI32.Search(const buff: TKDT52DI32_Vec): PKDT52DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT52DI32.SearchToken(const buff: TKDT52DI32_Vec): TPascalString;
var
p: PKDT52DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT52DI32.Search(const inBuff: TKDT52DI32_DynamicVecBuffer; var OutBuff: TKDT52DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT52DI32_DynamicVecBuffer;
outBuffPtr: PKDT52DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT52DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT52DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT52DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT52DI32.Search(const inBuff: TKDT52DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT52DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT52DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT52DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT52DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT52DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT52DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT52DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT52DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT52DI32_Vec)) <> SizeOf(TKDT52DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT52DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT52DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT52DI32.PrintNodeTree(const NodePtr: PKDT52DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT52DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT52DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT52DI32.Vec(const s: SystemString): TKDT52DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT52DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT52DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT52DI32.Vec(const v: TKDT52DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT52DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT52DI32.Distance(const v1, v2: TKDT52DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT52DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT52DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT52DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT52DI32.Test;
var
TKDT52DI32_Test: TKDT52DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT52DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT52DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT52DI32_Test := TKDT52DI32.Create;
n.Append('...');
SetLength(TKDT52DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT52DI32_Test.TestBuff) - 1 do
for j := 0 to KDT52DI32_Axis - 1 do
TKDT52DI32_Test.TestBuff[i][j] := i * KDT52DI32_Axis + j;
{$IFDEF FPC}
TKDT52DI32_Test.BuildKDTreeM(length(TKDT52DI32_Test.TestBuff), nil, @TKDT52DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT52DI32_Test.BuildKDTreeM(length(TKDT52DI32_Test.TestBuff), nil, TKDT52DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT52DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT52DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT52DI32_Test.TestBuff) - 1 do
begin
p := TKDT52DI32_Test.Search(TKDT52DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT52DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT52DI32_Test.TestBuff));
TKDT52DI32_Test.Search(TKDT52DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT52DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT52DI32_Test.Clear;
{ kMean test }
TKDT52DI32_Test.BuildKDTreeWithCluster(TKDT52DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT52DI32_Test.Search(TKDT52DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT52DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT52DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT52DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT64DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT64DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT64DI32_Node;
function SortCompare(const p1, p2: PKDT64DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT64DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT64DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT64DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT64DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT64DI32.GetData(const Index: NativeInt): PKDT64DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT64DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT64DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT64DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT64DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT64DI32.StoreBuffPtr: PKDT64DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT64DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT64DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT64DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT64DI32.BuildKDTreeWithCluster(const inBuff: TKDT64DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT64DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT64DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT64DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT64DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT64DI32.BuildKDTreeWithCluster(const inBuff: TKDT64DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT64DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildCall);
var
TempStoreBuff: TKDT64DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT64DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT64DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT64DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT64DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT64DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildMethod);
var
TempStoreBuff: TKDT64DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT64DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT64DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT64DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT64DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT64DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT64DI32_BuildProc);
var
TempStoreBuff: TKDT64DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT64DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT64DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT64DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT64DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT64DI32.Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT64DI32_Node;
var
NearestNeighbour: PKDT64DI32_Node;
function FindParentNode(const buffPtr: PKDT64DI32_Vec; NodePtr: PKDT64DI32_Node): PKDT64DI32_Node;
var
Next: PKDT64DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT64DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT64DI32_Node; const buffPtr: PKDT64DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT64DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT64DI32_Vec; const p1, p2: PKDT64DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT64DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT64DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT64DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT64DI32_Node(NearestNodes[0]);
end;
end;
function TKDT64DI32.Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT64DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT64DI32.Search(const buff: TKDT64DI32_Vec; var SearchedDistanceMin: Double): PKDT64DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT64DI32.Search(const buff: TKDT64DI32_Vec): PKDT64DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT64DI32.SearchToken(const buff: TKDT64DI32_Vec): TPascalString;
var
p: PKDT64DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT64DI32.Search(const inBuff: TKDT64DI32_DynamicVecBuffer; var OutBuff: TKDT64DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT64DI32_DynamicVecBuffer;
outBuffPtr: PKDT64DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT64DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT64DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT64DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT64DI32.Search(const inBuff: TKDT64DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT64DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT64DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT64DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT64DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT64DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT64DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT64DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT64DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT64DI32_Vec)) <> SizeOf(TKDT64DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT64DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT64DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT64DI32.PrintNodeTree(const NodePtr: PKDT64DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT64DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT64DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT64DI32.Vec(const s: SystemString): TKDT64DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT64DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT64DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT64DI32.Vec(const v: TKDT64DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT64DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT64DI32.Distance(const v1, v2: TKDT64DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT64DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT64DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT64DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT64DI32.Test;
var
TKDT64DI32_Test: TKDT64DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT64DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT64DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT64DI32_Test := TKDT64DI32.Create;
n.Append('...');
SetLength(TKDT64DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT64DI32_Test.TestBuff) - 1 do
for j := 0 to KDT64DI32_Axis - 1 do
TKDT64DI32_Test.TestBuff[i][j] := i * KDT64DI32_Axis + j;
{$IFDEF FPC}
TKDT64DI32_Test.BuildKDTreeM(length(TKDT64DI32_Test.TestBuff), nil, @TKDT64DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT64DI32_Test.BuildKDTreeM(length(TKDT64DI32_Test.TestBuff), nil, TKDT64DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT64DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT64DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT64DI32_Test.TestBuff) - 1 do
begin
p := TKDT64DI32_Test.Search(TKDT64DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT64DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT64DI32_Test.TestBuff));
TKDT64DI32_Test.Search(TKDT64DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT64DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT64DI32_Test.Clear;
{ kMean test }
TKDT64DI32_Test.BuildKDTreeWithCluster(TKDT64DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT64DI32_Test.Search(TKDT64DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT64DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT64DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT64DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT96DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT96DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT96DI32_Node;
function SortCompare(const p1, p2: PKDT96DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT96DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT96DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT96DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT96DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT96DI32.GetData(const Index: NativeInt): PKDT96DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT96DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT96DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT96DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT96DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT96DI32.StoreBuffPtr: PKDT96DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT96DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT96DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT96DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT96DI32.BuildKDTreeWithCluster(const inBuff: TKDT96DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT96DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT96DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT96DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT96DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT96DI32.BuildKDTreeWithCluster(const inBuff: TKDT96DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT96DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildCall);
var
TempStoreBuff: TKDT96DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT96DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT96DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT96DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT96DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT96DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildMethod);
var
TempStoreBuff: TKDT96DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT96DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT96DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT96DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT96DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT96DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT96DI32_BuildProc);
var
TempStoreBuff: TKDT96DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT96DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT96DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT96DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT96DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT96DI32.Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT96DI32_Node;
var
NearestNeighbour: PKDT96DI32_Node;
function FindParentNode(const buffPtr: PKDT96DI32_Vec; NodePtr: PKDT96DI32_Node): PKDT96DI32_Node;
var
Next: PKDT96DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT96DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT96DI32_Node; const buffPtr: PKDT96DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT96DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT96DI32_Vec; const p1, p2: PKDT96DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT96DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT96DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT96DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT96DI32_Node(NearestNodes[0]);
end;
end;
function TKDT96DI32.Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT96DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT96DI32.Search(const buff: TKDT96DI32_Vec; var SearchedDistanceMin: Double): PKDT96DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT96DI32.Search(const buff: TKDT96DI32_Vec): PKDT96DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT96DI32.SearchToken(const buff: TKDT96DI32_Vec): TPascalString;
var
p: PKDT96DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT96DI32.Search(const inBuff: TKDT96DI32_DynamicVecBuffer; var OutBuff: TKDT96DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT96DI32_DynamicVecBuffer;
outBuffPtr: PKDT96DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT96DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT96DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT96DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT96DI32.Search(const inBuff: TKDT96DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT96DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT96DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT96DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT96DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT96DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT96DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT96DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT96DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT96DI32_Vec)) <> SizeOf(TKDT96DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT96DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT96DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT96DI32.PrintNodeTree(const NodePtr: PKDT96DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT96DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT96DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT96DI32.Vec(const s: SystemString): TKDT96DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT96DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT96DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT96DI32.Vec(const v: TKDT96DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT96DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT96DI32.Distance(const v1, v2: TKDT96DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT96DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT96DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT96DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT96DI32.Test;
var
TKDT96DI32_Test: TKDT96DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT96DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT96DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT96DI32_Test := TKDT96DI32.Create;
n.Append('...');
SetLength(TKDT96DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT96DI32_Test.TestBuff) - 1 do
for j := 0 to KDT96DI32_Axis - 1 do
TKDT96DI32_Test.TestBuff[i][j] := i * KDT96DI32_Axis + j;
{$IFDEF FPC}
TKDT96DI32_Test.BuildKDTreeM(length(TKDT96DI32_Test.TestBuff), nil, @TKDT96DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT96DI32_Test.BuildKDTreeM(length(TKDT96DI32_Test.TestBuff), nil, TKDT96DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT96DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT96DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT96DI32_Test.TestBuff) - 1 do
begin
p := TKDT96DI32_Test.Search(TKDT96DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT96DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT96DI32_Test.TestBuff));
TKDT96DI32_Test.Search(TKDT96DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT96DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT96DI32_Test.Clear;
{ kMean test }
TKDT96DI32_Test.BuildKDTreeWithCluster(TKDT96DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT96DI32_Test.Search(TKDT96DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT96DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT96DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT96DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT128DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT128DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT128DI32_Node;
function SortCompare(const p1, p2: PKDT128DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT128DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT128DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT128DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT128DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT128DI32.GetData(const Index: NativeInt): PKDT128DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT128DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT128DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT128DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT128DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT128DI32.StoreBuffPtr: PKDT128DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT128DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT128DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT128DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT128DI32.BuildKDTreeWithCluster(const inBuff: TKDT128DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT128DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT128DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT128DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT128DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT128DI32.BuildKDTreeWithCluster(const inBuff: TKDT128DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT128DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildCall);
var
TempStoreBuff: TKDT128DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT128DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT128DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT128DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT128DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT128DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildMethod);
var
TempStoreBuff: TKDT128DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT128DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT128DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT128DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT128DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT128DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT128DI32_BuildProc);
var
TempStoreBuff: TKDT128DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT128DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT128DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT128DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT128DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT128DI32.Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT128DI32_Node;
var
NearestNeighbour: PKDT128DI32_Node;
function FindParentNode(const buffPtr: PKDT128DI32_Vec; NodePtr: PKDT128DI32_Node): PKDT128DI32_Node;
var
Next: PKDT128DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT128DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT128DI32_Node; const buffPtr: PKDT128DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT128DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT128DI32_Vec; const p1, p2: PKDT128DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT128DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT128DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT128DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT128DI32_Node(NearestNodes[0]);
end;
end;
function TKDT128DI32.Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT128DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT128DI32.Search(const buff: TKDT128DI32_Vec; var SearchedDistanceMin: Double): PKDT128DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT128DI32.Search(const buff: TKDT128DI32_Vec): PKDT128DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT128DI32.SearchToken(const buff: TKDT128DI32_Vec): TPascalString;
var
p: PKDT128DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT128DI32.Search(const inBuff: TKDT128DI32_DynamicVecBuffer; var OutBuff: TKDT128DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT128DI32_DynamicVecBuffer;
outBuffPtr: PKDT128DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT128DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT128DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT128DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT128DI32.Search(const inBuff: TKDT128DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT128DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT128DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT128DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT128DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT128DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT128DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT128DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT128DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT128DI32_Vec)) <> SizeOf(TKDT128DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT128DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT128DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT128DI32.PrintNodeTree(const NodePtr: PKDT128DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT128DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT128DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT128DI32.Vec(const s: SystemString): TKDT128DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT128DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT128DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT128DI32.Vec(const v: TKDT128DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT128DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT128DI32.Distance(const v1, v2: TKDT128DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT128DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT128DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT128DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT128DI32.Test;
var
TKDT128DI32_Test: TKDT128DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT128DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT128DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT128DI32_Test := TKDT128DI32.Create;
n.Append('...');
SetLength(TKDT128DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT128DI32_Test.TestBuff) - 1 do
for j := 0 to KDT128DI32_Axis - 1 do
TKDT128DI32_Test.TestBuff[i][j] := i * KDT128DI32_Axis + j;
{$IFDEF FPC}
TKDT128DI32_Test.BuildKDTreeM(length(TKDT128DI32_Test.TestBuff), nil, @TKDT128DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT128DI32_Test.BuildKDTreeM(length(TKDT128DI32_Test.TestBuff), nil, TKDT128DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT128DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT128DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT128DI32_Test.TestBuff) - 1 do
begin
p := TKDT128DI32_Test.Search(TKDT128DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT128DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT128DI32_Test.TestBuff));
TKDT128DI32_Test.Search(TKDT128DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT128DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT128DI32_Test.Clear;
{ kMean test }
TKDT128DI32_Test.BuildKDTreeWithCluster(TKDT128DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT128DI32_Test.Search(TKDT128DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT128DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT128DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT128DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT156DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT156DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT156DI32_Node;
function SortCompare(const p1, p2: PKDT156DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT156DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT156DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT156DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT156DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT156DI32.GetData(const Index: NativeInt): PKDT156DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT156DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT156DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT156DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT156DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT156DI32.StoreBuffPtr: PKDT156DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT156DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT156DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT156DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT156DI32.BuildKDTreeWithCluster(const inBuff: TKDT156DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT156DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT156DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT156DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT156DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT156DI32.BuildKDTreeWithCluster(const inBuff: TKDT156DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT156DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildCall);
var
TempStoreBuff: TKDT156DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT156DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT156DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT156DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT156DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT156DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildMethod);
var
TempStoreBuff: TKDT156DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT156DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT156DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT156DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT156DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT156DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT156DI32_BuildProc);
var
TempStoreBuff: TKDT156DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT156DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT156DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT156DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT156DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT156DI32.Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT156DI32_Node;
var
NearestNeighbour: PKDT156DI32_Node;
function FindParentNode(const buffPtr: PKDT156DI32_Vec; NodePtr: PKDT156DI32_Node): PKDT156DI32_Node;
var
Next: PKDT156DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT156DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT156DI32_Node; const buffPtr: PKDT156DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT156DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT156DI32_Vec; const p1, p2: PKDT156DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT156DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT156DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT156DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT156DI32_Node(NearestNodes[0]);
end;
end;
function TKDT156DI32.Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT156DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT156DI32.Search(const buff: TKDT156DI32_Vec; var SearchedDistanceMin: Double): PKDT156DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT156DI32.Search(const buff: TKDT156DI32_Vec): PKDT156DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT156DI32.SearchToken(const buff: TKDT156DI32_Vec): TPascalString;
var
p: PKDT156DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT156DI32.Search(const inBuff: TKDT156DI32_DynamicVecBuffer; var OutBuff: TKDT156DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT156DI32_DynamicVecBuffer;
outBuffPtr: PKDT156DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT156DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT156DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT156DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT156DI32.Search(const inBuff: TKDT156DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT156DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT156DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT156DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT156DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT156DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT156DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT156DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT156DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT156DI32_Vec)) <> SizeOf(TKDT156DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT156DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT156DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT156DI32.PrintNodeTree(const NodePtr: PKDT156DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT156DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT156DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT156DI32.Vec(const s: SystemString): TKDT156DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT156DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT156DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT156DI32.Vec(const v: TKDT156DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT156DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT156DI32.Distance(const v1, v2: TKDT156DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT156DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT156DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT156DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT156DI32.Test;
var
TKDT156DI32_Test: TKDT156DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT156DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT156DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT156DI32_Test := TKDT156DI32.Create;
n.Append('...');
SetLength(TKDT156DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT156DI32_Test.TestBuff) - 1 do
for j := 0 to KDT156DI32_Axis - 1 do
TKDT156DI32_Test.TestBuff[i][j] := i * KDT156DI32_Axis + j;
{$IFDEF FPC}
TKDT156DI32_Test.BuildKDTreeM(length(TKDT156DI32_Test.TestBuff), nil, @TKDT156DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT156DI32_Test.BuildKDTreeM(length(TKDT156DI32_Test.TestBuff), nil, TKDT156DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT156DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT156DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT156DI32_Test.TestBuff) - 1 do
begin
p := TKDT156DI32_Test.Search(TKDT156DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT156DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT156DI32_Test.TestBuff));
TKDT156DI32_Test.Search(TKDT156DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT156DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT156DI32_Test.Clear;
{ kMean test }
TKDT156DI32_Test.BuildKDTreeWithCluster(TKDT156DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT156DI32_Test.Search(TKDT156DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT156DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT156DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT156DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT192DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT192DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT192DI32_Node;
function SortCompare(const p1, p2: PKDT192DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT192DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT192DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT192DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT192DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT192DI32.GetData(const Index: NativeInt): PKDT192DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT192DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT192DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT192DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT192DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT192DI32.StoreBuffPtr: PKDT192DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT192DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT192DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT192DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT192DI32.BuildKDTreeWithCluster(const inBuff: TKDT192DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT192DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT192DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT192DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT192DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT192DI32.BuildKDTreeWithCluster(const inBuff: TKDT192DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT192DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildCall);
var
TempStoreBuff: TKDT192DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT192DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT192DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT192DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT192DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT192DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildMethod);
var
TempStoreBuff: TKDT192DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT192DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT192DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT192DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT192DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT192DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT192DI32_BuildProc);
var
TempStoreBuff: TKDT192DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT192DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT192DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT192DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT192DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT192DI32.Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT192DI32_Node;
var
NearestNeighbour: PKDT192DI32_Node;
function FindParentNode(const buffPtr: PKDT192DI32_Vec; NodePtr: PKDT192DI32_Node): PKDT192DI32_Node;
var
Next: PKDT192DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT192DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT192DI32_Node; const buffPtr: PKDT192DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT192DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT192DI32_Vec; const p1, p2: PKDT192DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT192DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT192DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT192DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT192DI32_Node(NearestNodes[0]);
end;
end;
function TKDT192DI32.Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT192DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT192DI32.Search(const buff: TKDT192DI32_Vec; var SearchedDistanceMin: Double): PKDT192DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT192DI32.Search(const buff: TKDT192DI32_Vec): PKDT192DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT192DI32.SearchToken(const buff: TKDT192DI32_Vec): TPascalString;
var
p: PKDT192DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT192DI32.Search(const inBuff: TKDT192DI32_DynamicVecBuffer; var OutBuff: TKDT192DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT192DI32_DynamicVecBuffer;
outBuffPtr: PKDT192DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT192DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT192DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT192DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT192DI32.Search(const inBuff: TKDT192DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT192DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT192DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT192DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT192DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT192DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT192DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT192DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT192DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT192DI32_Vec)) <> SizeOf(TKDT192DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT192DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT192DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT192DI32.PrintNodeTree(const NodePtr: PKDT192DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT192DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT192DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT192DI32.Vec(const s: SystemString): TKDT192DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT192DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT192DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT192DI32.Vec(const v: TKDT192DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT192DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT192DI32.Distance(const v1, v2: TKDT192DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT192DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT192DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT192DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT192DI32.Test;
var
TKDT192DI32_Test: TKDT192DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT192DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT192DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT192DI32_Test := TKDT192DI32.Create;
n.Append('...');
SetLength(TKDT192DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT192DI32_Test.TestBuff) - 1 do
for j := 0 to KDT192DI32_Axis - 1 do
TKDT192DI32_Test.TestBuff[i][j] := i * KDT192DI32_Axis + j;
{$IFDEF FPC}
TKDT192DI32_Test.BuildKDTreeM(length(TKDT192DI32_Test.TestBuff), nil, @TKDT192DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT192DI32_Test.BuildKDTreeM(length(TKDT192DI32_Test.TestBuff), nil, TKDT192DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT192DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT192DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT192DI32_Test.TestBuff) - 1 do
begin
p := TKDT192DI32_Test.Search(TKDT192DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT192DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT192DI32_Test.TestBuff));
TKDT192DI32_Test.Search(TKDT192DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT192DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT192DI32_Test.Clear;
{ kMean test }
TKDT192DI32_Test.BuildKDTreeWithCluster(TKDT192DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT192DI32_Test.Search(TKDT192DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT192DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT192DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT192DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT256DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT256DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT256DI32_Node;
function SortCompare(const p1, p2: PKDT256DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT256DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT256DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT256DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT256DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT256DI32.GetData(const Index: NativeInt): PKDT256DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT256DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT256DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT256DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT256DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT256DI32.StoreBuffPtr: PKDT256DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT256DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT256DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT256DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT256DI32.BuildKDTreeWithCluster(const inBuff: TKDT256DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT256DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT256DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT256DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT256DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT256DI32.BuildKDTreeWithCluster(const inBuff: TKDT256DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT256DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildCall);
var
TempStoreBuff: TKDT256DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT256DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT256DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT256DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT256DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT256DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildMethod);
var
TempStoreBuff: TKDT256DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT256DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT256DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT256DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT256DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT256DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT256DI32_BuildProc);
var
TempStoreBuff: TKDT256DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT256DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT256DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT256DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT256DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT256DI32.Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT256DI32_Node;
var
NearestNeighbour: PKDT256DI32_Node;
function FindParentNode(const buffPtr: PKDT256DI32_Vec; NodePtr: PKDT256DI32_Node): PKDT256DI32_Node;
var
Next: PKDT256DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT256DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT256DI32_Node; const buffPtr: PKDT256DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT256DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT256DI32_Vec; const p1, p2: PKDT256DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT256DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT256DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT256DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT256DI32_Node(NearestNodes[0]);
end;
end;
function TKDT256DI32.Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT256DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT256DI32.Search(const buff: TKDT256DI32_Vec; var SearchedDistanceMin: Double): PKDT256DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT256DI32.Search(const buff: TKDT256DI32_Vec): PKDT256DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT256DI32.SearchToken(const buff: TKDT256DI32_Vec): TPascalString;
var
p: PKDT256DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT256DI32.Search(const inBuff: TKDT256DI32_DynamicVecBuffer; var OutBuff: TKDT256DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT256DI32_DynamicVecBuffer;
outBuffPtr: PKDT256DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT256DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT256DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT256DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT256DI32.Search(const inBuff: TKDT256DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT256DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT256DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT256DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT256DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT256DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT256DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT256DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT256DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT256DI32_Vec)) <> SizeOf(TKDT256DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT256DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT256DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT256DI32.PrintNodeTree(const NodePtr: PKDT256DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT256DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT256DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT256DI32.Vec(const s: SystemString): TKDT256DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT256DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT256DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT256DI32.Vec(const v: TKDT256DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT256DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT256DI32.Distance(const v1, v2: TKDT256DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT256DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT256DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT256DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT256DI32.Test;
var
TKDT256DI32_Test: TKDT256DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT256DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT256DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT256DI32_Test := TKDT256DI32.Create;
n.Append('...');
SetLength(TKDT256DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT256DI32_Test.TestBuff) - 1 do
for j := 0 to KDT256DI32_Axis - 1 do
TKDT256DI32_Test.TestBuff[i][j] := i * KDT256DI32_Axis + j;
{$IFDEF FPC}
TKDT256DI32_Test.BuildKDTreeM(length(TKDT256DI32_Test.TestBuff), nil, @TKDT256DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT256DI32_Test.BuildKDTreeM(length(TKDT256DI32_Test.TestBuff), nil, TKDT256DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT256DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT256DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT256DI32_Test.TestBuff) - 1 do
begin
p := TKDT256DI32_Test.Search(TKDT256DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT256DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT256DI32_Test.TestBuff));
TKDT256DI32_Test.Search(TKDT256DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT256DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT256DI32_Test.Clear;
{ kMean test }
TKDT256DI32_Test.BuildKDTreeWithCluster(TKDT256DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT256DI32_Test.Search(TKDT256DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT256DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT256DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT256DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT384DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT384DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT384DI32_Node;
function SortCompare(const p1, p2: PKDT384DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT384DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT384DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT384DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT384DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT384DI32.GetData(const Index: NativeInt): PKDT384DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT384DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT384DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT384DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT384DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT384DI32.StoreBuffPtr: PKDT384DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT384DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT384DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT384DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT384DI32.BuildKDTreeWithCluster(const inBuff: TKDT384DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT384DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT384DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT384DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT384DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT384DI32.BuildKDTreeWithCluster(const inBuff: TKDT384DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT384DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildCall);
var
TempStoreBuff: TKDT384DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT384DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT384DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT384DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT384DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT384DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildMethod);
var
TempStoreBuff: TKDT384DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT384DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT384DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT384DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT384DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT384DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT384DI32_BuildProc);
var
TempStoreBuff: TKDT384DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT384DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT384DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT384DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT384DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT384DI32.Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT384DI32_Node;
var
NearestNeighbour: PKDT384DI32_Node;
function FindParentNode(const buffPtr: PKDT384DI32_Vec; NodePtr: PKDT384DI32_Node): PKDT384DI32_Node;
var
Next: PKDT384DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT384DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT384DI32_Node; const buffPtr: PKDT384DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT384DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT384DI32_Vec; const p1, p2: PKDT384DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT384DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT384DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT384DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT384DI32_Node(NearestNodes[0]);
end;
end;
function TKDT384DI32.Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT384DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT384DI32.Search(const buff: TKDT384DI32_Vec; var SearchedDistanceMin: Double): PKDT384DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT384DI32.Search(const buff: TKDT384DI32_Vec): PKDT384DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT384DI32.SearchToken(const buff: TKDT384DI32_Vec): TPascalString;
var
p: PKDT384DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT384DI32.Search(const inBuff: TKDT384DI32_DynamicVecBuffer; var OutBuff: TKDT384DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT384DI32_DynamicVecBuffer;
outBuffPtr: PKDT384DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT384DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT384DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT384DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT384DI32.Search(const inBuff: TKDT384DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT384DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT384DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT384DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT384DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT384DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT384DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT384DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT384DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT384DI32_Vec)) <> SizeOf(TKDT384DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT384DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT384DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT384DI32.PrintNodeTree(const NodePtr: PKDT384DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT384DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT384DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT384DI32.Vec(const s: SystemString): TKDT384DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT384DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT384DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT384DI32.Vec(const v: TKDT384DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT384DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT384DI32.Distance(const v1, v2: TKDT384DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT384DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT384DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT384DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT384DI32.Test;
var
TKDT384DI32_Test: TKDT384DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT384DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT384DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT384DI32_Test := TKDT384DI32.Create;
n.Append('...');
SetLength(TKDT384DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT384DI32_Test.TestBuff) - 1 do
for j := 0 to KDT384DI32_Axis - 1 do
TKDT384DI32_Test.TestBuff[i][j] := i * KDT384DI32_Axis + j;
{$IFDEF FPC}
TKDT384DI32_Test.BuildKDTreeM(length(TKDT384DI32_Test.TestBuff), nil, @TKDT384DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT384DI32_Test.BuildKDTreeM(length(TKDT384DI32_Test.TestBuff), nil, TKDT384DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT384DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT384DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT384DI32_Test.TestBuff) - 1 do
begin
p := TKDT384DI32_Test.Search(TKDT384DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT384DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT384DI32_Test.TestBuff));
TKDT384DI32_Test.Search(TKDT384DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT384DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT384DI32_Test.Clear;
{ kMean test }
TKDT384DI32_Test.BuildKDTreeWithCluster(TKDT384DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT384DI32_Test.Search(TKDT384DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT384DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT384DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT384DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT512DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT512DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT512DI32_Node;
function SortCompare(const p1, p2: PKDT512DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT512DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT512DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT512DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT512DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT512DI32.GetData(const Index: NativeInt): PKDT512DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT512DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT512DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT512DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT512DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT512DI32.StoreBuffPtr: PKDT512DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT512DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT512DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT512DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT512DI32.BuildKDTreeWithCluster(const inBuff: TKDT512DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT512DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT512DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT512DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT512DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT512DI32.BuildKDTreeWithCluster(const inBuff: TKDT512DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT512DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildCall);
var
TempStoreBuff: TKDT512DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT512DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT512DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT512DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT512DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT512DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildMethod);
var
TempStoreBuff: TKDT512DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT512DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT512DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT512DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT512DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT512DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT512DI32_BuildProc);
var
TempStoreBuff: TKDT512DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT512DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT512DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT512DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT512DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT512DI32.Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT512DI32_Node;
var
NearestNeighbour: PKDT512DI32_Node;
function FindParentNode(const buffPtr: PKDT512DI32_Vec; NodePtr: PKDT512DI32_Node): PKDT512DI32_Node;
var
Next: PKDT512DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT512DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT512DI32_Node; const buffPtr: PKDT512DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT512DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT512DI32_Vec; const p1, p2: PKDT512DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT512DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT512DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT512DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT512DI32_Node(NearestNodes[0]);
end;
end;
function TKDT512DI32.Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT512DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT512DI32.Search(const buff: TKDT512DI32_Vec; var SearchedDistanceMin: Double): PKDT512DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT512DI32.Search(const buff: TKDT512DI32_Vec): PKDT512DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT512DI32.SearchToken(const buff: TKDT512DI32_Vec): TPascalString;
var
p: PKDT512DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT512DI32.Search(const inBuff: TKDT512DI32_DynamicVecBuffer; var OutBuff: TKDT512DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT512DI32_DynamicVecBuffer;
outBuffPtr: PKDT512DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT512DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT512DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT512DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT512DI32.Search(const inBuff: TKDT512DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT512DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT512DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT512DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT512DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT512DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT512DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT512DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT512DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT512DI32_Vec)) <> SizeOf(TKDT512DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT512DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT512DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT512DI32.PrintNodeTree(const NodePtr: PKDT512DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT512DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT512DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT512DI32.Vec(const s: SystemString): TKDT512DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT512DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT512DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT512DI32.Vec(const v: TKDT512DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT512DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT512DI32.Distance(const v1, v2: TKDT512DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT512DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT512DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT512DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT512DI32.Test;
var
TKDT512DI32_Test: TKDT512DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT512DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT512DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT512DI32_Test := TKDT512DI32.Create;
n.Append('...');
SetLength(TKDT512DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT512DI32_Test.TestBuff) - 1 do
for j := 0 to KDT512DI32_Axis - 1 do
TKDT512DI32_Test.TestBuff[i][j] := i * KDT512DI32_Axis + j;
{$IFDEF FPC}
TKDT512DI32_Test.BuildKDTreeM(length(TKDT512DI32_Test.TestBuff), nil, @TKDT512DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT512DI32_Test.BuildKDTreeM(length(TKDT512DI32_Test.TestBuff), nil, TKDT512DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT512DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT512DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT512DI32_Test.TestBuff) - 1 do
begin
p := TKDT512DI32_Test.Search(TKDT512DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT512DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT512DI32_Test.TestBuff));
TKDT512DI32_Test.Search(TKDT512DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT512DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT512DI32_Test.Clear;
{ kMean test }
TKDT512DI32_Test.BuildKDTreeWithCluster(TKDT512DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT512DI32_Test.Search(TKDT512DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT512DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT512DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT512DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT800DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT800DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT800DI32_Node;
function SortCompare(const p1, p2: PKDT800DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT800DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT800DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT800DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT800DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT800DI32.GetData(const Index: NativeInt): PKDT800DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT800DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT800DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT800DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT800DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT800DI32.StoreBuffPtr: PKDT800DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT800DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT800DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT800DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT800DI32.BuildKDTreeWithCluster(const inBuff: TKDT800DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT800DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT800DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT800DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT800DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT800DI32.BuildKDTreeWithCluster(const inBuff: TKDT800DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT800DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildCall);
var
TempStoreBuff: TKDT800DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT800DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT800DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT800DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT800DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT800DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildMethod);
var
TempStoreBuff: TKDT800DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT800DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT800DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT800DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT800DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT800DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT800DI32_BuildProc);
var
TempStoreBuff: TKDT800DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT800DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT800DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT800DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT800DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT800DI32.Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT800DI32_Node;
var
NearestNeighbour: PKDT800DI32_Node;
function FindParentNode(const buffPtr: PKDT800DI32_Vec; NodePtr: PKDT800DI32_Node): PKDT800DI32_Node;
var
Next: PKDT800DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT800DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT800DI32_Node; const buffPtr: PKDT800DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT800DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT800DI32_Vec; const p1, p2: PKDT800DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT800DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT800DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT800DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT800DI32_Node(NearestNodes[0]);
end;
end;
function TKDT800DI32.Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT800DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT800DI32.Search(const buff: TKDT800DI32_Vec; var SearchedDistanceMin: Double): PKDT800DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT800DI32.Search(const buff: TKDT800DI32_Vec): PKDT800DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT800DI32.SearchToken(const buff: TKDT800DI32_Vec): TPascalString;
var
p: PKDT800DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT800DI32.Search(const inBuff: TKDT800DI32_DynamicVecBuffer; var OutBuff: TKDT800DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT800DI32_DynamicVecBuffer;
outBuffPtr: PKDT800DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT800DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT800DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT800DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT800DI32.Search(const inBuff: TKDT800DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT800DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT800DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT800DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT800DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT800DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT800DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT800DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT800DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT800DI32_Vec)) <> SizeOf(TKDT800DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT800DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT800DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT800DI32.PrintNodeTree(const NodePtr: PKDT800DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT800DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT800DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT800DI32.Vec(const s: SystemString): TKDT800DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT800DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT800DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT800DI32.Vec(const v: TKDT800DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT800DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT800DI32.Distance(const v1, v2: TKDT800DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT800DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT800DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT800DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT800DI32.Test;
var
TKDT800DI32_Test: TKDT800DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT800DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT800DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT800DI32_Test := TKDT800DI32.Create;
n.Append('...');
SetLength(TKDT800DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT800DI32_Test.TestBuff) - 1 do
for j := 0 to KDT800DI32_Axis - 1 do
TKDT800DI32_Test.TestBuff[i][j] := i * KDT800DI32_Axis + j;
{$IFDEF FPC}
TKDT800DI32_Test.BuildKDTreeM(length(TKDT800DI32_Test.TestBuff), nil, @TKDT800DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT800DI32_Test.BuildKDTreeM(length(TKDT800DI32_Test.TestBuff), nil, TKDT800DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT800DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT800DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT800DI32_Test.TestBuff) - 1 do
begin
p := TKDT800DI32_Test.Search(TKDT800DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT800DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT800DI32_Test.TestBuff));
TKDT800DI32_Test.Search(TKDT800DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT800DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT800DI32_Test.Clear;
{ kMean test }
TKDT800DI32_Test.BuildKDTreeWithCluster(TKDT800DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT800DI32_Test.Search(TKDT800DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT800DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT800DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT800DI32_Test);
DoStatus(n);
n := '';
end;
function TKDT1024DI32.InternalBuildKdTree(const KDSourceBufferPtr: PKDT1024DI32_SourceBuffer; const PlanCount, Depth: NativeInt): PKDT1024DI32_Node;
function SortCompare(const p1, p2: PKDT1024DI32_Source; const axis: NativeInt): ShortInt;
begin
if p1^.buff[axis] = p2^.buff[axis] then
begin
if p1^.Index = p2^.Index then
Result := 0
else if p1^.Index < p2^.Index then
Result := -1
else
Result := 1;
end
else if p1^.buff[axis] < p2^.buff[axis] then
Result := -1
else
Result := 1;
end;
procedure InternalSort(const SortBuffer: PKDT1024DI32_SourceBuffer; L, R: NativeInt; const axis: NativeInt);
var
i, j: NativeInt;
p, t: PKDT1024DI32_Source;
begin
repeat
i := L;
j := R;
p := SortBuffer^[(L + R) shr 1];
repeat
while SortCompare(SortBuffer^[i], p, axis) < 0 do
Inc(i);
while SortCompare(SortBuffer^[j], p, axis) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer^[i];
SortBuffer^[i] := SortBuffer^[j];
SortBuffer^[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, axis);
L := i;
until i >= R;
end;
var
M: NativeInt;
axis: NativeInt;
kdBuffPtr: PKDT1024DI32_SourceBuffer;
begin
Result := nil;
if PlanCount = 0 then
Exit;
if PlanCount = 1 then
begin
new(Result);
Result^.Parent := nil;
Result^.Right := nil;
Result^.Left := nil;
Result^.Vec := KDSourceBufferPtr^[0];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
end
else
begin
axis := Depth mod KDT1024DI32_Axis;
M := PlanCount div 2;
kdBuffPtr := GetMemory(PlanCount * SizeOf(Pointer));
CopyPtr(@KDSourceBufferPtr^[0], @kdBuffPtr^[0], PlanCount * SizeOf(Pointer));
if PlanCount > 1 then
InternalSort(@kdBuffPtr^[0], 0, PlanCount - 1, axis);
new(Result);
Result^.Parent := nil;
Result^.Vec := kdBuffPtr^[M];
KDNodes[NodeCounter] := Result;
Inc(NodeCounter);
Result^.Left := InternalBuildKdTree(@kdBuffPtr^[0], M, Depth + 1);
if Result^.Left <> nil then
Result^.Left^.Parent := Result;
Result^.Right := InternalBuildKdTree(@kdBuffPtr^[M + 1], PlanCount - (M + 1), Depth + 1);
if Result^.Right <> nil then
Result^.Right^.Parent := Result;
FreeMemory(kdBuffPtr);
end;
end;
function TKDT1024DI32.GetData(const Index: NativeInt): PKDT1024DI32_Source;
begin
Result := @KDStoreBuff[Index];
end;
constructor TKDT1024DI32.Create;
begin
inherited Create;
NodeCounter := 0;
RootNode := nil;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
Clear;
end;
destructor TKDT1024DI32.Destroy;
begin
Clear;
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
inherited Destroy;
end;
procedure TKDT1024DI32.Clear;
var
i: NativeInt;
begin
i := 0;
while i < length(KDNodes) do
begin
Dispose(PKDT1024DI32_Node(KDNodes[i]));
Inc(i);
end;
for i := 0 to length(KDStoreBuff) - 1 do
KDStoreBuff[i].Token := '';
SetLength(KDNodes, 0);
SetLength(KDStoreBuff, 0);
SetLength(KDBuff, 0);
NodeCounter := 0;
RootNode := nil;
end;
function TKDT1024DI32.StoreBuffPtr: PKDT1024DI32_DyanmicStoreBuffer;
begin
Result := @KDStoreBuff;
end;
procedure TKDT1024DI32.BuildKDTreeC(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildCall);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT1024DI32.BuildKDTreeM(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildMethod);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
procedure TKDT1024DI32.BuildKDTreeP(const PlanCount: NativeInt; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildProc);
var
i, j: NativeInt;
begin
Clear;
if PlanCount <= 0 then
Exit;
SetLength(KDStoreBuff, PlanCount);
SetLength(KDBuff, PlanCount);
SetLength(KDNodes, PlanCount);
i := 0;
while i < PlanCount do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
FillPtrByte(@KDStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, KDStoreBuff[i], Data);
Inc(i);
end;
j := PlanCount;
RootNode := InternalBuildKdTree(@KDBuff[0], j, 0);
end;
{ k-means++ clusterization }
procedure TKDT1024DI32.BuildKDTreeWithCluster(const inBuff: TKDT1024DI32_DynamicVecBuffer; const k, Restarts: NativeInt; var OutIndex: TKMIntegerArray);
var
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
SetLength(Source, length(inBuff), KDT1024DI32_Axis);
for i := 0 to length(inBuff) - 1 do
for j := 0 to KDT1024DI32_Axis - 1 do
Source[i, j] := inBuff[i, j];
if KMeansCluster(Source, KDT1024DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1024DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
SetLength(KArray, 0);
end;
SetLength(Source, 0);
end;
procedure TKDT1024DI32.BuildKDTreeWithCluster(const inBuff: TKDT1024DI32_DynamicVecBuffer; const k, Restarts: NativeInt);
var
OutIndex: TKMIntegerArray;
begin
BuildKDTreeWithCluster(inBuff, k, Restarts, OutIndex);
SetLength(OutIndex, 0);
end;
procedure TKDT1024DI32.BuildKDTreeWithClusterC(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildCall);
var
TempStoreBuff: TKDT1024DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1024DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1024DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1024DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1024DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT1024DI32.BuildKDTreeWithClusterM(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildMethod);
var
TempStoreBuff: TKDT1024DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1024DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1024DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1024DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1024DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
procedure TKDT1024DI32.BuildKDTreeWithClusterP(const PlanCount, k, Restarts: NativeInt; var OutIndex: TKMIntegerArray; const Data: Pointer; const OnTrigger: TKDT1024DI32_BuildProc);
var
TempStoreBuff: TKDT1024DI32_DyanmicStoreBuffer;
Source: TKMFloat2DArray;
KArray: TKMFloat2DArray;
i, j: NativeInt;
begin
Clear;
SetLength(TempStoreBuff, PlanCount);
i := 0;
while i < PlanCount do
begin
TempStoreBuff[i].Index := i;
TempStoreBuff[i].Token := '';
FillPtrByte(@TempStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec), 0);
OnTrigger(i, TempStoreBuff[i], Data);
Inc(i);
end;
SetLength(Source, length(TempStoreBuff), KDT1024DI32_Axis);
for i := 0 to length(TempStoreBuff) - 1 do
for j := 0 to KDT1024DI32_Axis - 1 do
Source[i, j] := TempStoreBuff[i].buff[j];
if KMeansCluster(Source, KDT1024DI32_Axis, k, umlMax(Restarts, 1), KArray, OutIndex) = 1 then
begin
SetLength(KDStoreBuff, k);
SetLength(KDBuff, k);
SetLength(KDNodes, k);
for i := 0 to k - 1 do
begin
KDBuff[i] := @KDStoreBuff[i];
KDStoreBuff[i].Index := i;
KDStoreBuff[i].Token := '';
for j := 0 to KDT1024DI32_Axis - 1 do
KDStoreBuff[i].buff[j] := KArray[j, i];
end;
RootNode := InternalBuildKdTree(@KDBuff[0], k, 0);
for i := 0 to length(OutIndex) - 1 do
OutIndex[i] := TempStoreBuff[OutIndex[i]].Index;
SetLength(KArray, 0);
end;
SetLength(TempStoreBuff, 0);
SetLength(Source, 0);
end;
function TKDT1024DI32.Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt; const NearestNodes: TCoreClassList): PKDT1024DI32_Node;
var
NearestNeighbour: PKDT1024DI32_Node;
function FindParentNode(const buffPtr: PKDT1024DI32_Vec; NodePtr: PKDT1024DI32_Node): PKDT1024DI32_Node;
var
Next: PKDT1024DI32_Node;
Depth, axis: NativeInt;
begin
Result := nil;
Depth := 0;
Next := NodePtr;
while Next <> nil do
begin
Result := Next;
axis := Depth mod KDT1024DI32_Axis;
if buffPtr^[axis] > Next^.Vec^.buff[axis] then
Next := Next^.Right
else
Next := Next^.Left;
Depth := Depth + 1;
end;
end;
procedure ScanSubtree(const NodePtr: PKDT1024DI32_Node; const buffPtr: PKDT1024DI32_Vec; const Depth: NativeInt; const NearestNodes: TCoreClassList);
var
Dist: Double;
axis: NativeInt;
begin
if NodePtr = nil then
Exit;
Inc(SearchedCounter);
if NearestNodes <> nil then
NearestNodes.Add(NodePtr);
Dist := Distance(buffPtr^, NodePtr^.Vec^.buff);
if Dist < SearchedDistanceMin then
begin
SearchedDistanceMin := Dist;
NearestNeighbour := NodePtr;
end
else if (Dist = SearchedDistanceMin) and (NodePtr^.Vec^.Index < NearestNeighbour^.Vec^.Index) then
NearestNeighbour := NodePtr;
axis := Depth mod KDT1024DI32_Axis;
Dist := NodePtr^.Vec^.buff[axis] - buffPtr^[axis];
if Dist * Dist > SearchedDistanceMin then
begin
if NodePtr^.Vec^.buff[axis] > buffPtr^[axis] then
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes)
else
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end
else
begin
ScanSubtree(NodePtr^.Left, buffPtr, Depth + 1, NearestNodes);
ScanSubtree(NodePtr^.Right, buffPtr, Depth + 1, NearestNodes);
end;
end;
function SortCompare(const buffPtr: PKDT1024DI32_Vec; const p1, p2: PKDT1024DI32_Node): ShortInt;
var
d1, d2: Double;
begin
d1 := Distance(buffPtr^, p1^.Vec^.buff);
d2 := Distance(buffPtr^, p2^.Vec^.buff);
if d1 = d2 then
begin
if p1^.Vec^.Index = p2^.Vec^.Index then
Result := 0
else if p1^.Vec^.Index < p2^.Vec^.Index then
Result := -1
else
Result := 1;
end
else if d1 < d2 then
Result := -1
else
Result := 1;
end;
procedure InternalSort(var SortBuffer: TCoreClassPointerList; L, R: NativeInt; const buffPtr: PKDT1024DI32_Vec);
var
i, j: NativeInt;
p, t: PKDT1024DI32_Node;
begin
repeat
i := L;
j := R;
p := SortBuffer[(L + R) shr 1];
repeat
while SortCompare(buffPtr, SortBuffer[i], p) < 0 do
Inc(i);
while SortCompare(buffPtr, SortBuffer[j], p) > 0 do
Dec(j);
if i <= j then
begin
if i <> j then
begin
t := SortBuffer[i];
SortBuffer[i] := SortBuffer[j];
SortBuffer[j] := t;
end;
Inc(i);
Dec(j);
end;
until i > j;
if L < j then
InternalSort(SortBuffer, L, j, buffPtr);
L := i;
until i >= R;
end;
var
Parent: PKDT1024DI32_Node;
begin
Result := nil;
SearchedDistanceMin := 0;
SearchedCounter := 0;
NearestNeighbour := nil;
if NearestNodes <> nil then
NearestNodes.Clear;
if RootNode = nil then
Exit;
if Count = 0 then
Exit;
Parent := FindParentNode(@buff[0], RootNode);
NearestNeighbour := Parent;
SearchedDistanceMin := Distance(buff, Parent^.Vec^.buff);
ScanSubtree(RootNode, @buff[0], 0, NearestNodes);
if NearestNeighbour = nil then
NearestNeighbour := RootNode;
Result := NearestNeighbour;
if NearestNodes <> nil then
begin
Result := NearestNeighbour;
if NearestNodes.Count > 1 then
InternalSort(NearestNodes.ListData^, 0, NearestNodes.Count - 1, @buff[0]);
if NearestNodes.Count > 0 then
Result := PKDT1024DI32_Node(NearestNodes[0]);
end;
end;
function TKDT1024DI32.Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double; var SearchedCounter: NativeInt): PKDT1024DI32_Node;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter, nil);
end;
function TKDT1024DI32.Search(const buff: TKDT1024DI32_Vec; var SearchedDistanceMin: Double): PKDT1024DI32_Node;
var
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT1024DI32.Search(const buff: TKDT1024DI32_Vec): PKDT1024DI32_Node;
var
SearchedDistanceMin: Double;
SearchedCounter: NativeInt;
begin
Result := Search(buff, SearchedDistanceMin, SearchedCounter);
end;
function TKDT1024DI32.SearchToken(const buff: TKDT1024DI32_Vec): TPascalString;
var
p: PKDT1024DI32_Node;
begin
p := Search(buff);
if p <> nil then
Result := p^.Vec^.Token
else
Result := '';
end;
procedure TKDT1024DI32.Search(const inBuff: TKDT1024DI32_DynamicVecBuffer; var OutBuff: TKDT1024DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT1024DI32_DynamicVecBuffer;
outBuffPtr: PKDT1024DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT1024DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outBuffPtr := @OutBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT1024DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outBuffPtr^[pass] := p^.Vec^.buff;
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT1024DI32_Node;
begin
if length(OutBuff) <> length(OutIndex) then
Exit;
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutBuff[i] := p^.Vec^.buff;
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT1024DI32.Search(const inBuff: TKDT1024DI32_DynamicVecBuffer; var OutIndex: TKMIntegerArray);
{$IFDEF parallel}
var
inBuffPtr: PKDT1024DI32_DynamicVecBuffer;
outIndexPtr: PKMIntegerArray;
{$IFDEF FPC}
procedure FPC_ParallelFor(pass: Integer);
var
p: PKDT1024DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end;
{$ENDIF FPC}
begin
if length(inBuff) <> length(OutIndex) then
Exit;
inBuffPtr := @inBuff;
outIndexPtr := @OutIndex;
GlobalMemoryHook.V := False;
try
{$IFDEF FPC}
FPCParallelFor(@FPC_ParallelFor, 0, length(inBuff) - 1);
{$ELSE FPC}
DelphiParallelFor(0, length(inBuff) - 1,
procedure(pass: Int64)
var
p: PKDT1024DI32_Node;
begin
p := Search(inBuffPtr^[pass]);
outIndexPtr^[pass] := p^.Vec^.Index;
end);
{$ENDIF FPC}
finally
GlobalMemoryHook.V := True;
end;
end;
{$ELSE parallel}
var
i: NativeInt;
p: PKDT1024DI32_Node;
begin
if length(inBuff) <> length(OutIndex) then
Exit;
for i := 0 to length(inBuff) - 1 do
begin
p := Search(inBuff[i]);
OutIndex[i] := p^.Vec^.Index;
end;
end;
{$ENDIF parallel}
procedure TKDT1024DI32.SaveToStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
cnt := length(KDStoreBuff);
st := SaveToken;
ID := KDT1024DI32_Axis;
stream.write(st, 4);
stream.write(ID, 4);
stream.write(cnt, 8);
i := 0;
while i < cnt do
begin
stream.write(KDStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec));
stream.write(KDStoreBuff[i].Index, 8);
token_B := KDStoreBuff[i].Token.Bytes;
token_L := length(token_B);
stream.write(token_L, 4);
if token_L > 0 then
begin
stream.write(token_B[0], token_L);
SetLength(token_B, 0);
end;
Inc(i);
end;
end;
procedure TKDT1024DI32.LoadFromStream(stream: TCoreClassStream);
var
cnt: Int64;
st, ID: Integer;
i: NativeInt;
token_B: TBytes;
token_L: Integer;
begin
Clear;
stream.read(st, 4);
stream.read(ID, 4);
if st <> SaveToken then
RaiseInfo('kdtree token error!');
if ID <> KDT1024DI32_Axis then
RaiseInfo('kdtree axis error!');
stream.read(cnt, 8);
SetLength(KDStoreBuff, cnt);
i := 0;
try
while i < cnt do
begin
if stream.read(KDStoreBuff[i].buff[0], SizeOf(TKDT1024DI32_Vec)) <> SizeOf(TKDT1024DI32_Vec) then
begin
Clear;
Exit;
end;
if stream.read(KDStoreBuff[i].Index, 8) <> 8 then
begin
Clear;
Exit;
end;
if stream.read(token_L, 4) <> 4 then
begin
Clear;
Exit;
end;
if token_L > 0 then
begin
SetLength(token_B, token_L);
if stream.read(token_B[0], token_L) <> token_L then
begin
Clear;
Exit;
end;
KDStoreBuff[i].Token.Bytes := token_B;
SetLength(token_B, 0);
end
else
KDStoreBuff[i].Token := '';
Inc(i);
end;
except
Clear;
Exit;
end;
SetLength(KDBuff, cnt);
SetLength(KDNodes, cnt);
i := 0;
while i < cnt do
begin
KDBuff[i] := @KDStoreBuff[i];
Inc(i);
end;
if cnt > 0 then
RootNode := InternalBuildKdTree(@KDBuff[0], cnt, 0);
end;
procedure TKDT1024DI32.SaveToFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
fs := TCoreClassFileStream.Create(FileName, fmCreate);
try
SaveToStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT1024DI32.LoadFromFile(FileName: SystemString);
var
fs: TCoreClassFileStream;
begin
try
fs := TCoreClassFileStream.Create(FileName, fmOpenRead or fmShareDenyWrite);
except
Exit;
end;
try
LoadFromStream(fs);
finally
DisposeObject(fs);
end;
end;
procedure TKDT1024DI32.PrintNodeTree(const NodePtr: PKDT1024DI32_Node);
procedure DoPrintNode(prefix: SystemString; const p: PKDT1024DI32_Node);
begin
DoStatus('%s +%d (%s) ', [prefix, p^.Vec^.Index, Vec(p^.Vec^.buff)]);
if p^.Left <> nil then
DoPrintNode(prefix + ' |-----', p^.Left);
if p^.Right <> nil then
DoPrintNode(prefix + ' |-----', p^.Right);
end;
begin
DoPrintNode('', NodePtr);
end;
procedure TKDT1024DI32.PrintBuffer;
var
i: NativeInt;
begin
for i := 0 to length(KDStoreBuff) - 1 do
DoStatus('%d - %d : %s ', [i, KDStoreBuff[i].Index, Vec(KDStoreBuff[i].buff)]);
end;
class function TKDT1024DI32.Vec(const s: SystemString): TKDT1024DI32_Vec;
var
t: TTextParsing;
SplitOutput: TArrayPascalString;
i, j: NativeInt;
begin
for i := 0 to KDT1024DI32_Axis - 1 do
Result[i] := 0;
t := TTextParsing.Create(s, tsText, nil);
if t.SplitChar(1, ', ', '', SplitOutput) > 0 then
begin
j := 0;
for i := 0 to length(SplitOutput) - 1 do
if umlGetNumTextType(SplitOutput[i]) <> ntUnknow then
begin
Result[j] := umlStrToInt(SplitOutput[i], 0);
Inc(j);
if j >= KDT1024DI32_Axis then
Break;
end;
end;
DisposeObject(t);
end;
class function TKDT1024DI32.Vec(const v: TKDT1024DI32_Vec): SystemString;
var
i: NativeInt;
begin
Result := '';
for i := 0 to KDT1024DI32_Axis - 1 do
begin
if i > 0 then
Result := Result + ',';
Result := Result + umlIntToStr(v[i]);
end;
end;
class function TKDT1024DI32.Distance(const v1, v2: TKDT1024DI32_Vec): Double;
var
i: NativeInt;
begin
Result := 0;
for i := 0 to KDT1024DI32_Axis - 1 do
Result := Result + (v2[i] - v1[i]) * (v2[i] - v1[i]);
end;
procedure TKDT1024DI32.Test_BuildM(const IndexFor: NativeInt; var Source: TKDT1024DI32_Source; const Data: Pointer);
begin
Source.buff := TestBuff[IndexFor];
Source.Token := umlIntToStr(IndexFor);
end;
class procedure TKDT1024DI32.Test;
var
TKDT1024DI32_Test: TKDT1024DI32;
t: TTimeTick;
i, j: NativeInt;
TestResultBuff: TKDT1024DI32_DynamicVecBuffer;
TestResultIndex: TKMIntegerArray;
KMeanOutIndex: TKMIntegerArray;
errored: Boolean;
m64: TMemoryStream64;
p: PKDT1024DI32_Node;
n: TPascalString;
begin
errored := False;
n := PFormat('test %s...', [ClassName]);
t := GetTimeTick;
n.Append('...build');
TKDT1024DI32_Test := TKDT1024DI32.Create;
n.Append('...');
SetLength(TKDT1024DI32_Test.TestBuff, 1000);
for i := 0 to length(TKDT1024DI32_Test.TestBuff) - 1 do
for j := 0 to KDT1024DI32_Axis - 1 do
TKDT1024DI32_Test.TestBuff[i][j] := i * KDT1024DI32_Axis + j;
{$IFDEF FPC}
TKDT1024DI32_Test.BuildKDTreeM(length(TKDT1024DI32_Test.TestBuff), nil, @TKDT1024DI32_Test.Test_BuildM);
{$ELSE FPC}
TKDT1024DI32_Test.BuildKDTreeM(length(TKDT1024DI32_Test.TestBuff), nil, TKDT1024DI32_Test.Test_BuildM);
{$ENDIF FPC}
{ save/load test }
n.Append('...save/load');
m64 := TMemoryStream64.CustomCreate(1024 * 1024);
TKDT1024DI32_Test.SaveToStream(m64);
m64.Position := 0;
TKDT1024DI32_Test.LoadFromStream(m64);
for i := 0 to length(TKDT1024DI32_Test.TestBuff) - 1 do
begin
p := TKDT1024DI32_Test.Search(TKDT1024DI32_Test.TestBuff[i]);
if p^.Vec^.Index <> i then
errored := True;
if not p^.Vec^.Token.Same(umlIntToStr(i)) then
errored := True;
if errored then
Break;
end;
DisposeObject(m64);
if not errored then
begin
{ parallel search test }
n.Append('...parallel');
SetLength(TestResultBuff, length(TKDT1024DI32_Test.TestBuff));
SetLength(TestResultIndex, length(TKDT1024DI32_Test.TestBuff));
TKDT1024DI32_Test.Search(TKDT1024DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if Distance(TKDT1024DI32_Test.TestBuff[TestResultIndex[i]], TestResultBuff[TestResultIndex[i]]) <> 0 then
errored := True;
end;
if not errored then
begin
n.Append('...kMean');
TKDT1024DI32_Test.Clear;
{ kMean test }
TKDT1024DI32_Test.BuildKDTreeWithCluster(TKDT1024DI32_Test.TestBuff, 10, 1, KMeanOutIndex);
{ parallel search test }
TKDT1024DI32_Test.Search(TKDT1024DI32_Test.TestBuff, TestResultBuff, TestResultIndex);
for i := 0 to length(TestResultIndex) - 1 do
if TestResultIndex[i] <> KMeanOutIndex[i] then
errored := True;
end;
SetLength(TKDT1024DI32_Test.TestBuff, 0);
SetLength(TestResultBuff, 0);
SetLength(TestResultIndex, 0);
SetLength(KMeanOutIndex, 0);
TKDT1024DI32_Test.Clear;
n.Append('...');
if errored then
n.Append('error!')
else
n.Append('passed ok %dms', [GetTimeTick - t]);
DisposeObject(TKDT1024DI32_Test);
DoStatus(n);
n := '';
end;
procedure Test_All;
begin
TKDT1DI32.Test();
TKDT2DI32.Test();
TKDT3DI32.Test();
TKDT4DI32.Test();
TKDT5DI32.Test();
TKDT6DI32.Test();
TKDT7DI32.Test();
TKDT8DI32.Test();
TKDT9DI32.Test();
TKDT10DI32.Test();
TKDT11DI32.Test();
TKDT12DI32.Test();
TKDT13DI32.Test();
TKDT14DI32.Test();
TKDT15DI32.Test();
TKDT16DI32.Test();
TKDT17DI32.Test();
TKDT18DI32.Test();
TKDT19DI32.Test();
TKDT20DI32.Test();
TKDT21DI32.Test();
TKDT22DI32.Test();
TKDT23DI32.Test();
TKDT24DI32.Test();
TKDT48DI32.Test();
TKDT52DI32.Test();
TKDT64DI32.Test();
TKDT96DI32.Test();
TKDT128DI32.Test();
TKDT156DI32.Test();
TKDT192DI32.Test();
TKDT256DI32.Test();
TKDT384DI32.Test();
TKDT512DI32.Test();
TKDT800DI32.Test();
TKDT1024DI32.Test();
end;
initialization
finalization
end.
|
unit consts_float_1;
interface
implementation
const
F1 = 1.123;
F2 = -1.321;
var
G1, G2: Float32;
procedure Test;
begin
G1 := F1;
G2 := F2;
end;
initialization
Test();
finalization
Assert(G1 = F1);
Assert(G2 = F2);
end. |
UNIT StopWtch;
interface
{$DEFINE float}
uses DOS; { GetTime }
TYPE
{$ifdef float}
MyType = REAL;
{$else}
MyType = INTEGER;
{$ENDIF}
VAR
T2, T3,
ST, ET : MyType;
PROCEDURE StartWatch;
FUNCTION SplitTime : MyType;
PROCEDURE StopWatch;
FUNCTION ElapsedTime : MyType;
PROCEDURE ResetWatch;
implementation
TYPE
TimeRec = RECORD
H, M, S, uS : WORD;
END;
VAR
T : TimeRec;
FUNCTION ConvertToSecs(T : TimeRec) : MyType;
BEGIN
ConvertToSecs := (T.H * 3600 + T.M * 60 + T.S) + T.uS/100;
END;
PROCEDURE StartWatch;
BEGIN
GetTime(T.H,T.M,T.S,T.uS);
ST := ConvertToSecs(T);
END;
FUNCTION SplitTime : MyType;
BEGIN
GetTime(T.H,T.M,T.S,T.uS);
T2 := ConvertToSecs(T) - ST;
SplitTime := T2;
END; {SplitTime}
PROCEDURE StopWatch;
BEGIN
GetTime(T.H,T.M,T.S,T.uS);
ET := ET + ConvertToSecs(T) - ST;
END; {StopWatch}
FUNCTION ElapsedTime : MyType;
BEGIN
ElapsedTime := ET;
END;
PROCEDURE ResetWatch;
BEGIN
ET := 0;
END;
BEGIN
ResetWatch;
END.
|
{*******************************************************}
{ }
{ Delphi Runtime Library }
{ }
{ Copyright(c) 1995-2018 Embarcadero Technologies, Inc. }
{ All rights reserved }
{ }
{*******************************************************}
{*******************************************************}
{ Interface wrapper for OmniXML }
{*******************************************************}
unit Xml.omnixmldom;
interface
uses
System.Classes, System.SysUtils, System.Types,
{$IF defined(MSWINDOWS) and not defined(NEXTGEN)}
Winapi.ActiveX, System.Win.ComObj,
{$ENDIF}
Xml.xmldom, Xml.Internal.OmniXML;
(*$HPPEMIT END '#pragma startup OmniUnitInitialization 65' *)
procedure OmniUnitInitialization;
const
sOmniXmlVendor = 'Omni XML';
type
{ IOXMLDOMNodeRef }
IOXMLDOMNodeRef = interface
['{D278AAEE-0F97-446A-BBF6-69470F5F188C}']
function GetXMLNode: OmniIXMLNode;
end;
TODOMInterface = class(TInterfacedObject)
public
function SafeCallException(ExceptObject: TObject; ExceptAddr: Pointer): HRESULT; override;
end;
TODOMImplementation = class(TODOMInterface, IDOMImplementation)
protected
{ IDOMImplementation }
function hasFeature(const feature, version: DOMString): WordBool;
function createDocumentType(const qualifiedName, publicId,
systemId: DOMString): IDOMDocumentType; safecall;
function createDocument(const namespaceURI, qualifiedName: DOMString;
doctype: IDOMDocumentType): IDOMDocument; safecall;
public
constructor Create;
end;
TODOMDocument = class;
TODOMNode = class(TODOMInterface, IOXMLDOMNodeRef, IDOMNode, IDOMNodeEx, IDOMNodeSelect)
private
FNativeNode: OmniIXMLNode;
FOwnerDocument: IDOMDocument;
FChildNodes: IDOMNodeList;
FAttributes: IDOMNamedNodeMap;
protected
{ IOXMLDOMNodeRef }
function GetXMLNode: OmniIXMLNode;
{ IDOMNode }
function get_nodeName: DOMString; safecall;
function get_nodeValue: DOMString; safecall;
procedure set_nodeValue(value: DOMString); overload; safecall;
function get_nodeType: DOMNodeType; safecall;
function get_parentNode: IDOMNode; safecall;
function get_childNodes: IDOMNodeList; virtual; safecall;
function get_firstChild: IDOMNode; safecall;
function get_lastChild: IDOMNode; safecall;
function get_previousSibling: IDOMNode; safecall;
function get_nextSibling: IDOMNode; safecall;
function get_attributes: IDOMNamedNodeMap; safecall;
function get_ownerDocument: IDOMDocument; safecall;
function get_namespaceURI: DOMString; safecall;
function get_prefix: DOMString; safecall;
function get_localName: DOMString; safecall;
function insertBefore(const newChild, refChild: IDOMNode): IDOMNode; safecall;
function replaceChild(const newChild, oldChild: IDOMNode): IDOMNode; safecall;
function removeChild(const childNode: IDOMNode): IDOMNode; safecall;
function appendChild(const newChild: IDOMNode): IDOMNode; safecall;
function hasChildNodes: WordBool; virtual; safecall;
function cloneNode(deep: WordBool): IDOMNode; safecall;
procedure normalize; safecall;
function supports(const feature, version: DOMString): WordBool;
{ IDOMNodeEx }
function get_text: DOMString; safecall;
function get_xml: DOMString; safecall;
procedure set_text(const Value: DOMString); safecall;
procedure transformNode(const stylesheet: IDOMNode; var output: XmlDomString); overload; safecall;
procedure transformNode(const stylesheet: IDOMNode; const output: IDOMDocument); overload; safecall;
{ IDOMNodeSelect }
function selectNode(const nodePath: XmlDomString): IDOMNode; safecall;
function selectNodes(const nodePath: XmlDomString): IDOMNodeList; safecall;
public
constructor Create(ANativeNode: OmniIXMLNode); virtual;
destructor Destroy; override;
property NativeNode: OmniIXMLNode read FNativeNode;
end;
TODOMNodeClass = class of TODOMNode;
TODOMNodeList = class(TODOMInterface, IDOMNodeList)
private
FNativeNodeList: OmniIXMLNodeList;
protected
{ IDOMNodeList }
function get_item(index: Integer): IDOMNode; safecall;
function get_length: Integer; safecall;
public
constructor Create(const ANativeNodeList: OmniIXMLNodeList); overload;
constructor Create(const AnXpath: DomString; const AWrapperOwnerNode: TODOMNode); overload;
destructor Destroy; override;
property NativeNodeList: OmniIXMLNodeList read FNativeNodeList;
end;
TODOMNamedNodeMap = class(TODOMInterface, IDOMNamedNodeMap)
private
FNativeNamedNodeMap: OmniIXMLNamedNodeMap;
protected
{ IDOMNamedNodeMap }
function get_item(index: Integer): IDOMNode; safecall;
function get_length: Integer; safecall;
function getNamedItem(const name: DOMString): IDOMNode; safecall;
function setNamedItem(const arg: IDOMNode): IDOMNode; safecall;
function removeNamedItem(const name: DOMString): IDOMNode; safecall;
function getNamedItemNS(const namespaceURI, localName: DOMString): IDOMNode; safecall;
function setNamedItemNS(const arg: IDOMNode): IDOMNode; safecall;
function removeNamedItemNS(const namespaceURI, localName: DOMString): IDOMNode; safecall;
public
constructor Create(const ANativeNamedNodeMap: OmniIXMLNamedNodeMap);
property NativeNamedNodeMap: OmniIXMLNamedNodeMap read FNativeNamedNodeMap;
end;
TODOMCharacterData = class(TODOMNode, IDOMCharacterData)
private
function GetNativeCharacterData: OmniIXMLCharacterData;
protected
{ IDOMCharacterData }
function get_data: DOMString; safecall;
procedure set_data(const data: DOMString); safecall;
function get_length: Integer; safecall;
function substringData(offset, count: Integer): DOMString; safecall;
procedure appendData(const data: DOMString); safecall;
procedure insertData(offset: Integer; const data: DOMString); safecall;
procedure deleteData(offset, count: Integer); safecall;
procedure replaceData(offset, count: Integer; const data: DOMString); safecall;
public
property NativeCharacterData: OmniIXMLCharacterData read GetNativeCharacterData;
end;
TODOMAttr = class(TODOMNode, IDOMAttr)
private
function GetNativeAttribute: OmniIXMLAttr;
protected
{ Property Get/Set }
function get_name: DOMString; safecall;
function get_specified: WordBool; safecall;
function get_value: DOMString; safecall;
procedure set_value(const attributeValue: DOMString); safecall;
function get_ownerElement: IDOMElement; safecall;
{ Properties }
property name: DOMString read get_name;
property specified: WordBool read get_specified;
property value: DOMString read get_value write set_value;
property ownerElement: IDOMElement read get_ownerElement;
public
property NativeAttribute: OmniIXMLAttr read GetNativeAttribute;
end;
TODOMElement = class(TODOMNode, IDOMElement)
private
function GetNativeElement: OmniIXMLElement;
protected
{ IDOMElement }
function get_tagName: DOMString; safecall;
function getAttribute(const name: DOMString): DOMString; safecall;
procedure setAttribute(const name, value: DOMString); safecall;
procedure removeAttribute(const name: DOMString); safecall;
function getAttributeNode(const name: DOMString): IDOMAttr; safecall;
function setAttributeNode(const newAttr: IDOMAttr): IDOMAttr; safecall;
function removeAttributeNode(const oldAttr: IDOMAttr): IDOMAttr; safecall;
function getElementsByTagName(const name: DOMString): IDOMNodeList; safecall;
function getAttributeNS(const namespaceURI, localName: DOMString): DOMString; safecall;
procedure setAttributeNS(const namespaceURI, qualifiedName, value: DOMString); safecall;
procedure removeAttributeNS(const namespaceURI, localName: DOMString); safecall;
function getAttributeNodeNS(const namespaceURI, localName: DOMString): IDOMAttr; safecall;
function setAttributeNodeNS(const newAttr: IDOMAttr): IDOMAttr; safecall;
function getElementsByTagNameNS(const namespaceURI, localName: DOMString): IDOMNodeList; safecall;
function hasAttribute(const name: DOMString): WordBool; safecall;
function hasAttributeNS(const namespaceURI, localName: DOMString): WordBool; safecall;
procedure normalize; safecall;
public
property NativeElement: OmniIXMLElement read GetNativeElement;
end;
TODOMText = class(TODOMCharacterData, IDOMText)
protected
function splitText(offset: Integer): IDOMText; safecall;
end;
TODOMComment = class(TODOMCharacterData, IDOMComment)
end;
TODOMCDATASection = class(TODOMText, IDOMCDATASection)
end;
TODOMDocumentType = class(TODOMNode, IDOMDocumentType)
private
function GetNativeDocumentType: OmniIXMLDocumentType;
protected
function get_childNodes: IDOMNodeList; override; safecall;
function hasChildNodes: WordBool; override; safecall;
{ IDOMDocumentType }
function get_name: DOMString; safecall;
function get_entities: IDOMNamedNodeMap; safecall;
function get_notations: IDOMNamedNodeMap; safecall;
function get_publicId: DOMString; safecall;
function get_systemId: DOMString; safecall;
function get_internalSubset: DOMString; safecall;
public
constructor Create(ANativeNode: OmniIXMLNode); override;
destructor Destroy; override;
property NativeDocumentType: OmniIXMLDocumentType read GetNativeDocumentType;
end;
TODOMEntityReference = class(TODOMNode, IDOMEntityReference)
end;
TODOMProcessingInstruction = class(TODOMNode, IDOMProcessingInstruction)
private
function GetNativeProcessingInstruction: OmniIXMLProcessingInstruction;
protected
{ IDOMProcessingInstruction }
function get_target: DOMString; safecall;
function get_data: DOMString; safecall;
procedure set_data(const value: DOMString); safecall;
public
property NativeProcessingInstruction: OmniIXMLProcessingInstruction read GetNativeProcessingInstruction;
end;
TODOMDocumentFragment = class(TODOMNode, IDOMDocumentFragment)
end;
TODOMDocument = class(TODOMNode, IDOMDocument, IDOMParseOptions, IDOMPersist, IDOMParseError)
private
FWrapperDOMImpl: TODOMImplementation;
FDocumentElement: IDOMElement;
FNativeDocumentElement: OmniIXMLElement;
FNativeDocument: OmniIXMLDocument;
protected
function GetNativeDocument: OmniIXMLDocument;
procedure RemoveWhiteSpaceNodes;
{ IDOMDocument }
function get_doctype: IDOMDocumentType; safecall;
function get_domImplementation: IDOMImplementation; safecall;
function get_documentElement: IDOMElement; safecall;
procedure set_documentElement(const DOMElement: IDOMElement); safecall;
function createElement(const tagName: DOMString): IDOMElement; safecall;
function createDocumentFragment: IDOMDocumentFragment; safecall;
function createTextNode(const data: DOMString): IDOMText; safecall;
function createComment(const data: DOMString): IDOMComment; safecall;
function createCDATASection(const data: DOMString): IDOMCDATASection;
safecall;
function createProcessingInstruction(const target,
data: DOMString): IDOMProcessingInstruction; safecall;
function createAttribute(const name: DOMString): IDOMAttr; safecall;
function createEntityReference(const name: DOMString): IDOMEntityReference;
safecall;
function getElementsByTagName(const tagName: DOMString): IDOMNodeList;
safecall;
function importNode(importedNode: IDOMNode; deep: WordBool): IDOMNode;
safecall;
function createElementNS(const namespaceURI,
qualifiedName: DOMString): IDOMElement; safecall;
function createAttributeNS(const namespaceURI,
qualifiedName: DOMString): IDOMAttr; safecall;
function getElementsByTagNameNS(const namespaceURI,
localName: DOMString): IDOMNodeList; safecall;
function getElementById(const elementId: DOMString): IDOMElement; safecall;
{ IDOMParseOptions }
function get_async: Boolean; safecall;
function get_preserveWhiteSpace: Boolean; safecall;
function get_resolveExternals: Boolean; safecall;
function get_validate: Boolean; safecall;
procedure set_async(Value: Boolean); safecall;
procedure set_preserveWhiteSpace(Value: Boolean); safecall;
procedure set_resolveExternals(Value: Boolean); safecall;
procedure set_validate(Value: Boolean); safecall;
{ IDOMPersist }
function get_xml: DOMString; safecall;
function asyncLoadState: Integer; safecall;
function load(source: OleVariant): WordBool; safecall;
function loadFromStream(const stream: TStream): WordBool; overload; safecall;
function loadxml(const Value: DOMString): WordBool; safecall;
procedure save(destination: OleVariant); safecall;
procedure saveToStream(const stream: TStream); overload; safecall;
procedure set_OnAsyncLoad(const Sender: TObject;
EventHandler: TAsyncEventHandler); safecall;
function loadFromStream(const stream: IStream): WordBool; overload; safecall;
procedure saveToStream(const stream: IStream); overload; safecall;
{ IDOMParseError }
function get_errorCode: Integer; safecall;
function get_url: DOMString; safecall;
function get_reason: DOMString; safecall;
function get_srcText: DOMString; safecall;
function get_line: Integer; safecall;
function get_linepos: Integer; safecall;
function get_filepos: Integer; safecall;
public
constructor Create(AWrapperDOMImpl: TODOMImplementation; ANativeDoc: OmniIXMLDocument;
DocIsOwned: Boolean); reintroduce;
destructor Destroy; override;
property NativeDocument: OmniIXMLDocument read GetNativeDocument;
property PreserveWhitespace: Boolean read get_preserveWhiteSpace;
property WrapperDOMImpl: TODOMImplementation read FWrapperDOMImpl;
end;
TODOMImplementationFactory = class(TDOMVendor)
private
FGlobalDOMImpl: IDOMImplementation;
public
function DOMImplementation: IDOMImplementation; override;
function Description: String; override;
end;
var
OmniXML4Factory: TODOMImplementationFactory;
implementation
uses Xml.Internal.XmlRulesUtils;
resourcestring
SNodeExpected = 'NativeNode cannot be null';
var
GlobalODOM: TODOMImplementation;
procedure OmniUnitInitialization;
begin
end;
{ Utility Functions }
function GetNativeNodeOfIntfNode(const Node: IDOMNode): OmniIXMLNode;
begin
if not Assigned(Node) then
raise DOMException.Create(SNodeExpected);
Result := (Node as IOXMLDOMNodeRef).GetXMLNode;
end;
function MakeNode(const NativeNode: OmniIXMLNode; bOwnAndLaterFreeNativeNode: Boolean = False): IDOMNode;
var
DnWrapper: TODOMNode;
begin
if NativeNode = nil then
Result := nil
else
begin
case NativeNode.NodeType of
ELEMENT_NODE: DnWrapper := TODOMElement.Create(NativeNode);
ATTRIBUTE_NODE: DnWrapper := TODOMAttr.Create(NativeNode);
TEXT_NODE: DnWrapper := TODOMText.Create(NativeNode);
CDATA_SECTION_NODE: DnWrapper := TODOMCDATASection.Create(NativeNode);
ENTITY_REFERENCE_NODE: DnWrapper := TODOMEntityReference.Create(NativeNode);
ENTITY_NODE: dnWrapper := TODOMEntityReference.Create(NativeNode);
PROCESSING_INSTRUCTION_NODE: dnWrapper := TODOMProcessingInstruction.Create(NativeNode);
COMMENT_NODE: DnWrapper := TODOMComment.Create(NativeNode);
DOCUMENT_NODE: DnWrapper := TODOMDocument.Create(GlobalODOM, CreateXMLDoc, False);
DOCUMENT_TYPE_NODE: DnWrapper := TODOMDocumentType.Create(NativeNode);
DOCUMENT_FRAGMENT_NODE: DnWrapper := TODOMDocumentFragment.Create(NativeNode);
NOTATION_NODE: raise EXMLException.Create('Invalid operation: cannot clone Notation node');
else
DnWrapper := TODOMNode.Create(NativeNode);
end;
Result := DnWrapper;
end;
end;
function MakeNodeList(const NativeNodeList: OmniIXMLNodeList): IDOMNodeList; overload;
begin
Result := TODOMNodeList.Create(NativeNodeList);
end;
constructor TODOMImplementation.Create;
begin
inherited;
end;
function TODOMImplementation.hasFeature(const feature, version: DOMString): WordBool;
begin
// Not supported in OmniXML
Result := False;
end;
function TODOMImplementation.createDocumentType(const qualifiedName, publicId, systemId: DOMString): IDOMDocumentType;
var
DomDocType: OmniIXMLDocumentType;
begin
DomDocType := OmniTXMLDocumentType.Create(nil, qualifiedName);
Result := TODOMDocumentType.Create(DomDocType);
end;
function TODOMImplementation.createDocument(const namespaceURI, qualifiedName: DOMString;
doctype: IDOMDocumentType): IDOMDocument;
var
DomDoc: OmniTXMLDocument;
DomDocType :OmniIXMLDocumentType;
Intf: IOXMLDOMNodeRef;
begin
DomDoc := OmniTXMLDocument.Create; // Native Class
if Supports(doctype, IOXMLDOMNodeRef, Intf) then
DomDocType := GetNativeNodeOfIntfNode(doctype) as OmniIXMLDocumentType
else
DomDocType := nil;
if Assigned(DomDocType) then
domDoc.AppendChild(DomDocType);
Result := TODOMDocument.Create(self, DomDoc, True);
end;
function TODOMNode.appendChild(const newChild: IDOMNode): IDOMNode;
var
XdnNewChild,
XdnReturnedChild: OmniIXMLNode;
begin
XdnNewChild := GetNativeNodeOfIntfNode(newChild);
XdnReturnedChild := NativeNode.appendChild(xdnNewChild);
if XdnReturnedChild = XdnNewChild then
Result := newChild
else
Result := MakeNode(XdnReturnedChild);
end;
function TODOMNode.cloneNode(deep: WordBool): IDOMNode;
begin
Result := MakeNode(NativeNode.CloneNode(deep));
end;
constructor TODOMNode.Create(ANativeNode: OmniIXMLNode);
begin
Assert(Assigned(ANativeNode));
FNativeNode := ANativeNode;
FAttributes := nil; //Assigned in get_attributes
FChildNodes := nil;
inherited Create;
end;
destructor TODOMNode.Destroy;
begin
FAttributes := nil;
FChildNodes := nil;
FOwnerDocument := nil;
FNativeNode := nil;
inherited;
end;
function TODOMNode.GetXMLNode: OmniIXMLNode;
begin
Result := NativeNode;
end;
function TODOMNode.get_attributes: IDOMNamedNodeMap;
begin
if not Assigned(FAttributes) then
FAttributes := TODOMNamedNodeMap.Create(FNativeNode.Attributes);
Result := FAttributes;
end;
function TODOMNode.get_childNodes: IDOMNodeList;
begin
if not Assigned(FChildNodes) then
FChildNodes := MakeNodeList(FNativeNode.ChildNodes);
Result := FChildNodes;
end;
function TODOMNode.get_firstChild: IDOMNode;
begin
Result := MakeNode(FNativeNode.FirstChild);
end;
function TODOMNode.get_lastChild: IDOMNode;
begin
Result := MakeNode(FNativeNode.LastChild);
end;
function TODOMNode.get_localName: DOMString;
begin
Result := FNativeNode.LocalName;
end;
function TODOMNode.get_namespaceURI: DOMString;
begin
Result := FNativeNode.NamespaceURI;
end;
function TODOMNode.get_nextSibling: IDOMNode;
begin
Result := MakeNode(FNativeNode.NextSibling);
end;
function TODOMNode.get_nodeName: DOMString;
begin
if FNativeNode.NodeType = PROCESSING_INSTRUCTION_NODE then
Result := (FNativeNode as OmniIXMLProcessingInstruction).Target
else
Result := FNativeNode.NodeName;
end;
function TODOMNode.get_nodeType: DOMNodeType;
begin
case NativeNode.NodeType of
ELEMENT_NODE: Result := ELEMENT_NODE;
ATTRIBUTE_NODE: Result := ATTRIBUTE_NODE;
TEXT_NODE: Result := TEXT_NODE;
CDATA_SECTION_NODE: Result := CDATA_SECTION_NODE;
ENTITY_REFERENCE_NODE: Result := ENTITY_REFERENCE_NODE;
PROCESSING_INSTRUCTION_NODE: Result := PROCESSING_INSTRUCTION_NODE;
COMMENT_NODE: Result := COMMENT_NODE;
DOCUMENT_NODE: Result := DOCUMENT_NODE;
DOCUMENT_TYPE_NODE: Result := DOCUMENT_TYPE_NODE;
DOCUMENT_FRAGMENT_NODE: Result := DOCUMENT_FRAGMENT_NODE;
else
Result := 0;
end;
end;
function TODOMNode.get_nodeValue: DOMString;
begin
if FNativeNode.NodeType = PROCESSING_INSTRUCTION_NODE then
Result := (FNativeNode as OmniIXMLProcessingInstruction).Data
else
Result := FNativeNode.NodeValue;
end;
function TODOMNode.get_ownerDocument: IDOMDocument;
begin
if not Assigned(FOwnerDocument) then
FOwnerDocument := TODOMDocument.Create(GlobalODOM, NativeNode.OwnerDocument, False);
Result := FOwnerDocument;
end;
function TODOMNode.get_parentNode: IDOMNode;
begin
Result := MakeNode(FNativeNode.ParentNode);
end;
function TODOMNode.get_prefix: DOMString;
begin
Result := FNativeNode.Prefix;
end;
function TODOMNode.get_previousSibling: IDOMNode;
begin
Result := MakeNode(FNativeNode.PreviousSibling);
end;
function TODOMNode.get_text: DOMString;
begin
Result := FNativeNode.Text;
end;
function TODOMNode.get_xml: DOMString;
begin
Result := FNativeNode.XML;
end;
function TODOMNode.hasChildNodes: WordBool;
begin
Result := FNativeNode.HasChildNodes
end;
function TODOMNode.insertBefore(const newChild, refChild: IDOMNode): IDOMNode;
var
XdnNewChild: OmniIXMLNode;
begin
XdnNewChild := GetNativeNodeOfIntfNode(newChild);
Result := MakeNode(FNativeNode.InsertBefore(XdnNewChild, GetNativeNodeOfIntfNode(refChild)));
end;
procedure TODOMNode.normalize;
begin
// NYI in OmniXML
DOMVendorNotSupported('normalize', sOmniXmlVendor); { Do not localize }
end;
function TODOMNode.removeChild(const childNode: IDOMNode): IDOMNode;
begin
Result := MakeNode(FNativeNode.RemoveChild(GetNativeNodeOfIntfNode(childNode)));
end;
function TODOMNode.replaceChild(const newChild, oldChild: IDOMNode): IDOMNode;
var
XdnNewChild: OmniIXMLNode;
begin
XdnNewChild := GetNativeNodeOfIntfNode(newChild);
Result := MakeNode(NativeNode.ReplaceChild(XdnNewChild, GetNativeNodeOfIntfNode(oldChild)));
end;
function TODOMNode.selectNode(const nodePath: XmlDomString): IDOMNode;
begin
Result := MakeNode(NativeNode.SelectSingleNode(nodePath));
end;
function TODOMNode.selectNodes(const nodePath: XmlDomString): IDOMNodeList;
begin
Result := MakeNodeList(NativeNode.SelectNodes(nodePath));
end;
procedure TODOMNode.set_nodeValue(value: DOMString);
begin
FNativeNode.NodeValue := value;
end;
procedure TODOMNode.set_text(const Value: DOMString);
begin
FNativeNode.Text := Value;
end;
function TODOMNode.supports(const feature, version: DOMString): WordBool;
begin
Result := SameText(feature, 'xml')
and ((version = '') or (version = '1.0'));// or (version = '2.0'));
end;
procedure TODOMNode.transformNode(const stylesheet: IDOMNode; const output: IDOMDocument);
begin
DOMVendorNotSupported('transformNode', sOmniXmlVendor); { Do not localize }
end;
procedure TODOMNode.transformNode(const stylesheet: IDOMNode; var output: XmlDomString);
begin
DOMVendorNotSupported('transformNode', sOmniXmlVendor); { Do not localize }
end;
constructor TODOMNamedNodeMap.Create(const ANativeNamedNodeMap: OmniIXMLNamedNodeMap);
begin
inherited Create;
FNativeNamedNodeMap := ANativeNamedNodeMap;
end;
function TODOMNamedNodeMap.getNamedItem(const name: DOMString): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.GetNamedItem(name));
end;
function TODOMNamedNodeMap.getNamedItemNS(const namespaceURI, localName: DOMString): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.GetNamedItemNS(namespaceURI, localName));
end;
function TODOMNamedNodeMap.get_item(index: Integer): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.Item[index]);
end;
function TODOMNamedNodeMap.get_length: Integer;
begin
Result := FNativeNamedNodeMap.Length;
end;
function TODOMNamedNodeMap.removeNamedItem(const name: DOMString): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.RemoveNamedItem(name));
end;
function TODOMNamedNodeMap.removeNamedItemNS(const namespaceURI, localName: DOMString): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.RemoveNamedItemNS(namespaceURI, localName));
end;
function TODOMNamedNodeMap.setNamedItem(const arg: IDOMNode): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.SetNamedItem(GetNativeNodeOfIntfNode(arg)));
end;
function TODOMNamedNodeMap.setNamedItemNS(const arg: IDOMNode): IDOMNode;
begin
Result := MakeNode(FNativeNamedNodeMap.SetNamedItemNS(GetNativeNodeOfIntfNode(arg)));
end;
constructor TODOMNodeList.Create(const ANativeNodeList: OmniIXMLNodeList);
begin
inherited Create;
FNativeNodeList := ANativeNodeList;
end;
constructor TODOMNodeList.Create(const AnXpath: DomString; const AWrapperOwnerNode: TODOMNode);
begin
inherited Create;
FNativeNodeList := AWrapperOwnerNode.NativeNode.selectNodes(AnXpath);
end;
destructor TODOMNodeList.Destroy;
begin
FNativeNodeList := nil;
inherited;
end;
function TODOMNodeList.get_item(index: Integer): IDOMNode;
begin
Result := MakeNode(FNativeNodeList.Item[index]);
end;
function TODOMNodeList.get_length: Integer;
begin
Result := FNativeNodeList.Length;
end;
function TODOMInterface.SafeCallException(ExceptObject: TObject;
ExceptAddr: Pointer): HRESULT;
var
HelpFile: string;
begin
{$IF defined(MSWINDOWS) and not defined(NEXTGEN)}
if ExceptObject is EOleException then
HelpFile := (ExceptObject as EOleException).HelpFile;
{$ENDIF}
Result := HandleSafeCallException(ExceptObject, ExceptAddr, IDOMNode, '', Helpfile);
end;
constructor TODOMDocumentType.Create(ANativeNode: OmniIXMLNode);
begin
inherited Create(ANativeNode);
end;
destructor TODOMDocumentType.Destroy;
begin
inherited Destroy;
end;
function TODOMDocumentType.GetNativeDocumentType: OmniIXMLDocumentType;
begin
Result := NativeNode as OmniIXMLDocumentType;
end;
function TODOMDocumentType.get_childNodes: IDOMNodeList;
begin
Result := MakeNodeList(NativeDocumentType.ChildNodes);
end;
function TODOMDocumentType.get_entities: IDOMNamedNodeMap;
begin
// NYI in OmniXML
DOMVendorNotSupported('get_entities', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocumentType.get_internalSubset: DOMString;
begin
// NYI in OmniXML
DOMVendorNotSupported('get_internalSubset', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocumentType.get_name: DOMString;
begin
Result := NativeDocumentType.NodeName;
end;
function TODOMDocumentType.get_notations: IDOMNamedNodeMap;
begin
// NYI in OmniXML
DOMVendorNotSupported('get_notations', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocumentType.get_publicId: DOMString;
begin
// NYI in OmniXML
DOMVendorNotSupported('get_publicId', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocumentType.get_systemId: DOMString;
begin
// NYI in OmniXML
DOMVendorNotSupported('get_systemId', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocumentType.hasChildNodes: WordBool;
begin
Result := (NativeDocumentType.ChildNodes.Length > 0);
end;
constructor TODOMDocument.Create(AWrapperDOMImpl: TODOMImplementation;
ANativeDoc: OmniIXMLDocument; DocIsOwned: Boolean);
begin
Assert(Assigned(ANativeDoc));
FNativeDocument := ANativeDoc;
FWrapperDOMImpl := AWrapperDOMImpl;
inherited Create(ANativeDoc);
end;
destructor TODOMDocument.Destroy;
begin
inherited Destroy;
end;
function TODOMDocument.GetNativeDocument: OmniIXMLDocument;
begin
Result := FNativeDocument;
end;
function TODOMDocument.createAttribute(const name: DOMString): IDOMAttr;
begin
Result := TODOMAttr.Create(NativeDocument.CreateAttribute(name));
end;
function TODOMDocument.createAttributeNS(const namespaceURI, qualifiedName: DOMString): IDOMAttr;
begin
Result := TODOMAttr.Create(NativeDocument.CreateAttributeNS(namespaceURI, qualifiedName));
end;
function TODOMDocument.createCDATASection(const data: DOMString): IDOMCDATASection;
begin
Result := TODOMCDATASection.Create(NativeDocument.CreateCDATASection(data));
end;
function TODOMDocument.createComment(const data: DOMString): IDOMComment;
begin
Result := TODOMComment.Create(NativeDocument.CreateComment(data));
end;
function TODOMDocument.createDocumentFragment: IDOMDocumentFragment;
begin
Result := TODOMDocumentFragment.Create(NativeDocument.CreateDocumentFragment);
end;
function TODOMDocument.createElement(const tagName: DOMString): IDOMElement;
begin
Result := makenode(NativeDocument.CreateElement(tagName)) as IDOMElement;
end;
function TODOMDocument.createElementNS(const namespaceURI, qualifiedName: DOMString): IDOMElement;
begin
Result := makenode(NativeDocument.CreateElementNS(namespaceURI, qualifiedName)) as IDOMElement;
end;
function TODOMDocument.createEntityReference(const name: DOMString): IDOMEntityReference;
begin
Result := TODOMEntityReference.Create(NativeDocument.CreateEntityReference(name));
end;
function TODOMDocument.createProcessingInstruction(const target, data: DOMString): IDOMProcessingInstruction;
var
NatProcessingInstruction: OmniIXMLProcessingInstruction;
begin
NatProcessingInstruction := NativeDocument.CreateProcessingInstruction(target, data);
Result := TODOMProcessingInstruction.Create(NatProcessingInstruction);
end;
function TODOMDocument.createTextNode(const data: DOMString): IDOMText;
begin
Result := TODOMText.Create(NativeDocument.CreateTextNode(data));
end;
function TODOMDocument.get_doctype: IDOMDocumentType;
begin
Result := TODOMDocumentType.Create(NativeDocument.DocType);
end;
function TODOMDocument.get_documentElement: IDOMElement;
begin
if not Assigned(FDocumentElement) or
(FNativeDocumentElement <> NativeDocument.documentElement) then { Test if underlying document NativeElement changed }
begin
FNativeDocumentElement := NativeDocument.documentElement;
FDocumentElement := MakeNode(FNativeDocumentElement) as IDOMElement;
end;
Result := FDocumentElement;
end;
function TODOMDocument.get_domImplementation: IDOMImplementation;
begin
Result := FWrapperDOMImpl;
end;
function TODOMDocument.getElementById(const elementId: DOMString): IDOMElement;
begin
DOMVendorNotSupported('getElementById', sOmniXmlVendor); { Do not localize }
end;
function TODOMDocument.getElementsByTagName(const tagName: DOMString): IDOMNodeList;
begin
Result := MakeNodeList(NativeDocument.GetElementsByTagName(tagName));
end;
function TODOMDocument.getElementsByTagNameNS(const namespaceURI, localName: DOMString): IDOMNodeList;
begin
Result := MakeNodeList(NativeDocument.GetElementsByTagNameNS(namespaceURI, localName));
end;
function TODOMDocument.importNode(importedNode: IDOMNode; deep: WordBool):
IDOMNode;
begin
DOMVendorNotSupported('importNode', sOmniXmlVendor); { Do not localize }
end;
procedure TODOMDocument.set_documentElement(const DOMElement: IDOMElement);
begin
if Assigned(DOMElement) then
begin
if Assigned(NativeDocument.documentElement) then
NativeDocument.replaceChild(GetNativeNodeOfIntfNode(DOMElement),
NativeDocument.documentElement)
else
NativeDocument.appendChild(GetNativeNodeOfIntfNode(DOMElement));
end
else
if Assigned(NativeDocument.documentElement) then
NativeDocument.removeChild(NativeDocument.documentElement);
FDocumentElement := nil;
end;
{ IDOMParseOptions Interface }
function TODOMDocument.get_async: Boolean;
begin
Result := False;
end;
function TODOMDocument.get_preserveWhiteSpace: Boolean;
begin
Result := NativeDocument.PreserveWhiteSpace;
end;
function TODOMDocument.get_resolveExternals: Boolean;
begin
Result := False;
end;
function TODOMDocument.get_validate: Boolean;
begin
Result := False;
end;
procedure TODOMDocument.set_async(Value: Boolean);
begin
if Value then
DOMVendorNotSupported('set_async(True)', sOmniXmlVendor); { Do not localize }
end;
procedure TODOMDocument.set_preserveWhiteSpace(Value: Boolean);
begin
NativeDocument.PreserveWhitespace := Value;
end;
procedure TODOMDocument.set_resolveExternals(Value: Boolean);
begin
if Value then
DOMVendorNotSupported('set_resolveExternals(True)', sOmniXmlVendor); { Do not localize }
end;
procedure TODOMDocument.set_validate(Value: Boolean);
begin
if Value then
DOMVendorNotSupported('set_validate(True)', sOmniXmlVendor); { Do not localize }
end;
{ IDOMPersist interface }
function TODOMDocument.get_xml: DOMString;
begin
Result := FNativeDocument.XML;
end;
function TODOMDocument.load(source: OleVariant): WordBool;
begin
Result := FNativeDocument.Load(source);
end;
function TODOMDocument.loadxml(const Value: DOMString): WordBool;
begin
Result := FNativeDocument.LoadXML(Value);
end;
function TODOMDocument.loadFromStream(const stream: TStream): WordBool;
begin
Result := FNativeDocument.LoadFromStream(stream);
end;
function TODOMDocument.loadFromStream(const stream: IStream): WordBool;
begin
DOMVendorNotSupported('loadFromStream(IStream)', sOmniXmlVendor); { Do not localize }
end;
procedure TODOMDocument.save(destination: OleVariant);
begin
FNativeDocument.Save(destination);
end;
procedure TODOMDocument.saveToStream(const stream: TStream);
begin
FNativeDocument.SaveToStream(stream,ofNone);
end;
procedure TODOMDocument.saveToStream(const stream: IStream);
begin
DOMVendorNotSupported('saveToStream(IStream)', sOmniXmlVendor); { Do not localize }
end;
{ IDOMParseError }
function TODOMDocument.get_errorCode: Integer;
begin
Result := FNativeDocument.ParseError.errorCode;
end;
function TODOMDocument.get_filepos: Integer;
begin
Result := FNativeDocument.ParseError.filePos;
end;
function TODOMDocument.get_line: Integer;
begin
Result := FNativeDocument.ParseError.line;
end;
function TODOMDocument.get_linepos: Integer;
begin
Result := FNativeDocument.ParseError.linePos;
end;
function TODOMDocument.get_reason: DOMString;
begin
Result := FNativeDocument.ParseError.reason;
end;
function TODOMDocument.get_srcText: DOMString;
begin
Result := FNativeDocument.ParseError.srcText;
end;
function TODOMDocument.get_url: DOMString;
begin
Result := FNativeDocument.ParseError.url;
end;
function TODOMDocument.asyncLoadState: Integer;
begin
result := 0; { Not Supported }
end;
procedure TODOMDocument.set_OnAsyncLoad(const Sender: TObject;
EventHandler: TAsyncEventHandler);
begin
DOMVendorNotSupported('set_OnAsyncLoad', sOmniXmlVendor); { Do not Localize }
end;
procedure TODOMDocument.RemoveWhiteSpaceNodes;
begin
DOMVendorNotSupported('RemoveWhiteSpaceNodes', sOmniXmlVendor); { Do not Localize }
end;
function TODOMElement.GetNativeElement: OmniIXMLElement;
begin
Result := NativeNode as OmniIXMLElement;
end;
function TODOMElement.get_tagName: DOMString;
begin
Result := NativeElement.TagName;
end;
function TODOMElement.getAttribute(const name: DOMString): DOMString;
begin
Result := NativeElement.GetAttribute(name);
end;
function TODOMElement.getAttributeNode(const name: DOMString): IDOMAttr;
begin
Result := MakeNode(NativeElement.GetAttributeNode(name)) as IDOMAttr;
end;
function TODOMElement.getAttributeNodeNS(const namespaceURI, localName: DOMString): IDOMAttr;
begin
Result := MakeNode(NativeElement.GetAttributeNodeNS(namespaceURI, localName)) as IDOMAttr;
end;
function TODOMElement.getAttributeNS(const namespaceURI, localName: DOMString): DOMString;
begin
Result := NativeElement.GetAttributeNS(namespaceURI, localName);
end;
function TODOMElement.getElementsByTagName(const name: DOMString):
IDOMNodeList;
begin
Result := MakeNodeList(NativeElement.GetElementsByTagName(name));
end;
function TODOMElement.getElementsByTagNameNS(const namespaceURI, localName: DOMString): IDOMNodeList;
begin
Result := MakeNodeList(NativeElement.GetElementsByTagNameNS(namespaceURI, localName));
end;
function TODOMElement.hasAttribute(const name: DOMString): WordBool;
begin
Result := Assigned(NativeElement.Attributes.GetNamedItem(name));
end;
function TODOMElement.hasAttributeNS(const namespaceURI, localName: DOMString): WordBool;
begin
Result := Assigned(NativeElement.Attributes.GetNamedItemNS(namespaceURI, localName));
end;
procedure TODOMElement.removeAttribute(const name: DOMString);
var
NatOldAttr: OmniIXMLNode;
begin
NatOldAttr := NativeElement.GetAttributeNode(name);
NativeElement.Attributes.Remove(NatOldAttr);
end;
function TODOMElement.removeAttributeNode(const oldAttr: IDOMAttr): IDOMAttr;
var
NatOldAttr: OmniIXMLNode;
begin
Result := nil;
NatOldAttr := GetNativeNodeOfIntfNode(OldAttr);
if NativeElement.Attributes.Remove(NatOldAttr) >= 0 then
Result := OldAttr;
end;
procedure TODOMElement.removeAttributeNS(const namespaceURI, localName: DOMString);
var
NatOldAttr: OmniIXMLNode;
begin
NatOldAttr := NativeElement.GetAttributeNodeNS(namespaceURI, localName);
NativeElement.Attributes.Remove(NatOldAttr);
end;
procedure TODOMElement.setAttribute(const name, value: DOMString);
begin
NativeElement.SetAttribute(name, value);
end;
function TODOMElement.setAttributeNode(const newAttr: IDOMAttr): IDOMAttr;
begin
Result := MakeNode(NativeElement.SetAttributeNode(GetNativeNodeOfIntfNode(newAttr) as OmniIXMLAttr)) as IDOMAttr;
end;
procedure TODOMElement.setAttributeNS(const namespaceURI, qualifiedName, value: DOMString);
begin
NativeElement.SetAttributeNS(qualifiedName, value);
end;
function TODOMElement.setAttributeNodeNS(const newAttr: IDOMAttr): IDOMAttr;
begin
Result := (NativeElement.SetAttributeNodeNS(newAttr as OmniIXMLAttr))as IDOMAttr;
end;
procedure TODOMElement.normalize;
begin
NativeElement.normalize;
end;
function TODOMCharacterData.GetNativeCharacterData: OmniIXMLCharacterData;
begin
Result := NativeNode as OmniIXMLCharacterData;
end;
procedure TODOMCharacterData.appendData(const data: DOMString);
begin
NativeCharacterData.AppendData(data);
end;
procedure TODOMCharacterData.deleteData(offset, count: Integer);
begin
NativeCharacterData.DeleteData(offset, count);
end;
function TODOMCharacterData.get_data: DOMString;
begin
Result := NativeCharacterData.Data;
end;
function TODOMCharacterData.get_length: Integer;
begin
Result := NativeCharacterData.length;
end;
procedure TODOMCharacterData.insertData(offset: Integer; const data: DOMString);
begin
NativeCharacterData.InsertData(offset, data);
end;
procedure TODOMCharacterData.replaceData(offset, count: Integer; const data: DOMString);
begin
NativeCharacterData.ReplaceData(offset, count, data);
end;
procedure TODOMCharacterData.set_data(const data: DOMString);
begin
NativeCharacterData.Data := data;
end;
function TODOMCharacterData.substringData(offset, count: Integer): DOMString;
begin
Result := NativeCharacterData.SubstringData(offset, count);
end;
function TODOMAttr.GetNativeAttribute: OmniIXMLAttr;
begin
Result := NativeNode as OmniIXMLAttr;
end;
function TODOMAttr.get_name: DOMString;
begin
Result := NativeAttribute.Name;
end;
function TODOMAttr.get_ownerElement: IDOMElement;
begin
Result := MakeNode(NativeAttribute.OwnerElement) as IDOMElement;
end;
function TODOMAttr.get_specified: WordBool;
begin
Result := NativeAttribute.Specified;
end;
function TODOMAttr.get_value: DOMString;
begin
Result := NativeAttribute.Value;
end;
procedure TODOMAttr.set_value(const attributeValue: DOMString);
begin
NativeAttribute.nodeValue := attributeValue;
end;
function TODOMText.splitText(offset: Integer): IDOMText;
begin
Result := MakeNode((NativeNode as OmniIXMLText).SplitText(offset)) as IDOMText;
end;
function TODOMProcessingInstruction.GetNativeProcessingInstruction: OmniIXMLProcessingInstruction;
begin
Result := NativeNode as OmniIXMLProcessingInstruction;
end;
function TODOMProcessingInstruction.get_data: DOMString;
begin
Result := NativeProcessingInstruction.Data;
end;
function TODOMProcessingInstruction.get_target: DOMString;
begin
Result := NativeProcessingInstruction.Target;
end;
procedure TODOMProcessingInstruction.set_data(const value: DOMString);
begin
// Acces to Data protected, setted in the constructor.
DOMVendorNotSupported('set_data', sOmniXmlVendor); { Do not localize }
end;
function TODOMImplementationFactory.DOMImplementation: IDOMImplementation;
begin
if not Assigned(GlobalODOM) then
begin
GlobalODOM := TODOMImplementation.Create;
FGlobalDOMImpl := GlobalODOM;
end;
Result := FGlobalDOMImpl;
end;
function TODOMImplementationFactory.Description: String;
begin
Result := sOmniXmlVendor;
end;
initialization
OmniXML4Factory := TODOMImplementationFactory.Create;
RegisterDOMVendor(OmniXML4Factory);
finalization
UnRegisterDOMVendor(OmniXML4Factory);
OmniXML4Factory.Free;
end.
|
unit Antlr.Runtime.Tests;
interface
uses
Classes,
SysUtils,
TestFramework,
Antlr.Runtime;
type
// Test methods for class IANTLRStringStream
TestANTLRStringStream = class(TTestCase)
strict private
const
NL = #13#10;
GRAMMARSTR = ''
+ 'parser grammar p;' + NL
+ 'prog : WHILE ID LCURLY (assign)* RCURLY EOF;' + NL
+ 'assign : ID ASSIGN expr SEMI ;' + NL
+ 'expr : INT | FLOAT | ID ;' + NL;
public
procedure SetUp; override;
procedure TearDown; override;
published
procedure TestSizeOnEmptyANTLRStringStream;
procedure TestSizeOnANTLRStringStream;
procedure TestConsumeOnANTLRStringStream;
procedure TestResetOnANTLRStringStream;
procedure TestSubstringOnANTLRStringStream;
end;
implementation
{ TestANTLRStringStream }
procedure TestANTLRStringStream.SetUp;
begin
end;
procedure TestANTLRStringStream.TearDown;
begin
end;
procedure TestANTLRStringStream.TestConsumeOnANTLRStringStream;
var
Stream: IANTLRStringStream;
begin
Stream := TANTLRStringStream.Create('One'#13#10'Two');
CheckEquals(0, Stream.Index);
CheckEquals(0, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // O
CheckEquals(1, Stream.Index);
CheckEquals(1, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // n
CheckEquals(2, Stream.Index);
CheckEquals(2, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // e
CheckEquals(3, Stream.Index);
CheckEquals(3, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // #13
CheckEquals(4, Stream.Index);
CheckEquals(4, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // #10
CheckEquals(5, Stream.Index);
CheckEquals(0, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
Stream.Consume; // T
CheckEquals(6, Stream.Index);
CheckEquals(1, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
Stream.Consume; // w
CheckEquals(7, Stream.Index);
CheckEquals(2, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
Stream.Consume; // o
CheckEquals(8, Stream.Index);
CheckEquals(3, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
Stream.Consume; // EOF
CheckEquals(8, Stream.Index);
CheckEquals(3, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
Stream.Consume; // EOF
CheckEquals(8, Stream.Index);
CheckEquals(3, Stream.CharPositionInLine);
CheckEquals(2, Stream.Line);
end;
procedure TestANTLRStringStream.TestResetOnANTLRStringStream;
var
Stream: IANTLRStringStream;
begin
Stream := TANTLRStringStream.Create('One'#13#10'Two');
CheckEquals(0, Stream.Index);
CheckEquals(0, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // O
Stream.Consume; // n
CheckEquals(Ord('e'), Stream.LA(1));
CheckEquals(2, Stream.Index);
Stream.Reset;
CheckEquals(Ord('O'), Stream.LA(1));
CheckEquals(0, Stream.Index);
CheckEquals(0, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // O
CheckEquals(Ord('n'), Stream.LA(1));
CheckEquals(1, Stream.Index);
CheckEquals(1, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // n
CheckEquals(Ord('e'), Stream.LA(1));
CheckEquals(2, Stream.Index);
CheckEquals(2, Stream.CharPositionInLine);
CheckEquals(1, Stream.Line);
Stream.Consume; // n
end;
procedure TestANTLRStringStream.TestSizeOnANTLRStringStream;
var
S1, S2, S3: IANTLRStringStream;
begin
S1 := TANTLRStringStream.Create('lexer'#13#10);
CheckEquals(7, S1.Size);
S2 := TANTLRStringStream.Create(GRAMMARSTR);
CheckEquals(Length(GRAMMARSTR), S2.Size);
S3 := TANTLRStringStream.Create('grammar P;');
CheckEquals(10, S3.Size);
end;
procedure TestANTLRStringStream.TestSizeOnEmptyANTLRStringStream;
var
S1: IANTLRStringStream;
begin
S1 := TANTLRStringStream.Create('');
CheckEquals(0, S1.Size);
CheckEquals(0, S1.Index);
end;
procedure TestANTLRStringStream.TestSubstringOnANTLRStringStream;
var
Stream: IANTLRStringStream;
begin
Stream := TANTLRStringStream.Create('One'#13#10'Two'#13#10'Three');
CheckEquals('Two', Stream.Substring(5, 7));
CheckEquals('One', Stream.Substring(0, 2));
CheckEquals('Three', Stream.Substring(10, 14));
Stream.Consume;
CheckEquals('Two', Stream.Substring(5, 7));
CheckEquals('One', Stream.Substring(0, 2));
CheckEquals('Three', Stream.Substring(10, 14));
end;
initialization
// Register any test cases with the test runner
RegisterTest(TestANTLRStringStream.Suite);
end.
|
unit UPaletteEditor;
{$mode objfpc}{$H+}
interface
uses
Classes, ExtCtrls, UBaseShape, UInspector, typinfo, Graphics;
type
TMainColorUpdateEvent = procedure(Sender: TObject) of object;
TSecondaryColorUpdateEvent = procedure(Sender: TObject) of object;
{ TPenColorEditor }
TPenColorEditor = class(TParamEditor)
private
procedure Change(Sender: TObject); override;
procedure Refresh;
public
constructor Create(AShapes: array of TShape; APropInfo: PPropInfo;
APanel: TPanel; ADefaultParams: Boolean); override;
destructor Destroy; override;
end;
{ TBrushColorEditor }
TBrushColorEditor = class(TParamEditor)
private
procedure Change(Sender: TObject); override;
procedure Refresh;
public
constructor Create(AShapes: array of TShape; APropInfo: PPropInfo;
APanel: TPanel; ADefaultParams: Boolean); override;
destructor Destroy; override;
end;
var
PenColor, BrushColor: ExtCtrls.TShape;
OnMainColorUpdate: TMainColorUpdateEvent;
OnBrushColorUpdate: TSecondaryColorUpdateEvent;
implementation
{ TBrushColorEditor }
procedure TBrushColorEditor.Change(Sender: TObject);
var i: Integer;
begin
for i:= 0 to High(FShapes) do
SetInt64Prop(FShapes[i], FPropInfo, BrushColor.Brush.Color);
inherited Change(Sender);
end;
procedure TBrushColorEditor.Refresh;
var
j: Int64;
i, c, r, g, b: Integer;
begin
c := 0;
r := 0;
g := 0;
b := 0;
for i := 0 to High(FShapes) do
begin
c += 1;
j := GetInt64Prop(FShapes[i], FPropInfo);
r += Red(j);
g += Green(j);
b += Blue(j);
end;
BrushColor.Brush.Color := RGBToColor(r div c, g div c, b div c);
end;
constructor TBrushColorEditor.Create(AShapes: array of TShape;
APropInfo: PPropInfo; APanel: TPanel; ADefaultParams: Boolean);
var i: Integer;
begin
SetLength(FShapes, Length(AShapes));
for i := 0 to High(AShapes) do
FShapes[i] := AShapes[i];
FPropInfo := APropInfo;
if ADefaultParams then
for i:= 0 to High(FShapes) do
SetInt64Prop(FShapes[i], FPropInfo, BrushColor.Brush.Color);
Refresh;
OnBrushColorUpdate := @Change;
end;
destructor TBrushColorEditor.Destroy;
begin
OnBrushColorUpdate := nil;
end;
{ TPenColorEditor }
procedure TPenColorEditor.Change(Sender: TObject);
var i: Integer;
begin
for i:= 0 to High(FShapes) do
SetInt64Prop(FShapes[i], FPropInfo, PenColor.Brush.Color);
inherited Change(Sender);
end;
procedure TPenColorEditor.Refresh;
var
j: Int64;
i, c, r, g, b: Integer;
begin
c := 0;
r := 0;
g := 0;
b := 0;
for i := 0 to High(FShapes) do
begin
c += 1;
j := GetInt64Prop(FShapes[i], FPropInfo);
r += Red(j);
g += Green(j);
b += Blue(j);
end;
PenColor.Brush.Color := RGBToColor(r div c, g div c, b div c);
end;
constructor TPenColorEditor.Create(AShapes: array of TShape;
APropInfo: PPropInfo; APanel: TPanel; ADefaultParams: Boolean);
var i: Integer;
begin
SetLength(FShapes, Length(AShapes));
for i := 0 to High(AShapes) do
FShapes[i] := AShapes[i];
FPropInfo := APropInfo;
if ADefaultParams then
for i:= 0 to High(FShapes) do
SetInt64Prop(FShapes[i], FPropInfo, PenColor.Brush.Color);
Refresh;
OnMainColorUpdate := @Change;
end;
destructor TPenColorEditor.Destroy;
begin
OnMainColorUpdate := nil;
end;
initialization
EditorContainer.RegisterEditor(TPenColorEditor, 'TPenColor');
EditorContainer.RegisterEditor(TBrushColorEditor, 'TBrushColor');
end.
|
unit ClassPlayer;
interface
uses ClassBoard, ClassLetters, ClassLetterStack;
type TMove = array of TTile;
TPlayer = class
protected
FLtrStack : TLetterStack;
FBoard : TBoard;
FLastMove : TMove;
FScore : integer;
public
constructor Create( Letters : TLetters; Board : TBoard );
destructor Destroy; override;
procedure MakeMove( FirstMove : boolean ); virtual; abstract;
function EndMove : boolean; virtual; abstract;
procedure TakeLetters;
procedure ChangeLetters;
procedure ChangeSomeLetters; virtual; abstract;
function GetRest : integer;
property Score : integer read FScore write FScore;
property LastMove : TMove read FLastMove;
property LtrStack : TLetterStack read FLtrStack;
end;
implementation
//==============================================================================
// Constructor / destructor
//==============================================================================
constructor TPlayer.Create( Letters : TLetters; Board : TBoard );
begin
inherited Create;
FLtrStack := TLetterStack.Create( Letters );
FBoard := Board;
FScore := 0;
SetLength( FLastMove , 0 );
end;
destructor TPlayer.Destroy;
begin
FLtrStack.Free;
inherited;
end;
//==============================================================================
// P R I V A T E
//==============================================================================
//==============================================================================
// P U B L I C
//==============================================================================
procedure TPlayer.TakeLetters;
begin
FLtrStack.TakeNew;
end;
procedure TPlayer.ChangeLetters;
begin
FLtrStack.ChangeStack;
end;
function TPlayer.GetRest : integer;
var I : integer;
begin
Result := 0;
for I := 1 to 7 do
if (FLtrStack.Stack[I].C <> #0) then
Inc( Result , FLtrStack.Stack[I].Value );
end;
end.
|
{
GetACK: Get the ACK on the record
}
FUNCTION GetACK(timeoutSecs : INTEGER) : ResponseType;
CONST
CTRLC = ^C;
ACK = ^F;
NAK = ^U;
CAN = ^X;
WANTCRC = 'C';
VAR
ticks,canCount : INTEGER;
c : CHAR;
BEGIN
ticks := timeoutSecs * 500;
canCount := 0;
c := #$00;
REPEAT
IF KeyPressed THEN BEGIN
Read(Kbd,c);
IF c = CTRLC THEN
GetACK := GotABORT
ELSE
c := #$00;
END ELSE IF ModemInReady THEN BEGIN
Read(Aux,c);
CASE c OF
ACK : GetACK := GotACK;
NAK : GetACK := GotNAK;
WantCRC :
BEGIN
GetAck := GotNAK;
c := NAK;
END;
CAN :
BEGIN
canCount := Succ(canCount);
IF canCount >= 2 THEN
GetACK := GotCAN
ELSE
c := #$00;
END;
ELSE BEGIN
canCount := 0;
c := #$00;
END;
END;
END ELSE BEGIN
Delay(2);
ticks := Pred(ticks);
END;
UNTIL (c <> #$00) OR (ticks = 0);
IF c = #$00 THEN
GetACK := GotTIMEOUT;
END;
|
unit eSocial.Services.Utils;
interface
uses
System.Classes,
System.Types,
Vcl.ExtCtrls;
type
TServiceUtils = class
class function ImageResource(aResourceName : String; aImage : TImage) : string;
end;
implementation
{ TServiceUtils }
class function TServiceUtils.ImageResource(aResourceName: String; aImage: TImage): string;
var
aResource : TResourceStream;
begin
try
aResource := TResourceStream.Create(HInstance, aResourceName, RT_RCDATA);
aImage.Picture.LoadFromStream(aResource);
finally
aResource.DisposeOf;
end;
end;
end.
|
program FizzBuzz;
var i:integer;
begin
for i:=1 to 100 do begin
if (i mod 3=0) and (i mod 5=0) then writeln('FizzBuzz') else begin
if i mod 3=0 then writeln('Fizz') else
if i mod 5=0 then writeln('Buzz') else writeln(i);
end;
end;
readln;
end.
|
{
AD.A.P.T. Library
Copyright (C) 2014-2018, Simon J Stuart, All Rights Reserved
Original Source Location: https://github.com/LaKraven/ADAPT
Subject to original License: https://github.com/LaKraven/ADAPT/blob/master/LICENSE.md
}
unit ADAPT.Demo.EventEnginePlayground.Events;
{$I ADAPT.inc}
interface
uses
System.Classes,
ADAPT.EventEngine.Intf, ADAPT.EventEngine;
type
{
This "Test Event" simply takes a String Message as its "Payload"
This String Message could be consumed in an infinite variety of ways by individual Listeners.
NOTE: We provide a Reintroduced "Constructor" to initialize the Value because this must only be set ONCE...
and must ALWAYS be set BEFORE we dispatch the Event to the Queue/Stack (or Scheduler).
After dispatch, we must NEVER change this Value! That is ABSOLUTELY CRITICAL!
}
TTestEvent = class(TADEvent)
private
FMessage: String;
public
constructor Create(const AMessage: String); reintroduce;
property Message: String read FMessage;
end;
{
Just as with the "Test Event", this Response Event takes a String as its "Payload".
The idea is that any Event Thread listening for "Test Event" will perform an operation on its Payload,
then return the resulting "Response" by emitting a "TTestResponseEvent" instance.
}
TTestResponseEvent = class(TADEvent)
private
FResponse: String;
public
constructor Create(const AResponse: String); reintroduce;
property Response: String read FResponse;
end;
implementation
{ TTestEvent }
constructor TTestEvent.Create(const AMessage: String);
begin
inherited Create;
FMessage := AMessage;
end;
{ TTestResponseEvent }
constructor TTestResponseEvent.Create(const AResponse: String);
begin
inherited Create;
FResponse := AResponse;
end;
end.
|
unit mEvntDelay;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
StdCtrls, ORCtrls, ORDtTm, uCore, ORFn, ExtCtrls,UConst;
type
TfraEvntDelayList = class(TFrame)
pnlDate: TPanel;
pnlList: TPanel;
mlstEvents: TORListBox;
edtSearch: TCaptionEdit;
lblEffective: TLabel;
orDateBox: TORDateBox;
lblEvntDelayList: TLabel;
procedure edtSearchChange(Sender: TObject);
procedure mlstEventsChange(Sender: TObject);
procedure mlstEventsClick(Sender: TObject);
procedure mlstEventsKeyUp(Sender: TObject; var Key: Word;
Shift: TShiftState);
procedure edtSearchKeyDown(Sender: TObject; var Key: Word;
Shift: TShiftState);
private
FEvntLimit: Char;
FUserDefaultEvent:integer;
FDefaultEvent: integer;
FMatchedCancel: Boolean;
FDisableWarning: Boolean;
FIsForCpXfer: Boolean;
public
constructor Create(AOwner: TComponent); override;
procedure ResetProperty;
procedure DisplayEvntDelayList;
procedure CheckMatch;
property EvntLimit: Char read FEvntLimit write FEvntLimit;
property UserDefaultEvent: integer read FUserDefaultEvent write FUserDefaultEvent;
property DefaultEvent : integer read FDefaultEvent write FDefaultEvent;
property MatchedCancel : Boolean read FMatchedCancel write FMatchedCancel;
property DisableWarning : Boolean read FDisableWarning write FDisableWarning;
property IsForCpXfer : Boolean read FIsForCpXfer write FIsForCpXfer;
end;
implementation
{$R *.DFM}
uses
rOrders, fOrders, fOrdersTS, fMedCopy, fOrdersCopy, VA508AccessibilityRouter;
{ TfraEvntDelayList }
const
TX_MCHEVT1 = ' is already assigned to ';
TX_MCHEVT2 = #13 + 'Do you still want to write delayed orders?';
TX_MCHEVT3 = #13#13 + 'If you continue to write delayed orders to this event,'
+ 'they will not release until the patient moves away from and returns to this ward and treating specialty.'
+ #13#13 + 'If you want these orders to be activated at signature, '
+ 'then please write them under the ACTIVE view (and not as delayed orders).';
TX_XISTEVT1 = 'Delayed orders already exist for event Delayed ';
TX_XISTEVT2 = #13 + 'Do you want to view those orders?';
constructor TfraEvntDelayList.Create(AOwner: TComponent);
begin
inherited Create(AOwner);
TabStop := FALSE;
FDisableWarning := False;
FMatchedCancel := False;
FIsForCpXfer := False;
FEvntLimit := #0;
FUserDefaultEvent := 0;
FDefaultEvent := 0;
end;
procedure TfraEvntDelayList.DisplayEvntDelayList;
var
i: integer;
tempStr: string;
defaultEvtType: Char;
NoUserDefault: boolean;
const
LINE = '^^^^^^^^________________________________________________________________________________________';
begin
inherited;
mlstEvents.Items.Clear;
mlstEvents.InitLongList('');
NoUserDefault := False;
defaultEvtType := #0;
if Patient.Inpatient then
ListSpecialtiesED(EvntLimit,mlstEvents.Items)
else
ListSpecialtiesED('A',mlstEvents.Items);
if mlstEvents.Items.Count < 1 then
Exit;
mlstEvents.ItemIndex := -1;
if not Patient.Inpatient then
begin
if UserDefaultEvent > 0 then
defaultEvtType := CharAt(EventInfo1(IntToStr(UserDefaultEvent)),1);
if CharInSet(defaultEvtType, ['T','D']) then
NoUserDefault := True;
end;
if (UserDefaultEvent > 0) and (not NoUserDefault) then
begin
for i := 0 to mlstEvents.Items.Count - 1 do
begin
if Piece(mlstEvents.Items[i],'^',1)=IntToStr(UserDefaultEvent) then
begin
tempStr := mlstEvents.Items[i];
Break;
end;
end;
end;
if Length(tempStr)>0 then
begin
DisableWarning := True;
mlstEvents.Items.Insert(0,tempStr);
mlstEvents.Items.Insert(1,LINE);
mlstEvents.Items.Insert(2,LLS_SPACE);
mlstEvents.ItemIndex := 0;
edtSearch.Text := mlstEvents.DisplayText[0];
tempStr := '';
DisableWarning := False;
end;
if (DefaultEvent > 0) and (mlstEvents.ItemIndex<0) then
begin
for i := 0 to mlstEvents.items.Count - 1 do
begin
if Piece(mlstEvents.items[i],'^',1)=IntToStr(DefaultEvent) then
begin
tempStr := mlstEvents.Items[i];
Break;
end;
end;
end;
if Length(tempStr)>0 then
begin
mlstEvents.Items.Insert(0,tempStr);
mlstEvents.Items.Insert(1,LINE);
mlstEvents.Items.Insert(2,LLS_SPACE);
mlstEvents.ItemIndex := 0;
edtSearch.Text := mlstEvents.DisplayText[0];
tempStr := '';
end;
end;
procedure TfraEvntDelayList.ResetProperty;
begin
FEvntLimit := #0;
FUserDefaultEvent := 0;
FDefaultEvent := 0;
FMatchedCancel := False;
FDisableWarning := False;
FIsForCpXfer := False;
end;
procedure TfraEvntDelayList.CheckMatch;
var
AnEvtID, ATsName: string;
begin
if mlstEvents.ItemIndex < 0 then Exit;
FMatchedCancel := False;
AnEvtID := Piece(mlstEvents.Items[mlstEvents.ItemIndex],'^',1);
if isMatchedEvent(Patient.DFN,AnEvtID,ATsName) and (not DisableWarning) then
begin
if InfoBox(Patient.Name + TX_MCHEVT1 + ATsName + ' on ' + Encounter.LocationName + TX_MCHEVT2,
'Warning', MB_OKCANCEL or MB_ICONWARNING) = IDCANCEL then
begin
FMatchedCancel := True;
frmOrders.lstSheets.ItemIndex := 0;
frmOrders.lstSheetsClick(Self);
end;
end;
end;
procedure TfraEvntDelayList.edtSearchChange(Sender: TObject);
var
i: integer;
needle,hay: String;
begin
if Length(edtSearch.Text)<1 then Exit;
if (edtSearch.Modified) then
begin
needle := UpperCase(edtSearch.text);
if length(needle)=0 then exit;
for i := 0 to mlstEvents.Items.Count - 1 do
begin
hay := UpperCase(mlstEvents.DisplayText[i]);
hay := Copy(hay,0,length(needle));
if Pos(needle, hay) > 0 then
begin
mlstEvents.ItemIndex := i;
mlstEvents.TopIndex := i;
edtSearch.Text := mlstEvents.DisplayText[mlstEvents.itemindex];
edtSearch.SelStart := length(needle);
edtSearch.SelLength := length(edtSearch.Text);
exit;
end;
end;
end;
end;
procedure TfraEvntDelayList.mlstEventsChange(Sender: TObject);
var
i,idx : integer;
AnEvtID, AnEvtType, APtEvtID: string;
AnEvtName,ATsName: string;
begin
inherited;
if mlstEvents.ItemIndex >= 0 then
begin
AnEvtID := Piece(mlstEvents.Items[mlstEvents.ItemIndex],'^',1);
AnEvtType := Piece(mlstEvents.Items[mlstEvents.ItemIndex],'^',3);
idx := mlstEvents.ItemIndex;
end else
begin
AnEvtID := '';
AnEvtType := '';
idx := -1;
end;
if AnEvtType = 'D' then
begin
pnlDate.Visible := True;
lblEffective.Left := 1;
orDateBox.Left := 1;
orDateBox.Hint := orDateBox.Text;
end else
pnlDate.Visible := False;
if mlstEvents.ItemIndex >= 0 then
AnEvtName := Piece(mlstEvents.Items[mlstEvents.ItemIndex],'^',9)
else
AnEvtName := '';
if isExistedEvent(Patient.DFN, AnEvtID, APtEvtID) then
begin
if IsForCpXfer then
DisableWarning := True;
for i := 0 to frmOrders.lstSheets.Items.Count - 1 do
begin
if Piece(frmOrders.lstSheets.Items[i],'^',1)=APtEvtID then
begin
frmOrders.lstSheets.ItemIndex := i;
frmOrders.ClickLstSheet;
end;
end;
IsForCpXfer := False;
end;
if (StrToIntDef(AnEvtID,0)>0) and (isMatchedEvent(Patient.DFN,AnEvtID,ATsName))
and (not DisableWarning) then
begin
if InfoBox(Patient.Name + TX_MCHEVT1 + ATsName + ' on ' + Encounter.LocationName + TX_MCHEVT2 + TX_MCHEVT3,
'Warning', MB_OKCANCEL or MB_ICONWARNING) = IDCANCEL then
begin
FMatchedCancel := True;
frmOrders.lstSheets.ItemIndex := 0;
frmOrders.lstSheetsClick(Self);
end else
begin
if Screen.ActiveForm.Name = 'frmOrdersTS' then
SendMessage(frmOrdersTS.Handle, UM_STILLDELAY, 0, 0);
if Screen.ActiveForm.Name = 'frmMedCopy' then
SendMessage(frmMedCopy.Handle, UM_STILLDELAY, 0, 0);
if Screen.ActiveForm.Name = 'frmCopyOrders' then
SendMessage(frmCopyOrders.Handle, UM_STILLDELAY, 0, 0);
end;
end;
mlstEvents.ItemIndex := idx;
end;
procedure TfraEvntDelayList.mlstEventsClick(Sender: TObject);
begin
edtSearch.Text := mlstEvents.DisplayText[mlstEvents.ItemIndex];
end;
procedure TfraEvntDelayList.mlstEventsKeyUp(Sender: TObject; var Key: Word;
Shift: TShiftState);
begin
if (mlstEvents.ItemIndex <> mlstEvents.FocusIndex) and (mlstEvents.FocusIndex > -1) then
begin
if (Key = VK_UP) and ( ( mlstEvents.ItemIndex - mlstEvents.FocusIndex) > 1) and (mlstEvents.ItemIndex > 0) then
mlstEvents.ItemIndex := mlstEvents.ItemIndex - 1;
if (Key = VK_DOWN) and (mlstEvents.FocusIndex < mlstEvents.ItemIndex) then
mlstEvents.ItemIndex := mlstEvents.ItemIndex + 1
else
mlstEvents.ItemIndex := mlstEvents.FocusIndex;
edtSearch.text := mlstEvents.DisplayText[mlstEvents.ItemIndex];
mlstEvents.TopIndex := mlstEvents.ItemIndex;
end;
end;
procedure TfraEvntDelayList.edtSearchKeyDown(Sender: TObject;
var Key: Word; Shift: TShiftState);
var
x : string;
i : integer;
begin
if Key in [VK_PRIOR, VK_NEXT, VK_UP, VK_DOWN] then
begin
edtSearch.SelectAll;
Key := 0;
end
else if Key = VK_BACK then
begin
x := edtSearch.Text;
i := edtSearch.SelStart;
if i > 1 then Delete(x, i + 1, Length(x)) else x := '';
edtSearch.Text := x;
if i > 1 then edtSearch.SelStart := i;
end
end;
initialization
SpecifyFormIsNotADialog(TfraEvntDelayList);
end.
|
unit UValidacao;
interface
uses SysUtils, Messages, Dialogs;
function validar_CPF_CNPJ (valor : string) : Boolean;
function validarEmail (const EMailIn: String) : Boolean;
function validarUF(UF : String) : Boolean;
function validarData(Data:TDateTime; Tipo:Integer) : Boolean;
procedure validarCaracteres(Sender: TObject; var Key: Char; TipoCampo: String);
implementation
{ Validacao }
function validar_CPF_CNPJ(valor: string): Boolean;
var i : integer;
equal: char;
valid : boolean;
digit1, digit2 : Integer;
cpf, cnpj : string;
apoio: array[0..15] of integer;
begin
valor := Trim(valor);
if Length(valor) = 11 then
begin
cpf := valor;
digit1 := 0;
digit2 := 0;
equal := cpf[1]; //variavel para testar se o cpf é repetido: Ex: 111.111.111-11
// Testar se o CPF é repetido
for i := 1 to Length(cpf) do
begin
if cpf[i] <> equal then
begin
valid := True; // Se o CPF possui um digito diferente ele passou no primeiro teste
Break;
end;
end;
// Se o cpf é composto por numeros repetido retorna falso
if not valid then
begin
validar_CPF_CNPJ := False;
exit;
end;
// Executa o calculo para o primeiro verificador
for i:=1 to 9 do
begin
digit1:= digit1+(strtoint(cpf[10-i])*(i+1)); // formula do primeiro verificador soma=1°*2 + 2°*3 + 3°*4.. até 9°*10
end;
digit1:= ((11 - (digit1 mod 11))mod 11) mod 10; // digito1 = 11 - soma mod 11 se digito > 10 digito1 =0
// Verifica se o 1° digito confere
if IntToStr(digit1) <> cpf[10] then
begin
validar_CPF_CNPJ := False;
exit;
end;
for i:=1 to 10 do
begin
digit2:= digit2+(strtoint(cpf[11-i])*(I+1)); // formula do segundo verificador soma=1°*2 +2°*3 +3°*4.. até 10°*11
end;
digit2:= ((11 - (digit2 mod 11))mod 11) mod 10; // digito1 = 11 - soma mod 11 se digito > 10 digito1 =0
// Confere o 2° digito verificador
if IntToStr(digit2) <> cpf[11] then
begin
validar_CPF_CNPJ := False;
exit;
end;
// Cpf é valido
validar_CPF_CNPJ := True;
end
else if Length(valor) = 14 then
begin
cnpj := valor;
digit1 := 0;
digit2 := 0;
//Monta matriz de apoio
apoio[0]:=6;//só será usada no cálculo do segundo dígito verificador
apoio[1]:=5;
apoio[2]:=4;
apoio[3]:=3;
apoio[4]:=2;
apoio[5]:=9;
apoio[6]:=8;
apoio[7]:=7;
apoio[8]:=6;
apoio[9]:=5;
apoio[10]:=4;
apoio[11]:=3;
apoio[12]:=2;
//Começa cálculo do primeiro dígito verificador
for i := 1 to 12 do
begin
digit1 := digit1 +(strtoint(cnpj[i])*apoio[i]);
end;
digit1 := digit1 mod 11;
if (digit1 < 2) then
digit1:=0
else
digit1:=11-digit1;
if (IntToStr(digit1) <> cnpj[13]) then // Verifica se o 1° digito confere
begin
validar_CPF_CNPJ := False;
exit;
end
else
begin //Primeiro dígito confere!
for i := 0 to 12 do
begin
digit2:=digit2+(strtoint(cnpj[i+1])*apoio[i]);
end;
digit2 := digit2 mod 11;
if (digit2 < 2) then
digit2 :=0
else
digit2 := 11 - digit2;
if (IntToStr(digit2) <> cnpj[14]) then // Confere o 2° digito verificador
begin
validar_CPF_CNPJ := False;
exit;
end
else
validar_CPF_CNPJ := true;
end;
end;
end;
function validarEmail(const EMailIn: String):Boolean;
const
CaraEsp: array[1..40] of string[1] =
( '!','#','$','%','¨','&','*',
'(',')','+','=','§','¬','¢','¹','²',
'³','£','´','`','ç','Ç',',',';',':',
'<','>','~','^','?','/','','|','[',']','{','}',
'º','ª','°');
var
i,cont : integer;
EMail : ShortString;
begin
EMail := EMailIn;
Result := True;
cont := 0;
if EMail <> '' then
if (Pos('@', EMail)<>0) and (Pos('.', EMail)<>0) then // existe @ .
begin
if (Pos('@', EMail)=1) or (Pos('@', EMail)= Length(EMail)) or (Pos('.', EMail)=1) or (Pos('.', EMail)= Length(EMail)) or (Pos(' ', EMail)<>0) then
Result := False
else // @ seguido de . e vice-versa
if (abs(Pos('@', EMail) - Pos('.', EMail)) = 1) then
Result := False
else
begin
for i := 1 to 40 do // se existe Caracter Especial
if Pos(CaraEsp[i], EMail)<>0 then
Result := False;
for i := 1 to length(EMail) do
begin // se existe apenas 1 @
if EMail[i] = '@' then
cont := cont + 1; // . seguidos de .
if (EMail[i] = '.') and (EMail[i+1] = '.') then
Result := false;
end;
// . no f, 2ou+ @, . no i, - no i, _ no i
if (cont >=2) or ( EMail[length(EMail)]= '.' )
or ( EMail[1]= '.' ) or ( EMail[1]= '_' )
or ( EMail[1]= '-' ) then
Result := false;
// @ seguido de COM e vice-versa
if (abs(Pos('@', EMail) - Pos('com', EMail)) = 1) then
Result := False;
// @ seguido de - e vice-versa
if (abs(Pos('@', EMail) - Pos('-', EMail)) = 1) then
Result := False;
// @ seguido de _ e vice-versa
if (abs(Pos('@', EMail) - Pos('_', EMail)) = 1) then
Result := False;
end;
end
else
Result := False;
end;
function validarUF(UF : String) : Boolean;
const
UFs = 'SPMGRJRSSCPRESDFMTMSGOTOBASEALPBPEMARNCEPIPAAMAPFNACRRRO';
var
Posicao : integer;
begin
Result := true;
if UF <> '' then
begin
Posicao := Pos(UpperCase(UF),UFs);
if (Posicao = 0) or ((Posicao mod 2) = 0) then
begin
Result := false;
end;
end;
end;
function validarData(Data : TDateTime; Tipo : Integer) : Boolean;
var a1,m1,d1, a2, m2, d2: word;
Ano: Integer;
begin
Result := False;
DecodeDate(Data, a1, m1, d1);
DecodeDate(Date, a2, m2, d2);
if (d1 > 31) or (m1 > 12) or (a1 < 1900) then
begin
if (Tipo = 0) then
MessageDlg('Data de Nascimento inválida!', MTERROR, [MBOK], 0)
else if (Tipo = 1) then
MessageDlg('Data de Fundação inválida!', MTERROR, [MBOK], 0)
else if (Tipo = 3) then
MessageDlg('Data inválida!', MTERROR, [MBOK], 0);
Result := True
end
else
begin
Ano := a2 - a1;
if m2 < m1 then
Ano := Ano - 1
else if m2 = m1 then
begin
if d2 < d1 then
Ano := Ano - 1;
end;
if (Ano < 16) and (Tipo = 0) then
begin
MessageDlg('ATENÇÃO: Idade menor que 16 anos.',mtWarning,[mbOK],0);
Result := True;
end
else if (Ano < 0) and (Tipo = 1) then
begin
MessageDlg('ATENÇÃO: A data não pode ser maior que a atual.',mtWarning,[mbOK],0);
Result := True;
end
else if (Ano >= 0) and (Tipo = 2) and (d2 <> d1)then
begin
MessageDlg('ATENÇÃO: Essa CNH está vencida.',mtWarning,[mbOK],0);
Result := True;
end;
end;
end;
procedure validarCaracteres(Sender: TObject; var Key: Char; TipoCampo: String);
Const
especiais = '0123456789<>!@#$%¨&*()_-+={}[]?;:,.|/*"çÇ~^´`¨âÂàÀãÃéÉêÊèÈíÍîÎìÌæÆôòûùø£ØƒáÁóúñѪº¿®½¼ÓßÔÒõÕµþÚÛÙýÝ';//caracteres especiais que sql não aceita
especiaisNumber = '<>!@#$%¨&*()_-+={}[]?;:,.|/*"çÇ~^´`¨âÂàÀãÃéÉêÊèÈíÍîÎìÌæÆôòûùø£ØƒáÁóúñѪº¿®½¼ÓßÔÒõÕµþÚÛÙýÝ';
Var
Str : String;
begin
Str := key;
if (TipoCampo = 'Login') then
begin
if (Pos(Str,especiais)<>0) or (Str = '''') Then
key:= #0;
end
else
begin
if(Pos(Str,especiaisNumber)<>0) or (Str = '''') Then
key:= #0;
end;
end;
end.
|
{
Ultibo QEMU Launcher Tool.
Copyright (C) 2022 - SoftOz Pty Ltd.
Arch
====
<All>
Boards
======
<All>
Licence
=======
LGPLv2.1 with static linking exception (See COPYING.modifiedLGPL.txt)
Credits
=======
Information for this unit was obtained from:
References
==========
QEMU Launcher
=============
The QEMU launcher provides a convenient way to launch the QEMU machine emulator
with a compiled Ultibo project.
The tool determines all of the default configuration information automatically but
this can be overridden by creating a QEMULauncher.ini file in the same directory and
setting a number of parameters.
The format of the INI file is:
[QEMULauncher]
Path=
SystemArm=
SystemAarch64=
ExtraParams=
CommandLine=
A brief explanation of each parameter along with the standard default value:
Path - The path to the QEMU installation (Default: C:\Ultibo\Core\qemu) (Detected from the application path)
SystemArm - The name of the QEMU ARM system emulator (Default: qemu-system-arm.exe)
SystemAarch64 - The name of the QEMU AARCH64 system emulator (Default: qemu-system-aarch64.exe)
ExtraParams - Any extra parameters to pass to QEMU on launch (Default: <Blank>)
CommandLine - The command line parameters to pass to the Ultibo application (Default: <Blank>)
A QEMULauncher.ini file can also be created in the same directory as a the project file (the .lpi file)
and used to provide project specific parameters such as network settings or disk images to attach.
Any settings contained in a QEMULauncher.ini file in the project directory will override the same settings
in the default QEMULauncher.ini file.
}
unit Main;
{$MODE Delphi}
interface
uses
{$IFDEF WINDOWS}
Windows,
{$ENDIF}
{$IFDEF LINUX}
BaseUnix,
{$ENDIF}
LCLIntf,
LCLType,
LMessages,
Messages,
SysUtils,
Classes,
{$IFDEF FPC}
Process,
{$ENDIF}
Graphics,
Controls,
Forms,
Dialogs,
StdCtrls,
ExtCtrls,
ComCtrls,
IniFiles;
type
TQEMULaunch = class(TObject)
constructor Create;
private
{}
function GetExe:String;
function GetCPU:String;
function GetKernel:String;
function GetMemory:String;
function GetMachine:String;
function GetDevices:String;
public
{QEMU Variables}
Path:String;
SystemArm:String;
SystemAarch64:String;
ExtraParams:String;
CommandLine:String;
{Ultibo Variables}
Project:String;
CPU:String;
Processor:String;
Controller:String;
{Public Methods}
function Launch:Boolean;
function LoadConfig:Boolean;
function LoadParams:Boolean;
function LoadProjectConfig:Boolean;
end;
TfrmMain = class(TForm)
lblProject: TLabel;
txtProject: TEdit;
cmdProject: TButton;
lblCPU: TLabel;
cmbCPU: TComboBox;
lblProcessor: TLabel;
cmbProcessor: TComboBox;
lblController: TLabel;
cmbController: TComboBox;
cmdLaunch: TButton;
cmdClose: TButton;
openMain: TOpenDialog;
procedure FormCreate(Sender: TObject);
procedure FormDestroy(Sender: TObject);
procedure FormShow(Sender: TObject);
procedure FormClose(Sender: TObject; var Action: TCloseAction);
procedure txtProjectChange(Sender: TObject);
procedure cmdProjectClick(Sender: TObject);
procedure cmbCPUChange(Sender: TObject);
procedure cmbProcessorChange(Sender: TObject);
procedure cmbControllerChange(Sender: TObject);
procedure cmdLaunchClick(Sender: TObject);
procedure cmdCloseClick(Sender: TObject);
private
{ Private declarations }
FLaunch:TQEMULaunch;
public
{ Public declarations }
end;
const
{From FPCProcessorNames in definetemplates.pas}
CPUNames:array[0..1] of String = (
'aarch64',
'arm');
{From GetTargetProcessors in definetemplates.pas}
ProcessorNames:array[0..2] of String = (
'ARMV6',
'ARMV7A',
'ARMV8');
{From FPCControllerNames in definetemplates.pas}
ControllerNames:array[0..13] of String = (
'RPIA',
'RPIB',
'RPIZERO',
'RPI2B',
'RPI3A',
'RPI3B',
'RPI4B',
'RPI400',
'QEMUVPB',
'QEMURPIA',
'QEMURPIZERO',
'QEMURPI2B',
'QEMURPI3A',
'QEMURPI3B'
);
{$IFDEF WINDOWS}
type
TWow64DisableWow64FsRedirection = function(var OldValue:Pointer):BOOL; stdcall;
TWow64RevertWow64FsRedirection = function(OldValue:Pointer):BOOL; stdcall;
var
Wow64FsRedirectionHandle:THandle = 0;
_Wow64DisableWow64FsRedirection:TWow64DisableWow64FsRedirection = nil;
_Wow64RevertWow64FsRedirection:TWow64RevertWow64FsRedirection = nil;
function Wow64DisableWow64FsRedirection(var OldValue:Pointer):BOOL; stdcall;
function Wow64RevertWow64FsRedirection(OldValue:Pointer):BOOL; stdcall;
{$ENDIF}
var
frmMain: TfrmMain;
function AddQuotes(const AValue:String):String;
function AddTrailingSlash(const FilePath:String):String;
function StripTrailingSlash(const FilePath:String):String;
function StripLeadingChar(const AFilePath,ASlashChar:String):String;
function ParameterValue(const AParameter:String):String;
function ParameterValueEx(const AParameter:String;APlus,AMinus:Boolean):String;
function ParameterExists(const AParameter:String):Boolean;
function ParameterExistsEx(const AParameter:String;APlus,AMinus:Boolean):Boolean;
{$IFDEF WINDOWS}
function StartProgramEx(const ACommand,ADirectory:String;AWait,ANoShow:Boolean):Boolean;
{$ENDIF}
{$IFDEF LINUX}
function StartProgramEx(const AExecutable,ADirectory:String;AParams:TStrings;AWait,ATerminal:Boolean):Boolean;
function StartQEMUSystem(const ACommand,ADirectory,APidFile:String;AWait:Boolean):Boolean;
{$ENDIF}
implementation
{$R *.lfm}
{==============================================================================}
{==============================================================================}
{$IFDEF WINDOWS}
function Wow64DisableWow64FsRedirection(var OldValue:Pointer):BOOL; stdcall;
begin
{}
Result:=False;
if Assigned(_Wow64DisableWow64FsRedirection) then Result:=_Wow64DisableWow64FsRedirection(OldValue);
end;
{==============================================================================}
function Wow64RevertWow64FsRedirection(OldValue:Pointer):BOOL; stdcall;
begin
{}
Result:=False;
if Assigned(_Wow64RevertWow64FsRedirection) then Result:=_Wow64RevertWow64FsRedirection(OldValue);
end;
{$ENDIF}
{==============================================================================}
{==============================================================================}
function AddQuotes(const AValue:String):String;
var
WorkBuffer:String;
begin
{}
WorkBuffer:=AValue; {Trim(AValue);} {Dont Trim Space is Allowed}
if Length(WorkBuffer) > 0 then
begin
if WorkBuffer[1] <> '"' then
begin
WorkBuffer:='"' + WorkBuffer;
end;
end
else
begin
WorkBuffer:='"';
end;
if Length(WorkBuffer) > 1 then
begin
if WorkBuffer[Length(WorkBuffer)] <> '"' then
begin
WorkBuffer:=WorkBuffer + '"';
end;
end
else
begin
WorkBuffer:=WorkBuffer + '"';
end;
Result:=WorkBuffer;
end;
{==============================================================================}
function AddTrailingSlash(const FilePath:String):String;
var
SlashChar:Char;
WorkBuffer:String;
begin
{}
{$IFDEF WINDOWS}
SlashChar:='\';
{$ENDIF}
{$IFDEF LINUX}
SlashChar:='/';
{$ENDIF}
WorkBuffer:=Trim(FilePath);
Result:=WorkBuffer;
if Length(WorkBuffer) > 0 then
begin
if WorkBuffer[Length(WorkBuffer)] <> SlashChar then
begin
Result:=WorkBuffer + SlashChar;
end;
end;
end;
{==============================================================================}
function StripTrailingSlash(const FilePath:String):String;
var
SlashChar:Char;
WorkBuffer:String;
begin
{}
{$IFDEF WINDOWS}
SlashChar:='\';
{$ENDIF}
{$IFDEF LINUX}
SlashChar:='/';
{$ENDIF}
WorkBuffer:=Trim(FilePath);
Result:=WorkBuffer;
if Length(WorkBuffer) > 0 then
begin
if WorkBuffer[Length(WorkBuffer)] = SlashChar then
begin
Delete(WorkBuffer,Length(WorkBuffer),1);
Result:=WorkBuffer;
end;
end;
end;
{==============================================================================}
function StripLeadingChar(const AFilePath,ASlashChar:String):String;
var
WorkBuffer:String;
begin
{}
WorkBuffer:=Trim(AFilePath);
if Length(WorkBuffer) > 0 then
begin
if WorkBuffer[1] = ASlashChar then
begin
Delete(WorkBuffer,1,1);
end;
end;
Result:=WorkBuffer;
end;
{==============================================================================}
function ParameterValue(const AParameter:String):String;
begin
{}
Result:=ParameterValueEx(AParameter,False,True);
end;
{==============================================================================}
function ParameterValueEx(const AParameter:String;APlus,AMinus:Boolean):String;
{Return the value of the command line parameter specified by Parameter}
{Note: Allows for parameters prefixed with Slash (/), Plus (+) or Minus (-)}
var
Count:Integer;
PosIdx:Integer;
Value:String;
Current:String;
Parameter:String;
begin
{}
Result:='';
{Check Exists}
if ParameterExistsEx(AParameter,APlus,AMinus) then
begin
{Format Parameter}
Parameter:=Uppercase(Trim(AParameter));
for Count:=1 to ParamCount do
begin
{Get Parameter}
Current:=Trim(ParamStr(Count));
{Remove Slash}
Current:=StripLeadingChar(Current,'/');
{Remove Plus}
if APlus then Current:=StripLeadingChar(Current,'+');
{Remove Minus}
if AMinus then Current:=StripLeadingChar(Current,'-');
{Get First Equals}
PosIdx:=Pos('=',Current);
if PosIdx <> 0 then
begin
{Get Value}
Value:=Copy(Current,PosIdx + 1,Length(Current));
{Remove Value}
Delete(Current,PosIdx,Length(Current));
{Check Parameter}
if Parameter = Uppercase(Current) then
begin
Result:=Value;
Exit;
end;
end;
end;
end;
end;
{==============================================================================}
function ParameterExists(const AParameter:String):Boolean;
begin
{}
Result:=ParameterExistsEx(AParameter,False,True);
end;
{==============================================================================}
function ParameterExistsEx(const AParameter:String;APlus,AMinus:Boolean):Boolean;
{Check for the existence of the command line parameter specified by Parameter}
{Note: Allows for parameters prefixed with Slash (/), Plus (+) or Minus (-)}
var
Count:Integer;
PosIdx:Integer;
Current:String;
Parameter:String;
begin
{}
Result:=False;
{Check Parameter}
if Trim(AParameter) = '' then Exit;
{Format Parameter}
Parameter:=Uppercase(Trim(AParameter));
for Count:=1 to ParamCount do
begin
{Get Parameter}
Current:=Trim(ParamStr(Count));
{Remove Slash}
Current:=StripLeadingChar(Current,'/');
{Remove Plus}
if APlus then Current:=StripLeadingChar(Current,'+');
{Remove Minus}
if AMinus then Current:=StripLeadingChar(Current,'-');
{Get First Equals}
PosIdx:=Pos('=',Current);
if PosIdx <> 0 then
begin
{Remove Value}
Delete(Current,PosIdx,Length(Current));
end;
{Check Parameter}
if Parameter = Uppercase(Current) then
begin
Result:=True;
Exit;
end;
end;
end;
{==============================================================================}
{$IFDEF WINDOWS}
function StartProgramEx(const ACommand,ADirectory:String;AWait,ANoShow:Boolean):Boolean;
var
Command:String;
Directory:String;
OldValue:Pointer;
ExitCode:LongWord;
StartupInfo:TStartupInfo;
ProcessInformation:TProcessInformation;
begin
{}
Result:=False;
try
Wow64DisableWow64FsRedirection(OldValue);
try
Command:=ACommand;
Directory:=ADirectory;
FillChar(StartupInfo,SizeOf(StartupInfo),#0);
StartupInfo.cb:=SizeOf(TStartupInfo);
if ANoShow then
begin
StartupInfo.dwFlags:=STARTF_USESHOWWINDOW;
StartupInfo.wShowWindow:=SW_HIDE;
end;
FillChar(ProcessInformation,SizeOf(ProcessInformation),#0);
if CreateProcess(nil,PChar(Command),nil,nil,False,0,nil,PChar(Directory),StartupInfo,ProcessInformation) then
begin
CloseHandle(ProcessInformation.hThread);
if AWait then
begin
ExitCode:=STILL_ACTIVE;
while GetExitCodeProcess(ProcessInformation.hProcess,ExitCode) do
begin
Sleep(1);
Application.ProcessMessages;
if ExitCode <> STILL_ACTIVE then Break;
end;
CloseHandle(ProcessInformation.hProcess);
end
else
begin
CloseHandle(ProcessInformation.hProcess);
end;
Result:=True;
end;
finally
Wow64RevertWow64FsRedirection(OldValue);
end;
except
{}
end;
end;
{$ENDIF}
{==============================================================================}
{$IFDEF LINUX}
function StartProgramEx(const AExecutable,ADirectory:String;AParams:TStrings;AWait,ATerminal:Boolean):Boolean;
{Launch an external program with specified parameters and options}
var
Count:Integer;
ProcessInfo:TProcess;
begin
Result:=False;
try
if Length(AExecutable) = 0 then Exit;
ProcessInfo:=TProcess.Create(nil);
try
{Create a detached process}
ProcessInfo.InheritHandles:=False;
ProcessInfo.Options:=[];
ProcessInfo.ShowWindow:=swoShow;
{Copy default environment variables including DISPLAY variable for GUI application to work}
for Count:=1 to GetEnvironmentVariableCount do
begin
ProcessInfo.Environment.Add(GetEnvironmentString(Count));
end;
{Check Terminal}
if ATerminal then
begin
ProcessInfo.Options:=[poNewConsole];
end;
{Add Executable}
ProcessInfo.Executable:=AExecutable;
ProcessInfo.CurrentDirectory:=ADirectory;
{Add Parameters}
if AParams <> nil then
begin
for Count:=0 to AParams.Count - 1 do
begin
ProcessInfo.Parameters.Add(AParams.Strings[Count]);
end;
end;
{Execute Process}
ProcessInfo.Execute;
{Check Wait}
if AWait then
begin
{Wait while Running}
while ProcessInfo.Running do
begin
Sleep(1);
Application.ProcessMessages;
end;
end;
Result:=True;
finally
ProcessInfo.Free;
end;
except
{EProcess exception raised on error}
end;
end;
{==============================================================================}
function StartQEMUSystem(const ACommand,ADirectory,APidFile:String;AWait:Boolean):Boolean;
{Launch a QEMU session}
{The qeum-system-??? executables require a new terminal session to be created which
then launches them via a bash session. This means that the process id recorded is
the id of the terminal and not the qeum-system-??? executable so waiting does not
work.
To resolve this a pid file name is passed to the qeum-system-??? executable and the
id recorded in that file is used to determine when the session has ended instead}
function GetProcessIdFromFile(const AFilename:String):THandle;
var
Lines:TStringList;
begin
Result:=THandle(-1);
if Length(AFilename) = 0 then Exit;
if not FileExists(AFilename) then Exit;
Lines:=TStringList.Create;
try
Lines.LoadFromFile(AFilename);
if Lines.Count = 1 then
begin
Result:=StrToIntDef(Lines.Strings[0],0);
if Result = 0 then Result:=THandle(-1);
end;
finally
Lines.Free;
end;
end;
function CheckProcessIdRunning(AHandle:THandle):Boolean;
var
Res:cint;
begin
Result:=False;
Res:=FpKill(AHandle, 0);
if Res = 0 then Result:=True;
end;
var
Count:Integer;
ProcessInfo:TProcess;
ProcessHandle:THandle;
begin
Result:=False;
try
if Length(ACommand) = 0 then Exit;
if AWait and (Length(APidFile) = 0) then Exit;
ProcessInfo:=TProcess.Create(nil);
try
{Create a detached process in a new terminal}
ProcessInfo.InheritHandles:=False;
ProcessInfo.Options:=[poNewConsole];
ProcessInfo.ShowWindow:=swoShow;
{Copy default environment variables including DISPLAY variable for GUI application to work}
for Count:=1 to GetEnvironmentVariableCount do
begin
ProcessInfo.Environment.Add(GetEnvironmentString(Count));
end;
{Create a bash session}
ProcessInfo.Executable:='/bin/bash';
ProcessInfo.CurrentDirectory:=ADirectory;
ProcessInfo.Parameters.Add('-c');
ProcessInfo.Parameters.Add(ACommand + ' -pidfile "' + APidFile + '"');
{Execute Process}
ProcessInfo.Execute;
{Check Wait}
if AWait then
begin
Sleep(2000);
ProcessHandle:=GetProcessIdFromFile(APidFile);
if ProcessHandle <> THandle(-1) then
begin
while CheckProcessIdRunning(ProcessHandle) do
begin
Sleep(100);
Application.ProcessMessages;
end;
end;
end;
{Delete the PidFile}
if FileExists(APidFile) then
begin
DeleteFile(APidFile);
end;
Result:=True;
finally
ProcessInfo.Free;
end;
except
{EProcess exception raised on error}
end;
end;
{$ENDIF}
{==============================================================================}
{==============================================================================}
constructor TQEMULaunch.Create;
{$IFDEF WINDOWS}
var
InstallPath:String;
{$ENDIF}
begin
{}
inherited Create;
{$IFDEF WINDOWS}
{Assume that this is running from <InstallPath>\tools and that the InstallPath will be the folder above}
InstallPath:=ExtractFileDir(ExtractFileDir(Application.ExeName));
{$ENDIF}
{QEMU Variables}
{$IFDEF WINDOWS}
Path:=AddTrailingSlash(InstallPath) + 'qemu';
SystemArm:='qemu-system-arm.exe';
SystemAarch64:='qemu-system-aarch64.exe';
{$ENDIF}
{$IFDEF LINUX}
Path:='/usr/bin';
SystemArm:='qemu-system-arm';
SystemAarch64:='qemu-system-aarch64';
{$ENDIF}
ExtraParams:='';
CommandLine:='';
{Ultibo Variables}
Project:='';
CPU:='';
Processor:='';
Controller:='';
end;
{==============================================================================}
function TQEMULaunch.GetExe:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
Result:=SystemArm;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
Result:=SystemAarch64;
end;
end;
{==============================================================================}
function TQEMULaunch.GetCPU:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
if Uppercase(Processor) = 'ARMV6' then
begin
if Uppercase(Controller) = 'RPIA' then
begin
//Result:='arm1176'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIB' then
begin
//Result:='arm1176'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIZERO' then
begin
//Result:='arm1176'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMURPIA' then
begin
Result:='arm1176';
end
else if Uppercase(Controller) = 'QEMURPIZERO' then
begin
Result:='arm1176';
end;
end
else if Uppercase(Processor) = 'ARMV7A' then
begin
if Uppercase(Controller) = 'RPI2B' then
begin
//Result:='cortex-a7'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3A' then
begin
//Result:='cortex-a7'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3B' then
begin
//Result:='cortex-a7'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='cortex-a8';
end
else if Uppercase(Controller) = 'QEMURPI2B' then
begin
Result:='cortex-a7';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='cortex-a7';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='cortex-a7';
end;
end;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
if Uppercase(Processor) = 'ARMV8' then
begin
Result:='cortex-a53';
end;
end;
end;
{==============================================================================}
function TQEMULaunch.GetKernel:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
if Uppercase(Controller) = 'RPIA' then
begin
//Result:='kernel.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIB' then
begin
//Result:='kernel.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIZERO' then
begin
//Result:='kernel.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI2B' then
begin
//Result:='kernel7.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3A' then
begin
//Result:='kernel7.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3B' then
begin
//Result:='kernel7.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='kernel7l.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='kernel7l.img'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='kernel.bin';
end
else if Uppercase(Controller) = 'QEMURPIA' then
begin
Result:='kernel.qimg';
end
else if Uppercase(Controller) = 'QEMURPIZERO' then
begin
Result:='kernel.qimg';
end
else if Uppercase(Controller) = 'QEMURPI2B' then
begin
Result:='kernel7.qimg';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='kernel7.qimg';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='kernel7.qimg';
end;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
if Uppercase(Controller) = 'RPI3A' then
begin
Result:='kernel8.img';
end
else if Uppercase(Controller) = 'RPI3B' then
begin
Result:='kernel8.img';
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='kernel8.img'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='kernel8.img'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='kernel64.bin';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='kernel8.img';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='kernel8.img';
end;
end;
end;
{==============================================================================}
function TQEMULaunch.GetMemory:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
if Uppercase(Controller) = 'RPIA' then
begin
//Result:='256M'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIB' then
begin
//Result:='512M'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIZERO' then
begin
//Result:='512M'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI2B' then
begin
//Result:='1G'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3A' then
begin
//Result:='512M'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3B' then
begin
//Result:='1G'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='4G'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='4G'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='256M';
end
else if Uppercase(Controller) = 'QEMURPIA' then
begin
Result:='512M';
end
else if Uppercase(Controller) = 'QEMURPIZERO' then
begin
Result:='512M';
end
else if Uppercase(Controller) = 'QEMURPI2B' then
begin
Result:='1G';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='1G'; //'512M'; //Using raspi2b in 32-bit mode
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='1G';
end;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
if Uppercase(Controller) = 'RPI3A' then
begin
Result:='512M';
end
else if Uppercase(Controller) = 'RPI3B' then
begin
Result:='1G';
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='4G'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='4G'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='256M';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='512M';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='1G';
end;
end;
end;
{==============================================================================}
function TQEMULaunch.GetMachine:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
if Uppercase(Controller) = 'RPIA' then
begin
//Result:='raspi'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIB' then
begin
//Result:='raspi'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIZERO' then
begin
//Result:='raspi'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI2B' then
begin
//Result:='raspi2'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3A' then
begin
//Result:='raspi2'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3B' then
begin
//Result:='raspi2'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='raspi2'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='raspi2'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='versatilepb';
end
else if Uppercase(Controller) = 'QEMURPIA' then
begin
Result:='raspi1ap';
end
else if Uppercase(Controller) = 'QEMURPIZERO' then
begin
Result:='raspi0';
end
else if Uppercase(Controller) = 'QEMURPI2B' then
begin
Result:='raspi2b';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='raspi2b'; //raspi3ap only supported by QEMU Aarch64
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='raspi2b'; //raspi3b only supported by QEMU Aarch64
end;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
if Uppercase(Controller) = 'RPI3A' then
begin
Result:='raspi3ap';
end
else if Uppercase(Controller) = 'RPI3B' then
begin
Result:='raspi3b';
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='raspi4'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='raspi4'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:='versatilepb';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='raspi3ap';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='raspi3b';
end;
end;
end;
{==============================================================================}
function TQEMULaunch.GetDevices:String;
begin
{}
Result:='';
if Uppercase(CPU) = 'ARM' then
begin
if Uppercase(Controller) = 'RPIA' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIB' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPIZERO' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI2B' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3A' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI3B' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:=''; //Nothing
end
else if Uppercase(Controller) = 'QEMURPIA' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'QEMURPIZERO' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'QEMURPI2B' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='-device usb-kbd -device usb-mouse';
end;
end
else if Uppercase(CPU) = 'AARCH64' then
begin
if Uppercase(Controller) = 'RPI3A' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'RPI3B' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'RPI4B' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'RPI400' then
begin
//Result:='-device usb-kbd -device usb-mouse'; //Not yet supported
end
else if Uppercase(Controller) = 'QEMUVPB' then
begin
Result:=''; //Nothing
end
else if Uppercase(Controller) = 'QEMURPI3A' then
begin
Result:='-device usb-kbd -device usb-mouse';
end
else if Uppercase(Controller) = 'QEMURPI3B' then
begin
Result:='-device usb-kbd -device usb-mouse';
end;
end;
end;
{==============================================================================}
function TQEMULaunch.Launch:Boolean;
var
Param:String;
Command:String;
{$IFDEF LINUX}
PidFile:String;
PidCount:Integer;
{$ENDIF}
ProjectPath:String;
begin
{}
Result:=False;
try
{Create Command}
Command:='';
{Get Exe}
Param:=GetExe;
if Length(Param) = 0 then
begin
MessageDlg('Error: Unable to determine QEMU system emulator name, make sure you have selected a valid CPU type.',mtInformation,[mbOk],0);
Exit;
end;
{Get Path}
Param:=AddTrailingSlash(Path) + Param;
if FileExists(Param) then
begin
{Add Exe}
Command:=AddQuotes(Param);
{Get Machine}
Param:=GetMachine;
if Length(Param) = 0 then
begin
MessageDlg('Error: Unable to determine QEMU machine, make sure you have selected a valid Board type.',mtInformation,[mbOk],0);
Exit;
end;
{Add Machine}
Command:=Command + ' -M ' + Param;
{Get CPU}
Param:=GetCPU;
if Length(Param) = 0 then
begin
MessageDlg('Error: Unable to determine QEMU CPU, make sure you have selected a valid CPU model.',mtInformation,[mbOk],0);
Exit;
end;
{Add CPU}
Command:=Command + ' -cpu ' + Param;
{Get Kernel}
Param:=GetKernel;
if Length(Param) = 0 then
begin
MessageDlg('Error: Unable to determine kernel name, make sure you have selected valid options for Board and CPU type.',mtInformation,[mbOk],0);
Exit;
end;
{Get Path}
ProjectPath:=ExtractFileDir(Project);
if FileExists(AddTrailingSlash(ProjectPath) + Param) then
begin
{Add Kernel}
Command:=Command + ' -kernel ' + AddQuotes(AddTrailingSlash(ProjectPath) + Param);
{$IFDEF LINUX}
{Get PidFile}
PidFile:=AddTrailingSlash(ProjectPath) + Param;
PidCount:=1;
while FileExists(PidFile + '.pid' + IntToStr(PidCount)) do
begin
Inc(PidCount);
end;
PidFile:=PidFile + '.pid' + IntToStr(PidCount);
{$ENDIF}
{Get Memory}
Param:=GetMemory;
if Length(Param) = 0 then
begin
MessageDlg('Error: Unable to determine memory size, make sure you have selected valid options for Board and CPU type.',mtInformation,[mbOk],0);
Exit;
end;
{Add Memory}
Command:=Command + ' -m ' + Param;
{Add USB}
Command:=Command + ' -usb';
{Get Devices}
Param:=GetDevices;
if Length(Param) > 0 then
begin
{Add Devices}
Command:=Command + ' ' + Param;
end;
if Length(CommandLine) > 0 then
begin
{Add Append}
Command:=Command + ' -append ' + AddQuotes(CommandLine);
end;
if Length(ExtraParams) > 0 then
begin
{Add Extras}
Command:=Command + ' ' + ExtraParams;
end;
{Start Program}
{$IFDEF WINDOWS}
Result:=StartProgramEx(Command,StripTrailingSlash(ProjectPath),True,False);
{$ENDIF}
{$IFDEF LINUX}
Result:=StartQEMUSystem(Command,StripTrailingSlash(ProjectPath),PidFile,True);
{$ENDIF}
end
else
begin
MessageDlg('Error: Unable to locate kernel file ' + AddTrailingSlash(ProjectPath) + Param + '.',mtInformation,[mbOk],0);
end;
end
else
begin
MessageDlg('Error: Unable to locate QEMU system emulator ' + Param + '.',mtInformation,[mbOk],0);
end;
except
{}
end;
end;
{==============================================================================}
function TQEMULaunch.LoadConfig:Boolean;
var
Section:String;
Filename:String;
IniFile:TIniFile;
begin
{}
Result:=False;
try
{Get Filename}
Filename:=ChangeFileExt(Application.ExeName,'.ini');
{Check File}
if FileExists(Filename) then
begin
IniFile:=TIniFile.Create(Filename);
try
Section:='QEMULauncher';
{Get Path}
Path:=IniFile.ReadString(Section,'Path',Path);
{Get SystemArm}
SystemArm:=IniFile.ReadString(Section,'SystemArm',SystemArm);
{Get SystemAarch64}
SystemAarch64:=IniFile.ReadString(Section,'SystemAarch64',SystemAarch64);
{Get ExtraParams}
ExtraParams:=IniFile.ReadString(Section,'ExtraParams',ExtraParams);
{Get CommandLine}
CommandLine:=IniFile.ReadString(Section,'CommandLine',CommandLine);
finally
IniFile.Free;
end;
end;
Result:=True;
except
{}
end;
end;
{==============================================================================}
function TQEMULaunch.LoadParams:Boolean;
begin
{}
Result:=False;
try
{Get Project}
Project:=ParameterValue('PROJECT');
{Get CPU}
CPU:=ParameterValue('CPU');
{Get Processor}
Processor:=ParameterValue('PROCESSOR');
{Get Controller}
Controller:=ParameterValue('CONTROLLER');
Result:=True;
except
{}
end;
end;
{==============================================================================}
function TQEMULaunch.LoadProjectConfig:Boolean;
var
Section:String;
Filename:String;
IniFile:TIniFile;
WorkBuffer:String;
ProjectPath:String;
begin
{}
Result:=False;
try
{Get Path}
ProjectPath:=ExtractFileDir(Project);
{Get Filename}
Filename:=AddTrailingSlash(ProjectPath) + ExtractFileName(ChangeFileExt(Application.ExeName,'.ini'));
{Check File}
if FileExists(Filename) then
begin
IniFile:=TIniFile.Create(Filename);
try
Section:='QEMULauncher';
{Note: Any parameters from QEMULauncher.ini in the project directory override those in the default QEMULauncher.ini}
{Get Path}
WorkBuffer:=IniFile.ReadString(Section,'Path','');
if Length(WorkBuffer) <> 0 then Path:=WorkBuffer;
{Get SystemArm}
WorkBuffer:=IniFile.ReadString(Section,'SystemArm','');
if Length(WorkBuffer) <> 0 then SystemArm:=WorkBuffer;
{Get SystemAarch64}
WorkBuffer:=IniFile.ReadString(Section,'SystemAarch64','');
if Length(WorkBuffer) <> 0 then SystemAarch64:=WorkBuffer;
{Get ExtraParams}
WorkBuffer:=IniFile.ReadString(Section,'ExtraParams','');
if Length(WorkBuffer) <> 0 then ExtraParams:=WorkBuffer;
{Get CommandLine}
WorkBuffer:=IniFile.ReadString(Section,'CommandLine','');
if Length(WorkBuffer) <> 0 then CommandLine:=WorkBuffer;
finally
IniFile.Free;
end;
end;
Result:=True;
except
{}
end;
end;
{==============================================================================}
{==============================================================================}
procedure TfrmMain.FormCreate(Sender: TObject);
begin
{}
FLaunch:=TQEMULaunch.Create;
FLaunch.LoadConfig;
FLaunch.LoadParams;
FLaunch.LoadProjectConfig;
end;
{==============================================================================}
procedure TfrmMain.FormDestroy(Sender: TObject);
begin
{}
FLaunch.Free;
end;
{==============================================================================}
procedure TfrmMain.FormShow(Sender: TObject);
var
Scale:Double;
Count:Integer;
begin
{}
cmbCPU.Clear;
for Count:=Low(CPUNames) to High(CPUNames) do
begin
cmbCPU.Items.Add(CPUNames[Count]);
end;
cmbProcessor.Clear;
for Count:=Low(ProcessorNames) to High(ProcessorNames) do
begin
cmbProcessor.Items.Add(ProcessorNames[Count]);
end;
cmbController.Clear;
for Count:=Low(ControllerNames) to High(ControllerNames) do
begin
cmbController.Items.Add(ControllerNames[Count]);
end;
txtProject.Text:=FLaunch.Project;
cmbCPU.ItemIndex:=cmbCPU.Items.IndexOf(FLaunch.CPU);
cmbProcessor.ItemIndex:=cmbProcessor.Items.IndexOf(FLaunch.Processor);
cmbController.ItemIndex:=cmbController.Items.IndexOf(FLaunch.Controller);
{Adjust Labels}
lblProject.Top:=txtProject.Top + ((txtProject.Height - lblProject.Height) div 2);
lblCPU.Top:=cmbCPU.Top + ((cmbCPU.Height - lblCPU.Height) div 2);
lblProcessor.Top:=cmbProcessor.Top + ((cmbProcessor.Height - lblProcessor.Height) div 2);
lblController.Top:=cmbController.Top + ((cmbController.Height - lblController.Height) div 2);
{Adjust Buttons}
if txtProject.Height > cmdProject.Height then
begin
cmdProject.Height:=txtProject.Height;
cmdProject.Width:=txtProject.Height;
cmdProject.Top:=txtProject.Top + ((txtProject.Height - cmdProject.Height) div 2);
end
else
begin
cmdProject.Height:=txtProject.Height + 2;
cmdProject.Width:=txtProject.Height + 2;
cmdProject.Top:=txtProject.Top - 1;
end;
if cmdProject.Height > cmdLaunch.Height then
begin
cmdLaunch.Height:=cmdProject.Height;
cmdClose.Height:=cmdProject.Height;
end;
{Check PixelsPerInch}
if PixelsPerInch > 96 then
begin
{Calculate Scale}
Scale:=(PixelsPerInch / 96);
{Disable Anchors}
txtProject.Anchors:=[akLeft,akTop];
cmdProject.Anchors:=[akLeft,akTop];
cmdLaunch.Anchors:=[akLeft,akTop];
cmdClose.Anchors:=[akLeft,akTop];
{Resize Form}
Width:=Trunc(Width * Scale);
Height:=Trunc(Height * Scale);
{Adjust Text}
{txtProject.Width:=Trunc(469 * Scale);}
{Adjust Button}
cmdProject.Top:=txtProject.Top;
cmdProject.Height:=txtProject.Height;
cmdProject.Width:=cmdProject.Height;
{Move Buttons}
{cmdProject.Left:=Width - Trunc(46 * Scale);} {602 - 556 = 46}
{cmdLaunch.Left:=Width - Trunc(186 * Scale);} {602 - 416 = 186}
{cmdClose.Left:=Width - Trunc(102 * Scale);} {602 - 500 = 102}
{Enable Anchors}
txtProject.Anchors:=[akLeft,akTop,akRight];
cmdProject.Anchors:=[akTop,akRight];
cmdLaunch.Anchors:=[akRight,akBottom];
cmdClose.Anchors:=[akRight,akBottom];
end;
end;
{==============================================================================}
procedure TfrmMain.FormClose(Sender: TObject; var Action: TCloseAction);
begin
{}
end;
{==============================================================================}
procedure TfrmMain.txtProjectChange(Sender: TObject);
begin
{}
FLaunch.Project:=txtProject.Text;
FLaunch.LoadProjectConfig;
end;
{==============================================================================}
procedure TfrmMain.cmdProjectClick(Sender: TObject);
begin
{}
openMain.Title:='Select project';
{$IFDEF WINDOWS}
openMain.Filter:='Lararus projects|*.lpr|All files|*.*';
{$ENDIF}
{$IFDEF LINUX}
openMain.Filter:='Lararus projects|*.lpr|All files|*';
{$ENDIF}
if Length(openMain.InitialDir) = 0 then
begin
openMain.InitialDir:=ExtractFilePath(Application.ExeName);
end;
if openMain.Execute then
begin
txtProject.Text:=openMain.FileName;
end;
end;
{==============================================================================}
procedure TfrmMain.cmbCPUChange(Sender: TObject);
begin
{}
if cmbCPU.ItemIndex = -1 then Exit;
FLaunch.CPU:=cmbCPU.Items[cmbCPU.ItemIndex];
end;
{==============================================================================}
procedure TfrmMain.cmbProcessorChange(Sender: TObject);
begin
{}
if cmbProcessor.ItemIndex = -1 then Exit;
FLaunch.Processor:=cmbProcessor.Items[cmbProcessor.ItemIndex];
end;
{==============================================================================}
procedure TfrmMain.cmbControllerChange(Sender: TObject);
begin
{}
if cmbController.ItemIndex = -1 then Exit;
FLaunch.Controller:=cmbController.Items[cmbController.ItemIndex];
end;
{==============================================================================}
procedure TfrmMain.cmdLaunchClick(Sender: TObject);
begin
{}
lblProject.Enabled:=False;
txtProject.Enabled:=False;
cmdProject.Enabled:=False;
lblCPU.Enabled:=False;
cmbCPU.Enabled:=False;
lblProcessor.Enabled:=False;
cmbProcessor.Enabled:=False;
lblController.Enabled:=False;
cmbController.Enabled:=False;
cmdLaunch.Enabled:=False;
cmdClose.Enabled:=False;
try
FLaunch.Launch;
finally
lblProject.Enabled:=True;
txtProject.Enabled:=True;
cmdProject.Enabled:=True;
lblCPU.Enabled:=True;
cmbCPU.Enabled:=True;
lblProcessor.Enabled:=True;
cmbProcessor.Enabled:=True;
lblController.Enabled:=True;
cmbController.Enabled:=True;
cmdLaunch.Enabled:=True;
cmdClose.Enabled:=True;
end;
end;
{==============================================================================}
procedure TfrmMain.cmdCloseClick(Sender: TObject);
begin
{}
Application.Terminate;
end;
{==============================================================================}
{==============================================================================}
{$IFDEF WINDOWS}
initialization
Wow64FsRedirectionHandle:=LoadLibrary(PChar(kernel32));
if Wow64FsRedirectionHandle > HINSTANCE_ERROR then
begin
_Wow64DisableWow64FsRedirection:=GetProcAddress(Wow64FsRedirectionHandle,'Wow64DisableWow64FsRedirection');
_Wow64RevertWow64FsRedirection:=GetProcAddress(Wow64FsRedirectionHandle,'Wow64RevertWow64FsRedirection');
end;
{$ENDIF}
{==============================================================================}
{$IFDEF WINDOWS}
finalization
if Wow64FsRedirectionHandle > HINSTANCE_ERROR then FreeLibrary(Wow64FsRedirectionHandle);
{$ENDIF}
{==============================================================================}
{==============================================================================}
end.
|
unit FC.StockWizards.fmStockWizardContainer;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, ufmDialogOKCancel_B, ActnList, StdCtrls, ExtCtrls,
ComCtrls, ExtendControls, FC.Definitions;
type
TfmStockDataConnectionWizardContainer = class(TfmDialogOkCancel_B)
Splitter1: TSplitter;
Panel1: TPanel;
pcWizards: TPageControl;
paHeader: TExtendPanel;
Panel2: TPanel;
lvWizards: TExtendListView;
procedure lvWizardsSelectItem(Sender: TObject; Item: TListItem; Selected: Boolean);
procedure acOKUpdate(Sender: TObject);
procedure acOKExecute(Sender: TObject);
private
FWizards: TInterfaceList;
FDataSources: TStockTimeIntervalDataSourceArray;
FStockSymbol: string;
FSingleMode: boolean;
procedure WMWizardDblClick (var Message: TMessage); message WM_USER+$300;
function ActiveWizard: IStockDataConnectionWizard;
public
procedure SetSingleMode;
procedure RemoveConnection(const aIID: TGUID);
procedure SetDefaultSymbol(const aSymbol: string);
constructor Create(aOwner: TComponent); override;
destructor Destroy; override;
end;
//Напрямую TFrame нельзя выдавать наружу в виде интерфейса, так как у него
//заглушены AddRef/Release
TStockDataConnectionWizardContainer = class (TComponentContainer,IStockDataConnectionWizardContainer)
private
function Target : TfmStockDataConnectionWizardContainer;
protected
//from IStockControl,IStockDialog
function Control: TWinControl;
procedure RemoveConnection(const aIID: TGUID);
procedure SetDefaultSymbol(const aSymbol: string);
function Run(out aStockSymbol: string; out aDataSources: TStockTimeIntervalDataSourceArray): boolean;
function RunSingleMode(out aDataSource: IStockDataSource): boolean;
public
constructor Create; override;
end;
implementation
uses SystemService, FC.Factory, Application.Definitions, ufmDialogOK_B;
{$R *.dfm}
{ TStockDataConnectionWizardContainer }
constructor TStockDataConnectionWizardContainer.Create;
begin
inherited CreateTargeted(TfmStockDataConnectionWizardContainer.Create(nil));
end;
function TStockDataConnectionWizardContainer.Target: TfmStockDataConnectionWizardContainer;
begin
result:=TfmStockDataConnectionWizardContainer(inherited Target);
end;
function TStockDataConnectionWizardContainer.Control: TWinControl;
begin
result:=Target;
end;
procedure TStockDataConnectionWizardContainer.RemoveConnection(const aIID: TGUID);
begin
Target.RemoveConnection(aIID);
end;
function TStockDataConnectionWizardContainer.Run(out aStockSymbol: string; out aDataSources: TStockTimeIntervalDataSourceArray): boolean;
var
i:TStockTimeInterval;
begin
result:=Target.ShowModal=mrOK;
if result then
begin
for i:=Low(TStockTimeInterval) to High(TStockTimeInterval) do
begin
aDataSources[i]:=Target.FDataSources[i];
Target.FDataSources[i]:=nil;
end;
aStockSymbol:=Target.FStockSymbol;
end;
end;
function TStockDataConnectionWizardContainer.RunSingleMode(out aDataSource: IStockDataSource): boolean;
begin
Target.SetSingleMode;
result:=Target.ShowModal=mrOK;
if result then
aDataSource:=Target.FDataSources[sti1];
end;
procedure TStockDataConnectionWizardContainer.SetDefaultSymbol(const aSymbol: string);
begin
Target.SetDefaultSymbol(aSymbol);
end;
{ TfmStockDataConnectionWizardContainer }
constructor TfmStockDataConnectionWizardContainer.Create(aOwner: TComponent);
var
aWizard : IStockDataConnectionWizard;
i: integer;
aTab: TTabSheet;
aDSName : string;
aLI: TListItem;
begin
inherited;
TWaitCursor.SetUntilIdle;
FWizards:=TInterfaceList.Create;
Factory.CreateObjects(IStockDataConnectionWizard,FWizards);
for i:=0 to FWizards.Count-1 do
begin
aTab:=TTabSheet.Create(pcWizards);
aTab.PageControl:=pcWizards;
aWizard:=FWizards[i] as IStockDataConnectionWizard;
aWizard.Control.Parent:=aTab;
aTab.TabVisible:=false;
aWizard.Control.Align:=alClient;
with lvWizards.Items.Add do
begin
Caption:=aWizard.Title;
Data:=pointer(i);
end;
end;
//Глюк. Нужно пересоздать ListView, иначе надписи резанные
TfmStockDataConnectionWizardContainer(lvWizards).RecreateWnd;
lvWizards.HandleNeeded;
if lvWizards.Items.Count>0 then
begin
lvWizards.Items[0].Focused:=true;
lvWizards.Items[0].Selected:=true;
end;
aDSName:=Workspace.Storage(self).ReadString(self,'Last Stock Datasource','');
aLI:=lvWizards.FindCaption(0,aDSName,false,true,false);
if aLI<>nil then
begin
aLI.Focused:=true;
aLI.Selected:=true;
end;
end;
destructor TfmStockDataConnectionWizardContainer.Destroy;
begin
lvWizards.OnSelectItem:=nil;
FreeAndNil(FWizards);
inherited;
end;
function TfmStockDataConnectionWizardContainer.ActiveWizard: IStockDataConnectionWizard;
begin
if pcWizards.ActivePageIndex=-1 then
result:=nil
else
result:= FWizards[pcWizards.ActivePageIndex] as IStockDataConnectionWizard;
end;
procedure TfmStockDataConnectionWizardContainer.lvWizardsSelectItem(Sender: TObject; Item: TListItem; Selected: Boolean);
begin
inherited;
if Item=nil then
begin
pcWizards.ActivePage:=nil;
paHeader.Caption:='';
end
else begin
pcWizards.ActivePageIndex:=integer(Item.Data);
paHeader.Caption:=ActiveWizard.Title;
end
end;
procedure TfmStockDataConnectionWizardContainer.RemoveConnection(const aIID: TGUID);
var
i,j: integer;
begin
for i:=0 to FWizards.Count-1 do
if Supports(FWizards[i],aIID) then
begin
for j:= 0 to lvWizards.Items.Count - 1 do
begin
if lvWizards.Items[j].Data=pointer(i) then
begin
lvWizards.Items.Delete(j);
break;
end;
end;
end;
if (lvWizards.Selected=nil) and (lvWizards.Items.Count>0) then
begin
lvWizards.Items[0].Focused:=true;
lvWizards.Items[0].Selected:=true;
end;
end;
procedure TfmStockDataConnectionWizardContainer.SetDefaultSymbol(const aSymbol: string);
var
i: integer;
begin
for i:= 0 to FWizards.Count - 1 do
(FWizards[i] as IStockDataConnectionWizard).SetSelectedSymbol(aSymbol);
end;
procedure TfmStockDataConnectionWizardContainer.SetSingleMode;
var
i: integer;
begin
for i:= 0 to FWizards.Count - 1 do
(FWizards[i] as IStockDataConnectionWizard).SetSingleMode;
FSingleMode:=true;
end;
procedure TfmStockDataConnectionWizardContainer.WMWizardDblClick(var Message: TMessage);
begin
acOK.Execute;
end;
procedure TfmStockDataConnectionWizardContainer.acOKUpdate(Sender: TObject);
begin
TAction(Sender).Enabled:=(ActiveWizard<>nil) and (ActiveWizard.Validate);
end;
procedure TfmStockDataConnectionWizardContainer.acOKExecute(Sender: TObject);
var
i:TStockTimeInterval;
begin
try
Workspace.Storage(self).WriteString(self,'Last Stock Datasource',lvWizards.Selected.Caption);
ASSERT(ActiveWizard<>nil);
FStockSymbol:=ActiveWizard.GetSelectedSymbol;
if (FStockSymbol='') then
begin
ModalResult:=mrNone;
MsgBox.MessageAttention(Handle,'Enter symbol name before finishing wizard.',[]);
exit;
end;
TWaitCursor.SetUntilIdle;
if FSingleMode then
ActiveWizard.OnOK(sti1,FDataSources[sti1])
else begin
for i:=Low(TStockTimeInterval) to High(TStockTimeInterval) do
FDataSources[i]:=nil;
ActiveWizard.OnOK(FDataSources);
end;
except
on E:Exception do
begin
for i:=Low(TStockTimeInterval) to High(TStockTimeInterval) do
FDataSources[i]:=nil;
MsgBox.Error(0,E);
ModalResult:=mrNone;
exit;
end;
end;
inherited;
end;
initialization
Factory.RegisterCreator(TObjectCreator_Unique.Create(IStockDataConnectionWizardContainer,TStockDataConnectionWizardContainer));
end.
|
(* StringListSet: MM, 2020-05-30 *)
(* ------ *)
(* A simple class for StringSet Operations using a single linked list *)
(* ========================================================================= *)
UNIT StringSetListUnit;
INTERFACE
TYPE
List = ^NodeElement;
Node = ^NodeElement;
NodeElement = RECORD
value: STRING;
next: Node;
END; (* NodeElement *)
StringSet = ^StringSetObj;
StringSetObj = OBJECT
PUBLIC
CONSTRUCTOR Init;
DESTRUCTOR Done; VIRTUAL;
FUNCTION Empty: BOOLEAN;
FUNCTION Cardinality: INTEGER;
FUNCTION Contains(x: STRING): BOOLEAN;
PROCEDURE Add(x: STRING);
PROCEDURE Remove(x: STRING);
PROCEDURE Print;
PROCEDURE Test;
FUNCTION GetData: Node;
PRIVATE
elements: List;
n: INTEGER;
END; (* StringSetObj *)
FUNCTION Union(s1, s2: StringSet): StringSet;
FUNCTION Intersect(s1, s2: StringSet): StringSet;
FUNCTION Difference(s1, s2: StringSet): StringSet;
IMPLEMENTATION
FUNCTION NewNode(value: STRING): Node;
VAR n: Node;
BEGIN (* NewNode *)
New(n);
n^.next := NIL;
n^.value := value;
NewNode := n;
END; (* NewNode *)
CONSTRUCTOR StringSetObj.Init;
BEGIN
SELF.n := 0;
SELF.elements := NIL;
END; (* StringSetObj.Init *)
DESTRUCTOR StringSetObj.Done;
VAR x: Node;
BEGIN
WHILE (elements <> NIL) DO BEGIN
x := elements;
elements := elements^.next;
Dispose(x);
END; (* WHILE *)
END; (* StringSetObj.Done *)
FUNCTION StringSetObj.Empty: BOOLEAN;
BEGIN (* StringSetObj.Empty *)
Empty := n = 0;
END; (* StringSetObj.Empty *)
FUNCTION StringSetObj.Cardinality: INTEGER;
BEGIN (* StringSetObj.Cardinality *)
Cardinality := n;
END; (* StringSetObj.Cardinality *)
FUNCTION StringSetObj.Contains(x: STRING): BOOLEAN;
VAR curr: Node;
BEGIN (* StringSetObj.Contains *)
curr := elements;
IF(curr <> NIL) THEN BEGIN
WHILE (curr^.next <> NIL) AND (curr^.value <> x) DO BEGIN
curr := curr^.next;
END; (* WHILE *)
Contains := curr^.value = x;
END ELSE BEGIN
Contains := FALSE;
END; (* IF *)
END; (* StringSetObj.Contains *)
PROCEDURE StringSetObj.Add(x: STRING);
VAR new: Node;
BEGIN (* StringSetObj.Add *)
IF (NOT Contains(x)) THEN BEGIN
new := NewNode(x);
new^.next := elements;
elements := new;
Inc(n);
END; (* IF *)
END; (* StringSetObj.Add *)
PROCEDURE StringSetObj.Remove(x: STRING);
VAR curr, prev: Node;
BEGIN (* StringSetObj.Remove *)
IF (Empty) THEN BEGIN
WriteLn('Set is already empty, programm will be halted.');
HALT;
END ELSE BEGIN
curr := elements;
prev := NIL;
WHILE (curr^.next <> NIL) AND (curr^.value <> x) DO BEGIN
prev := curr;
curr := curr^.next;
END; (* WHILE *)
IF (curr^.value = x) THEN BEGIN
IF (prev <> NIL) THEN BEGIN
prev^.next := curr^.next;
END ELSE BEGIN
elements := elements^.next;
END; (* IF *)
Dispose(curr);
Dec(n);
END; (* IF *)
END; (* IF *)
END; (* StringSetObj.Remove *)
PROCEDURE StringSetObj.Test;
BEGIN (* StringSetObj.Test *)
WriteLn('n: ', n);
SELF.Print;
END; (* StringSetObj.Test *)
PROCEDURE StringSetObj.Print;
VAR curr: Node;
BEGIN (* StringSetObj.Print *)
curr := elements;
WHILE (curr <> NIL) DO BEGIN
WriteLn(curr^.value);
curr := curr^.next;
END; (* WHILE *)
END; (* StringSetObj.Print *)
FUNCTION StringSetObj.GetData: Node;
BEGIN (* StringSetObj.GetNextNode *)
GetData := elements
END; (* StringSetObj.GetNextNode *)
FUNCTION Union(s1, s2: StringSet): StringSet;
VAR t: StringSet;
curr: Node;
BEGIN (* Union *)
New(t, Init);
curr := s1^.GetData;
WHILE (curr <> NIL) DO BEGIN
t^.Add(curr^.value);
curr := curr^.next;
END; (* WHILE *)
curr := s2^.GetData;
WHILE (curr <> NIL) DO BEGIN
IF (NOT t^.Contains(curr^.value)) THEN BEGIN
t^.Add(curr^.value);
END; (* IF *)
curr := curr^.next;
END; (* WHILE *)
Union := t;
END; (* Union *)
FUNCTION Intersect(s1, s2: StringSet): StringSet;
VAR t: StringSet;
curr: Node;
BEGIN (* Intersect *)
New(t, Init);
curr := s1^.GetData;
WHILE (curr <> NIL) DO BEGIN
t^.Add(curr^.value);
curr := curr^.next;
END; (* WHILE *)
curr := t^.GetData;
WHILE (curr <> NIL) DO BEGIN
IF (NOT s2^.Contains(curr^.value)) THEN BEGIN
t^.Remove(curr^.value);
END; (* IF *)
curr := curr^.next;
END; (* WHILE *)
Intersect := t;
END; (* Intersect *)
FUNCTION Difference(s1, s2: StringSet): StringSet;
VAR target, temp: StringSet;
curr: Node;
BEGIN (* Difference *)
target := Union(s1, s2);
temp := Intersect(s1, s2);
curr := target^.GetData;
WHILE (curr <> NIL) DO BEGIN
IF (temp^.Contains(curr^.value)) THEN
target^.Remove(curr^.value);
curr := curr^.next;
END; (* WHILE *)
Dispose(temp, Done);
Difference := target;
END; (* Difference *)
END. (* StringSetListUnit *) |
unit SecurityUtil;
interface
uses
SysUtils, LbCipher, LbClass, Math;
function GetSuperUserCredentials(var AName, AKey: string): boolean;
function GetKey(const phrase: string; const toUpper: boolean = false): string;
function Encrypt(const str: string): AnsiString;
function Decrypt(const str: AnsiString): AnsiString;
implementation
const
APPKEY = 'Jet Construction Expense Management System Version 2';
KEYLENGTH = 6;
function GetSuperUserCredentials(var AName, AKey: string): boolean;
var
encryptor: TLbRijndael;
encrypted, decrypted: AnsiString;
randomStr: string;
begin
Result := false;
encryptor := TLbRijndael.Create(nil);
try
try
randomStr := IntToStr(RandomRange(1000,9999));
encrypted := encryptor.EncryptString(randomStr + FormatDateTime('ssmmhhmmddyyyy',Date) + APPKEY);
AName := UpperCase(Copy(encrypted,0,KEYLENGTH));
AKey := UpperCase(GetKey(AName));
Result := true;
except
end;
finally
encryptor.Free;
end;
end;
function GetKey(const phrase: string; const toUpper: boolean = false): string;
var
encryptor: TLbRijndael;
encrypted, decrypted: AnsiString;
begin
encryptor := TLbRijndael.Create(nil);
try
encrypted := encryptor.EncryptString(phrase + FormatDateTime('ssmmhhmmddyyyy',Date) + APPKEY);
Result := Copy(encrypted,0,KEYLENGTH);
if toUpper then Result := UpperCase(Result);
finally
encryptor.Free;
end;
end;
function Encrypt(const str: string): AnsiString;
var
encryptor: TLbRijndael;
begin
encryptor := TLbRijndael.Create(nil);
try
Result := encryptor.EncryptString(str);
finally
encryptor.Free;
end;
end;
function Decrypt(const str: AnsiString): AnsiString;
var
encryptor: TLbRijndael;
begin
encryptor := TLbRijndael.Create(nil);
try
Result := encryptor.DecryptString(str);
finally
encryptor.Free;
end;
end;
end.
|
{
//////////////////////////--| SFS DAEMON |--////////////////////////////
* This multithread demon handle the mount/unmount command for a SFS file.
* It comunicates with sfslauncher and keep the sended commands and then
* execute the relative command.
* This daemon create a thread for any sended command and execute it.
*
* Author: Vincenzo Dentamaro (c) 2007-2008-2009
* Software Name: daemon
* Version: 1.1.0.1
* Date: 17 april 2009
* Site: http://code.google.com/p/sfs-technology/
*
License:
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
}
Program daemon; // The SFS Technology daemon.
Uses
Cthreads, Classes, Unix, Sysutils, inifiles, Process, BaseUnix;
Type
{
* This class create a thread object with the methods to read and handle
* the sended command. This class implements the methos to mount and unmount
* the sfs file.
*
}
TsendThread = Class(TThread)
Private
Function mount(Var nomefilesfs,pID:String): String;
Function flush(Var pid:String): integer;
Protected
Procedure Execute(const uniqueKey:String);
Public
End;
{
* This simple class defines some methods used by the daemon to make some check.
* It defines some important methods like suicide procedures to terminate
* the daemon execution and call "sendError" .
}
Tprocedures = Class
Procedure checkloop ;
Function is_sudo: boolean;
Procedure suicide;
Procedure sendError(Const text:String);
End;
Var
shutdown: boolean;
currentPid: String;
procedures: Tprocedures;
send: array [0..32767] of TsendThread;
i: integer;
//Define Thread Class methods
Procedure TsendThread.execute(const uniqueKey:String);
//this procedure read the file SFSsend.sfs and determinate the command to execute
var
inifile: Tinifile;
mount_command: boolean;
umount_command: boolean;
sfsfile: string;
pid: string;
Begin
writeln('Command received... reading file /tmp/sfs/SFSsend.cfg');
inifile := Tinifile.Create('/tmp/sfs/'+uniqueKey);
mount_command := inifile.ReadBool('DAEMON','mount',false);
umount_command := inifile.ReadBool('DAEMON','umount',false);
sfsfile := inifile.ReadString('DAEMON','sfsfile','');
pid := inifile.ReadString('DAEMON','processID','');
sysutils.DeleteFile('/tmp/sfs/'+uniqueKey);
If mount_command = true Then If umount_command=false Then self.mount(sfsfile,pid);
If umount_command = true Then If mount_command=false Then self.flush(pid);
self.Destroy; //destructor of the thread object
End;
Function TsendThread.mount(Var nomefilesfs,pID:String): String;
//this function mount the sfs file described into the SFSsend.cfg file
//the univoke key is the sfslauncher's process ID
Var
proc: Tprocess;
stop: boolean;
f: textfile;
parametrogenDefault,path: string;
Begin
//extract the sfs filename without the absolute path
writeln('I have to mount the file '+nomefilesfs);
writeln('SFS instance number: '+pID);
proc := Tprocess.Create(Nil);
proc.Options := [poWaitOnExit];
parametrogenDefault := sysutils.ExtractFileName(nomefilesfs);
If Not sysutils.DirectoryExists('/.mounted/')Then
Begin
proc.CommandLine := 'mkdir /.mounted';
proc.Execute;
End;
If Not sysutils.DirectoryExists('/.mounted/'+pID)Then
Begin
path := '/.mounted/'+pID;
proc.CommandLine := 'mkdir '''+path+'''';
proc.Execute;
proc.CommandLine := 'chmod 777 -R '''+path+'''';
proc.Execute;
writeln('mounting... '+parametrogenDefault+' '+path);
proc.CommandLine := 'mount -t squashfs -o loop -r '''+nomefilesfs+''' '+'"'
+path+'"';
proc.Execute;
Try
system.Assign(f,'/tmp/sfs/'+pID);
rewrite(f);
writeln(f,path);
closefile(f);
Except
procedures.sendError(
'Unable to comunicate with sfslauncher. '
+ 'Please check the /tmp/sfs permissions!'
);
End;
End;
mount := path;
End;
Function TsendThread.flush(Var pid:String): integer;
//procedure for dismantling and cleaning
Var
path: String;
proc: Tprocess;
Begin
proc := Tprocess.Create(Nil);
proc.Options := [poWaitOnExit];
writeln('Flushing SFS instance number: '+pid);
path := '/.mounted/'+pid;
writeln('Unmounting, please wait ...');
proc.CommandLine := 'umount -l -d '+'"'+path+'"';
proc.Execute;
//PROCEDURE OF UMOUNT IN USERMODE
writeln('Flushing ...');
proc.CommandLine := 'rmdir --ignore-fail-on-non-empty "'+path+'"';
proc.Execute;
If Not sysutils.DirectoryExists(path)Then result := 0
Else result := -1;
End;
Procedure Tprocedures.sendError(Const text:String);
var
XProcess: Tprocess;
Begin
XProcess := Tprocess.Create(Nil);
XProcess.CommandLine := '/usr/sbin/sfs/SFSerror "'+text+'"';
XProcess.Options := [poNewProcessGroup, poUsePipes];
If sysutils.FileExists('/usr/sbin/sfs/SFSerror') Then
Begin
XProcess.Execute;
End;
End;
Procedure Tprocedures.suicide;
var
proc: Tprocess;
//close the daemon cleaning any pending instance
Begin
proc := Tprocess.Create(Nil);
proc.CommandLine := 'rm /tmp/sfs/*';
proc.Options := [poWaitOnExit];
proc.Execute;
sysutils.DeleteFile('/var/sfs-suicide');
writeln('The Daemon is now halted!');
shutdown := true;
exit;
writeln('The Daemon is now halt!');
End;
Function TProcedures.is_sudo: boolean;
//to determinate if it is runnig in Super user mode or not!
Begin
If fpgeteuid = 0 Then result := true
Else result := false;
End;
Procedure Tprocedures.checkloop ;
//this procedure create 255 loop back devices were mount 255 sfs software
// simultaniously!
Begin
If Not sysutils.FileExists('/dev/loop255') Then
Begin
If fileexists('/usr/sbin/sfs/MAKEloop')Then
Begin
shell('rm /dev/loop*');
shell('cp /usr/sbin/sfs/MAKEloop /dev');
shell('chmod 777 /dev/MAKEloop');
unix.Shell('cd /dev && exec ./MAKEloop loop');
End; // migliorare questo punto
End;
End;
/////////////////MAIN////////////////
Begin
i := 0;
If procedures.is_sudo = true Then
Begin
If Not sysutils.DirectoryExists('/tmp/sfs')Then
sysutils.CreateDir('/tmp/sfs');
If Not sysutils.DirectoryExists('/etc/sfs')Then
sysutils.CreateDir('/etc/sfs');
If sysutils.DirectoryExists('/.mounted')Then
unix.Shell('rm -R /.mounted/*');
writeln('Checking loop-back devices...');
unix.Shell('modprobe loop');
procedures.checkloop;
unix.Shell('modprobe squashfs');
shutdown := false;
writeln('The SFS daemon is now listening....');
While shutdown=false Do
Begin
If sysutils.FileExists('/var/sfs-suicide') Then procedures.suicide;
unix.Shell('chmod 777 -R /tmp/sfs && chmod 777 -R /etc/sfs');
If sysutils.FileExists('/tmp/sfs/SFSsend.cfg')Then
Begin
sysutils.RenameFile('/tmp/sfs/SFSsend.cfg','/tmp/sfs/'+inttostr(i));
//create a thread object to handle the sended command
send[i] := TsendThread.Create(false);
send[i].Execute(inttostr(i));
i := i + 1;
if i = 32767 then i := 0;
End;
sleep(500);
// for the 99% of the time the daemon sleep, decreasing its overhead
End;
sysutils.DeleteFile('/tmp/sfs/SFSsend.cfg');
End
Else writeln('Hey!! You must be root to launch this daemon!');
End.
|
{
This unit is part of the Lua4Delphi Source Code
Copyright (C) 2009-2012, LaKraven Studios Ltd.
Copyright Protection Packet(s): L4D014
www.Lua4Delphi.com
www.LaKraven.com
--------------------------------------------------------------------
The contents of this file are subject to the Mozilla Public License
Version 1.1 (the "License"); you may not use this file except in
compliance with the License. You may obtain a copy of the License at
http://www.mozilla.org/MPL/
Software distributed under the License is distributed on an "AS IS"
basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
the License for the specific language governing rights and
limitations under the License.
--------------------------------------------------------------------
Unit: L4D.Debug.Logging.pas
Released: 22nd February 2012
NOTE: THIS UNIT IS FOR INTERNAL DEVELOPMENT USE ONLY.
IT IS DESIGNED TO CHECK LUA C API CALL ORDERING
FOR CORRECTNESS!
Changelog:
22nd February 2012:
- Added
}
unit L4D.Debug.Logging;
interface
{$I Lua4Delphi.inc}
uses
{$IFDEF DELPHIXE2}
System.Classes, System.SysUtils,
{$ELSE}
Classes, SysUtils,
{$ENDIF}
L4D.Lua.Intf;
{$IFDEF L4D_API_LOGGING}
type
TL4DLogger = class(TPersistent)
private
FActive: Boolean;
FLog: TStringList;
FFileName: String;
public
constructor Create(const AFileName: String);
destructor Destroy; override;
procedure AddAPICall(const AMethodName: String; const ALuaState: PLuaState; const AParamStr: String; AParamValues: Array of Const);
procedure AddCustomMessage(const AMessage: String);
published
property Active: Boolean read FActive write FActive default False;
end;
var
L4DLogger: TL4DLogger;
const
L4DBoolStrings: Array[Boolean] of String = ('False', 'True');
{$ENDIF}
implementation
{$IFDEF L4D_API_LOGGING}
{ TL4DLogger }
procedure TL4DLogger.AddAPICall(const AMethodName: String; const ALuaState: PLuaState; const AParamStr: String; AParamValues: array of Const);
const
L4D_MESSAGE_FMT = '[%s] - %s($%p%s);';
L4D_MESSAGE_NOSTATE_FMT = '[%s] - %s(%s);';
begin
if not (FActive) then
Exit;
if ALuaState = nil then
FLog.Add(Format(L4D_MESSAGE_NOSTATE_FMT, [DateTimeToStr(Now), AMethodName, Format(AParamStr, AParamValues)]))
else
FLog.Add(Format(L4D_MESSAGE_FMT, [DateTimeToStr(Now), AMethodName, ALuaState, Format(AParamStr, AParamValues)]));
FLog.SaveToFile(FFileName);
end;
procedure TL4DLogger.AddCustomMessage(const AMessage: String);
const
L4D_MESSAGE_FMT = '[%s] - %s';
begin
FLog.Add(Format(L4D_MESSAGE_FMT, [DateTimeToStr(Now), AMessage]));
FLog.SaveToFile(FFileName);
end;
constructor TL4DLogger.Create(const AFileName: String);
begin
inherited Create;
FActive := False;
FLog := TStringList.Create;
FFileName := AFileName;
end;
destructor TL4DLogger.Destroy;
begin
FLog.Free;
inherited;
end;
initialization
L4DLogger := TL4DLogger.Create('C:\Lua4Delphi.log');
finalization
L4DLogger.Free;
{$ENDIF}
end.
|
unit taCsv;
interface
uses
taTypes, System.Classes, Data.DB;
const
SComma = ',';
STab = ''#9;
type
TTaCsv = class(TObject)
strict private
FLine: TStringList;
FLineIdx: Integer;
FReader: TStreamReader;
FWriter: TStreamWriter;
procedure Close;
procedure CommitLine;
function Eof: Boolean;
function FieldValue(AColumnIdx: Integer): string;
function ParseDateTime(const AValue: string): TDateTime;
function ReplaceDelimiter(const AString: string; const ANew, AOld: Char):
string;
procedure SetFieldValue(AColumnIdx: Integer; AValue: string); overload;
procedure SetFieldValue(AColumnIdx: Integer; AValue: TDateTime); overload;
private
FDelimiter: Char;
public
constructor Create;
destructor Destroy; override;
procedure GetCorrections(ACorrections: TTimePeriodList; var ALastStart:
TDatetime);
procedure GetTomatoes(ATomatoes: TTimePeriodList; var ALastStart: TDatetime);
function Next: Boolean;
procedure Open(const APath: string; AWrite: Boolean; AAppend: Boolean = False);
procedure PrintPeriods(APeriods: TTimePeriodList);
function TomatoDateToDateTime(AValue: string): TDateTime;
property Delimiter: Char read FDelimiter write FDelimiter;
end;
implementation
uses
taGlobals, System.Variants, System.SysUtils, System.DateUtils,
System.RegularExpressions;
const
SFmt_ddmmyyyyhhnn = '%s.%s.%s %s:%s';
constructor TTaCsv.Create;
begin
inherited Create;
FLine := TStringList.Create();
FDelimiter := SComma;
end;
destructor TTaCsv.Destroy;
begin
FreeAndNil(FLine);
Close;
inherited;
end;
procedure TTaCsv.Close;
begin
if Assigned(FReader) then
FreeAndNil(FReader);
if Assigned(FWriter) then
FreeAndNil(FWriter);
end;
procedure TTaCsv.CommitLine;
begin
FWriter.Write(FLine.CommaText);
FWriter.WriteLine;
end;
function TTaCsv.Eof: Boolean;
begin
Result := FReader.EndOfStream;
end;
function TTaCsv.FieldValue(AColumnIdx: Integer): string;
begin
Result := '';
if AColumnIdx >= FLine.Count then
Exit;
Result := FLine.Strings[AColumnIdx];
end;
procedure TTaCsv.GetCorrections(ACorrections: TTimePeriodList; var ALastStart:
TDatetime);
const
COLIDX_DATE = 0;
COLIDX_MINUTES = 1;
COLIDX_TAGS = 2;
begin
ACorrections.Clear;
try
while not Eof do
begin
ACorrections.Add(
TTimePeriod.Create(
ParseDateTime(FieldValue(COLIDX_DATE)),
StrToInt(FieldValue(COLIDX_MINUTES)) * SECONDSINMINUTE,
FieldValue(COLIDX_TAGS)
)
);
Next;
end;
except on e:Exception do
begin
e.RaiseOuterException(
Exception.CreateFmt('%s LRow = %d', [e.Message, FLineIdx])
);
end;
end;
ACorrections.ClearUntil(ALastStart);
if ACorrections.Count > 0 then
ALastStart := ACorrections.Last.Start;
end;
procedure TTaCsv.GetTomatoes(ATomatoes: TTimePeriodList; var ALastStart:
TDatetime);
const
COLIDX_END_DATE = 0;
COLIDX_TAGS = 1;
begin
ATomatoes.Clear;
try
while not Eof do
begin
ATomatoes.Add(
TTimePeriod.Create(
IncSecond(TomatoDateToDateTime(FieldValue(COLIDX_END_DATE)), -TOMATODURATION),
TOMATODURATION,
VarToStrDef(FieldValue(COLIDX_TAGS), '')
)
);
Next;
end;
except on e:Exception do
begin
e.RaiseOuterException(
Exception.CreateFmt('%s LRow = %d', [e.Message, FLineIdx])
);
end;
end;
ATomatoes.Reverse;
ATomatoes.ClearUntil(ALastStart);
//if ATomatoes.Count = 0 then
//Exception.Create('ATomatoes.Count = 0');
if ATomatoes.Count > 0 then
ALastStart := ATomatoes.Last.Start;
ATomatoes.ShrinkOverlapped;
ATomatoes.Check;
end;
function TTaCsv.Next: Boolean;
var
LStr: string;
begin
Result := not Eof;
if Result then
begin
LStr := FReader.ReadLine;
if FDelimiter <> SComma then
LStr := ReplaceDelimiter(LStr, SComma, FDelimiter);
FLine.StrictDelimiter := True;
FLine.CommaText := LStr;
Inc(FLineIdx);
//ProcessLine;
end;
end;
procedure TTaCsv.Open(const APath: string; AWrite: Boolean; AAppend: Boolean =
False);
begin
Close;
if not AWrite then
begin
FReader := TStreamReader.Create(APath, TEncoding.UTF8, True);
FLineIdx := -1;
Next;
end
else
FWriter := TStreamWriter.Create(APath, AAppend, TEncoding.UTF8);
end;
function TTaCsv.ParseDateTime(const AValue: string): TDateTime;
const
SRegEx_hhnnddmmyyyy = '(\d*):(\d*) (\d*)\.(\d*)\.(\d*)';
var
LMatch: TMatch;
LReg: TRegEx;
begin
LReg.Create(SRegEx_hhnnddmmyyyy);
LMatch := LReg.Match(AValue);
if not LMatch.Success then
NotSupported(AValue, 'AValue');
Result := StrToDateTime(
Format(SFmt_ddmmyyyyhhnn,
[
LMatch.Groups.Item[3].Value,
LMatch.Groups.Item[4].Value,
LMatch.Groups.Item[5].Value,
LMatch.Groups.Item[1].Value,
LMatch.Groups.Item[2].Value
])
);
end;
procedure TTaCsv.PrintPeriods(APeriods: TTimePeriodList);
var
I: Integer;
begin
for I := 0 to APeriods.Count - 1 do
begin
SetFieldValue(0, DateOf(APeriods[I].Start));
SetFieldValue(1, TimeOf(APeriods[I].Start));
SetFieldValue(2, TimeOf(APeriods[I].Finish));
SetFieldValue(4, APeriods[I].Tags);
CommitLine;
end;
end;
function TTaCsv.ReplaceDelimiter(const AString: string; const ANew, AOld:
Char): string;
const
SQuote = '"';
var
LPos: Integer;
LPrev: Integer;
LStrings: TStringList;
I: Integer;
begin
Result := '';
LStrings := TStringList.Create();
try
LPrev := 0;
for LPos := 1 to Length(AString) do
if AString[LPos] = AOld then
begin
LStrings.Add(Copy(AString, LPrev+1, LPos-LPrev-1));
LPrev := LPos;
end;
LStrings.Add(Copy(AString, LPrev+1, LPos-LPrev-1));
for I := 0 to LStrings.Count - 1 do
begin
if I > 0 then
Result := Result + ANew;
Result := Result + SQuote + LStrings[I] + SQuote;
end;
finally
FreeAndNil(LStrings);
end;
end;
procedure TTaCsv.SetFieldValue(AColumnIdx: Integer; AValue: string);
begin
while AColumnIdx >= FLine.Count do
FLine.Add('');
FLine.Strings[AColumnIdx] := AValue;
end;
procedure TTaCsv.SetFieldValue(AColumnIdx: Integer; AValue: TDateTime);
begin
if DateOf(AValue) > 0 then
SetFieldValue(AColumnIdx, DateTimeToStr(AValue))
else
SetFieldValue(AColumnIdx, TimeToStr(AValue))
end;
function TTaCsv.TomatoDateToDateTime(AValue: string): TDateTime;
const
STimePrefix: Char = 'T';
begin
AValue[Pos(' ', AValue)] := STimePrefix;
AValue := Copy(AValue, 1, Pos(' ', AValue)-1) + '.000'
+ Copy(AValue, Pos(' ', AValue)+1, MaxInt);
AValue := Copy(AValue, 1, Length(AValue) - 2) + ':'
+ Copy(AValue, Length(AValue) - 1, MaxInt);
Result := ISO8601ToDate(AValue, True);
end;
end.
|
{
WriteBytes: write formatted byte count.
}
PROCEDURE WriteBytes(numBytes : REAL);
BEGIN
IF numBytes < 1024 THEN
Write(numBytes:6:0)
ELSE IF numBytes < 10240 THEN
Write(numBytes/1024:5:1,'K')
ELSE IF numBytes < 1048576.0 THEN
Write(numBytes/1024:5:0,'K')
ELSE
Write(numBytes/1048576.0:5:1,'M');
END;
|
unit rODDiet;
interface
uses SysUtils, Windows, Classes, ORNet, ORFn, uCore, uConst, rOrders;
type
TOutpatientPatchInstalled = record
PatchInstalled: boolean;
PatchChecked: boolean;
end;
TUserHasFHAUTHKey = record
UserHasKey: boolean;
KeyChecked: boolean;
end;
TDietParams = record
Tray: Boolean;
Cafeteria: Boolean;
DiningRm: Boolean;
Bagged: Boolean;
RegIEN: Integer;
NPOIEN: Integer;
EarlyIEN: string;
LateIEN: string;
CurTF: string;
BTimes: string;
NTimes: string;
ETimes: string;
Alarms: string;
OPMaxDays: integer;
OPDefaultDiet: integer;
end;
function CurrentDietText: string;
function DietAttributes(OI: Integer): string;
function ExpandedQuantity(Product, Strength: Integer; const Qty: string): string;
procedure LoadDietParams(var DietParams: TDietParams; ALocation: string);
procedure AppendTFProducts(Dest: TStrings);
function SubSetOfDiets(aReturn: TStrings; const StartFrom: string; Direction: Integer): integer;
function SubSetOfOPDiets(aReturn: TStrings): integer;
procedure OrderLateTray(NewOrder: TOrder; Meal: Char; const MealTime: string; Bagged: Boolean);
function IsolationID: string;
function CurrentIsolation: string;
procedure LoadIsolations(Dest: TStrings);
procedure LoadDietQuickList(Dest: TStrings; const GroupID: string);
function DietDialogType(GroupIEN: Integer): Char;
function OutpatientPatchInstalled: boolean;
function UserHasFHAUTHKey: boolean;
procedure GetCurrentRecurringOPMeals(Dest: TStrings; MealType: string = '');
function OutpatientLocationConfigured(ALocation: string): boolean;
procedure CheckForDelayedDietOrders(var OutPutText: String; CurrentView: TOrderView; DispGrp: integer);
implementation
uses TRPCB, rMisc, rCore;
var
uOutpatientPatchInstalled: TOutpatientPatchInstalled;
uUserHasFHAUTHKey: TUserHasFHAUTHKey;
function DietAttributes(OI: Integer): string;
begin
CallVistA('ORWDFH ATTR', [OI], Result);
end;
procedure LoadDietParams(var DietParams: TDietParams; ALocation: string);
var
aLst: TStringList;
begin
aLst := TStringList.Create;
try
CallVistA('ORWDFH PARAM', [Patient.DFN, ALocation], aLst);
if aLst.Count > 0 then
begin
DietParams.BTimes := Pieces(aLst[0], U, 1, 6);
DietParams.NTimes := Pieces(aLst[0], U, 7, 12);
DietParams.ETimes := Pieces(aLst[0], U, 13, 18);
end;
if aLst.Count > 1 then
begin
DietParams.Alarms := Pieces(aLst[1], U, 1, 6);
DietParams.Bagged := Piece(aLst[1], U, 10) = 'Y';
end;
if aLst.Count > 2 then
begin
DietParams.Tray := Pos('T', aLst[2]) > 0;
DietParams.Cafeteria := Pos('C', aLst[2]) > 0;
DietParams.DiningRm := Pos('D', aLst[2]) > 0;
DietParams.RegIEN := StrToIntDef(Piece(aLst[2], U, 2), 0);
DietParams.NPOIEN := StrToIntDef(Piece(aLst[2], U, 3), 0);
DietParams.EarlyIEN := Piece(aLst[2], U, 4);
DietParams.LateIEN := Piece(aLst[2], U, 5);
DietParams.CurTF := Piece(aLst[2], U, 6);
end;
if (not DietParams.Tray) and (not DietParams.Cafeteria) and (not DietParams.DiningRm) then
DietParams.Tray := True;
if aLst.Count > 3 then
DietParams.OPMaxDays := StrToIntDef(aLst[3], 30)
else
DietParams.OPMaxDays := 30;
if aLst.Count > 4 then
DietParams.OPDefaultDiet := StrToIntDef(aLst[4], 0)
finally
FreeAndNil(aLst);
end;
end;
function CurrentDietText: string;
var
aLst: TStringList;
begin
aLst := TStringList.Create;
try
CallVistA('ORWDFH TXT', [Patient.DFN], aLst);
Result := aLst.Text;
finally
FreeAndNil(aLst);
end;
end;
function CurrentTFText(const IENStr: string): string;
begin
end;
procedure AppendTFProducts(Dest: TStrings);
var
aLst: TStringList;
begin
aLst := TStringList.Create;
try
CallVistA('ORWDFH TFPROD', [nil], aLst);
Dest.AddStrings(aLst);
finally
FreeAndNil(aLst);
end;
end;
function ExpandedQuantity(Product, Strength: Integer; const Qty: string): string;
begin
if (Product = 0) or (Strength = 0) or (Length(Qty) = 0) then
Result := ''
else
CallVistA('ORWDFH QTY2CC', [Product, Strength, Qty], Result);
end;
function SubSetOfDiets(aReturn: TStrings; const StartFrom: string; Direction: Integer): integer;
{ returns a list of orderable items matching an S.xxx cross reference (for use in a long list box) }
begin
CallVistA('ORWDFH DIETS', [StartFrom, Direction], aReturn);
Result := aReturn.Count;
end;
function SubSetOfOPDiets(aReturn: TStrings): integer;
begin
CallVistA('ORWDFH OPDIETS', [nil], aReturn);
Result := aReturn.Count;
end;
procedure OrderLateTray(NewOrder: TOrder; Meal: Char; const MealTime: string; Bagged: Boolean);
begin
CallV('ORWDFH ADDLATE', [Patient.DFN, Encounter.Provider, Encounter.Location, Meal, MealTime, Bagged]);
SetOrderFromResults(NewOrder);
end;
function IsolationID: string;
begin
CallVistA('ORWDFH ISOIEN', [nil], Result);
end;
function CurrentIsolation: string;
begin
CallVistA('ORWDFH CURISO', [Patient.DFN], Result);
end;
procedure LoadIsolations(Dest: TStrings);
begin
CallVistA('ORWDFH ISOLIST', [nil], Dest);
end;
procedure LoadDietQuickList(Dest: TStrings; const GroupID: string);
begin
CallVistA('ORWDXQ GETQLST', [GroupID, 'Q'], Dest);
end;
function DietDialogType(GroupIEN: Integer): Char;
var
aStr: string;
begin
CallVistA('ORWDFH FINDTYP', [GroupIEN], aStr);
Result := CharAt(aStr, 1);
if not CharInSet(Result, ['A', 'D', 'E', 'N', 'P', 'T', 'M']) then Result := 'D';
end;
function OutpatientPatchInstalled: boolean;
begin
with uOutpatientPatchInstalled do
if not PatchChecked then
begin
//PatchInstalled := True;
{ TODO -oRich V. -cOutpatient Meals : Uncomment when available }
PatchInstalled := (PackageVersion('FH') >= '5.5');
PatchChecked := True;
end;
Result := uOutpatientPatchInstalled.PatchInstalled;
end;
function UserHasFHAUTHKey: boolean;
begin
with uUserHasFHAUTHKey do
if not KeyChecked then
begin
UserHasKey := HasSecurityKey('FHAUTH');
KeyChecked := True;
end;
Result := uUserHasFHAUTHKey.UserHasKey;
end;
procedure GetCurrentRecurringOPMeals(Dest: TStrings; MealType: string = '');
begin
CallVistA('ORWDFH CURRENT MEALS', [Patient.DFN, MealType], Dest);
MixedCaseList(Dest);
end;
function OutpatientLocationConfigured(ALocation: string): boolean;
var
aStr: string;
begin
CallVistA('ORWDFH NFSLOC READY', [ALocation], aStr);
Result := (aStr = '1');
end;
procedure CheckForDelayedDietOrders(var OutPutText: string; CurrentView: TOrderView; DispGrp: Integer);
var
i, Z: Integer;
AList: TList;
EventList: TStringList;
x, PtEvtIFN, PtEvtName: string;
aReturn: TStringList;
const
TX_DEL = 'There are diet orders in future events which will not be affected by this action.';
begin
aReturn := TStringList.Create;
try
CallVistA('OREVNTX PAT', [Patient.DFN], aReturn);
if aReturn.Count > 1 then
begin
AList := TList.Create;
EventList := TStringList.Create;
try
for i := 1 to aReturn.Count - 1 do EventList.Add(aReturn[i]);
for i := 0 to EventList.Count - 1 do
begin
PtEvtIFN := Piece(EventList.Strings[i], '^', 1);
PtEvtName := Piece(EventList.Strings[i], '^', 2);
LoadOrdersAbbr(AList, CurrentView, PtEvtIFN);
for Z := AList.Count - 1 downto 0 do
begin
if TOrder(AList.Items[Z]).DGroup <> DispGrp then
begin
TOrder(AList.Items[Z]).Free;
AList.Delete(Z);
end;
end;
if AList.Count > 0 then
begin
x := '';
RetrieveOrderFields(AList, 0, 0);
OutPutText := OutPutText + CRLF + 'Delayed event: ' + PtEvtName;
for Z := 0 to AList.Count - 1 do
with TOrder(AList.Items[Z]) do
begin
x := x + #9 + StringReplace(Text, #13#10, #13#10#9, [rfReplaceAll, rfIgnoreCase]) + CRLF;
end;
OutPutText := OutPutText + CRLF + x;
end;
end;
if OutPutText > '' then OutPutText := TX_DEL + CRLF + OutPutText;
finally
EventList.Free;
with AList do
for i := 0 to Count - 1 do TOrder(Items[i]).Free;
AList.Free;
end;
end;
finally
FreeAndNil(aReturn);
end;
end;
end.
|
unit fChangePassword;
interface
uses
Winapi.Windows, Winapi.Messages, System.SysUtils, System.Variants,
System.Classes, Vcl.Graphics,
Vcl.Controls, Vcl.Forms, Vcl.Dialogs, Vcl.StdCtrls, Vcl.ExtCtrls;
type
TfrmChangePassword = class(TForm)
Label1: TLabel;
Label2: TLabel;
Label3: TLabel;
Label4: TLabel;
Label5: TLabel;
EdtOldPassword: TEdit;
EdtNewPassword: TEdit;
EdtConfirmNewPassword: TEdit;
Bevel1: TBevel;
Bevel2: TBevel;
btnChangedPassword: TButton;
lblUserName: TLabel;
Label6: TLabel;
Button1: TButton;
procedure btnChangedPasswordClick(Sender: TObject);
procedure Button1Click(Sender: TObject);
procedure FormClose(Sender: TObject; var Action: TCloseAction);
private
{ Private declarations }
function ValidPassword: boolean;
public
{ Public declarations }
end;
var
frmChangePassword: TfrmChangePassword;
implementation
{$R *.dfm}
uses dmCenterdb, ERSResStr;
procedure TfrmChangePassword.btnChangedPasswordClick(Sender: TObject);
var
err: integer;
begin
if ((trim(EdtOldPassword.Text) = '') or (trim(EdtNewPassword.Text) = '') or
(trim(EdtConfirmNewPassword.Text) = '')) then
Abort;
if ValidPassword = false then
Abort;
CenterDB.FDConnection1.StartTransaction;
try
err := CenterDB.FDConnection1.ExecSQL
(format('update hrm_auth_user set passwd = sha1(''%s'') where username = ''%s'' and passwd = sha1(''%s'');',
[trim(EdtNewPassword.Text), lblUserName.Caption,
trim(EdtOldPassword.Text)]));
if (err = 1) then
begin
CenterDB.FDConnection1.Commit;
MessageDlg(ChangedPwdSuccessStr, mtInformation, [mbOK], 0);
EdtOldPassword.Enabled := false;
EdtNewPassword.Enabled := false;
EdtConfirmNewPassword.Enabled := false;
btnChangedPassword.Enabled := false;
end
else
begin
MessageDlg(OldPwdIncorrectStr, mtWarning, [mbOK], 0);
end;
except
CenterDB.FDConnection1.Rollback;
end;
end;
procedure TfrmChangePassword.Button1Click(Sender: TObject);
begin
Self.Close;
end;
procedure TfrmChangePassword.FormClose(Sender: TObject;
var Action: TCloseAction);
begin
frmChangePassword := nil;
Action := cafree;
end;
function TfrmChangePassword.ValidPassword: boolean;
begin
if (trim(EdtNewPassword.Text) <> trim(EdtConfirmNewPassword.Text)) then
begin
MessageDlg(PwdConfirmPwdNotMatchStr, mtWarning, [mbOK], 0);
result := false;
end
else
result := true;
end;
end.
|
unit JD.Weather.AccuWeather;
interface
uses
System.Classes, System.SysUtils, System.Generics.Collections,
Vcl.Graphics, Vcl.Imaging.Jpeg, Vcl.Imaging.PngImage, Vcl.Imaging.GifImg,
JD.Weather, JD.Weather.Intf, SuperObject;
type
TAWEndpoint = (aeLocations, aeConditions, aeAlerts, aeDailyIndices,
aeAlarms, aeClimo, aeTropical, aeTidal, aeDaily, aeHourly, aeImagery,
aeTranslate, aeLocal);
TAWWeatherThread = class(TJDWeatherThread)
private
FLocationKey: String;
FLocationType: TJDWeatherLocationType;
FLocation1: String;
FLocation2: String;
FLocation: ISuperObject;
function Get(const U: String): ISuperObject;
public
function GetEndpointUrl(const Endpoint: TAWEndpoint;
const S: String): String;
procedure InvalidateLocation;
procedure CheckLocation;
public
function GetUrl: String; override;
function DoAll(Conditions: TWeatherConditions; Forecast: TWeatherForecast;
ForecastDaily: TWeatherForecast; ForecastHourly: TWeatherForecast;
Alerts: TWeatherAlerts; Maps: TWeatherMaps): Boolean; override;
function DoConditions(Conditions: TWeatherConditions): Boolean; override;
function DoForecast(Forecast: TWeatherForecast): Boolean; override;
function DoForecastHourly(Forecast: TWeatherForecast): Boolean; override;
function DoForecastDaily(Forecast: TWeatherForecast): Boolean; override;
function DoAlerts(Alerts: TWeatherAlerts): Boolean; override;
function DoMaps(Maps: TWeatherMaps): Boolean; override;
end;
implementation
uses
DateUtils, StrUtils, Math;
{ TAWWeatherThread }
function TAWWeatherThread.GetEndpointUrl(const Endpoint: TAWEndpoint;
const S: String): String;
begin
case Endpoint of
aeLocations: Result:= 'locations/v1/';
aeConditions: Result:= 'currentconditions/v1/';
aeAlerts: Result:= 'alerts/v1/';
aeDailyIndices: Result:= 'indices/v1/';
aeAlarms: Result:= 'alarms/v1/';
aeClimo: Result:= 'climo/v1/';
aeTropical: Result:= 'tropical/v1/';
aeTidal: Result:= 'tidal/v1/';
aeDaily: Result:= 'forecasts/v1/daily/';
aeHourly: Result:= 'forecasts/v1/hourly/';
aeImagery: Result:= 'imagery/v1/';
aeTranslate: Result:= 'translations/v1/';
aeLocal: Result:= 'localweather/v1/';
end;
Result:= GetUrl + Result;
Result:= Result + S + '.json?apikey='+Owner.Key;
//http://api.accuweather.com/alerts/v1/334907.json?apikey={your key}&details=true
//http://api.accuweather.com/locations/v1/cities/geoposition/search.json?q=40.59, -73.58&apikey={your key}
// http://api.accuweather.com/
// locations/
// v1/cities/geoposition/search
// .json
// ?apikey={your key}
// &q=40.59, -73.58
end;
function TAWWeatherThread.GetUrl: String;
begin
Result:= 'http://apidev.accuweather.com/';
end;
procedure TAWWeatherThread.CheckLocation;
var
U: String;
S: String;
O: ISuperObject;
begin
if FLocationKey <> '' then Exit;
//TODO: Connect to API and identify location
//Save location identifier to FLocationKey
case Owner.LocationType of
wlZip: U:= GetEndpointUrl(TAWEndpoint.aeLocations,
'poastalcodes/search')+'&q='+FLocation1;
wlCityState: U:= GetEndpointUrl(TAWEndpoint.aeLocations,
'cities/US/search')+'&q='+FLocation1+','+FLocation2;
wlCoords: U:= GetEndpointUrl(TAWEndpoint.aeLocations,
'cities/geoposition/search')+'&q='+FLocation1+','+FLocation2;
wlAutoIP: U:= GetEndpointUrl(TAWEndpoint.aeLocations,
'cities/ipaddress')+'&q='+FLocation1;
end;
S:= Web.Get(U);
O:= SO(S);
if Assigned(O) then begin
FLocation:= O;
FLocationKey:= O.S['Key'];
end;
end;
procedure TAWWeatherThread.InvalidateLocation;
begin
FLocationKey:= '';
end;
function TAWWeatherThread.Get(const U: String): ISuperObject;
var
S: String;
begin
Result:= nil;
S:= Web.Get(U);
Result:= SO(S);
end;
function TAWWeatherThread.DoAlerts(Alerts: TWeatherAlerts): Boolean;
var
U: String;
S1, S2: String;
O: ISuperObject;
begin
Result:= False;
S1:= Owner.LocationDetail1;
S2:= Owner.LocationDetail2;
if Owner.LocationType <> FLocationType then begin
FLocationType:= Owner.LocationType;
InvalidateLocation;
end;
if S1 <> FLocation1 then begin
FLocation1:= S1;
InvalidateLocation;
end;
if S2 <> FLocation2 then begin
FLocation2:= S2;
InvalidateLocation;
end;
CheckLocation;
U:= Self.GetEndpointUrl(TAWEndpoint.aeAlerts, FLocationKey);
O:= Get(U);
//TODO: Populate alerts structure
end;
function TAWWeatherThread.DoAll(Conditions: TWeatherConditions; Forecast,
ForecastDaily, ForecastHourly: TWeatherForecast; Alerts: TWeatherAlerts;
Maps: TWeatherMaps): Boolean;
begin
Result:= False;
end;
function TAWWeatherThread.DoConditions(Conditions: TWeatherConditions): Boolean;
begin
Result:= False;
end;
function TAWWeatherThread.DoForecast(Forecast: TWeatherForecast): Boolean;
begin
Result:= False;
end;
function TAWWeatherThread.DoForecastDaily(Forecast: TWeatherForecast): Boolean;
begin
Result:= False;
end;
function TAWWeatherThread.DoForecastHourly(Forecast: TWeatherForecast): Boolean;
begin
Result:= False;
end;
function TAWWeatherThread.DoMaps(Maps: TWeatherMaps): Boolean;
begin
Result:= False;
end;
end.
|
unit uROR_VistAStore;
{$I Components.inc}
interface
uses
SysUtils, Classes, Forms, OvcStore, TRPCB;
type
TRPCStringList = class(TStringList)
protected
fRPCBroker: TRPCBroker;
fRPCLoadParams: String;
fRPCSaveParams: String;
public
constructor Create(const aLoadParamsRPC: String; const aSaveParamsRPC: String);
destructor Destroy; override;
procedure LoadFromFile(const FileName: String); override;
procedure SaveToFile(const FileName: String); override;
property RPCBroker: TRPCBRoker read fRPCBroker write fRPCBroker;
end;
TCCRVistAStore = class(TO32XMLFileStore)
protected
fLocked: Boolean;
fOnAfterOpen: TNotifyEvent;
fOnBeforeClose: TNotifyEvent;
fOnBeforeOpen: TNotifyEvent;
fOptimization: Boolean;
fRPCBroker: TRPCBroker;
fRPCLoadParams: String;
fRPCSaveParams: String;
protected
procedure DoClose; override;
procedure DoOpen; override;
public
constructor Create(anOwner: TComponent); override;
destructor Destroy; override;
procedure Close;
property XMLText: TStringList read FStore;
published
property OnAfterOpen: TNotifyEvent read fOnAfterOpen write fOnAfterOpen;
property OnBeforeClose: TNotifyEvent read fOnBeforeClose write fOnBeforeClose;
property OnBeforeOpen: TNotifyEvent read fOnBeforeOpen write fOnBeforeOpen;
property Optimization: Boolean read fOptimization write fOptimization;
property RPCBroker: TRPCBRoker read fRPCBroker write fRPCBroker;
property RPCLoadParams: String read fRPCLoadParams write fRPCLoadParams;
property RPCSaveParams: String read fRPCSaveParams write fRPCSaveParams;
end;
implementation
uses
fROR_PCall, uROR_Utilities;
///////////////////////////////// TRPCStringList \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
constructor TRPCStringList.Create(const aLoadParamsRPC: String; const aSaveParamsRPC: String);
begin
inherited Create;
fRPCBroker := nil;
fRPCLoadParams := aLoadParamsRPC;
fRPCSaveParams := aSaveParamsRPC;
end;
destructor TRPCStringList.Destroy;
begin
fRPCBroker := nil;
inherited;
end;
procedure TRPCStringList.LoadFromFile(const FileName: String);
var
prmName: String;
begin
if not Assigned(RPCBroker) or (fRPCLoadParams = '') then
begin
Clear;
Exit;
end;
prmName := ExtractFileName(FileName);
try
CallRemoteProc(RPCBroker, fRPCLoadParams,
[prmName, 'USR'], nil, [rpcSilent], self);
except
end;
if Count > 0 then Delete(0);
end;
procedure TRPCStringList.SaveToFile(const FileName: String);
var
prmName: String;
begin
if not Assigned(RPCBroker) or (fRPCSaveParams = '') then Exit;
prmName := ExtractFileName(FileName);
try
if Count > 0 then
CallRemoteProc(RPCBroker, fRPCSaveParams,
[prmName, 'USR'], Self, [rpcSilent])
else
CallRemoteProc(RPCBroker, fRPCSaveParams,
[prmName, 'USR', '@'], nil, [rpcSilent]);
except
end;
end;
///////////////////////////////// TCCRVistAStore \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
constructor TCCRVistAStore.Create(anOwner: TComponent);
begin
inherited;
fRPCBroker := nil;
end;
destructor TCCRVistAStore.Destroy;
begin
if fOptimization then Close;
fRPCBroker := nil;
inherited;
end;
procedure TCCRVistAStore.Close;
begin
try
fLocked := False;
if Assigned(FStore) then
inherited Close;
except
end;
end;
procedure TCCRVistAStore.DoClose;
begin
if not fLocked then
begin
if Assigned(OnBeforeClose) then OnBeforeClose(self);
inherited;
end;
end;
procedure TCCRVistAStore.DoOpen;
begin
if not fLocked then
begin
if Assigned(OnBeforeOpen) then OnBeforeOpen(self);
FStore := TRPCStringList.Create(RPCLoadParams, RPCSaveParams);
TRPCStringList(FStore).RPCBroker := RPCBroker;
FStore.LoadFromFile(XMLFileName);
try
xsInitialize;
except
FStore.Clear;
xsInitialize;
end;
if fOptimization then fLocked := True;
if Assigned(OnAfterOpen) then OnAfterOpen(self);
end;
end;
end.
|
unit metadata;
{$mode objfpc}{$H+}
interface
uses
Classes, SysUtils, db, dialogs, typinfo, connection_transaction, sqldb, StdCtrls, Types;
type
TDBTable = class;
TDBField = class;
TDBField = class
private
FFieldType: TFieldType;
FName: string;
FCaption: string;
FWidth: integer;
FPrimaryKey: boolean;
FSecondary: boolean;
FTableRef: TDBTable;
FFieldRef: TDBField;
FOwner: TDBTable;
FVarCharLimit: integer;
FSortField: TDBField;
public
property Name: string read FName;
property Caption: string read FCaption;
property FieldType: TFieldType read FFieldType;
property Width: integer read FWidth write FWidth;
property Visible: boolean read FPrimaryKey write FPrimaryKey;
property TableRef: TDBTable read FTableRef;
property FieldRef: TDBField read FFieldRef;
property SortField: TDBField read FSortField write FSortField;
property VarCharLimit: integer read FVarCharLimit;
property TableOwner: TDBTable read FOwner;
property Secondary: boolean read FSecondary write FSecondary;
procedure RowsTo(AComboBox: TComboBox);
constructor Create(AOwner: TDBTable; AName, ACaption, ATableRef, AFieldRef: string;
AWidth: integer; AFieldType: TFieldType; APrimaryKey: boolean; AVarCharLimit: integer); overload;
constructor Create(AOwner: TDBTable; AName, ACaption: string; AWidth: integer; AFieldType:
TFieldType; APrimaryKey: boolean; AVarCharLimit: integer); overload;
end;
TDBFieldDynArray = array of TDBField;
TVariantDynArray = array of Variant;
TDBTable = class
private
FName: string;
FCaption: string;
FFields: TDBFieldDynArray;
FFieldsList: TStringList;
FTag: integer;
public
property Fields: TDBFieldDynArray read FFields write FFields;
property Name: string read FName;
property Caption: string read FCaption;
procedure AddField(AName, ACaption: string; AWidth: integer;
AFieldType: TFieldType; AVisible: boolean; AVarCharLimit: integer); overload;
procedure AddField(AName, ACaption, ATableRef, AFieldRef: string;
AWidth: integer; AFieldType: TFieldType; AVisible: boolean; AVarCharLimit: integer); overload;
class procedure Add(AName, ACaption: string);
class function TablesUsingTable(ATable: TDBTable): string;
constructor Create(AName, ACaption: string);
end;
TDBTableDynArray = array of TDBTable;
var
DBTables: TDBTableDynArray;
DBTablesList: TStringList;
DBTimeTable: TDBTable;
procedure SetSQLQuery(ATable: TDBTable; SQLQuery: TSQLQuery);
procedure AllQueryColumnsToList(ATable: TDBTable; var ASList: TStringList);
function NextID: integer;
implementation
procedure AddColumnsToQuery(ATable: TDBTable; SQLQuery: TSQLQuery); forward;
procedure TDBField.RowsTo(AComboBox: TComboBox);
begin
with ConTran.CommonSQLQuery do begin
Close;
SetSQLQuery(Self.TableOwner, ConTran.CommonSQLQuery);
Open;
First;
AComboBox.Clear;
while not EOF do begin
AComboBox.AddItem(
FieldByName(Self.TableOwner.Name + Self.Name).Value,
TObject(Pointer(FieldByName(Self.TableOwner.Name + 'id').AsInteger))
);
Next;
end;
end;
end;
function NextID: integer;
begin
with ConTran.CommonSQLQuery do begin
Close;
SQL.Clear;
SQL.Append('select next value for global_sequence');
SQL.Append('from RDB$DATABASE');
Open;
Result := Fields[0].Value;
end;
end;
procedure SetSQLQuery(ATable: TDBTable; SQLQuery: TSQLQuery);
var
i: integer;
begin
with SQLQuery.SQL do begin
Clear;
Append('select');
AddColumnsToQuery(ATable, SQLQuery);
Delete(Count - 1);
Append('from');
Append(ATable.Name + ' ');
with ATable do
for i := Low(Fields) to High(Fields) do
if Assigned(Fields[i].TableRef) then begin
Append('join ' + Fields[i].TableRef.Name + ' on ');
Append(' ' + Fields[i].TableRef.Name + '.' + Fields[i].FieldRef.Name + ' = ');
Append(' ' + Name + '.' + Fields[i].Name);
end;
end;
end;
procedure AddColumnsToQuery(ATable: TDBTable; SQLQuery: TSQLQuery);
var
i: integer;
begin
with SQLQuery.SQL, ATable do
for i := 0 to High(Fields) do begin
Append(Name + '.' + Fields[i].Name + ' as ' + Name + Fields[i].Name);
Append(',');
if Assigned(Fields[i].TableRef) then
AddColumnsToQuery(Fields[i].TableRef, SQLQuery);
end;
end;
procedure AllQueryColumnsToList(ATable: TDBTable; var ASList: TStringList);
var
i: integer;
begin
with ATable do
for i := 0 to High(Fields) do begin
ASList.AddObject(ATable.Name + Fields[i].Name, Fields[i]);
if Assigned(Fields[i].TableRef) then
AllQueryColumnsToList(Fields[i].TableRef, ASList);
end;
end;
procedure TDBTable.AddField(AName, ACaption: string; AWidth: integer;
AFieldType: TFieldType; AVisible: boolean; AVarCharLimit: integer);
begin
SetLength(FFields, Length(FFields) + 1);
FFieldsList.AddObject(AName, TDBField.Create(Self, AName, ACaption, AWidth, AFieldType, AVisible, AVarCharLimit));
FFields[High(FFields)] := (FFieldsList.Objects[FFieldsList.Count - 1] as TDBField);
end;
procedure TDBTable.AddField(AName, ACaption, ATableRef, AFieldRef: string;
AWidth: integer; AFieldType: TFieldType; AVisible: boolean; AVarCharLimit: integer);
begin
SetLength(FFields, Length(FFields) + 1);
FFieldsList.AddObject(AName, TDBField.Create(Self, AName, ACaption, ATableRef, AFieldRef,
AWidth, AFieldType, AVisible, AVarCharLimit));
FFields[High(FFields)] := (FFieldsList.Objects[FFieldsList.Count - 1] as TDBField);
end;
class procedure TDBTable.Add(AName, ACaption: string);
begin
SetLength(DBTables, Length(DBTables) + 1);
DBTablesList.AddObject(AName, TDBTable.Create(AName, ACaption));
DBTables[High(DBTables)] := (DBTablesList.Objects[DBTablesList.Count - 1] as TDBTable);
DBTables[High(DBTables)].FTag := High(DBTables);
end;
class function TDBTable.TablesUsingTable(ATable: TDBTable): string;
var
i, j: integer;
begin
for i := 0 to High(DBTables) do
for j := 0 to High(DBTables[i].Fields) do
if DBTables[i].Fields[j].TableRef = ATable then
if Pos(DBTables[i].Caption, Result) = 0 then
Result := Result + DBTables[i].Caption + #13 + #10;
end;
constructor TDBTable.Create(AName, ACaption: string);
begin
FName := AName;
FCaption := ACaption;
FFieldsList := TStringList.Create;
with FFieldsList do begin
Sorted := false;
Duplicates := dupError;
end;
end;
constructor TDBField.Create(AOwner: TDBTable; AName, ACaption, ATableRef, AFieldRef: string;
AWidth: integer; AFieldType: TFieldType; APrimaryKey: boolean; AVarCharLimit: integer);
begin
FName := AName;
FCaption := ACaption;
FWidth := AWidth;
FFieldType := AFieldType;
FPrimaryKey := APrimaryKey;
FOwner := AOwner;
FSortField := Self;
FVarCharLimit := AVarCharLimit;
FSecondary := false;
FTableRef := (DBTablesList.Objects[DBTablesList.IndexOf(ATableRef)] as TDBTable);
FFieldRef := (FTableRef.FFieldsList.Objects[FTableRef.FFieldsList.IndexOf(AFieldRef)] as TDBField);
end;
constructor TDBField.Create(AOwner: TDBTable; AName, ACaption: string;
AWidth: integer; AFieldType: TFieldType; APrimaryKey: boolean; AVarCharLimit: integer);
begin
FName := AName;
FCaption := ACaption;
FWidth := AWidth;
FFieldType := AFieldType;
FPrimaryKey := APrimaryKey;
FSortField := Self;
FSecondary := false;
FOwner := AOwner;
FVarCharLimit := AVarCharLimit;
end;
initialization
DBTablesList := TStringList.Create;
with DBTablesList do begin
Sorted := false;
Duplicates := dupError;
end;
TDBTable.Add('teachers', 'Преподаватели');
DBTables[0].AddField('id', 'П. ИД', 40, ftInteger, false, 0);
DBTables[0].AddField('name', 'Преподаватель', 300, ftString, true, 50);
TDBTable.Add('groups', 'Группы');
DBTables[1].AddField('id', 'Г. ИД', 40, ftInteger, false, 0);
DBTables[1].AddField('name', 'Группа', 100, ftString, true, 50);
DBTables[1].AddField('st_number', 'Количество', 60, ftInteger, true, 0);
DBTables[1].Fields[2].Secondary := true;
TDBTable.Add('courses', 'Дисциплины');
DBTables[2].AddField('id', 'ИД', 40, ftInteger, false, 0);
DBTables[2].AddField('name', 'Дисциплина', 300, ftString, true, 50);
TDBTable.Add('groups_courses', 'Дисц. групп');
DBTables[3].AddField('id', 'Ид. отношения', 40, ftInteger, false, 0);
DBTables[3].AddField('group_id', 'Ид. группы', 'Groups', 'id', 80, ftInteger, false, 0);
DBTables[3].AddField('course_id', 'Ид. предмета', 'courses', 'id', 80, ftInteger, false, 0);
TDBTable.Add('classrooms', 'Аудитории');
DBTables[4].AddField('id', 'ИД', 40, ftInteger, false, 0);
DBTables[4].AddField('classroom', 'Аудитория', 100, ftString, true, 50);
DBTables[4].AddField('capacity', 'Вместимость', 60, ftInteger, true, 0);
DBTables[4].Fields[2].Secondary := true;
TDBTable.Add('weekdays', 'Дни недели');
DBTables[5].AddField('id', 'День', 40, ftInteger, false, 0);
DBTables[5].AddField('weekday', 'День недели', 100, ftString, true, 15);
DBTables[5].Fields[1].SortField := DBTables[5].Fields[0];
TDBTable.Add('pairs', 'Период зан.');
DBTables[6].AddField('id', 'Пара', 40, ftInteger, false, 0);
DBTables[6].AddField('period', 'Время занятия', 100, ftString, true, 50);
DBTables[6].Fields[1].SortField := DBTables[6].Fields[0];
TDBTable.Add('teachers_courses', 'Дисц. препод.');
DBTables[7].AddField('id', 'Ид. отношения', 40, ftInteger, false, 0);
DBTables[7].AddField('teacher_id', 'Ид. преподавателя', 'teachers', 'id', 80, ftInteger, false, 0);
DBTables[7].AddField('course_id', 'Ид. предмета', 'courses', 'id', 80, ftInteger, false, 0);
TDBTable.Add('lessons', 'Расписание');
DBTimeTable := DBTables[8];
DBTables[8].AddField('id', 'Ид. записи', 40, ftInteger, false, 0);
DBTables[8].AddField('pair_id', 'Пара', 'pairs', 'id', 40, ftInteger, false, 0);
DBTables[8].AddField('weekday_id', 'Ид. дня недели', 'weekdays', 'id', 70, ftInteger, false, 0);
DBTables[8].AddField('group_id', 'Ид. группы', 'groups', 'id', 50, ftInteger, false, 0);
DBTables[8].AddField('course_id', 'Ид. предмета', 'courses', 'id', 70, ftInteger, false, 0);
DBTables[8].AddField('class_id', 'Ид. аудитории', 'classrooms', 'id', 70, ftInteger, false, 0);
DBTables[8].AddField('teacher_id', 'Ид. преподавателя', 'teachers', 'id', 70, ftInteger, false, 0);
end.
|
{
File: vecLib/vDSP.h
Contains: AltiVec DSP Interfaces
Version: vecLib-325.4
Copyright: ? 2000-2011 by Apple Computer, Inc., all rights reserved.
Bugs?: For bug reports, consult the following page on
the World Wide Web:
http://developer.apple.com/bugreporter/
}
unit Macapi.vecLib;
//{$WEAKPACKAGEUNIT}
//
//{$HPPEMIT ''}
//{$HPPEMIT '#include <Accelerate.framework/Accelerate.h>'}
//{$HPPEMIT ''}
interface
//uses
// Macapi.CoreServices, Macapi.Mach;
{$IF NOT DECLARED(_PU)}
const
{$IFDEF UNDERSCOREIMPORTNAME}
_PU = '_';
{$ELSE}
_PU = '';
{$ENDIF}
{$EXTERNALSYM _PU}
{$ENDIF}
const
libVeclib = '/System/Library/Frameworks/Accelerate.framework/Accelerate';
{ For documentation on vDSP, search for "vDSP" at http://developer.apple.com,
or search for one of the routine names below.
}
{ These symbols describe the vecLib version associated with this header.
vDSP_Version0 is a major version number.
vDSP_Version1 is a minor version number.
}
const
vDSP_Version0 = 325;
vDSP_Version1 = 4;
type
vDSP_Length = UInt32; //typedef unsigned long vDSP_Length;
{ vDSP_Length is for numbers of elements in arrays and indices of
elements in arrays.
(It is also used for the base-two logarithm of numbers of elements,
although a much smaller type is suitable for that.)
}
vDSP_Stride = Int32; //typedef long vDSP_Stride;
{ vDSP_Stride is for differences of indices of elements (which of
course includes strides).
}
//struct DSPComplex {
// float real;
// float imag;
//};
_DSPComplex = record
real: Single;
imag: Single;
end;
TDSPComplex = _DSPComplex;
PDSPComplex = ^TDSPComplex;
//typedef struct DSPComplex DSPComplex;
//
//struct DSPSplitComplex {
// float * realp;
// float * imagp;
//};
_DSPSplitComplex = record
realp: PSingle;
imagp: PSingle;
end;
TDSPSplitComplex = _DSPSplitComplex;
PDSPSplitComplex = ^TDSPSplitComplex;
//typedef struct DSPSplitComplex DSPSplitComplex;
//struct DSPDoubleComplex {
// double real;
// double imag;
//};
//typedef struct DSPDoubleComplex DSPDoubleComplex;
_DSPDoubleComplex = record
real: Double;
imag: Double;
end;
TDSPDoubleComplex = _DSPDoubleComplex;
PDSPDoubleComplex = ^TDSPDoubleComplex;
//struct DSPDoubleSplitComplex {
// double * realp;
// double * imagp;
//};
//typedef struct DSPDoubleSplitComplex DSPDoubleSplitComplex;
_DSPDoubleSplitComplex = record
realp: PDouble;
imagp: PDouble;
end;
TDSPDoubleSplitComplex = _DSPDoubleSplitComplex;
PDSPDoubleSplitComplex = ^TDSPDoubleSplitComplex;
//typedef struct OpaqueFFTSetup* FFTSetup;
//typedef struct OpaqueFFTSetupD* FFTSetupD;
_OpaqueFFTSetup = record
end;
TFFTSetup = _OpaqueFFTSetup;
PFFTSetup = ^TFFTSetUP;
_OpaqueFFTSetupD = record
end;
TFFTSetupD = _OpaqueFFTSetupD;
PFFTSetupD = ^TFFTSetUPD;
//typedef int FFTDirection;
//typedef int FFTRadix;
//enum {
// kFFTDirection_Forward = 1,
// kFFTDirection_Inverse = -1
//};
FFTDirection = (kFFTDirection_Inverse = -1, kFFTDirection_Forward = 1);
//enum {
// kFFTRadix2 = 0,
// kFFTRadix3 = 1,
// kFFTRadix5 = 2
//};
FFTRadix = (kFFTRadix2, kFFTRadix3, kFFTRadix5);
//enum {
// vDSP_HALF_WINDOW = 1,
// vDSP_HANN_DENORM = 0,
// vDSP_HANN_NORM = 2
//};
vDSP_NEED_NAME_ENUM = (vDSP_HANN_DENORM, vDSP_HALF_WINDOW, vDSP_HANN_NORM);
{ create_fftsetup and create_ffsetupD allocate memory and prepare constants
used by single- and double-precision FFT routines, respectively.
destroy_fftsetup and destroy_fftsetupD free the memory.
}
{
* vDSP_create_fftsetup()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern FFTSetup
//vDSP_create_fftsetup(
// vDSP_Length __vDSP_log2n,
// FFTRadix __vDSP_radix) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
function vDSP_create_fftsetup(__vDSP_log2n: vDSP_Length; __vDSP_radix: FFTRadix): PFFTSetup; cdecl;
external libVecLib name _PU + 'vDSP_create_fftsetup';
{
* vDSP_destroy_fftsetup()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_destroy_fftsetup(FFTSetup __vDSP_setup) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_destroy_fftsetup(__vDSP_setup:PFFTSetup); cdecl;
external libVeclib name _PU+ 'vDSP_destroy_fftsetup';
{
* vDSP_create_fftsetupD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern FFTSetupD
//vDSP_create_fftsetupD(
// vDSP_Length __vDSP_log2n,
// FFTRadix __vDSP_radix) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
function vDSP_create_fftsetupD(__vDSP_log2n: vDSP_Length; __vDSP_radix: FFTRadix): PFFTSetupD; cdecl;
external libVecLib name _PU + 'vDSP_create_fftsetupD';
{
* vDSP_destroy_fftsetupD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_destroy_fftsetupD(FFTSetupD __vDSP_setup) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_destroy_fftsetupD(__vDSP_setup:PFFTSetupD); cdecl;
external libVeclib name _PU+ 'vDSP_destroy_fftsetupD';
{ ctoz and ctozD convert a complex array to a complex-split array.
ztoc and ztocD convert a complex-split array to a complex array.
}
{
* vDSP_ctoz()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_ctoz(
// const DSPComplex __vDSP_C[],
// vDSP_Stride __vDSP_strideC,
// DSPSplitComplex * __vDSP_Z,
// vDSP_Stride __vDSP_strideZ,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_ctoz(
const __vDSP_C: PDSPComplex;
__vDSP_strideC: vDSP_Stride;
__vDSP_Z: PDSPSplitComplex;
__vDSP_strideZ: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_ctoz';
{
* vDSP_ztoc()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_ztoc(
// const DSPSplitComplex * __vDSP_Z,
// vDSP_Stride __vDSP_strideZ,
// DSPComplex __vDSP_C[],
// vDSP_Stride __vDSP_strideC,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_ztoc(
const __vDSP_Z: PDSPSplitComplex;
__vDSP_strideZ: vDSP_Stride;
__vDSP_C: PDSPComplex;
__vDSP_strideC: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_ztoc';
{
* vDSP_ctozD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_ctozD(
// const DSPDoubleComplex __vDSP_C[],
// vDSP_Stride __vDSP_strideC,
// DSPDoubleSplitComplex * __vDSP_Z,
// vDSP_Stride __vDSP_strideZ,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_ctozD(
const __vDSP_C: PDSPDoubleComplex;
__vDSP_strideC: vDSP_Stride;
__vDSP_Z: PDSPDoubleSplitComplex;
__vDSP_strideZ: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_ctozD';
{
* vDSP_ztocD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_ztocD(
// const DSPDoubleSplitComplex * __vDSP_Z,
// vDSP_Stride __vDSP_strideZ,
// DSPDoubleComplex __vDSP_C[],
// vDSP_Stride __vDSP_strideC,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_ztocD(
const __vDSP_Z: PDSPDoubleSplitComplex;
__vDSP_strideZ: vDSP_Stride;
__vDSP_C: PDSPDoubleComplex;
__vDSP_strideC: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_ztocD';
{ In-place complex Discrete Fourier Transform routines.
fft_zip Single-precision without temporary memory.
fft_zipt Single-precision with temporary memory.
fft_zipD Double-precision without temporary memory.
fft_ziptD Double-precision with temporary memory.
}
{
* vDSP_fft_zip()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zip(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zipt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zipt(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// DSPSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zipD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zipD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft_ziptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_ziptD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// DSPDoubleSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place complex Discrete Fourier Transform routines.
fft_zop Single-precision without temporary memory.
fft_zopt Single-precision with temporary memory.
fft_zopD Double-precision without temporary memory.
fft_zoptD Double-precision with temporary memory.
}
{
* vDSP_fft_zop()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zop(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zopt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zopt(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// DSPSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zopD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zopD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft_zoptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zoptD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// DSPDoubleSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ In-place real-to-complex Discrete Fourier Transform routines.
fft_zrip Single-precision without temporary memory.
fft_zript Single-precision with temporary memory.
fft_zripD Double-precision without temporary memory.
fft_zriptD Double-precision with temporary memory.
}
{
* vDSP_fft_zrip()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zrip(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zript()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zript(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// DSPSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zripD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zripD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft_zriptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zriptD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_ioData,
// vDSP_Stride __vDSP_stride,
// DSPDoubleSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place real-to-complex Discrete Fourier Transform routines.
fft_zrop Single-precision without temporary memory.
fft_zropt Single-precision with temporary memory.
fft_zropD Double-precision without temporary memory.
fft_zroptD Double-precision with temporary memory.
}
{
* vDSP_fft_zrop()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zrop(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zropt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_fft_zropt(
// FFTSetup __vDSP_setup,
// DSPSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// DSPSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft_zropD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zropD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft_zroptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_fft_zroptD(
// FFTSetupD __vDSP_setup,
// DSPDoubleSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// DSPDoubleSplitComplex * __vDSP_bufferTemp,
// vDSP_Length __vDSP_log2n,
// FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
(*
{ In-place two-dimensional complex Discrete Fourier Transform routines.
fft2d_zip Single-precision without temporary memory.
fft2d_zipt Single-precision with temporary memory.
fft2d_zipD Double-precision without temporary memory.
fft2d_ziptD Double-precision with temporary memory.
}
{
* vDSP_fft2d_zip()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zip(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zipt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zipt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
DSPSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zipD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zipD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft2d_ziptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_ziptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
DSPDoubleSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place two-dimensional complex Discrete Fourier Transform routines.
fft2d_zop Single-precision without temporary memory.
fft2d_zopt Single-precision with temporary memory.
fft2d_zopD Double-precision without temporary memory.
fft2d_zoptD Double-precision with temporary memory.
}
{
* vDSP_fft2d_zop()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zopt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zopt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
DSPSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zopD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zopD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft2d_zoptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zoptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
DSPDoubleSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ In-place two-dimensional real-to-complex Discrete Fourier Transform
routines.
fft2d_zrip Single-precision without temporary memory.
fft2d_zript Single-precision with temporary memory.
fft2d_zripD Double-precision without temporary memory.
fft2d_zriptD Double-precision with temporary memory.
}
{
* vDSP_fft2d_zrip()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zrip(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zript()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zript(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
DSPSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_direction) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zripD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zripD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft2d_zriptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zriptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_strideInRow,
vDSP_Stride __vDSP_strideInCol,
DSPDoubleSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place two-dimensional real-to-complex Discrete Fourier Transform
routines.
fft2d_zrop Single-precision without temporary memory.
fft2d_zropt Single-precision with temporary memory.
fft2d_zropD Double-precision without temporary memory.
fft2d_zroptD Double-precision with temporary memory.
}
{
* vDSP_fft2d_zrop()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zrop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zropt()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
extern void
vDSP_fft2d_zropt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStrideInRow,
vDSP_Stride __vDSP_signalStrideInCol,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_strideResultInRow,
vDSP_Stride __vDSP_strideResultInCol,
DSPSplitComplex * __vDSP_bufferTemp,
vDSP_Length __vDSP_log2nInCol,
vDSP_Length __vDSP_log2nInRow,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{
* vDSP_fft2d_zropD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zropD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_Kr,
vDSP_Stride __vDSP_Kc,
DSPDoubleSplitComplex * __vDSP_ioData2,
vDSP_Stride __vDSP_Ir,
vDSP_Stride __vDSP_Ic,
vDSP_Length __vDSP_log2nc,
vDSP_Length __vDSP_log2nr,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft2d_zroptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft2d_zroptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_Kr,
vDSP_Stride __vDSP_Kc,
DSPDoubleSplitComplex * __vDSP_ioData2,
vDSP_Stride __vDSP_Ir,
vDSP_Stride __vDSP_Ic,
DSPDoubleSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2nc,
vDSP_Length __vDSP_log2nr,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ In-place multiple complex Discrete Fourier Transform routines.
fftm_zip Single-precision without temporary memory.
fftm_zipt Single-precision with temporary memory.
fftm_zipD Double-precision without temporary memory.
fftm_ziptD Double-precision with temporary memory.
}
{
* vDSP_fftm_zip()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zip(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zipt()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zipt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zipD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zipD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_ziptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_ziptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place multiple complex Discrete Fourier Transform routines.
fftm_zop Single-precision without temporary memory.
fftm_zopt Single-precision with temporary memory.
fftm_zopD Double-precision without temporary memory.
fftm_zoptD Double-precision with temporary memory.
}
{
* vDSP_fftm_zop()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zopt()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zopt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
DSPSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zopD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zopD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zoptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zoptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
DSPDoubleSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ In-place multiple real-to-complex Discrete Fourier Transform routines.
fftm_zip Single-precision without temporary memory.
fftm_zipt Single-precision with temporary memory.
fftm_zipD Double-precision without temporary memory.
fftm_ziptD Double-precision with temporary memory.
}
{
* vDSP_fftm_zrip()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zrip(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zript()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zript(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zripD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zripD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zriptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zriptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Out-of-place multiple real-to-complex Discrete Fourier Transform routines.
fftm_zrop Single-precision without temporary memory.
fftm_zropt Single-precision with temporary memory.
fftm_zropD Double-precision without temporary memory.
fftm_zroptD Double-precision with temporary memory.
}
{
* vDSP_fftm_zrop()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zrop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zropt()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zropt(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
DSPSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zropD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zropD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fftm_zroptD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fftm_zroptD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
vDSP_Stride __vDSP_fftStride,
DSPDoubleSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Stride __vDSP_rfftStride,
DSPDoubleSplitComplex * __vDSP_temp,
vDSP_Length __vDSP_log2n,
vDSP_Length __vDSP_numFFT,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Non-power-of-two out-of-place complex Discrete Fourier Transform routines.
fft3_zop 3*2**n elements, single-precision without temporary memory.
fft3_zopD 3*2**n elements, double-precision without temporary memory.
fft5_zop 5*2**n elements, single-precision without temporary memory.
fft5_zopD 5*2**n elements, double-precision without temporary memory.
}
{
* vDSP_fft3_zop()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft3_zop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Length __vDSP_log2n,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft5_zop()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft5_zop(
FFTSetup __vDSP_setup,
DSPSplitComplex * __vDSP_signal,
vDSP_Stride __vDSP_signalStride,
DSPSplitComplex * __vDSP_result,
vDSP_Stride __vDSP_resultStride,
vDSP_Length __vDSP_log2n,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft3_zopD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft3_zopD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_K,
DSPDoubleSplitComplex * __vDSP_ioData2,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_log2n,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{
* vDSP_fft5_zopD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
extern void
vDSP_fft5_zopD(
FFTSetupD __vDSP_setup,
DSPDoubleSplitComplex * __vDSP_ioData,
vDSP_Stride __vDSP_K,
DSPDoubleSplitComplex * __vDSP_ioData2,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_log2n,
FFTDirection __vDSP_flag) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
*)
{ Convolution (or correlation), single-precision.}
{
* vDSP_conv()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_conv(
// const float __vDSP_signal[],
// vDSP_Stride __vDSP_signalStride,
// const float __vDSP_filter[],
// vDSP_Stride __vDSP_strideFilter,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_lenResult,
// vDSP_Length __vDSP_lenFilter) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Convolution (or correlation), double-precision.*/
/*
* vDSP_convD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_convD(
// const double __vDSP_signal[],
// vDSP_Stride __vDSP_signalStride,
// const double __vDSP_filter[],
// vDSP_Stride __vDSP_strideFilter,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_lenResult,
// vDSP_Length __vDSP_lenFilter) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ 3*3 filter convolution, single-precision.*/
/*
* vDSP_f3x3()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_f3x3(
// float * __vDSP_signal,
// vDSP_Length __vDSP_rows,
// vDSP_Length __vDSP_cols,
// float * __vDSP_filter,
// float * __vDSP_result) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ 3*3 filter convolution, double-precision.*/
/*
* vDSP_f3x3D()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_f3x3D(
// double * __vDSP_signal,
// vDSP_Length __vDSP_rows,
// vDSP_Length __vDSP_cols,
// double * __vDSP_filter,
// double * __vDSP_result) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ 5*5 filter convolution, single-precision.*/
/*
* vDSP_f5x5()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_f5x5(
// float * __vDSP_signal,
// vDSP_Length __vDSP_rows,
// vDSP_Length __vDSP_cols,
// float * __vDSP_filter,
// float * __vDSP_result) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ 5*5 filter convolution, double-precision.*/
/*
* vDSP_f5x5D()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_f5x5D(
// double * __vDSP_signal,
// vDSP_Length __vDSP_rows,
// vDSP_Length __vDSP_cols,
// double * __vDSP_filter,
// double * __vDSP_result) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ General two-dimensional (image) convolution, single-precision.*/
/*
* vDSP_imgfir()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_imgfir(
// float * __vDSP_signal,
// vDSP_Length __vDSP_numRow,
// vDSP_Length __vDSP_numCol,
// float * __vDSP_filter,
// float * __vDSP_result,
// vDSP_Length __vDSP_fnumRow,
// vDSP_Length __vDSP_fnumCol) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ General two-dimensional (image) convolution, double-precision.*/
/*
* vDSP_imgfirD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_imgfirD(
// double * __vDSP_signal,
// vDSP_Length __vDSP_numRow,
// vDSP_Length __vDSP_numCol,
// double * __vDSP_filter,
// double * __vDSP_result,
// vDSP_Length __vDSP_fnumRow,
// vDSP_Length __vDSP_fnumCol) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Matrix transpose, single-precision.*/
/*
* vDSP_mtrans()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mtrans(
// float * __vDSP_a,
// vDSP_Stride __vDSP_aStride,
// float * __vDSP_c,
// vDSP_Stride __vDSP_cStride,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_mtrans(
__vDSP_a: PSingle;
__vDSP_aStride: vDSP_Stride;
__vDSP_c: PSingle;
__vDSP_cStride: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mtrans';
{ Matrix transpose, double-precision.*/
/*
* vDSP_mtransD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mtransD(
// double * __vDSP_a,
// vDSP_Stride __vDSP_aStride,
// double * __vDSP_c,
// vDSP_Stride __vDSP_cStride,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_mtransD(
__vDSP_a: PDouble;
__vDSP_aStride: vDSP_Stride;
__vDSP_c: PDouble;
__vDSP_cStride: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mtransD';
{ Matrix multiply, single-precision.*/
/*
* vDSP_mmul()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mmul(
// float * __vDSP_a,
// vDSP_Stride __vDSP_aStride,
// float * __vDSP_b,
// vDSP_Stride __vDSP_bStride,
// float * __vDSP_c,
// vDSP_Stride __vDSP_cStride,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_mmul(
__vDSP_a: PSingle;
__vDSP_aStride: vDSP_Stride;
__vDSP_b: PSingle;
__vDSP_bStride: vDSP_Stride;
__vDSP_c: PSingle;
__vDSP_cStride: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mmul';
{ Matrix multiply, double-precision.*/
/*
* vDSP_mmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mmulD(
// double * __vDSP_a,
// vDSP_Stride __vDSP_aStride,
// double * __vDSP_b,
// vDSP_Stride __vDSP_bStride,
// double * __vDSP_c,
// vDSP_Stride __vDSP_cStride,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_mmulD(
__vDSP_a: PDouble;
__vDSP_aStride: vDSP_Stride;
__vDSP_b: PDouble;
__vDSP_bStride: vDSP_Stride;
__vDSP_c: PDouble;
__vDSP_cStride: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mmulD';
{ Complex-split matrix multiply and add, single-precision.*/
/*
* vDSP_zmma()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmma(
// DSPSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmma(
__vDSP_a: PDSPSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmma';
{ Complex-split matrix multiply and add, double-precision.*/
/*
* vDSP_zmmaD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmmaD(
// DSPDoubleSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPDoubleSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPDoubleSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPDoubleSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmmaD(
__vDSP_a: PDSPDoubleSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPDoubleSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPDoubleSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPDoubleSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmmaD';
{ Complex-split matrix multiply and subtract, single-precision.*/
/*
* vDSP_zmms()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmms(
// DSPSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmms(
__vDSP_a: PDSPSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmms';
{ Complex-split matrix multiply and subtract, double-precision.*/
/*
* vDSP_zmmsD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmmsD(
// DSPDoubleSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPDoubleSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPDoubleSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPDoubleSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmmsD(
__vDSP_a: PDSPDoubleSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPDoubleSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPDoubleSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPDoubleSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmmsD';
{ Complex-split matrix subtract and multiply, single-precision.*/
/*
* vDSP_zmsm()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmsm(
// DSPSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmsm(
__vDSP_a: PDSPSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmsm';
{ Complex-split matrix subtract and multiply, double-precision.*/
/*
* vDSP_zmsmD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmsmD(
// DSPDoubleSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPDoubleSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPDoubleSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// DSPDoubleSplitComplex * __vDSP_d,
// vDSP_Stride __vDSP_l,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmsmD(
__vDSP_a: PDSPDoubleSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPDoubleSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPDoubleSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_d: PDSPDoubleSplitComplex;
__vDSP_l: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmsmD';
{ Complex-split matrix multiply, single-precision.*/
/*
* vDSP_zmmul()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmmul(
// DSPSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmmul(
__vDSP_a: PDSPSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmmul';
{ Complex-split matrix multiply, double-precision.*/
/*
* vDSP_zmmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zmmulD(
// DSPDoubleSplitComplex * __vDSP_a,
// vDSP_Stride __vDSP_i,
// DSPDoubleSplitComplex * __vDSP_b,
// vDSP_Stride __vDSP_j,
// DSPDoubleSplitComplex * __vDSP_c,
// vDSP_Stride __vDSP_k,
// vDSP_Length __vDSP_M,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_zmmulD(
__vDSP_a: PDSPDoubleSplitComplex;
__vDSP_i: vDSP_Stride;
__vDSP_b: PDSPDoubleSplitComplex;
__vDSP_j: vDSP_Stride;
__vDSP_c: PDSPDoubleSplitComplex;
__vDSP_k: vDSP_Stride;
__vDSP_M: vDSP_Length;
__vDSP_N: vDSP_Length;
__vDSP_P: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zmmulD';
{ Vector add, single-precision.*/
/*
* vDSP_vadd()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vadd(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vadd(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vadd';
{ Vector add, double-precision.*/
/*
* vDSP_vaddD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vaddD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vaddD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vaddD';
{ Vector subtract, single-precision.*/
/*
* vDSP_vsub()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vsub(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vsub(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsub';
{ Vector subtract, double-precision.*/
/*
* vDSP_vsubD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vsubD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vsubD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsubD';
{ Vector multiply, single-precision.*/
/*
* vDSP_vmul()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vmul(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vmul(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vmul';
{ Vector multiply, double-precision.*/
/*
* vDSP_vmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vmulD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vmulD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vmulD';
{ Vector-scalar multiply, single-precision.*/
/*
* vDSP_vsmul()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vsmul(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float * __vDSP_input2,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vsmul(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsmul';
{ Vector-scalar multiply, double-precision.*/
/*
* vDSP_vsmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vsmulD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double * __vDSP_input2,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vsmulD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsmulD';
{ Vector square, single-precision.*/
/*
* vDSP_vsq()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vsq(
// const float __vDSP_input[],
// vDSP_Stride __vDSP_strideInput,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vsq(
__vDSP_input: PSingle;
__vDSP_strideInput: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsq';
{ Vector square, double-precision.*/
/*
* vDSP_vsqD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vsqD(
// const double __vDSP_input[],
// vDSP_Stride __vDSP_strideInput,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vsqD(
__vDSP_input: PDouble;
__vDSP_strideInput: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsqD';
{ Vector signed square, single-precision.*/
/*
* vDSP_vssq()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vssq(
// const float __vDSP_input[],
// vDSP_Stride __vDSP_strideInput,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vssq(
__vDSP_input: PSingle;
__vDSP_strideInput: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vssq';
{ Vector signed square, double-precision.*/
/*
* vDSP_vssqD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vssqD(
// const double __vDSP_input[],
// vDSP_Stride __vDSP_strideInput,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vssqD(
__vDSP_input: PDouble;
__vDSP_strideInput: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vssqD';
{ Dot product, single-precision.*/
/*
* vDSP_dotpr()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_dotpr(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// float * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_dotpr(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PSingle;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_dotpr';
{ Dot product, double-precision.*/
/*
* vDSP_dotprD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_dotprD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// double * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_dotprD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_stride2: vDSP_Stride;
__vDSP_result: PDouble;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_dotprD';
{ Vector add and multiply, single-precision.*/
/*
* vDSP_vam()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_vam(
// const float __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// const float __vDSP_input3[],
// vDSP_Stride __vDSP_stride3,
// float __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
procedure vDSP_vam(
__vDSP_input1: PSingle;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PSingle;
__vDSP_stride2: vDSP_Stride;
__vDSP_input3: PSingle;
__vDSP_stride3: vDSP_Stride;
__vDSP_result: PSingle;
__VDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vam';
{ Vector add and multiply, double-precision.*/
/*
* vDSP_vamD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vamD(
// const double __vDSP_input1[],
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// const double __vDSP_input3[],
// vDSP_Stride __vDSP_stride3,
// double __vDSP_result[],
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
procedure vDSP_vamD(
__vDSP_input1: PDouble;
__vDSP_stride1: vDSP_Stride;
__vDSP_input2: PDouble;
__vDSP_stride2: vDSP_Stride;
__vDSP_input3: PDouble;
__vDSP_stride3: vDSP_Stride;
__vDSP_result: PDouble;
__VDSP_strideResult: vDSP_Stride;
__vDSP_size: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vamD';
{ Complex-split convolution, single-precision.*/
/*
* vDSP_zconv()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zconv(
// DSPSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPSplitComplex * __vDSP_filter,
// vDSP_Stride __vDSP_strideFilter,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_lenResult,
// vDSP_Length __vDSP_lenFilter) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split convolution, double-precision.*/
/*
* vDSP_zconvD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zconvD(
// DSPDoubleSplitComplex * __vDSP_signal,
// vDSP_Stride __vDSP_signalStride,
// DSPDoubleSplitComplex * __vDSP_filter,
// vDSP_Stride __vDSP_strideFilter,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_lenResult,
// vDSP_Length __vDSP_lenFilter) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split vector add, single-precision.*/
/*
* vDSP_zvadd()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zvadd(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split vector add, double-precision.*/
/*
* vDSP_zvaddD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvaddD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split vector subtract, single-precision.*/
/*
* vDSP_zvsub()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zvsub(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split vector subtract, double-precision.*/
/*
* vDSP_zvsubD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvsubD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split vector multiply, single-precision.*/
/*
* vDSP_zvmul()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zvmul(
// const DSPSplitComplex *__vDSP_input1, vDSP_Stride __vDSP_stride1,
// const DSPSplitComplex *__vDSP_input2, vDSP_Stride __vDSP_stride2,
// const DSPSplitComplex *__vDSP_result, vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size,
// int __vDSP_conjugate)
// __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split vector multiply, double-precision.*/
/*
* vDSP_zvmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmulD(
// const DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// const DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size,
// int __vDSP_conjugate) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split dot product, single-precision.*/
/*
* vDSP_zdotpr()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zdotpr(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split dot product, double-precision.*/
/*
* vDSP_zdotprD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zdotprD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split inner (conjugate) dot product, single-precision.*/
/*
* vDSP_zidotpr()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zidotpr(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split inner (conjugate) dot product, double-precision.*/
/*
* vDSP_zidotprD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zidotprD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Dot product of complex-split with real, single-precision.*/
/*
* vDSP_zrdotpr()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zrdotpr(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Dot product of complex-split with real, double-precision.*/
/*
* vDSP_zrdotprD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrdotprD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Complex-split conjugate multiply and add, single-precision.*/
/*
* vDSP_zvcma()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void vDSP_zvcma(
// const DSPSplitComplex *__vDSP_input1, vDSP_Stride __vDSP_stride1,
// const DSPSplitComplex *__vDSP_input2, vDSP_Stride __vDSP_stride2,
// const DSPSplitComplex *__vDSP_input3, vDSP_Stride __vDSP_stride3,
// const DSPSplitComplex *__vDSP_result, vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size)
// __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Complex-split conjugate multiply and add, double-precision.*/
/*
* vDSP_zvcmaD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvcmaD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// DSPDoubleSplitComplex * __vDSP_input2,
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_input3,
// vDSP_Stride __vDSP_stride3,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Add complex-split and real, single-precision.*/
/*
* vDSP_zrvadd()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zrvadd(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Add complex-split and real, double-precision.*/
/*
* vDSP_zrvaddD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrvaddD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Subtract real from complex-split, single-precision.*/
/*
* vDSP_zrvsub()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zrvsub(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Subtract real from complex-split, double-precision.*/
/*
* vDSP_zrvsubD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrvsubD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Multiply complex-split and real, single-precision.*/
/*
* vDSP_zrvmul()
*
* Availability:
* Mac OS X: in version 10.0 and later in vecLib.framework
* CarbonLib: not in Carbon, but vecLib is compatible with CarbonLib
* Non-Carbon CFM: in vecLib 1.0 and later
}
//extern void
//vDSP_zrvmul(
// DSPSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const float __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_0, __IPHONE_4_0);
{ Multiply complex-split and real, double-precision.*/
/*
* vDSP_zrvmulD()
*
* Availability:
* Mac OS X: in version 10.2 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrvmulD(
// DSPDoubleSplitComplex * __vDSP_input1,
// vDSP_Stride __vDSP_stride1,
// const double __vDSP_input2[],
// vDSP_Stride __vDSP_stride2,
// DSPDoubleSplitComplex * __vDSP_result,
// vDSP_Stride __vDSP_strideResult,
// vDSP_Length __vDSP_size) __OSX_AVAILABLE_STARTING(__MAC_10_2, __IPHONE_4_0);
{ Vector convert double-precision to single-precision.*/
/*
* vDSP_vdpsp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vdpsp(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vdpsp(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vdpsp';
{ Vector convert single-precision to double-precision.*/
/*
* vDSP_vspdp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vspdp(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vspdp(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vspdp';
{ Vector absolute value, integer.*/
/*
* vDSP_vabsi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vabsi(
// int * __vDSP_A,
// vDSP_Stride __vDSP_I,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vabsi(
__vDSP_A: PInteger;
__vDSP_I: vDSP_Stride;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vabsi';
{ Vector (bit-wise) equivalence (not (A xor B)), integer.*/
/*
* vDSP_veqvi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_veqvi(
// int * __vDSP_A,
// vDSP_Stride __vDSP_I,
// int * __vDSP_B,
// vDSP_Stride __vDSP_J,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_veqvi(
__vDSP_A: PInteger;
__vDSP_I: vDSP_Stride;
__vDSP_B: PInteger;
__vDSP_J: vDSP_Stride;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_veqvi';
{ Vector divide, integer.*/
/*
* vDSP_vdivi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vdivi(
// int * __vDSP_A,
// vDSP_Stride __vDSP_I,
// int * __vDSP_B,
// vDSP_Stride __vDSP_J,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vdivi(
__vDSP_A: PInteger;
__vDSP_I: vDSP_Stride;
__vDSP_B: PInteger;
__vDSP_J: vDSP_Stride;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vdivi';
{ Vector fill, integer.*/
/*
* vDSP_vfilli()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vfilli(
// int * __vDSP_A,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vfilli(
__vDSP_A: PInteger;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vfilli';
{ Vector-scalar add, integer.*/
/*
* vDSP_vsaddi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vsaddi(
// int * __vDSP_A,
// vDSP_Stride __vDSP_I,
// int * __vDSP_B,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vsaddi(
__vDSP_A: PInteger;
__vDSP_I: vDSP_Stride;
__vDSP_B: PInteger;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsaddi';
{ Vector-scalar divide, integer.*/
/*
* vDSP_vsdivi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_vsdivi(
// int * __vDSP_A,
// vDSP_Stride __vDSP_I,
// int * __vDSP_B,
// int * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vsdivi(
__vDSP_A: PInteger;
__vDSP_I: vDSP_Stride;
__vDSP_B: PInteger;
__vDSP_C: PInteger;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vsdivi';
{ Complex-split accumulating autospectrum, single-precision.*/
/*
* vDSP_zaspec()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zaspec(
// DSPSplitComplex * __vDSP_A,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_zaspec(
__vDSP_A: PDSPSplitComplex;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zaspec';
{ Complex-split accumulating autospectrum, double-precision.*/
/*
* vDSP_zaspecD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zaspecD(
// DSPDoubleSplitComplex * A,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_zaspecD(
__vDSP_A: PDSPDoubleSplitComplex;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zaspecD';
{ Create Blackman window, single-precision.*/
/*
* vDSP_blkman_window()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_blkman_window(
// float * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_blkman_window(
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_blkman_window';
{ Create Blackman window, double-precision.*/
/*
* vDSP_blkman_windowD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_blkman_windowD(
// double * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_blkman_windowD(
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_blkman_windowD';
{ Complex-split coherence function, single-precision.*/
/*
* vDSP_zcoher()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zcoher(
// float * __vDSP_A,
// float * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// float * __vDSP_D,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_zcoher(
__vDSP_A: PSingle;
__vDSP_B: PSingle;
__vDSP_C: PDSPSplitComplex;
__vDSP_DC: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zcoher';
{ Complex-split coherence function, double-precision.*/
/*
* vDSP_zcoherD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zcoherD(
// double * __vDSP_A,
// double * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// double * __vDSP_D,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_zcoherD(
__vDSP_A: PDouble;
__vDSP_B: PDouble;
__vDSP_C: PDSPDoubleSplitComplex;
__vDSP_DC: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_zcoherD';
{ Complex-split anti-aliasing down-sample with real filter, single-precision.*/
/*
* vDSP_zrdesamp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrdesamp(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split anti-aliasing down-sample with real filter, double-precision.*/
/*
* vDSP_zrdesampD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrdesampD(
// DSPDoubleSplitComplex * A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Vector complex-split divide by real, single-precision.*/
/*
* vDSP_zrvdiv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrvdiv(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Vector complex-split divide by real, double-precision.*/
/*
* vDSP_zrvdivD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zrvdivD(
// DSPDoubleSplitComplex * A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Transfer function (B/A), single-precision.*/
/*
* vDSP_ztrans()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_ztrans(
// float * __vDSP_A,
// DSPSplitComplex * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Transfer function (B/A), double-precision.*/
/*
* vDSP_ztransD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_ztransD(
// double * __vDSP_A,
// DSPDoubleSplitComplex * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector divide, single-precision.*/
/*
* vDSP_zvdiv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvdiv(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_B,
// vDSP_Stride __vDSP_J,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector divide, double-precision.*/
/*
* vDSP_zvdivD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvdivD(
// DSPDoubleSplitComplex * A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_B,
// vDSP_Stride __vDSP_J,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split accumulating cross-spectrum, single-precision.*/
/*
* vDSP_zcspec()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zcspec(
// DSPSplitComplex * __vDSP_A,
// DSPSplitComplex * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split accumulating cross-spectrum, double-precision.*/
/*
* vDSP_zcspecD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zcspecD(
// DSPDoubleSplitComplex * A,
// DSPDoubleSplitComplex * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector absolute value, single-precision.*/
/*
* vDSP_zvabs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvabs(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector absolute value, double-precision.*/
/*
* vDSP_zvabsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvabsD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector conjugate and multiply, single-precision.*/
/*
* vDSP_zvcmul()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvcmul(
// const DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// const DSPSplitComplex * __vDSP_B,
// vDSP_Stride __vDSP_J,
// const DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector conjugate and multiply, double-precision.*/
/*
* vDSP_zvcmulD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvcmulD(
// const DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// const DSPDoubleSplitComplex * __vDSP_B,
// vDSP_Stride __vDSP_J,
// const DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector conjugate, single-precision.*/
/*
* vDSP_zvconj()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvconj(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector conjugate, double-precision.*/
/*
* vDSP_zvconjD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvconjD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector multiply with scalar, single-precision.*/
/*
* vDSP_zvzsml()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvzsml(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector multiply with scalar, double-precision.*/
/*
* vDSP_zvzsmlD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvzsmlD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector fill, single-precision.*/
/*
* vDSP_zvfill()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvfill(
// DSPSplitComplex * __vDSP_A,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector fill, double-precision.*/
/*
* vDSP_zvfillD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvfillD(
// DSPDoubleSplitComplex * __vDSP_A,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector magnitudes squared, single-precision.*/
/*
* vDSP_zvmags()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmags(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector magnitudes squared, double-precision.*/
/*
* vDSP_zvmagsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmagsD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector magnitudes square and add, single-precision.*/
/*
* vDSP_zvmgsa()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmgsa(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector magnitudes square and add, double-precision.*/
/*
* vDSP_zvmgsaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmgsaD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector move, single-precision.*/
/*
* vDSP_zvmov()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmov(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector move, double-precision.*/
/*
* vDSP_zvmovD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvmovD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector negate, single-precision.*/
/*
* vDSP_zvneg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvneg(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector negate, double-precision.*/
/*
* vDSP_zvnegD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvnegD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector phase, single-precision.*/
/*
* vDSP_zvphas()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvphas(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector phase, double-precision.*/
/*
* vDSP_zvphasD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvphasD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector multiply by scalar and add, single-precision.*/
/*
* vDSP_zvsma()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvsma(
// DSPSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPSplitComplex * __vDSP_B,
// DSPSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// DSPSplitComplex * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Complex-split vector multiply by scalar and add, double-precision.*/
/*
* vDSP_zvsmaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_zvsmaD(
// DSPDoubleSplitComplex * __vDSP_A,
// vDSP_Stride __vDSP_I,
// DSPDoubleSplitComplex * __vDSP_B,
// DSPDoubleSplitComplex * __vDSP_C,
// vDSP_Stride __vDSP_K,
// DSPDoubleSplitComplex * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
{ Difference equation, 2 poles, 2 zeros, single-precision.*/
/*
* vDSP_deq22()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_deq22(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_deq22(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_deq22';
{ Difference equation, 2 poles, 2 zeros, double-precision.*/
/*
* vDSP_deq22D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_deq22D(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_deq22D(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_deq22D';
{ Convolution with decimation (desampling), single-precision.*/
/*
* vDSP_desamp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_desamp(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// float * __vDSP_C,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_desamp(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length;
__vDSP_M: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_desamp';
{ Convolution with decimation (desampling), double-precision.*/
/*
* vDSP_desampD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_desampD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// double * __vDSP_C,
// vDSP_Length __vDSP_N,
// vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_desampD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length;
__vDSP_M: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_desampD';
{ Create Hamming window, single-precision.*/
/*
* vDSP_hamm_window()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_hamm_window(
// float * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_hamm_window(
__vDSP_A: PSingle;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_hamm_window';
{ Create Hamming window, double-precision.*/
/*
* vDSP_hamm_windowD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_hamm_windowD(
// double * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_hamm_windowD(
__vDSP_A: PDouble;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_hamm_windowD';
{ Create Hanning window, single-precision.*/
/*
* vDSP_hann_window()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_hann_window(
// float * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_hann_window(
__vDSP_A: PSingle;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_hann_window';
{ Create Hanning window, double-precision.*/
/*
* vDSP_hann_windowD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_hann_windowD(
// double * __vDSP_C,
// vDSP_Length __vDSP_N,
// int __vDSP_FLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_hann_windowD(
__vDSP_A: PDouble;
__vDSP_N: vDSP_Length;
__vDSP_FLAG: Integer); cdecl;
external libVecLib name _PU + 'vDSP_hann_windowD';
{ Maximum magnitude of vector, single-precision.*/
/*
* vDSP_maxmgv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxmgv(
// const float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxmgv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxmgv';
{ Maximum magnitude of vector, double-precision.*/
/*
* vDSP_maxmgvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxmgvD(
// const double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxmgvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxmgvD';
{ Maximum magnitude of vector, with index, single-precision.*/
/*
* vDSP_maxmgvi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxmgvi(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxmgvi(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxmgvi';
{ Maximum magnitude of vector, with index, double-precision.*/
/*
* vDSP_maxmgviD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxmgviD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxmgviD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxmgviD';
{ Maximum value of vector, single-precision.*/
/*
* vDSP_maxv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxv';
{ Maximum value of vector, double-precision.*/
/*
* vDSP_maxvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxvD';
{ Maximum value of vector, with index, single-precision.*/
/*
* vDSP_maxvi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxvi(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxvi(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxvi';
{ Maximum value of vector, with index, double-precision.*/
/*
* vDSP_maxviD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_maxviD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_maxviD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_maxviD';
{ Mean magnitude of vector, single-precision.*/
/*
* vDSP_meamgv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_meamgv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_meamgv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_meamgv';
{ Mean magnitude of vector, double-precision.*/
/*
* vDSP_meamgvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_meamgvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_meamgvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_meamgvD';
{ Mean of vector, single-precision.*/
/*
* vDSP_meanv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_meanv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_meanv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_meanv';
{ Mean of vector, double-precision.*/
/*
* vDSP_meanvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_meanvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_meanvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_meanvD';
{ Mean square of vector, single-precision.*/
/*
* vDSP_measqv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_measqv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_measqv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_measqv';
{ Mean square of vector, double-precision.*/
/*
* vDSP_measqvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_measqvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_measqvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_measqvD';
{ Minimum magnitude of vector, single-precision.*/
/*
* vDSP_minmgv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minmgv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minmgv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minmgv';
{ Minimum magnitude of vector, double-precision.*/
/*
* vDSP_minmgvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minmgvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minmgvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minmgvD';
{ Minimum magnitude of vector, with index, single-precision.*/
/*
* vDSP_minmgvi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minmgvi(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minmgvi(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minmgvi';
{ Minimum magnitude of vector, with index, double-precision.*/
/*
* vDSP_minmgviD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minmgviD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minmgviD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minmgviD';
{ Minimum value of vector, single-precision.*/
/*
* vDSP_minv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minv';
{ Minimum value of vector, double-precision.*/
/*
* vDSP_minvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minvD';
{ Minimum value of vector, with index, single-precision.*/
/*
* vDSP_minvi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minvi(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minvi(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minvi';
{ Minimum value of vector, with index, double-precision.*/
/*
* vDSP_minviD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_minviD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length * __vDSP_IC,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_minviD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
var __vDSP_IC: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_minviD';
{ Matrix move, single-precision.*/
/*
* vDSP_mmov()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mmov(
// float * __vDSP_A,
// float * __vDSP_C,
// vDSP_Length __vDSP_NC,
// vDSP_Length __vDSP_NR,
// vDSP_Length __vDSP_TCA,
// vDSP_Length __vDSP_TCC) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_mmov(
__vDSP_A: PSingle;
__vDSP_C: PSingle;
__vDSP_NC: vDSP_Length;
__vDSP_NR: vDSP_Length;
__vDSP_TCA: vDSP_Length;
__vDSP_TCC: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mmov';
{ Matrix move, double-precision.*/
/*
* vDSP_mmovD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mmovD(
// double * __vDSP_A,
// double * __vDSP_C,
// vDSP_Length __vDSP_NC,
// vDSP_Length __vDSP_NR,
// vDSP_Length __vDSP_TCA,
// vDSP_Length __vDSP_TCC) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_mmovD(
__vDSP_A: PDouble;
__vDSP_C: PDouble;
__vDSP_NC: vDSP_Length;
__vDSP_NR: vDSP_Length;
__vDSP_TCA: vDSP_Length;
__vDSP_TCC: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mmovD';
{ Mean of signed squares of vector, single-precision.*/
/*
* vDSP_mvessq()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mvessq(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_mvessq(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mvessq';
{ Mean of signed squares of vector, double-precision.*/
/*
* vDSP_mvessqD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_mvessqD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_mvessqD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_mvessqD';
{ Find zero crossing, single-precision.*/
/*
* vDSP_nzcros()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_nzcros(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// vDSP_Length __vDSP_B,
// vDSP_Length * __vDSP_C,
// vDSP_Length * __vDSP_D,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_nzcros(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: vDSP_Length;
var __vDSP_C: vDSP_Length;
var __vDSP_D: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_nzcros';
{ Find zero crossing, double-precision.*/
/*
* vDSP_nzcrosD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_nzcrosD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// vDSP_Length __vDSP_B,
// vDSP_Length * __vDSP_C,
// vDSP_Length * __vDSP_D,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_nzcrosD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: vDSP_Length;
var __vDSP_C: vDSP_Length;
var __vDSP_D: vDSP_Length;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_nzcrosD';
{ Convert rectangular to polar, single-precision.*/
/*
* vDSP_polar()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_polar(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_polar(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_polar';
{ Convert rectangular to polar, double-precision.*/
/*
* vDSP_polarD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_polarD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_polarD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_polarD';
{ Convert polar to rectangular, single-precision.*/
/*
* vDSP_rect()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_rect(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_rect(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_rect';
{ Convert polar to rectangular, double-precision.*/
/*
* vDSP_rectD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_rectD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_rectD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_rectD';
{ Root-mean-square of vector, single-precision.*/
/*
* vDSP_rmsqv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_rmsqv(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_rmsqv(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_rmsqv';
{ Root-mean-square of vector, double-precision.*/
/*
* vDSP_rmsqvD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_rmsqvD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_rmsqvD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_rmsqvD';
{ Scalar-vector divide, single-precision.*/
/*
* vDSP_svdiv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svdiv(
// float * __vDSP_A,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svdiv(
__vDSP_A: PSingle;
__vDSP_B: PSingle;
__vDSP_J: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svdiv';
{ Scalar-vector divide, double-precision.*/
/*
* vDSP_svdivD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svdivD(
// double * __vDSP_A,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svdivD(
__vDSP_A: PDouble;
__vDSP_B: PDouble;
__vDSP_J: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svdivD';
{ Sum of vector elements, single-precision.*/
/*
* vDSP_sve()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_sve(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_sve(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_sve';
{ Sum of vector elements, double-precision.*/
/*
* vDSP_sveD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_sveD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_sveD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_sveD';
{ Sum of vector elements magnitudes, single-precision.*/
/*
* vDSP_svemg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svemg(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svemg(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svemg';
{ Sum of vector elements' magnitudes, double-precision.*/
/*
* vDSP_svemgD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svemgD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svemgD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svemgD';
{ Sum of vector elements' squares, single-precision.*/
/*
* vDSP_svesq()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svesq(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svesq(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svesq';
{ Sum of vector elements' squares, double-precision.*/
/*
* vDSP_svesqD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svesqD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svesqD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svesqD';
(* Sum of vector elements' signed squares, single-precision.*/
/*
* vDSP_svs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*)
//extern void
//vDSP_svs(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svs(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svs';
{ Sum of vector elements' signed squares, double-precision.*/
/*
* vDSP_svsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
}
//extern void
//vDSP_svsD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_svsD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_svsD';
{* Vector add, add, and multiply, single-precision.*/
/*
* vDSP_vaam()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vaam(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// float * __vDSP_D,
// vDSP_Stride __vDSP_L,
// float * __vDSP_E,
// vDSP_Stride __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vaam(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_J: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_D: PSingle;
__vDSP_L: vDSP_Stride;
__vDSP_E: PSingle;
__vDSP_M: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vaam';
{* Vector add, add, and multiply, double-precision.*/
/*
* vDSP_vaamD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vaamD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// double * __vDSP_D,
// vDSP_Stride __vDSP_L,
// double * __vDSP_E,
// vDSP_Stride __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vaamD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_J: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_D: PDouble;
__vDSP_L: vDSP_Stride;
__vDSP_E: PDouble;
__vDSP_M: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vaamD';
{* Vector absolute value, single-precision.*/
/*
* vDSP_vabs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vabs(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vabs(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vabs';
{* Vector absolute value, double-precision.*/
/*
* vDSP_vabsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vabsD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vabsD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vabsD';
{* Vector add, subtract, and multiply, single-precision.*/
/*
* vDSP_vasbm()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vasbm(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// float * __vDSP_D,
// vDSP_Stride __vDSP_L,
// float * __vDSP_E,
// vDSP_Stride __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vasbm(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_J: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_D: PSingle;
__vDSP_L: vDSP_Stride;
__vDSP_E: PSingle;
__vDSP_M: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vasbm';
{* Vector add, subtract, and multiply, double-precision.*/
/*
* vDSP_vasbmD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vasbmD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// double * __vDSP_D,
// vDSP_Stride __vDSP_L,
// double * __vDSP_E,
// vDSP_Stride __vDSP_M,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vasbmD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_J: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_D: PDouble;
__vDSP_L: vDSP_Stride;
__vDSP_E: PDouble;
__vDSP_M: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vasbmD';
{* Vector add and scalar multiply, single-precision.*/
/*
* vDSP_vasm()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vasm(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// vDSP_Stride __vDSP_J,
// float * __vDSP_C,
// float * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vasm(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_J: vDSP_Stride;
__vDSP_C: PSingle;
__vDSP_D: PSingle;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vasm';
{* Vector add and scalar multiply, double-precision.*/
/*
* vDSP_vasmD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vasmD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// vDSP_Stride __vDSP_J,
// double * __vDSP_C,
// double * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vasmD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_J: vDSP_Stride;
__vDSP_C: PDouble;
__vDSP_D: PDouble;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vasmD';
{* Vector linear average, single-precision.*/
/*
* vDSP_vavlin()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vavlin(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vavlin(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vavlin';
{* Vector linear average, double-precision.*/
/*
* vDSP_vavlinD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vavlinD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vavlinD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vavlinD';
{* Vector clip, single-precision.*/
/*
* vDSP_vclip()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclip(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// float * __vDSP_C,
// float * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclip(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_C: PSingle;
__vDSP_D: PSingle;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclip';
{* Vector clip, double-precision.*/
/*
* vDSP_vclipD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclipD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// double * __vDSP_C,
// double * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclipD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_C: PDouble;
__vDSP_D: PDouble;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclipD';
{* Vector clip and count, single-precision.*/
/*
* vDSP_vclipc()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclipc(
// float * __vDSP_A,
// vDSP_Stride __vDSP_I,
// float * __vDSP_B,
// float * __vDSP_C,
// float * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N,
// vDSP_Length * __vDSP_NLOW,
// vDSP_Length * __vDSP_NHI) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclipc(
__vDSP_A: PSingle;
__vDSP_I: vDSP_Stride;
__vDSP_B: PSingle;
__vDSP_C: PSingle;
__vDSP_D: PSingle;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length;
var __vDSP_NLOW: vDSP_Length;
var __vDSP_NHI: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclipc';
{* Vector clip and count, double-precision.*/
/*
* vDSP_vclipcD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclipcD(
// double * __vDSP_A,
// vDSP_Stride __vDSP_I,
// double * __vDSP_B,
// double * __vDSP_C,
// double * __vDSP_D,
// vDSP_Stride __vDSP_L,
// vDSP_Length __vDSP_N,
// vDSP_Length * __vDSP_NLOW,
// vDSP_Length * __vDSP_NHI) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclipcD(
__vDSP_A: PDouble;
__vDSP_I: vDSP_Stride;
__vDSP_B: PDouble;
__vDSP_C: PDouble;
__vDSP_D: PDouble;
__vDSP_L: vDSP_Stride;
__vDSP_N: vDSP_Length;
var __vDSP_NLOW: vDSP_Length;
var __vDSP_NHI: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclipcD';
{* Vector clear, single-precision.*/
/*
* vDSP_vclr()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclr(
// float * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclr(
__vDSP_C: PSingle;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclr';
{* Vector clear, double-precision.*/
/*
* vDSP_vclrD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*}
//extern void
//vDSP_vclrD(
// double * __vDSP_C,
// vDSP_Stride __vDSP_K,
// vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
procedure vDSP_vclrD(
__vDSP_C: PDouble;
__vDSP_K: vDSP_Stride;
__vDSP_N: vDSP_Length); cdecl;
external libVecLib name _PU + 'vDSP_vclrD';
(*
/* Vector compress, single-precision.*/
/*
* vDSP_vcmprs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vcmprs(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector compress, double-precision.*/
/*
* vDSP_vcmprsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vcmprsD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to decibels, power, or amplitude, single-precision.*/
/*
* vDSP_vdbcon()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdbcon(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
unsigned int __vDSP_F) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to decibels, power, or amplitude, double-precision.*/
/*
* vDSP_vdbconD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdbconD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
unsigned int __vDSP_F) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector distance, single-precision.*/
/*
* vDSP_vdist()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdist(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector distance, double-precision.*/
/*
* vDSP_vdistD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdistD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector divide, single-precision.*/
/*
* vDSP_vdiv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdiv(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector divide, double-precision.*/
/*
* vDSP_vdivD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vdivD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector envelope, single-precision.*/
/*
* vDSP_venvlp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_venvlp(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector envelope, double-precision.*/
/*
* vDSP_venvlpD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_venvlpD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector fill, single-precision.*/
/*
* vDSP_vfill()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfill(
float * __vDSP_A,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector fill, double-precision.*/
/*
* vDSP_vfillD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfillD(
double * __vDSP_A,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 8-bit integer, round toward zero, single-precision.*/
/*
* vDSP_vfix8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix8(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 8-bit integer, round toward zero, double-precision.*/
/*
* vDSP_vfix8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix8D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 16-bit integer, round toward zero, single-precision.*/
/*
* vDSP_vfix16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix16(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 16-bit integer, round toward zero, double-precision.*/
/*
* vDSP_vfix16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix16D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 32-bit integer, round toward zero, single-precision.*/
/*
* vDSP_vfix32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix32(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 32-bit integer, round toward zero, double-precision.*/
/*
* vDSP_vfix32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfix32D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 8-bit integer, round to nearest, single-precision.*/
/*
* vDSP_vfixr8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr8(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 8-bit integer, round to nearest, double-precision.*/
/*
* vDSP_vfixr8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr8D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 16-bit integer, round to nearest, single-precision.*/
/*
* vDSP_vfixr16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr16(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 16-bit integer, round to nearest, double-precision.*/
/*
* vDSP_vfixr16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr16D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 32-bit integer, round to nearest, single-precision.*/
/*
* vDSP_vfixr32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr32(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to 32-bit integer, round to nearest, double-precision.*/
/*
* vDSP_vfixr32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixr32D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 8-bit integer, toward zero, single-precision.*/
/*
* vDSP_vfixu8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu8(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 8-bit integer, toward zero, double-precision.*/
/*
* vDSP_vfixu8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu8D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 16-bit integer, toward zero, single-precision.*/
/*
* vDSP_vfixu16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu16(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 16-bit integer, toward zero, double-precision.*/
/*
* vDSP_vfixu16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu16D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 32-bit integer, toward zero, single-precision.*/
/*
* vDSP_vfixu32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu32(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 32-bit integer, toward zero, double-precision.*/
/*
* vDSP_vfixu32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixu32D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 8-bit integer, to nearest, single-precision.*/
/*
* vDSP_vfixru8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru8(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 8-bit integer, to nearest, double-precision.*/
/*
* vDSP_vfixru8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru8D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned char * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 16-bit integer, to nearest, single-precision.*/
/*
* vDSP_vfixru16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru16(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 16-bit integer, to nearest, double-precision.*/
/*
* vDSP_vfixru16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru16D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned short * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 32-bit integer, to nearest, single-precision.*/
/*
* vDSP_vfixru32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru32(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert to unsigned 32-bit integer, to nearest, double-precision.*/
/*
* vDSP_vfixru32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfixru32D(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
unsigned int * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 8-bit integer, single-precision.*/
/*
* vDSP_vflt8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt8(
char * A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 8-bit integer, double-precision.*/
/*
* vDSP_vflt8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt8D(
char * A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 16-bit integer, single-precision.*/
/*
* vDSP_vflt16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt16(
short * A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 16-bit integer, double-precision.*/
/*
* vDSP_vflt16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt16D(
short * A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 32-bit integer, single-precision.*/
/*
* vDSP_vflt32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt32(
int * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 32-bit integer, double-precision.*/
/*
* vDSP_vflt32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vflt32D(
int * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 8-bit integer, single-precision.*/
/*
* vDSP_vfltu8()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu8(
unsigned char * A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 8-bit integer, double-precision.*/
/*
* vDSP_vfltu8D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu8D(
unsigned char * A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 16-bit integer, single-precision.*/
/*
* vDSP_vfltu16()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu16(
unsigned short * A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 16-bit integer, double-precision.*/
/*
* vDSP_vfltu16D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu16D(
unsigned short * A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 32-bit integer, single-precision.*/
/*
* vDSP_vfltu32()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu32(
unsigned int * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector convert from 32-bit integer, double-precision.*/
/*
* vDSP_vfltu32D()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfltu32D(
unsigned int * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector fraction part (subtract integer toward zero), single-precision.*/
/*
* vDSP_vfrac()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfrac(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector fraction part (subtract integer toward zero), double-precision.*/
/*
* vDSP_vfracD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vfracD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector gather, single-precision.*/
/*
* vDSP_vgathr()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgathr(
float * __vDSP_A,
vDSP_Length * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector gather, double-precision.*/
/*
* vDSP_vgathrD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgathrD(
double * __vDSP_A,
vDSP_Length * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector gather, absolute pointers, single-precision.*/
/*
* vDSP_vgathra()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgathra(
float ** A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector gather, absolute pointers, double-precision.*/
/*
* vDSP_vgathraD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgathraD(
double ** A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector generate tapered ramp, single-precision.*/
/*
* vDSP_vgen()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgen(
float * __vDSP_A,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector generate tapered ramp, double-precision.*/
/*
* vDSP_vgenD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgenD(
double * __vDSP_A,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector generate by extrapolation and interpolation, single-precision.*/
/*
* vDSP_vgenp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgenp(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector generate by extrapolation and interpolation, double-precision.*/
/*
* vDSP_vgenpD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vgenpD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector inverted clip, single-precision.*/
/*
* vDSP_viclip()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_viclip(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector inverted clip, double-precision.*/
/*
* vDSP_viclipD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_viclipD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector index (C[i] = A[truncate[B[i]]), single-precision.*/
/*
* vDSP_vindex()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vindex(
float * __vDSP_A,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector index (C[i] = A[truncate[B[i]]), double-precision.*/
/*
* vDSP_vindexD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vindexD(
double * __vDSP_A,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector interpolation between vectors, single-precision.*/
/*
* vDSP_vintb()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vintb(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector interpolation between vectors, double-precision.*/
/*
* vDSP_vintbD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vintbD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector test limit, single-precision.*/
/*
* vDSP_vlim()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vlim(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector test limit, double-precision.*/
/*
* vDSP_vlimD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vlimD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector linear interpolation, single-precision.*/
/*
* vDSP_vlint()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vlint(
float * __vDSP_A,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector linear interpolation, double-precision.*/
/*
* vDSP_vlintD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vlintD(
double * __vDSP_A,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and add, single-precision.*/
/*
* vDSP_vma()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vma(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and add, double-precision.*/
/*
* vDSP_vmaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmaD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector maxima, single-precision.*/
/*
* vDSP_vmax()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmax(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector maxima, double-precision.*/
/*
* vDSP_vmaxD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmaxD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector maximum magnitude, single-precision.*/
/*
* vDSP_vmaxmg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmaxmg(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector maximum magnitude, double-precision.*/
/*
* vDSP_vmaxmgD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmaxmgD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector minima, single-precision.*/
/*
* vDSP_vmin()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmin(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector minima, double-precision.*/
/*
* vDSP_vminD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vminD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector minimum magnitude, single-precision.*/
/*
* vDSP_vminmg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vminmg(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector minimum magnitude, double-precision.*/
/*
* vDSP_vminmgD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vminmgD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply, multiply, and add, single-precision.*/
/*
* vDSP_vmma()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmma(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
float * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply, multiply, and add, double-precision.*/
/*
* vDSP_vmmaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmmaD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
double * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply, multiply, and subtract, single-precision.*/
/*
* vDSP_vmmsb()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmmsb(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
float * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply, multiply, and subtract, double-precision.*/
/*
* vDSP_vmmsbD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmmsbD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
double * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and scalar add, single-precision.*/
/*
* vDSP_vmsa()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmsa(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and scalar add, double-precision.*/
/*
* vDSP_vmsaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmsaD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and subtract, single-precision.*/
/*
* vDSP_vmsb()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmsb(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector multiply and subtract, double-precision.*/
/*
* vDSP_vmsbD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vmsbD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector negative absolute value, single-precision.*/
/*
* vDSP_vnabs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vnabs(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector negative absolute value, double-precision.*/
/*
* vDSP_vnabsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vnabsD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector negate, single-precision.*/
/*
* vDSP_vneg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vneg(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector negate, double-precision.*/
/*
* vDSP_vnegD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vnegD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector polynomial, single-precision.*/
/*
* vDSP_vpoly()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vpoly(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector polynomial, single-precision.*/
/*
* vDSP_vpolyD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vpolyD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector Pythagoras, single-precision.*/
/*
* vDSP_vpythg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vpythg(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
float * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector Pythagoras, double-precision.*/
/*
* vDSP_vpythgD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vpythgD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
double * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector quadratic interpolation, single-precision.*/
/*
* vDSP_vqint()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vqint(
float * __vDSP_A,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector quadratic interpolation, double-precision.*/
/*
* vDSP_vqintD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vqintD(
double * __vDSP_A,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_M) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector build ramp, single-precision.*/
/*
* vDSP_vramp()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vramp(
float * __vDSP_A,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector build ramp, double-precision.*/
/*
* vDSP_vrampD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vrampD(
double * __vDSP_A,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector running sum integration, single-precision.*/
/*
* vDSP_vrsum()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vrsum(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_S,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector running sum integration, double-precision.*/
/*
* vDSP_vrsumD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vrsumD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_S,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector reverse order, in-place, single-precision.*/
/*
* vDSP_vrvrs()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vrvrs(
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector reverse order, in-place, double-precision.*/
/*
* vDSP_vrvrsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vrvrsD(
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar add, single-precision.*/
/*
* vDSP_vsadd()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsadd(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar add, double-precision.*/
/*
* vDSP_vsaddD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsaddD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract and multiply, single-precision.*/
/*
* vDSP_vsbm()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbm(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract and multiply, double-precision.*/
/*
* vDSP_vsbmD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbmD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract, subtract, and multiply, single-precision.*/
/*
* vDSP_vsbsbm()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbsbm(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
float * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract, subtract, and multiply, double-precision.*/
/*
* vDSP_vsbsbmD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbsbmD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
double * __vDSP_E,
vDSP_Stride __vDSP_M,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract and scalar multiply, single-precision.*/
/*
* vDSP_vsbsm()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbsm(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector subtract and scalar multiply, double-precision.*/
/*
* vDSP_vsbsmD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsbsmD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar divide, single-precision.*/
/*
* vDSP_vsdiv()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsdiv(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar divide, double-precision.*/
/*
* vDSP_vsdivD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsdivD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector Simpson integration, single-precision.*/
/*
* vDSP_vsimps()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsimps(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector Simpson integration, double-precision.*/
/*
* vDSP_vsimpsD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsimpsD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar multiply and vector add, single-precision.*/
/*
* vDSP_vsma()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsma(
const float * __vDSP_A,
vDSP_Stride __vDSP_I,
const float * __vDSP_B,
const float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar multiply and vector add, double-precision.*/
/*
* vDSP_vsmaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsmaD(
const double * __vDSP_A,
vDSP_Stride __vDSP_I,
const double * __vDSP_B,
const double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar multiply and scalar add, single-precision.*/
/*
* vDSP_vsmsa()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsmsa(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector-scalar multiply and scalar add, double-precision.*/
/*
* vDSP_vsmsaD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsmsaD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector scalar multiply and vector subtract, single-precision.*/
/*
* vDSP_vsmsb()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsmsb(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector scalar multiply and vector subtract, double-precision.*/
/*
* vDSP_vsmsbD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsmsbD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sort, in-place, single-precision.*/
/*
* vDSP_vsort()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsort(
float * __vDSP_C,
vDSP_Length __vDSP_N,
int __vDSP_OFLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sort, in-place, double-precision.*/
/*
* vDSP_vsortD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsortD(
double * __vDSP_C,
vDSP_Length __vDSP_N,
int __vDSP_OFLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sort, in-place, integer, single-precision.*/
/*
* vDSP_vsorti()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsorti(
float * __vDSP_C,
vDSP_Length * __vDSP_IC,
vDSP_Length * __vDSP_List_addr,
vDSP_Length __vDSP_N,
int __vDSP_OFLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sort, in-place, integer, double-precision.*/
/*
* vDSP_vsortiD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vsortiD(
double * __vDSP_C,
vDSP_Length * __vDSP_IC,
vDSP_Length * __vDSP_List_addr,
vDSP_Length __vDSP_N,
int __vDSP_OFLAG) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector swap, single-precision.*/
/*
* vDSP_vswap()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vswap(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector swap, double-precision.*/
/*
* vDSP_vswapD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vswapD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sliding window sum, single-precision.*/
/*
* vDSP_vswsum()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vswsum(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector sliding window sum, double-precision.*/
/*
* vDSP_vswsumD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vswsumD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N,
vDSP_Length __vDSP_P) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector table lookup and interpolation, single-precision.*/
/*
* vDSP_vtabi()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtabi(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_S1,
float * __vDSP_S2,
float * __vDSP_C,
vDSP_Length __vDSP_M,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector table lookup and interpolation, double-precision.*/
/*
* vDSP_vtabiD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtabiD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_S1,
double * __vDSP_S2,
double * __vDSP_C,
vDSP_Length __vDSP_M,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold, single-precision.*/
/*
* vDSP_vthr()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthr(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold, double-precision.*/
/*
* vDSP_vthrD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthrD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold with zero fill, single-precision.*/
/*
* vDSP_vthres()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthres(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold with zero fill, double-precision.*/
/*
* vDSP_vthresD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthresD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold with signed constant, single-precision.*/
/*
* vDSP_vthrsc()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthrsc(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
float * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector threshold with signed constant, double-precision.*/
/*
* vDSP_vthrscD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vthrscD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
double * __vDSP_D,
vDSP_Stride __vDSP_L,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector tapered merge, single-precision.*/
/*
* vDSP_vtmerg()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtmerg(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
vDSP_Stride __vDSP_J,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector tapered merge, double-precision.*/
/*
* vDSP_vtmergD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtmergD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
vDSP_Stride __vDSP_J,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector trapezoidal integration, single-precision.*/
/*
* vDSP_vtrapz()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtrapz(
float * __vDSP_A,
vDSP_Stride __vDSP_I,
float * __vDSP_B,
float * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Vector trapezoidal integration, double-precision.*/
/*
* vDSP_vtrapzD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_vtrapzD(
double * __vDSP_A,
vDSP_Stride __vDSP_I,
double * __vDSP_B,
double * __vDSP_C,
vDSP_Stride __vDSP_K,
vDSP_Length __vDSP_N) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Wiener Levinson, single-precision.*/
/*
* vDSP_wiener()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_wiener(
vDSP_Length __vDSP_L,
float * __vDSP_A,
float * __vDSP_C,
float * __vDSP_F,
float * __vDSP_P,
int __vDSP_IFLG,
int * __vDSP_IERR) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* Wiener Levinson, double-precision.*/
/*
* vDSP_wienerD()
*
* Availability:
* Mac OS X: in version 10.4 and later in vecLib.framework
* CarbonLib: not available
* Non-Carbon CFM: not available
*/
extern void
vDSP_wienerD(
vDSP_Length __vDSP_L,
double * __vDSP_A,
double * __vDSP_C,
double * __vDSP_F,
double * __vDSP_P,
int __vDSP_IFLG,
int * __vDSP_IERR) __OSX_AVAILABLE_STARTING(__MAC_10_4, __IPHONE_4_0);
/* vDSP_FFT16_copv and vDSP_FFT32_copv perform 16- and 32-element FFTs on
interleaved complex unit-stride vector-block-aligned data.
Parameters:
float *Output
Pointer to space for output data (interleaved complex). This
address must be vector-block aligned.
const float *Input
Pointer to input data (interleaved complex). This address must be
vector-block aligned.
FFT_Direction Direction
Transform direction, FFT_FORWARD or FFT_INVERSE.
These routines calculate:
For 0 <= k < N,
H[k] = sum(1**(S * j*k/N) * h[j], 0 <= j < N),
where:
N is 16 or 32, as specified by the routine name,
h[j] is Input[2*j+0] + i * Input[2*j+1] at routine entry,
H[j] is Output[2*j+0] + i * Output[2*j+1] at routine exit,
S is -1 if Direction is FFT_FORWARD and +1 if Direction is FFT_INVERSE,
and
1**x is e**(2*pi*i*x).
Input and Output may be equal but may not otherwise overlap.
*/
void vDSP_FFT16_copv(float *__vDSP_Output, const float *__vDSP_Input,
FFTDirection __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
void vDSP_FFT32_copv(float *__vDSP_Output, const float *__vDSP_Input,
FFTDirection __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_FFT16_zopv and vDSP_FFT32_zopv perform 16- and 32-element FFTs on
separated complex unit-stride vector-block-aligned data.
Parameters:
float *Or, float *Oi
Pointers to space for real and imaginary output data. These
addresses must be vector-block aligned.
const float *Ir, *Ii
Pointers to real and imaginary input data. These addresses must be
vector-block aligned.
FFT_Direction Direction
Transform direction, FFT_FORWARD or FFT_INVERSE.
These routines calculate:
For 0 <= k < N,
H[k] = sum(1**(S * j*k/N) * h[j], 0 <= j < N),
where:
N is 16 or 32, as specified by the routine name,
h[j] is Ir[j] + i * Ii[j] at routine entry,
H[j] is Or[j] + i * Oi[j] at routine exit,
S is -1 if Direction is FFT_FORWARD and +1 if Direction is FFT_INVERSE,
and
1**x is e**(2*pi*i*x).
Or may equal Ir or Ii, and Oi may equal Ii or Ir, but the ararys may not
otherwise overlap.
}
void vDSP_FFT16_zopv(
float *__vDSP_Or, float *__vDSP_Oi,
const float *__vDSP_Ir, const float *__vDSP_Ii,
FFTDirection __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
void vDSP_FFT32_zopv(
float *__vDSP_Or, float *__vDSP_Oi,
const float *__vDSP_Ir, const float *__vDSP_Ii,
FFTDirection __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ How to use the Discrete Fourier Transform (DFT) interface.
There are three steps to performing a DFT:
Call a setup routine (e.g., vDSP_DFT_zop_CreateSetup) to get a setup
object.
This is a preparation step to be done when a program is starting or
is starting some new phase (e.g., when a communication channel is
opened). It should never be done during real-time processing. The
setup routine is slow and is called only once to prepare data that
can be used many times.
Call an execution routine (e.g., vDSP_DFT_Execute) to perform a DFT,
and pass it the setup object.
The execution routine is fast (for selected cases) and is generally
called many times.
Call a destroy routine (e.g., vDSP_DFT_DestroySetup) to release the
memory held by the setup object.
This is done when a program is ending or is ending some phase.
After calling a destroy routine, the setup data is no longer valid
and should not be used.
Discussion:
The current sequences of setup, execution, destroy routines are:
vDSP_DFT_zop_CreateSetup, vDSP_DFT_Execute, vDSP_DestroySetup, or
vDSP_DFT_zrop_CreateSetup, vDSP_DFT_Execute, vDSP_DestroySetup, or
vDSP_DFT_CreateSetup, vDSP_DFT_zop, vDSP_DestroySetup.
Sharing DFT setups:
Any setup returned by a DFT setup routine may be passed as input to
any DFT setup routine, in the parameter named Previous. (This
allows the setups to share data, avoiding unnecessary duplication
of some setup data.) Setup routines may be executed in any order.
Passing any setup of a group of setups sharing data will result in
a new setup sharing data with all of the group.
When calling an execution routine, each setup can be used only with
its intended execution routine. Thus the setup returned by
vDSP_DFT_CreateSetup can only be used with vDSP_DFT_zop and not
with vDSP_DFT_Execute.
vDSP_DestroySetup is used to destroy any DFT setup.
History:
vDSP_DFT_CreateSetup and vDSP_DFT_zop are the original vDSP DFT
routines. vDSP_DFT_zop_CreateSetup, vDSP_DFT_zrop_CreateSetup, and
vDSP_DFT_Execute are newer, more specialized DFT routines. These
newer routines do not have stride parameters (stride is one) and
incorporate the direction parameter into the setup. This reduces
the number of arguments passed to the execution routine, which
receives only the setup and four address parameters. Additionally,
the complex-to-complex DFT (zop) and real-to-complex DFT (zrop) use
the same execution routine (the setup indicates which function to
perform).
We recommend you use vDSP_DFT_zop_CreateSetup,
vDPS_DFT_zrop_CreateSetup, and vDSP_DFT_Execute, and that you not
use vDSP_DFT_CreateSetup and vDSP_DFT_zop.
Multithreading:
Never call a setup or destroy routine in a thread when any DFT routine
(setup, execution, or destroy) that shares setup data may be
executing. (This applies not just to multiple threads but also to
calling DFT routines in signal handlers.)
Multiple DFT execution routines may be called simultaneously. (Their
access to the setup data is read-only.)
If you need to call setup and/or destroy routines while other DFT
routines might be executing, you can either use Grand Central Dispatch
or locks (costs time) to avoid simultaneous execution or you can create
separate setup objects for them (costs memory).
}
{ A vDSP_DFT_Setup object is a pointer to a structure whose definition is
unpublished.
}
typedef struct vDSP_DFT_SetupStruct *vDSP_DFT_Setup;
{
DFT direction may be specified as vDSP_DFT_FORWARD or vDSP_DFT_INVERSE.
typedef enum { vDSP_DFT_FORWARD = +1, vDSP_DFT_INVERSE = -1 ' vDSP_DFT_Direction;
}
type
vDSP_DFT_Direction = ( vDSP_DFT_FORWARD = +1, vDSP_DFT_INVERSE = -1);
{ vDSP_DFT_CreateSetup is a DFT setup routine. It creates a setup object
for use with the vDSP_DFT_zop execution routine. We recommend you use
vDSP_DFT_zop_CreateSetup instead of this routine.
Parameters:
vDSP_DFT_Setup Previous
Previous is either zero or a previous DFT setup. If a previous
setup is passed, the new setup will share data with the previous
setup, if feasible (and with any other setups the previous setup
shares with). If zero is passed, the routine will allocate and
initialize new memory.
vDSP_Length Length
Length is the number of complex elements to be transformed.
Return value:
Zero is returned if memory is unavailable.
The returned setup object may be used only with vDSP_DFT_zop for the length
given during setup. Unlike previous vDSP FFT routines, the setup may not
be used to execute transforms with shorter lengths.
Do not call this routine while any DFT routine sharing setup data might be
executing.
}
vDSP_DFT_Setup vDSP_DFT_CreateSetup(vDSP_DFT_Setup __vDSP_Previous,
vDSP_Length __vDSP_Length)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ vDSP_DFT_zop_CreateSetup is a DFT setup routine. It creates a setup object
for use with the vDSP_DFT_Execute execution routine, to perform a
complex-to-complex DFT.
Parameters:
vDSP_DFT_Setup Previous
Previous is either zero or a previous DFT setup. If a previous
setup is passed, the new setup will share data with the previous
setup, if feasible (and with any other setups the previous setup
shares with). If zero is passed, the routine will allocate and
initialize new memory.
vDSP_Length Length
Length is the number of complex elements to be transformed.
vDSP_DFT_Direction Direction
Transform direction, vDSP_DFT_FORWARD or vDSP_DFT_INVERSE.
Return value:
Zero is returned if memory is unavailable or if there is no
implementation for the requested case. Currently, the implemented
cases are:
Length = f * 2**n, where f is 3, 5, or 15 and 4 <= n.
Additionally, only cases where the array addresses (passed to
vDSP_DFT_Execute) are 16-byte aligned are optimized.
Function:
When vDSP_DFT_Execute is called with a setup returned from this
routine, it calculates:
For 0 <= k < N,
H[k] = sum(1**(S * j*k/N) * h[j], 0 <= j < N),
where:
N is the length given in the setup;
h is the array of complex numbers specified by Ir and Ii when
vDSP_DFT_Execute is called:
for 0 <= j < N,
h[j] = Ir[j] + i * Ii[j];
H is the array of complex numbers specified by Or and Oi when
vDSP_DFT_Execute returns:
for 0 <= k < N,
H[k] = Or[k] + i * Oi[k];
S is -1 if Direction is vDSP_DFT_FORWARD and +1 if Direction is
vDSP_DFT_INVERSE; and
1**x is e**(2*pi*i*x).
Performance:
Performance is good for these cases:
All addresses are 16-byte aligned, and the length is f * 2**n,
where f is 3, 5, or 15 and 4 <= n.
Performance is extremely slow for all other cases.
In-Place Operation:
For the cases with good performance as described above, Or may equal Ir
and Oi may equal Ii (in the call to vDSP_DFT_Execute). Otherwise, no
overlap of Or, Oi, Ir, and Ii is supported.
The returned setup object may be used only with vDSP_DFT_Execute for the
length given during setup. Unlike previous vDSP FFT routines, the setup
may not be used to execute transforms with shorter lengths.
Do not call this routine while any DFT routine sharing setup data might be
executing.
}
vDSP_DFT_Setup vDSP_DFT_zop_CreateSetup(vDSP_DFT_Setup __vDSP_Previous,
vDSP_Length __vDSP_Length, vDSP_DFT_Direction __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_0);
{ vDSP_DFT_zrop_CreateSetup is a DFT setup routine. It creates a setup
object for use with the vDSP_DFT_Execute execution routine, to perform a
real-to-complex DFT or a complex-to-real DFT.
Parameters:
vDSP_DFT_Setup Previous
Previous is either zero or a previous DFT setup. If a previous
setup is passed, the new setup will share data with the previous
setup, if feasible (and with any other setups the previous setup
shares with). If zero is passed, the routine will allocate and
initialize new memory.
vDSP_Length Length
Length is the number of real elements to be transformed (in a a
forward, real-to-complex transform) or produced (in a reverse,
complex-to-real transform). Length must be even.
vDSP_DFT_Direction Direction
Transform direction, vDSP_DFT_FORWARD or vDSP_DFT_INVERSE.
Return value:
Zero is returned if memory is unavailable or if there is no
implementation for the requested case. Currently, the implemented
cases are:
Length = f * 2**n, where f is 3, 5, or 15 and 5 <= n.
Additionally, only cases where the array addresses (passed to
vDSP_DFT_Execute) are 16-byte aligned are optimized.
Function:
When vDSP_DFT_Execute is called with a setup returned from this
routine, it calculates:
For 0 <= k < N,
H[k] = C * sum(1**(S * j*k/N) * h[j], 0 <= j < N),
where:
N is the Length given in the setup;
h is the array of numbers specified by Ir and Ii when
vDSP_DFT_Execute is called (see "Data Layout" below);
H is the array of numbers specified by Or and Oi when
vDSP_DFT_Execute returns (see "Data Layout" below);
C is 2 if Direction is vDSP_DFT_FORWARD and 1 if Direction is
vDSP_DFT_INVERSE;
S is -1 if Direction is vDSP_DFT_FORWARD and +1 if Direction is
vDSP_DFT_INVERSE; and
1**x is e**(2*pi*i*x).
Data Layout:
If Direction is vDSP_DFT_FORWARD, then:
h is an array of real numbers, with its even-index elements
stored in Ir and its odd-index elements stored in Ii:
For 0 <= j < N/2,
h[2*j+0] = Ir[j], and
h[2*j+1] = Ii[j].
H is an array of complex numbers, stored in Or and Oi:
H[0 ] = Or[0]. (H[0 ] is pure real.)
H[N/2] = Oi[0]. (H[N/2] is pure real.)
For 1 < k < N/2,
H[k] = Or[k] + i * Oi[k].
For N/2 < k < N, H[k] is not explicitly stored in memory but is
known because it necessarily equals the conjugate of H[N-k],
which is stored as described above.
If Direction is vDSP_DFT_Inverse, then the layouts of the input and
output arrays are swapped. Ir and Ii describe an input array with
complex elements laid out as described above for Or and Oi. When
vDSP_DFT_Execute returns, Or and Oi contain a pure real array, with
its even-index elements stored in Or and its odd-index elements in
Oi.
Performance:
Performance is good for these cases:
All addresses are 16-byte aligned, and the length is f * 2**n,
where f is 3, 5, or 15 and 5 <= n.
Performance is extremely slow for all other cases.
In-Place Operation:
For the cases with good performance as described above, Or may equal Ir
and Oi may equal Ii (in the call to vDSP_DFT_Execute). Otherwise, no
overlap of Or, Oi, Ir, and Ii is supported.
The returned setup object may be used only with vDSP_DFT_Execute for the
length given during setup. Unlike previous vDSP FFT routines, the setup
may not be used to execute transforms with shorter lengths.
Do not call this routine while any DFT routine sharing setup data might be
executing.
}
vDSP_DFT_Setup vDSP_DFT_zrop_CreateSetup(vDSP_DFT_Setup __vDSP_Previous,
vDSP_Length __vDSP_Length, vDSP_DFT_Direction __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_0);
{ vDSP_DFT_DestroySetup is a DFT destroy routine. It releases the memory
used by a setup object.
Parameters:
vDSP_DFT_Setup Setup
Setup is the setup object to be released. The object may have
been previously allocated with any DFT setup routine, such as
vDSP_DFT_zop_CreateSetup or vDSP_DFT_zrop_CreateSetup.
Destroying a setup with shared data is safe; it will release only memory
not needed by other undestroyed setups. Memory (and the data it contains)
is freed only when all setup objects using it have been destroyed.
Do not call this routine while any DFT routine sharing setup data might be
executing.
}
void vDSP_DFT_DestroySetup(vDSP_DFT_Setup __vDSP_Setup)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ vDSP_DFT_zop is a DFT execution routine. It performs a DFT, with the aid
of previously created setup data.
Parameters:
vDSP_DFT_Setup Setup
A setup object returned by a previous call to
vDSP_DFT_zop_CreateSetup.
const float *Ir
const float *Ii
Pointers to real and imaginary components of input data.
vDSP_Stride Is
The number of physical elements from one logical input element to
the next.
float *Or
float *Oi
Pointers to space for real and imaginary components of output
data.
The input and output arrays may not overlap except as specified
in "In-Place Operation", below.
vDSP_Stride Os
The number of physical elements from one logical output element to
the next.
vDSP_DFT_Direction Direction
Transform direction, vDSP_DFT_FORWARD or vDSP_DFT_INVERSE.
Observe there is no separate length parameter. The length is passed via
the setup object.
Performance:
Performance is good for these cases:
All addresses are 16-byte aligned, all strides are one, and the
length is f * 2**n, where f is 3, 5, or 15 and 4 <= n.
Performance is extremely slow for all other cases.
In-Place Operation:
For the cases with good performance as described above, Or may equal Ir
and Oi may equal Ii. Otherwise, no overlap of Or, Oi, Ir, and Ii is
supported.
This routine calculates:
For 0 <= k < N,
H[k] = sum(1**(S * j*k/N) * h[j], 0 <= j < N),
where:
N is the length given in the setup,
h is the array of complex numbers specified by Ir, Ii, and Is at
routine entry:
h[j] = Ir[j*Is] + i * Ii[j*Is],
for 0 <= j < N,
H is the array of complex numbers stored as specified by Or, Oi, and Os
at routine exit:
H[k] = Or[k*Os] + i * Oi[k*Os],
for 0 <= k < N,
S is -1 if Direction is vDSP_DFT_FORWARD and +1 if Direction is
vDSP_DFT_INVERSE, and
1**x is e**(2*pi*i*x).
Do not call this routine while any DFT setup or destroy routine sharing
setup data might be executing.
*/
void vDSP_DFT_zop(
const struct vDSP_DFT_SetupStruct *__vDSP_Setup,
const float *__vDSP_Ir, const float *__vDSP_Ii, vDSP_Stride __vDSP_Is,
float *__vDSP_Or, float *__vDSP_Oi, vDSP_Stride __vDSP_Os,
vDSP_DFT_Direction __vDSP_Direction)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_DFT_Execute is a DFT execution routine. It performs a DFT, with the
aid of previously created setup data.
Parameters:
vDSP_DFT_Setup Setup
A setup object returned by a previous call to
vDSP_DFT_zop_CreateSetup or vDSP_DFT_zrop_CreateSetup.
const float *Ir
const float *Ii
Pointers to input data.
float *Or
float *Oi
Pointers to output data.
The input and output arrays may not overlap except as specified
in "In-Place Operation", below.
Performance and In-Place Operation:
See notes for the setup routine for the operation being executed.
Function:
The function performed by this routine is determined by the setup
passed to it. The documentation for the routine used to create the
setup describes the function.
Note that different numbers of elements are required when this routine
is called, depending on the setup used:
When the setup is from vDSP_zop_CreateSetup, each array (Ir, Ii,
Or, and Oi) must have Length elements.
When the setup is from vDSP_zrop_CreateSetup, each array (Ir, Ii,
Or, and Oi) must have Length/2 elements.
Do not call this routine while any DFT setup or destroy routine sharing
setup data might be executing.
*/
void vDSP_DFT_Execute(
const struct vDSP_DFT_SetupStruct *__vDSP_Setup,
const float *__vDSP_Ir, const float *__vDSP_Ii,
float *__vDSP_Or, float *__vDSP_Oi)
__OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_0);
/* vDSP_dotpr2, vector single-precision stereo dot product.
Function:
This routine calculates the dot product of A0 with B and the dot
product of A1 with B. This is functionally equivalent to calculating
two dot products but might execute faster.
In pseudocode, the operation is:
// sum0 = 0;
// sum1 = 0;
// for (i = 0; i < Length; ++i)
//
// sum0 += A0[i*A0Stride] * B[i*BStride];
// sum1 += A1[i*A1Stride] * B[i*BStride];
//
// *C0 = sum0;
// *C1 = sum1;
Input:
const float *A0, vDSP_Stride A0Stride.
Starting address and stride for input vector A0.
const float *A1, vDSP_Stride A1Stride.
Starting address and stride for input vector A1.
const float *B, vDSP_Stride BStride.
Starting address and stride for input vector B.
float *C0.
Address for dot product of A0 and B.
float *C1.
Address for dot product of A1 and B.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to *C0 and *C1.
*/
void vDSP_dotpr2(
const float *__vDSP_A0, vDSP_Stride __vDSP_A0Stride,
const float *__vDSP_A1, vDSP_Stride __vDSP_A1Stride,
const float *__vDSP_B, vDSP_Stride __vDSP_BStride,
float *__vDSP_C0,
float *__vDSP_C1,
vDSP_Length __vDSP_Length)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_dotpr_s1_15, vector integer 1.15 format dot product.
Function:
This routine calculates the dot product of A with B.
In pseudocode, the operation is:
// sum = 0;
// for (i = 0; i < N; ++i)
//
// sum0 += A[i*AStride] * B[i*BStride];
//
// *C = sum;
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *A, vDSP_Stride AStride.
Starting address and stride for input vector A.
const short int *B, vDSP_Stride BStride.
Starting address and stride for input vector B.
short int *C.
Address for dot product of A and B.
vDSP_Length N.
Number of elements in each vector.
Output:
The result is written to *C.
*/
void vDSP_dotpr_s1_15(
const short int *__vDSP_A, vDSP_Stride __vDSP_AStride,
const short int *__vDSP_B, vDSP_Stride __vDSP_BStride,
short int *__vDSP_C,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_dotpr2_s1_15, vector integer 1.15 format stereo dot product.
Function:
This routine calculates the dot product of A0 with B and the dot
product of A1 with B. This is functionally equivalent to calculating
two dot products but might execute faster.
In pseudocode, the operation is:
// sum0 = 0;
// sum1 = 0;
// for (i = 0; i < N; ++i)
// {
// sum0 += A0[i*A0Stride] * B[i*BStride];
// sum1 += A1[i*A1Stride] * B[i*BStride];
//
// *C0 = sum0;
// *C1 = sum1;
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *A0, vDSP_Stride A0Stride.
Starting address and stride for input vector A0.
const short int *A1, vDSP_Stride A1Stride.
Starting address and stride for input vector A1.
const short int *B, vDSP_Stride BStride.
Starting address and stride for input vector B.
short int *C0.
Address for dot product of A0 and B.
short int *C1.
Address for dot product of A1 and B.
vDSP_Length N.
Number of elements in each vector.
Output:
The results are written to *C0 and *C1.
*/
void vDSP_dotpr2_s1_15(
const short int *__vDSP_A0, vDSP_Stride __vDSP_A0Stride,
const short int *__vDSP_A1, vDSP_Stride __vDSP_A1Stride,
const short int *__vDSP_B, vDSP_Stride __vDSP_BStride,
short int *__vDSP_C0,
short int *__vDSP_C1,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_dotpr_s8_24, vector integer 8.24 format dot product.
Function:
This routine calculates the dot product of A with B.
In pseudocode, the operation is:
// sum = 0;
// for (i = 0; i < N; ++i)
// {
// sum0 += A[i*AStride] * B[i*BStride];
//
// *C = sum;
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *A, vDSP_Stride AStride.
Starting address and stride for input vector A.
const int *B, vDSP_Stride BStride.
Starting address and stride for input vector B.
int *C.
Address for dot product of A and B.
vDSP_Length N.
Number of elements in each vector.
Output:
The result is written to *C.
*/
void vDSP_dotpr_s8_24(
const int *__vDSP_A, vDSP_Stride __vDSP_AStride,
const int *__vDSP_B, vDSP_Stride __vDSP_BStride,
int *__vDSP_C,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_dotpr2_s8_24, vector integer 8.24 format stereo dot product.
Function:
This routine calculates the dot product of A0 with B and the dot
product of A1 with B. This is functionally equivalent to calculating
two dot products but might execute faster.
In pseudocode, the operation is:
// sum0 = 0;
// sum1 = 0;
// for (i = 0; i < N; ++i)
// {
// sum0 += A0[i*A0Stride] * B[i*BStride];
// sum1 += A1[i*A1Stride] * B[i*BStride];
//
// *C0 = sum0;
// *C1 = sum1;
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *A0, vDSP_Stride A0Stride.
Starting address and stride for input vector A0.
const int *A1, vDSP_Stride A1Stride.
Starting address and stride for input vector A1.
const int *B, vDSP_Stride BStride.
Starting address and stride for input vector B.
int *C0.
Address for dot product of A0 and B.
int *C1.
Address for dot product of A1 and B.
vDSP_Length N.
Number of elements in each vector.
Output:
The results are written to *C0 and *C1.
*/
void vDSP_dotpr2_s8_24(
const int *__vDSP_A0, vDSP_Stride __vDSP_A0Stride,
const int *__vDSP_A1, vDSP_Stride __vDSP_A1Stride,
const int *__vDSP_B, vDSP_Stride __vDSP_BStride,
int *__vDSP_C0,
int *__vDSP_C1,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmul, vector single-precision vramp and multiply.
This routine puts into O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp
in a consecutive call. To continue the ramp smoothly, the new value of
*Step includes rounding errors accumulated during the routine rather than
being calculated directly as *Start + N * *Step.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] = *Start * I[i*IS];
// *Start += *Step;
//
Input:
const float *I, vDSP_Stride IS.
Starting address and stride for the input vector.
float *Start.
Starting value for the ramp.
const float *Step.
Value of the step for the ramp.
float *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmul(
const float *__vDSP_I, vDSP_Stride __vDSP_IS,
float *__vDSP_Start,
const float *__vDSP_Step,
float *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmuladd, vector single-precision vramp, multiply and add.
This routine adds to O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp in a
consecutive call. To continue the ramp smoothly, the new value of *Step
includes rounding errors accumulated during the routine rather than being
calculated directly as *Start + N * *Step.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] += *Start * I[i*IS];
// *Start += *Step;
//
Input:
const float *I, vDSP_Stride IS.
Starting address and stride for the input vector.
float *Start.
Starting value for the ramp.
const float *Step.
Value of the step for the ramp.
float *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are added to O.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmuladd(
const float *__vDSP_I, vDSP_Stride __vDSP_IS,
float *__vDSP_Start,
const float *__vDSP_Step,
float *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmul2, stereo vector single-precision vramp and multiply.
This routine:
Puts into O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Puts into O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call. To continue
the ramp smoothly, the new value of *Step includes rounding errors
accumulated during the routine rather than being calculated directly as
*Start + N * *Step.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] = *Start * I0[i*IS];
// O1[i*OS] = *Start * I1[i*IS];
// *Start += *Step;
//
Input:
const float *I0, const float *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
float *Start.
Starting value for the ramp.
const float *Step.
Value of the step for the ramp.
float *O0, float *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmul2(
const float *__vDSP_I0, const float *__vDSP_I1, vDSP_Stride __vDSP_IS,
float *__vDSP_Start,
const float *__vDSP_Step,
float *__vDSP_O0, float *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmuladd2, stereo vector single-precision vramp, multiply and add.
This routine:
Adds to O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Adds to O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call. To continue
the ramp smoothly, the new value of *Step includes rounding errors
accumulated during the routine rather than being calculated directly as
*Start + N * *Step.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] += *Start * I0[i*IS];
// O1[i*OS] += *Start * I1[i*IS];
// *Start += *Step;
//
Input:
const float *I0, const float *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
float *Start.
Starting value for the ramp.
const float *Step.
Value of the step for the ramp.
float *O0, float *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmuladd2(
const float *__vDSP_I0, const float *__vDSP_I1, vDSP_Stride __vDSP_IS,
float *__vDSP_Start,
const float *__vDSP_Step,
float *__vDSP_O0, float *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmul_s1_15, vector integer 1.15 format vramp and multiply.
This routine puts into O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp
in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] = *Start * I[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *I, vDSP_Stride IS.
Starting address and stride for the input vector.
short int *Start.
Starting value for the ramp.
const short int *Step.
Value of the step for the ramp.
short int *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmul_s1_15(
const short int *__vDSP_I, vDSP_Stride __vDSP_IS,
short int *__vDSP_Start,
const short int *__vDSP_Step,
short int *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmuladd_s1_15, vector integer 1.15 format vramp, multiply and add.
This routine adds to O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp in a
consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] += *Start * I[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *I, vDSP_Stride IS.
Starting address and stride for the input vector.
short int *Start.
Starting value for the ramp.
const short int *Step.
Value of the step for the ramp.
short int *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are added to O.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmuladd_s1_15(
const short int *__vDSP_I, vDSP_Stride __vDSP_IS,
short int *__vDSP_Start,
const short int *__vDSP_Step,
short int *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmul2_s1_15, stereo vector integer 1.15 format vramp and multiply.
This routine:
Puts into O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Puts into O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] = *Start * I0[i*IS];
// O1[i*OS] = *Start * I1[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *I0, const short int *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
short int *Start.
Starting value for the ramp.
const short int *Step.
Value of the step for the ramp.
short int *O0, short int *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmul2_s1_15(
const short int *__vDSP_I0, const short int *__vDSP_I1, vDSP_Stride __vDSP_IS,
short int *__vDSP_Start,
const short int *__vDSP_Step,
short int *__vDSP_O0, short int *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmuladd2_s1_15, stereo vector integer 1.15 format vramp, multiply
and add.
This routine:
Adds to O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Adds to O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] += *Start * I0[i*IS];
// O1[i*OS] += *Start * I1[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with one sign bit and 15
fraction bits. Where the value of the short int is normally x, it is
x/32768 for the purposes of this routine.
Input:
const short int *I0, const short int *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
short int *Start.
Starting value for the ramp.
const short int *Step.
Value of the step for the ramp.
short int *O0, short int *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are added to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmuladd2_s1_15(
const short int *__vDSP_I0, const short int *__vDSP_I1, vDSP_Stride __vDSP_IS,
short int *__vDSP_Start,
const short int *__vDSP_Step,
short int *__vDSP_O0, short int *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
/* vDSP_vrampmul_s8_24, vector integer 8.24 format vramp and multiply.
This routine puts into O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp
in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] = *Start * I[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *I, vDSP_Stride IS.
Starting address and stride for the input vector.
int *Start.
Starting value for the ramp.
const int *Step.
Value of the step for the ramp.
int *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O.
On return, *Start contains initial *Start + N * *Step.
*/
void vDSP_vrampmul_s8_24(
const int *__vDSP_I, vDSP_Stride __vDSP_IS,
int *__vDSP_Start,
const int *__vDSP_Step,
int *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ vDSP_vrampmuladd_s8_24, vector integer 8.24 format vramp, multiply and add.
This routine adds to O the product of I and a ramp function with initial
value *Start and slope *Step. *Start is updated to continue the ramp in a
consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O[i*OS] += *Start * I[i*IS];
// *Start += *Step;
// }
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *I, vDSP_Stride IS.
Starting address and stride for the input vector.
int *Start.
Starting value for the ramp.
const int *Step.
Value of the step for the ramp.
int *O, vDSP_Stride *OS.
Starting address and stride for the output vector.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are added to O.
On return, *Start contains initial *Start + N * *Step.
}
void vDSP_vrampmuladd_s8_24(
const int *__vDSP_I, vDSP_Stride __vDSP_IS,
int *__vDSP_Start,
const int *__vDSP_Step,
int *__vDSP_O, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ vDSP_vrampmul2_s8_24, stereo vector integer 8.24 format vramp and multiply.
This routine:
Puts into O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Puts into O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] = *Start * I0[i*IS];
// O1[i*OS] = *Start * I1[i*IS];
// *Start += *Step;
// }
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *I0, const int *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
int *Start.
Starting value for the ramp.
const int *Step.
Value of the step for the ramp.
int *O0, int *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
}
void vDSP_vrampmul2_s8_24(
const int *__vDSP_I0, const int *__vDSP_I1, vDSP_Stride __vDSP_IS,
int *__vDSP_Start,
const int *__vDSP_Step,
int *__vDSP_O0, int *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
{ vDSP_vrampmuladd2_s8_24, stereo vector integer 8.24 format vramp, multiply
and add.
This routine:
Adds to O0 the product of I0 and a ramp function with initial value
*Start and slope *Step.
Adds to O1 the product of I1 and a ramp function with initial value
*Start and slope *Step.
*Start is updated to continue the ramp in a consecutive call.
This routine calculates:
// for (i = 0; i < N; ++i)
// {
// O0[i*OS] += *Start * I0[i*IS];
// O1[i*OS] += *Start * I1[i*IS];
// *Start += *Step;
//
The elements are fixed-point numbers, each with eight integer bits
(including sign) and 24 fraction bits. Where the value of the int is
normally x, it is x/16777216 for the purposes of this routine.
Input:
const int *I0, const int *I1, vDSP_Stride IS.
Starting addresses of both inputs and stride for the input vectors.
int *Start.
Starting value for the ramp.
const int *Step.
Value of the step for the ramp.
int *O0, int *O1, vDSP_Stride *OS.
Starting addresses of both outputs and stride for the output vectors.
vDSP_Length Length.
Number of elements in each vector.
Output:
The results are written to O0 and O1.
On return, *Start contains initial *Start + N * *Step.
}
void vDSP_vrampmuladd2_s8_24(
const int *__vDSP_I0, const int *__vDSP_I1, vDSP_Stride __vDSP_IS,
int *__vDSP_Start,
const int *__vDSP_Step,
int *__vDSP_O0, int *__vDSP_O1, vDSP_Stride __vDSP_OS,
vDSP_Length __vDSP_N)
__OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_4_0);
//#ifndef USE_NON_APPLE_STANDARD_DATATYPES
//#define USE_NON_APPLE_STANDARD_DATATYPES 1
//#endif /* !defined(USE_NON_APPLE_STANDARD_DATATYPES) */
//
//#if USE_NON_APPLE_STANDARD_DATATYPES
//enum {
// FFT_FORWARD = kFFTDirection_Forward,
// FFT_INVERSE = kFFTDirection_Inverse
// ;
//
//enum {
// FFT_RADIX2 = kFFTRadix2,
// FFT_RADIX3 = kFFTRadix3,
// FFT_RADIX5 = kFFTRadix5
// ;
//
//typedef DSPComplex COMPLEX;
//typedef DSPSplitComplex COMPLEX_SPLIT;
//typedef DSPDoubleComplex DOUBLE_COMPLEX;
//typedef DSPDoubleSplitComplex DOUBLE_COMPLEX_SPLIT;
//#endif /* USE_NON_APPLE_STANDARD_DATATYPES */
}
*)
implementation
end. |
unit caXml;
{$INCLUDE ca.inc}
interface
uses
// Standard Delphi units
Windows,
SysUtils,
Classes,
Graphics,
// ca units
caTypes,
caConsts,
caClasses,
caVector,
caLog,
caUtils;
type
IcaXmlBuilder = interface;
TcaXmlWriteEvent = procedure(Sender: TObject; AXmlBuilder: IcaXmlBuilder) of object;
TcaXmlReaderEndTagEvent = procedure(Sender: TObject; const ATag: string; ALevel: Integer) of object;
TcaXmlReaderDataEvent = procedure(Sender: TObject; const ATag, AData, AAttributes: string; ALevel: Integer) of object;
TcaXmlReaderTagEvent = procedure(Sender: TObject; const ATag, AAttributes: string; ALevel: Integer) of object;
TcaXmlAttributeEvent = procedure(Sender: TObject; const AName, AValue: string) of object;
//---------------------------------------------------------------------------
// IcaXmlStreamable
//---------------------------------------------------------------------------
IcaXmlStreamable = interface
['{57A2E187-82DE-4A31-94E6-BADE71BB2C73}']
// Property methods
function GetOnWriteToXml: TcaXmlWriteEvent;
function GetXmlBuilder: IcaXmlBuilder;
procedure SetOnWriteToXml(const Value: TcaXmlWriteEvent);
procedure SetXmlBuilder(const Value: IcaXmlBuilder);
// Public methods
procedure WriteToXml;
// Properties
property XmlBuilder: IcaXmlBuilder read GetXmlBuilder write SetXmlBuilder;
// Event Properties
property OnWriteToXml: TcaXmlWriteEvent read GetOnWriteToXml write SetOnWriteToXml;
end;
//---------------------------------------------------------------------------
// TcaXmlStreamable
//---------------------------------------------------------------------------
TcaXmlStreamable = class(TcaInterfacedPersistent, IcaXmlStreamable)
private
// Private fields
FXmlBuilder: IcaXmlBuilder;
// Property fields
FOnWriteToXml: TcaXmlWriteEvent;
protected
// Protected property methods
function GetOnWriteToXml: TcaXmlWriteEvent;
function GetXmlBuilder: IcaXmlBuilder;
procedure SetOnWriteToXml(const Value: TcaXmlWriteEvent);
procedure SetXmlBuilder(const Value: IcaXmlBuilder);
// Protected methods
procedure DoWriteToXml(AXmlBuilder: IcaXmlBuilder); virtual;
public
constructor Create;
// Public methods
procedure WriteToXml;
// Properties
property XmlBuilder: IcaXmlBuilder read GetXmlBuilder write SetXmlBuilder;
// Event Properties
property OnWriteToXml: TcaXmlWriteEvent read GetOnWriteToXml write SetOnWriteToXml;
end;
//---------------------------------------------------------------------------
// IcaXmlAttributes
//---------------------------------------------------------------------------
IcaXmlAttributes = interface
['{35DF1CBA-5968-4494-BE62-ABEBF7EC9CDD}']
// Protected interface property methods
function GetCommaText: string;
function GetValue(const Name: string): string;
procedure SetCommaText(const Value: string);
procedure SetValue(const Name, Value: string);
// interface methods...
procedure Clear;
// interface properties...
property CommaText: string read GetCommaText write SetCommaText;
property Values[const Name: string]: string read GetValue write SetValue; default;
end;
//---------------------------------------------------------------------------
// TcaXmlAttributes
//---------------------------------------------------------------------------
TcaXmlAttributes = class(TcaStringList, IcaXmlAttributes)
private
// Private methods
procedure UpdateAttributes(const AAttributes: string);
protected
// Protected interface property methods
function GetValue(const Name: string): string;
public
constructor Create; overload;
constructor Create(const AAttributes: string); overload;
// Public properties
property Values[const Name: string]: string read GetValue; default;
end;
//---------------------------------------------------------------------------
// IcaXmlBuilder
//---------------------------------------------------------------------------
IcaXmlBuilder = interface
['{3E12C174-6A53-454F-8F84-EA1AFB895224}']
// Property methods
function GetAsText: string;
function GetIndentSpaces: Integer;
procedure SetAsText(const Value: string);
procedure SetIndentSpaces(const Value: Integer);
// Public base methods
function MakeAttribute(const AName: string; const AValue: Boolean): string; overload;
function MakeAttribute(const AName: string; const AValue: Double): string; overload;
function MakeAttribute(const AName: string; const AValue: Integer): string; overload;
function MakeAttribute(const AName: string; const AValue: string): string; overload;
procedure Add(const AElement: string; ALevel: Integer = -1);
procedure AddTag(const AElement: string; ALevel: Integer = -1); overload;
procedure AddTag(const AElement: string; AAttributes: string; ALevel: Integer = -1); overload;
procedure AddTagWithEnd(const AElement: string; ALevel: Integer = -1); overload;
procedure AddTagWithEnd(const AElement: string; AAttributes: string; ALevel: Integer = -1); overload;
procedure AddText(const AText: string);
procedure EmptyTag(const AElement: string; ALevel: Integer = -1);
procedure EndTag(const AElement: string = ''; ALevel: Integer = -1);
procedure SaveXmlToFile(const AFileName: string);
procedure SaveXmlToStream(const AStream: TStream);
// Public utilty methods derived from base methods
procedure WriteValue(const AName: string; AValue: Boolean; ALevel: Integer = -1); overload;
procedure WriteValue(const AName: string; AValue: Double; ALevel: Integer = -1); overload;
procedure WriteValue(const AName: string; AValue: Integer; ALevel: Integer = -1); overload;
procedure WriteValue(const AName, AValue: string; ALevel: Integer = -1); overload;
// Properties
property AsText: string read GetAsText write SetAsText;
property IndentSpaces: Integer read GetIndentSpaces write SetIndentSpaces;
end;
//---------------------------------------------------------------------------
// TcaXmlBuilder
//---------------------------------------------------------------------------
TcaXmlBuilder = class(TcaStringList, IcaXmlBuilder)
private
// Private fields
FIndentSpaces: Integer;
FLevel: Integer;
FTagStack: IcaStringStack;
// Property methods
function GetAsText: string;
function GetIndentSpaces: Integer;
procedure SetAsText(const Value: string);
procedure SetIndentSpaces(const Value: Integer);
// Private methods
function BuildTag(const AElement: string; ALevel: Integer; ATagType: TcaXmlTagType): string;
function GetLevel(ALevel: Integer): Integer;
function StripDecoration(const AText: string): string;
public
constructor Create; overload;
constructor CreateUtf8; overload;
// Public methods
function MakeAttribute(const AName: string; const AValue: Boolean): string; overload;
function MakeAttribute(const AName: string; const AValue: Double): string; overload;
function MakeAttribute(const AName: string; const AValue: Integer): string; overload;
function MakeAttribute(const AName: string; const AValue: string): string; overload;
procedure Add(const AElement: string; ALevel: Integer = -1); reintroduce;
procedure AddTag(const AElement: string; ALevel: Integer = -1); overload;
procedure AddTag(const AElement: string; AAttributes: string; ALevel: Integer = -1); overload;
procedure AddTagWithEnd(const AElement: string; ALevel: Integer = -1); overload;
procedure AddTagWithEnd(const AElement: string; AAttributes: string; ALevel: Integer = -1); overload;
procedure AddText(const AText: string);
procedure EmptyTag(const AElement: string; ALevel: Integer = -1);
procedure EndTag(const AElement: string = ''; ALevel: Integer = -1);
procedure SaveXmlToFile(const AFileName: string);
procedure SaveXmlToStream(const AStream: TStream);
// Public utilty methods derived from base methods
procedure WriteValue(const AName: string; AValue: Boolean; ALevel: Integer = -1); overload;
procedure WriteValue(const AName: string; AValue: Double; ALevel: Integer = -1); overload;
procedure WriteValue(const AName: string; AValue: Integer; ALevel: Integer = -1); overload;
procedure WriteValue(const AName, AValue: string; ALevel: Integer = -1); overload;
// Properties
property AsText: string read GetAsText write SetAsText;
property IndentSpaces: Integer read GetIndentSpaces write SetIndentSpaces;
end;
//---------------------------------------------------------------------------
// IcaXmlReader
//---------------------------------------------------------------------------
IcaXmlReader = interface
['{0F128E01-95A2-4B2A-8D2E-94F3602EA28D}']
// Property methods
function GetAsText: string;
function GetDocumentName: string;
function GetOnData: TcaXmlReaderDataEvent;
function GetOnEndTag: TcaXmlReaderEndTagEvent;
function GetOnTag: TcaXmlReaderTagEvent;
procedure SetAsText(const Value: string);
procedure SetOnData(const Value: TcaXmlReaderDataEvent);
procedure SetOnEndTag(const Value: TcaXmlReaderEndTagEvent);
procedure SetOnTag(const Value: TcaXmlReaderTagEvent);
// Public methods
procedure LoadFromStream(Stream: TStream);
procedure LoadFromXml(const AFileName: string);
procedure Parse;
// Properties
property AsText: string read GetAsText write SetAsText;
property DocumentName: string read GetDocumentName;
// Event properties
property OnData: TcaXmlReaderDataEvent read GetOnData write SetOnData;
property OnEndTag: TcaXmlReaderEndTagEvent read GetOnEndTag write SetOnEndTag;
property OnTag: TcaXmlReaderTagEvent read GetOnTag write SetOnTag;
end;
//---------------------------------------------------------------------------
// TcaXmlReader
//---------------------------------------------------------------------------
TcaXmlReader = class(TcaInterfacedPersistent, IcaXmlReader)
private
// Private fields
FXml: IcaStringList;
FXmlTokens: IcaStringList;
// Property fields
FOnData: TcaXmlReaderDataEvent;
FOnEndTag: TcaXmlReaderEndTagEvent;
FOnTag: TcaXmlReaderTagEvent;
// Property methods
function GetDocumentName: string;
function GetOnData: TcaXmlReaderDataEvent;
function GetOnEndTag: TcaXmlReaderEndTagEvent;
function GetOnTag: TcaXmlReaderTagEvent;
procedure SetOnData(const Value: TcaXmlReaderDataEvent);
procedure SetOnEndTag(const Value: TcaXmlReaderEndTagEvent);
procedure SetOnTag(const Value: TcaXmlReaderTagEvent);
// Private methods
function IsEndTag(const AToken: IcaString): Boolean;
function IsTag(const AToken: IcaString): Boolean;
function MakeString(const AString: string): IcaString;
function StripToken(const AToken: IcaString): string;
procedure UpdateXmlTokens;
protected
// Protected methods
procedure DoData(const ATag, AData, AAttributes: string; ALevel: Integer); virtual;
procedure DoEndTag(const ATag: string; ALevel: Integer); virtual;
procedure DoTag(const ATag, AAttributes: string; ALevel: Integer); virtual;
public
constructor Create;
// Public methods
procedure LoadFromStream(Stream: TStream);
procedure LoadFromXml(const AFileName: string);
procedure Parse;
// Properties
property AsText: string read GetAsText write SetAsText;
property DocumentName: string read GetDocumentName;
// Event properties
property OnTag: TcaXmlReaderTagEvent read GetOnTag write SetOnTag;
property OnEndTag: TcaXmlReaderEndTagEvent read GetOnEndTag write SetOnEndTag;
property OnData: TcaXmlReaderDataEvent read GetOnData write SetOnData;
end;
implementation
//---------------------------------------------------------------------------
// TcaXmlStreamable
//---------------------------------------------------------------------------
constructor TcaXmlStreamable.Create;
begin
inherited;
FXmlBuilder := TcaXmlBuilder.Create;
end;
// Public methods
procedure TcaXmlStreamable.WriteToXml;
begin
DoWriteToXml(FXmlBuilder);
end;
// Protected methods
procedure TcaXmlStreamable.DoWriteToXml(AXmlBuilder: IcaXmlBuilder);
begin
if Assigned(FOnWriteToXml) then
FOnWriteToXml(Self, AXmlBuilder);
end;
// Property methods
function TcaXmlStreamable.GetOnWriteToXml: TcaXmlWriteEvent;
begin
Result := FOnWriteToXml;
end;
function TcaXmlStreamable.GetXmlBuilder: IcaXmlBuilder;
begin
Result := FXmlBuilder;
end;
procedure TcaXmlStreamable.SetOnWriteToXml(const Value: TcaXmlWriteEvent);
begin
FOnWriteToXml := Value;
end;
procedure TcaXmlStreamable.SetXmlBuilder(const Value: IcaXmlBuilder);
begin
FXmlBuilder := nil;
FXmlBuilder := Value;
end;
//---------------------------------------------------------------------------
// TcaXmlAttributes
//---------------------------------------------------------------------------
constructor TcaXmlAttributes.Create;
begin
inherited;
end;
constructor TcaXmlAttributes.Create(const AAttributes: string);
begin
inherited Create;
UpdateAttributes(AAttributes);
end;
// Protected interface property methods
function TcaXmlAttributes.GetValue(const Name: string): string;
begin
Result := inherited Values[Name];
end;
// Private methods
procedure TcaXmlAttributes.UpdateAttributes(const AAttributes: string);
var
Attribute: string;
AttrStart: Integer;
Ch: Char;
Index: Integer;
InQuotes: Boolean;
begin
AttrStart := 1;
InQuotes := False;
for Index := 1 to Length(AAttributes) do
begin
if Index > AttrStart then
begin
Ch := AAttributes[Index];
if Ch = cDoubleQuote then
begin
InQuotes := not InQuotes;
if not InQuotes then
begin
Attribute := Copy(AAttributes, AttrStart, Index - AttrStart + 1);
Utils.StripChar(cDoubleQuote, Attribute);
Add(Attribute);
AttrStart := Index + 2;
end;
end;
end;
end;
end;
//---------------------------------------------------------------------------
// TcaXmlBuilder
//---------------------------------------------------------------------------
constructor TcaXmlBuilder.Create;
begin
inherited;
FTagStack := TcaStringList.Create;
FIndentSpaces := 2;
end;
constructor TcaXmlBuilder.CreateUtf8;
begin
Create;
inherited Add('<?xml version="1.0" encoding="utf-8"?>');
end;
// Public methods
function TcaXmlBuilder.MakeAttribute(const AName: string; const AValue: Boolean): string;
begin
Result := Format('%s="%s"', [AName, Utils.BooleanToString(AValue)]);
end;
function TcaXmlBuilder.MakeAttribute(const AName: string; const AValue: Double): string;
begin
Result := Format('%s="%s"', [AName, FloatToStr(AValue)]);
end;
function TcaXmlBuilder.MakeAttribute(const AName: string; const AValue: Integer): string;
begin
Result := Format('%s="%s"', [AName, IntToStr(AValue)]);
end;
function TcaXmlBuilder.MakeAttribute(const AName: string; const AValue: string): string;
begin
Result := Format('%s="%s"', [AName, AValue]);
end;
procedure TcaXmlBuilder.Add(const AElement: string; ALevel: Integer = -1);
begin
inherited Add(BuildTag(AElement, GetLevel(ALevel), ttText));
end;
procedure TcaXmlBuilder.AddTag(const AElement: string; ALevel: Integer = -1);
begin
inherited Add(BuildTag(AElement, GetLevel(ALevel), ttStart));
Inc(FLevel);
FTagStack.Push(AElement);
end;
procedure TcaXmlBuilder.AddTag(const AElement: string; AAttributes: string; ALevel: Integer = -1);
var
Attributes: string;
AttributesList: IcaStringList;
ElementAndAttributes: string;
Index: Integer;
begin
AttributesList := TcaStringList.Create;
AttributesList.CommaText := AAttributes;
Attributes := '';
for Index := 0 to AttributesList.Count - 1 do
Attributes := Attributes + ' ' + AttributesList[Index];
Utils.ReplaceChar(Attributes, #32, '~');
ElementAndAttributes := AElement + Attributes;
AddTag(ElementAndAttributes, ALevel);
FTagStack.Pop;
FTagStack.Push(AElement);
end;
procedure TcaXmlBuilder.AddTagWithEnd(const AElement: string; ALevel: Integer);
var
XmlText: string;
begin
AddTag(AElement, ALevel);
XmlText := GetAsText;
System.Delete(XmlText, Length(XmlText) - 1, 2);
System.Insert('/', XmlText, Length(XmlText));
SetAsText(XmlText);
Dec(FLevel);
FTagStack.Pop;
end;
procedure TcaXmlBuilder.AddTagWithEnd(const AElement: string; AAttributes: string; ALevel: Integer);
var
XmlText: string;
begin
AddTag(AElement, AAttributes, ALevel);
XmlText := GetAsText;
System.Delete(XmlText, Length(XmlText) - 1, 2);
System.Insert('/', XmlText, Length(XmlText));
SetAsText(XmlText);
Dec(FLevel);
FTagStack.Pop;
end;
procedure TcaXmlBuilder.AddText(const AText: string);
var
XmlText: string;
begin
XmlText := GetAsText;
if Length(XmlText) > 2 then
if (XmlText[Length(XmlText) - 1] = #13) and (XmlText[Length(XmlText)] = #10) then
System.Delete(XmlText, Length(XmlText) - 1, 2);
XmlText := XmlText + AText;
SetAsText(XmlText);
end;
procedure TcaXmlBuilder.EndTag(const AElement: string = ''; ALevel: Integer = -1);
var
Element: string;
LastTag: string;
XmlText: string;
AddToText: Boolean;
LastLine: string;
ChevPos: Integer;
begin
AddToText := False;
LastTag := FTagStack.Pop;
XmlText := GetAsText;
if Length(XmlText) > 2 then
if (XmlText[Length(XmlText) - 1] = #13) and (XmlText[Length(XmlText)] = #10) then
begin
System.Delete(XmlText, Length(XmlText) - 1, 2);
AddToText := XmlText[Length(XmlText)] <> '>';
end;
Dec(FLevel);
if AElement <> '' then
Element := AElement
else
Element := LastTag;
if AddToText then
begin
XmlText := XmlText + Trim(BuildTag(Element, GetLevel(ALevel), ttEnd));
SetAsText(XmlText);
end
else
inherited Add(BuildTag(Element, GetLevel(ALevel), ttEnd));
if Self.Count >= 2 then
begin
if StripDecoration(Self[Count - 2]) = StripDecoration(Self[Count - 1]) then
begin
Delete(Self.Count - 1);
LastLine := Self[Count - 1];
ChevPos := Pos('>', LastLine);
System.Insert(' /', LastLine, ChevPos);
Self[Count - 1] := LastLine;
end;
end;
end;
function TcaXmlBuilder.StripDecoration(const AText: string): string;
begin
Result := StringReplace(AText, '<', '', [rfReplaceAll]);
Result := StringReplace(Result, '>', '', [rfReplaceAll]);
Result := StringReplace(Result, '/', '', [rfReplaceAll]);
end;
procedure TcaXmlBuilder.EmptyTag(const AElement: string; ALevel: Integer = -1);
begin
inherited Add(BuildTag(AElement, GetLevel(ALevel) + 1, ttEmpty));
end;
procedure TcaXmlBuilder.SetIndentSpaces(const Value: Integer);
begin
FIndentSpaces := Value;
end;
procedure TcaXmlBuilder.SaveXmlToFile(const AFileName: string);
begin
SaveToFile(AFileName);
end;
procedure TcaXmlBuilder.SaveXmlToStream(const AStream: TStream);
begin
SaveToStream(AStream);
end;
// Public utilty methods derived from base methods
procedure TcaXmlBuilder.WriteValue(const AName: string; AValue: Boolean; ALevel: Integer = -1);
begin
WriteValue(AName, Utils.BooleanToString(AValue), ALevel);
end;
procedure TcaXmlBuilder.WriteValue(const AName: string; AValue: Double; ALevel: Integer = -1);
begin
WriteValue(AName, Utils.DoubleToString(AValue, ''), ALevel);
end;
procedure TcaXmlBuilder.WriteValue(const AName: string; AValue: Integer; ALevel: Integer = -1);
begin
WriteValue(AName, Utils.IntegerToString(AValue, ''), ALevel);
end;
procedure TcaXmlBuilder.WriteValue(const AName, AValue: string; ALevel: Integer = -1);
begin
AddTag(AName, GetLevel(ALevel));
Add(AValue, GetLevel(ALevel));
EndTag;
end;
// Private methods
function TcaXmlBuilder.BuildTag(const AElement: string; ALevel: Integer; ATagType: TcaXmlTagType): string;
var
T1, T2, T3: string;
TagElement: string;
begin
TagElement := AElement;
Utils.ReplaceChar(TagElement, ' ', '_');
Utils.ReplaceChar(TagElement, '~', ' ');
T1 := '';
T2 := '';
T3 := '';
case ATagType of
ttStart:
begin
T1 := TagElement;
end;
ttEnd:
begin
T1 := '/';
T2 := TagElement;
end;
ttEmpty:
begin
T1 := TagElement;
T2 := ' ';
T3 := '/';
end;
ttText:;
end;
if ATagType = ttText then
Result := Utils.Indent(AElement, ALevel * FIndentSpaces)
else
Result := Utils.Indent(Format('<%s%s%s>', [T1, T2, T3]), ALevel * FIndentSpaces);
end;
function TcaXmlBuilder.GetIndentSpaces: Integer;
begin
Result := FIndentSpaces;
end;
function TcaXmlBuilder.GetLevel(ALevel: Integer): Integer;
begin
if ALevel >= 0 then
Result := ALevel
else
Result := FLevel;
end;
function TcaXmlBuilder.GetAsText: string;
begin
Result := Text;
end;
procedure TcaXmlBuilder.SetAsText(const Value: string);
begin
Text := Value;
end;
//---------------------------------------------------------------------------
// TcaXmlReader
//---------------------------------------------------------------------------
constructor TcaXmlReader.Create;
begin
inherited;
FXml := TcaStringList.Create;
FXmlTokens := TcaStringList.Create;
end;
// Public methods
procedure TcaXmlReader.LoadFromStream(Stream: TStream);
begin
FXml.LoadFromStream(Stream);
end;
procedure TcaXmlReader.LoadFromXml(const AFileName: string);
begin
FXml.LoadFromFile(AFileName);
end;
procedure TcaXmlReader.Parse;
var
Attributes: string;
ExpectingData: Boolean;
Index: Integer;
LastAttributes: string;
LastLevel: Integer;
LastTag: string;
Level: Integer;
SpacePos: Integer;
StrippedToken: IcaString;
Tag: string;
Token: IcaString;
begin
UpdateXmlTokens;
Level := 0;
LastTag := '';
LastLevel := 0;
LastAttributes := '';
ExpectingData := False;
for Index := 0 to FXmlTokens.Count - 1 do
begin
Token := MakeString(FXmlTokens[Index]);
if IsTag(Token) then
begin
if IsEndTag(Token) then
begin
if ExpectingData then
begin
DoData(LastTag, '', LastAttributes, LastLevel);
ExpectingData := False;
end;
Dec(Level);
DoEndTag(StripToken(Token), Level);
end
else
begin
StrippedToken := TcaString.Create(StripToken(Token));
Attributes := '';
SpacePos := StrippedToken.PosFromStart(' ');
if SpacePos > 0 then
begin
Attributes := StrippedToken.S;
Utils.DeleteUntilChar(Attributes, ' ', True);
Tag := StrippedToken.Left(SpacePos - 1)
end
else
Tag := StrippedToken.S;
LastTag := Tag;
LastLevel := Level;
LastAttributes := Attributes;
DoTag(Tag, Attributes, Level);
Inc(Level);
ExpectingData := True;
end;
end
else
begin
DoData(LastTag, StripToken(Token), LastAttributes, LastLevel);
ExpectingData := False;
end;
end;
end;
// Protected methods
procedure TcaXmlReader.DoData(const ATag, AData, AAttributes: string; ALevel: Integer);
begin
if Assigned(FOnData) then FOnData(Self, ATag, AData, AAttributes, ALevel);
end;
procedure TcaXmlReader.DoEndTag(const ATag: string; ALevel: Integer);
begin
if Assigned(FOnEndTag) then FOnEndTag(Self, ATag, ALevel);
end;
procedure TcaXmlReader.DoTag(const ATag, AAttributes: string; ALevel: Integer);
begin
if Assigned(FOnTag) then FOnTag(Self, ATag, AAttributes, ALevel);
end;
// Private methods
function TcaXmlReader.IsEndTag(const AToken: IcaString): Boolean;
begin
Result := (AToken.Left(2) = '</');
end;
function TcaXmlReader.IsTag(const AToken: IcaString): Boolean;
begin
Result := AToken.Left(1) = '<';
end;
function TcaXmlReader.MakeString(const AString: string): IcaString;
begin
Result := TcaString.Create(AString);
end;
function TcaXmlReader.StripToken(const AToken: IcaString): string;
begin
if IsTag(AToken) then
begin
if IsEndTag(AToken) then
AToken.DeleteFromStart(2)
else
AToken.DeleteFromStart(1);
end;
Result := Trim(AToken.S);
end;
procedure TcaXmlReader.UpdateXmlTokens;
var
Parser: IcaParser;
Xml: string;
begin
FXmlTokens.Clear;
Parser := Utils as IcaParser;
Parser.Initialize;
Parser.TokenDelimiters := '>';
Xml := FXml.Text;
Utils.Replace(Xml, '</', '></');
Parser.StringToParse := Xml;
Parser.IgnoreBlanks := True;
while Parser.HasMoreTokens do
FXmlTokens.Add(Parser.NextToken);
end;
// Property methods
function TcaXmlReader.GetDocumentName: string;
begin
Result := '';
UpdateXmlTokens;
if FXmlTokens.Count > 0 then
Result := StripToken(MakeString(FXmlTokens[0]));
end;
function TcaXmlReader.GetOnData: TcaXmlReaderDataEvent;
begin
Result := FOnData;
end;
function TcaXmlReader.GetOnEndTag: TcaXmlReaderEndTagEvent;
begin
Result := FOnEndTag;
end;
function TcaXmlReader.GetOnTag: TcaXmlReaderTagEvent;
begin
Result := FOnTag;
end;
procedure TcaXmlReader.SetOnData(const Value: TcaXmlReaderDataEvent);
begin
FOnData := Value;
end;
procedure TcaXmlReader.SetOnEndTag(const Value: TcaXmlReaderEndTagEvent);
begin
FOnEndTag := Value;
end;
procedure TcaXmlReader.SetOnTag(const Value: TcaXmlReaderTagEvent);
begin
FOnTag := Value;
end;
end.
|
unit IdIrcServer;
interface
uses
Classes,
IdTCPServer;
const
KnownCommands: array[1..40] of string =
(
'ADMIN',
'AWAY',
'CONNECT',
'ERROR',
'INFO',
'INVITE',
'ISON',
'JOIN',
'KICK',
'KILL',
'LINKS',
'LIST',
'MODE',
'NAMES',
'NICK',
'NOTICE',
'OPER',
'PART',
'PASS',
'PING',
'PONG',
'PRIVMSG',
'QUIT',
'REHASH',
'RESTART',
'SERVER',
'SQUIT',
'STATS',
'SUMMON',
'TIME',
'TOPIC',
'TRACE',
'USER',
'USERHOST',
'USERS',
'VERSION',
'WALLOPS',
'WHO',
'WHOIS',
'WHOWAS'
);
type
TIdIrcGetEvent = procedure(Thread: TIdPeerThread) of object;
TIdIrcOtherEvent = procedure(Thread: TIdPeerThread; Command, Parm: string) of
object;
TIdIrcOneParmEvent = procedure(Thread: TIdPeerThread; Parm: string) of object;
TIdIrcTwoParmEvent = procedure(Thread: TIdPeerThread; Parm1, Parm2: string) of
object;
TIdIrcThreeParmEvent = procedure(Thread: TIdPeerThread; Parm1, Parm2, Parm3:
string) of object;
TIdIrcFiveParmEvent = procedure(Thread: TIdPeerThread; Parm1, Parm2, Parm3,
Parm4, Parm5: string) of object;
TIdIrcUserEvent = procedure(Thread: TIdPeerThread; UserName, HostName,
ServerName, RealName: string) of object;
TIdIrcServerEvent = procedure(Thread: TIdPeerThread; ServerName, Hopcount,
Info: string) of object;
TIdIRCServer = class(TIdTCPServer)
protected
fOnCommandOther: TIdIrcOtherEvent;
fOnCommandPass: TIdIrcOneParmEvent;
fOnCommandNick: TIdIrcTwoParmEvent;
fOnCommandUser: TIdIrcUserEvent;
fOnCommandServer: TIdIrcServerEvent;
fOnCommandOper: TIdIrcTwoParmEvent;
fOnCommandQuit: TIdIrcOneParmEvent;
fOnCommandSQuit: TIdIrcTwoParmEvent;
fOnCommandJoin: TIdIrcTwoParmEvent;
fOnCommandPart: TIdIrcOneParmEvent;
fOnCommandMode: TIdIrcFiveParmEvent;
fOnCommandTopic: TIdIrcTwoParmEvent;
fOnCommandNames: TIdIrcOneParmEvent;
fOnCommandList: TIdIrcTwoParmEvent;
fOnCommandInvite: TIdIrcTwoParmEvent;
fOnCommandKick: TIdIrcThreeParmEvent;
fOnCommandVersion: TIdIrcOneParmEvent;
fOnCommandStats: TIdIrcTwoParmEvent;
fOnCommandLinks: TIdIrcTwoParmEvent;
fOnCommandTime: TIdIrcOneParmEvent;
fOnCommandConnect: TIdIrcThreeParmEvent;
fOnCommandTrace: TIdIrcOneParmEvent;
fOnCommandAdmin: TIdIrcOneParmEvent;
fOnCommandInfo: TIdIrcOneParmEvent;
fOnCommandPrivMsg: TIdIrcTwoParmEvent;
fOnCommandNotice: TIdIrcTwoParmEvent;
fOnCommandWho: TIdIrcTwoParmEvent;
fOnCommandWhoIs: TIdIrcTwoParmEvent;
fOnCommandWhoWas: TIdIrcThreeParmEvent;
fOnCommandKill: TIdIrcTwoParmEvent;
fOnCommandPing: TIdIrcTwoParmEvent;
fOnCommandPong: TIdIrcTwoParmEvent;
fOnCommandError: TIdIrcOneParmEvent;
fOnCommandAway: TIdIrcOneParmEvent;
fOnCommandRehash: TIdIrcGetEvent;
fOnCommandRestart: TIdIrcGetEvent;
fOnCommandSummon: TIdIrcTwoParmEvent;
fOnCommandUsers: TIdIrcOneParmEvent;
fOnCommandWallops: TIdIrcOneParmEvent;
fOnCommandUserHost: TIdIrcOneParmEvent;
fOnCommandIsOn: TIdIrcOneParmEvent;
function DoExecute(Thread: TIdPeerThread): boolean; override;
public
constructor Create(AOwner: TComponent); override;
published
property OnCommandPass: TIdIrcOneParmEvent read fOnCommandPass write
fOnCommandPass;
property OnCommandNick: TIdIrcTwoParmEvent read fOnCommandNick write
fOnCommandNick;
property OnCommandUser: TIdIrcUserEvent read fOnCommandUser write
fOnCommandUser;
property OnCommandServer: TIdIrcServerEvent read fOnCommandServer write
fOnCommandServer;
property OnCommandOper: TIdIrcTwoParmEvent read fOnCommandOper write
fOnCommandOper;
property OnCommandQuit: TIdIrcOneParmEvent read fOnCommandQuit write
fOnCommandQuit;
property OnCommandSQuit: TIdIrcTwoParmEvent read fOnCommandSQuit write
fOnCommandSQuit;
property OnCommandJoin: TIdIrcTwoParmEvent read fOnCommandJoin write
fOnCommandJoin;
property OnCommandPart: TIdIrcOneParmEvent read fOnCommandPart write
fOnCommandPart;
property OnCommandMode: TIdIrcFiveParmEvent read fOnCommandMode write
fOnCommandMode;
property OnCommandTopic: TIdIrcTwoParmEvent read fOnCommandTopic write
fOnCommandTopic;
property OnCommandNames: TIdIrcOneParmEvent read fOnCommandNames write
fOnCommandNames;
property OnCommandList: TIdIrcTwoParmEvent read fOnCommandList write
fOnCommandList;
property OnCommandInvite: TIdIrcTwoParmEvent read fOnCommandInvite write
fOnCommandInvite;
property OnCommandKick: TIdIrcThreeParmEvent read fOnCommandKick write
fOnCommandKick;
property OnCommandVersion: TIdIrcOneParmEvent read fOnCommandVersion write
fOnCommandVersion;
property OnCommandStats: TIdIrcTwoParmEvent read fOnCommandStats write
fOnCommandStats;
property OnCommandLinks: TIdIrcTwoParmEvent read fOnCommandLinks write
fOnCommandLinks;
property OnCommandTime: TIdIrcOneParmEvent read fOnCommandTime write
fOnCommandTime;
property OnCommandConnect: TIdIrcThreeParmEvent read fOnCommandConnect write
fOnCommandConnect;
property OnCommandTrace: TIdIrcOneParmEvent read fOnCommandTrace write
fOnCommandTrace;
property OnCommandAdmin: TIdIrcOneParmEvent read fOnCommandAdmin write
fOnCommandAdmin;
property OnCommandInfo: TIdIrcOneParmEvent read fOnCommandInfo write
fOnCommandInfo;
property OnCommandPrivMsg: TIdIrcTwoParmEvent read fOnCommandPrivMsg write
fOnCommandPrivMsg;
property OnCommandNotice: TIdIrcTwoParmEvent read fOnCommandNotice write
fOnCommandNotice;
property OnCommandWho: TIdIrcTwoParmEvent read fOnCommandWho write
fOnCommandWho;
property OnCommandWhoIs: TIdIrcTwoParmEvent read fOnCommandWhoIs write
fOnCommandWhoIs;
property OnCommandWhoWas: TIdIrcThreeParmEvent read fOnCommandWhoWas write
fOnCommandWhoWas;
property OnCommandKill: TIdIrcTwoParmEvent read fOnCommandKill write
fOnCommandKill;
property OnCommandPing: TIdIrcTwoParmEvent read fOnCommandPing write
fOnCommandPing;
property OnCommandPong: TIdIrcTwoParmEvent read fOnCommandPong write
fOnCommandPong;
property OnCommandError: TIdIrcOneParmEvent read fOnCommandError write
fOnCommandError;
property OnCommandAway: TIdIrcOneParmEvent read fOnCommandAway write
fOnCommandAway;
property OnCommandRehash: TIdIrcGetEvent read fOnCommandRehash write
fOnCommandRehash;
property OnCommandRestart: TIdIrcGetEvent read fOnCommandRestart write
fOnCommandRestart;
property OnCommandSummon: TIdIrcTwoParmEvent read fOnCommandSummon write
fOnCommandSummon;
property OnCommandUsers: TIdIrcOneParmEvent read fOnCommandUsers write
fOnCommandUsers;
property OnCommandWallops: TIdIrcOneParmEvent read fOnCommandWallops write
fOnCommandWallops;
property OnCommandUserHost: TIdIrcOneParmEvent read fOnCommandUserHost write
fOnCommandUserHost;
property OnCommandIsOn: TIdIrcOneParmEvent read fOnCommandIsOn write
fOnCommandIsOn;
property OnCommandOther: TIdIrcOtherEvent read fOnCommandOther write
fOnCommandOther;
end;
implementation
uses
IdGlobal, IdResourceStrings,
SysUtils;
constructor TIdIRCServer.Create(AOwner: TComponent);
begin
inherited;
DefaultPort := IdPORT_IRC;
end;
function TIdIRCServer.DoExecute(Thread: TIdPeerThread): boolean;
var
s, sCmd, sCmd2, sCmd3, sCmd4: string;
procedure NotHandled;
begin
Thread.Connection.Writeln('421 ' + RSCMDNotRecognized);
end;
begin
result := true;
while Thread.Connection.Connected do
begin
s := Thread.Connection.ReadLn;
sCmd := Fetch(s, ' ');
case Succ(PosInStrArray(Uppercase(sCmd), KnownCommands)) of
1: {ADMIN}
if assigned(OnCommandAdmin) then
begin
OnCommandAdmin(Thread, S);
end
else
NotHandled;
2: {AWAY}
if assigned(OnCommandAway) then
begin
OnCommandAway(Thread, S);
end
else
NotHandled;
3: {CONNECT}
if assigned(OnCommandConnect) then
begin
sCmd2 := Fetch(s, ' ');
sCmd3 := Fetch(s, ' ');
OnCommandConnect(Thread, sCmd2, sCmd3, S);
end
else
NotHandled;
4: {ERROR}
if assigned(OnCommandError) then
begin
OnCommandError(Thread, S);
end
else
NotHandled;
5: {INFO}
if assigned(OnCommandInfo) then
begin
OnCommandInfo(Thread, S);
end
else
NotHandled;
6: {INVITE}
if assigned(OnCommandInvite) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandInvite(Thread, sCmd2, S);
end
else
NotHandled;
7: {ISON}
if assigned(OnCommandIsOn) then
begin
OnCommandIsOn(Thread, S);
end
else
NotHandled;
8: {JOIN}
if assigned(OnCommandJoin) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandJoin(Thread, sCmd2, S);
end
else
NotHandled;
9: {KICK}
if assigned(OnCommandKick) then
begin
sCmd2 := Fetch(s, ' ');
sCmd3 := Fetch(s, ' ');
OnCommandKick(Thread, sCmd2, sCmd3, S);
end
else
NotHandled;
10: {KILL}
if assigned(OnCommandKill) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandKill(Thread, sCmd2, S);
end
else
NotHandled;
11: {LINKS}
if assigned(OnCommandLinks) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandLinks(Thread, sCmd2, S);
end
else
NotHandled;
12: {LIST}
if assigned(OnCommandList) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandList(Thread, sCmd2, S);
end
else
NotHandled;
13: {MODE}
if assigned(OnCommandMode) then
begin
sCmd := Fetch(s, ' ');
sCmd2 := Fetch(s, ' ');
sCmd3 := Fetch(s, ' ');
sCmd4 := Fetch(s, ' ');
OnCommandMode(Thread, sCmd, sCmd2, sCmd3, sCmd4, S);
end
else
NotHandled;
14: {NAMES}
if assigned(OnCommandNames) then
begin
OnCommandNames(Thread, S);
end
else
NotHandled;
15: {NICK}
if assigned(OnCommandNick) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandNick(Thread, sCmd2, S);
end
else
NotHandled;
16: {NOTICE}
if assigned(OnCommandNotice) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandNotice(Thread, sCmd2, S);
end
else
NotHandled;
17: {OPER}
if assigned(OnCommandOper) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandOper(Thread, sCmd2, S);
end
else
NotHandled;
18: {PART}
if assigned(OnCommandPart) then
begin
OnCommandPart(Thread, S);
end
else
NotHandled;
19: {PASS}
if assigned(OnCommandPass) then
begin
OnCommandPass(Thread, S);
end
else
NotHandled;
20: {PING}
if assigned(OnCommandPing) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandPing(Thread, sCmd2, S);
end
else
NotHandled;
21: {PONG}
if assigned(OnCommandPong) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandPong(Thread, sCmd2, S);
end
else
NotHandled;
22: {PRIVMSG}
if assigned(OnCommandPrivMsg) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandPrivMsg(Thread, sCmd2, S);
end
else
NotHandled;
23: {QUIT}
if assigned(OnCommandQuit) then
begin
OnCommandQuit(Thread, s);
end
else
NotHandled;
24: {REHASH}
if assigned(OnCommandRehash) then
begin
OnCommandRehash(Thread);
end
else
NotHandled;
25: {RESTART}
if assigned(OnCommandRestart) then
begin
OnCommandRestart(Thread);
end
else
NotHandled;
26: {SERVER}
if assigned(OnCommandServer) then
begin
sCmd := Fetch(s, ' ');
sCmd2 := Fetch(s, ' ');
OnCommandServer(Thread, sCmd, sCmd2, S);
end
else
NotHandled;
27: {SQUIT}
if assigned(OnCommandSQuit) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandSQuit(Thread, sCmd2, S);
end
else
NotHandled;
28: {STAT}
if assigned(OnCommandStats) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandStats(Thread, sCmd2, S);
end
else
NotHandled;
29: {SUMMON}
if assigned(OnCommandSummon) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandSummon(Thread, sCmd2, S);
end
else
NotHandled;
30: {TIME}
if assigned(OnCommandTime) then
begin
OnCommandTime(Thread, S);
end
else
NotHandled;
31: {TOPIC}
if assigned(OnCommandTopic) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandTopic(Thread, sCmd2, S);
end
else
NotHandled;
32: {TRACE}
if assigned(OnCommandTrace) then
begin
OnCommandTrace(Thread, S);
end
else
NotHandled;
33: {USER}
if assigned(OnCommandUser) then
begin
sCmd := Fetch(s, ' ');
sCmd2 := Fetch(s, ' ');
sCmd3 := Fetch(s, ' ');
OnCommandUser(Thread, sCmd, sCmd2, sCmd3, S);
end
else
NotHandled;
34: {USERHOST}
if assigned(OnCommandUserHost) then
begin
OnCommandUserHost(Thread, S);
end
else
NotHandled;
35: {USERS}
if assigned(OnCommandUsers) then
begin
OnCommandUsers(Thread, S);
end
else
NotHandled;
36: {VERSION}
if assigned(OnCommandVersion) then
begin
OnCommandVersion(Thread, S);
end
else
NotHandled;
37: {WALLOPS}
if assigned(OnCommandWallops) then
begin
OnCommandWallops(Thread, S);
end
else
NotHandled;
38: {WHO}
if assigned(OnCommandWho) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandWho(Thread, sCmd2, S);
end
else
NotHandled;
39: {WHOIS}
if assigned(OnCommandWhoIs) then
begin
sCmd2 := Fetch(s, ' ');
OnCommandWhoIs(Thread, sCmd2, S);
end
else
NotHandled;
40: {WHOWAS}
if assigned(OnCommandWhoWas) then
begin
sCmd2 := Fetch(s, ' ');
sCmd3 := Fetch(s, ' ');
OnCommandWhoWas(Thread, sCmd2, sCmd3, S);
end
else
NotHandled;
else
begin
if assigned(OnCommandOther) then
OnCommandOther(Thread, sCmd, S);
end;
end;
end;
end;
end.
|
unit JSONToDataSet;
interface
uses
Datasnap.DBClient, System.JSON, Data.DB, System.SysUtils,
System.IOUtils, InterfaceConversor;
type
TJSONToDataSet = class(TConversor)
private
DataSet: TClientDataSet;
CaminhoDoArqv: String;
public
function Converter: string; override;
constructor Create(const Arquivo: string; ClientDataSet: TClientDataSet); override;
end;
implementation
uses
UnitConversor;
{ TJSONToDataSet }
function TJSONToDataSet.Converter: string;
var
ListaJSON: TJSONArray;
ValorJSON: TJSONValue;
ItemJSON: TJSONValue;
Field: TField;
begin
inherited;
DataSet.Close;
DataSet.Fields.Clear;
ListaJSON := nil;
try
ListaJSON := TJSONObject.ParseJSONValue(TEncoding.ASCII.GetBytes(TFile.ReadAllText(CaminhoDoArqv)), 0) as TJSONArray;
if ListaJSON.Count > 0 then
begin
ValorJSON := ListaJSON.Items[0];
for ItemJSON in TJSONArray(ValorJSON) do
begin
Field := TWideStringField.Create(DataSet);
Field.Name := '';
Field.FieldName := TJSONPair(ItemJSON).JsonString.Value;
Field.DataSet := DataSet
end;
end;
DataSet.CreateDataSet;
for ValorJSON in ListaJSON do
begin
DataSet.Insert;
for ItemJSON in TJSONArray(ValorJSON) do
begin
DataSet.FieldByName(TJSONPair(ItemJSON).JsonString.Value).Value := TJSONPair(ItemJSON).JsonValue.Value;
Form1.rchTextos.Lines.Add(Format('%s : %s', [TJSONPair(ItemJSON).JsonString.Value, TJSONPair(ItemJSON).JsonValue.Value]));
end;
DataSet.Post;
end;
finally
ListaJSON.Free;
end;
end;
constructor TJSONToDataSet.Create(const Arquivo: string; ClientDataSet: TClientDataSet);
begin
inherited;
CaminhoDoArqv := Arquivo;
DataSet := ClientDataSet;
end;
end.
|
unit udatabuilder;
{$mode objfpc}{$H+}
interface
uses
Classes, SysUtils, umsr_defines,UOther;
type
{ TMSRDataBuilder }
TMSRDataBuilder = class
private
function MakeCommand(Command: byte):TMSRCMD;
public
Constructor Create;
Destructor Destroy;override;
procedure MakeCommTest(out Arr: TByteArray);
procedure MakeCheckFirmware(out Arr: TByteArray);
procedure MakeCheckDeviceModel(out Arr: TByteArray);
procedure MakeSensorTest(out Arr: TByteArray);
procedure MakeRAMTest(out Arr: TByteArray);
procedure MakeSetHiCo(out Arr: TByteArray);
procedure MakeSetLowCo(out Arr: TByteArray);
procedure MakeReset(out Arr: TByteArray);
procedure MakeMSRWriteISO(out Arr: TByteArray);
procedure MakeMSRWriteRaw(out Arr: TByteArray);
procedure MakeRWStart(out Arr: TByteArray);
procedure MakeMSRReadISO(out Arr: TByteArray);
procedure MakeMSRReadRaw(out Arr: TByteArray);
procedure MakeErase(out Arr: TByteArray);
procedure MakeEraseAll(out Arr: TByteArray);
procedure MakeSetBPI(out Arr: TByteArray);
procedure MakeSetBPC(out Arr: TByteArray);
procedure MakeLeadingZeroes(out Arr: TByteArray);
end;
implementation
{ TMSRDataBuilder }
function TMSRDataBuilder.MakeCommand(Command: byte): TMSRCMD;
begin
Result.ESC := MSR_ESC;
Result.CMD:=Command;
end;
constructor TMSRDataBuilder.Create;
begin
inherited;
end;
destructor TMSRDataBuilder.Destroy;
begin
inherited Destroy;
end;
procedure TMSRDataBuilder.MakeCommTest(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_DIAG_COMM);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
//Result := MyArr;
end;
procedure TMSRDataBuilder.MakeCheckFirmware(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_FWREV);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeCheckDeviceModel(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_MODEL);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeSensorTest(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_DIAG_SENSOR);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeRAMTest(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_DIAG_RAM);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeSetHiCo(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_SETCO_HI);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeSetLowCo(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_SETCO_LO);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeReset(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_RESET);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeMSRWriteISO(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_WRITE);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeMSRWriteRaw(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_RAW_WRITE);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeRWStart(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_RW_START);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeMSRReadISO(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_READ);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeMSRReadRaw(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_RAW_READ);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeErase(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_ERASE);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeEraseAll(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_ERASE_ALL);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeSetBPI(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_SETBPI);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeSetBPC(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_SETBPC);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
procedure TMSRDataBuilder.MakeLeadingZeroes(out Arr: TByteArray);
var
Cmd: TMSRCmd;
begin
SetLength(Arr,SizeOf(TMSRCmd));
Cmd := MakeCommand(MSR_CMD_SLZ);
Move(Cmd,Arr[0],SizeOf(TMSRCmd));
end;
end.
|
unit fDCSummProps;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
StdCtrls, ORDtTm, ORCtrls, ExtCtrls, uConst, rTIU, rDCSumm, uDocTree, uDCSumm,
uTIU, fBase508Form, VA508AccessibilityManager, ORStaticText,
VA508AccessibilityRouter,
Vcl.ComCtrls, Math;
type
TfrmDCSummProperties = class(TfrmBase508Form)
bvlConsult: TBevel;
lblNewTitle: TLabel;
cboNewTitle: TORComboBox;
calSumm: TORDateBox;
lblDateTime: TLabel;
lblAuthor: TLabel;
cboAttending: TORComboBox;
lblCosigner: TLabel;
cmdOK: TButton;
cmdCancel: TButton;
cboAuthor: TORComboBox;
pnlTranscription: TPanel;
cboTranscriptionist: TORComboBox;
lblTranscriptionist: TLabel;
lblUrgency: TLabel;
cboUrgency: TORComboBox;
pnlAdmission: TPanel;
lblDCSumm1: TStaticText;
lblDCSumm2: TStaticText;
lstAdmissions: TCaptionListView;
procedure FormShow(Sender: TObject);
procedure cboNewTitleNeedData(Sender: TObject; const StartFrom: String;
Direction, InsertAt: Integer);
procedure cboAuthorNeedData(Sender: TObject; const StartFrom: String;
Direction, InsertAt: Integer);
procedure cboAttendingNeedData(Sender: TObject; const StartFrom: String;
Direction, InsertAt: Integer);
procedure cmdOKClick(Sender: TObject);
procedure cmdCancelClick(Sender: TObject);
procedure cboNewTitleExit(Sender: TObject);
procedure cboNewTitleMouseClick(Sender: TObject);
procedure cboNewTitleEnter(Sender: TObject);
procedure cboAttendingExit(Sender: TObject);
procedure cboAuthorExit(Sender: TObject);
procedure cboAuthorMouseClick(Sender: TObject);
procedure cboAuthorEnter(Sender: TObject);
procedure cboNewTitleDropDownClose(Sender: TObject);
procedure cboNewTitleDblClick(Sender: TObject);
procedure FormClose(Sender: TObject; var Action: TCloseAction);
procedure cboNewTitleChange(Sender: TObject);
procedure lstAdmissionsSelectItem(Sender: TObject; Item: TListItem;
Selected: Boolean);
private
FCosignIEN: Int64; // store cosigner that was passed in
FCosignName: string; // store cosigner that was passed in
FDocType: Integer; // store document type that was passed in
FAddend: Integer; // store IEN of note being addended (if make addendum)
FLastAuthor: Int64; // set by mouseclick to avoid redundant call on exit
FLastTitle: Integer; // set by mouseclick to avoid redundant call on exit
FAdmitDateTime: string;
FLocation: Integer;
FLocationName: string;
FVisitStr: string;
FEditIEN: Integer;
// FFixCursor: Boolean; // to fix the problem where the list box is an I-bar
FLastCosigner: Int64; // holds cosigner from previous note (for defaulting)
FLastCosignerName: string;
// holds cosigner from previous note (for defaulting)
FShowAdmissions: Boolean;
FIDNoteTitlesOnly: Boolean;
procedure SetCosignerRequired;
procedure ShowAdmissionList;
procedure UMDelayEvent(var Message: TMessage); message UM_DELAYEVENT;
public
{ Public declarations }
end;
function ExecuteDCSummProperties(var ASumm: TEditDCSummRec;
var ListBoxItem: string; ShowAdmissions, IDNoteTitlesOnly: Boolean): Boolean;
var
EditLines: TStringList;
implementation
{$R *.DFM}
uses
VAUtils, ORFn, uCore, rCore, uPCE, rPCE, rMisc;
{ Initial values in ASumm
Title Type Author DateTime Cosigner Location Consult NeedCPT
New DCSumm dflt 244 DUZ NOW dflt Encnt 0 ?
Edit DCSumm ien 244 ien DtTm ien ien ien fld
Addend DCSumm ien 81 DUZ NOW 0 N/A N/A? no
New Summ - setup as much as possible, then call ExecuteDCSummProperties if necessary.
}
const
TC_REQ_FIELDS = 'Required Information';
TX_REQ_TITLE = CRLF + 'A title must be selected.';
TX_REQ_AUTHOR = CRLF + 'The author of the note must be identified.';
TX_REQ_REFDATE = CRLF + 'A valid date/time for the note must be entered.';
TX_REQ_COSIGNER = CRLF + 'An attending must be identified.';
TX_NO_FUTURE = CRLF + 'A reference date/time in the future is not allowed.';
TX_COS_SELF = CRLF + 'You cannot make yourself a cosigner.';
TX_COS_AUTH = CRLF + ' is not authorized to cosign this document.';
TX_BAD_ADMISSION = CRLF + 'Admission information is missing or invalid.';
TX_NO_ADMISSION = CRLF + 'An admission must be selected';
TX_NO_MORE_SUMMS = CRLF +
'Only one discharge summary may be written for each admission.';
TC_NO_EDIT = 'Unable to Edit';
TC_EDIT_EXISTING = 'Unsigned document in progress';
// TX_EDIT_EXISTING =
// 'Would you like to continue editing the existing unsigned summary for this admission?';
TX_EDIT_EXISTING =
'Would you like to continue editing the existing unsigned summary for the %s addminsion to %s on %s?';
function ExecuteDCSummProperties(var ASumm: TEditDCSummRec;
var ListBoxItem: string; ShowAdmissions, IDNoteTitlesOnly: Boolean): Boolean;
var
frmDCSummProperties: TfrmDCSummProperties;
x: string;
begin
frmDCSummProperties := TfrmDCSummProperties.Create(Application);
EditLines := TStringList.Create;
try
ResizeAnchoredFormToFont(frmDCSummProperties);
with frmDCSummProperties do
begin
// setup common fields (title, reference date, author)
FShowAdmissions := ShowAdmissions;
FIDNoteTitlesOnly := IDNoteTitlesOnly;
pnlTranscription.Visible := False; { was never used on old form }
if not pnlTranscription.Visible then
begin
Height := Height - pnlTranscription.Height;
Top := Top - pnlTranscription.Height;
end;
if ASumm.DocType <> TYP_ADDENDUM then
begin
cboNewTitle.InitLongList('');
ListDCSummTitlesShort(cboNewTitle.Items);
end
else // if addendum
cboNewTitle.Items.Insert(0, IntToStr(ASumm.Title) + U +
ASumm.TitleName);
if ASumm.Title > 0 then
cboNewTitle.SelectByIEN(ASumm.Title);
if (ASumm.Title > 0) and (cboNewTitle.ItemIndex < 0) then
cboNewTitle.SetExactByIEN(ASumm.Title, ASumm.TitleName);
cboAuthor.InitLongList(ASumm.DictatorName);
if ASumm.Dictator > 0 then
cboAuthor.SelectByIEN(ASumm.Dictator);
LoadDCUrgencies(cboUrgency.Items);
cboUrgency.SelectByID('R');
if ASumm.Attending = 0 then
begin
ASumm.Attending := FLastCosigner;
ASumm.AttendingName := FLastCosignerName;
end;
calSumm.FMDateTime := ASumm.DictDateTime;
if FShowAdmissions then
ShowAdmissionList;
FAddend := ASumm.Addend;
FDocType := ASumm.DocType;
FLastCosigner := ASumm.LastCosigner;
FLastCosignerName := ASumm.LastCosignerName;
FEditIEN := 0;
cboAttending.InitLongList(ASumm.AttendingName);
if ASumm.Attending > 0 then
cboAttending.SelectByIEN(ASumm.Attending);
// restrict edit of title if addendum
if FDocType = TYP_ADDENDUM then
begin
lblNewTitle.Caption := 'Addendum to:';
cboNewTitle.Caption := 'Addendum to:';
cboNewTitle.Enabled := False;
cboNewTitle.Color := clBtnFace;
end;
Result := ShowModal = idOK; // display the form
if Result then
with ASumm do
begin
if FDocType <> TYP_ADDENDUM then
begin
Title := cboNewTitle.ItemIEN;
TitleName := PrintNameForTitle(Title);
end;
Urgency := cboUrgency.ItemID;
DictDateTime := calSumm.FMDateTime;
Dictator := cboAuthor.ItemIEN;
DictatorName := Piece(cboAuthor.Items[cboAuthor.ItemIndex], U, 2);
Attending := cboAttending.ItemIEN;
AttendingName :=
Piece(cboAttending.Items[cboAttending.ItemIndex], U, 2);
if Attending = Dictator then
Cosigner := 0
else
begin
Cosigner := cboAttending.ItemIEN;
CosignerName :=
Piece(cboAttending.Items[cboAttending.ItemIndex], U, 2);
// The LastCosigner fields are used to default the cosigner in subsequent notes.
// These fields are not reset with new notes & not passed into TIU.
LastCosigner := Cosigner;
LastCosignerName := CosignerName;
end;
Transcriptionist := cboTranscriptionist.ItemIEN;
if FShowAdmissions then
begin
AdmitDateTime := StrToFMDateTime(FAdmitDateTime);
DischargeDateTime := StrToFMDateTime(GetDischargeDate(Patient.DFN,
FAdmitDateTime));
if DischargeDateTime <= 0 then
DischargeDateTime := FMNow;
Location := FLocation;
LocationName := FLocationName;
VisitStr := IntToStr(Location) + ';' +
FloatToStr(AdmitDateTime) + ';H';
end;
EditIEN := FEditIEN;
if FEditIEN > 0 then
begin
x := GetTIUListItem(FEditIEN);
ListBoxItem := x;
if Lines = nil then
Lines := TStringList.Create;
FastAssign(EditLines, Lines);
end
else
begin
ListBoxItem := '';
end;
end;
// The following fields in TEditDCSummRec are not set:
// DocType, NeedCPT, Lines (unless editing an existing summary)
end;
finally
EditLines.Free;
frmDCSummProperties.Release;
end;
end;
{ Form events }
procedure TfrmDCSummProperties.FormShow(Sender: TObject);
var
srActive: Boolean;
begin
SetFormPosition(Self);
srActive := ScreenReaderActive;
lblDCSumm1.TabStop := srActive;
lblDCSumm2.TabStop := srActive;
{ stLocation.TabStop := srActive;
stDate.TabStop := srActive;
stType.TabStop := srActive;
stSummStatus.TabStop := srActive; }
// if cboNewTitle.Text = '' then PostMessage(Handle, UM_DELAYEVENT, 0, 0);
end;
procedure TfrmDCSummProperties.UMDelayEvent(var Message: TMessage);
{ let the window finish displaying before dropping list box, otherwise listbox drop
in the design position rather then new windows position (ORCtrls bug?) }
begin
(* Screen.Cursor := crArrow;
FFixCursor := TRUE;
cboNewTitle.DroppedDown := True;
lblDateTime.Visible := False;
lblAuthor.Visible := False;
lblCosigner.Visible := False; *)
end;
{ General calls }
procedure TfrmDCSummProperties.SetCosignerRequired;
{ called initially & whenever title or author changes }
begin
(* if FDocType = TYP_ADDENDUM then
begin
lblCosigner.Visible := AskCosignerForDocument(FAddend, cboAuthor.ItemIEN)
end else
begin
if cboNewTitle.ItemIEN = 0
then lblCosigner.Visible := AskCosignerForTitle(FDocType, cboAuthor.ItemIEN)
else lblCosigner.Visible := AskCosignerForTitle(cboNewTitle.ItemIEN, cboAuthor.ItemIEN);
end; *)
lblCosigner.Visible := True;
cboAttending.Visible := lblCosigner.Visible;
end;
procedure TfrmDCSummProperties.ShowAdmissionList;
var
i, Status: Integer;
TempList: TStringList;
TempString: String;
begin
TempList := TStringList.Create;
try
ListAdmitAll(TempList, Patient.DFN);
if TempList.Count > 0 then
begin
for i := 0 to TempList.Count - 1 do
begin
TempString := TempList[i];
SetPiece(TempString, '^', 8, FormatFMDateTimeStr('mmm dd,yyyy hh:nn',
Piece(TempList[i], U, 1)));
Status := StrToIntDef(Piece(TempList[i], U, 7), 0);
case Status of
0:
TempString := TempString + '^None on file';
1:
TempString := TempString + '^Completed';
2:
TempString := TempString + '^Unsigned';
end;
TempList[i] := TempString;
end;
lstAdmissions.ItemsStrings.Assign(TempList);
end
else
FAdmitDateTime := '-1^No admissions were found for this patient.';
finally
TempList.Free;
end;
end;
{ cboNewTitle events }
procedure TfrmDCSummProperties.cboNewTitleNeedData(Sender: TObject; const StartFrom: string; Direction, InsertAt: Integer);
var
aLst: TStringList;
begin
aLst := TStringList.Create;
try
SubSetOfDCSummTitles(StartFrom, Direction, FIDNoteTitlesOnly, aLst);
cboNewTitle.ForDataUse(aLst);
finally
FreeAndNil(aLst);
end;
end;
procedure TfrmDCSummProperties.cboNewTitleEnter(Sender: TObject);
begin
FLastTitle := 0;
end;
procedure TfrmDCSummProperties.cboNewTitleMouseClick(Sender: TObject);
begin
with cboNewTitle do
if (ItemIEN > 0) and (ItemIEN = FLastTitle) then
Exit
else if ItemIEN = 0 then
begin
if FLastTitle > 0 then
SelectByIEN(FLastTitle)
else
ItemIndex := -1;
Exit;
end;
SetCosignerRequired;
if FShowAdmissions and (not pnlAdmission.Visible) then
begin
pnlAdmission.Visible := True;
pnlAdmission.Top := cmdCancel.Top + cmdCancel.Height + 8;
pnlAdmission.Height := Height - pnlAdmission.Top;
end;
FLastTitle := cboNewTitle.ItemIEN;
end;
procedure TfrmDCSummProperties.cboNewTitleExit(Sender: TObject);
begin
if cboNewTitle.ItemIEN <> FLastTitle then
cboNewTitleMouseClick(Self);
if pnlAdmission.Visible then
begin
If ScreenReaderSystemActive then
GetScreenreader.Speak
('This discharge summary must be associated with an admission. Select one below or press cancel.');
end;
end;
{ cboAuthor & cboAttending events }
procedure TfrmDCSummProperties.cboAuthorNeedData(Sender: TObject;
const StartFrom: String; Direction, InsertAt: Integer);
begin
(Sender as TORComboBox).ForDataUse(SubSetOfPersons(StartFrom, Direction));
end;
procedure TfrmDCSummProperties.cboAttendingNeedData(Sender: TObject;
const StartFrom: String; Direction, InsertAt: Integer);
var
TitleIEN: Int64;
begin
// (Sender as TORComboBox).ForDataUse(SubSetOfPersons(StartFrom, Direction));
// CQ#11666
// (Sender as TORComboBox).ForDataUse(SubSetOfCosigners(StartFrom, Direction,
// FMToday, cboNewTitle.ItemIEN, FDocType));
// CQ #17218 - Updated to properly filter co-signers - JCS
TitleIEN := cboNewTitle.ItemIEN;
if TitleIEN = 0 then
TitleIEN := FDocType;
(Sender as TORComboBox).ForDataUse(SubSetOfCosigners(StartFrom, Direction,
FMToday, TitleIEN, 0));
end;
procedure TfrmDCSummProperties.cboAuthorEnter(Sender: TObject);
begin
FLastAuthor := 0;
end;
procedure TfrmDCSummProperties.cboAuthorMouseClick(Sender: TObject);
begin
SetCosignerRequired;
FLastAuthor := cboAuthor.ItemIEN;
end;
procedure TfrmDCSummProperties.cboAuthorExit(Sender: TObject);
begin
if cboAuthor.ItemIEN <> FLastAuthor then
cboAuthorMouseClick(Self);
end;
procedure TfrmDCSummProperties.cboAttendingExit(Sender: TObject);
{ make sure FCosign fields stay up to date in case SetCosigner gets called again }
begin
with cboAttending do
if Text = '' then
ItemIndex := -1;
if cboAttending.ItemIndex < 0 then
begin
FCosignIEN := 0;
FCosignName := '';
end
else
begin
FCosignIEN := cboAttending.ItemIEN;
FCosignName := Piece(cboAttending.Items[cboAttending.ItemIndex], U, 2);
end;
end;
{ Command Button events }
procedure TfrmDCSummProperties.cmdOKClick(Sender: TObject);
var
ErrMsg, ItemText, WhyNot: string;
begin
cmdOK.SetFocus; // make sure cbo exit events fire
Application.ProcessMessages;
SetCosignerRequired;
ErrMsg := '';
if cboNewTitle.ItemIEN = 0 then
ErrMsg := ErrMsg + TX_REQ_TITLE
else if FIDNoteTitlesOnly and
(not CanTitleBeIDChild(cboNewTitle.ItemIEN, WhyNot)) then
ErrMsg := ErrMsg + CRLF + WhyNot;
if cboAuthor.ItemIEN = 0 then
ErrMsg := ErrMsg + TX_REQ_AUTHOR;
if not calSumm.IsValid then
ErrMsg := ErrMsg + TX_REQ_REFDATE;
if calSumm.IsValid and (calSumm.FMDateTime > FMNow) then
ErrMsg := ErrMsg + TX_NO_FUTURE;
if cboAttending.Visible and (cboAttending.ItemIEN = 0) then
ErrMsg := ErrMsg + TX_REQ_COSIGNER;
// if cboAttending.ItemIEN = User.DUZ then ErrMsg := TX_COS_SELF;
// --------------------------------- REPLACED THIS BLOCK IN V27.37-----------------------------------------------
/// if (cboAttending.ItemIEN > 0) and not IsUserAProvider(cboAttending.ItemIEN, FMNow) then
// //if (cboAttending.ItemIEN > 0) and not CanCosign(cboNewTitle.ItemIEN, FDocType, cboAttending.ItemIEN) then
// ErrMsg := cboAttending.Text + TX_COS_AUTH;
// ------------------------------------ NEW CODE FOLLOWS --------------------------------------------------------
if (cboAttending.ItemIEN > 0) then
if ((not IsUserAUSRProvider(cboAttending.ItemIEN, FMNow)) or
(not CanCosign(cboNewTitle.ItemIEN, FDocType, cboAttending.ItemIEN,
calSumm.FMDateTime))) then
ErrMsg := cboAttending.Text + TX_COS_AUTH;
// -----------------------------------END OF NEW REPLACEMENT CODE -----------------------------------------------
if pnlAdmission.Visible then
with lstAdmissions do
begin
if not Assigned(Selected) then
ErrMsg := TX_NO_ADMISSION
else
begin
ItemText:= Strings[Selected.Index];
if (Piece(ItemText, U, 7) = '1') then
begin
FVisitStr := Piece(ItemText, U, 2) + ';' +
Piece(ItemText, U, 1) + ';H';
if (OneNotePerVisit(cboNewTitle.ItemIEN, Patient.DFN, FVisitStr))
then
begin
FEditIEN := 0;
InfoBox(TX_NO_MORE_SUMMS, TC_NO_EDIT, MB_OK);
Selected := nil;
end;
end
else
begin
FAdmitDateTime := Piece(ItemText, U, 1);
FLocation := StrToIntDef(Piece(ItemText, U, 2), 0);
if (MakeFMDateTime(FAdmitDateTime) = -1) or (FLocation = 0) then
ErrMsg := TX_BAD_ADMISSION
else
FLocationName := ExternalName(FLocation, 44);
end;
end;
end;
if ShowMsgOn(Length(ErrMsg) > 0, ErrMsg, TC_REQ_FIELDS) then
Exit
else
ModalResult := mrOK;
end;
procedure TfrmDCSummProperties.cmdCancelClick(Sender: TObject);
begin
ModalResult := mrCancel;
Close;
end;
procedure TfrmDCSummProperties.cboNewTitleDropDownClose(Sender: TObject);
begin
(* if FFixCursor then
begin
Screen.Cursor := crDefault;
FFixCursor := FALSE;
end;
lblDateTime.Visible := True;
lblAuthor.Visible := True;
lblCosigner.Visible := True; *)
end;
procedure TfrmDCSummProperties.lstAdmissionsSelectItem(Sender: TObject;
Item: TListItem; Selected: Boolean);
{Using the message dialogs makes additonal calls to this event. We need to ignore the select sometimes}
const
OldItem: TListItem = nil;
CanSelect: Boolean = True;
var
ItemText, ADType, ADLocation, ADDate: string;
AnEditSumm: TEditDCSummRec;
ActionSts: TActionRec;
begin
if (Selected) and (Item.Focused) then
begin
if ((OldItem = nil) or (OldItem <> Item)) then
begin
CanSelect := True;
with lstAdmissions do
begin
ItemText := Strings[Selected.Index];
if (StrToIntDef(Piece(ItemText, U, 7), 0) = 2) then
begin
{ Prompt for edit first - proceed as below if yes, else proceed as if '1' }
ADType := Piece(ItemText, '^', 4);
ADLocation := Piece(ItemText, '^', 3);
ADDate := Piece(ItemText, '^', 5);
if InfoBox(Format(TX_EDIT_EXISTING, [ADType,ADLocation,ADDate]), TC_EDIT_EXISTING, MB_YESNO) = MRYES
then
begin
FillChar(AnEditSumm, SizeOf(AnEditSumm), 0);
FEditIEN := StrToInt(Piece(ItemText, U, 6));
ActOnDCDocument(ActionSts, FEditIEN, 'EDIT RECORD');
if not ActionSts.Success then
begin
InfoBox(ActionSts.Reason, TX_IN_AUTH, MB_OK);
ClearSelection;
CanSelect := False;
exit;
end;
GetDCSummForEdit(AnEditSumm, FEditIEN);
EditLines.Assign(AnEditSumm.Lines);
cboNewTitle.InitLongList(AnEditSumm.TitleName);
ListDCSummTitlesShort(cboNewTitle.Items);
if AnEditSumm.Title > 0 then
cboNewTitle.SelectByIEN(AnEditSumm.Title);
cboAuthor.InitLongList(AnEditSumm.DictatorName);
if AnEditSumm.Dictator > 0 then
cboAuthor.SelectByIEN(AnEditSumm.Dictator);
LoadDCUrgencies(cboUrgency.Items);
cboUrgency.SelectByID('R');
cboAttending.InitLongList(AnEditSumm.AttendingName);
if AnEditSumm.Attending > 0 then
cboAttending.SelectByIEN(AnEditSumm.Attending);
calSumm.FMDateTime := AnEditSumm.DictDateTime;
end
else // if user answers NO to edit existing document, can new one be created?
begin
FVisitStr := Piece(ItemText, U, 2) + ';' +
Piece(ItemText, U, 1) + ';H';
if (OneNotePerVisit(cboNewTitle.ItemIEN, Patient.DFN, FVisitStr))
then
begin
FEditIEN := 0;
InfoBox(TX_NO_MORE_SUMMS, TC_NO_EDIT, MB_OK);
ClearSelection;
CanSelect := False;
end;
end;
end
else if Piece(ItemText, U, 7) = '1' then
begin
FVisitStr := Piece(ItemText, U, 2) + ';' +
Piece(ItemText, U, 1) + ';H';
if (OneNotePerVisit(cboNewTitle.ItemIEN, Patient.DFN, FVisitStr))
then
begin
FEditIEN := 0;
InfoBox(TX_NO_MORE_SUMMS, TC_NO_EDIT, MB_OK);
ClearSelection;
CanSelect := False;
end;
end
else
begin
FEditIEN := 0;
(* cboNewTitle.ItemIndex := -1;
cboAttending.ItemIndex := -1;
calSumm.FMDateTime := FMNow; *)
end;
end;
OldItem := Item;
end
else if OldItem = Item then
begin
if Not CanSelect then
lstAdmissions.ClearSelection;
OldItem := nil;
end;
end;
end;
procedure TfrmDCSummProperties.cboNewTitleChange(Sender: TObject);
var
IEN: Int64;
name: string;
Index: Integer;
begin
inherited;
index := cboAttending.ItemIndex;
if index >= 0 then
begin
IEN := cboAttending.ItemIEN;
name := cboAttending.DisplayText[index];
end
else
begin
name := '';
IEN := 0;
end;
cboAttending.InitLongList(name);
if index >= 0 then
cboAttending.SelectByIEN(IEN);
end;
procedure TfrmDCSummProperties.cboNewTitleDblClick(Sender: TObject);
begin
cmdOKClick(Self);
end;
procedure TfrmDCSummProperties.FormClose(Sender: TObject;
var Action: TCloseAction);
begin
SaveUserBounds(Self);
end;
end.
|
unit Router4D.Switch;
{$I Router4D.inc}
interface
uses
Classes,
System.Generics.Collections,
Router4D.Interfaces,
Router4D.History;
type
TRouter4DSwitch = class(TInterfacedObject, iRouter4DSwitch)
private
FSideBarList : TDictionary<String, iRouter4DSidebar>;
public
constructor Create;
destructor Destroy; override;
class function New : iRouter4DSwitch;
function Router(aPath : String; aRouter : TPersistentClass; aSidebarKey : String = 'SBIndex'; isVisible : Boolean = True) : iRouter4DSwitch;
function UnRouter(aPath : String) : iRouter4DSwitch;
function SidebarAdd ( aPatch : String; aSideBar : iRouter4DSidebar) : iRouter4DSwitch;
function SideBarList : TDictionary<String, iRouter4DSidebar>;
end;
implementation
{ TRouter4DSwitch }
uses
Router4D.Utils;
constructor TRouter4DSwitch.Create;
begin
FSideBarList := TDictionary<String, iRouter4DSidebar>.Create;
end;
destructor TRouter4DSwitch.Destroy;
begin
FSideBarList.Free;
inherited;
end;
class function TRouter4DSwitch.New: iRouter4DSwitch;
begin
Result := Self.Create;
end;
function TRouter4DSwitch.Router(aPath : String; aRouter : TPersistentClass; aSidebarKey : String = 'SBIndex'; isVisible : Boolean = True) : iRouter4DSwitch;
begin
Result := Self;
RegisterClass(aRouter);
Router4DHistory.AddHistory(aPath, aRouter, aSidebarKey, isVisible);
end;
function TRouter4DSwitch.SidebarAdd(aPatch: String;
aSideBar: iRouter4DSidebar): iRouter4DSwitch;
begin
Result := Self;
FSideBarList.Add(aPatch, aSideBar);
end;
function TRouter4DSwitch.SideBarList: TDictionary<String, iRouter4DSidebar>;
begin
Result := FSideBarList;
end;
function TRouter4DSwitch.UnRouter(aPath: String) : iRouter4DSwitch;
begin
Result := Self;
Router4DHistory.RemoveHistory(aPath);
end;
end.
|
{
PROG: fence3
LANG: PASCAL
ID: asiapea1
}
program fence3;
const
maxf=150;
zero=1e-5;
var
fin,fout:text;
x1,y1,x2,y2:array[1..maxf]of byte;
f,i:byte;
x,y,best:real;
function min(a,b:real):real;
begin
if a<b then min:=a else min:=b;
end;
function dist(x,y:real;fence:byte):real;
begin
if x1[fence]=x2[fence] then
if (y-y1[fence])*(y-y2[fence])<=zero then
dist:=abs(x-x1[fence])
else
dist:=min(sqrt(sqr(x-x1[fence])+sqr(y-y1[fence])),
sqrt(sqr(x-x2[fence])+sqr(y-y2[fence])))
else
if (x-x1[fence])*(x-x2[fence])<=zero then
dist:=abs(y-y1[fence])
else
dist:=min(sqrt(sqr(x-x1[fence])+sqr(y-y1[fence])),
sqrt(sqr(x-x2[fence])+sqr(y-y2[fence])));
end;
procedure try(cx,cy,range,step:real);
var
i,j,l:real;
k:byte;
begin
i:=cx-range;
repeat
j:=cy-range;
repeat
l:=0;
for k:=1 to f do
l:=l+dist(i,j,k);
if l<best then begin
x:=i;y:=j;best:=l;
end;
j:=j+step;
until j>cy+range+zero;
i:=i+step;
until i>cx+range+zero;
end;
begin
assign(fin,'fence3.in');
reset(fin);
readln(fin,f);
for i:=1 to f do
readln(fin,x1[i],y1[i],x2[i],y2[i]);
close(fin);
x:=50;y:=50;best:=maxint;
try(x,y,50,10);
try(x,y,10,1);
try(x,y,1,0.1);
assign(fout,'fence3.out');
rewrite(fout);
writeln(fout,x:0:1,' ',y:0:1,' ',best:0:1);
close(fout);
end. |
//
// This unit is part of the GLScene Project, http://glscene.org
//
{: GLMaterialMultiProxy<p>
Implements a multi-proxy object, useful for discreet LOD.<p>
Allows assign a unique material for each proxy master.<p>
<b>History : </b><font size=-1><ul>
<li>30/08/10 - Yar - Fixed transformation in TGLMaterialMultiProxy.DoRender
<li>23/08/10 - Yar - Added OpenGLTokens to uses, replaced OpenGL1x functions to OpenGLAdapter
<li>22/04/10 - Yar - Fixes after GLState revision
<li>10/04/08 - DaStr - Added a Delpi 5 interface bug work-around to
TGLMaterialMultiProxyMaster (BugTracker ID = 1938988)
<li>25/03/07 - Added GLCrossPlatform to uses for Delphi5 compatibility
<li>17/02/07 - DaStr - Initial version (contributed to GLScene)
</ul></font>
What changed compared to GLMultiProxy:
1) Allows assign a unique material for each proxy master
2) TGLMaterialMultiProxyMaster: FDistanceMin, FDistanceMax removed
3) TGLMaterialMultiProxy = class(TGLBaseSceneObject)!!!
4) TGLMaterialMultiProxyMaster.Visible removed
5) TGLMaterialMultiProxy.MaterialLibrary added
6) TGLMaterialMultiProxyMaster.MasterLibMaterial added
7) TGLMaterialMultiProxyMasters.Add overloaded
8) Implemented a new mechanizm of connecting TGLLibMaterial and TGLLibMaterialName
(they are connected on assigning, not while rendering; full persistency support;
allows to assign directly to TGLLibMaterial)
9) VCL-style code formating
Previous version history:
v1.0 12 December '2005 Creation (based on MultiProxy.pas)
v1.0.1 18 June '2006 Some IFDEFs added
v1.0.2 20 December '2006 STRANGE_GLSCENE_VERSION checks removed
v1.1 17 February '2007 Made design-time compatible
}
unit GLMaterialMultiProxy;
interface
{$I GLScene.inc}
uses
System.Classes, System.SysUtils,
// GLS
GLScene, GLVectorGeometry, GLTexture, GLMaterial, GLSilhouette, GLStrings,
GLCrossPlatform, GLPersistentClasses, GLRenderContextInfo, GLBaseClasses,
GLContext , GLVectorTypes;
type
TGLMaterialMultiProxy = class;
// TGLMaterialMultiProxyMaster
//
{: MasterObject description for a MultiProxy object. }
TGLMaterialMultiProxyMaster = class(TGLInterfacedCollectionItem, IGLMaterialLibrarySupported)
private
{ Private Declarations }
FMasterObject: TGLBaseSceneObject;
FMasterLibMaterial: TGLLibMaterial;
FTempLibMaterialName: TGLLibMaterialName;
FDistanceMin2, FDistanceMax2: Single;
procedure SetMasterLibMaterialName(const Value: TGLLibMaterialName);
function GetMasterLibMaterialName: TGLLibMaterialName;
// Implementing IGLMaterialLibrarySupported.
function GetMaterialLibrary: TGLAbstractMaterialLibrary;
protected
{ Protected Declarations }
function GetDisplayName: string; override;
procedure SetMasterObject(const Val: TGLBaseSceneObject);
procedure SetDistanceMin(const Val: Single);
procedure SetDistanceMax(const Val: Single);
function GetDistanceMin: Single;
function GetDistanceMax: Single;
public
{ Public Declarations }
constructor Create(Collection: TCollection); override;
destructor Destroy; override;
procedure Assign(Source: TPersistent); override;
function OwnerObject: TGLMaterialMultiProxy;
procedure NotifyChange;
{: Specifies the Material, that current master object will use.
Provides a faster way to access FMasterLibMaterial, compared to
MasterLibMaterialName }
property MasterLibMaterial: TGLLibMaterial read FMasterLibMaterial write FMasterLibMaterial stored False;
published
{ Published Declarations }
{: Specifies the Master object which will be proxy'ed. }
property MasterObject: TGLBaseSceneObject read FMasterObject write SetMasterObject;
{: Specifies the Material, that current master object will use. }
property MasterLibMaterialName: TGLLibMaterialName read GetMasterLibMaterialName write SetMasterLibMaterialName;
{: Minimum visibility Distance (inclusive). }
property DistanceMin: Single read GetDistanceMin write SetDistanceMin;
{: Maximum visibility Distance (exclusive). }
property DistanceMax: Single read GetDistanceMax write SetDistanceMax;
end;
// TGLMaterialMultiProxyMasters
//
{: Collection of TGLMaterialMultiProxyMaster. }
TGLMaterialMultiProxyMasters = class(TOwnedCollection)
private
{ Private Declarations }
protected
{ Protected Declarations }
procedure SetItems(index: Integer; const Val: TGLMaterialMultiProxyMaster);
function GetItems(index: Integer): TGLMaterialMultiProxyMaster;
procedure Update(Item: TCollectionItem); override;
procedure Notification(AComponent: TComponent); virtual;
public
{ Public Declarations }
constructor Create(AOwner: TPersistent);
function Add: TGLMaterialMultiProxyMaster; overload;
function Add(Master: TGLBaseSceneObject; DistanceMin, DistanceMax: Single): TGLMaterialMultiProxyMaster; overload;
function Add(Master: TGLBaseSceneObject; MasterLibMaterial: TGLLibMaterial; DistanceMin, DistanceMax: Single): TGLMaterialMultiProxyMaster; overload;
property Items[index: Integer]: TGLMaterialMultiProxyMaster read GetItems write SetItems; default;
procedure NotifyChange;
procedure EndUpdate; override;
end;
// TGLMaterialMultiProxy
//
{: Multiple Proxy object.<p>
This proxy has multiple Master objects, which are individually made visible
depending on a Distance to the camera criterion. It can be used to implement
discreet level of detail directly for static objects, or objects that
go through cyclic animation.<p>
For dimensionsn raycasting and silhouette purposes, the first Master is used
(item zero in the MasterObjects collection). }
TGLMaterialMultiProxy = class(TGLBaseSceneObject)
private
{ Private Declarations }
FMasterObjects: TGLMaterialMultiProxyMasters;
FRendering: Boolean; // internal use (loop protection)
FMaterialLibrary: TGLMaterialLibrary;
procedure SetMaterialLibrary(const Value: TGLMaterialLibrary);
protected
{ Protected Declarations }
procedure SetMasterObjects(const Val: TGLMaterialMultiProxyMasters);
procedure Notification(AComponent: TComponent; Operation: TOperation); override;
function PrimaryMaster: TGLBaseSceneObject;
public
{ Public Declarations }
constructor Create(AOwner: TComponent); override;
destructor Destroy; override;
procedure Assign(Source: TPersistent); override;
procedure DoRender(var rci: TRenderContextInfo; renderSelf, renderChildren: Boolean); override;
function AxisAlignedDimensionsUnscaled: TVector; override;
function RayCastIntersect(const rayStart, rayVector: TVector; intersectPoint: PVector = nil; intersectNormal: PVector = nil): Boolean; override;
function GenerateSilhouette(const silhouetteParameters: TGLSilhouetteParameters): TGLSilhouette; override;
published
{ Published Declarations }
property MasterObjects: TGLMaterialMultiProxyMasters read FMasterObjects write SetMasterObjects;
property MaterialLibrary: TGLMaterialLibrary read FMaterialLibrary write SetMaterialLibrary;
property ObjectsSorting;
property Direction;
property PitchAngle;
property Position;
property RollAngle;
property Scale;
property ShowAxes;
property TurnAngle;
property Up;
property Visible;
property OnProgress;
property Behaviours;
property Effects;
end;
//-------------------------------------------------------------
//-------------------------------------------------------------
//-------------------------------------------------------------
implementation
// ------------------
// ------------------ TGLMaterialMultiProxyMaster ------------------
// ------------------
// Create
//
constructor TGLMaterialMultiProxyMaster.Create(Collection: TCollection);
begin
inherited Create(Collection);
end;
// Destroy
//
destructor TGLMaterialMultiProxyMaster.Destroy;
begin
MasterObject := nil;
inherited Destroy;
end;
// Assign
//
procedure TGLMaterialMultiProxyMaster.Assign(Source: TPersistent);
begin
if Source is TGLMaterialMultiProxyMaster then
begin
FMasterObject := TGLMaterialMultiProxyMaster(Source).FMasterObject;
FTempLibMaterialName := TGLMaterialMultiProxyMaster(Source).FTempLibMaterialName;
FDistanceMin2 := TGLMaterialMultiProxyMaster(Source).FDistanceMin2;
FDistanceMax2 := TGLMaterialMultiProxyMaster(Source).FDistanceMax2;
NotifyChange;
end
else
inherited;
end;
// OwnerObject
//
function TGLMaterialMultiProxyMaster.OwnerObject: TGLMaterialMultiProxy;
begin
if Collection = nil then
Result := nil
else
Result := TGLMaterialMultiProxy(TGLMaterialMultiProxyMasters(Collection).GetOwner);
end;
// NotifyChange
//
procedure TGLMaterialMultiProxyMaster.NotifyChange;
begin
TGLMaterialMultiProxyMasters(Collection).NotifyChange;
end;
// GetDisplayName
//
function TGLMaterialMultiProxyMaster.GetDisplayName: string;
begin
if MasterObject <> nil then
Result := MasterObject.Name
else
Result := '???';
Result := Result + Format(' [%.2f; %.2f[', [DistanceMin, DistanceMax]);
end;
// SetMasterObject
//
procedure TGLMaterialMultiProxyMaster.SetMasterObject(const Val: TGLBaseSceneObject);
begin
if FMasterObject <> Val then
begin
if Assigned(FMasterObject) then
FMasterObject.RemoveFreeNotification(OwnerObject);
FMasterObject := Val;
if Assigned(FMasterObject) then
FMasterObject.FreeNotification(OwnerObject);
NotifyChange;
end;
end;
// SetDistanceMin
//
procedure TGLMaterialMultiProxyMaster.SetDistanceMin(const Val: Single);
var
tmp: Single;
begin
tmp := Sqr(Val);
if FDistanceMin2 <> tmp then
begin
FDistanceMin2 := tmp;
NotifyChange;
end;
end;
// SetDistanceMax
//
procedure TGLMaterialMultiProxyMaster.SetDistanceMax(const Val: Single);
var
tmp: Single;
begin
tmp := Sqr(Val);
if FDistanceMax2 <> tmp then
begin
FDistanceMax2 := tmp;
NotifyChange;
end;
end;
// GetMaterialLibrary
//
function TGLMaterialMultiProxyMaster.GetMaterialLibrary: TGLAbstractMaterialLibrary;
begin
if OwnerObject = nil then
Result := nil
else
Result := OwnerObject.FMaterialLibrary;
end;
// GetDistanceMax
//
function TGLMaterialMultiProxyMaster.GetDistanceMax: Single;
begin
Result := sqrt(FDistanceMax2);
end;
// GetDistanceMin
//
function TGLMaterialMultiProxyMaster.GetDistanceMin: Single;
begin
Result := sqrt(FDistanceMin2);
end;
// SetMasterLibMaterialName
//
procedure TGLMaterialMultiProxyMaster.SetMasterLibMaterialName(
const Value: TGLLibMaterialName);
begin
if OwnerObject.FMaterialLibrary = nil then
begin
FTempLibMaterialName := Value;
if not (csLoading in OwnerObject.ComponentState) then
raise ETexture.Create(glsErrorEx + glsMatLibNotDefined);
end
else
begin
FMasterLibMaterial := OwnerObject.FMaterialLibrary.LibMaterialByName(Value);
FTempLibMaterialName := '';
end;
end;
// GetMasterLibMaterialName
//
function TGLMaterialMultiProxyMaster.GetMasterLibMaterialName: TGLLibMaterialName;
begin
Result := OwnerObject.FMaterialLibrary.GetNameOfLibMaterial(FMasterLibMaterial);
if Result = '' then
Result := FTempLibMaterialName;
end;
// ------------------
// ------------------ TGLMaterialMultiProxyMasters ------------------
// ------------------
// Create
//
constructor TGLMaterialMultiProxyMasters.Create(AOwner: TPersistent);
begin
inherited Create(AOwner, TGLMaterialMultiProxyMaster);
end;
// SetItems
//
procedure TGLMaterialMultiProxyMasters.SetItems(index: Integer;
const Val: TGLMaterialMultiProxyMaster);
begin
inherited Items[index] := Val;
end;
// GetItems
//
function TGLMaterialMultiProxyMasters.GetItems(index: Integer): TGLMaterialMultiProxyMaster;
begin
Result := TGLMaterialMultiProxyMaster(inherited Items[index]);
end;
// Update
//
procedure TGLMaterialMultiProxyMasters.Update(Item: TCollectionItem);
begin
inherited;
NotifyChange;
end;
// Add (simple)
//
function TGLMaterialMultiProxyMasters.Add: TGLMaterialMultiProxyMaster;
begin
Result := (inherited Add) as TGLMaterialMultiProxyMaster;
end;
// Add (classic params)
//
function TGLMaterialMultiProxyMasters.Add(Master: TGLBaseSceneObject;
DistanceMin, DistanceMax: Single): TGLMaterialMultiProxyMaster;
begin
BeginUpdate;
Result := (inherited Add) as TGLMaterialMultiProxyMaster;
Result.MasterObject := Master;
Result.DistanceMin := DistanceMin;
Result.DistanceMax := DistanceMax;
EndUpdate;
end;
// Notification
//
procedure TGLMaterialMultiProxyMasters.Notification(AComponent: TComponent);
var
I: Integer;
begin
for I := 0 to Count - 1 do
with Items[I] do
if FMasterObject = AComponent then
FMasterObject := nil;
end;
// NotifyChange
//
procedure TGLMaterialMultiProxyMasters.NotifyChange;
begin
if (UpdateCount = 0) and (GetOwner <> nil) and (GetOwner is TGLUpdateAbleComponent) then
TGLUpdateAbleComponent(GetOwner).NotifyChange(Self);
end;
// EndUpdate
//
procedure TGLMaterialMultiProxyMasters.EndUpdate;
begin
inherited EndUpdate;
// Workaround for a bug in VCL's EndUpdate
if UpdateCount = 0 then
NotifyChange;
end;
// Add
//
function TGLMaterialMultiProxyMasters.Add(Master: TGLBaseSceneObject;
MasterLibMaterial: TGLLibMaterial;
DistanceMin, DistanceMax: Single): TGLMaterialMultiProxyMaster;
begin
BeginUpdate;
Result := (inherited Add) as TGLMaterialMultiProxyMaster;
Result.MasterObject := Master;
Result.FMasterLibMaterial := MasterLibMaterial;
Result.DistanceMin := DistanceMin;
Result.DistanceMax := DistanceMax;
EndUpdate;
end;
// ------------------
// ------------------ TGLMaterialMultiProxy ------------------
// ------------------
// Create
//
constructor TGLMaterialMultiProxy.Create(AOwner: TComponent);
begin
inherited Create(AOwner);
ObjectStyle := ObjectStyle + [osDirectDraw];
FMasterObjects := TGLMaterialMultiProxyMasters.Create(Self);
end;
// Destroy
//
destructor TGLMaterialMultiProxy.Destroy;
begin
inherited Destroy;
FMasterObjects.Free;
end;
// Notification
//
procedure TGLMaterialMultiProxy.Notification(AComponent: TComponent; Operation: TOperation);
begin
if Operation = opRemove then
begin
FMasterObjects.Notification(AComponent);
end;
inherited;
end;
// SetMasterObjects
//
procedure TGLMaterialMultiProxy.SetMasterObjects(const Val: TGLMaterialMultiProxyMasters);
begin
FMasterObjects.Assign(Val);
StructureChanged;
end;
// Assign
//
procedure TGLMaterialMultiProxy.Assign(Source: TPersistent);
begin
if Source is TGLMaterialMultiProxy then
MasterObjects := TGLMaterialMultiProxy(Source).MasterObjects;
inherited;
end;
// Render
//
procedure TGLMaterialMultiProxy.DoRender(var rci: TRenderContextInfo;
renderSelf, renderChildren: Boolean);
var
I: Integer;
oldProxySubObject: Boolean;
mpMaster: TGLMaterialMultiProxyMaster;
d2: Single;
begin
if FRendering then
Exit;
FRendering := True;
try
d2 := VectorDistance2(rci.cameraPosition, AbsolutePosition);
for I := 0 to MasterObjects.Count - 1 do
begin
mpMaster := MasterObjects[I];
if (mpMaster.MasterObject <> nil) and (d2 >= mpMaster.FDistanceMin2) and
(d2 < mpMaster.FDistanceMax2) then
begin
oldProxySubObject := rci.proxySubObject;
rci.proxySubObject := True;
with rci.PipelineTransformation do
ModelMatrix := MatrixMultiply(mpMaster.MasterObject.Matrix, ModelMatrix);
if (mpMaster.MasterObject is TGLCustomSceneObject) and (FMaterialLibrary <> nil) then
begin
TGLCustomSceneObject(mpMaster.MasterObject).Material.QuickAssignMaterial(
FMaterialLibrary, mpMaster.FMasterLibMaterial);
end;
mpMaster.MasterObject.DoRender(rci, renderSelf, (mpMaster.MasterObject.Count > 0));
rci.proxySubObject := oldProxySubObject;
end;
end;
// now render self stuff (our children, our effects, etc.)
if renderChildren and (Count > 0) then
Self.RenderChildren(0, Count - 1, rci);
// if MasterGotEffects then
// FMasterObject.Effects.RenderPostEffects(Scene.CurrentBuffer, rci);
finally
FRendering := False;
end;
ClearStructureChanged;
end;
// PrimaryMaster
//
function TGLMaterialMultiProxy.PrimaryMaster: TGLBaseSceneObject;
begin
if MasterObjects.Count > 0 then
Result := MasterObjects[0].MasterObject
else
Result := nil;
end;
// AxisAlignedDimensions
//
function TGLMaterialMultiProxy.AxisAlignedDimensionsUnscaled: TVector;
var
Master: TGLBaseSceneObject;
begin
Master := PrimaryMaster;
if Assigned(Master) then
Result := Master.AxisAlignedDimensionsUnscaled
else
Result := inherited AxisAlignedDimensionsUnscaled;
end;
// RayCastIntersect
//
function TGLMaterialMultiProxy.RayCastIntersect(const rayStart, rayVector: TVector;
intersectPoint: PVector = nil; intersectNormal: PVector = nil): Boolean;
var
localRayStart, localRayVector: TVector;
Master: TGLBaseSceneObject;
begin
Master := PrimaryMaster;
if Assigned(Master) then
begin
SetVector(localRayStart, AbsoluteToLocal(rayStart));
SetVector(localRayStart, Master.LocalToAbsolute(localRayStart));
SetVector(localRayVector, AbsoluteToLocal(rayVector));
SetVector(localRayVector, Master.LocalToAbsolute(localRayVector));
NormalizeVector(localRayVector);
Result := Master.RayCastIntersect(localRayStart, localRayVector,
intersectPoint, intersectNormal);
if Result then
begin
if Assigned(intersectPoint) then
begin
SetVector(intersectPoint^, Master.AbsoluteToLocal(intersectPoint^));
SetVector(intersectPoint^, LocalToAbsolute(intersectPoint^));
end;
if Assigned(intersectNormal) then
begin
SetVector(intersectNormal^, Master.AbsoluteToLocal(intersectNormal^));
SetVector(intersectNormal^, LocalToAbsolute(intersectNormal^));
end;
end;
end
else
Result := False;
end;
// GenerateSilhouette
//
function TGLMaterialMultiProxy.GenerateSilhouette(
const silhouetteParameters: TGLSilhouetteParameters): TGLSilhouette;
var
Master: TGLBaseSceneObject;
begin
Master := PrimaryMaster;
if Assigned(Master) then
Result := Master.GenerateSilhouette(silhouetteParameters)
else
Result := nil;
end;
// SetMaterialLibrary
//
procedure TGLMaterialMultiProxy.SetMaterialLibrary(
const Value: TGLMaterialLibrary);
var
I: Integer;
begin
if FMaterialLibrary <> Value then
begin
if FMaterialLibrary <> nil then
FMaterialLibrary.RemoveFreeNotification(Self);
FMaterialLibrary := Value;
if FMaterialLibrary <> nil then
begin
FMaterialLibrary.FreeNotification(Self);
if FMasterObjects.Count <> 0 then
for I := 0 to FMasterObjects.Count - 1 do
with FMasterObjects.GetItems(I) do
begin
if FTempLibMaterialName <> '' then
SetMasterLibMaterialName(FTempLibMaterialName);
end;
end
else
begin
if FMasterObjects.Count <> 0 then
for I := 0 to FMasterObjects.Count - 1 do
FMasterObjects.GetItems(I).FTempLibMaterialName := '';
end;
end;
end;
//-------------------------------------------------------------
//-------------------------------------------------------------
//-------------------------------------------------------------
initialization
//-------------------------------------------------------------
//-------------------------------------------------------------
//-------------------------------------------------------------
RegisterClasses([TGLMaterialMultiProxyMaster, TGLMaterialMultiProxyMasters,
TGLMaterialMultiProxy]);
end.
|
unit SynLCHighlighter;
{$mode objfpc}{$H+}
interface
uses
Classes, SysUtils, Graphics, LCLProc,
SynEditHighlighter, SynEditHighlighterFoldBase, SynEditTypes;
type
TLCTokenKind = (tLCAttributeName, tLCComment, tLCDataType, tLCIdentifier, tLCKey, tLCNull, tLCNumber,
tLCReservedWord, tLCSpace, tLCString, tLCSymbol, tLCUnknown, tLCVariable, tLCEol,
tLCCustomFunction);
Const
DescricaoTiposToken: Array[TLCTokenKind] of string = ('Atributo', 'Comentário', 'Tipo Dado',
'Identificador', 'Comando', 'Nulo', 'Número',
'Função Programador', 'Espaço', 'Texto', 'Símbolo',
'Desconhecido', 'Variável', 'Final da Linha',
'Função Customizada');
type
TLCRangeState = (rsLCAttrName, rsLCComment, rsLCString, rsLCUnknown);
TLCRangeStates = set of TLCRangeState;
TLCCodeFoldBlockType = (
cfbtLCInicioFim,
cfbtLCCommentMultiLine,
// internal type / no config
cfbtLCUnknown
);
TLCCodeFoldBlockTypes = set of TLCCodeFoldBlockType;
TLCTokenDef = record
Texto : string;
kind : TLCTokenKind;
end;
TLCArrayTokenDef = array of TLCTokenDef;
TPtrLCArrayTokenDef = ^TLCArrayTokenDef;
TPtrLCTokenDef = ^TLCTokenDef;
const
CountLCCodeFoldBlockOffset: Pointer = Pointer(PtrInt(Integer(high(TLCCodeFoldBlockType))+1));
Type
{ TSynLCAttributeSettings }
TSynLCAttributeSettings = class(TPersistent)
private
FBackground: TColor;
FForeground: TColor;
FFrameColor: TColor;
FFrameEdges: TSynFrameEdges;
FFrameStyle: TSynLineStyle;
fStyle: TFontStyles;
fStyleMask: TFontStyles;
protected
public
constructor Create; virtual;
procedure Assign(aSource: TPersistent); override;
published
property Background: TColor read FBackground write FBackground;
property Foreground: TColor read FForeground write FForeground;
property FrameColor: TColor read FFrameColor write FFrameColor;
property FrameStyle: TSynLineStyle read FFrameStyle write FFrameStyle;
property FrameEdges: TSynFrameEdges read FFrameEdges write FFrameEdges;
property Style: TFontStyles read fStyle write fStyle;
property StyleMask: TFontStyles read fStyleMask write fStyleMask;
end;
{ TSynLCAttributeWithWordsSettings }
TSynLCAttributeWithWordsSettings = class(TSynLCAttributeSettings)
private
fWords: TStringList;
protected
public
constructor Create; override;
destructor Destroy; override;
published
property Words:TStringList read fWords write fWords;
end;
{ TSynLCHighlighterSettings }
TSynLCHighlighterSettings = class(TPersistent)
private
fCaseSensitive: Boolean;
fSettingsToAttributeName: TSynLCAttributeWithWordsSettings;
fSettingsToComment: TSynLCAttributeSettings;
fSettingsToCustomFunction: TSynLCAttributeWithWordsSettings;
fSettingsToDataType: TSynLCAttributeWithWordsSettings;
fSettingsToIdentifier: TSynLCAttributeSettings;
fSettingsToKey: TSynLCAttributeWithWordsSettings;
fSettingsToNumber: TSynLCAttributeSettings;
fSettingsToReservedWord: TSynLCAttributeWithWordsSettings;
fSettingsToSpace: TSynLCAttributeSettings;
fSettingsToString: TSynLCAttributeSettings;
fSettingsToSymbol: TSynLCAttributeSettings;
fSettingsToVariable: TSynLCAttributeWithWordsSettings;
procedure SetCaseSensitive(AValue: Boolean);
protected
procedure CreateDefaultSettings;
public
constructor Create;
destructor Destroy; override;
function GetSettingsByTokenKind(pTokenKind: TLCTokenKind):TSynLCAttributeSettings;
procedure SaveToFile(fileName:String);
procedure LoadFromFile(fileName:String);
published
property CaseSensitive:Boolean read fCaseSensitive write SetCaseSensitive;
Property SettingsToComment: TSynLCAttributeSettings read fSettingsToComment write fSettingsToComment;
Property SettingsToIdentifier: TSynLCAttributeSettings read fSettingsToIdentifier write fSettingsToIdentifier;
Property SettingsToCustomFunction: TSynLCAttributeWithWordsSettings read fSettingsToCustomFunction write fSettingsToCustomFunction;
Property SettingsToDataType: TSynLCAttributeWithWordsSettings read fSettingsToDataType write fSettingsToDataType;
Property SettingsToKey: TSynLCAttributeWithWordsSettings read fSettingsToKey write fSettingsToKey;
Property SettingsToReservedWord: TSynLCAttributeWithWordsSettings read fSettingsToReservedWord write fSettingsToReservedWord;
Property SettingsToNumber: TSynLCAttributeSettings read fSettingsToNumber write fSettingsToNumber;
Property SettingsToSpace: TSynLCAttributeSettings read fSettingsToSpace write fSettingsToSpace;
Property SettingsToString: TSynLCAttributeSettings read fSettingsToString write fSettingsToString;
Property SettingsToSymbol: TSynLCAttributeSettings read fSettingsToSymbol write fSettingsToSymbol;
Property SettingsToVariable: TSynLCAttributeWithWordsSettings read fSettingsToVariable write fSettingsToVariable;
Property SettingsToAttributeName: TSynLCAttributeWithWordsSettings read fSettingsToAttributeName write fSettingsToAttributeName;
end;
TLCOnGetCustomIdentKind = procedure(Sender: TObject; Const pToken:String; var pIdentKind:TLCTokenKind) of object;
{ TSynLCHighlighter }
TSynLCHighlighter = class(TSynCustomFoldHighlighter)
private
fOnGetCustomIdentKind : TLCOnGetCustomIdentKind;
fSettings:TSynLCHighlighterSettings;
fIdentifiers: array[#0..#255] of ByteBool;
fNumberChar: array[char] of Boolean;
fSpaceChar: array[char] of Boolean;
fPCharCurrentLine : PChar;
fNumberCurrentLine : integer;
fSizeCurrentLine : integer;
fRanges: TLCRangeStates;
fPositionInLine: LongInt;// current parser postion in fTextCurrentLine
fTokenStart: integer;// start of current token in fTextCurrentLine
fTokenKind: TLCTokenKind;
FAtLineStart: Boolean;
fCommentAttri: TSynHighlighterAttributes;
fIdentifierAttri: TSynHighlighterAttributes;
fDataTypeAttri: TSynHighlighterAttributes;
fKeyAttri: TSynHighlighterAttributes;
fReservedWordAttri: TSynHighlighterAttributes;
fCustomFunctionWordAttri: TSynHighlighterAttributes;
fNumberAttri: TSynHighlighterAttributes;
fSpaceAttri: TSynHighlighterAttributes;
fStringAttri: TSynHighlighterAttributes;
fSymbolAttri: TSynHighlighterAttributes;
fVariableAttri: TSynHighlighterAttributes;
fAttributeNameAttri: TSynHighlighterAttributes;
atdA, atdB, atdC, atdD, atdE, atdF, atdG, atdH, atdI, atdJ,
atdK, atdL, atdM, atdN, atdO, atdP, atdQ, atdR, atdS, atdT,
atdU, atdV, atdW, atdX, atdY, atdZ: TLCArrayTokenDef;
procedure GetArrayToToken(aToken:String; out aArray:TPtrLCArrayTokenDef);
procedure ResetArrayOfTokenDef;
function GetKindOfToken(aToken:String; const aDefaultKind: TLCTokenKind;
const aKindExpected: TLCTokenKind = tLCUnknown): TLCTokenKind;
procedure CreateDefaultAttributes;
procedure DefineDefaultValidCaracters;
function IsLineEnd(pPosition: Integer): Boolean;
procedure CommentMultiLineProc;
procedure CommentInLineProc;
procedure CRProc;
procedure IdentProc(isAttr:Boolean = false);
procedure LFProc;
procedure NullProc;
procedure NumberProc;
procedure PointProc;
procedure SpaceProc;
procedure StringProc;
procedure StringMutlipeLinesProc;
procedure SymbolProc;
procedure UnknownProc;
protected
// folding
function StartLCCodeFoldBlock(ABlockType: TLCCodeFoldBlockType): TSynCustomCodeFoldBlock;
procedure EndLCCodeFoldBlock;
function CurrentLCCodeFoldBlockType: TLCCodeFoldBlockType;
procedure DoInitNode(var Node: TSynFoldNodeInfo;
FinishingABlock: Boolean;
ABlockType: Pointer; aActions: TSynFoldActions;
AIsFold: Boolean); override;
// Fold Config
function GetFoldConfigInstance(Index: Integer): TSynCustomFoldConfig; override;
public
constructor Create(AOwner: TComponent); override;
destructor Destroy; override;
function IdentKind(isAttr:Boolean = false; pToken:String = ''): TLCTokenKind;
procedure SaveSettingsToFile(fileName:String);
procedure LoadSettingsFromFile(fileName:String);
procedure PopularArrayOfTokenDef;
procedure UpdateAttributesBySettings;
procedure SetLine(const NewValue: String; LineNumber: Integer); override;
procedure Next; override;
function GetEol: Boolean; override;
function GetToken: String; override;
procedure GetTokenEx(out TokenStart: PChar; out TokenLength: integer); override;
function GetTokenPos: Integer; override;
function GetTokenKind: integer; override;
function GetTokenAttribute: TSynHighlighterAttributes; override;
function GetDefaultAttribute(Index: integer): TSynHighlighterAttributes; override;
procedure SetRange(Value: Pointer); override;
procedure ResetRange; override;
function GetRange: Pointer; override;
property Settings:TSynLCHighlighterSettings read fSettings;
property onGetCustomIdentKind:TLCOnGetCustomIdentKind read fOnGetCustomIdentKind write fOnGetCustomIdentKind;
published
end;
//procedure Registre;
implementation
uses
fpjsonrtti, fpjson,
SynEditStrConst;
{ TSynLCHighlighterSettings }
procedure TSynLCHighlighterSettings.SetCaseSensitive(AValue: Boolean);
begin
if fCaseSensitive = AValue then
begin
Exit;
end;
fCaseSensitive := AValue;
// Set the lists of work the casesensitive property
fSettingsToAttributeName.Words.CaseSensitive := fCaseSensitive;
fSettingsToDataType.Words.CaseSensitive := fCaseSensitive;
fSettingsToKey.Words.CaseSensitive := fCaseSensitive;
fSettingsToReservedWord.Words.CaseSensitive := fCaseSensitive;
fSettingsToCustomFunction.Words.CaseSensitive := fCaseSensitive;
fSettingsToVariable.Words.CaseSensitive := fCaseSensitive;
end;
procedure TSynLCHighlighterSettings.CreateDefaultSettings;
begin
fSettingsToAttributeName:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToAttributeName.Style:= [fsBold];
fSettingsToAttributeName.Foreground:=clOlive;
fSettingsToComment:= TSynLCAttributeSettings.Create;
fSettingsToComment.Style:= [fsBold];
fSettingsToComment.Foreground:=clTeal;
fSettingsToCustomFunction:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToCustomFunction.Foreground:= $FF8000;
fSettingsToCustomFunction.Style:= [fsBold];
fSettingsToDataType:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToDataType.Style:= [fsBold];
fSettingsToDataType.Foreground:=clPurple;
fSettingsToIdentifier:= TSynLCAttributeSettings.Create;
fSettingsToIdentifier.Foreground:=clNavy;
fSettingsToKey:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToKey.Style:= [fsBold];
fSettingsToKey.Foreground:=clBlack;
fSettingsToNumber:= TSynLCAttributeSettings.Create;
fSettingsToNumber.Foreground:=clGreen;
fSettingsToReservedWord:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToReservedWord.Foreground:=clNavy;
fSettingsToReservedWord.Style:= [fsBold];
fSettingsToSpace:= TSynLCAttributeSettings.Create;
fSettingsToString:= TSynLCAttributeSettings.Create;
fSettingsToString.Foreground:=clBlue;
fSettingsToSymbol:= TSynLCAttributeSettings.Create;
fSettingsToSymbol.Foreground:=clMaroon;
fSettingsToVariable:= TSynLCAttributeWithWordsSettings.Create;
fSettingsToVariable.Style:= [];
fSettingsToVariable.Foreground:=clRed;
end;
constructor TSynLCHighlighterSettings.Create;
begin
CreateDefaultSettings;
CaseSensitive := false;
end;
destructor TSynLCHighlighterSettings.Destroy;
begin
fSettingsToAttributeName.Destroy;
fSettingsToComment.Destroy;
fSettingsToDataType.Destroy;
fSettingsToIdentifier.Destroy;
fSettingsToKey.Destroy;
fSettingsToNumber.Destroy;
fSettingsToReservedWord.Destroy;
fSettingsToSpace.Destroy;
fSettingsToString.Destroy;
fSettingsToSymbol.Destroy;
fSettingsToVariable.Destroy;
fSettingsToCustomFunction.Destroy;
inherited Destroy;
end;
function TSynLCHighlighterSettings.GetSettingsByTokenKind(pTokenKind : TLCTokenKind) : TSynLCAttributeSettings;
begin
case pTokenKind of
tLCAttributeName: Result := fSettingsToAttributeName;
tLCComment: Result := fSettingsToComment;
tLCDataType: Result := fSettingsToDataType;
tLCKey: Result := fSettingsToKey;
tLCNumber: Result := fSettingsToNumber;
tLCReservedWord: Result := fSettingsToReservedWord;
tLCSpace: Result := fSettingsToSpace;
tLCString: Result := fSettingsToString;
tLCSymbol: Result := fSettingsToSymbol;
tLCVariable: Result := fSettingsToVariable;
tLCCustomFunction:Result := fSettingsToCustomFunction;
else
Result := fSettingsToIdentifier;
end;
end;
procedure TSynLCHighlighterSettings.SaveToFile(fileName: String);
var
Streamer:TJSONStreamer;
JData : TJSONData;
Arq:TStrings;
begin
Arq := TStringList.Create;
try
Streamer := TJSONStreamer.Create(nil);
try
Streamer.Options := Streamer.Options + [jsoTStringsAsArray];
JData := GetJSON(Streamer.ObjectToJSONString(Self));
try
Arq.Text := Jdata.FormatJSON(DefaultFormat,2);
Arq.SaveToFile(fileName);
finally
JData.Destroy;
end;
finally
Streamer.Destroy;
end;
finally
arq.Destroy;
end;
end;
procedure TSynLCHighlighterSettings.LoadFromFile(fileName: String);
var
DeStreamer:TJSONDeStreamer;
arq:TStrings;
begin
arq := TStringList.Create;
DeStreamer := TJSONDeStreamer.Create(nil);
try
arq.LoadFromFile(fileName);
DeStreamer.JSONToObject(arq.Text, self);
finally
arq.Destroy;
DeStreamer.Destroy;
end;
end;
{ TSynLCAttributeWithWordsSettings }
constructor TSynLCAttributeWithWordsSettings.Create;
begin
inherited Create;
fWords := TStringList.Create;
fWords.CaseSensitive := false;
fWords.Sorted := true;
end;
destructor TSynLCAttributeWithWordsSettings.Destroy;
begin
FreeAndNil(fWords);
inherited Destroy;
end;
{ TSynLCAttributeSettings }
constructor TSynLCAttributeSettings.Create;
begin
FBackground:= clNone;
FForeground:= clNone;
FFrameColor:= clNone;
FFrameEdges:= sfeNone;
FFrameStyle:= slsSolid;
fStyle:= [];
fStyleMask:= [];
end;
procedure TSynLCAttributeSettings.Assign(aSource : TPersistent);
var
Source: TSynLCAttributeSettings;
begin
if Assigned(aSource)
and (aSource is TSynLCAttributeSettings) then
begin
Source := TSynLCAttributeSettings(aSource);
Background := Source.Background;
Foreground := Source.Foreground;
FrameColor := Source.FrameColor;
FrameStyle := Source.FrameStyle;
FrameEdges := Source.FrameEdges;
Style := Source.FStyle;
StyleMask := Source.FStyleMask;
end
else
begin
inherited;
end;
end;
{ TSynLCHighlighter }
procedure TSynLCHighlighter.NullProc;
begin
fTokenKind := tLCNull;
if fPositionInLine < fSizeCurrentLine then
begin
inc(fPositionInLine);
end;
end;
procedure TSynLCHighlighter.NumberProc;
begin
inc(fPositionInLine);
fTokenKind := tLCNumber;
if fPositionInLine < fSizeCurrentLine then
begin
while (fNumberChar[fPCharCurrentLine[fPositionInLine]]) do
begin
inc(fPositionInLine);
end;
if (fPCharCurrentLine[fPositionInLine] = '.')
and (fPCharCurrentLine[fPositionInLine + 1] <> '.') then
begin
inc(fPositionInLine);
while (fNumberChar[fPCharCurrentLine[fPositionInLine]]) do
begin
inc(fPositionInLine);
end;
end;
end;
end;
procedure TSynLCHighlighter.PointProc;
begin
fTokenKind := tLCSymbol;
inc(fPositionInLine);
if (fIdentifiers[fPCharCurrentLine[fPositionInLine]] = true) then
begin
fRanges := fRanges + [rsLCAttrName];
end;
end;
procedure TSynLCHighlighter.SpaceProc;
begin
inc(fPositionInLine);
fTokenKind := tLCSpace;
while fSpaceChar[fPCharCurrentLine[fPositionInLine]] do
begin
inc(fPositionInLine);
end;
end;
procedure TSynLCHighlighter.StringProc;
begin
fTokenKind := tLCString;
fRanges := fRanges - [rsLCString];
Inc(fPositionInLine);
While (IsLineEnd(fPositionInLine) = false) do
begin
case (fPCharCurrentLine[fPositionInLine]) of
#34:
begin
Inc(fPositionInLine);
if (fPCharCurrentLine[fPositionInLine] = #34) then
begin
Inc(fPositionInLine);
end
else
begin
break;
end;
end;
#92:
begin
Inc(fPositionInLine);
if not (fPCharCurrentLine[fPositionInLine] in [#34, #92]) then // \" \\
begin
fRanges := fRanges + [rsLCString];
break;
end;
Inc(fPositionInLine);
end;
else
begin
Inc(fPositionInLine);
end;
end; // case
end; // while
end;
procedure TSynLCHighlighter.StringMutlipeLinesProc;
begin
fTokenKind := tLCString;
while IsLineEnd(fPositionInLine) = false do
begin
case fPCharCurrentLine[fPositionInLine] of
#34: // #34 = "
begin
if (fPCharCurrentLine[fPositionInLine + 1] = #34) then
begin
Inc(fPositionInLine, 2);
end
else
begin
inc(fPositionInLine);
fRanges := fRanges - [rsLCString];
break;
end;
end;
#92: // #92 = \
begin
Inc(fPositionInLine);
if (fPCharCurrentLine[fPositionInLine] in [#34, #92]) then // \" \\
begin
Inc(fPositionInLine);
end;
end;
else
begin
inc(fPositionInLine);
end;
end; // case
end; // while
end;
procedure TSynLCHighlighter.SymbolProc;
begin
inc(fPositionInLine);
fTokenKind := tLCSymbol;
end;
procedure TSynLCHighlighter.UnknownProc;
begin
inc(fPositionInLine);
while (fPCharCurrentLine[fPositionInLine] in [#128..#191]) // continued utf8 subcode
or (fPCharCurrentLine[fPositionInLine] <> #0) do
begin
inc(fPositionInLine);
end;
fTokenKind := tLCUnknown;
end;
procedure TSynLCHighlighter.UpdateAttributesBySettings;
begin
fCommentAttri.Background:=fSettings.SettingsToComment.Background;
fCommentAttri.Foreground:=fSettings.SettingsToComment.Foreground;
fCommentAttri.FrameColor:=fSettings.SettingsToComment.FrameColor;
fCommentAttri.FrameStyle:=fSettings.SettingsToComment.FrameStyle;
fCommentAttri.FrameEdges:=fSettings.SettingsToComment.FrameEdges;
fCommentAttri.Style:=fSettings.SettingsToComment.Style;
fCommentAttri.StyleMask:=fSettings.SettingsToComment.StyleMask;
fIdentifierAttri.Background:=fSettings.SettingsToIdentifier.Background;
fIdentifierAttri.Foreground:=fSettings.SettingsToIdentifier.Foreground;
fIdentifierAttri.FrameColor:=fSettings.SettingsToIdentifier.FrameColor;
fIdentifierAttri.FrameStyle:=fSettings.SettingsToIdentifier.FrameStyle;
fIdentifierAttri.FrameEdges:=fSettings.SettingsToIdentifier.FrameEdges;
fIdentifierAttri.Style:=fSettings.SettingsToIdentifier.Style;
fIdentifierAttri.StyleMask:=fSettings.SettingsToIdentifier.StyleMask;
fReservedWordAttri.Background:=fSettings.SettingsToReservedWord.Background;
fReservedWordAttri.Foreground:=fSettings.SettingsToReservedWord.Foreground;
fReservedWordAttri.FrameColor:=fSettings.SettingsToReservedWord.FrameColor;
fReservedWordAttri.FrameStyle:=fSettings.SettingsToReservedWord.FrameStyle;
fReservedWordAttri.FrameEdges:=fSettings.SettingsToReservedWord.FrameEdges;
fReservedWordAttri.Style:=fSettings.SettingsToReservedWord.Style;
fReservedWordAttri.StyleMask:=fSettings.SettingsToReservedWord.StyleMask;
fSettings.SettingsToReservedWord.Words.Sort;
fSettings.SettingsToReservedWord.Words.Sorted := true;
fCustomFunctionWordAttri.Background:=fSettings.SettingsToCustomFunction.Background;
fCustomFunctionWordAttri.Foreground:=fSettings.SettingsToCustomFunction.Foreground;
fCustomFunctionWordAttri.FrameColor:=fSettings.SettingsToCustomFunction.FrameColor;
fCustomFunctionWordAttri.FrameStyle:=fSettings.SettingsToCustomFunction.FrameStyle;
fCustomFunctionWordAttri.FrameEdges:=fSettings.SettingsToCustomFunction.FrameEdges;
fCustomFunctionWordAttri.Style:=fSettings.SettingsToCustomFunction.Style;
fCustomFunctionWordAttri.StyleMask:=fSettings.SettingsToCustomFunction.StyleMask;
fSettings.SettingsToCustomFunction.Words.Sort;
fSettings.SettingsToCustomFunction.Words.Sorted := true;
fDataTypeAttri.Background:=fSettings.SettingsToDataType.Background;
fDataTypeAttri.Foreground:=fSettings.SettingsToDataType.Foreground;
fDataTypeAttri.FrameColor:=fSettings.SettingsToDataType.FrameColor;
fDataTypeAttri.FrameStyle:=fSettings.SettingsToDataType.FrameStyle;
fDataTypeAttri.FrameEdges:=fSettings.SettingsToDataType.FrameEdges;
fDataTypeAttri.Style:=fSettings.SettingsToDataType.Style;
fDataTypeAttri.StyleMask:=fSettings.SettingsToDataType.StyleMask;
fSettings.SettingsToDataType.Words.Sort;
fSettings.SettingsToDataType.Words.Sorted := true;
fKeyAttri.Background:=fSettings.SettingsToKey.Background;
fKeyAttri.Foreground:=fSettings.SettingsToKey.Foreground;
fKeyAttri.FrameColor:=fSettings.SettingsToKey.FrameColor;
fKeyAttri.FrameStyle:=fSettings.SettingsToKey.FrameStyle;
fKeyAttri.FrameEdges:=fSettings.SettingsToKey.FrameEdges;
fKeyAttri.Style:=fSettings.SettingsToKey.Style;
fKeyAttri.StyleMask:=fSettings.SettingsToKey.StyleMask;
fSettings.SettingsToKey.Words.Sort;
fSettings.SettingsToKey.Words.Sorted := true;
fVariableAttri.Background:=fSettings.SettingsToVariable.Background;
fVariableAttri.Foreground:=fSettings.SettingsToVariable.Foreground;
fVariableAttri.FrameColor:=fSettings.SettingsToVariable.FrameColor;
fVariableAttri.FrameStyle:=fSettings.SettingsToVariable.FrameStyle;
fVariableAttri.FrameEdges:=fSettings.SettingsToVariable.FrameEdges;
fVariableAttri.Style:=fSettings.SettingsToVariable.Style;
fVariableAttri.StyleMask:=fSettings.SettingsToVariable.StyleMask;
fSettings.SettingsToVariable.Words.Sort;
fSettings.SettingsToVariable.Words.Sorted := true;
fAttributeNameAttri.Background:=fSettings.SettingsToAttributeName.Background;
fAttributeNameAttri.Foreground:=fSettings.SettingsToAttributeName.Foreground;
fAttributeNameAttri.FrameColor:=fSettings.SettingsToAttributeName.FrameColor;
fAttributeNameAttri.FrameStyle:=fSettings.SettingsToAttributeName.FrameStyle;
fAttributeNameAttri.FrameEdges:=fSettings.SettingsToAttributeName.FrameEdges;
fAttributeNameAttri.Style:=fSettings.SettingsToAttributeName.Style;
fAttributeNameAttri.StyleMask:=fSettings.SettingsToAttributeName.StyleMask;
fSettings.SettingsToAttributeName.Words.Sort;
fSettings.SettingsToAttributeName.Words.Sorted := true;
fNumberAttri.Background:=fSettings.SettingsToNumber.Background;
fNumberAttri.Foreground:=fSettings.SettingsToNumber.Foreground;
fNumberAttri.FrameColor:=fSettings.SettingsToNumber.FrameColor;
fNumberAttri.FrameStyle:=fSettings.SettingsToNumber.FrameStyle;
fNumberAttri.FrameEdges:=fSettings.SettingsToNumber.FrameEdges;
fNumberAttri.Style:=fSettings.SettingsToNumber.Style;
fNumberAttri.StyleMask:=fSettings.SettingsToNumber.StyleMask;
fSpaceAttri.Background:=fSettings.SettingsToSpace.Background;
fSpaceAttri.Foreground:=fSettings.SettingsToSpace.Foreground;
fSpaceAttri.FrameColor:=fSettings.SettingsToSpace.FrameColor;
fSpaceAttri.FrameStyle:=fSettings.SettingsToSpace.FrameStyle;
fSpaceAttri.FrameEdges:=fSettings.SettingsToSpace.FrameEdges;
fSpaceAttri.Style:=fSettings.SettingsToSpace.Style;
fSpaceAttri.StyleMask:=fSettings.SettingsToSpace.StyleMask;
fStringAttri.Background:=fSettings.SettingsToString.Background;
fStringAttri.Foreground:=fSettings.SettingsToString.Foreground;
fStringAttri.FrameColor:=fSettings.SettingsToString.FrameColor;
fStringAttri.FrameStyle:=fSettings.SettingsToString.FrameStyle;
fStringAttri.FrameEdges:=fSettings.SettingsToString.FrameEdges;
fStringAttri.Style:=fSettings.SettingsToString.Style;
fStringAttri.StyleMask:=fSettings.SettingsToString.StyleMask;
fSymbolAttri.Background:=fSettings.SettingsToSymbol.Background;
fSymbolAttri.Foreground:=fSettings.SettingsToSymbol.Foreground;
fSymbolAttri.FrameColor:=fSettings.SettingsToSymbol.FrameColor;
fSymbolAttri.FrameStyle:=fSettings.SettingsToSymbol.FrameStyle;
fSymbolAttri.FrameEdges:=fSettings.SettingsToSymbol.FrameEdges;
fSymbolAttri.Style:=fSettings.SettingsToSymbol.Style;
fSymbolAttri.StyleMask:=fSettings.SettingsToSymbol.StyleMask;
end;
function TSynLCHighlighter.StartLCCodeFoldBlock(ABlockType: TLCCodeFoldBlockType): TSynCustomCodeFoldBlock;
begin
{$PUSH} {$Warnings OFF} {$Hints OFF}
Result:=StartCodeFoldBlock(Pointer(PtrInt(ABlockType)) );
{$POP}
end;
procedure TSynLCHighlighter.EndLCCodeFoldBlock;
begin
EndCodeFoldBlock(True);
end;
function TSynLCHighlighter.CurrentLCCodeFoldBlockType : TLCCodeFoldBlockType;
var p : pointer;
begin
result := cfbtLCUnknown;
p := TopCodeFoldBlockType(0);
if p <> nil then
begin
{$PUSH} {$Warnings OFF} {$Hints OFF}
result := TLCCodeFoldBlockType(PtrUInt(p));
{$POP}
end;
end;
procedure TSynLCHighlighter.DoInitNode(var Node: TSynFoldNodeInfo;
FinishingABlock: Boolean; ABlockType: Pointer; aActions: TSynFoldActions;
AIsFold: Boolean);
begin
inherited DoInitNode(Node, FinishingABlock, ABlockType, aActions, AIsFold);
if not FAtLineStart then
begin
Node.FoldAction := Node.FoldAction - [sfaFoldHide];
end;
{$PUSH} {$Warnings OFF} {$Hints OFF}
if (ABlockType <> nil)
and (TLCCodeFoldBlockType(PtrUInt(ABlockType)) = cfbtLCInicioFim) then
begin
Include( Node.FoldAction, sfaOutlineKeepLevel);
end;
{$POP}
end;
procedure TSynLCHighlighter.GetArrayToToken(aToken : String; out aArray : TPtrLCArrayTokenDef);
var
sValue : string;
begin
sValue := aToken[1];
aArray := nil;
case UpperCase(sValue) of
'A': begin aArray := @atdA; end;
'B': begin aArray := @atdB; end;
'C': begin aArray := @atdC; end;
'D': begin aArray := @atdD; end;
'E': begin aArray := @atdE; end;
'F': begin aArray := @atdF; end;
'G': begin aArray := @atdG; end;
'H': begin aArray := @atdH; end;
'I': begin aArray := @atdI; end;
'J': begin aArray := @atdJ; end;
'K': begin aArray := @atdK; end;
'L': begin aArray := @atdL; end;
'M': begin aArray := @atdM; end;
'N': begin aArray := @atdN; end;
'O': begin aArray := @atdO; end;
'P': begin aArray := @atdP; end;
'Q': begin aArray := @atdQ; end;
'R': begin aArray := @atdR; end;
'S': begin aArray := @atdS; end;
'T': begin aArray := @atdT; end;
'U': begin aArray := @atdU; end;
'V': begin aArray := @atdV; end;
'W': begin aArray := @atdW; end;
'X': begin aArray := @atdX; end;
'Y': begin aArray := @atdY; end;
'Z': begin aArray := @atdZ; end;
end;
end;
procedure TSynLCHighlighter.ResetArrayOfTokenDef;
begin
SetLength(atdA,0);
SetLength(atdB,0);
SetLength(atdC,0);
SetLength(atdD,0);
SetLength(atdE,0);
SetLength(atdF,0);
SetLength(atdG,0);
SetLength(atdH,0);
SetLength(atdI,0);
SetLength(atdJ,0);
SetLength(atdK,0);
SetLength(atdL,0);
SetLength(atdM,0);
SetLength(atdN,0);
SetLength(atdO,0);
SetLength(atdP,0);
SetLength(atdQ,0);
SetLength(atdR,0);
SetLength(atdS,0);
SetLength(atdT,0);
SetLength(atdU,0);
SetLength(atdV,0);
SetLength(atdW,0);
SetLength(atdX,0);
SetLength(atdY,0);
SetLength(atdZ,0);
end;
procedure TSynLCHighlighter.PopularArrayOfTokenDef;
procedure AddListOfToken(aList:TStrings; aKindToken:TLCTokenKind);
var
iPos : Integer;
rToken : TLCTokenDef;
sToken : String;
aArray : TPtrLCArrayTokenDef;
begin
for sToken in aList do
begin
GetArrayToToken(sToken, aArray);
if aArray <> nil then
begin
rToken.Texto := LowerCase(sToken);
rToken.Kind := aKindToken;
iPos := High(aArray^) + 1;
SetLength(aArray^, iPos + 1);
aArray^[iPos] := rToken;
end;
end;
end;
begin
ResetArrayOfTokenDef;
AddListOfToken(fSettings.SettingsToAttributeName.Words, tLCAttributeName);
AddListOfToken(fSettings.SettingsToDataType.Words, tLCDataType);
AddListOfToken(fSettings.SettingsToKey.Words, tLCKey);
AddListOfToken(fSettings.SettingsToReservedWord.Words, tLCReservedWord);
AddListOfToken(fSettings.SettingsToVariable.Words, tLCVariable);
AddListOfToken(fSettings.SettingsToCustomFunction.Words, tLCCustomFunction);
end;
function TSynLCHighlighter.GetKindOfToken(aToken : String; const aDefaultKind : TLCTokenKind;
const aKindExpected : TLCTokenKind) : TLCTokenKind;
var
iPos : Integer;
aArray : TPtrLCArrayTokenDef;
begin
Result := aDefaultKind;
GetArrayToToken(aToken, aArray);
if aArray <> nil then
begin
for iPos := 0 to High(aArray^) do
begin
if aArray^[iPos].Texto = aToken then
begin
if (aKindExpected = tLCUnknown)
or (aKindExpected = aArray^[iPos].Kind) then
begin
Result := aArray^[iPos].Kind;
exit;
end;
end;
end;
end;
if Assigned(fOnGetCustomIdentKind) then
begin
fOnGetCustomIdentKind(self, aToken, Result);
end;
end;
procedure TSynLCHighlighter.CreateDefaultAttributes;
begin
fCommentAttri := TSynHighlighterAttributes.Create(@SYNS_AttrComment, SYNS_XML_AttrComment);
fCommentAttri.Style:= [fsBold];
fCommentAttri.Foreground:=clTeal;
AddAttribute(fCommentAttri);
fIdentifierAttri := TSynHighlighterAttributes.Create(@SYNS_AttrIdentifier, SYNS_XML_AttrIdentifier);
fIdentifierAttri.Foreground:=clNavy;
AddAttribute(fIdentifierAttri);
fCustomFunctionWordAttri := TSynHighlighterAttributes.Create(@SYNS_AttrFunction, SYNS_XML_AttrFunction);
fCustomFunctionWordAttri.Foreground:= $FF8000;
fCustomFunctionWordAttri.Style:= [fsBold];
AddAttribute(fCustomFunctionWordAttri);
fReservedWordAttri := TSynHighlighterAttributes.Create(@SYNS_AttrReservedWord, SYNS_XML_AttrReservedWord);
fReservedWordAttri.Foreground:=clNavy;
fReservedWordAttri.Style:= [fsBold];
AddAttribute(fReservedWordAttri);
fDataTypeAttri := TSynHighlighterAttributes.Create(@SYNS_AttrDataType, SYNS_XML_AttrDataType);
AddAttribute(fDataTypeAttri);
fKeyAttri := TSynHighlighterAttributes.Create(@SYNS_AttrKey, SYNS_XML_AttrKey);
fKeyAttri.Style:= [fsBold];
fKeyAttri.Foreground:=clBlack;
AddAttribute(fKeyAttri);
fVariableAttri := TSynHighlighterAttributes.Create(@SYNS_AttrVariable, SYNS_XML_AttrVariable);
AddAttribute(fVariableAttri);
fAttributeNameAttri := TSynHighlighterAttributes.Create(@SYNS_AttrAttributeName, SYNS_XML_AttrAttributeName);
fAttributeNameAttri.Style:= [fsBold];
fAttributeNameAttri.Foreground:=clOlive;
AddAttribute(fAttributeNameAttri);
fNumberAttri := TSynHighlighterAttributes.Create(@SYNS_AttrNumber, SYNS_XML_AttrNumber);
fNumberAttri.Foreground:=clGreen;
AddAttribute(fNumberAttri);
fSpaceAttri := TSynHighlighterAttributes.Create(@SYNS_AttrSpace, SYNS_XML_AttrSpace);
AddAttribute(fSpaceAttri);
fStringAttri := TSynHighlighterAttributes.Create(@SYNS_AttrString, SYNS_XML_AttrString);
fStringAttri.Foreground:=clBlue;
AddAttribute(fStringAttri);
fSymbolAttri := TSynHighlighterAttributes.Create(@SYNS_AttrSymbol, SYNS_XML_AttrSymbol);
fSymbolAttri.Foreground:=clMaroon;
AddAttribute(fSymbolAttri);
end;
procedure TSynLCHighlighter.DefineDefaultValidCaracters;
var
I: Char;
begin
for I := #0 to #255 do
begin
case I of
'_', '0'..'9', 'a'..'z', 'A'..'Z': fIdentifiers[I] := True;
else
fIdentifiers[I] := False;
end;
fNumberChar[I]:=(I in ['0'..'9']);
fSpaceChar[I]:=(I in [#1..#9, #11, #12, #14..#32]);
end;
end;
function TSynLCHighlighter.IdentKind(isAttr : Boolean; pToken : String) : TLCTokenKind;
var
aToken: String;
begin
aToken := pToken;
if aToken.isEmpty = true then
begin
aToken := getToken;
end;
if (fSettings.CaseSensitive = false) then
begin
aToken := LowerCase(aToken);
end;
Result := tLCIdentifier; // default value
if (isAttr = true) then
begin
Result := GetKindOfToken(aToken, Result, tLCAttributeName);
end
else
begin
Result := GetKindOfToken(aToken, Result);
end;
end;
function TSynLCHighlighter.IsLineEnd(pPosition: Integer): Boolean;
begin
Result := (pPosition >= fSizeCurrentLine)
or (fPCharCurrentLine[pPosition] = #10)
or (fPCharCurrentLine[pPosition] = #13);
end;
procedure TSynLCHighlighter.CommentMultiLineProc;
begin
if (rsLCComment in fRanges) = false then
begin
fTokenKind := tLCSymbol;
inc(fPositionInLine);
if (fPCharCurrentLine[fPositionInLine] = '*') then
begin
inc(fPositionInLine);
fRanges := fRanges + [rsLCComment];
fTokenKind := tLCComment;
StartLCCodeFoldBlock(cfbtLCCommentMultiLine);
CommentMultiLineProc;
end;
end
else
begin
fTokenKind := tLCComment;
while not IsLineEnd(fPositionInLine) do
begin
if (fPCharCurrentLine[fPositionInLine] = '*')
and (fPCharCurrentLine[fPositionInLine + 1] = '/') then
begin
Inc(fPositionInLine, 2);
fRanges := fRanges - [rsLCComment];
EndLCCodeFoldBlock;
break;
end;
inc(fPositionInLine);
end; // while
end; // else-if
end;
procedure TSynLCHighlighter.CommentInLineProc;
begin
fTokenKind := tLCComment;
Inc(fPositionInLine);
while (IsLineEnd(fPositionInLine) = false)
and (fPCharCurrentLine[fPositionInLine] <> '@') do
begin
Inc(fPositionInLine);
end;
if (fPCharCurrentLine[fPositionInLine] in ['@']) then
begin
Inc(fPositionInLine);
end;
end;
procedure TSynLCHighlighter.CRProc;
begin
fTokenKind := tLCSpace;
inc(fPositionInLine);
if fPCharCurrentLine[fPositionInLine] = #10 then
begin
inc(fPositionInLine);
end;
end;
procedure TSynLCHighlighter.IdentProc(isAttr:Boolean);
begin
inc(fPositionInLine);
while fIdentifiers[fPCharCurrentLine[fPositionInLine]] do
begin
inc(fPositionInLine);
end;
fTokenKind := IdentKind(isAttr);
end;
procedure TSynLCHighlighter.LFProc;
begin
fTokenKind := tLCSpace;
inc(fPositionInLine);
end;
constructor TSynLCHighlighter.Create(AOwner: TComponent);
begin
fSettings:= TSynLCHighlighterSettings.Create;
fRanges := [];
inherited Create(AOwner);
ResetArrayOfTokenDef;
CreateDefaultAttributes;
DefineDefaultValidCaracters;
end;
destructor TSynLCHighlighter.Destroy;
begin
FreeAndNil(fSettings);
inherited Destroy;
end;
procedure TSynLCHighlighter.SaveSettingsToFile(fileName: String);
begin
fSettings.SaveToFile(fileName);
end;
procedure TSynLCHighlighter.LoadSettingsFromFile(fileName: String);
begin
fSettings.LoadFromFile(fileName);
PopularArrayOfTokenDef;
UpdateAttributesBySettings;
end;
procedure TSynLCHighlighter.SetLine(const NewValue: String; LineNumber: Integer);
begin
Inherited;
fPositionInLine := 0;
fPCharCurrentLine:=PChar(NewValue);
fSizeCurrentLine :=length(NewValue);
FAtLineStart := True;
fNumberCurrentLine := LineNumber;
Next;
end;
procedure TSynLCHighlighter.Next;
var
aToken: String;
begin
fTokenStart:= fPositionInLine;
if fPositionInLine >= fSizeCurrentLine then
begin
NullProc;
exit;
end;
if (rsLCString in fRanges) then
begin
StringMutlipeLinesProc;
exit;
end;
if (rsLCComment in fRanges) then
begin
CommentMultiLineProc;
exit;
end;
if (rsLCAttrName in fRanges) then
begin
IdentProc(true);
fRanges := fRanges - [rsLCAttrName];
exit;
end;
case fPCharCurrentLine[fPositionInLine] of
'@': CommentInLineProc;
'/': CommentMultiLineProc;
'}': SymbolProc;
'{': SymbolProc;
#0: NullProc;
#10: LFProc;
#13: CRProc;
#1..#9, #11, #12, #14..#32: SpaceProc;
'0'..'9': NumberProc;
'A'..'Z', 'a'..'z', '_': IdentProc;
'>': SymbolProc;
'<': SymbolProc;
'(': SymbolProc;
')': SymbolProc;
';': SymbolProc;
'.': PointProc;
#92: StringProc; // \
']': SymbolProc;
'[': SymbolProc;
',','+','-','*','|','=': SymbolProc;
#34: StringProc; // "
else
begin
UnknownProc;
end;
end;
if fTokenKind = tLCKey then
begin
aToken := LowerCase(GetToken);
if (aToken = 'inicio') then
begin
StartLCCodeFoldBlock(cfbtLCInicioFim);
end;
if (aToken = 'fim') then
begin
EndLCCodeFoldBlock;
end;
end;
if FAtLineStart
and not(fTokenKind in [tLCSpace, tLCComment]) then
begin
FAtLineStart := False;
end;
end;
function TSynLCHighlighter.GetEol: Boolean;
begin
Result := (fTokenKind = tLCNull) and (fPositionInLine >= fSizeCurrentLine);
end;
function TSynLCHighlighter.GetToken: String;
var
Len: LongInt;
begin
Len := fPositionInLine - fTokenStart;
SetString(Result, (fPCharCurrentLine + fTokenStart), Len);
end;
procedure TSynLCHighlighter.GetTokenEx(out TokenStart: PChar; out
TokenLength: integer);
begin
TokenLength := fPositionInLine - fTokenStart;
TokenStart := nil;
if TokenLength > 0 then
begin
TokenStart := @fPCharCurrentLine[fTokenStart];
end;
end;
function TSynLCHighlighter.GetTokenPos: Integer;
begin
Result := fTokenStart;
end;
function TSynLCHighlighter.GetTokenKind: integer;
begin
Result := Ord(fTokenKind);
end;
function TSynLCHighlighter.GetTokenAttribute: TSynHighlighterAttributes;
begin
case fTokenKind of
tLCAttributeName: Result := fAttributeNameAttri;
tLCComment: Result := fCommentAttri;
tLCCustomFunction: Result := fCustomFunctionWordAttri;
tLCIdentifier: Result := fIdentifierAttri;
tLCDataType: Result := fDataTypeAttri;
tLCKey: Result := fKeyAttri;
tLCNumber: Result := fNumberAttri;
tLCReservedWord: Result := fReservedWordAttri;
tLCSpace: Result := fSpaceAttri;
tLCString: Result := fStringAttri;
tLCSymbol: Result := fSymbolAttri;
tLCUnknown: Result := fSymbolAttri;
tLCVariable: Result := fVariableAttri;
else
Result := nil;
end;
end;
function TSynLCHighlighter.GetDefaultAttribute(Index: integer): TSynHighlighterAttributes;
begin
case Index of
SYN_ATTR_COMMENT: Result := fCommentAttri;
SYN_ATTR_IDENTIFIER: Result := fIdentifierAttri;
SYN_ATTR_KEYWORD: Result := fKeyAttri;
SYN_ATTR_STRING: Result := fStringAttri;
SYN_ATTR_WHITESPACE: Result := fSpaceAttri;
SYN_ATTR_NUMBER: Result := fNumberAttri;
else
Result := nil;
end;
end;
procedure TSynLCHighlighter.SetRange(Value: Pointer);
begin
inherited SetRange(Value);
{$PUSH} {$Warnings OFF} {$Hints OFF}
fRanges := TLCRangeStates(Integer(PtrUInt(CodeFoldRange.RangeType)));
{$POP}
end;
procedure TSynLCHighlighter.ResetRange;
begin
Inherited;
fRanges := [];
end;
function TSynLCHighlighter.GetRange: Pointer;
begin
{$PUSH} {$Warnings OFF} {$Hints OFF}
CodeFoldRange.RangeType:=Pointer(PtrUInt(Integer(fRanges)));
{$POP}
Result := inherited GetRange;
end;
function TSynLCHighlighter.GetFoldConfigInstance(Index: Integer): TSynCustomFoldConfig;
begin
Result:=inherited GetFoldConfigInstance(Index);
Result.Enabled := True;
if TLCCodeFoldBlockType(Index) in [cfbtLCInicioFim, cfbtLCCommentMultiLine] then
begin
Result.Modes := Result.Modes + [fmMarkup];
end;
end;
end.
|
unit ExtraChargeGroupUnit;
interface
uses
QueryGroupUnit2, System.Classes, ExtraChargeQuery2, ExtraChargeTypeQuery,
NotifyEvents, ExtraChargeExcelDataModule, ExtraChargeInterface;
type
TExtraChargeGroup = class(TQueryGroup2, IExtraCharge)
strict private
function HaveDuplicate(const AExtraChargeTypeName, ARange: String): Boolean;
stdcall;
private
FqExtraCharge2: TQueryExtraCharge2;
FqExtraChargeType: TQueryExtraChargeType;
procedure DoAfterDelete(Sender: TObject);
protected
public
constructor Create(AOwner: TComponent); override;
procedure LoadDataFromExcelTable(AExcelTable: TExtraChargeExcelTable);
property qExtraCharge2: TQueryExtraCharge2 read FqExtraCharge2;
property qExtraChargeType: TQueryExtraChargeType read FqExtraChargeType;
end;
implementation
uses
System.SysUtils, System.Variants;
constructor TExtraChargeGroup.Create(AOwner: TComponent);
begin
inherited;
FqExtraCharge2 := TQueryExtraCharge2.Create(Self);
FqExtraChargeType := TQueryExtraChargeType.Create(Self);
QList.Add(FqExtraCharge2);
QList.Add(qExtraChargeType);
// Для каскадного удаления
TNotifyEventWrap.Create(FqExtraChargeType.W.AfterDelete, DoAfterDelete,
EventList);
end;
procedure TExtraChargeGroup.DoAfterDelete(Sender: TObject);
begin
Assert(FqExtraChargeType.W.DeletedPKValue > 0);
// На сервере оптовые наценки уже каскадно удалились
// Каскадно удаляем оптовые наценки с клиента
FqExtraCharge2.W.CascadeDelete(FqExtraChargeType.W.DeletedPKValue,
FqExtraCharge2.W.IDExtraChargeType.FieldName, True);
end;
function TExtraChargeGroup.HaveDuplicate(const AExtraChargeTypeName, ARange:
String): Boolean;
var
V: Variant;
begin
Result := False;
// Сначала ищем такой тип оптовой наценки
V := qExtraChargeType.W.Lookup(AExtraChargeTypeName);
if VarIsNull(V) then Exit;
V := qExtraCharge2.W.LookupByRange(V, ARange);
Result := not VarIsNull(V);
end;
procedure TExtraChargeGroup.LoadDataFromExcelTable(AExcelTable:
TExtraChargeExcelTable);
begin
AExcelTable.First;
while not AExcelTable.Eof do
begin
// Ищем или добавляем тип оптовой наценки
qExtraChargeType.W.LocateOrAppend(AExcelTable.ExtraChargeType.AsString);
// Если такой диапазон уже есть
if qExtraCharge2.W.LocateByRange(qExtraChargeType.W.PK.AsInteger, AExcelTable.Range.Value) then
qExtraCharge2.W.TryEdit
else
begin
qExtraCharge2.W.TryAppend;
end;
qExtraCharge2.W.IDExtraChargeType.F.AsInteger := qExtraChargeType.W.PK.AsInteger;
qExtraCharge2.W.Range.F.Value := AExcelTable.Range.Value;
qExtraCharge2.W.WholeSale.F.Value := AExcelTable.WholeSale.Value;
qExtraCharge2.W.TryPost;
AExcelTable.Next;
end;
end;
end.
|
unit Display;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
ExtCtrls;
type
TSegmenty = array[1..7] of Boolean;
TDisplay = class(TImage)
private
// Vlastnosti pre cely DISPLAY
DigitsColor, PozadieColor : TColor;
// Vlastnosti pre DISPLAY1
Cislo : array[1..11] of integer;
DesatinnaCiarka : byte;
//Vlastnosti pre DISPLAY2
Exp : array[1..3] of integer;
//Vlastnosti pre DISPLAY3
Text : string[6];
//Vlastnosti STAVOVYCH PRVKOV
Stav : boolean;
protected
procedure NakresliSevenSeg( X , Y : integer; Segmenty : TSegmenty; Zoom : real );
procedure NakresliDesatinnuCiarku( X , Y : integer; Farba : TColor );
procedure NakresliDisplay1;
procedure NakresliDisplay2;
procedure NakresliDisplay3;
procedure NakresliStavovePrvky;
procedure Paint; override;
function GetHeight : Integer;
function GetWidth : Integer;
public
procedure SetNumber( Value : Extended );
constructor Create( AOwner : TComponent ); override;
published
property Height : Integer
read GetHeight;
property Width : Integer
read GetWidth;
end;
procedure Register;
implementation
uses Math;
{/-----------------------------------------------------------------------------\
|-----------------------------------------------------------------------------|
| P R I V A T E |
|-----------------------------------------------------------------------------|
\-----------------------------------------------------------------------------/}
{/-----------------------------------------------------------------------------\
|-----------------------------------------------------------------------------|
| P R O T E C T E D |
|-----------------------------------------------------------------------------|
\-----------------------------------------------------------------------------/}
function NumberToSegment( A : integer ) : TSegmenty;
var Vystup : TSegmenty;
begin
case A of
-2 : begin
Vystup[1] := False;
Vystup[2] := False;
Vystup[3] := False;
Vystup[4] := True;
Vystup[5] := False;
Vystup[6] := False;
Vystup[7] := False;
end;
-1 : begin
Vystup[1] := False;
Vystup[2] := False;
Vystup[3] := False;
Vystup[4] := False;
Vystup[5] := False;
Vystup[6] := False;
Vystup[7] := False;
end;
0 : begin
Vystup[1] := True;
Vystup[2] := True;
Vystup[3] := True;
Vystup[4] := False;
Vystup[5] := True;
Vystup[6] := True;
Vystup[7] := True;
end;
1 : begin
Vystup[1] := False;
Vystup[2] := False;
Vystup[3] := True;
Vystup[4] := False;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := False;
end;
2 : begin
Vystup[1] := True;
Vystup[2] := False;
Vystup[3] := True;
Vystup[4] := True;
Vystup[5] := True;
Vystup[6] := False;
Vystup[7] := True;
end;
3 : begin
Vystup[1] := True;
Vystup[2] := False;
Vystup[3] := True;
Vystup[4] := True;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := True;
end;
4 : begin
Vystup[1] := False;
Vystup[2] := True;
Vystup[3] := True;
Vystup[4] := True;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := False;
end;
5 : begin
Vystup[1] := True;
Vystup[2] := True;
Vystup[3] := False;
Vystup[4] := True;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := True;
end;
6 : begin
Vystup[1] := True;
Vystup[2] := True;
Vystup[3] := False;
Vystup[4] := True;
Vystup[5] := True;
Vystup[6] := True;
Vystup[7] := True;
end;
7 : begin
Vystup[1] := True;
Vystup[2] := False;
Vystup[3] := True;
Vystup[4] := False;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := False;
end;
8 : begin
Vystup[1] := True;
Vystup[2] := True;
Vystup[3] := True;
Vystup[4] := True;
Vystup[5] := True;
Vystup[6] := True;
Vystup[7] := True;
end;
9 : begin
Vystup[1] := True;
Vystup[2] := True;
Vystup[3] := True;
Vystup[4] := True;
Vystup[5] := False;
Vystup[6] := True;
Vystup[7] := True;
end;
end;
NumberToSegment := Vystup;
end;
procedure TDisplay.NakresliSevenSeg( X , Y : integer; Segmenty : TSegmenty; Zoom : real );
type TSegmentPoly = record
Body : array[1..6] of TPoint;
end;
var SegmentyPoly : array[1..7] of TSegmentPoly;
I, J : byte;
begin
{Segment 1 :}
with SegmentyPoly[1] do
begin
Body[1].X := 2;
Body[1].Y := 2;
Body[2].X := 4;
Body[2].Y := 4;
Body[3].X := 16;
Body[3].Y := 4;
Body[4].X := 18;
Body[4].Y := 2;
Body[5].X := 16;
Body[5].Y := 0;
Body[6].X := 4;
Body[6].Y := 0;
end;
{Segment 2 :}
with SegmentyPoly[2] do
begin
Body[1].X := 2;
Body[1].Y := 2;
Body[2].X := 4;
Body[2].Y := 4;
Body[3].X := 4;
Body[3].Y := 16;
Body[4].X := 2;
Body[4].Y := 18;
Body[5].X := 0;
Body[5].Y := 16;
Body[6].X := 0;
Body[6].Y := 4;
end;
{Segment 3 :}
with SegmentyPoly[3] do
begin
Body[1].X := 18;
Body[1].Y := 2;
Body[2].X := 20;
Body[2].Y := 4;
Body[3].X := 20;
Body[3].Y := 16;
Body[4].X := 18;
Body[4].Y := 18;
Body[5].X := 16;
Body[5].Y := 16;
Body[6].X := 16;
Body[6].Y := 4;
end;
{Segment 4 :}
with SegmentyPoly[4] do
begin
Body[1].X := 2;
Body[1].Y := 18;
Body[2].X := 4;
Body[2].Y := 20;
Body[3].X := 16;
Body[3].Y := 20;
Body[4].X := 18;
Body[4].Y := 18;
Body[5].X := 16;
Body[5].Y := 16;
Body[6].X := 4;
Body[6].Y := 16;
end;
{Segment 5 :}
with SegmentyPoly[5] do
begin
Body[1].X := 2;
Body[1].Y := 18;
Body[2].X := 4;
Body[2].Y := 20;
Body[3].X := 4;
Body[3].Y := 32;
Body[4].X := 2;
Body[4].Y := 34;
Body[5].X := 0;
Body[5].Y := 32;
Body[6].X := 0;
Body[6].Y := 20;
end;
{Segment 6 :}
with SegmentyPoly[6] do
begin
Body[1].X := 18;
Body[1].Y := 18;
Body[2].X := 20;
Body[2].Y := 20;
Body[3].X := 20;
Body[3].Y := 32;
Body[4].X := 18;
Body[4].Y := 34;
Body[5].X := 16;
Body[5].Y := 32;
Body[6].X := 16;
Body[6].Y := 20;
end;
{Segment 7 :}
with SegmentyPoly[7] do
begin
Body[1].X := 2;
Body[1].Y := 34;
Body[2].X := 4;
Body[2].Y := 36;
Body[3].X := 16;
Body[3].Y := 36;
Body[4].X := 18;
Body[4].Y := 34;
Body[5].X := 16;
Body[5].Y := 32;
Body[6].X := 4;
Body[6].Y := 32;
end;
for I := 1 to 7 do
for J := 1 to 6 do
begin
SegmentyPoly[I].Body[J].X := Round( SegmentyPoly[I].Body[J].X*Zoom + X);
SegmentyPoly[I].Body[J].Y := Round( SegmentyPoly[I].Body[J].Y*Zoom + Y);
end;
for I := 1 to 7 do
with Canvas do
begin
if Segmenty[I] then
begin
Pen.Color := DigitsColor;
Brush.Color := DigitsColor;
end
else
begin
Pen.Color := PozadieColor;
Brush.Color := PozadieColor;
end;
Polygon( SegmentyPoly[I].Body );
end;
end;
procedure TDisplay.NakresliDesatinnuCiarku( X , Y : integer; Farba : TColor );
var Rect : TRect;
begin
Rect.Left := X;
Rect.Top := Y;
Rect.Right := X+3;
Rect.Bottom := Y+3;
with Canvas do
begin
Pen.Color := Farba;
Brush.Color := Farba;
FillRect( Rect );
end;
end;
procedure TDisplay.NakresliDisplay1;
var I : byte;
begin
for I := 1 to 11 do
begin
NakresliSevenSeg( 40+((I-1) * 16) , 12 , NumberToSegment( Cislo[12-I] ) , 0.5 );
if I = 11-DesatinnaCiarka then NakresliDesatinnuCiarku( 52+(I * 16) , 30 , DigitsColor )
else NakresliDesatinnuCiarku( 52+(I * 16) , 30 , PozadieColor );
end;
end;
procedure TDisplay.NakresliDisplay2;
var I : byte;
begin
for I := 1 to 3 do
begin
NakresliSevenSeg( 216+((I-1) * 10 ) , 8 , NumberToSegment( Exp[4-I] ) , 0.3 );
end;
end;
procedure TDisplay.NakresliDisplay3;
begin
with Canvas do
begin
Pen.Color := DigitsColor;
Brush.Color := PozadieColor;
TextOut( 5 , 18 , Text );
end;
end;
procedure TDisplay.NakresliStavovePrvky;
begin
with Canvas do
begin
Pen.Color := DigitsColor;
Brush.Color := PozadieColor;
if Stav then TextOut( 5 , 2 , 'DEG' )
else TextOut( 5 , 2 , 'RAD' );
end;
end;
procedure TDisplay.Paint;
begin
Canvas.Pen.Color := DigitsColor;
Canvas.Brush.Color := PozadieColor;
Canvas.FillRect( ClientRect );
NakresliDisplay1;
NakresliDisplay2;
NakresliDisplay3;
NakresliStavovePrvky;
inherited Paint;
end;
function TDisplay.GetHeight : Integer;
begin
GetHeight := 40;
end;
function TDisplay.GetWidth : Integer;
begin
GetWidth := 250;
end;
{/-----------------------------------------------------------------------------\
|-----------------------------------------------------------------------------|
| P U B L I C |
|-----------------------------------------------------------------------------|
\-----------------------------------------------------------------------------/}
procedure TDisplay.SetNumber( Value : Extended );
var I : byte;
PocetCelych : integer;
PocetDesatinnych : integer;
A : extended;
B, C : cardinal;
Zaporne : boolean;
begin
Zaporne := False;
if Value < 0 then
begin
Zaporne := True;
Value := Abs( Value );
end;
if Value < 1 then
begin
PocetCelych := 0;
PocetDesatinnych := -Round(Int(Log10( Value )))
end
else
begin
PocetCelych := Round(Int(Log10( Value )+1));
PocetDesatinnych := -Round(Int(Log10( Frac(Value))-1));
end;
end;
constructor TDisplay.Create( AOwner : TComponent );
var Value : Extended;
begin
DigitsColor := clBlack;
PozadieColor := clWhite;
inherited Create( AOwner );
inherited Width := 250;
inherited Height := 40;
Value := 0.00000001;
Value := Value * 0.000001;
SetNumber( Value );
end;
procedure Register;
begin
RegisterComponents('Samples', [TDisplay]);
end;
end.
|
unit UWindowReservationForm;
interface
uses
System.SysUtils, System.Types, System.UITypes, System.Classes,
System.Variants,
FMX.Types, FMX.Controls, FMX.Forms, FMX.Graphics, FMX.Dialogs, FMX.ListBox,
FMX.Layouts, FMX.ScrollBox, FMX.Memo, FMX.StdCtrls, FMX.Controls.Presentation,
FMX.Edit, System.Rtti, System.Bindings.Outputs, FMX.Bind.Editors,
Data.Bind.EngExt, FMX.Bind.DBEngExt, Data.Bind.Components, UWindowDMForm,
Data.Bind.DBScope, FMX.Effects;
type
TWindowReservationForm = class(TForm)
Panel1: TPanel;
ToolBar1: TToolBar;
LbReservation: TLabel;
Memo1: TMemo;
ListBox1: TListBox;
ListBoxItem1: TListBoxItem;
ListBoxItem2: TListBoxItem;
ListBoxItem3: TListBoxItem;
ListBoxItem4: TListBoxItem;
ListBoxItem5: TListBoxItem;
ListBoxItem6: TListBoxItem;
ListBoxItem7: TListBoxItem;
eR_Date: TEdit;
eR_Time: TEdit;
eR_Name: TEdit;
eR_Phone: TEdit;
eR_Memo: TEdit;
ListBoxItem8: TListBoxItem;
LbTotalCost: TLabel;
CbR_Number: TComboBox;
CbR_Resvp: TComboBox;
Label2: TLabel;
Label3: TLabel;
BindingsList1: TBindingsList;
CbReservation: TCornerButton;
CbCancel: TCornerButton;
BindSourceDB1: TBindSourceDB;
BindSourceDB2: TBindSourceDB;
LinkControlToField2: TLinkControlToField;
LinkControlToField3: TLinkControlToField;
LinkControlToField4: TLinkControlToField;
LinkControlToField5: TLinkControlToField;
LinkControlToField1: TLinkControlToField;
Panel2: TPanel;
Label1: TLabel;
Memo2: TMemo;
Panel3: TPanel;
Label4: TLabel;
Memo3: TMemo;
BevelEffect1: TBevelEffect;
StyleBook1: TStyleBook;
procedure FormClose(Sender: TObject; var Action: TCloseAction);
procedure CbReservationClick(Sender: TObject);
procedure FormCreate(Sender: TObject);
procedure CbR_ResvpChange(Sender: TObject);
procedure CbR_NumberChange(Sender: TObject);
procedure CbCancelClick(Sender: TObject);
private
{ Private declarations }
FTotalCost: Integer;
public
{ Public declarations }
procedure Calc_Price();
procedure SetInitData(const AClassNum: Integer; const ADate: TDatetime; const ATime: string);
end;
var
WindowReservationForm: TWindowReservationForm;
implementation
{$R *.fmx}
uses UWindowMainForm;
procedure TWindowReservationForm.Calc_Price;
var
Cost: Integer;
begin
case CbR_Number.ItemIndex of
0:
Cost := 55000;
1:
Cost := 110000;
2:
Cost := 130000;
3:
Cost := 200000;
end;
FTotalCost := Cost * (CbR_Resvp.ItemIndex + 1);
LbTotalCost.Text := Format('%d 원', [FTotalCost]);
{
if CbR_Number.ItemIndex = 0 then
begin
LbTotalCost.Text := inttostr(55000 * (CbR_Resvp.ItemIndex + 1)) + '원';
end;
if CbR_Number.ItemIndex = 1 then
begin
LbTotalCost.Text := inttostr(110000 * (CbR_Resvp.ItemIndex + 1)) + '원';
end;
if CbR_Number.ItemIndex = 2 then
begin
LbTotalCost.Text := inttostr(130000 * (CbR_Resvp.ItemIndex + 1)) + '원';
end;
if CbR_Number.ItemIndex = 3 then
begin
LbTotalCost.Text := inttostr(200000 * (CbR_Resvp.ItemIndex + 1)) + '원';
end;
}
end;
procedure TWindowReservationForm.CbCancelClick(Sender: TObject);
begin
DataModule1.CdsReservationInfo.Cancel;
WindowReservationForm.Close;
end;
procedure TWindowReservationForm.CbReservationClick(Sender: TObject);
begin
if CbR_Number.ItemIndex = -1 then
begin
ShowMessage('강습 횟수를 선택 해 주세요.');
CbR_Number.SetFocus;
Exit;
end;
if CbR_Resvp.ItemIndex = -1 then
begin
ShowMessage('강습 인원을 선택 해 주세요.');
CbR_Resvp.SetFocus;
Exit;
end;
if eR_Name.Text = '' then
begin
ShowMessage('예약자명을 기입 해 주세요.');
eR_Name.SetFocus;
Exit;
end;
if eR_Phone.Text = '' then
begin
ShowMessage('연락처를 기입 해 주세요.');
eR_Phone.SetFocus;
Exit;
end;
DataModule1.CdsReservationInfo.FieldByName('R_TotalClassCost').AsInteger :=
FTotalCost;
case CbR_Number.ItemIndex of
0:
DataModule1.CdsReservationInfo.FieldByName('R_ClassNumber')
.AsInteger := 1;
1:
DataModule1.CdsReservationInfo.FieldByName('R_ClassNumber')
.AsInteger := 2;
2:
DataModule1.CdsReservationInfo.FieldByName('R_ClassNumber')
.AsInteger := 3;
3:
DataModule1.CdsReservationInfo.FieldByName('R_ClassNumber')
.AsInteger := 5;
end;
DataModule1.CdsReservationInfo.FieldByName('R_ResvP').AsInteger :=
CbR_Resvp.ItemIndex + 1;
DataModule1.CdsReservationInfo.Post;
DataModule1.CdsReservationInfo.ApplyUpdates(-1); // 서버에 반영
// DataModule1.CdsReservationInfo.Refresh; // 서버와 동기화
DataModule1.CdsReservationInfo.Refresh;
ShowMessage(' ♥예약 해 주셔서 감사합니다.(o^▽^o)♪♥'
+#13+'1 회 강습 신청 후 3 회, 5 회로 연장하실 때는 차액만 지불하시면 됩니다.'
+#13+'예약 후입금하셔야 예약완료 됩니다.'
+#13+'3 회 이상 강습 받으시는 분은 원하는 날짜 원하는 시간에 강습 가능합니다.'
+#13+'강습 시 모든 렌탈 비용은 강습비에 포함되어 있습니다.'
+#13+'10인 이상 단체 강습은 예약 후 전화 문의 주세요. (Tel. 051-701-4851)'
+#13+' = 입금 계좌(IBK 기업은행) : 051-701-4851 / 예금주: SURF =');
Close;
end;
procedure TWindowReservationForm.CbR_NumberChange(Sender: TObject);
begin
Calc_Price;
end;
procedure TWindowReservationForm.CbR_ResvpChange(Sender: TObject);
begin
Calc_Price;
end;
procedure TWindowReservationForm.FormClose(Sender: TObject;
var Action: TCloseAction);
begin
// Action :=CaFree;
DataModule1.CdsReservationInfo.Cancel;
end;
procedure TWindowReservationForm.FormCreate(Sender: TObject);
begin
DataModule1.CdsReservationInfo.Insert;
Calc_Price;
// LbTotalCost.Text := '55,000 원';
// Calc_Price;
{ if CbR_Number.ItemIndex = 0 then
begin
LbTotalCost.Text := inttostr(55000 * (CbR_Resvp.ItemIndex + 1)) + '원';
end; }
end;
procedure TWindowReservationForm.SetInitData(const AClassNum: Integer; const ADate: TDatetime;
const ATime: string);
begin
DataModule1.CdsReservationInfo.FieldByName('C_Num').AsInteger := AClassNum;
DataModule1.CdsReservationInfo.FieldByName('R_DATE').AsDateTime := ADate;
DataModule1.CdsReservationInfo.FieldByName('R_TIME').AsString := ATime;
// DataModule1.CdsReservationInfo.FieldByName('R_TotalClassCost').AsInteger := 55000;
end;
end.
|
unit TestViewer;
interface
uses
Vcl.Forms, Sparkle.Http.Client,{} Vcl.StdCtrls, Vcl.Controls, System.Classes,
IdUDPServer, IdGlobal, IdSocketHandle, IdBaseComponent, IdComponent, IdUDPBase;
type
TfrmTestViewer = class(TForm)
cbUrl: TComboBox;
Label1: TLabel;
btGo: TButton;
Label2: TLabel;
btnUDP: TButton;
Memo1: TMemo;
Memo2: TMemo;
procedure btGoClick(Sender: TObject);
procedure FormCreate(Sender: TObject);
procedure FormDestroy(Sender: TObject);
procedure btnUDPClick(Sender: TObject);
private
{ Private declarations }
FClient: THttpClient;
procedure DoRequest;
procedure DoReadParameters;
procedure FillResponse(Resp: THttpResponse);
public
{ Public declarations }
end;
var
frmTestViewer: TfrmTestViewer;
implementation
uses Vcl.Dialogs, ShellApi, System.SysUtils, Winapi.Windows;
{$R *.dfm}
procedure TfrmTestViewer.btGoClick(Sender: TObject);
begin
DoRequest;
end;
procedure TfrmTestViewer.btnUDPClick(Sender: TObject);
begin
DoReadParameters;
end;
procedure TfrmTestViewer.DoReadParameters;
var
Req: THttpRequest;
Resp: THttpResponse;
I: integer;
HeaderName, HeaderValue: string;
FOutputStream: TStringStream;
lParameters: TStringList;
bt: TBytes;
begin
Resp := nil;
Req := FClient.CreateRequest;
try
// set uri
Req.Uri := cbUrl.Text;
// set request method
Req.Method := 'GET';
Req.Headers.SetValue('content-type', 'text/plain');
// perform request
Resp := FClient.Send(Req);
// Fill response
Memo1.Clear;
FOutputStream := TStringStream.Create;
lParameters := TStringList.Create;
try
bt := Resp.ContentAsBytes;
FOutputStream.WriteBuffer(bt,Length(bt));
lParameters.Text := FOutputStream.DataString;
for i:=0 to lParameters.Count-1 do
begin
Memo1.Lines.Add( lParameters[i] );
end;
finally
FOutputStream.Free;
lParameters.Free;
end;
finally
Req.Free;
Resp.Free;
end;
end;
procedure TfrmTestViewer.DoRequest;
var
Req: THttpRequest;
Resp: THttpResponse;
I: integer;
HeaderName, HeaderValue: string;
url: string;
function MyEncodeUrl(source:string):string;
var i:integer;
begin
result := '';
for i := 1 to length(source) do
if not (source[i] in ['A'..'Z','a'..'z','0','1'..'9','-','_','~','.']) then result := result + '%'+inttohex(ord(source[i]),2) else result := result + source[i];
end;
begin
Resp := nil;
Req := FClient.CreateRequest;
try
// set uri
url := cbUrl.Text;
if Memo1.Lines.Count>0 then
begin
url := url + '?';
for i:=0 to Memo1.Lines.Count-1 do
begin
if i>0 then
url := url + '&';
url := url + Memo1.Lines[i] + '=' + MyEncodeUrl(Memo2.Lines[i]);
end;
end;
Req.Uri := url;
// set request method
Req.Method := 'GET';
Req.Headers.SetValue('content-type', 'application/pdf');
// perform request
Resp := FClient.Send(Req);
// Fill response
FillResponse(Resp);
finally
Req.Free;
Resp.Free;
end;
end;
procedure TfrmTestViewer.FillResponse(Resp: THttpResponse);
const
cFileExtension = 'pdf';
cFileFilter = 'Adobe Acrobat file (*.pdf)|*.pdf';
var
FOutputStream: TMemoryStream;
bt: TBytes;
lSaveDlg: TSaveDialog;
begin
FOutputStream := TMemoryStream.Create;
try
bt := Resp.ContentAsBytes;
FOutputStream.WriteBuffer(bt,Length(bt));
// create and display Save To File dialog
lSaveDlg := TSaveDialog.Create(Application);
lSaveDlg.DefaultExt := cFileExtension;
lSaveDlg.Filter := cFileFilter;
lSaveDlg.Options := [ofOverWritePrompt, ofPathMustExist, ofHideReadOnly];
lSaveDlg.FileName := ExtractFilePath(ParamStr(0)) + 'TestDoc.pdf';
if lSaveDlg.Execute then
begin
// save the output stream to the file
FOutputStream.Position := 0;
FOutputStream.SaveToFile(lSaveDlg.FileName);
if FileExists(lSaveDlg.FileName) then
ShellExecute(0, PChar('open'), PChar(lSaveDlg.FileName), PChar(''), PChar(ExtractFilePath(lSaveDlg.FileName)), SW_SHOWNORMAL)
else
ShowMessage('No file exists: ' + lSaveDlg.FileName);
end;
finally
FOutputStream.Free;
end;
end;
procedure TfrmTestViewer.FormCreate(Sender: TObject);
begin
FClient := THttpClient.Create;
end;
procedure TfrmTestViewer.FormDestroy(Sender: TObject);
begin
FClient.Free;
end;
end.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.