CODE_METRICS.md

Code Metrics

This file is dynamically maintained by a bot, please do not edit this by hand. It represents various code metrics, such as cyclomatic complexity, maintainability index, and so on.

Benchmarks ✔️

The Benchmarks.csproj project file contains:

• 1 namespaces.
• 5 named types.
• 112 total lines of source code.
• Approximately 32 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Aptacode.Geometry.Benchmarks ✔️

The Aptacode.Geometry.Benchmarks namespace contains 5 named types.

• 5 named types.
• 112 total lines of source code.
• Approximately 32 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

CreationBenchmark ✔️

• The CreationBenchmark contains 4 members.
• 27 total lines of source code.
• Approximately 6 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	17	93	1 ✔️	0	3	5 / 1
Method	11	100	1 ✔️	0	3	5 / 1
Method	23	93	1 ✔️	0	3	5 / 1
Method	29	93	1 ✔️	0	3	5 / 1

🔗 to CreationBenchmark class diagram

🔝 back to Aptacode.Geometry.Benchmarks

EllipseCollisionBenchmarks ✔️

• The EllipseCollisionBenchmarks contains 2 members.
• 18 total lines of source code.
• Approximately 8 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	12	78	1 ✔️	0	2	7 / 4
Method	22	88	1 ✔️	0	4	6 / 2

🔗 to EllipseCollisionBenchmarks class diagram

🔝 back to Aptacode.Geometry.Benchmarks

FastAndDirtyConfig ✔️

• The FastAndDirtyConfig contains 1 members.
• 14 total lines of source code.
• Approximately 2 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	9	86	1 ✔️	0	1	11 / 2

🔗 to FastAndDirtyConfig class diagram

🔝 back to Aptacode.Geometry.Benchmarks

PointCollisionBenchmarks ✔️

• The PointCollisionBenchmarks contains 4 members.
• 33 total lines of source code.
• Approximately 14 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	12	78	1 ✔️	0	2	7 / 4
Method	20	76	1 ✔️	0	2	7 / 4
Method	30	88	1 ✔️	0	4	6 / 2
Method	37	88	1 ✔️	0	4	6 / 2

🔗 to PointCollisionBenchmarks class diagram

🔝 back to Aptacode.Geometry.Benchmarks

Program ✔️

• The Program contains 1 members.
• 10 total lines of source code.
• Approximately 2 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	8	86	1 ✔️	0	3	7 / 2

🔗 to Program class diagram

🔝 back to Aptacode.Geometry.Benchmarks

🔝 back to Benchmarks

Demo ✔️

The Demo.csproj project file contains:

• 3 namespaces.
• 12 named types.
• 611 total lines of source code.
• Approximately 248 lines of executable code.
• The highest cyclomatic complexity is 7 ✔️.

<global namespace> ✔️

The <global namespace> namespace contains 1 named types.

• 1 named types.
• 12 total lines of source code.
• Approximately 14 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

<Program>$ ✔️

• The <Program>$ contains 1 members.
• 12 total lines of source code.
• Approximately 14 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	1	72	1 ✔️	0	4	12 / 7

🔝 back to <global namespace>

Aptacode.Geometry.Demo.Pages.Benchmark ✔️

The Aptacode.Geometry.Demo.Pages.Benchmark namespace contains 8 named types.

• 8 named types.
• 337 total lines of source code.
• Approximately 122 lines of executable code.
• The highest cyclomatic complexity is 6 ✔️.

BenchmarkBase ✔️

• The BenchmarkBase contains 8 members.
• 57 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	7	93	0 ✔️	0	0	1 / 1
Property	17	100	2 ✔️	0	3	5 / 1
Method	48	85	1 ✔️	0	1	6 / 3
Method	41	85	1 ✔️	0	1	6 / 3
Method	55	85	1 ✔️	0	1	6 / 3
Method	30	74	1 ✔️	0	3	10 / 4
Field	11	93	0 ✔️	0	3	1 / 1
Method	21	75	1 ✔️	0	8	10 / 4

🔗 to BenchmarkBase class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

GeometryProfileFunctions ✔️

• The GeometryProfileFunctions contains 1 members.
• 52 total lines of source code.
• Approximately 25 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	9	50	1 ✔️	0	11	49 / 25

🔗 to GeometryProfileFunctions class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

PrimitiveCreation<T> ✔️

• The PrimitiveCreation<T> contains 7 members.
• 49 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 6 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	7	100	0 ✔️	0	2	1 / 0
Field	8	100	0 ✔️	0	0	1 / 0
Field	9	93	0 ✔️	0	1	1 / 1
Method	11	58	6 ✔️	0	10	27 / 16
Method	49	96	1 ✔️	0	3	4 / 1
Method	44	96	1 ✔️	0	1	4 / 1
Method	39	100	1 ✔️	0	0	4 / 1

🔗 to PrimitiveCreation<T> class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

PrimitiveFunction<T> ✔️

• The PrimitiveFunction<T> contains 11 members.
• 60 total lines of source code.
• Approximately 22 lines of executable code.
• The highest cyclomatic complexity is 6 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	7	100	0 ✔️	0	2	1 / 0
Field	8	100	0 ✔️	0	0	1 / 0
Field	11	100	0 ✔️	0	0	1 / 0
Field	9	100	0 ✔️	0	0	1 / 0
Field	10	100	0 ✔️	0	1	1 / 0
Field	12	100	0 ✔️	0	1	1 / 0
Method	14	56	6 ✔️	0	11	30 / 18
Method	55	93	1 ✔️	0	3	4 / 1
Method	60	96	1 ✔️	0	2	4 / 1
Method	50	96	1 ✔️	0	1	4 / 1
Method	45	94	1 ✔️	0	0	4 / 1

🔗 to PrimitiveFunction<T> class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

ProfileFunction ✔️

• The ProfileFunction contains 4 members.
• 14 total lines of source code.
• Approximately 0 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	11	100	1 ✔️	0	0	3 / 0
Method	15	100	1 ✔️	0	0	1 / 0
Method	7	100	1 ✔️	0	0	3 / 0
Method	5	100	1 ✔️	0	0	1 / 0

🔗 to ProfileFunction class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

ProfileFunctionResult ✔️

• The ProfileFunctionResult contains 6 members.
• 6 total lines of source code.
• Approximately 6 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	3	100	1 ✔️	0	1	6 / 0
Property	7	100	2 ✔️	0	2	1 / 2
Property	3	100	0 ✔️	0	1	1 / 0
Property	5	100	2 ✔️	0	2	1 / 2
Property	6	100	2 ✔️	0	2	1 / 2
Property	3	100	0 ✔️	0	0	1 / 0

🔗 to ProfileFunctionResult class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

ProfileHelpers ✔️

• The ProfileHelpers contains 4 members.
• 36 total lines of source code.
• Approximately 10 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	8	100	1 ✔️	0	3	4 / 1
Method	14	100	1 ✔️	0	3	4 / 1
Method	20	74	2 ✔️	0	4	10 / 4
Method	31	74	2 ✔️	0	4	10 / 4

🔗 to ProfileHelpers class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

ProfileRunner ✔️

• The ProfileRunner contains 3 members.
• 49 total lines of source code.
• Approximately 19 lines of executable code.
• The highest cyclomatic complexity is 5 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	7	100	0 ✔️	0	2	1 / 0
Method	9	96	1 ✔️	0	2	4 / 1
Method	14	56	5 ✔️	0	7	39 / 18

🔗 to ProfileRunner class diagram

🔝 back to Aptacode.Geometry.Demo.Pages.Benchmark

Aptacode.Geometry.Demo.Pages ✔️

The Aptacode.Geometry.Demo.Pages namespace contains 3 named types.

• 3 named types.
• 262 total lines of source code.
• Approximately 112 lines of executable code.
• The highest cyclomatic complexity is 7 ✔️.

AsciiBase ✔️

• The AsciiBase contains 10 members.
• 100 total lines of source code.
• Approximately 43 lines of executable code.
• The highest cyclomatic complexity is 6 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	12	93	0 ✔️	0	0	1 / 1
Method	85	66	4 ✔️	0	3	16 / 6
Method	102	90	2 ✔️	0	0	4 / 1
Method	23	93	1 ✔️	0	2	6 / 2
Method	30	87	3 ✔️	0	2	5 / 2
Method	36	87	3 ✔️	0	2	5 / 2
Property	9	100	2 ✔️	0	0	1 / 1
Property	13	94	2 ✔️	0	0	9 / 3
Method	42	51	6 ✔️	0	2	42 / 24
Property	11	100	2 ✔️	0	0	1 / 1

🔗 to AsciiBase class diagram

🔝 back to Aptacode.Geometry.Demo.Pages

CanvasBase ✔️

• The CanvasBase contains 8 members.
• 99 total lines of source code.
• Approximately 49 lines of executable code.
• The highest cyclomatic complexity is 7 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	17	93	0 ✔️	0	2	1 / 1
Property	11	100	2 ✔️	0	2	2 / 0
Property	16	100	2 ✔️	0	1	4 / 0
Method	23	74	2 ✔️	0	6	13 / 5
Method	35	87	3 ✔️	0	2	5 / 2
Property	18	100	2 ✔️	0	0	1 / 1
Method	41	43	7 ✔️	0	4	65 / 39
Property	19	100	2 ✔️	0	0	1 / 1

🔗 to CanvasBase class diagram

🔝 back to Aptacode.Geometry.Demo.Pages

IndexBase ✔️

• The IndexBase contains 8 members.
• 57 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	8	93	0 ✔️	0	0	1 / 1
Property	18	100	2 ✔️	0	2	5 / 1
Method	49	85	1 ✔️	0	1	6 / 3
Method	42	85	1 ✔️	0	1	6 / 3
Method	56	85	1 ✔️	0	1	6 / 3
Method	31	74	1 ✔️	0	3	10 / 4
Field	12	93	0 ✔️	0	3	1 / 1
Method	22	75	1 ✔️	0	8	10 / 4

🔗 to IndexBase class diagram

🔝 back to Aptacode.Geometry.Demo.Pages

🔝 back to Demo

Geometry ☢️

The Geometry.csproj project file contains:

• 6 namespaces.
• 16 named types.
• 2,074 total lines of source code.
• Approximately 652 lines of executable code.
• The highest cyclomatic complexity is 11 ☢️.

Aptacode.Geometry.Collision ☢️

The Aptacode.Geometry.Collision namespace contains 3 named types.

• 3 named types.
• 496 total lines of source code.
• Approximately 176 lines of executable code.
• The highest cyclomatic complexity is 11 ☢️.

LineSegmentCollisionDetectionMethods ☢️

• The LineSegmentCollisionDetectionMethods contains 7 members.
• 149 total lines of source code.
• Approximately 55 lines of executable code.
• The highest cyclomatic complexity is 11 ☢️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	10	69	1 ✔️	0	5	9 / 6
Method	52	54	11 ☢️	0	5	47 / 18
Method	98	55	3 ✔️	0	5	25 / 14
Method	134	63	4 ✔️	0	4	22 / 8
Method	124	81	1 ✔️	0	3	9 / 2
Method	22	80	4 ✔️	0	3	8 / 2
Method	34	70	3 ✔️	0	3	20 / 5

🔗 to LineSegmentCollisionDetectionMethods class diagram

🔝 back to Aptacode.Geometry.Collision

PrimitiveCollisionDetectionMethods ✔️

• The PrimitiveCollisionDetectionMethods contains 10 members.
• 253 total lines of source code.
• Approximately 90 lines of executable code.
• The highest cyclomatic complexity is 7 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	12	61	4 ✔️	0	8	24 / 9
Method	39	87	1 ✔️	0	4	9 / 2
Method	45	66	4 ✔️	0	8	20 / 7
Method	66	57	6 ✔️	0	8	31 / 13
Method	98	85	1 ✔️	0	5	5 / 2
Method	108	58	7 ✔️	0	8	36 / 12
Method	141	59	7 ✔️	0	9	30 / 11
Method	172	60	7 ✔️	0	9	26 / 11
Method	203	58	7 ✔️	0	8	35 / 12
Method	235	60	6 ✔️	0	8	23 / 11

🔗 to PrimitiveCollisionDetectionMethods class diagram

🔝 back to Aptacode.Geometry.Collision

Vector2CollisionDetectionMethods ⚠️

• The Vector2CollisionDetectionMethods contains 4 members.
• 88 total lines of source code.
• Approximately 31 lines of executable code.
• The highest cyclomatic complexity is 9 ⚠️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	81	2 ✔️	0	5	8 / 2
Method	20	67	4 ✔️	0	7	19 / 7
Method	40	58	9 ⚠️	0	7	30 / 12
Method	71	61	4 ✔️	0	6	23 / 10

🔗 to Vector2CollisionDetectionMethods class diagram

🔝 back to Aptacode.Geometry.Collision

Aptacode.Geometry ✔️

The Aptacode.Geometry namespace contains 1 named types.

• 1 named types.
• 5 total lines of source code.
• Approximately 1 lines of executable code.
• The highest cyclomatic complexity is 0 ✔️.

Constants ✔️

• The Constants contains 1 members.
• 4 total lines of source code.
• Approximately 1 lines of executable code.
• The highest cyclomatic complexity is 0 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	5	93	0 ✔️	0	0	1 / 1

🔗 to Constants class diagram

🔝 back to Aptacode.Geometry

Aptacode.Geometry.Primitives ✔️

The Aptacode.Geometry.Primitives namespace contains 7 named types.

• 7 named types.
• 969 total lines of source code.
• Approximately 288 lines of executable code.
• The highest cyclomatic complexity is 5 ✔️.

Ellipse ✔️

• The Ellipse contains 32 members.
• 265 total lines of source code.
• Approximately 90 lines of executable code.
• The highest cyclomatic complexity is 5 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	43	100	0 ✔️	0	2	1 / 0
Field	24	100	0 ✔️	0	1	1 / 0
Field	42	93	0 ✔️	0	0	1 / 1
Field	23	93	0 ✔️	0	0	1 / 1
Method	65	83	1 ✔️	0	4	11 / 2
Method	135	96	1 ✔️	0	2	8 / 1
Method	140	96	1 ✔️	0	2	4 / 1
Method	145	96	1 ✔️	0	1	4 / 1
Method	150	96	1 ✔️	0	2	4 / 1
Method	155	96	1 ✔️	0	2	4 / 1
Method	160	96	1 ✔️	0	2	4 / 1
Method	73	71	1 ✔️	0	4	9 / 5
Method	83	77	1 ✔️	0	4	7 / 3
Method	91	92	1 ✔️	0	1	4 / 1
Method	108	62	5 ✔️	0	4	22 / 9
Property	45	76	2 ✔️	0	2	13 / 4
Method	220	59	3 ✔️	0	4	26 / 11
Method	103	100	1 ✔️	0	1	8 / 1
Method	244	51	1 ✔️	0	3	28 / 20
Property	59	91	2 ✔️	0	3	1 / 2
Property	40	94	2 ✔️	0	2	1 / 2
Property	22	100	2 ✔️	0	1	1 / 0
Method	186	77	1 ✔️	0	3	9 / 3
Method	196	77	1 ✔️	0	3	9 / 3
Property	21	100	1 ✔️	0	0	5 / 0
Method	177	74	1 ✔️	0	4	8 / 4
Method	206	77	1 ✔️	0	3	9 / 3
Property	26	76	2 ✔️	0	1	13 / 4
Method	12	91	1 ✔️	0	2	5 / 1
Method	169	74	1 ✔️	0	5	11 / 4
Field	97	93	0 ✔️	0	1	1 / 1
Field	96	93	0 ✔️	0	1	1 / 1

🔗 to Ellipse class diagram

🔝 back to Aptacode.Geometry.Primitives

EllipseExtensions ✔️

• The EllipseExtensions contains 3 members.
• 107 total lines of source code.
• Approximately 46 lines of executable code.
• The highest cyclomatic complexity is 5 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	11	56	2 ✔️	0	5	29 / 15
Method	41	52	1 ✔️	0	3	25 / 18
Method	67	52	5 ✔️	0	3	48 / 13

🔗 to EllipseExtensions class diagram

🔝 back to Aptacode.Geometry.Primitives

Point ✔️

• The Point contains 15 members.
• 92 total lines of source code.
• Approximately 19 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	78	97	1 ✔️	0	3	7 / 0
Method	44	96	1 ✔️	0	2	8 / 1
Method	49	96	1 ✔️	0	1	4 / 1
Method	54	96	1 ✔️	0	2	4 / 1
Method	59	96	1 ✔️	0	2	4 / 1
Method	64	96	1 ✔️	0	2	4 / 1
Method	69	96	1 ✔️	0	2	4 / 1
Method	82	94	1 ✔️	0	1	4 / 1
Method	87	89	1 ✔️	0	3	8 / 1
Method	24	75	4 ✔️	0	4	12 / 3
Method	35	100	1 ✔️	0	1	4 / 1
Property	13	94	2 ✔️	0	2	3 / 2
Method	17	100	1 ✔️	0	1	6 / 1
Property	97	100	2 ✔️	0	1	1 / 2
Property	96	100	2 ✔️	0	1	1 / 2

🔗 to Point class diagram

🔝 back to Aptacode.Geometry.Primitives

Polygon ✔️

• The Polygon contains 22 members.
• 190 total lines of source code.
• Approximately 47 lines of executable code.
• The highest cyclomatic complexity is 3 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	34	100	0 ✔️	0	0	1 / 0
Field	33	93	0 ✔️	0	0	1 / 1
Method	87	91	1 ✔️	0	3	9 / 1
Method	53	96	1 ✔️	0	2	8 / 1
Method	58	96	1 ✔️	0	2	4 / 1
Method	63	96	1 ✔️	0	2	4 / 1
Method	68	96	1 ✔️	0	2	4 / 1
Method	73	96	1 ✔️	0	2	4 / 1
Method	78	96	1 ✔️	0	1	4 / 1
Method	93	78	1 ✔️	0	4	6 / 3
Method	100	78	1 ✔️	0	3	6 / 3
Property	36	84	2 ✔️	0	2	12 / 3
Method	19	88	3 ✔️	0	2	6 / 1
Method	24	100	1 ✔️	0	1	4 / 1
Method	177	81	1 ✔️	0	1	6 / 3
Method	184	80	1 ✔️	0	2	6 / 3
Method	170	80	1 ✔️	0	2	6 / 3
Method	163	81	1 ✔️	0	2	6 / 3
Method	191	81	1 ✔️	0	2	6 / 3
Method	12	100	1 ✔️	0	1	4 / 1
Method	156	81	1 ✔️	0	2	6 / 3
Method	137	63	3 ✔️	0	7	23 / 9

🔗 to Polygon class diagram

🔝 back to Aptacode.Geometry.Primitives

PolyLine ✔️

• The PolyLine contains 23 members.
• 181 total lines of source code.
• Approximately 49 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	34	100	0 ✔️	0	0	1 / 0
Field	33	93	0 ✔️	0	0	1 / 1
Method	87	87	1 ✔️	0	4	13 / 1
Method	53	96	1 ✔️	0	2	8 / 1
Method	58	96	1 ✔️	0	2	4 / 1
Method	63	96	1 ✔️	0	2	4 / 1
Method	68	96	1 ✔️	0	1	4 / 1
Method	73	96	1 ✔️	0	2	4 / 1
Method	78	96	1 ✔️	0	2	4 / 1
Method	97	74	2 ✔️	0	4	10 / 4
Method	110	83	1 ✔️	0	4	5 / 2
Method	19	88	3 ✔️	0	2	6 / 1
Method	24	100	1 ✔️	0	1	4 / 1
Property	36	84	2 ✔️	0	2	12 / 3
Method	168	81	1 ✔️	0	1	6 / 3
Method	175	80	1 ✔️	0	2	6 / 3
Method	161	80	1 ✔️	0	2	6 / 3
Method	154	81	1 ✔️	0	2	6 / 3
Method	182	81	1 ✔️	0	2	6 / 3
Method	12	100	1 ✔️	0	1	4 / 1
Method	147	81	1 ✔️	0	2	6 / 3
Method	121	60	4 ✔️	0	6	30 / 10
Field	108	93	0 ✔️	0	1	1 / 1

🔗 to PolyLine class diagram

🔝 back to Aptacode.Geometry.Primitives

Primitive ✔️

• The Primitive contains 24 members.
• 122 total lines of source code.
• Approximately 26 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	10	85	1 ✔️	0	2	5 / 2
Property	21	100	2 ✔️	0	1	1 / 0
Method	56	100	1 ✔️	0	1	5 / 0
Method	57	100	1 ✔️	0	1	1 / 0
Method	58	100	1 ✔️	0	1	1 / 0
Method	59	100	1 ✔️	0	1	1 / 0
Method	60	100	1 ✔️	0	1	1 / 0
Method	61	100	1 ✔️	0	1	1 / 0
Method	63	88	1 ✔️	0	4	10 / 1
Method	30	100	1 ✔️	0	0	1 / 0
Method	32	92	2 ✔️	0	0	4 / 1
Method	28	100	1 ✔️	0	0	6 / 0
Method	37	80	2 ✔️	0	0	9 / 3
Method	47	94	1 ✔️	0	1	4 / 1
Method	84	78	1 ✔️	0	4	6 / 3
Method	91	84	1 ✔️	0	4	5 / 2
Method	103	84	1 ✔️	0	4	5 / 2
Method	97	83	1 ✔️	0	4	5 / 2
Method	122	85	1 ✔️	0	3	5 / 2
Method	115	80	1 ✔️	0	3	6 / 3
Method	109	85	1 ✔️	0	4	5 / 2
Method	16	100	1 ✔️	0	0	1 / 0
Method	78	85	1 ✔️	0	4	9 / 2
Property	20	100	2 ✔️	0	1	3 / 0

🔗 to Primitive class diagram

🔝 back to Aptacode.Geometry.Primitives

Polygon.Rectangle ✔️

• The Polygon.Rectangle contains 1 members.
• 24 total lines of source code.
• Approximately 11 lines of executable code.
• The highest cyclomatic complexity is 3 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	109	62	3 ✔️	0	2	21 / 11

🔗 to Polygon.Rectangle class diagram

🔝 back to Aptacode.Geometry.Primitives

Aptacode.Geometry.Collision.Rectangles ✔️

The Aptacode.Geometry.Collision.Rectangles namespace contains 2 named types.

• 2 named types.
• 132 total lines of source code.
• Approximately 38 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

BoundingRectangle ✔️

• The BoundingRectangle contains 19 members.
• 113 total lines of source code.
• Approximately 37 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	25	61	3 ✔️	0	2	25 / 12
Property	13	100	2 ✔️	0	1	1 / 0
Property	15	88	2 ✔️	0	2	1 / 2
Method	58	79	4 ✔️	0	3	12 / 2
Method	67	80	4 ✔️	0	3	8 / 2
Method	76	86	1 ✔️	0	3	5 / 2
Method	99	92	2 ✔️	0	0	4 / 1
Method	104	90	2 ✔️	0	2	4 / 1
Method	94	95	1 ✔️	0	2	8 / 1
Property	19	94	2 ✔️	0	2	1 / 2
Method	109	94	1 ✔️	0	0	4 / 1
Method	114	94	1 ✔️	0	1	4 / 1
Property	14	91	2 ✔️	0	2	1 / 2
Property	12	100	2 ✔️	0	1	3 / 0
Method	85	93	1 ✔️	0	2	8 / 1
Property	18	94	2 ✔️	0	2	1 / 2
Property	16	100	2 ✔️	0	2	1 / 2
Property	17	100	2 ✔️	0	2	1 / 2
Field	47	88	0 ✔️	0	2	4 / 1

🔗 to BoundingRectangle class diagram

🔝 back to Aptacode.Geometry.Collision.Rectangles

BoundingRectangleExtensions ✔️

• The BoundingRectangleExtensions contains 1 members.
• 15 total lines of source code.
• Approximately 1 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	9	89	1 ✔️	0	3	10 / 1

🔗 to BoundingRectangleExtensions class diagram

🔝 back to Aptacode.Geometry.Collision.Rectangles

Aptacode.Geometry.Utilities ✔️

The Aptacode.Geometry.Utilities namespace contains 1 named types.

• 1 named types.
• 26 total lines of source code.
• Approximately 7 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Vector2Extensions ✔️

• The Vector2Extensions contains 4 members.
• 24 total lines of source code.
• Approximately 7 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	17	89	1 ✔️	0	4	5 / 2
Method	24	87	1 ✔️	0	3	7 / 2
Field	8	88	0 ✔️	0	2	1 / 1
Method	11	84	1 ✔️	0	3	5 / 2

🔗 to Vector2Extensions class diagram

🔝 back to Aptacode.Geometry.Utilities

Aptacode.Geometry.Vertices ⚠️

The Aptacode.Geometry.Vertices namespace contains 2 named types.

• 2 named types.
• 446 total lines of source code.
• Approximately 142 lines of executable code.
• The highest cyclomatic complexity is 8 ⚠️.

VertexArray ✔️

• The VertexArray contains 14 members.
• 112 total lines of source code.
• Approximately 27 lines of executable code.
• The highest cyclomatic complexity is 5 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	15	95	2 ✔️	0	2	6 / 1
Method	27	89	1 ✔️	0	3	5 / 2
Method	33	73	5 ✔️	0	3	20 / 3
Method	54	93	1 ✔️	0	4	5 / 2
Method	21	93	1 ✔️	0	2	5 / 2
Method	80	92	2 ✔️	0	0	4 / 1
Method	85	97	1 ✔️	0	0	4 / 1
Method	75	100	1 ✔️	0	1	8 / 1
Property	69	100	2 ✔️	0	1	1 / 2
Method	90	65	4 ✔️	0	3	18 / 7
Method	109	94	1 ✔️	0	1	4 / 1
Property	63	94	2 ✔️	0	1	9 / 2
Method	116	86	1 ✔️	0	1	6 / 2
Field	11	100	0 ✔️	0	0	1 / 0

🔗 to VertexArray class diagram

🔝 back to Aptacode.Geometry.Vertices

VertexArrayExtensions ⚠️

• The VertexArrayExtensions contains 13 members.
• 330 total lines of source code.
• Approximately 115 lines of executable code.
• The highest cyclomatic complexity is 8 ⚠️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	12	92	1 ✔️	0	2	4 / 1
Method	17	54	8 ⚠️	0	3	39 / 16
Method	162	54	6 ✔️	0	5	36 / 17
Method	87	70	3 ✔️	0	3	17 / 5
Method	57	81	1 ✔️	0	2	6 / 3
Method	305	79	2 ✔️	0	4	10 / 3
Method	316	79	2 ✔️	0	4	10 / 3
Method	327	77	2 ✔️	0	5	10 / 3
Method	198	54	7 ✔️	0	4	47 / 18
Method	64	62	2 ✔️	0	3	16 / 9
Method	100	55	7 ✔️	0	3	61 / 16
Method	248	53	6 ✔️	0	5	47 / 18
Method	294	79	2 ✔️	0	4	10 / 3

🔗 to VertexArrayExtensions class diagram

🔝 back to Aptacode.Geometry.Vertices

🔝 back to Geometry

Tests ✔️

The Tests.csproj project file contains:

• 14 namespaces.
• 55 named types.
• 1,713 total lines of source code.
• Approximately 279 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData ✔️

The Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData namespace contains 4 named types.

• 4 named types.
• 108 total lines of source code.
• Approximately 12 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseBoundingRectangleCollisionTestDataGenerator ✔️

• The EllipseBoundingRectangleCollisionTestDataGenerator contains 3 members.
• 31 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	82	0 ✔️	0	4	17 / 1
Method	30	100	1 ✔️	0	3	4 / 1
Method	35	100	1 ✔️	0	2	4 / 1

🔗 to EllipseBoundingRectangleCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData

PointBoundingRectangleCollisionTestDataGenerator ✔️

• The PointBoundingRectangleCollisionTestDataGenerator contains 3 members.
• 20 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	85	0 ✔️	0	4	6 / 1
Method	19	100	1 ✔️	0	3	4 / 1
Method	24	100	1 ✔️	0	2	4 / 1

🔗 to PointBoundingRectangleCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData

PolygonBoundingRectangleCollisionTestDataGenerator ✔️

• The PolygonBoundingRectangleCollisionTestDataGenerator contains 3 members.
• 26 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	84	0 ✔️	0	4	12 / 1
Method	25	100	1 ✔️	0	3	4 / 1
Method	30	100	1 ✔️	0	2	4 / 1

🔗 to PolygonBoundingRectangleCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData

PolylineBoundingRectangleCollisionTestDataGenerator ✔️

• The PolylineBoundingRectangleCollisionTestDataGenerator contains 3 members.
• 23 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	82	0 ✔️	0	4	9 / 1
Method	22	100	1 ✔️	0	3	4 / 1
Method	27	100	1 ✔️	0	2	4 / 1

🔗 to PolylineBoundingRectangleCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.BoundingRectangleTestData

Aptacode.Geometry.Tests.BoundingRectangleTests ✔️

The Aptacode.Geometry.Tests.BoundingRectangleTests namespace contains 7 named types.

• 7 named types.
• 170 total lines of source code.
• Approximately 29 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

BoundingRectangleBoundingRectangleCollisionTestDataGenerator ✔️

• The BoundingRectangleBoundingRectangleCollisionTestDataGenerator contains 3 members.
• 29 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	84	0 ✔️	0	4	15 / 1
Method	27	100	1 ✔️	0	3	4 / 1
Method	32	100	1 ✔️	0	2	4 / 1

🔗 to BoundingRectangleBoundingRectangleCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleCollisionTests ✔️

• The BoundingRectangleCollisionTests contains 2 members.
• 28 total lines of source code.
• Approximately 6 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	11	81	1 ✔️	0	5	12 / 3
Method	24	81	1 ✔️	0	6	12 / 3

🔗 to BoundingRectangleCollisionTests class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleEqualityTests.BoundingRectangleEqualityTestDataGenerator ✔️

• The BoundingRectangleEqualityTests.BoundingRectangleEqualityTestDataGenerator contains 3 members.
• 28 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	33	82	0 ✔️	0	4	14 / 1
Method	49	100	1 ✔️	0	3	4 / 1
Method	54	100	1 ✔️	0	2	4 / 1

🔗 to BoundingRectangleEqualityTests.BoundingRectangleEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleEqualityTests ✔️

• The BoundingRectangleEqualityTests contains 1 members.
• 51 total lines of source code.
• Approximately 8 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	67	2 ✔️	0	5	19 / 8

🔗 to BoundingRectangleEqualityTests class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleToStringTests.BoundingRectangleToStringTestDataGenerator ✔️

• The BoundingRectangleToStringTests.BoundingRectangleToStringTestDataGenerator contains 3 members.
• 18 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	25	93	0 ✔️	0	3	4 / 1
Method	31	100	1 ✔️	0	3	4 / 1
Method	36	100	1 ✔️	0	2	4 / 1

🔗 to BoundingRectangleToStringTests.BoundingRectangleToStringTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleToStringTests ✔️

• The BoundingRectangleToStringTests contains 1 members.
• 33 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	83	1 ✔️	0	5	11 / 3

🔗 to BoundingRectangleToStringTests class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

BoundingRectangleVector2CollisionTestDataGenerator ✔️

• The BoundingRectangleVector2CollisionTestDataGenerator contains 3 members.
• 19 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	84	0 ✔️	0	4	5 / 1
Method	17	100	1 ✔️	0	3	4 / 1
Method	22	100	1 ✔️	0	2	4 / 1

🔗 to BoundingRectangleVector2CollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.BoundingRectangleTests

Aptacode.Geometry.Tests.Collision ✔️

The Aptacode.Geometry.Tests.Collision namespace contains 2 named types.

• 2 named types.
• 102 total lines of source code.
• Approximately 32 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Collision_Tests ✔️

• The Collision_Tests contains 3 members.
• 60 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	60	74	1 ✔️	0	6	15 / 6
Method	18	67	1 ✔️	0	9	25 / 8
Method	44	74	1 ✔️	0	6	15 / 6

🔗 to Collision_Tests class diagram

🔝 back to Aptacode.Geometry.Tests.Collision

EllipseCollisionTests ✔️

• The EllipseCollisionTests contains 3 members.
• 38 total lines of source code.
• Approximately 12 lines of executable code.
• The highest cyclomatic complexity is 4 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	100	0 ✔️	0	1	1 / 0
Method	13	96	1 ✔️	0	1	4 / 1
Method	21	60	4 ✔️	0	7	28 / 11

🔗 to EllipseCollisionTests class diagram

🔝 back to Aptacode.Geometry.Tests.Collision

Aptacode.Geometry.Tests.Primitives.Creation ✔️

The Aptacode.Geometry.Tests.Primitives.Creation namespace contains 5 named types.

• 5 named types.
• 107 total lines of source code.
• Approximately 17 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseCreationTestDataGenerator ✔️

• The EllipseCreationTestDataGenerator contains 3 members.
• 19 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	2	5 / 1
Method	17	100	1 ✔️	0	3	4 / 1
Method	22	100	1 ✔️	0	2	4 / 1

🔗 to EllipseCreationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Creation

PointCreationTestDataGenerator ✔️

• The PointCreationTestDataGenerator contains 3 members.
• 20 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	84	0 ✔️	0	3	6 / 1
Method	18	100	1 ✔️	0	3	4 / 1
Method	23	100	1 ✔️	0	2	4 / 1

🔗 to PointCreationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Creation

PolygonCreationTestDataGenerator ✔️

• The PolygonCreationTestDataGenerator contains 3 members.
• 25 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	84	0 ✔️	0	3	11 / 1
Method	23	100	1 ✔️	0	3	4 / 1
Method	28	100	1 ✔️	0	2	4 / 1

🔗 to PolygonCreationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Creation

PolylineCreationTestDataGenerator ✔️

• The PolylineCreationTestDataGenerator contains 3 members.
• 18 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	83	0 ✔️	0	2	4 / 1
Method	15	100	1 ✔️	0	3	4 / 1
Method	20	100	1 ✔️	0	2	4 / 1

🔗 to PolylineCreationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Creation

PrimitiveCreationTests ✔️

• The PrimitiveCreationTests contains 1 members.
• 15 total lines of source code.
• Approximately 5 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	79	1 ✔️	0	7	12 / 5

🔗 to PrimitiveCreationTests class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Creation

Aptacode.Geometry.Tests.Primitives.EllipseStandardForm ✔️

The Aptacode.Geometry.Tests.Primitives.EllipseStandardForm namespace contains 2 named types.

• 2 named types.
• 46 total lines of source code.
• Approximately 11 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseStandardFormTestDataGenerator ✔️

• The EllipseStandardFormTestDataGenerator contains 3 members.
• 21 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	78	0 ✔️	0	4	7 / 1
Method	19	100	1 ✔️	0	3	4 / 1
Method	24	100	1 ✔️	0	2	4 / 1

🔗 to EllipseStandardFormTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.EllipseStandardForm

EllipseStandardformTests ✔️

• The EllipseStandardformTests contains 1 members.
• 19 total lines of source code.
• Approximately 8 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	12	65	1 ✔️	0	5	16 / 8

🔗 to EllipseStandardformTests class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.EllipseStandardForm

Aptacode.Geometry.Tests.Primitives.Equality ✔️

The Aptacode.Geometry.Tests.Primitives.Equality namespace contains 5 named types.

• 5 named types.
• 128 total lines of source code.
• Approximately 23 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

EllipseEqualityTestDataGenerator ✔️

• The EllipseEqualityTestDataGenerator contains 3 members.
• 23 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	77	0 ✔️	0	2	9 / 1
Method	20	100	1 ✔️	0	3	4 / 1
Method	25	100	1 ✔️	0	2	4 / 1

🔗 to EllipseEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Equality

PointEqualityTestDataGenerator ✔️

• The PointEqualityTestDataGenerator contains 3 members.
• 26 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	80	0 ✔️	0	2	12 / 1
Method	24	100	1 ✔️	0	3	4 / 1
Method	29	100	1 ✔️	0	2	4 / 1

🔗 to PointEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Equality

PolygonEqualityTestDataGenerator ✔️

• The PolygonEqualityTestDataGenerator contains 3 members.
• 22 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	78	0 ✔️	0	2	8 / 1
Method	19	100	1 ✔️	0	3	4 / 1
Method	24	100	1 ✔️	0	2	4 / 1

🔗 to PolygonEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Equality

PolylineEqualityTestDataGenerator ✔️

• The PolylineEqualityTestDataGenerator contains 3 members.
• 22 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	78	0 ✔️	0	2	8 / 1
Method	19	100	1 ✔️	0	3	4 / 1
Method	24	100	1 ✔️	0	2	4 / 1

🔗 to PolylineEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Equality

PrimitiveEqualityTests ✔️

• The PrimitiveEqualityTests contains 1 members.
• 25 total lines of source code.
• Approximately 11 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	63	2 ✔️	0	5	22 / 11

🔗 to PrimitiveEqualityTests class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Equality

Aptacode.Geometry.Tests.Collision.PointCollisionTestData ✔️

The Aptacode.Geometry.Tests.Collision.PointCollisionTestData namespace contains 6 named types.

• 6 named types.
• 227 total lines of source code.
• Approximately 18 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseVector2CollisionTestDataGenerator ✔️

• The EllipseVector2CollisionTestDataGenerator contains 3 members.
• 46 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	73	0 ✔️	0	3	32 / 1
Method	45	100	1 ✔️	0	3	4 / 1
Method	50	100	1 ✔️	0	2	4 / 1

🔗 to EllipseVector2CollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

EllipseVector2CollisionTestDataGenerator2 ✔️

• The EllipseVector2CollisionTestDataGenerator2 contains 3 members.
• 31 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	78	0 ✔️	0	3	17 / 1
Method	30	100	1 ✔️	0	3	4 / 1
Method	35	100	1 ✔️	0	2	4 / 1

🔗 to EllipseVector2CollisionTestDataGenerator2 class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

EllipseVector2CollisionTestDataGenerator3 ✔️

• The EllipseVector2CollisionTestDataGenerator3 contains 3 members.
• 31 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	77	0 ✔️	0	3	17 / 1
Method	29	100	1 ✔️	0	3	4 / 1
Method	34	100	1 ✔️	0	2	4 / 1

🔗 to EllipseVector2CollisionTestDataGenerator3 class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

PointVector2CollisionTestDataGenerator ✔️

• The PointVector2CollisionTestDataGenerator contains 3 members.
• 21 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	81	0 ✔️	0	3	7 / 1
Method	19	100	1 ✔️	0	3	4 / 1
Method	24	100	1 ✔️	0	2	4 / 1

🔗 to PointVector2CollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

PolygonVector2CollisionTestDataGenerator ✔️

• The PolygonVector2CollisionTestDataGenerator contains 3 members.
• 56 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	75	0 ✔️	0	3	42 / 1
Method	54	100	1 ✔️	0	3	4 / 1
Method	59	100	1 ✔️	0	2	4 / 1

🔗 to PolygonVector2CollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

PolylineVector2CollisionTestDataGenerator ✔️

• The PolylineVector2CollisionTestDataGenerator contains 3 members.
• 30 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	76	0 ✔️	0	3	16 / 1
Method	28	100	1 ✔️	0	3	4 / 1
Method	33	100	1 ✔️	0	2	4 / 1

🔗 to PolylineVector2CollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PointCollisionTestData

Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData ✔️

The Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData namespace contains 4 named types.

• 4 named types.
• 217 total lines of source code.
• Approximately 12 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipsePrimitiveCollisionTestDataGenerator ✔️

• The EllipsePrimitiveCollisionTestDataGenerator contains 3 members.
• 88 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	72	0 ✔️	0	3	74 / 1
Method	87	100	1 ✔️	0	3	4 / 1
Method	92	100	1 ✔️	0	2	4 / 1

🔗 to EllipsePrimitiveCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData

PointPrimitiveCollisionTestDataGenerator ✔️

• The PointPrimitiveCollisionTestDataGenerator contains 3 members.
• 26 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	79	0 ✔️	0	3	12 / 1
Method	25	100	1 ✔️	0	3	4 / 1
Method	30	100	1 ✔️	0	2	4 / 1

🔗 to PointPrimitiveCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData

PolygonPrimitiveCollisionTestDataGenerator ✔️

• The PolygonPrimitiveCollisionTestDataGenerator contains 3 members.
• 45 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	11	78	0 ✔️	0	3	31 / 1
Method	44	100	1 ✔️	0	3	4 / 1
Method	49	100	1 ✔️	0	2	4 / 1

🔗 to PolygonPrimitiveCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData

PolylinePrimitiveCollisionTestDataGenerator ✔️

• The PolylinePrimitiveCollisionTestDataGenerator contains 3 members.
• 50 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	77	0 ✔️	0	3	36 / 1
Method	48	100	1 ✔️	0	3	4 / 1
Method	53	100	1 ✔️	0	2	4 / 1

🔗 to PolylinePrimitiveCollisionTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Collision.PrimitiveCollisionTestData

Aptacode.Geometry.Tests.Primitives.Transformation.Scale ✔️

The Aptacode.Geometry.Tests.Primitives.Transformation.Scale namespace contains 4 named types.

• 4 named types.
• 102 total lines of source code.
• Approximately 12 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseCenterScaleTestDataGenerator ✔️

• The EllipseCenterScaleTestDataGenerator contains 3 members.
• 19 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	86	0 ✔️	0	3	5 / 1
Method	17	100	1 ✔️	0	3	4 / 1
Method	22	100	1 ✔️	0	2	4 / 1

🔗 to EllipseCenterScaleTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Scale

PointCenterScaleTestDataGenerator ✔️

• The PointCenterScaleTestDataGenerator contains 3 members.
• 19 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	3	5 / 1
Method	17	100	1 ✔️	0	3	4 / 1
Method	22	100	1 ✔️	0	2	4 / 1

🔗 to PointCenterScaleTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Scale

PolygonCenterScaleTestDataGenerator ✔️

• The PolygonCenterScaleTestDataGenerator contains 3 members.
• 28 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	85	0 ✔️	0	3	14 / 1
Method	26	100	1 ✔️	0	3	4 / 1
Method	31	100	1 ✔️	0	2	4 / 1

🔗 to PolygonCenterScaleTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Scale

PolylineCenterScaleTestDataGenerator ✔️

• The PolylineCenterScaleTestDataGenerator contains 3 members.
• 28 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	85	0 ✔️	0	3	14 / 1
Method	26	100	1 ✔️	0	3	4 / 1
Method	31	100	1 ✔️	0	2	4 / 1

🔗 to PolylineCenterScaleTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Scale

Aptacode.Geometry.Tests ✔️

The Aptacode.Geometry.Tests namespace contains 1 named types.

• 1 named types.
• 51 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

UnitTests ✔️

• The UnitTests contains 4 members.
• 49 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	47	72	1 ✔️	0	4	11 / 5
Method	26	80	1 ✔️	0	3	8 / 3
Method	35	72	1 ✔️	0	3	11 / 5
Method	12	69	1 ✔️	0	2	13 / 7

🔗 to UnitTests class diagram

🔝 back to Aptacode.Geometry.Tests

Aptacode.Geometry.Tests.Primitives.ToString ✔️

The Aptacode.Geometry.Tests.Primitives.ToString namespace contains 5 named types.

• 5 named types.
• 98 total lines of source code.
• Approximately 18 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseToStringTestDataGenerator ✔️

• The EllipseToStringTestDataGenerator contains 3 members.
• 17 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	86	0 ✔️	0	2	3 / 1
Method	14	100	1 ✔️	0	3	4 / 1
Method	19	100	1 ✔️	0	2	4 / 1

🔗 to EllipseToStringTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.ToString

PointToStringTestDataGenerator ✔️

• The PointToStringTestDataGenerator contains 3 members.
• 19 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	84	0 ✔️	0	2	5 / 1
Method	16	100	1 ✔️	0	3	4 / 1
Method	21	100	1 ✔️	0	2	4 / 1

🔗 to PointToStringTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.ToString

PolygonToStringTestDataGenerator ✔️

• The PolygonToStringTestDataGenerator contains 3 members.
• 17 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	85	0 ✔️	0	2	3 / 1
Method	14	100	1 ✔️	0	3	4 / 1
Method	19	100	1 ✔️	0	2	4 / 1

🔗 to PolygonToStringTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.ToString

PolylineToStringTestDataGenerator ✔️

• The PolylineToStringTestDataGenerator contains 3 members.
• 18 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	84	0 ✔️	0	2	4 / 1
Method	15	100	1 ✔️	0	3	4 / 1
Method	20	100	1 ✔️	0	2	4 / 1

🔗 to PolylineToStringTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.ToString

PrimitiveToStringTests ✔️

• The PrimitiveToStringTests contains 1 members.
• 17 total lines of source code.
• Approximately 6 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	13	75	1 ✔️	0	5	14 / 6

🔗 to PrimitiveToStringTests class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.ToString

Aptacode.Geometry.Tests.Primitives.Transformation ✔️

The Aptacode.Geometry.Tests.Primitives.Transformation namespace contains 1 named types.

• 1 named types.
• 60 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

PrimitiveTransformationTests ✔️

• The PrimitiveTransformationTests contains 4 members.
• 58 total lines of source code.
• Approximately 20 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	32	75	1 ✔️	0	6	14 / 6
Method	56	76	1 ✔️	0	4	12 / 4
Method	43	75	1 ✔️	0	4	12 / 4
Method	17	75	1 ✔️	0	6	14 / 6

🔗 to PrimitiveTransformationTests class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation

Aptacode.Geometry.Tests.Primitives.Transformation.Translate ✔️

The Aptacode.Geometry.Tests.Primitives.Transformation.Translate namespace contains 4 named types.

• 4 named types.
• 92 total lines of source code.
• Approximately 12 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

EllipseTranslationTestDataGenerator ✔️

• The EllipseTranslationTestDataGenerator contains 3 members.
• 18 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	2	4 / 1
Method	16	100	1 ✔️	0	3	4 / 1
Method	21	100	1 ✔️	0	2	4 / 1

🔗 to EllipseTranslationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Translate

PointTranslationTestDataGenerator ✔️

• The PointTranslationTestDataGenerator contains 3 members.
• 18 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	2	4 / 1
Method	16	100	1 ✔️	0	3	4 / 1
Method	21	100	1 ✔️	0	2	4 / 1

🔗 to PointTranslationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Translate

PolygonTranslationTestDataGenerator ✔️

• The PolygonTranslationTestDataGenerator contains 3 members.
• 26 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	3	12 / 1
Method	24	100	1 ✔️	0	3	4 / 1
Method	29	100	1 ✔️	0	2	4 / 1

🔗 to PolygonTranslationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Translate

PolylineTranslationTestDataGenerator ✔️

• The PolylineTranslationTestDataGenerator contains 3 members.
• 22 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	10	93	0 ✔️	0	3	8 / 1
Method	20	100	1 ✔️	0	3	4 / 1
Method	25	100	1 ✔️	0	2	4 / 1

🔗 to PolylineTranslationTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.Primitives.Transformation.Translate

Aptacode.Geometry.Tests.VertexArray ✔️

The Aptacode.Geometry.Tests.VertexArray namespace contains 5 named types.

• 5 named types.
• 205 total lines of source code.
• Approximately 43 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

VertexArrayConcatTestDataGenerator ✔️

• The VertexArrayConcatTestDataGenerator contains 3 members.
• 34 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	93	0 ✔️	0	2	20 / 1
Method	31	100	1 ✔️	0	3	4 / 1
Method	36	100	1 ✔️	0	2	4 / 1

🔗 to VertexArrayConcatTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.VertexArray

VertexArrayEqualityTestDataGenerator ✔️

• The VertexArrayEqualityTestDataGenerator contains 3 members.
• 30 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	86	0 ✔️	0	2	16 / 1
Method	27	100	1 ✔️	0	3	4 / 1
Method	32	100	1 ✔️	0	2	4 / 1

🔗 to VertexArrayEqualityTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.VertexArray

VertexArrayTests ✔️

• The VertexArrayTests contains 3 members.
• 44 total lines of source code.
• Approximately 15 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	29	81	1 ✔️	0	6	11 / 3
Method	41	83	1 ✔️	0	7	11 / 3
Method	11	65	1 ✔️	0	6	17 / 9

🔗 to VertexArrayTests class diagram

🔝 back to Aptacode.Geometry.Tests.VertexArray

VertexArrayTransformationTests ✔️

• The VertexArrayTransformationTests contains 4 members.
• 62 total lines of source code.
• Approximately 19 lines of executable code.
• The highest cyclomatic complexity is 2 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Method	58	73	1 ✔️	0	4	13 / 4
Method	28	72	2 ✔️	0	4	14 / 5
Method	43	72	2 ✔️	0	4	14 / 5
Method	12	73	2 ✔️	0	4	15 / 5

🔗 to VertexArrayTransformationTests class diagram

🔝 back to Aptacode.Geometry.Tests.VertexArray

VertexArrayTranslateTestDataGenerator ✔️

• The VertexArrayTranslateTestDataGenerator contains 3 members.
• 25 total lines of source code.
• Approximately 3 lines of executable code.
• The highest cyclomatic complexity is 1 ✔️.

Member kind	Line number	Maintainability index	Cyclomatic complexity	Depth of inheritance	Class coupling	Lines of source / executable code
Field	9	93	0 ✔️	0	3	11 / 1
Method	22	100	1 ✔️	0	3	4 / 1
Method	27	100	1 ✔️	0	2	4 / 1

🔗 to VertexArrayTranslateTestDataGenerator class diagram

🔝 back to Aptacode.Geometry.Tests.VertexArray

🔝 back to Tests

Metric definitions

• Maintainability index: Measures ease of code maintenance. Higher values are better.
• Cyclomatic complexity: Measures the number of branches. Lower values are better.
• Depth of inheritance: Measures length of object inheritance hierarchy. Lower values are better.
• Class coupling: Measures the number of classes that are referenced. Lower values are better.
• Lines of source code: Exact number of lines of source code. Lower values are better.
• Lines of executable code: Approximates the lines of executable code. Lower values are better.

Mermaid class diagrams

CreationBenchmark class diagram

classDiagram
class CreationBenchmark{
    +CreatePoint() Primitive
    +CreateEllipse() Primitive
    +CreatePolygon() Primitive
    +CreatePolyline() Primitive
}

Loading

EllipseCollisionBenchmarks class diagram

classDiagram
class EllipseCollisionBenchmarks{
    +CollidingPrimitives() IEnumerable<object[]>
    +PointCollision(Primitive a, Primitive b) bool
}

Loading

FastAndDirtyConfig class diagram

classDiagram
class FastAndDirtyConfig{
    +.ctor() FastAndDirtyConfig
}

Loading

PointCollisionBenchmarks class diagram

classDiagram
class PointCollisionBenchmarks{
    +CollidingPrimitives() IEnumerable<object[]>
    +NonCollidingPrimitives() IEnumerable<object[]>
    +PointCollision(Primitive a, Primitive b) bool
    +PointNonCollision(Primitive a, Primitive b) bool
}

Loading

Program class diagram

classDiagram
class Program{
    +Main(string[] args)$ int
}

Loading

BenchmarkBase class diagram

classDiagram
class BenchmarkBase{
    -string _order
    -IEnumerable<ProfileFunctionResult> Results
    +ILogger<IndexBase> Logger
    +RunOnClick() void
    +OrderResults() void
    +OrderByGroup() void
    +OrderByFastest() void
    +OrderBySlowest() void
}

Loading

GeometryProfileFunctions class diagram

classDiagram
class GeometryProfileFunctions{
    +GeometryFunctions()$ IReadOnlyList<ProfileFunction>
}

Loading

PrimitiveCreation<T> class diagram

classDiagram
class PrimitiveCreation<T>{
    -Func<Random, T> _createPrimitive
    -string _primitiveName
    -Random _random
    +tiveCreation() void
    +Title() string
    +Setup() void
    +Run() void
}

Loading

PrimitiveFunction<T> class diagram

classDiagram
class PrimitiveFunction<T>{
    -Func<Random, T> _createPrimitive
    -string _operationName
    -string _primitiveName
    -Action<T> _primitiveOperation
    -T _primitive
    -Random _random
    +tiveFunction(Action<T> primitiveOperation, string operationName) void
    +Title() string
    +Setup() void
    +Reset() void
    +Run() void
}

Loading

ProfileFunction class diagram

classDiagram
class ProfileFunction{
    +Title()* string
    +Setup() void
    +Reset() void
    +Run()* void
}

Loading

ProfileFunctionResult class diagram

classDiagram
IEquatable~ProfileFunctionResult~ <|-- ProfileFunctionResult : implements
class ProfileFunctionResult{
    +string Title
    +IReadOnlyList<double> Elapsed
    +double Fastest
    +double Slowest
    +double Average
    +.ctor(string Title, IReadOnlyList<double> Elapsed) ProfileFunctionResult
}

Loading

ProfileHelpers class diagram

classDiagram
class ProfileHelpers{
    +CreateEllipse(Random r)$ Ellipse
    +CreatePoint(Random r)$ Point
    +CreatePolygon(Random r)$ Polygon
    +CreatePolyline(Random r)$ PolyLine
}

Loading

ProfileRunner class diagram

classDiagram
class ProfileRunner{
    -IReadOnlyList<ProfileFunction> _profileFunctions
    +.ctor(IReadOnlyList<ProfileFunction> profileFunctions) ProfileRunner
    +Run(int batchCount, int batchSize) List<ProfileFunctionResult>
}

Loading

AsciiBase class diagram

classDiagram
class AsciiBase{
    -int _outputSize
    +int[,] Output
    +string Value
    +int OutputSize
    +OnInitialized() void
    +OnInputChanged(ChangeEventArgs eventArgs) void
    +OnOutputSizeInputChanged(ChangeEventArgs eventArgs) void
    +Update() void
    +Draw(Primitive primitive) void
    +GetColour(int i, int j) string
}

Loading

CanvasBase class diagram

classDiagram
class CanvasBase{
    -Guid _canvasId
    +BlazorCanvasInterop BlazorCanvas
    +ElementReference Canvas
    +int OutputSize
    +string Value
    +OnAfterRenderAsync(bool firstRender) Task
    +OnInputChanged(ChangeEventArgs eventArgs) void
    +Update() void
}

Loading

IndexBase class diagram

classDiagram
class IndexBase{
    -string _order
    -IEnumerable<ProfileFunctionResult> Results
    +ILogger<IndexBase> Logger
    +RunOnClick() void
    +OrderResults() void
    +OrderByGroup() void
    +OrderByFastest() void
    +OrderBySlowest() void
}

Loading

LineSegmentCollisionDetectionMethods class diagram

classDiagram
class LineSegmentCollisionDetectionMethods{
    +Intersects((Vector2 P1, Vector2 P2) line, Vector2 point)$ bool
    +OnSegment(Vector2 p, Vector2 q, Vector2 r)$ bool
    +Orientation(Vector2 p, Vector2 q, Vector2 r)$ int
    +Intersects((Vector2 P1, Vector2 P2) line1, (Vector2 P1, Vector2 P2) line2)$ bool
    +Intersects((Vector2 P1, Vector2 P2) line, (double A, double B, double C, double D, double E, double F) stdform)$ bool
    +IsPointInsideCircle(Vector2 circleCenter, float radius, Vector2 point)$ bool
    +IntersectsCircle((Vector2 P1, Vector2 P2) lineSegment, Vector2 center, float radius)$ bool
}

Loading

PrimitiveCollisionDetectionMethods class diagram

classDiagram
class PrimitiveCollisionDetectionMethods{
    +CollidesWith(Ellipse p1, Ellipse p2)$ bool
    +CollidesWith(Point p1, Point p2)$ bool
    +CollidesWith(Point p1, PolyLine p2)$ bool
    +CollidesWith(Point p1, Polygon p2)$ bool
    +CollidesWith(Point p1, Ellipse p2)$ bool
    +CollidesWith(PolyLine p1, PolyLine p2)$ bool
    +CollidesWith(PolyLine p1, Polygon p2)$ bool
    +CollidesWith(PolyLine p1, Ellipse p2)$ bool
    +CollidesWith(Polygon p1, Polygon p2)$ bool
    +CollidesWith(Polygon p1, Ellipse p2)$ bool
}

Loading

Vector2CollisionDetectionMethods class diagram

classDiagram
class Vector2CollisionDetectionMethods{
    +CollidesWith(Point p2, Vector2 p1)$ bool
    +CollidesWith(PolyLine p2, Vector2 p1)$ bool
    +CollidesWith(Polygon p2, Vector2 p1)$ bool
    +CollidesWith(Ellipse p2, Vector2 p1)$ bool
}

Loading

Constants class diagram

classDiagram
class Constants{
    -float Tolerance$
}

Loading

Ellipse class diagram

classDiagram
class Ellipse{
    -bool _updateStandardForm
    -(double A, double B, double C, double D, double E, double F) _standardForm
    -bool _updateFoci
    -(Vector2, Vector2) _foci
    -Ellipse Zero$
    -Ellipse Unit$
    +float Rotation
    +Vector2 Radii
    +(double A, double B, double C, double D, double E, double F) StandardForm
    +Vector2 Position
    +(Vector2, Vector2) Foci
    +bool IsCircle
    +ToString() string
    +.ctor(VertexArray vertexArray, BoundingRectangle boundingRectangle, Vector2 radii, float rotation) Ellipse
    +Create(float x, float y, float a, float b, float rotation)$ Ellipse
    +Create(Vector2 position, Vector2 radii, float rotation)$ Ellipse
    +Create(Vector2 position, float radius)$ Ellipse
    +GetHashCode() int
    +Equals(Primitive? other) bool
    +CollidesWith(Vector2 p) bool
    +CollidesWith(Point p) bool
    +CollidesWith(Ellipse p) bool
    +CollidesWith(PolyLine p) bool
    +CollidesWith(BoundingRectangle p) bool
    +CollidesWith(Polygon p) bool
    +Translate(Vector2 delta) Ellipse
    +ScaleAboutCenter(Vector2 delta) Ellipse
    +Rotate(float theta) Ellipse
    +Rotate(Vector2 rotationCenter, float theta) Ellipse
    +Skew(Vector2 delta) Ellipse
    +GetFoci() (Vector2 f1, Vector2 f2)
    +GetStandardForm() (double A, double B, double C, double D, double E, double F)
}

Loading

EllipseExtensions class diagram

classDiagram
class EllipseExtensions{
    +GetBoundingRectangle(Vector2 position, Vector2 radii, float rotation)$ BoundingRectangle
    +GetResultantPolynomial(double a1, double b1, double c1, double d1, double e1, double f1, double a2, double b2, double c2, double d2, double e2, double f2)$ (double u0, double u1, double u2, double u3, double u4)
    +QuarticHasRealRoots(double u0, double u1, double u2, double u3, double u4)$ bool
}

Loading

Point class diagram

classDiagram
class Point{
    +Vector2 Position
    +Point Zero$
    +Point Unit$
    +ToString() string
    +Equals(Primitive? other) bool
    +GetHashCode() int
    +CollidesWith(Vector2 p) bool
    +CollidesWith(Point p) bool
    +CollidesWith(Ellipse p) bool
    +CollidesWith(PolyLine p) bool
    +CollidesWith(BoundingRectangle p) bool
    +CollidesWith(Polygon p) bool
    +.ctor(VertexArray vertexArray, BoundingRectangle boundingRectangle) Point
    +Create(float x, float y)$ Point
    +Create(Vector2 position)$ Point
}

Loading

Polygon class diagram

classDiagram
class Polygon{
    -bool _updateEdges
    -(Vector2 P1, Vector2 P2)[] _edges
    +(Vector2 P1, Vector2 P2)[] Edges
    +ToString() string
    +Equals(Primitive? other) bool
    +GetHashCode() int
    +CollidesWith(Vector2 p) bool
    +CollidesWith(Point p) bool
    +CollidesWith(Ellipse p) bool
    +CollidesWith(PolyLine p) bool
    +CollidesWith(BoundingRectangle p) bool
    +CollidesWith(Polygon p) bool
    +.ctor(VertexArray vertices, BoundingRectangle boundingRectangle) Polygon
    +Create(params Vector2[] vertices)$ Polygon
    +Create(params float[] points)$ Polygon
    +UpdateEdges() void
    +Translate(Vector2 delta) Polygon
    +ScaleAboutCenter(Vector2 delta) Polygon
    +Scale(Vector2 scaleCenter, Vector2 delta) Primitive
    +Rotate(float theta) Polygon
    +Rotate(Vector2 rotationCenter, float theta) Polygon
    +Skew(Vector2 delta) Polygon
}

Loading

PolyLine class diagram

classDiagram
class PolyLine{
    -bool _updateLineSegments
    -(Vector2 P1, Vector2 P2)[] _lineSegments
    -PolyLine Zero$
    +(Vector2 P1, Vector2 P2)[] LineSegments
    +ToString() string
    +Equals(Primitive? other) bool
    +GetHashCode() int
    +CollidesWith(Vector2 p) bool
    +CollidesWith(Point p) bool
    +CollidesWith(Ellipse p) bool
    +CollidesWith(PolyLine p) bool
    +CollidesWith(BoundingRectangle p) bool
    +CollidesWith(Polygon p) bool
    +.ctor(VertexArray vertices, BoundingRectangle boundingRectangle) PolyLine
    +Create(params float[] points)$ PolyLine
    +Create(params Vector2[] points)$ PolyLine
    +UpdateLineSegments() void
    +Translate(Vector2 delta) PolyLine
    +ScaleAboutCenter(Vector2 delta) PolyLine
    +Scale(Vector2 scaleCenter, Vector2 delta) Primitive
    +Rotate(float theta) PolyLine
    +Rotate(Vector2 rotationCenter, float theta) PolyLine
    +Skew(Vector2 delta) PolyLine
}

Loading

Primitive class diagram

classDiagram
class Primitive{
    +VertexArray Vertices
    +BoundingRectangle BoundingRectangle
    +.ctor(VertexArray vertices, BoundingRectangle boundingRectangle) Primitive
    +ToString()* string
    +GetHashCode()* int
    +Equals(Primitive? other)* bool
    +Equals(object obj) bool
    +operator ==(Primitive lhs, Primitive rhs)$ bool
    +operator !=(Primitive lhs, Primitive rhs)$ bool
    +CollidesWith(Vector2 p)* bool
    +CollidesWith(Point p)* bool
    +CollidesWith(Ellipse p)* bool
    +CollidesWith(PolyLine p)* bool
    +CollidesWith(Polygon p)* bool
    +CollidesWith(BoundingRectangle p)* bool
    +CollidesWithPrimitive(Primitive p) bool
    +Translate(Vector2 delta) Primitive
    +Rotate(float theta) Primitive
    +Rotate(Vector2 rotationCenter, float theta) Primitive
    +ScaleAboutCenter(Vector2 delta) Primitive
    +Scale(Vector2 scaleCenter, Vector2 delta) Primitive
    +Skew(Vector2 delta) Primitive
    +SetSize(Vector2 delta) Primitive
    +SetPosition(Vector2 position) Primitive
}

Loading

Polygon.Rectangle class diagram

classDiagram
class Rectangle{
    +FromTwoPoints(Vector2 a, Vector2 b)$ Polygon
}

Loading

BoundingRectangle class diagram

classDiagram
IEquatable~BoundingRectangle~ <|-- BoundingRectangle : implements
class BoundingRectangle{
    -BoundingRectangle Zero$
    +Vector2 TopRight
    +Vector2 BottomLeft
    +Vector2 Size
    +Vector2 Center
    +float X
    +float Y
    +float Width
    +float Height
    +.ctor(Vector2 a, Vector2 b) BoundingRectangle
    +CollidesWith(BoundingRectangle rect) bool
    +CollidesWith(Vector2 point) bool
    +CollidesWith(Primitive primitive) bool
    +ToString() string
    +GetHashCode() int
    +Equals(object obj) bool
    +Equals(BoundingRectangle other) bool
    +operator ==(BoundingRectangle lhs, BoundingRectangle rhs)$ bool
    +operator !=(BoundingRectangle lhs, BoundingRectangle rhs)$ bool
}

Loading

BoundingRectangleExtensions class diagram

classDiagram
class BoundingRectangleExtensions{
    +Translate(BoundingRectangle rectangle, Vector2 delta)$ BoundingRectangle
}

Loading

Vector2Extensions class diagram

classDiagram
class Vector2Extensions{
    -Matrix3x2 RotationMatrix$
    +VectorCross(Vector2 a, Vector2 b)$ float
    +Perp(Vector2 a)$ Vector2
    +PerpDot(Vector2 a, Vector2 b)$ float
}

Loading

VertexArray class diagram

classDiagram
IEquatable~VertexArray~ <|-- VertexArray : implements
class VertexArray{
    -Vector2[] Vertices
    +Vector2 this[int key]
    +int Length
    +.ctor(Vector2[] vertices) VertexArray
    +Empty()$ VertexArray
    +Create(params Vector2[] vertices)$ VertexArray
    +Create(params float[] vertices)$ VertexArray
    +Create(IEnumerable<Vector2> vertices)$ VertexArray
    +GetHashCode() int
    +Equals(object obj) bool
    +Equals(VertexArray other) bool
    +operator ==(VertexArray lhs, VertexArray rhs)$ bool
    +operator !=(VertexArray lhs, VertexArray rhs)$ bool
    +ToString() string
}

Loading

VertexArrayExtensions class diagram

classDiagram
class VertexArrayExtensions{
    +Concat(VertexArray vertexArray, params Vector2[] vertices)$ VertexArray
    +Concat(VertexArray vertexArrayA, VertexArray vertexArrayB)$ VertexArray
    +Remove(VertexArray vertexArray, int index)$ VertexArray
    +ToConvexHull(VertexArray vertexArray, float margin)$ VertexArray
    +Orientation(Vector2 p, Vector2 q, Vector2 r)$ int
    +ToConvexHull(Vector2[] points, int n)$ Vector2[]
    +OrderClockwiseFromLeastX(VertexArray vertexArray)$ VertexArray
    +ToBoundingRectangle(VertexArray vertexArray)$ BoundingRectangle
    +Transform(VertexArray vertexArray, Matrix3x2 transformationMatrix)$ BoundingRectangle
    +Translate(VertexArray vertexArray, Vector2 delta)$ BoundingRectangle
    +Rotate(VertexArray vertexArray, Vector2 rotationCenter, float theta)$ BoundingRectangle
    +Scale(VertexArray vertexArray, Vector2 scaleCenter, Vector2 delta)$ BoundingRectangle
    +Skew(VertexArray vertexArray, Vector2 delta)$ BoundingRectangle
}

Loading

EllipseBoundingRectangleCollisionTestDataGenerator class diagram

classDiagram
class EllipseBoundingRectangleCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointBoundingRectangleCollisionTestDataGenerator class diagram

classDiagram
class PointBoundingRectangleCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonBoundingRectangleCollisionTestDataGenerator class diagram

classDiagram
class PolygonBoundingRectangleCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineBoundingRectangleCollisionTestDataGenerator class diagram

classDiagram
class PolylineBoundingRectangleCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

BoundingRectangleBoundingRectangleCollisionTestDataGenerator class diagram

classDiagram
class BoundingRectangleBoundingRectangleCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

BoundingRectangleCollisionTests class diagram

classDiagram
class BoundingRectangleCollisionTests{
    +BoundingRectangleBoundingRectangleCollision(BoundingRectangle p1, BoundingRectangle p2, bool collides) void
    +BoundingRectangleVector2Collision(BoundingRectangle p1, Vector2 p2, bool collides) void
}

Loading

BoundingRectangleEqualityTests.BoundingRectangleEqualityTestDataGenerator class diagram

classDiagram
class BoundingRectangleEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

BoundingRectangleEqualityTests class diagram

classDiagram
class BoundingRectangleEqualityTests{
    +BoundingRectangleEquality_Equality(BoundingRectangle p1, BoundingRectangle p2, bool areEqual) void
}

Loading

BoundingRectangleToStringTests.BoundingRectangleToStringTestDataGenerator class diagram

classDiagram
class BoundingRectangleToStringTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

BoundingRectangleToStringTests class diagram

classDiagram
class BoundingRectangleToStringTests{
    +BoundingRectangleToString(BoundingRectangle p1, string expected) void
}

Loading

BoundingRectangleVector2CollisionTestDataGenerator class diagram

classDiagram
class BoundingRectangleVector2CollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

Collision_Tests class diagram

classDiagram
class Collision_Tests{
    +PrimitiveCollidesWithPrimitive(Primitive p1, Primitive p2, bool collides) void
    +PrimitiveCollidesWithVector2(Primitive p1, Vector2 p2, bool collides) void
    +PrimitiveCollidesWithBoundingRectangle(Primitive p1, BoundingRectangle rectangle, bool collides) void
}

Loading

EllipseCollisionTests class diagram

classDiagram
class EllipseCollisionTests{
    -ITestOutputHelper _output
    +.ctor(ITestOutputHelper output) EllipseCollisionTests
    +CircleVector2CollisionTests(Ellipse p1, int[,] collisionMatrix) void
}

Loading

EllipseCreationTestDataGenerator class diagram

classDiagram
class EllipseCreationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointCreationTestDataGenerator class diagram

classDiagram
class PointCreationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonCreationTestDataGenerator class diagram

classDiagram
class PolygonCreationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineCreationTestDataGenerator class diagram

classDiagram
class PolylineCreationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PrimitiveCreationTests class diagram

classDiagram
class PrimitiveCreationTests{
    +PrimitiveCreation(Primitive primitive, VertexArray expected) void
}

Loading

EllipseStandardFormTestDataGenerator class diagram

classDiagram
class EllipseStandardFormTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

EllipseStandardformTests class diagram

classDiagram
class EllipseStandardformTests{
    +TestStandardForm(Ellipse ellipse, float a, float b, float c, float d, float e, float f) void
}

Loading

EllipseEqualityTestDataGenerator class diagram

classDiagram
class EllipseEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointEqualityTestDataGenerator class diagram

classDiagram
class PointEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonEqualityTestDataGenerator class diagram

classDiagram
class PolygonEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineEqualityTestDataGenerator class diagram

classDiagram
class PolylineEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PrimitiveEqualityTests class diagram

classDiagram
class PrimitiveEqualityTests{
    +Primitive_Equality(Primitive p1, Primitive p2, bool areEqual) void
}

Loading

EllipseVector2CollisionTestDataGenerator class diagram

classDiagram
class EllipseVector2CollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

EllipseVector2CollisionTestDataGenerator2 class diagram

classDiagram
class EllipseVector2CollisionTestDataGenerator2{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

EllipseVector2CollisionTestDataGenerator3 class diagram

classDiagram
class EllipseVector2CollisionTestDataGenerator3{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointVector2CollisionTestDataGenerator class diagram

classDiagram
class PointVector2CollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonVector2CollisionTestDataGenerator class diagram

classDiagram
class PolygonVector2CollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineVector2CollisionTestDataGenerator class diagram

classDiagram
class PolylineVector2CollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

EllipsePrimitiveCollisionTestDataGenerator class diagram

classDiagram
class EllipsePrimitiveCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointPrimitiveCollisionTestDataGenerator class diagram

classDiagram
class PointPrimitiveCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonPrimitiveCollisionTestDataGenerator class diagram

classDiagram
class PolygonPrimitiveCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylinePrimitiveCollisionTestDataGenerator class diagram

classDiagram
class PolylinePrimitiveCollisionTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

EllipseCenterScaleTestDataGenerator class diagram

classDiagram
class EllipseCenterScaleTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointCenterScaleTestDataGenerator class diagram

classDiagram
class PointCenterScaleTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonCenterScaleTestDataGenerator class diagram

classDiagram
class PolygonCenterScaleTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineCenterScaleTestDataGenerator class diagram

classDiagram
class PolylineCenterScaleTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

UnitTests class diagram

classDiagram
class UnitTests{
    +QuarticHasRealRoots_Test() void
    +Perp_Test() void
    +PerpDotXVectorCrossTest() void
    +newLineSegmentIntersection_Test() void
}

Loading

EllipseToStringTestDataGenerator class diagram

classDiagram
class EllipseToStringTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointToStringTestDataGenerator class diagram

classDiagram
class PointToStringTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonToStringTestDataGenerator class diagram

classDiagram
class PolygonToStringTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineToStringTestDataGenerator class diagram

classDiagram
class PolylineToStringTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PrimitiveToStringTests class diagram

classDiagram
class PrimitiveToStringTests{
    +PrimitiveToStringTest(Primitive p1, string expected) void
}

Loading

PrimitiveTransformationTests class diagram

classDiagram
class PrimitiveTransformationTests{
    +Primitive_Translation(Primitive p1, Vector2 delta, Primitive expected) void
    +Primitive_CenterScale(Primitive p1, Vector2 delta, Primitive expected) void
    +Primitive_SetSize_Test() void
    +Primitive_SetPosition_Test() void
}

Loading

EllipseTranslationTestDataGenerator class diagram

classDiagram
class EllipseTranslationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PointTranslationTestDataGenerator class diagram

classDiagram
class PointTranslationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolygonTranslationTestDataGenerator class diagram

classDiagram
class PolygonTranslationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

PolylineTranslationTestDataGenerator class diagram

classDiagram
class PolylineTranslationTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

VertexArrayConcatTestDataGenerator class diagram

classDiagram
class VertexArrayConcatTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

VertexArrayEqualityTestDataGenerator class diagram

classDiagram
class VertexArrayEqualityTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

VertexArrayTests class diagram

classDiagram
class VertexArrayTests{
    +VertexEquality(VertexArray v1, VertexArray v2, bool areEqual) void
    +VertexArray_Concat(VertexArray v1, VertexArray v2, VertexArray expected) void
    +VertexArray_Translate(VertexArray v1, Vector2 delta, VertexArray expected) void
}

Loading

VertexArrayTransformationTests class diagram

classDiagram
class VertexArrayTransformationTests{
    +VertexArray_Translation_Test() void
    +VertexArray_Rotation_Test() void
    +VertexArray_Scale_Test() void
    +VertexArray_BoundingRectangle_Scale_Test() void
}

Loading

VertexArrayTranslateTestDataGenerator class diagram

classDiagram
class VertexArrayTranslateTestDataGenerator{
    -List<object[]> _data
    +GetEnumerator() IEnumerator<object[]>
    +GetEnumerator() IEnumerator
}

Loading

This file is maintained by a bot.