Decidable membership and hashing for UInt32Array

Decidable membership, slice hashing and the lawful BEq and Hashable instances on slices. Left out of the float types, which have no DecidableEq.

theorem ScalarArray.UInt32Array.contains_iff_mem {a : UInt32Array} {x : UInt32} : a.contains x = true ↔ x ∈ a

@[implemented_by _private.ScalarArray.UInt32.Decidable.0.ScalarArray.UInt32Array.decMemImpl]

def ScalarArray.UInt32Array.decMem (x : UInt32) (a : UInt32Array) : Decidable (x ∈ a)

Decides membership with contains. Logically it decides membership in a.toList, so that decide can evaluate it.

Equations

• ScalarArray.UInt32Array.decMem x a = decidable_of_iff (x ∈ a.toList) ⋯

@[instance_reducible]

instance ScalarArray.UInt32Array.instDecidableMemUInt32 (x : UInt32) (a : UInt32Array) : Decidable (x ∈ a)

Equations

• ScalarArray.UInt32Array.instDecidableMemUInt32 x a = ScalarArray.UInt32Array.decMem x a

@[simp]

theorem ScalarArray.UInt32Array.contains_eq_mem {a : UInt32Array} {x : UInt32} : a.contains x = decide (x ∈ a)

theorem ScalarArray.UInt32Array.Slice.contains_iff_mem {s : UInt32Array.Slice} {x : UInt32} : s.contains x = true ↔ x ∈ s

@[implemented_by _private.ScalarArray.UInt32.Decidable.0.ScalarArray.UInt32Array.Slice.decMemImpl]

def ScalarArray.UInt32Array.Slice.decMem (x : UInt32) (s : UInt32Array.Slice) : Decidable (x ∈ s)

Decides membership with contains. Logically it decides membership in s.copy.toList, so that decide can evaluate it.

Equations

• ScalarArray.UInt32Array.Slice.decMem x s = decidable_of_iff (x ∈ s.copy.toList) ⋯

@[instance_reducible]

instance ScalarArray.UInt32Array.instDecidableMemUInt32Slice (x : UInt32) (s : UInt32Array.Slice) : Decidable (x ∈ s)

Equations

• ScalarArray.UInt32Array.instDecidableMemUInt32Slice x s = ScalarArray.UInt32Array.Slice.decMem x s

@[implemented_by _private.ScalarArray.UInt32.Decidable.0.ScalarArray.UInt32Array.Slice.hashImpl]

def ScalarArray.UInt32Array.Slice.hash (s : UInt32Array.Slice) : UInt64

The same hash as s.copy, so slices with the same elements have the same hash.

Equations

• s.hash = hash s.copy

@[instance_reducible]

instance ScalarArray.UInt32Array.instHashableSlice : Hashable UInt32Array.Slice

Equations

• ScalarArray.UInt32Array.instHashableSlice = { hash := ScalarArray.UInt32Array.Slice.hash }

theorem ScalarArray.UInt32Array.Slice.hash_eq_hash_copy (s : UInt32Array.Slice) : Hashable.hash s = Hashable.hash s.copy

theorem ScalarArray.UInt32Array.Slice.beq_iff_copy_eq {s t : UInt32Array.Slice} : (s == t) = true ↔ s.copy = t.copy

instance ScalarArray.UInt32Array.instEquivBEqSlice : EquivBEq UInt32Array.Slice

instance ScalarArray.UInt32Array.instLawfulHashableSlice : LawfulHashable UInt32Array.Slice