File: recursivemtp1.lpr

package info (click to toggle)
lazarus 2.0.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 214,460 kB
  • sloc: pascal: 1,862,622; xml: 265,709; cpp: 56,595; sh: 3,008; java: 609; makefile: 535; perl: 297; sql: 222; ansic: 137
file content (49 lines) | stat: -rw-r--r-- 1,156 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
program RecursiveMTP1;

{$mode objfpc}{$H+}

uses
  {$IFDEF UNIX}
  cthreads, cmem,
  {$ENDIF}
  MTProcs;

type
  TArrayOfInteger = array of integer;
var
  Items: TArrayOfInteger;

type
  TFindMaximumParallelData = record
    Items: TArrayOfInteger;
    Left, Middle, Right: integer;
    LeftMaxIndex, RightMaxIndex: integer;
  end;
  PFindMaximumParallelData = ^TFindMaximumParallelData;

procedure FindMaximumParallel(Index: PtrInt; Data: Pointer; Item: TMultiThreadProcItem);
var
  Params: PFindMaximumParallelData absolute Data;
  LeftParams, RightParams: TFindMaximumParallelData;
begin
  if Params^.Left+1000>Params^.Right then begin
    // compute the maximum of the few remaining items
    Params^.LeftMaxIndex:=Params^.Items[Params^.Left];
    for i:=Params^.Left+1 to Params^.Right do
      if Params^.Items[i]>Params^.LeftMaxIndex then
  end else begin

  end;
end;

function FindMaximumIndex(Items: TArrayOfInteger): integer;
begin

end;

begin
  SetLength(Items,10000000);
  for i:=0 to length(Items)-1 do Items[i]:=Random(1000);
  ProcThreadPool.DoParallel(@DoSomethingParallel,1,5,nil); // address, startindex, endindex, optional data
end.