Press n or j to go to the next uncovered block, b, p or k for the previous block.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 | 1x 1x 1x 110x 110x 110x 110x 110x 110x 110x 110x 110x | import type {Law, UnknownArgs} from '#law' import {LawSet} from '#law' import {Equivalence as EQ} from 'effect' import type {Kind, TypeLambda} from 'effect/HKT' import fc from 'fast-check' /** * Common options for testing _concrete type_ typeclass laws. These are * the typeclasses that do not expect a higher-kinded type as their * parameter. All the concrete typeclass laws expect these options to be * provided. * @typeParam F - The type lambda of the typeclass under test. If we are * testing `Monoid` laws, for example, then it would be set to * `MonoidTypeLambda`. * @typeParam A - The datatype under test. For example, when testing * `Monoid` laws on `Option<number>`, this would be set to * `Option<number>`. * @category harness */ export interface ConcreteGiven<F extends TypeLambda, A, E = unknown> { /** * An equivalence for the values used to test the typeclass. For example when * testing `Monoid` on `Option<number>`, this should return an equivalence * for an `Option<number>`. */ equalsA: EQ.Equivalence<A> /** * An arbitrary for the values used to test the typeclass. For example when * testing `Monoid` on `Option<number>`, this should return an arbitrary * for an `Option<number>`. */ a: fc.Arbitrary<A> /** * Instance under test. For example when testing the `Monoid` typeclass laws * on an instance of the `Option` Monoid, with the underlying type set at * `number`, then the type parameter `A` would be set at `Option<number>` and * this field at `Monoid<Option<number>>`. */ F: Kind<F, never, unknown, E, A> /** * Optional suffix to attach to `LawTest` label. */ suffix?: string } /** * Define a set of laws for some typeclass on a concrete type. * @param typeclassName - Used as label for test `description()` block. * @param laws - list of `Law` to test. * @returns A set of laws ready to be tested. * @category harness */ export const defineConcreteLaws = <Ts extends UnknownArgs[]>( typeclassName: string, ...laws: {[K in keyof Ts]: Law<Ts[K]>} ) => ( /** * Optional suffix to attach to `LawTest` label. Used, for example, * to differentiate between the different `Monoid` instances of * `Boolean`. */ suffix = '', /** * Optional list of `LawSet`s that are required for the * typeclass under test. For example, the `Monoid` laws * require the instance under test pass the `Semigroup` * laws besides the `Monoid` laws themselves. They do * this by adding the `Semigroup` laws in this field. */ ...sets: LawSet[] ): LawSet => LawSet(...sets)( typeclassName + (suffix === '' ? '' : `.${suffix}`), ...laws, ) /** * Type-level map of _typeclass name_ to _type lambda_ for typeclasses on * concrete types. Use * [module augmentation](https://www.typescriptlang.org/docs/handbook/declaration-merging.html) * to add entries here for a new typeclasses. * @category harness */ export interface ConcreteLambdas {} /** * The type of function that builds concrete laws. * @category harness */ export interface BuildConcrete<Typeclass extends TypeLambda> { <A>(given: ConcreteGiven<Typeclass, A>): LawSet } |