< Summary

Information

Class:	Bookings.Domain.BookingKey
Assembly:	Bookings.Domain
File(s):	C:\Code\Bookings\Bookings.Domain\BookingKey.cs

Line coverage

58%

Branch coverage

N/A

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
get_Description()	100%	2	1	0%
get_Type()	100%	2	1	0%
get_Start()	100%	2	1	0%
get_End()	100%	2	1	0%
get_Email()	100%	2	1	0%
From(...)	100%	1	1	100%

#	Line	Line coverage
	`1`	`namespace Bookings.Domain`
	`2`	`{`
	`3`	`/*`
	`4`	`Learnings: record structs are great for O(1) lookups since they are not allocated on the heap`
	`5`	`When you use a ConcurrentDictionary<BookingKey, Guid>:`
	`6`	`record struct -> Each key is stored inline in the dictionary’s key slot. No extra heap allocation per key.`
	`7`	`record class -> Dictionary stores a reference to a heap-allocated object for each key. Many keys = more GC work.`
	`8`	`For O(1) lookups in high-load systems, avoiding unnecessary heap allocations can have a measurable effect.`
	`9`	`*/`
	`10`
	`11`	`public readonly record struct BookingKey(`
0	`12`	`string Description,`
0	`13`	`string Type,`
0	`14`	`DateOnly Start,`
0	`15`	`DateOnly End,`
0	`16`	`string Email)`
	`17`	`{`
4035	`18`	`public static BookingKey From(Booking b) => new(`
4035	`19`	`Description: b.Description,`
4035	`20`	`Type: b.Type,`
4035	`21`	`Start: b.Period.Start,`
4035	`22`	`End: b.Period.End,`
4035	`23`	`Email: b.Email`
4035	`24`	`);`
	`25`	`}`
	`26`	`}`