// SPDX-License-Identifier: MIT pragma solidity ^0.8.35; import { Array } from '../utils/Array.sol'; import { Math } from '../utils/Math.sol'; /** * @title Set implementation with enumeration functions * @dev derived from https://github.com/OpenZeppelin/openzeppelin-contracts (MIT license) */ library EnumerableSet { using Array for bytes32[]; error EnumerableSet__IndexOutOfBounds(); struct Set { bytes32[] _values; // 1-indexed to allow 0 to signify nonexistence mapping(bytes32 value => uint256 index) _indexes; } struct Bytes32Set { Set _inner; } struct AddressSet { Set _inner; } struct UintSet { Set _inner; } function valueAt( Bytes32Set storage set, uint256 index ) internal view returns (bytes32) { return _valueAt(set._inner, index); } function valueAt( AddressSet storage set, uint256 index ) internal view returns (address) { return address(uint160(uint256(_valueAt(set._inner, index)))); } function valueAt( UintSet storage set, uint256 index ) internal view returns (uint256) { return uint256(_valueAt(set._inner, index)); } function contains( Bytes32Set storage set, bytes32 value ) internal view returns (bool) { return _contains(set._inner, value); } function contains( AddressSet storage set, address value ) internal view returns (bool) { return _contains(set._inner, bytes32(uint256(uint160(value)))); } function contains( UintSet storage set, uint256 value ) internal view returns (bool) { return _contains(set._inner, bytes32(value)); } function indexOf( Bytes32Set storage set, bytes32 value ) internal view returns (uint256) { return _indexOf(set._inner, value); } function indexOf( AddressSet storage set, address value ) internal view returns (uint256) { return _indexOf(set._inner, bytes32(uint256(uint160(value)))); } function indexOf( UintSet storage set, uint256 value ) internal view returns (uint256) { return _indexOf(set._inner, bytes32(value)); } function length(Bytes32Set storage set) internal view returns (uint256) { return _length(set._inner); } function length(AddressSet storage set) internal view returns (uint256) { return _length(set._inner); } function length(UintSet storage set) internal view returns (uint256) { return _length(set._inner); } function add( Bytes32Set storage set, bytes32 value ) internal returns (bool) { return _add(set._inner, value); } function add( AddressSet storage set, address value ) internal returns (bool) { return _add(set._inner, bytes32(uint256(uint160(value)))); } function add(UintSet storage set, uint256 value) internal returns (bool) { return _add(set._inner, bytes32(value)); } function remove( Bytes32Set storage set, bytes32 value ) internal returns (bool) { return _remove(set._inner, value); } function remove( AddressSet storage set, address value ) internal returns (bool) { return _remove(set._inner, bytes32(uint256(uint160(value)))); } function remove( UintSet storage set, uint256 value ) internal returns (bool) { return _remove(set._inner, bytes32(value)); } function toArray( Bytes32Set storage set ) internal view returns (bytes32[] memory) { return _toArray(set._inner); } function toArray( AddressSet storage set ) internal view returns (address[] memory) { return _toArray(set._inner).toAddressArray(); } function toArray( UintSet storage set ) internal view returns (uint256[] memory) { return _toArray(set._inner).toUint256Array(); } function toArray( Bytes32Set storage set, uint256 startIndex, uint256 count ) internal view returns (bytes32[] memory array) { array = _toArray(set._inner, startIndex, count); } function toArray( AddressSet storage set, uint256 startIndex, uint256 count ) internal view returns (address[] memory array) { bytes32[] memory bytes32Array = _toArray(set._inner, startIndex, count); assembly { array := bytes32Array } } function toArray( UintSet storage set, uint256 startIndex, uint256 count ) internal view returns (uint256[] memory array) { bytes32[] memory bytes32Array = _toArray(set._inner, startIndex, count); assembly { array := bytes32Array } } function _valueAt( Set storage set, uint256 index ) private view returns (bytes32) { if (index >= set._values.length) revert EnumerableSet__IndexOutOfBounds(); return set._values[index]; } function _contains( Set storage set, bytes32 value ) private view returns (bool) { return set._indexes[value] != 0; } function _indexOf( Set storage set, bytes32 value ) private view returns (uint256) { unchecked { return set._indexes[value] - 1; } } function _length(Set storage set) private view returns (uint256) { return set._values.length; } function _add( Set storage set, bytes32 value ) private returns (bool status) { if (!_contains(set, value)) { set._values.push(value); set._indexes[value] = set._values.length; status = true; } } function _remove( Set storage set, bytes32 value ) private returns (bool status) { uint256 valueIndex = set._indexes[value]; if (valueIndex != 0) { unchecked { bytes32 last = set._values[set._values.length - 1]; // move last value to now-vacant index set._values[valueIndex - 1] = last; set._indexes[last] = valueIndex; } // clear last index set._values.pop(); delete set._indexes[value]; status = true; } } function _toArray( Set storage set ) private view returns (bytes32[] storage array) { array = set._values; } function _toArray( Set storage set, uint256 startIndex, uint256 count ) private view returns (bytes32[] memory array) { unchecked { uint256 size = _length(set); if (startIndex >= size) revert EnumerableSet__IndexOutOfBounds(); array = new bytes32[](Math.min(count, size - startIndex)); for (uint256 i; i < count; i++) { array[i] = set._values[startIndex + i]; } } } }