Prepare Primes example in Pascal

Author: martinweismann

Examples/Primes/LibPrimes_component/Implementations/Pascal/Stub/libprimes_impl.pas

@@ -22,6 +22,8 @@ interface
   libprimes_types,
   libprimes_exception,
   libprimes_interfaces,
+  libprimes_impl_factorizationcalculator,
+  libprimes_impl_sievecalculator,
   Classes,
   sysutils;
 
@@ -49,7 +51,7 @@ class procedure TLibPrimesWrapper.GetVersion(out AMajor: Cardinal; out AMinor: C
 
 class function TLibPrimesWrapper.GetLastError(AInstance: TObject; out AErrorMessage: String): Boolean;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  result := (AInstance as ILibPrimesBase).GetLastErrorMessage(AErrorMessage);
 end;
 
 class procedure TLibPrimesWrapper.AcquireInstance(AInstance: TObject);
@@ -64,12 +66,12 @@ class procedure TLibPrimesWrapper.ReleaseInstance(AInstance: TObject);
 
 class function TLibPrimesWrapper.CreateFactorizationCalculator(): TObject;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  result := TLibPrimesFactorizationCalculator.Create();
 end;
 
 class function TLibPrimesWrapper.CreateSieveCalculator(): TObject;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  result := TLibPrimesSieveCalculator.Create();
 end;
 
 class procedure TLibPrimesWrapper.SetJournal(const AFileName: String);

Examples/Primes/LibPrimes_component/Implementations/Pascal/Stub/libprimes_impl_calculator.pas

@@ -26,34 +26,35 @@   TLibPrimesCalculator = class(TLibPrimesBase, ILibPrimesCalculator)
     private
 
     protected
-
+      FValue : QWord;
+      FProgressCallback: PLibPrimes_ProgressCallback;
     public
       function GetValue(): QWord;
       procedure SetValue(const AValue: QWord);
-      procedure Calculate();
+      procedure Calculate(); virtual;
       procedure SetProgressCallback(const AProgressCallback: PLibPrimes_ProgressCallback);
   end;
 
 implementation
 
 function TLibPrimesCalculator.GetValue(): QWord;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  result := FValue;
 end;
 
 procedure TLibPrimesCalculator.SetValue(const AValue: QWord);
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  FValue := AValue;
 end;
 
 procedure TLibPrimesCalculator.Calculate();
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  raise ELibPrimesException.Create(LIBPRIMES_ERROR_NOTIMPLEMENTED);
 end;
 
 procedure TLibPrimesCalculator.SetProgressCallback(const AProgressCallback: PLibPrimes_ProgressCallback);
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  FProgressCallback:=AProgressCallback
 end;
 
 end.

Examples/Primes/LibPrimes_component/Implementations/Pascal/Stub/libprimes_impl_factorizationcalculator.pas

@@ -24,18 +24,78 @@ interface
 type
   TLibPrimesFactorizationCalculator = class(TLibPrimesCalculator, ILibPrimesFactorizationCalculator)
     private
-
+      FPrimeFactors : Array Of TLibPrimesPrimeFactor;
     protected
 
     public
+      destructor Destroy(); override;
       procedure GetPrimeFactors(const APrimeFactorsCount: QWord; PPrimeFactorsNeededCount: PQWord; APrimeFactors: PLibPrimesPrimeFactor);
+      procedure Calculate(); override;
   end;
 
 implementation
 
+destructor TLibPrimesFactorizationCalculator.Destroy();
+begin
+  SetLength(FPrimeFactors, 0);
+  inherited Destroy();
+end;
+
 procedure TLibPrimesFactorizationCalculator.GetPrimeFactors(const APrimeFactorsCount: QWord; PPrimeFactorsNeededCount: PQWord; APrimeFactors: PLibPrimesPrimeFactor);
+var
+  i : QWord;
+begin
+  if (Length(FPrimeFactors) = 0) then
+    raise ELibPrimesException.Create(LIBPRIMES_ERROR_NORESULTAVAILABLE);
+
+  if (assigned(PPrimeFactorsNeededCount)) then
+     PPrimeFactorsNeededCount^ := Length(FPrimeFactors);
+
+  if (APrimeFactorsCount >= Length(FPrimeFactors)) then
+  begin
+    for i:=0 to Length(FPrimeFactors) -1 do begin
+      APrimeFactors^ := FPrimeFactors[i];
+      inc(APrimeFactors);
+    end;
+  end;
+end;
+
+procedure TLibPrimesFactorizationCalculator.Calculate();
+var
+  AValue: QWord;
+  I: QWord;
+  APFCount: QWord;
+  APrimeFactor: TLibPrimesPrimeFactor;
+  AShouldAbort: Byte;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  SetLength(FPrimeFactors, 0);
+
+  APFCount := 0;
+  AValue := FValue;
+  I := 2;
+  while I < AValue
+  do begin
+    if (assigned(FProgressCallback)) then begin
+    	AShouldAbort := 0;
+			FProgressCallback(1 - 1.0*AValue / FValue, AShouldAbort);
+			if (AShouldAbort <> 0) then
+				raise ELibPrimesException.Create(LIBPRIMES_ERROR_CALCULATIONABORTED);
+    end;
+
+    APrimeFactor.FMultiplicity:=0;
+    APrimeFactor.FPrime:=I;
+    while (AValue mod i = 0) do begin
+      inc(APrimeFactor.FMultiplicity);
+      AValue := AValue div I;
+    end;
+    if (APrimeFactor.FMultiplicity > 0) then begin
+      inc(APFCount);
+      SetLength(FPrimeFactors, APFCount);
+      FPrimeFactors[APFCount-1] := APrimeFactor;
+    end;
+    inc(I);
+  end;
 end;
 
 end.
+

Examples/Primes/LibPrimes_component/Implementations/Pascal/Stub/libprimes_impl_sievecalculator.pas

@@ -24,18 +24,79 @@ interface
 type
   TLibPrimesSieveCalculator = class(TLibPrimesCalculator, ILibPrimesSieveCalculator)
     private
-
+      FPrimes: array of QWord;
     protected
 
     public
+      destructor Destroy(); override;
       procedure GetPrimes(const APrimesCount: QWord; PPrimesNeededCount: PQWord; APrimes: PQWord);
+      procedure Calculate(); override;
   end;
 
 implementation
 
+destructor TLibPrimesSieveCalculator.Destroy();
+begin
+  SetLength(FPrimes, 0);
+  inherited Destroy();
+end;
+
 procedure TLibPrimesSieveCalculator.GetPrimes(const APrimesCount: QWord; PPrimesNeededCount: PQWord; APrimes: PQWord);
+var
+  i : QWord;
 begin
-  raise ELibPrimesException.Create (LIBPRIMES_ERROR_NOTIMPLEMENTED);
+  if (Length(FPrimes) = 0) then
+    raise ELibPrimesException.Create(LIBPRIMES_ERROR_NORESULTAVAILABLE);
+
+  if (assigned(PPrimesNeededCount)) then
+     PPrimesNeededCount^ := Length(FPrimes);
+
+  if (APrimesCount >= Length(FPrimes)) then
+  begin
+    for i:=0 to Length(FPrimes) -1 do begin
+      APrimes^ := FPrimes[i];
+      inc(APrimes);
+    end;
+  end;
+end;
+
+procedure TLibPrimesSieveCalculator.Calculate();
+var
+  AStrikenOut : array of Boolean;
+  I, J : QWord;
+  ASqrtValue : QWord;
+  ANumPrimes: QWord;
+begin
+  SetLength(FPrimes, 0);
+  ANumPrimes := 0;
+
+  SetLength(AStrikenOut, FValue + 1);
+  for I := 0 to FValue do begin
+    AStrikenOut[I] := I < 2;
+  end;
+
+  ASqrtValue := round(sqrt(FValue));
+
+  for I := 2 to ASqrtValue do begin
+    if not AStrikenOut[I] then begin
+      inc(ANumPrimes);
+      SetLength(FPrimes, ANumPrimes);
+      FPrimes[ANumPrimes - 1] := I;
+      J := I*I;
+      while (J <= FValue) do begin
+        AStrikenOut[j] := true;
+        inc(J, I);
+      end;
+    end;
+  end;
+
+  for I:= ASqrtValue to FValue do begin
+    if not AStrikenOut[i] then begin
+      inc(ANumPrimes);
+      SetLength(FPrimes, ANumPrimes);
+      FPrimes[ANumPrimes - 1] := I;
+    end;
+  end;
 end;
 
 end.