Ejemplo

Prove that EquatableMixin enables deep value equality and collection hashing across custom class hierarchies, comparing nested collections value-wise with order-sensitive lists and order-insensitive sets.

sha256:c163a38f5194f0eb07aa45ccd20fc7a734b270d21970668425694c9f4f7cdf14

PUBLISHED L3_CONTRACT_PASS MIT-0

Evidencia de ejecución

Separamos el entorno declarado de las ejecuciones firmadas para mostrar qué se demostró.

Base de evidenciaContrato firmado aprobado

Recibos de verificación1

Nivel de verificaciónL3_CONTRACT_PASS

CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · pub@1 · 2026-08-17

Objetivo: Prove that EquatableMixin enables deep value equality and collection hashing across custom class hierarchies, comparing nested collections value-wise with order-sensitive lists and order-insensitive sets. HOW
Paquetes: equatable 2.1.0
Entorno: dart
Creado: 2026-08-17T18:01:36Z

A class applying EquatableMixin compares equal and produces identical hash codes to matching instances across deep nested collections, evaluating lists order-sensitively and sets order-insensitively.
EquatableMixin allows classes in single-inheritance hierarchies to obtain value equality and hash code parity based on overridden props.
Nested lists in props require matching element order, whereas nested sets compare equal regardless of element insertion order.
Deeply nested collections including maps of lists evaluate equality recursively down to leaf elements.
Equal EquatableMixin instances properly deduplicate in Set collections and look up correctly as Map keys.
Props containing null values or empty props lists are safely compared without runtime exceptions.

dart 3 · linux debian/x64 · docker · CONTAINER_RUN · compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS · pub@1 · 2026-08-17 · ed25519:d91480838ac982c9