Моисеев В.С. 250504

src/demo/parallel/Complex.java

@@ -93,4 +93,32 @@ public Complex times(Complex b) {
     public double lengthSQ() {
         return re * re + im * im;
     }
+
+    public Complex divide(Complex b) {
+        double denom = b.re * b.re + b.im * b.im;
+        double real = (re * b.re + im * b.im) / denom;
+        double imag = (im * b.re - re * b.im) / denom;
+        return new Complex(real, imag);
+    }
+
+    public double modulus() {
+        return Math.sqrt(re * re + im * im);
+    }
+
+    public Complex pow(int n) {
+        Complex result = new Complex(1, 0);
+        Complex base = this;
+        for (int i = 0; i < n; i++) {
+            result = result.times(base);
+        }
+        return result;
+    }
+
+    public double getRe() {
+        return re;
+    }
+
+    public double getIm() {
+        return im;
+    }
 }

src/demo/parallel/MandelbrotSetTask.java

@@ -38,22 +38,6 @@
 import javafx.scene.paint.Color;
 
 
-/**
- * Task to render Mandelbrot set using given parameters. See {@link 
- * #MandelbrotRendererTask(boolean, javafx.scene.image.PixelWriter, int, int, 
- * double, double, double, double, double, double, double, double, boolean) 
- * constructor} for parameters list. The task returns time in milliseconds as 
- * its calculated value.
- * 
- * <p><i>
- * This source code is provided to illustrate the usage of a given feature
- * or technique and has been deliberately simplified. Additional steps
- * required for a production-quality application, such as security checks,
- * input validation and proper error handling, might not be present in
- * this sample code.</i>
- * 
- * @author Alexander Kouznetsov, Tristan Yan
- */
 class MandelbrotSetTask extends Task<Long> {
 
     /**
@@ -275,7 +259,7 @@ private int calc(Complex comp) {
         int count = 0;
         Complex c = new Complex(0, 0);
         do {
-            c = c.times(c).plus(comp);
+            c = c.times(comp).plus(comp);
             count++;
         } while (count < CAL_MAX_COUNT && c.lengthSQ() < LENGTH_BOUNDARY);
         return count;
@@ -352,11 +336,11 @@ private Color getColor(int count) {
          */
         Color[] cc = {
             Color.rgb(40, 0, 0),
-            Color.RED,
+            Color.BLUE,
             Color.WHITE,
-            Color.RED,
+            Color.BLUE,
             Color.rgb(100, 0, 0),
-            Color.RED,
+            Color.BLUE,
             Color.rgb(50, 0, 0)
         };
 

src/test/demo/parallel/ComplexTest.java

@@ -0,0 +1,27 @@
+package test.demo.parallel;
+import demo.parallel.Complex;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+public class ComplexTest {
+    @Test
+    void testDivide() {
+        Complex c1 = new Complex(2, 3);
+        Complex c2 = new Complex(1, -1);
+        Complex result = c1.divide(c2);
+        assertEquals(-0.5, result.getRe(), 1e-9);
+        assertEquals(2.5, result.getIm(), 1e-9);
+    }
+    @Test
+    void testModulus() {
+        Complex c = new Complex(3, 4);
+        double result = c.modulus();
+        assertEquals(5, result, 1e-9); // 5.0 is the modulus of 3 + 4i
+    }
+    @Test
+    void testPow() {
+        Complex c = new Complex(2, 3);
+        Complex result = c.pow(2);
+        assertEquals(-5, result.getRe());
+        assertEquals(12, result.getIm());
+    }
+}