From 5fc64a37d753a3bb358f3500017944eec5eaa9f5 Mon Sep 17 00:00:00 2001 From: cairo Date: Tue, 23 Jul 2024 23:34:26 +0200 Subject: [PATCH] fix and regenreate --- contracts/utils/structs/Heap.sol | 2 +- scripts/generate/templates/Heap.js | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/contracts/utils/structs/Heap.sol b/contracts/utils/structs/Heap.sol index 0a3f207a7e8..963d6002389 100644 --- a/contracts/utils/structs/Heap.sol +++ b/contracts/utils/structs/Heap.sol @@ -31,7 +31,7 @@ import {Panic} from "../Panic.sol"; * * The structure is designed to perform the following operations with the corresponding complexities: * - * * peek (get the highest priority value in set): O(1) + * * peek (get the highest priority value in the set): O(1) * * insert (insert a value in the set): O(log(n)) * * pop (remove the highest priority value in set): O(log(n)) * * replace (replace the highest priority value in set with a new value): O(log(n)) diff --git a/scripts/generate/templates/Heap.js b/scripts/generate/templates/Heap.js index 18c8e7764a5..e179b927a25 100644 --- a/scripts/generate/templates/Heap.js +++ b/scripts/generate/templates/Heap.js @@ -34,7 +34,7 @@ import {Panic} from "../Panic.sol"; * * The structure is designed to perform the following operations with the corresponding complexities: * - * * peek (get the highest priority value in set): O(1) + * * peek (get the highest priority value in the set): O(1) * * insert (insert a value in the set): O(log(n)) * * pop (remove the highest priority value in set): O(log(n)) * * replace (replace the highest priority value in set with a new value): O(log(n))